Struct SmtProof 

pub struct SmtProof {
    pub key_hash: [u8; 32],
    pub leaf: Option<([u8; 32], Vec<u8>)>,
    pub siblings: Vec<[u8; 32]>,
}

A compact SMT proof for a single key.

siblings[d] is the sibling hash at depth d; the terminal subtree (lone leaf or empty slot) sits at depth siblings.len().

Fields

key_hash: [u8; 32]

The key hash this proof covers.

leaf: Option<([u8; 32], Vec<u8>)>

The lone leaf occupying the terminal subtree, if any.

Some((leaf_key_hash, value)): membership when leaf_key_hash == key_hash, otherwise a conflicting leaf proving non-membership. None: the slot is empty.

siblings: Vec<[u8; 32]>

Sibling hashes from depth 0 (root level) to the terminal subtree, at most [TREE_DEPTH] entries.

Implementations

impl SmtProof

pub fn value(&self) -> Option<&[u8]>

Returns the proven value if this is a membership proof.

Trait Implementations

impl Clone for SmtProof

fn clone(&self) -> SmtProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SmtProof

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

Formats the value using the given formatter.

impl Eq for SmtProof

impl PartialEq for SmtProof

fn eq(&self, other: &SmtProof) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl StructuralPartialEq for SmtProof