Struct Proof 

pub struct Proof<T: PartialEq + Eq> {
    pub merkle_path: Vec<T>,
}

Stores a merkle path to some leaf. Internally, the necessary hashes are stored from root to leaf in the merkle_path field, in such a way that, if the merkle tree is of height n, the i-th element of merkle_path is the sibling node in the n - 1 - i-th check when verifying.

Fields

merkle_path: Vec<T>

Implementations

impl<T: PartialEq + Eq> Proof<T>

pub fn verify<B>( &self, root_hash: &B::Node, index: usize, value: &B::Data, ) -> bool

where B: IsMerkleTreeBackend<Node = T>,

Verifies a Merkle inclusion proof for the value contained at leaf index.

Trait Implementations

impl<T: Clone + PartialEq + Eq> 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.

impl<T: Debug + PartialEq + Eq> Debug for Proof<T>

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

Formats the value using the given formatter.

impl<T> Deserializable for Proof<T>

where T: Deserializable + PartialEq + Eq,

fn deserialize(bytes: &[u8]) -> Result<Self, DeserializationError>

where Self: Sized,