Struct BinaryMerkleTreeScheme

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

Implementations

impl<T, H, C> BinaryMerkleTreeScheme<T, H, C>

pub fn compression(&self) -> &C

impl<T, H, C> BinaryMerkleTreeScheme<T, H, C>

pub fn new(compression: C) -> Self

Trait Implementations

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

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

Formats the value using the given formatter.

impl<F, H, C> MerkleTreeScheme<F> for BinaryMerkleTreeScheme<F, H, C>

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

fn optimal_verify_layer(&self, n_queries: usize, tree_depth: usize) -> usize

This layer allows minimizing the proof size.

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

fn proof_size( &self, len: usize, n_queries: usize, layer_depth: usize, ) -> Result<usize, Error>

Returns the total byte-size of a proof for multiple opening queries.

fn verify_vector( &self, root: &Self::Digest, data: &[F], batch_size: usize, ) -> Result<(), Error>

Verify the opening of the full vector.

fn verify_layer( &self, root: &Self::Digest, layer_depth: usize, layer_digests: &[Self::Digest], ) -> Result<(), Error>

Verify a given layer of the Merkle tree.

fn verify_opening<Proof: CanRead>( &self, index: usize, values: &[F], layer_depth: usize, tree_depth: usize, layer_digests: &[Self::Digest], proof: Proof, ) -> Result<(), Error>

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