Struct MerkleProof

pub struct MerkleProof<H, L> {
    pub root: H,
    pub proof: Vec<H>,
    pub number_of_leaves: u32,
    pub leaf_index: u32,
    pub leaf: L,
}

A generated merkle proof.

The structure contains all necessary data to later on verify the proof and the leaf itself.

Fields

root: H

Root hash of generated merkle tree.

proof: Vec<H>

Proof items (does not contain the leaf hash, nor the root obviously).

This vec contains all inner node hashes necessary to reconstruct the root hash given the leaf hash.

number_of_leaves: u32

Number of leaves in the original tree.

This is needed to detect a case where we have an odd number of leaves that “get promoted” to upper layers.

leaf_index: u32

Index of the leaf the proof is for (0-based).

leaf: L

Leaf content.

Trait Implementations

impl<H: Debug, L: Debug> Debug for MerkleProof<H, L>

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

Formats the value using the given formatter.

impl<H, L> Decode for MerkleProof<H, L>

where H: Decode, Vec<H>: Decode, L: Decode,

fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy, ) -> Result<Self, Error>

Attempt to deserialise the value from input.

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self>, ) -> Result<DecodeFinished, Error>

where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory.

fn skip<I>(input: &mut I) -> Result<(), Error>

where I: Input,

Attempt to skip the encoded value from input.

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl<H, L> Encode for MerkleProof<H, L>

where H: Encode, Vec<H>: Encode, L: Encode,

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy, )

Convert self to a slice and append it to the destination.

fn encode(&self) -> Vec<u8>

Convert self to an owned vector.

fn using_encoded<R, F>(&self, f: F) -> R

where F: FnOnce(&[u8]) -> R,

Convert self to a slice and then invoke the given closure with it.

fn encoded_size(&self) -> usize

Calculates the encoded size.

impl<H: PartialEq, L: PartialEq> PartialEq for MerkleProof<H, L>

fn eq(&self, other: &MerkleProof<H, L>) -> 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<H, L> EncodeLike for MerkleProof<H, L>

where H: Encode, Vec<H>: Encode, L: Encode,

impl<H: Eq, L: Eq> Eq for MerkleProof<H, L>

impl<H, L> StructuralPartialEq for MerkleProof<H, L>