3 ms·
You are doing hashes over hashes, even if you cut the hashes to 4bytes you are going to hash them again. you have to skip that second hashing and you'll get a
by daedalus2027 8y ago
You are doing hashes over hashes, even if you cut the hashes to 4bytes you are going to hash them again.
you have to skip that second hashing and you'll get a more decent performance. since you are alreading dealing with hashes.
Check my implementation: https://github.com/daedalus/bloomHIBP https://github.com/daedalus/bloomHIBP
https://github.com/daedalus/fastBloomFilter https://github.com/daedalus/fastBloomFilter
With a 512MB bloom filter I can get 0 FP.
- Buge 8y agoI don't see how it's possible to have 0 false positives. I thought it was inherent in the nature of a bloom filter to have false positives. This site is a false positive rate calculator: https://hur.st/bloomfilter/?n=500M&p=1000&m=&k= https://hur.st/bloomfilter/?n=500M&p=1000&m=&k=