Struct SparseMerkleTree

pub struct SparseMerkleTree<H> {
    pub nodes: Vec<H>,
    pub non_empty_leaves_count: u32,
}

Assume the hash algorithm is a + b.

Tree

[10]
[0,10]
[0,0,3,7]
[0,0,0,0,1,2,3,4]

Merge steps

[0,0,0,0,1,2,3,4]
[0,0,0,3+4,1,2,3,4]
[0,0,1+2,3+4,1,2,3,4]
[0,1+2+3+4,1+2,3+4,1,2,3,4]

Fields

nodes: Vec<H>

non_empty_leaves_count: u32

Implementations

impl<H> SparseMerkleTree<H>

where H: Clone + Debug + Default + PartialEq,

pub fn new<L, M>(leaves: L) -> Self

where L: Iterator<Item = H>, M: Merge<Item = H>,

pub fn leaves_count(&self) -> u32

pub fn non_empty_leaves_count(&self) -> u32

pub fn root(&self) -> H

pub fn proof_of<I>(&self, indices: I) -> Proof<H>

where I: AsRef<[u32]>,

Indices

pub fn verify<M>(proof: Proof<H>) -> bool

where M: Merge<Item = H>,