Re:Why Searching Through 500M Pwned Passwords Is So Quick
by bpicolo on Tuesday February 27, 2018 @08:18AM
(#16473072)
Wouldn't be useful for the range queries, all possible prefixes return data
[ Parent
| on HN ]
Re:Why Searching Through 500M Pwned Passwords Is So Quick
by zcam on Tuesday February 27, 2018 @09:15AM
(#16473481)
True, I didn't see they allow to query on ranges. I guess you might be able build something on a BloomFilter Trie for that, but that might be pushing it.
But for one of the calls (checking a whole password against what's stored), which probably accounts for most of the usage of the API, a bloom filter seems like a perfect fit.
Re:Why Searching Through 500M Pwned Passwords Is So Quick
by bpicolo on Tuesday February 27, 2018 @09:25AM
(#16473559)
Doesn't seem particularly necessary though yeah? Bloom filters are super useful when the cost of doing the computation for the actual lookup is high, but in this case it's a single key-value lookup. That's about as cheap as an operation can possibly get.