An implementation of consistent hashing, a technique commonly used in distributed systems to map keys (such as data items or requests) to nodes (e.g., servers or storage units) in a way that minimizes disruptions when nodes are added or removed.
Ignore-file-respecting consistent hasher of directory contents
A consistent hashing library for Rust
Merkle Append-Only Log Tree (RFC 9162 §2.1)
Rust implementation of an optimized Sparse Merkle Tree
An extremely fast, high quality, platform-independent hashing algorithm.
A collection of data structures optimized for small-buffer scenarios that reside on the stack and seamlessly spill to the heap.
Concurrent, lock-free implementation of a consistent hashing ring data structure, supporting virtual nodes and keeping track of replication.
Portable, stable hashing traits for Rust.
GxHash non-cryptographic algorithm
Epoch Merkle Log — multi-algorithm append-only log with epoch semantics
A simple, append-only Merkle tree-based cryptographic accumulator
No description provided.
No description provided.