Expand description
merkle implements a Merkle Tree in Rust.
Structs§
- Leaves
Into Iterator - An iterator over the leaves of a
Tree. - Leaves
Iterator - An borrowing iterator over the leaves of a
Tree. Adapted from http://codereview.stackexchange.com/q/110283. - Merkle
Tree - A Merkle tree is a binary tree, with values of type
Tat the leafs, and where every internal node holds the hash of the concatenation of the hashes of its children nodes. - Proof
- An inclusion proof represent the fact that a
valueis a member of aMerkleTreewith root hashroot_hash, and hash functionalgorithm.
Traits§
- Hashable
- The type of values stored in a
MerkleTreemust implement this trait, in order for them to be able to be fed to a RingContextwhen computing the hash of a leaf.