Struct BinaryMerkleTreeScheme 

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

A binary Merkle tree vector commitment, as seen by the verifier.

A committed vector is cut into equal-size batches of values. Each batch is hashed into one leaf digest. Pairs of digests are then folded upward until a single root digest remains.

Implementations

impl<T, H: HashSuite> BinaryMerkleTreeScheme<T, H>

pub fn new() -> Self

Trait Implementations

impl<T, H: HashSuite> Clone for BinaryMerkleTreeScheme<T, H>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T, H: HashSuite> Default for BinaryMerkleTreeScheme<T, H>

fn default() -> Self

Returns the “default value” for a type.

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

where T: FixedSizeSerializeBytes, H: HashSuite,

type Digest = Array<u8, <<H as HashSuite>::LeafHash as OutputSizeUser>::OutputSize>

The digest of a leaf or an inner node.

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

Returns the optimal layer that the verifier should verify only once.

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

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

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