Hashing-function agnostic Cuckoo filters for Redis

• UpdatedMar 5, 2020
• Zig

Simple probabilistic data structures

• UpdatedDec 15, 2025
• Rust

Probabilistic Data Structures and Algorithms in Python

• UpdatedFeb 24, 2020
• Python

🌺 A pure Elixir implementation of Scalable Bloom Filters

• UpdatedJun 8, 2021
• Elixir

Bloomfilter written in Golang, includes rotation and RPC

• UpdatedAug 26, 2025
• Go

A compressed, sparse cuckoo filter (seehttps://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)

• UpdatedDec 16, 2020
• C++

Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.

• UpdatedAug 14, 2024
• Rust

Production-ready Cuckoo Filters for any C ABI compatible target.

• UpdatedJan 10, 2023
• Zig

Cuckoo Filter: Practically better than bloom filter

• UpdatedMay 2, 2019
• Go

A probabilistic data structures library for C#

• UpdatedMay 14, 2021
• C#

🐦 Cuckoo Filters in Elixir

• UpdatedJun 8, 2021
• Elixir

Fast Bloom filter with concurrent accessibility, powered by :atomics module.

• UpdatedDec 8, 2020
• Elixir

An in-memory bloom filter with persistence and HTTP interface

• UpdatedSep 30, 2025
• C

Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.

• UpdatedDec 2, 2021
• C

Probabilistic Data Structure Template Library

• UpdatedJun 18, 2020
• C++

A family of randomized, history-independent search tree data structures

• UpdatedAug 27, 2024
• TypeScript

A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.

• UpdatedMar 5, 2022
• Go

Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)

• UpdatedNov 30, 2025
• C++

🦀 Bloom filter implementation in Rust 🦀

• UpdatedNov 18, 2020
• Rust

Production-ready Java implementation of the Xor Filter.

• UpdatedJan 23, 2020
• Java