Hacker News Reader

To make a sorted hash list as space efficient as a bloomfilter you need compress it by taking advantage of the shared prefix of consecutive hashes.

you're right, although I don't think compression would save a ton of space since the hashes are random. Might save a bit or maybe 2 per entry

Would that be a trie?

Probably some sort of radix tree (which is a kind of trie) would be best.