Struct BinaryMerkleTreeProver

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

Implementations

impl<T, H, C> BinaryMerkleTreeProver<T, H, C>

pub fn scheme(&self) -> &BinaryMerkleTreeScheme<T, H, C>

impl<T, C, H> BinaryMerkleTreeProver<T, H, C>

pub fn new(compression: C) -> Self

Trait Implementations

impl<T: Debug, H: Debug, C: Debug> Debug for BinaryMerkleTreeProver<T, H, C>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F, H, C> MerkleTreeProver<F> for BinaryMerkleTreeProver<F, H, C>

where F: TowerField, H: Digest + BlockSizeUser + FixedOutputReset, C: PseudoCompressionFunction<Output<H>, 2> + Sync,

type Scheme = BinaryMerkleTreeScheme<F, H, C>

type Committed = BinaryMerkleTree<GenericArray<u8, <H as OutputSizeUser>::OutputSize>>

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: &[F], batch_size: usize, ) -> Result<(Commitment<Output<H>>, Self::Committed), Error>

Commit a vector of values.

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

Returns the internal digest layer at the given depth.

fn prove_opening<Proof: CanWrite>( &self, committed: &Self::Committed, layer_depth: usize, index: usize, proof: Proof, ) -> Result<(), 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<F>>::Digest>, Self::Committed), Error>

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

Commit interleaved elements from iterator by val