[][src]Struct accumulator::MerkleAccumulator

pub struct MerkleAccumulator<R, H> { /* fields omitted */ }

In this live Merkle Accumulator algorithms.

Implementations

impl<R, H> MerkleAccumulator<R, H> where
    R: HashReader,
    H: CryptoHasher
[src]

pub fn append(
    reader: &R,
    num_existing_leaves: LeafCount,
    new_leaves: &[HashValue]
) -> Result<(HashValue, Vec<(Position, HashValue)>)>
[src]

Given an existing Merkle Accumulator (represented by num_existing_leaves and a reader that is able to fetch all existing frozen nodes), and a list of leaves to be appended, returns the result root hash and new nodes to be frozen.

pub fn get_proof(
    reader: &R,
    num_leaves: LeafCount,
    leaf_index: u64
) -> Result<AccumulatorProof<H>>
[src]

Get proof of inclusion of the leaf at leaf_index in this Merkle Accumulator of num_leaves leaves in total. Siblings are read via reader (or generated dynamically if they are non-frozen).

See libra_types::proof::AccumulatorProof for proof format.

pub fn get_consistency_proof(
    reader: &R,
    full_acc_leaves: LeafCount,
    sub_acc_leaves: LeafCount
) -> Result<AccumulatorConsistencyProof>
[src]

Gets a proof that shows the full accumulator is consistent with a smaller accumulator.

See libra_types::proof::AccumulatorConsistencyProof for proof format.

pub fn get_range_proof(
    reader: &R,
    full_acc_leaves: LeafCount,
    first_leaf_index: Option<u64>,
    num_leaves: LeafCount
) -> Result<AccumulatorRangeProof<H>>
[src]

Gets a proof that shows a range of leaves are part of the accumulator.

See libra_types::proof::AccumulatorRangeProof for proof format.

pub fn get_range_proof_positions(
    reader: &R,
    full_acc_leaves: LeafCount,
    first_leaf_index: Option<u64>,
    num_leaves: LeafCount
) -> Result<(Vec<Position>, Vec<Position>)>
[src]

See get_range_proof. This is the version of it that returns Positions only.

pub fn get_frozen_subtree_hashes(
    reader: &R,
    num_leaves: LeafCount
) -> Result<Vec<HashValue>>
[src]

From left to right, gets frozen subtree root hashes of the accumulator. For example, if the accumulator has 5 leaves, x and e are returned.

                root
               /    \
             /        \
           /            \
          x              o
        /   \           / \
       /     \         /   \
      o       o       o     placeholder
     / \     / \     / \
    a   b   c   d   e   placeholder

pub fn get_root_hash(reader: &R, num_leaves: LeafCount) -> Result<HashValue>[src]

Get root hash at a specific version (hence num_leaves).

Auto Trait Implementations

impl<R, H> RefUnwindSafe for MerkleAccumulator<R, H> where
    H: RefUnwindSafe,
    R: RefUnwindSafe

impl<R, H> Send for MerkleAccumulator<R, H> where
    H: Send,
    R: Send

impl<R, H> Sync for MerkleAccumulator<R, H> where
    H: Sync,
    R: Sync

impl<R, H> Unpin for MerkleAccumulator<R, H> where
    H: Unpin,
    R: Unpin

impl<R, H> UnwindSafe for MerkleAccumulator<R, H> where
    H: UnwindSafe,
    R: 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> Pointable for T

type Init = T

The type for initializers.

impl<T> Same<T> for T

type Output = T

Should always be Self

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.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,