bloomd

Neat! Because it's a thing I do[1], the hash algorithms in use: Fleur (and DCSO/bloom and DCSO/flor): fnv bloomd: a combination of SpookyHash and murmur[2] [1]: https://llimllib.github.io/bloomfilter-tutorial/ (I'll update it to add bloomd and spooky) [2]: https://github.com/armon/bloomd/blob/23c19a7f5cbb35d7c3d970b... [3]: I have a vague recollection of somebody telling me why combining two hashes in the way bloomd does for k >= 4 is a good idea but I can't remember - anybody have a good reference for me to link to? (edit: nvm, I already link the paper on my page! sheesh)

If you want a networked version (note: not based on Fleur): https://github.com/armon/bloomd In the source there is a "libbloom" as well that you could copy directly into your codebase if you wanted an embedded version. The networked version has a simple Redis-like text protocol so you can just use `telnet` to play around with it, too. Also written in C, with great performance (no comparison to this one, I haven't done it), and has been used in production by many companies for many years (since ~2012 or 2013). Just pointing out other implementations if anyone is curious!