fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)

Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.

Rust library implementing xor-filters

Fast and space-efficient taxonomic classification of long reads

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

Production-ready Java implementation of the Xor Filter.

ribbon filter in golang(Go), practically smaller than Bloom and Xor

Cross-platform Binary FUSE 4-wise XOR filter builder for massive hex datasets, flexible compression modes, and release-ready CLI workflows

public key filter tool

A high-performance DuckDB extension providing probabilistic data structures for fast set membership testing and approximate duplicate detection. This extension implements state-of-the-art filter algorithms including Quotient filters, XOR filters, Binary Fuse filters, and soon Bloom filters.

Erlang NIF for Binary Fuse Filter. Fast and Smaller Than Xor Filters.

.NET Implementation of the XOR Filter

Leverage FastFilter xor-filter algorithm to create an index

Compact static XOR filter for high-throughput 64-bit lookups

C++17 Ribbon-Filter variant. 8.5 bits/key, 8.4 ns query, 0.78% FP on Apple M2. Beats Blocked Bloom on query latency AND FP rate at near-equal memory. NEON SIMD parity. Built in 24h.

xor filters implementation in Rust

Xor-filter

An abstraction layer around implementations of probabilistic membership testing

Visual calculator to evaluate Bloom, Cuckoo, and XOR filter trade-offs for embedded devices.