Struct MMR

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

Implementations

impl<T, M, S> MMR<T, M, S>

pub fn new(mmr_size: u64, store: S) -> MMR<T, M, S>

pub fn mmr_size(&self) -> u64

pub fn is_empty(&self) -> bool

pub fn batch(&self) -> &MMRBatch<T, S>

pub fn store(&self) -> &S

impl<T, M, S> MMR<T, M, S>

where T: Clone + PartialEq, M: Merge<Item = T>, S: MMRStoreReadOps<T>,

pub fn push(&mut self, elem: T) -> Result<u64, Error>

pub fn get_root(&self) -> Result<T, Error>

get_root

pub fn get_ancestor_peaks_and_root( &self, prev_mmr_size: u64, ) -> Result<(Vec<T>, T), Error>

get_ancestor_root

pub fn gen_proof(&self, pos_list: Vec<u64>) -> Result<MerkleProof<T, M>, Error>

Generate merkle proof for positions

1. sort positions
2. push merkle proof to proof by peak from left to right
3. push bagged right hand side root

pub fn gen_node_proof( &self, pos_list: Vec<u64>, ) -> Result<NodeMerkleProof<T, M>, Error>

Generate node merkle proof for positions

1. sort positions
2. push merkle proof to proof by peak from left to right
3. push bagged right hand side root

pub fn gen_ancestry_proof( &self, prev_mmr_size: u64, ) -> Result<AncestryProof<T, M>, Error>

Generate proof that prior merkle root r’ is an ancestor of current merkle proof r

1. calculate positions of peaks of old root r’ given mmr size n
2. generate membership proof of peaks in root r
3. calculate r’ from peaks(n)
4. return (mmr root r’, peak hashes, membership proof of peaks(n) in r)

impl<T, M, S> MMR<T, M, S>

where S: MMRStoreWriteOps<T>,

pub fn commit(&mut self) -> Result<(), Error>