Struct BinaryMerkleTree

pub struct BinaryMerkleTree<D> {
    pub log_len: usize,
    pub inner_nodes: Vec<D>,
}

A binary Merkle tree that commits batches of vectors.

The vector entries at each index in a batch are hashed together into leaf digests. Then a Merkle tree is constructed over the leaf digests. The implementation requires that the vector lengths are all equal to each other and a power of two.

Fields

log_len: usize

Base-2 logarithm of the number of leaves

inner_nodes: Vec<D>

The inner nodes, arranged as a flattened array of layers with the root at the end

Implementations

impl<D: Clone> BinaryMerkleTree<D>

pub fn root(&self) -> D

pub fn layer(&self, layer_depth: usize) -> Result<&[D], Error>

pub fn branch(&self, index: usize, layer_depth: usize) -> Result<Vec<D>, Error>

Get a Merkle branch for the given index

Throws if the index is out of range

Trait Implementations

impl<D: Clone> Clone for BinaryMerkleTree<D>

fn clone(&self) -> BinaryMerkleTree<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D: Debug> Debug for BinaryMerkleTree<D>

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

Formats the value using the given formatter.