Hacker News Reader

Loading everything into memory at once shouldn't be necessary to produce a hash of the entire input. All of the hash functions currently supported allow for incremental hashing. That means you can hash in blocks instead of all at once.

View on HN

The input still needs to be cached for eventual output in case the hash matches I assume.

More importantly, so nothing is output if the hash doesn't match.

In that case, you could still cache if you want but at least you now have the option to manage your memory instead of always crashing with large input

Reply on news.ycombinator.com