A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
-
Updated
Jun 6, 2026 - C++
A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
A pure-Rust implementation of Bulletproofs using Ristretto.
Haskell Implementation of Cuckoo Filters
This repo is for Distributed Set-Based Observers Using Diffusion Strategy
Comparison between different methods to simplify sequence data
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
ZK set membership proofs by Groth and Kohlweiss (eprint 2014/764)
Cuckoo Filter is a thread safe probability filter that performs set membership tests.
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.
Using Levi to optimize randomize algorithms for set membership and tasks in similar vein
Add a description, image, and links to the set-membership topic page so that developers can more easily learn about it.
To associate your repository with the set-membership topic, visit your repo's landing page and select "manage topics."