🔬 Assemble large genomes using short reads
A simple and small bloom filter implementation in plain C.
Interesting (non-cryptographic) hashes implemented in pure Python.
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
高性能的分布式的专门空间优化的 Bitmap 服务, 高效检查数据是否存在,日活统计，签到，打点等等
🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
Java Client for RedisBloom probabilistic module
A Minimal Perfect Hash Function Library
Verified hash-based AMQ structures in Coq
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Probabilistic data structures for processing continuous, unbounded streams.
🌺 A pure Elixir implementation of Scalable Bloom Filters
C++ Bloom Filter Library
Probabilistic Datatypes Module for Redis
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
🎯 Bloom filters for C++11
Fast, reliable cuckoo hash table for Node.js.
A simple but fast bloomfilter written in Python
Bloomfilter written in Golang, includes rotation and RPC
Analyse a forensic target (such as a directory) to find and report files found and not found from CIRCL hashlookup public service - https://circl.lu/services/hashlookup/
Fast hash function for DNA sequences
A Golomb Coded Set implementation in Rust
Very fast, high-quality hash function (non-cryptographic, C) + PRNG
Simplistic (but fast) java implementation of a bloom filter.
Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
An in-memory bloom filter with persistence and HTTP interface
A Bloom Filter implementation in Clojure
ganon classifies short DNA sequences against large sets of genomic sequences efficiently, with download and update of references (RefSeq/Genbank), taxonomic (NCBI/GTDB) and hierarchical classification, customized reporting and more
Probabilistic data structures in Pharo Smalltalk.
Privacy-preserving Firefox extension linking to Hacker News discussion; built with Bloom filters and WebAssembly
High-speed Bloom filters and taffy filters for C, C++, and Java