Struct InclusionProof 

pub struct InclusionProof {
    pub leaf_index: usize,
    pub leaf_count: usize,
    pub path: Vec<InclusionStep>,
}

A proof that one frame commitment is a leaf of a signed merkle_root (SPEC.md §6.5.3).

This is what makes a signed answer selectively disclosable. A host that served twelve frames can prove to an auditor that one specific frame was in the signed set — and prove the provider committed to it before knowing which one would be questioned — while disclosing nothing about the other eleven beyond their hashes.

Fields

leaf_index: usize

The leaf’s index in canonical order.

leaf_count: usize

How many leaves the tree held. Part of the proof because a root alone does not pin the tree’s size, and a verifier that ignores it can be shown a proof from a differently-shaped tree.

path: Vec<InclusionStep>

Sibling hashes from the leaf upward.

Trait Implementations

impl Clone for InclusionProof

fn clone(&self) -> InclusionProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InclusionProof

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InclusionProof

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for InclusionProof

impl PartialEq for InclusionProof

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for InclusionProof

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for InclusionProof