Struct merkletree::proof::Proof

pub struct Proof<T: Eq + Clone + AsRef<[u8]>, BaseTreeArity: Unsigned = U2> {
    pub sub_tree_proof: Option<Box<Proof<T, BaseTreeArity>>>,
    /* private fields */
}

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. U is the default tree arity (U2 = binary)

Fields

sub_tree_proof: Option<Box<Proof<T, BaseTreeArity>>>

Implementations

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

pub fn new<TopLayerArity: Unsigned, SubTreeArity: Unsigned>( sub_tree_proof: Option<Box<Proof<T, BaseTreeArity>>>, lemma: Vec<T>, path: Vec<usize>, ) -> Result<Proof<T, BaseTreeArity>>

Creates new MT inclusion proof

pub fn item(&self) -> T

Return proof target leaf

pub fn sub_tree_root(&self) -> T

Return sub tree root

pub fn root(&self) -> T

Return tree root

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

Verifies MT inclusion proof

pub fn validate_with_data<A: Algorithm<T>>( &self, leaf_data: &dyn Hashable<A>, ) -> Result<bool>

Verifies MT inclusion proof and that leaf_data is the original leaf data for which proof was generated.

pub fn path(&self) -> &Vec<usize>

Returns the path of this proof.

pub fn lemma(&self) -> &Vec<T>

Returns the lemma of this proof.

pub fn lemma_mut(&mut self) -> &mut Vec<T>

Returns the lemma of this proof as mutable.

pub fn top_layer_nodes(&self) -> usize

pub fn sub_layer_nodes(&self) -> usize

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

impl<T: Eq + Clone + AsRef<[u8]>, BaseTreeArity: Unsigned> StructuralPartialEq for Proof<T, BaseTreeArity>