Struct BinaryMerkleTreeProver

pub struct BinaryMerkleTreeProver<D, H, C> { /* private fields */ }

Implementations

impl<D, C: Clone, H> BinaryMerkleTreeProver<D, H, C>

pub fn new(compression: C) -> Self

Trait Implementations

impl<T, D, H, C> MerkleTreeProver<T> for BinaryMerkleTreeProver<D, H, C>

where D: PackedField, T: Sync, H: Hasher<T, Digest = D> + Send, C: PseudoCompressionFunction<D, 2> + Sync,

type Scheme = BinaryMerkleTreeScheme<D, H, C>

type Committed = BinaryMerkleTree<D>

Data generated during commitment required to generate opening proofs.

fn scheme(&self) -> &Self::Scheme

Returns the Merkle tree scheme used by the prover.

fn commit( &self, data: &[T], batch_size: usize, ) -> Result<(Commitment<D>, Self::Committed), Error>

Commit a vector of values.

fn layer<'a>( &self, committed: &'a Self::Committed, depth: usize, ) -> Result<&'a [D], Error>

Returns the internal digest layer at the given depth.

fn prove_opening( &self, committed: &Self::Committed, layer_depth: usize, index: usize, ) -> Result<Vec<D>, Error>

Generate an opening proof for an entry in a committed vector at the given index.

fn commit_iterated<ParIter>( &self, iterated_chunks: ParIter, log_len: usize, ) -> Result<(Commitment<<Self::Scheme as MerkleTreeScheme<T>>::Digest>, Self::Committed), Error>

where ParIter: IndexedParallelIterator<Item: IntoIterator<Item = T>>,

Commit interleaved elements from iterator by val