Struct MerkleTree 

pub struct MerkleTree { /* private fields */ }

RFC 6962-compatible Merkle tree.

Implementations

impl MerkleTree

pub fn from_leaves<T>(leaves: &[T]) -> Result<MerkleTree, Error>

where T: AsRef<[u8]>,

Build a Merkle tree from leaf data.

Returns Err(Error::EmptyTree) if the slice is empty.

pub fn from_hashes(leaf_hashes: Vec<Hash>) -> Result<MerkleTree, Error>

Build a Merkle tree from pre-hashed leaves.

pub fn leaf_count(&self) -> usize

Get the number of leaves.

pub fn root(&self) -> Hash

Get the root hash.

pub fn consistency_proof(&self, old_size: usize) -> Result<Vec<Hash>, Error>

Generate an RFC 6962 consistency proof (RFC 9162 section 2.1.4.1) showing that the tree over the first old_size leaves is a prefix of this tree.

The proof for old_size == leaf_count() is empty. Returns Err(Error::InvalidProofIndex) when old_size is zero or exceeds the current leaf count.

pub fn consistency_proof_between( &self, old_size: usize, new_size: usize, ) -> Result<Vec<Hash>, Error>

Generate an RFC 6962 consistency proof between two prefixes of this tree without rebuilding the shorter tree.

pub fn prefix_root(&self, tree_size: usize) -> Result<Hash, Error>

Return the root of the first tree_size leaves without rebuilding that prefix.

pub fn inclusion_proof(&self, leaf_index: usize) -> Result<MerkleProof, Error>

Generate an inclusion proof for a leaf at the given index.

pub fn inclusion_proof_at_size( &self, leaf_index: usize, tree_size: usize, ) -> Result<MerkleProof, Error>

Generate an inclusion proof within a prefix of this tree without rebuilding that prefix.

Trait Implementations

impl Clone for MerkleTree

fn clone(&self) -> MerkleTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleTree

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

Formats the value using the given formatter.