[−][src]Struct ckb_merkle_mountain_range::MerkleProof

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

Implementations

impl<T: PartialEq + Debug + Clone, M: Merge<Item = T>> MerkleProof<T, M>[src]

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

pub fn mmr_size(&self) -> u64[src]

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

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

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

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>[src]

Trait Implementations

impl<T: Debug, M: Debug> Debug for MerkleProof<T, M>[src]

Auto Trait Implementations

impl<T, M> RefUnwindSafe for MerkleProof<T, M> where
    M: RefUnwindSafe,
    T: RefUnwindSafe, 

impl<T, M> Send for MerkleProof<T, M> where
    M: Send,
    T: Send, 

impl<T, M> Sync for MerkleProof<T, M> where
    M: Sync,
    T: Sync, 

impl<T, M> Unpin for MerkleProof<T, M> where
    M: Unpin,
    T: Unpin, 

impl<T, M> UnwindSafe for MerkleProof<T, M> where
    M: UnwindSafe,
    T: UnwindSafe, 

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.