Struct InclusionProof 

pub struct InclusionProof {
    pub index: u64,
    pub size: u64,
    pub root: MerkleHash,
    pub hashes: Vec<MerkleHash>,
}

Merkle inclusion proof for a single entry in the log.

Proves that a leaf at index is included in the tree of size leaves with the given root.

Args:

• index — Zero-based leaf index.
• size — Tree size (number of leaves) when the proof was generated.
• root — Merkle root at tree size size.
• hashes — Sibling hashes from leaf to root.

Usage:

let proof = InclusionProof { index: 5, size: 16, root, hashes: vec![...] };
proof.verify(&leaf_hash)?;

Fields

index: u64

size: u64

root: MerkleHash

hashes: Vec<MerkleHash>

Implementations

impl InclusionProof

pub fn verify(&self, leaf_hash: &MerkleHash) -> Result<(), TransparencyError>

Verify that leaf_hash is included in the tree.

Trait Implementations

impl Clone for InclusionProof

fn clone(&self) -> InclusionProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InclusionProof

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InclusionProof

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for InclusionProof

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

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 InclusionProof