merkle implements a Merkle Tree in Rust.
An iterator over the leaves of a
An borrowing iterator over the leaves of a
Adapted from http://codereview.stackexchange.com/q/110283.
A Merkle tree is a binary tree, with values of type
T at the leafs,
and where every internal node holds the hash of the concatenation of the hashes of its children nodes.
An inclusion proof represent the fact that a
value is a member
MerkleTree with root hash
root_hash, and hash function
The type of values stored in a
MerkleTree must implement
this trait, in order for them to be able to be fed
to a Ring
Context when computing the hash of a leaf.