[asharp]

Cool speed hacks.

An an improvement though, you only need two independent hash functions to run your bloom filter[1]. Strangely enough, this isn't well known and as such isn't implemented anywhere near as often as it should be (ie. it's not implemented here).

[1] www.eecs.harvard.edu/~kirsch/pubs/bbbf/rsa.pdf

[zheng]

I was just talking with a colleague the other day about how to simplify the number of hash functions needed for a bloom filter. He recommended something similar to what the paper describes, but we both dismissed it as "probably won't work". Just goes to show you that sometimes the simple solution is worth closer examination. Thanks for the paper!