Struct SparseMerkleTree

pub struct SparseMerkleTree<const BITS: u8>;

Sparse Merkle Tree variant that has hash-sized leaves, with most leaves being empty (have value [0u8; 32]).

In contrast to a proper Balanced Merkle Tree, constant BITS here specifies the max number of leaves hypothetically possible in a tree (2^BITS, often untractable), rather than the number of non-empty leaves actually present.

Implementations

impl<const BITS: u8> SparseMerkleTree<BITS>

where [(); { _ }]:,

pub fn compute_root_only<'a, Iter>(leaves: Iter) -> Option<[u8; 32]>

where [(); { _ }]:, Iter: IntoIterator<Item = Leaf<'a>> + 'a,

Compute Merkle Tree root.

If provided iterator ends early, it means the rest of the leaves are empty.

There must be no Leaf::Occupied for empty/unoccupied leaves or else they may result in invalid root, Leaf::Empty must be used instead.

Returns None if too many leaves were provided.

pub fn verify( root: &[u8; 32], proof: &[[u8; 32]; { _ }], leaf_index: u128, leaf: [u8; 32], ) -> bool

where [(); { _ }]:,

Verify previously generated proof.

Leaf can either be leaf value for a leaf that is occupied or [0; 32] for a leaf that is supposed to be empty.

Trait Implementations

impl<const BITS: u8> Debug for SparseMerkleTree<BITS>

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

Formats the value using the given formatter.