Struct SubtreeProof 

pub struct SubtreeProof {
    pub leaves: Vec<SubtreeLeaf>,
    pub sibling_cut_hashes: Vec<[u8; 32]>,
}

A responder’s single-contiguous-subtree proof (ADR-0002 “The proof”).

Fields

leaves: Vec<SubtreeLeaf>

Every leaf of the selected subtree, in ascending leaf-index order.

sibling_cut_hashes: Vec<[u8; 32]>

One sibling cut-hash per level on the path from the root down to the selected subtree root, ordered root-first. Each is the plain hash of the unselected sibling node at that level.

Trait Implementations

impl Clone for SubtreeProof

fn clone(&self) -> SubtreeProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SubtreeProof

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SubtreeProof

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for SubtreeProof

impl PartialEq for SubtreeProof

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

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 SubtreeProof