Struct Tree 

pub struct Tree<H: Hasher> { /* private fields */ }

Constructed Binary Merkle Tree (BMT).

Implementations

impl<H: Hasher> Tree<H>

pub fn root(&self) -> H::Digest

Returns the root of the tree.

pub fn proof(&self, position: u32) -> Result<Proof<H::Digest>, Error>

Generates a Merkle proof for the leaf at position.

This is a single-element multi-proof, which includes the minimal siblings needed to reconstruct the root.

pub fn range_proof( &self, start: u32, end: u32, ) -> Result<RangeProof<H::Digest>, Error>

Generates a Merkle range proof for a contiguous set of leaves from start to end (inclusive).

The proof contains the minimal set of sibling digests needed to reconstruct the root for all elements in the range. This is more efficient than individual proofs when proving multiple consecutive elements.

pub fn multi_proof(&self, positions: &[u32]) -> Result<Proof<H::Digest>, Error>

Generates a Merkle proof for multiple non-contiguous leaves at the given positions.

The proof contains the minimal set of sibling digests needed to reconstruct the root for all elements at the specified positions. This is more efficient than individual proofs when proving multiple elements because shared siblings are deduplicated.

Positions are sorted internally; duplicate positions will return an error.

Trait Implementations

impl<H: Clone + Hasher> Clone for Tree<H>

where H::Digest: Clone,

fn clone(&self) -> Tree<H>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher> Debug for Tree<H>

where H::Digest: Debug,

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

Formats the value using the given formatter.