Struct warg_transparency::log::InclusionProof

pub struct InclusionProof<D: SupportedDigest, V: VisitBytes> { /* private fields */ }

A proof that a leaf is present for a root

Implementations

impl<D, V> InclusionProof<D, V>

where D: SupportedDigest, V: VisitBytes,

pub fn leaf(&self) -> Node

Get the node that this proof proves the inclusion of

pub fn log_length(&self) -> usize

Get the length of the log this proof shows the leaf was included in

pub fn walk(&self) -> Result<InclusionProofWalk, InclusionProofError>

Collects all of the node indices that must be visited in order to validate the inlcusion proof into.

pub fn evaluate_value( &self, hashes: &impl LogData<D, V>, value: &V ) -> Result<Hash<D>, InclusionProofError>

Evaluate an inclusion proof. Callers should verify that the returned root matches their expectation.

Walks the inclusion proof, hashes each layer, returns the root hash.

pub fn evaluate_hash( &self, hashes: &impl LogData<D, V>, hash: Hash<D> ) -> Result<Hash<D>, InclusionProofError>

Evaluate an inclusion proof. Callers should verify that the returned root matches their expectation.

Walks the inclusion proof, hashes each layer, returns the root hash.

Trait Implementations

impl<D: Clone + SupportedDigest, V: Clone + VisitBytes> Clone for InclusionProof<D, V>

fn clone(&self) -> InclusionProof<D, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D: Debug + SupportedDigest, V: Debug + VisitBytes> Debug for InclusionProof<D, V>

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

Formats the value using the given formatter.

impl<D: PartialEq + SupportedDigest, V: PartialEq + VisitBytes> PartialEq for InclusionProof<D, V>

fn eq(&self, other: &InclusionProof<D, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<D: SupportedDigest, V: VisitBytes> StructuralPartialEq for InclusionProof<D, V>