Struct MerkleProof 

pub struct MerkleProof<T: Serialize> {
    pub index: usize,
    pub hash_chain: Vec<[u8; 32]>,
    /* private fields */
}

A proof that a given datum is at a given index. Note that the proof does not store the data itself, but it needs to be provided to MerkleProof::verify().

Fields

index: usize

The index of the datum for which this is the proof.

hash_chain: Vec<[u8; 32]>

Hash chain leading up to the root node

Implementations

impl<T: Serialize> MerkleProof<T>

pub fn verify(&self, root_hash: HashType, data: &T) -> bool

Verifies that the given root hash can be reconstructed from the Merkle proof.

Panics

Panics if the data can’t be serialized.

Trait Implementations

impl<T: Serialize> Debug for MerkleProof<T>

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

Formats the value using the given formatter.

impl<'de, T: Serialize> Deserialize<'de> for MerkleProof<T>

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: PartialEq + Serialize> PartialEq for MerkleProof<T>

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Serialize> StructuralPartialEq for MerkleProof<T>