Struct merkle::Proof
[−]
[src]
pub struct Proof<T> { pub algorithm: &'static Algorithm, 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: &'static Algorithm
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
Methods
impl<T> Proof<T>
[src]
fn new(algo: &'static Algorithm,
root_hash: Vec<u8>,
lemma: Lemma,
value: T)
-> Self
root_hash: Vec<u8>,
lemma: Lemma,
value: T)
-> Self
Constructs a new Proof
fn validate(&self, root_hash: &[u8]) -> bool
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>
[src]
fn clone(&self) -> Proof<T>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more