Struct MerkleProof

pub struct MerkleProof<T, M> { /* private fields */ }

Implementations

impl<T: Clone + PartialEq, M: Merge<Item = T>> MerkleProof<T, M>

pub fn new(mmr_size: u64, proof: Vec<T>) -> Self

pub fn mmr_size(&self) -> u64

pub fn proof_items(&self) -> &[T]

pub fn calculate_root(&self, leaves: Vec<(u64, T)>) -> Result<T>

pub fn calculate_root_with_new_leaf( &self, leaves: Vec<(u64, T)>, new_pos: u64, new_elem: T, new_mmr_size: u64, ) -> Result<T>

from merkle proof of leaf n to calculate merkle root of n + 1 leaves. by observe the MMR construction graph we know it is possible. https://github.com/jjyr/merkle-mountain-range#construct this is kinda tricky, but it works, and useful

pub fn verify(&self, root: T, leaves: Vec<(u64, T)>) -> Result<bool>

pub fn verify_incremental( &self, root: T, prev_root: T, incremental: Vec<T>, ) -> Result<bool>

Verifies a old root and all incremental leaves.

If this method returns true, it means the following assertion are true:

• The old root could be generated in the history of the current MMR.
• All incremental leaves are on the current MMR.
• The MMR, which could generate the old root, appends all incremental leaves, becomes the current MMR.

Trait Implementations

impl<T: Debug, M: Debug> Debug for MerkleProof<T, M>

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

Formats the value using the given formatter.