Struct MerkleTree 

pub struct MerkleTree { /* private fields */ }

Merkle tree for computing state roots

Implementations

impl MerkleTree

pub fn new() -> Self

Create an empty Merkle tree

pub fn add_leaf(&mut self, data: &[u8])

Add a leaf to the tree

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

Compute the root hash

pub fn len(&self) -> usize

Get number of leaves

pub fn is_empty(&self) -> bool

Check if tree is empty

pub fn clear(&mut self)

Clear all leaves

pub fn generate_proof( &mut self, leaf_index: usize, ) -> Option<Vec<([u8; 32], bool)>>

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

Returns a vector of sibling hashes from leaf to root. Each entry is (sibling_hash, is_left) where is_left indicates the sibling is on the left side of the pair.

pub fn verify_proof( leaf_hash: &[u8; 32], proof: &[([u8; 32], bool)], expected_root: &[u8; 32], ) -> bool

Verify a Merkle inclusion proof for a given leaf hash against a root.

proof is a sequence of (sibling_hash, is_left) from leaf to root.

Trait Implementations

impl Default for MerkleTree

fn default() -> Self

Returns the “default value” for a type.