-
pyo3
Bindings to Python interpreter
-
parquet
Apache Parquet implementation in Rust
-
usearch
Smaller & Faster Single-File Vector Search Engine from Unum
-
foldhash
A fast, non-cryptographic, minimally DoS-resistant hashing algorithm
-
lance
A columnar data format that is 100x faster than Parquet for random access
-
bloomfilter
Bloom filter implementation
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
libbpf-rs
safe, idiomatic, and opinionated wrapper around libbpf-sys
-
slatedb
A cloud native embedded storage engine built on object storage
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
orc-rust
Apache ORC file format using Apache Arrow in-memory format
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
mmdb
The storage engine behind vsdb — a pure-Rust LSM-Tree key-value store
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
rabbitmq-stream-client
client for RabbitMQ Stream
-
deduplicator
find,filter and delete duplicate files
-
tinysearch
A tiny search engine for static websites
-
roughdb
Embedded persistent key-value store — a LevelDB port to Rust with a compatible on-disk format
-
mokuroku
Secondary indices like PouchDB for RocksDB in Rust
-
axum_session
📝 Session management layer for axum that supports HTTP and Rest
-
finch
min-wise independent permutation locality sensitive hashing ('MinHashing') for genomic data and command-line utility for manipulation
-
nxv
Nix Version Index
-
uwheel
Embeddable Aggregate Management System for Streams and Queries
-
ntp-proto
ntpd-rs packet parsing and algorithms
-
rns-core
Wire protocol, transport routing, and link/resource engine for the Reticulum Network Stack
-
simdxml
SIMD-accelerated XML parser with full XPath 1.0 support
-
ntp_usg-client
NTP client library with sync, async (tokio/smol), and NTS support
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
lsmdb
efficient storage engine that implements the Log-Structured Merge Tree (LSM-Tree) data structure, designed specifically for handling key-value pairs
-
ctfs
Causal consistency at nanosecond latency. Algebraic invariants without coordination.
-
bonsai-index
A zero-dependency, embeddable, self-tuning spatial index for Rust
-
coordinode-lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs) — CoordiNode fork
-
xgrep-cli
Indexed search accelerator for compressed logs. Cached queries 100-1200x faster than zgrep.
-
clubcard
exact membership query filter for static sets
-
silk-graph
Merkle-CRDT graph engine for distributed, conflict-free knowledge graphs
-
foldhash-portable
A fast, non-cryptographic, minimally DoS-resistant hashing algorithm. Fork of foldhash with cross-platform hash stability.
-
argus-crawler
A production-ready web crawler capable of handling billions of URLs
-
sierradb
Core SierraDB event store library - embeddable high-performance event sourcing database
-
vicinity
Approximate nearest-neighbor search
-
aeternusdb
An embeddable, persistent key-value store built on an LSM-tree architecture
-
resq-dsa
Production-grade data structures and algorithms — zero external dependencies
-
skesa-rs
Rust port of NCBI's SKESA genome assembler
-
aisle
Metadata-driven Parquet pruning for Rust: Skip irrelevant data before reading
-
fides
cryptographic primitives
-
meshdb-bolt
Bolt wire protocol implementation (PackStream encoding, chunked framing, handshake, message types) for Mesh
-
sketch_oxide
State-of-the-art DataSketches library (2025) - UltraLogLog, Binary Fuse Filters, DDSketch, and more
-
raft-storage
Custom LSM-tree storage engine with WAL, MemTable, SSTables, bloom filters, and leveled compaction
-
sketches
Probabilistic data structures for scalable approximate analytics
-
avila-atom
Atomic computational structures - Option, Result, Vec, HashMap built from nucleus
-
poppy-filters
providing serializable Bloom filters implementations
-
kodegen_tools_citescrape
KODEGEN.ᴀɪ: Memory-efficient, Blazing-Fast, MCP tools for code generation agents
-
lance-index
Lance indices implementation
-
flowstats
Collection of stream analytics algorithms: cardinality, quantiles, frequency, sampling, and more
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
vigil-baseline
Linux file integrity monitor. Kernel-level filesystem watching, BLAKE3 hashing, HMAC-chained audit trail. Silent by default, local by design, deeply paranoid.
-
ruvector-solver-wasm
WASM bindings for RuVector sublinear-time solver
-
srcwalk
Tree-sitter indexed lookups — smart code reading for AI agents
-
stoolap
High-performance embedded SQL database with MVCC, time-travel queries, and full ACID compliance
-
anomstream-triage
SOC-opinionated triage layer (Platt calibration, SAGE attribution, alert clustering, feedback, audit) on top of anomstream-core
-
hash-iter
Iterator producing sequence of hash values for a given input (using double hashing technique)
-
probabilistic-rs
Probabilistic data structures in Rust
-
three-word-networking
Convert IP addresses to memorable, family-friendly word groups. IPv4 = 3 words, IPv6 = 6 or 9 words. Perfect reconstruction with human-readable vocabulary.
-
oxcache
A high-performance multi-level cache library for Rust with L1 (memory) and L2 (Redis) caching
-
runiq
An efficient way to filter duplicate lines from input, à la uniq
-
solstrale
A Path tracing library
-
apex-store-rs
A high-performance, embedded LSM-tree storage engine with SSTable V2 format, LZ4 compression, and Bloom Filters
-
xorfilter-rs
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
-
tokitai-context
Git-style parallel context management for AI agents
-
kmerutils
Kmer counting, hashing, sequence sketching
-
lavinhash
High-performance fuzzy hashing library implementing the DLAH (Dual-Layer Adaptive Hashing) algorithm
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
cuendillar
Embedded persistent key–value storage engine (LSM-tree based)
-
viator
A high-performance, memory-safe key-value store
-
turbokv
A fast, embedded key-value store with BTreeMap-like API
-
flashsieve
Storage-level pre-filtering for pattern matching — skip blocks that can't contain matches
-
reindeer2
k-mer quantification in large collections of samples
-
similarity-py
CLI tool for detecting code duplication in Python projects
-
dbsp
Continuous streaming analytics engine
-
raft-common
Shared types, configuration, error handling, and Prometheus metrics for the raft distributed KV store
-
rype
High-performance genomic sequence classification using minimizer-based k-mer sketching in RY space
-
quickbloom
An industry-grade, highly scalable Bloom filter with lock-free concurrency, blocked layout, and automatic persistence
-
ska
Split k-mer analysis
-
pdatastructs
probabilistic data structures
-
dexter-sentinel
Config-driven HTTP scraping API with Actix Web, optional Athena and Redis
-
velarixdb
An LSM Storage Engine focused on reduced IO amplification
-
ruvector-diskann
DiskANN/Vamana — SSD-friendly approximate nearest neighbor search with product quantization
-
saorsa-rsps
Root-Scoped Provider Summaries using Golomb Coded Sets for P2P DHT
-
resq-ai
Multi-provider LLM abstraction for ResQ developer tools
-
isso
A lightweight, self-hosted commenting service
-
liblevenshtein
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
-
velka
The Code Sin Judge - AST-powered secret scanner and security analyzer
-
aleph-filter
The Aleph Filter — an infinitely expandable probabilistic data structure with O(1) insert, query, and delete
-
roughly
Probabilistic data structures for Rust — because sometimes close enough is good enough
-
seerdb
Research-grade storage engine with learned data structures
-
similarity-core
Core library for code similarity detection using AST-based comparison
-
bastion-ai
Bastion — The open-source Production Kernel for Agentic AI. Multi-model consensus, self-healing, deterministic checkpoints, immutable audit trails, and pluggable compliance guardrails.
-
bloomlib
A space and time efficient Bloom Filter implementation in Rust
-
memory39
Temporal-priority memory system for AI agents
-
fast-html-parser
SIMD-optimized HTML parser for web scraping — fast tokenization, CSS selectors, XPath, encoding detection
-
disklru
experimental LRU store
-
faster_bloom
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
-
rust_cascade
bloom filter cascade implementation in Rust
-
oximedia-cache
High-performance caching infrastructure for OxiMedia: LRU, tiered multi-level, and predictive cache warming
-
kool_bloom_filter
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
-
moeix
Sub-millisecond code search via sparse trigram indexing
-
bigsig
Large-scale Sequence Search with BItsliced Genomic Signature Index (BIGSIG)
-
nexus-protocol
Integration protocols for Nexus - REST, MCP, UMICP
-
tensordb
— single-node, append-only, bitemporal ledger database with MVCC snapshot reads and SQL facet
-
llm-optimizer-processor
Data processing and transformation pipeline
-
sstable
Sorted String Tables, an on-disk format for storing immutable maps consisting of string,string pairs, and retrieving values by key efficiently. This crate also features bloom filters…
-
oxirs-star
RDF-star and SPARQL-star grammar support for quoted triples
-
grafeo-engine
Query engine and database management for Grafeo
-
tidesdb-rs
Rust wrapper for TidesDB, a fast and efficient key-value storage engine
-
bloomcalc
calculator for bloom filters
-
hightower-kv
Embedded log-structured key-value store with optional auth helpers
-
tidesdb
high-performance embeddable, durable, adaptive, and optionally cloud-native key-value storage engine
-
lsm_storage_engine
A high-performance, zero-dependency LSM-Tree storage engine in pure Rust
-
menhirkv
local KV store based on RocksDB
-
rustywallet-bloom
Fast and memory-efficient Bloom Filter with counting support for rustywallet
-
atomic-cuckoo-filter
Highly concurrent Cuckoo Filter
-
mnem-transport
Offline transport for mnem: CAR v1 export/import of content-addressed subtrees
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
snp
A fast, reliable pre-commit framework written in Rust with 100% Python pre-commit compatibility
-
zanzibar
A high-performance, Postgres-backed ReBAC (Relationship-Based Access Control) engine inspired by Google's Zanzibar paper
-
cvx-storage
Tiered storage engine (hot/warm/cold) with WAL and compaction
-
kotoba-db
High-performance embedded database for Kotoba ecosystem
-
dnsink
A high-performance DNS proxy with threat intelligence, Shannon-entropy tunneling detection, and Prometheus metrics
-
ofilter
fast thread-safe Bloom filter
-
broomfilter
A bloom filter that sweeps away your certainty. Probably.
-
kotoba-db-engine-lsm
LSM-Tree based database engine for KotobaDB
-
cipherstash-core
Shared code and core modules for CipherStash clients
-
ipfrs-storage
Storage backends and block management for IPFRS content-addressed system
-
bloomsrv
A REST API service exposing space and time efficient Bloom Filter implementation in Rust
-
dihardts_cstools
Collection of data structures and algorithms
-
redish
A lightweight in-memory key-value database
-
oximedia-dedup
Media deduplication and duplicate detection for OxiMedia
-
argus-dedupe
Content deduplication utilities for web crawling
-
parquet_aramid
Query engine using Parquet tables as a Key-Value store
-
extindex
Persisted immutable index
-
oxirs-tdb
Apache Jena TDB/TDB2 compatible RDF storage engine with B+Tree indexes
-
range-filters
High-performance range filter implementation - DIVA (VLDB 2025 Best Research Paper)
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
pithanos
Fast, lock-free probabilistic data structures for modern Rust
-
toolshed
Arena allocator and a handful of useful data structures
-
flash-fuzzy-core
High-performance fuzzy search using Bitap algorithm with bloom filter pre-filtering. Zero dependencies, no_std compatible.
-
expiring-atomic-filter
Thread-safe approximate membership filter with time-based expiration
-
srusty-files
A high-performance, cross-platform file search engine library with REST API
-
coredom
Core DOM structure and AST representation for MicroDOM
-
minikv
A production-grade distributed KV store with Raft consensus in ~1,500 lines
-
cbloom
Concurrent implementation of Bloom filters
-
fcdb-cas
Content-Addressable Storage implementation for FCDB
-
bloom-filter-yss
bloom filter for me or you
-
ghostwire-dtn
Delay-Tolerant Networking with Spray-and-Wait + PRoPHET epidemic routing for mesh networks
-
lsm
log-structured merge trees in pure Rust
-
oxify-authz
ReBAC (Relationship-Based Access Control) authorization engine - Google Zanzibar implementation
-
tinysearch-engine
A tiny search engine for static websites
-
neutrondb
log-structured merge-tree key-value store for any implemented data type
-
otters-rs
High-performance vector search with metadata filtering
-
bfield
B-field datastructure implementation in Rust
-
tinysearch-shared
Shared libraries for tinysearch - a tiny search engine for static websites
-
raindb
A persistent key-value store based on an LSM tree implemented in Rust
-
Xorfilter
No alloc membership approximation
-
vibesql-executor
Query execution engine for vibesql SQL database
-
shardex
A high-performance memory-mapped vector search engine with ACID transactions and incremental updates
-
auradb
High-performance Rust storage engine with WAL-time KV separation, RL-driven compaction, and learned indexes
-
wimbd
A CLI for inspecting and analyzing large text datasets
-
wisard
nets implementation in Rust
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
mmap-bitvec
working with bit-vectors backed by memory-mapped files
-
sbbf-rs
Split block bloom filter implementation
-
co-primitives
COKIT Primitives used throughout the
co-sdkandco-apiand Core implementations -
cascara
TinyLFU cache
-
expandable-cuckoo-filter
A high-performance, persistent, and auto-expanding Cuckoo Filter with deterministic orthogonality
-
sbbf-rs-safe
Split block bloom filter implementation
-
oomfi
A minimal Bloom Filter implementation in Rust
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
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.
-
bloomy
Bloom filter using only two hash functions
-
bloom-filters
Rust port of https://github.com/tylertreat/BoomFilters
-
gauze
Probabilistic set membership filters with a simple interface
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
ordbog
lossy dictionary codes for accelerated scans
-
wnfs-namefilter
Bloom filter for the Webnative Filesystem
-
bloomz
A fast, flexible Bloom filter library for Rust with parallel operations support
-
amaters-core
Core kernel for AmateRS - Fully Homomorphic Encrypted Database
-
mqf
MQF, Mixed Quotient Filter, is a variant of CQF (Counting Quotient Filter)
-
probably
various approximate computing algorithms
-
rust-bloomfilter
bloom filter implementation in Rust programming language
-
riblt
Rateless Invertable Bloom Lookup Table (RIBLT) data structure
-
glaredb_ext_parquet
Apache Parquet extension for GlareDB. Originally forked from github.com/apache/arrow-rs
-
anomstream-core
Core streaming anomaly detectors + companion primitives (Random Cut Forest, per-feature EWMA / CUSUM, drift detectors, streaming stats) — part of the anomstream toolkit
-
slung-macros
An abstraction library for interacting with the Slung runtime
-
blewm
Bloom Filter that Bloo(m) my Mind
-
alloy-consensus
Ethereum consensus interface
-
boost_bloom
Boost C++ library boost_bloom packaged using Zanbil
-
grafeo-core
Core graph models, indexes, and execution primitives for Grafeo
-
tinysearch-cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
librualg
Collection of basic algorithms for everyday development
-
bloom_filter_plus
rust_bloom_filter
-
ethbloom
Ethereum bloom filter
-
bloom-cli
A naive implementation of a CLI bloom filter that stores views of files
-
compressed_map
'Static functions': compressed maps with the keys removed
-
bitbloom
A no_std Bloom filter implementation
-
bfilters
bloom filter implementation in Rust
-
bigsi_rs
A in-memory implementation of a BIGSI-like data structure
-
bloom_filter_plush
rust_bloom_filter
-
textdb
A high performance read only text database
-
bloomfilter-rust
A bloomfilter implementation in Rust
-
bloomur
Bloom filter for databases
-
iron_rose
Invertable Bloom Filters & Strata Estimators as found in https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.pdf
-
frbf
robust, and efficient implementation of the Bloom Filter data structure in Rust
-
light-batched-merkle-tree
Batch Merkle tree implementation
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
rusty-leveldb-arc
A compatible re-implementation of LevelDB in Rust (But use Arc instead of Rc)
-
pbloom
A portable bloom filter implementation in Rust
-
bugu
Cuckoo Filter: Practically Better Than Bloom
-
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
grafite
Range Filter
-
route_verification_bloom
Parse RPSL in the IRR to verify observed BGP routes
-
runiq-lib
An efficient way to filter duplicate lines from input, à la uniq
-
aabel-bloom-rs
implements the Bloom filter
-
rs-bucket-filter
Skips slow scans using cache, bloom filter,
-
zksync_storage
ZKsync RocksDB storage interfaces
-
miraland-bloom
Miraland bloom filter
-
blfilter
Bloom filter implementation using farmhash
-
kamilata
A Peer-to-Peer Search Engine System (based on libp2p)
-
yz-bll32
backend for bloom-like filter for partitions and tags of content-addressed data
-
bloomfx
Bloom filter implementation backed by fxhash
-
pezpallet-revive
FRAME pezpallet for PolkaVM contracts
Try searching with DuckDuckGo or on crates.io.