News for hackers. Stuff that matters.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by zokier on Sunday August 06, 2017 @05:50AM (#14940646)
So would this be a good structure to store the recently discussed password hash dump, basically a fixed set of 300 million SHA1-sums where the only interesting operation is checking if the sum is or is not contained in the set?
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by lord_jim on Sunday August 06, 2017 @03:47PM (#14943078)
It would probably be better to use a trie directly, maybe a radix trie or a b-trie.