Go package implementing Bloom filters, used by many important systems
A fast Bloom filter implementation in Rust
Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
Go library implementing binary fuse and xor filters
Package ring provides a high performance and thread safe Go implementation of a bloom filter.
Fastest bloom filter in C++/Go/Rust/Java/C#
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Fast Approximate Membership Filters (C++)
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
