Struct Verifier 

pub struct Verifier<'a, H: CHasher> { /* private fields */ }

A Hasher implementation to use when verifying proofs over GraftedStorage.

Implementations

impl<'a, H: CHasher> Verifier<'a, H>

pub fn new(height: u32, loc: Location, elements: Vec<&'a [u8]>) -> Self

Create a new Verifier.

Panics

Panics if loc is too large to be safely converted to a Position (> MAX_LOCATION).

pub const fn standard(&mut self) -> &mut StandardHasher<H>

Trait Implementations

impl<H: CHasher> Hasher<<H as Hasher>::Digest> for Verifier<'_, H>

type Inner = H

fn leaf_digest(&mut self, pos: Position, element: &[u8]) -> H::Digest

Computes the digest for a leaf given its position and the element it represents.

fn fork(&self) -> impl HasherTrait<H::Digest>

Fork the hasher to provide equivalent functionality in another thread. This is different than Clone::clone because the forked hasher need not be a deep copy, and may share non-mutable state with the hasher from which it was forked.

fn node_digest( &mut self, pos: Position, left_digest: &H::Digest, right_digest: &H::Digest, ) -> H::Digest

Computes the digest for a node given its position and the digests of its children.

fn root<'a>( &mut self, size: Position, peak_digests: impl Iterator<Item = &'a H::Digest>, ) -> H::Digest

Computes the root for an MMR given its size and an iterator over the digests of its peaks in decreasing order of height.

fn digest(&mut self, data: &[u8]) -> H::Digest

Compute the digest of a byte slice.

fn inner(&mut self) -> &mut H

Access the inner CHasher hasher.