fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)
-
Updated
Mar 25, 2026
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.
Erlang NIF for Binary Fuse Filter. Fast and Smaller Than Xor Filters.
.NET Implementation of the XOR Filter
ribbon filter in golang(Go), practically smaller than Bloom and Xor
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.
Cross-platform Binary FUSE 4-wise XOR filter builder for massive hex datasets, flexible compression modes, and release-ready CLI workflows
Leverage FastFilter xor-filter algorithm to create an index
An abstraction layer around implementations of probabilistic membership testing
Add a description, image, and links to the xor-filter topic page so that developers can more easily learn about it.
To associate your repository with the xor-filter topic, visit your repo's landing page and select "manage topics."