-
cardinality-estimator
estimating the cardinality of distinct elements in a stream or dataset
-
cardinality-estimator-safe
Estimate the cardinality of distinct elements in a stream or dataset with no unsafe code
-
ngboost-rs
Natural Gradient Boosting for Probabilistic Prediction - A Rust implementation of NGBoost
-
datasketches
A software library of stochastic streaming algorithms (a.k.a. sketches)
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
flowstats
Collection of stream analytics algorithms: cardinality, quantiles, frequency, sampling, and more
-
sketch_oxide
State-of-the-art DataSketches library (2025) - UltraLogLog, Binary Fuse Filters, DDSketch, and more
-
hyperloglogplus
HyperLogLog implementations
-
hyperloglockless
High-performance HyperLogLog with bias correction and full concurrency support
-
prollytree
A prolly (probabilistic) tree for efficient storage, retrieval, and modification of ordered data
-
ultraloglog
algorithm
-
pdatastructs
probabilistic data structures
-
expiring-bloom-rs
A time-decaying Bloom filter implementation with multiple storage backends
-
probabilistic_bisector
bisection for one-dimensional functions in the presence of noise
-
hyperloglog-rs
HyperLogLog trying to be parsimonious with memory
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
rustywallet-bloom
Fast and memory-efficient Bloom Filter with counting support for rustywallet
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
ad-ess
Distribution matching for arbitrary distributions with low rate-loss
-
bitbloom
A no_std Bloom filter implementation
-
nano-hyperloglog
A Redis-compatible HyperLogLog service with pluggable storage backends
-
orthogonal-cuckoo-filter-mesh
A distributed consensus layer for uncorrelated false positives using orthogonal cuckoo filters
-
geo_filters
Geometric filters for set cardinality estimation
-
rsess
enumerative sphere shaping algorithm for probabilistic constellation shaping
-
bloomz
A fast, flexible Bloom filter library for Rust with parallel operations support
-
aabel-multihash-rs
extends Hasher trait. The added functionality allows users to get sequeces of hash values. It can be used inside of implementations of probabilistic data structures such bloom filter or count-min.
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
minhash-rs
MinHash trying to be parsimonious with memory
-
dsrs
wrapper for Apache DataSketches
-
hyperbitbit
data structure
-
ferric
A Probablistic Programming Language with a declarative syntax for random variables
-
streamhist
streaming histogram
-
aabel-bloom-rs
implements the Bloom filter
-
kmerHLL
kmer counting, hyperloglog, probabilistic counting
-
aabel-hashmap-rs
implements extensions for HashMap
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
plum
Probabilistic data structures for rust
-
dispo
Disposable email checker utilizing a Bloom filter
-
lace-cli
A probabilistic cross-categorization engine
-
uddsketch
histogram
-
bloom-filter-wbj
Space efficient probabilistic hash set
Try searching with DuckDuckGo.