Struct MerkleTree 

pub struct MerkleTree<T: Serialize> { /* private fields */ }

A Merkle tree.

Examples

use hash_based_signatures::merkle_tree::MerkleTree;

let elements: Vec<u8> = (0..128).collect();
let tree = MerkleTree::new(&elements);
let proof = tree.get_proof(17);
assert!(proof.verify(*tree.get_root_hash(), &17));

Implementations

impl<T: Serialize + Debug> MerkleTree<T>

pub fn new(elements: &[T]) -> MerkleTree<T>

Construct a new Merkle tree from a list of elements.

A single element is of type Vec<u8>, so any complex data structure has to be serialized to a variable-length byte array. The tree owns the values.

Panics

Panics if the number of elements is not a power of two or if the provided data can’t be serialized.

pub fn get_root_hash(&self) -> &[u8; 32]

Get the root hash of the tree.

pub fn get_proof(&self, i: usize) -> MerkleProof<T>

Get a Merkle proof for a given index i.

Trait Implementations

impl<T: Clone + Serialize> Clone for MerkleTree<T>

fn clone(&self) -> MerkleTree<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Serialize + Debug> Debug for MerkleTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.