Space-efficient maplet data structures for approximate key-value mappings - Rust implementation with Python bindings
-
Updated
Oct 23, 2025 - Rust
Space-efficient maplet data structures for approximate key-value mappings - Rust implementation with Python bindings
Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves.
Space-efficient approximate mappings using perfect hash functions. Supports arbitrary function approximation (X→Y) with configurable storage (8/16/32/64-bit) and accuracy trade-offs.
Add a description, image, and links to the space-efficient topic page so that developers can more easily learn about it.
To associate your repository with the space-efficient topic, visit your repo's landing page and select "manage topics."