rs-merkle-tree

Fixed depth ensures all proofs have a consistent size equal to the tree depth, simplifying verification and scaling for large datasets, as highlighted in the features.

Stores intermediate leaves, enabling Merkle proof generation in microseconds; benchmarks show proof times as low as 560.990 ns with memory store.

Supports configurable storage backends (sled, RocksDB, SQLite) and hash functions (Keccak256, Poseidon), allowing customization for specific cryptographic needs.

Leaves are added sequentially and cannot be modified, ensuring data integrity for applications like audit logs or blockchain, as per the philosophy.