Struct MerkleTree

pub struct MerkleTree<H>
where
    H: Hasher,
{
    pub height: usize,
    pub capacity: usize,
    pub canopy_depth: usize,
    pub layers: Vec<Vec<[u8; 32]>>,
    pub roots: Vec<[u8; 32]>,
    pub rightmost_index: usize,
    pub sequence_number: usize,
    /* private fields */
}

Fields

height: usize

capacity: usize

canopy_depth: usize

layers: Vec<Vec<[u8; 32]>>

roots: Vec<[u8; 32]>

rightmost_index: usize

sequence_number: usize

Implementations

impl<H> MerkleTree<H>

where H: Hasher,

pub fn new(height: usize, canopy_depth: usize) -> Self

pub fn canopy_size(&self) -> usize

Number of nodes to include in canopy, based on canopy_depth.

pub fn append(&mut self, leaf: &[u8; 32]) -> Result<(), HasherError>

pub fn append_batch(&mut self, leaves: &[&[u8; 32]]) -> Result<(), HasherError>

pub fn update( &mut self, leaf: &[u8; 32], leaf_index: usize, ) -> Result<(), ReferenceMerkleTreeError>

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

pub fn get_path_of_leaf( &self, index: usize, full: bool, ) -> Result<BoundedVec<[u8; 32]>, BoundedVecError>

pub fn get_proof_of_leaf( &self, index: usize, full: bool, ) -> Result<BoundedVec<[u8; 32]>, BoundedVecError>

pub fn get_canopy(&self) -> Result<BoundedVec<[u8; 32]>, BoundedVecError>

pub fn leaf(&self, leaf_index: usize) -> [u8; 32]

pub fn get_leaf_index(&self, leaf: &[u8; 32]) -> Option<usize>

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

pub fn verify( &self, leaf: &[u8; 32], proof: &BoundedVec<[u8; 32]>, leaf_index: usize, ) -> Result<bool, ReferenceMerkleTreeError>

Trait Implementations

impl<H> Clone for MerkleTree<H>

where H: Hasher + Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H> Debug for MerkleTree<H>

where H: Hasher + Debug,

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

Formats the value using the given formatter.