Struct Proof

pub struct Proof<T> {
    pub algorithm: Sha3,
    pub root_hash: Vec<u8>,
    pub lemma: Lemma,
    pub value: T,
}

An inclusion proof represent the fact that a value is a member of a MerkleTree with root hash root_hash, and hash function algorithm.

Fields

algorithm: Sha3

The hashing algorithm used in the original MerkleTree

root_hash: Vec<u8>

The hash of the root of the original MerkleTree

lemma: Lemma

The first Lemma of the Proof

value: T

The value concerned by this Proof

Implementations

impl<T> Proof<T>

pub fn new(algo: Sha3, root_hash: Vec<u8>, lemma: Lemma, value: T) -> Self

Constructs a new Proof

pub fn validate<H>(&self, root_hash: &[u8]) -> bool

where Sha3: HashUtils<H>, H: AsRef<[u8]>,

Checks whether this inclusion proof is well-formed, and whether its root hash matches the given root_hash.

Trait Implementations

impl<T: Clone> Clone for Proof<T>

fn clone(&self) -> Proof<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.