Struct merkle_light::proof::Proof

pub struct Proof<T: Eq + Clone + AsRef<[u8]>> { /* fields omitted */ }

Merkle tree inclusion proof for data element, for which item = Leaf(Hash(Data Item)).

Lemma layout:

[ item h1x h2y h3z ... root ]

Proof validation is positioned hash against lemma path to match root hash.

Methods

impl<T: Eq + Clone + AsRef<[u8]>> Proof<T>

pub fn new(hash: Vec<T>, path: Vec<bool>) -> Proof<T>

Creates new MT inclusion proof

pub fn item(&self) -> T

Return proof target leaf

pub fn root(&self) -> T

Return tree root

pub fn validate<A: Algorithm<T>>(&self) -> bool

Verifies MT inclusion proof

Trait Implementations

impl<T: Debug + Eq + Clone + AsRef<[u8]>> Debug for Proof<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: Clone + Eq + Clone + AsRef<[u8]>> Clone for Proof<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Eq + Eq + Clone + AsRef<[u8]>> Eq for Proof<T>

impl<T: PartialEq + Eq + Clone + AsRef<[u8]>> PartialEq for Proof<T>

fn eq(&self, __arg_0: &Proof<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &Proof<T>) -> bool

This method tests for !=.