Struct Proof 

pub struct Proof<D, K, V>
where
    D: SupportedDigest,
    K: VisitBytes,
    V: VisitBytes,
{
    pub peers: Vec<Option<Hash<D>>>,
    /* private fields */
}

An inclusion proof of the specified value in a map

Compression

Since the depth of a tree is always n and a proof needs to contain all branch node peers from the leaf to the root, a proof should contain n hashes. However, several strategies can be used to compress a proof; saving both memory and bytes on the wire.

First, the hash of the item and the root are known by both sides and can be omitted.

Second, sparse peers can be represented by None. Since we take references to the hashes, Rust null-optimization is used.

Third, since sparse peers are more likely at the bottom of the tree, we can omit all leading sparse peers. The verifier can dynamically reconstruct

Fields

peers: Vec<Option<Hash<D>>>

Sibling node hashes needed to construct a proof

Implementations

impl<D, K, V> Proof<D, K, V>

where D: SupportedDigest, K: VisitBytes, V: VisitBytes,

pub fn evaluate(&self, key: &K, value: &V) -> Hash<D>

Computes the root obtained by evaluating this inclusion proof with the given leaf

Trait Implementations

impl<D, K, V> From<Proof<D, K, V>> for MapInclusionProof

where D: SupportedDigest, K: VisitBytes, V: VisitBytes,

fn from(value: Proof<D, K, V>) -> Self

Converts to this type from the input type.

impl<D, K, V> From<Proof<D, K, V>> for Vec<Option<Hash<D>>>

where D: SupportedDigest, K: VisitBytes, V: VisitBytes,

fn from(value: Proof<D, K, V>) -> Self

Converts to this type from the input type.

impl<D, K, V> TryFrom<MapInclusionProof> for Proof<D, K, V>

where D: SupportedDigest, K: VisitBytes, V: VisitBytes,

type Error = Error

The type returned in the event of a conversion error.

fn try_from(value: MapInclusionProof) -> Result<Self, Self::Error>

Performs the conversion.