Struct ClaimedLeaf 

pub struct ClaimedLeaf {
    pub alg_id: u64,
    pub leaf_proof: LeafProof,
}

One claimed leaf in a snapshot proof: a spine::LeafProof paired with the algorithm whose member root it verifies against.

The leaf proof’s own trusted positional parameters (index, tree_size, arity) pin the topology; alg_id selects which of the snapshot’s member roots is the authenticated root the proof reconstructs to. This is the base-case unit the aggregate proof composes.

Fields

alg_id: u64

The algorithm whose member root this leaf proof verifies against.

leaf_proof: LeafProof

The base-case leaf proof, verified against that algorithm’s member root.

Implementations

impl ClaimedLeaf

pub fn new(alg_id: u64, leaf_proof: LeafProof) -> ClaimedLeaf

Pair a leaf proof with the algorithm whose member root it verifies against.

Trait Implementations

impl Clone for ClaimedLeaf

fn clone(&self) -> ClaimedLeaf

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ClaimedLeaf

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

Formats the value using the given formatter.

impl Eq for ClaimedLeaf

impl PartialEq for ClaimedLeaf

fn eq(&self, other: &ClaimedLeaf) -> 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 ClaimedLeaf