Struct MerkleTree 

pub struct MerkleTree {
    pub nodes: Vec<[u8; 32]>,
    pub leaf_count: usize,
    pub root: [u8; 32],
}

Fields

nodes: Vec<[u8; 32]>

All nodes: leaves first, then internal nodes bottom-up. Root is last.

leaf_count: usize

root: [u8; 32]

Implementations

impl MerkleTree

pub fn build(leaves: &[&[u8]]) -> Self

Build Merkle tree from block data slices.

pub fn verify_leaf(&self, index: usize, data: &[u8]) -> bool

Verify a single leaf at index against stored hash.

pub fn proof(&self, index: usize) -> Vec<([u8; 32], bool)>

Get Merkle proof path for a leaf. Returns Vec of (sibling_hash, is_right) pairs from leaf to root.

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

Verify a Merkle proof against a known root.

pub fn to_bytes(&self) -> Vec<u8>

Serialize tree to bytes. Format: [u32 leaf_count][u32 node_count][nodes: 32 bytes each]

pub fn from_bytes(data: &[u8]) -> Option<Self>

Deserialize from bytes.