Struct InclusionStep 

pub struct InclusionStep {
    pub sibling: String,
    pub sibling_is_left: bool,
}

One step of a Merkle InclusionProof: the sibling hash, and which side it sits on.

RFC 6962 lets a verifier recover the side from index arithmetic. This carries it explicitly instead. The redundancy costs one bool per step and removes an entire class of verifier bug — an off-by-one in the index recursion produces a wrong root rather than a silently-accepted proof, and a hand-written verifier in another language is far likelier to get a stated side right than to re-derive the split correctly.

Fields

sibling: String

The sibling subtree hash, sha256:<hex>.

sibling_is_left: bool

Whether the sibling is the left operand at this level.

Trait Implementations

impl Clone for InclusionStep

fn clone(&self) -> InclusionStep

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InclusionStep

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InclusionStep

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for InclusionStep

impl PartialEq for InclusionStep

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for InclusionStep

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 InclusionStep