Struct DataProof 

pub struct DataProof {
    pub roots: TxDataRoots,
    pub proof: Vec<H256>,
    pub number_of_leaves: u32,
    pub leaf_index: u32,
    pub leaf: H256,
}

Wrapper of binary-merkle-tree::MerkleProof with codec support.

Fields

roots: TxDataRoots

proof: Vec<H256>

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: H256

Leaf content.

Trait Implementations

impl Clone for DataProof

fn clone(&self) -> DataProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DataProof

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DataProof

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for DataProof

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for DataProof

impl StructuralPartialEq for DataProof