The Indexed Merkle Tree crate provides a robust implementation of indexed Merkle trees in particular described for Transparency Dictionaries that can be used for various cryptographic applications. Compared to normal Merkle trees, this implementation provides proofs for both membership and non-membership, ensuring uniqueness of leaf nodes.
- Efficient membership and non-membership proof generation.
- Update and insertion operations with verifiable proofs.
- Tree size doubling for dynamic data insertion.
- High integrity and order verification in data structures.
tbd
cargo add indexed_merkle_treeContributions are welcome! Please feel free to get in touch.