#merkle-tree #membership #non-membership

no-std indexed-merkle-tree

This crate provides an implementation of Indexed Merkle Trees, a version of Merkle trees that supports both membership and non-membership proofs

16 releases (4 breaking)

0.6.2 Aug 3, 2024
0.6.1 Jul 29, 2024
0.5.2 Jul 24, 2024
0.4.1 Jul 17, 2024
0.1.1 Jan 11, 2024

#67 in No standard library

Download history 479/week @ 2024-07-24 271/week @ 2024-07-31 31/week @ 2024-08-07 3/week @ 2024-08-14 9/week @ 2024-08-28 8/week @ 2024-09-04 118/week @ 2024-09-11 149/week @ 2024-09-18 87/week @ 2024-09-25 28/week @ 2024-10-02 48/week @ 2024-10-09 19/week @ 2024-10-16 8/week @ 2024-10-23 22/week @ 2024-10-30 16/week @ 2024-11-06

74 downloads per month

MIT license

61KB
977 lines

Indexed Merkle Tree

Overview

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.

You can view the changelog here.

Usage

tbd

Installation

cargo add indexed_merkle_tree

Contributing

Contributions are welcome! Please feel free to get in touch.

Dependencies

~2.7–4MB
~84K SLoC