So would this be a good structure to store the recently discussed password hash ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		zokier on Aug 6, 2017 \| parent \| context \| favorite \| on: Optimizing Hash-Array Mapped Tries for Fast Immuta... 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?

lord_jim on Aug 6, 2017 [–]

It would probably be better to use a trie directly, maybe a radix trie or a b-trie.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact