Struct sparse_merkle_tree::merkle_proof::MerkleProof

pub struct MerkleProof { /* private fields */ }

Implementations

impl MerkleProof

pub fn new(leaves_bitmap: Vec<H256>, merkle_path: Vec<MergeValue>) -> Self

Create MerkleProof leaves_bitmap: leaf bitmap, bitmap.get_bit(height) is true means there need a non zero sibling in this height proof: needed sibling node hash

pub fn take(self) -> (Vec<H256>, Vec<MergeValue>)

Destruct the structure, useful for serialization

pub fn leaves_count(&self) -> usize

number of leaves required by this merkle proof

pub fn leaves_bitmap(&self) -> &Vec<H256>

return the inner leaves_bitmap vector

pub fn merkle_path(&self) -> &Vec<MergeValue>

return sibling node hashes

pub fn compile(self, leaves_keys: Vec<H256>) -> Result<CompiledMerkleProof>

pub fn compute_root<H: Hasher + Default>(
    self,
    leaves: Vec<(H256, H256)>
) -> Result<H256>

Compute root from proof leaves: a vector of (key, value)

return EmptyProof error when proof is empty return CorruptedProof error when proof is invalid

pub fn verify<H: Hasher + Default>(
    self,
    root: &H256,
    leaves: Vec<(H256, H256)>
) -> Result<bool>

Verify merkle proof see compute_root_from_proof

Trait Implementations

impl Clone for MerkleProof

fn clone(&self) -> MerkleProof

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleProof

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

Formats the value using the given formatter.

impl PartialEq<MerkleProof> for MerkleProof

fn eq(&self, other: &MerkleProof) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for MerkleProof

impl StructuralEq for MerkleProof

impl StructuralPartialEq for MerkleProof