Struct BinaryMerkleTreeScheme

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

Implementations

impl<D, H, C> BinaryMerkleTreeScheme<D, H, C>

pub fn new(compression: C) -> Self

Trait Implementations

impl<T, D, H, C> MerkleTreeScheme<T> for BinaryMerkleTreeScheme<D, H, C>

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

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

This layer allows minimizing the proof size.

type Digest = D

type Proof = Vec<D>

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: &[T], 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( &self, index: usize, values: &[T], layer_depth: usize, tree_depth: usize, layer_digests: &[Self::Digest], proof: Self::Proof, ) -> Result<(), Error>

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