Struct ckb_merkle_mountain_range::MerkleProof
source · [−]pub struct MerkleProof<T, M> { /* private fields */ }Implementations
sourceimpl<T: PartialEq + Debug + Clone, M: Merge<Item = T>> MerkleProof<T, M>
impl<T: PartialEq + Debug + Clone, 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]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]
pub fn calculate_root(&self, leaves: Vec<(u64, T)>) -> Result<T>
sourcepub fn calculate_root_with_new_leaf(
&self,
leaves: Vec<(u64, T)>,
new_pos: u64,
new_elem: T,
new_mmr_size: u64
) -> 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>
Trait Implementations
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
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more