Probabilistic data structures for processing continuous, unbounded streams.

A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!

A probabilistic data structures library for C#

A class library implementing probabilistic data structures in .NET

A counting bloom filter with probabilistic deletion capabilities also allowing a risky deletion which may lead to false negatives if not carefully used.