Struct InclusionProof 

pub struct InclusionProof<H: Digest> { /* private fields */ }

A proof that a value appears in a Merkle tree

Implementations

impl<H: Digest> InclusionProof<H>

pub fn as_bytes(&self) -> &[u8]

Returns the byte representation of this inclusion proof.

This is precisely PATH(m, D[n]), described in RFC 6962 §2.1.1, where n is the number of leaves and m is the leaf index being proved.

pub fn from_bytes(bytes: Vec<u8>) -> Self

Constructs an InclusionProof from its serialized form.

Panics

Panics when bytes.len() is not a multiple of H::OutputSize::USIZE, i.e., when bytes is not a concatenated sequence of hash digests.

pub fn from_digests<'a>( digests: impl IntoIterator<Item = &'a Output<H>>, ) -> Self

Constructs an InclusionProof from a sequence of digests.

pub fn try_from_bytes(bytes: Vec<u8>) -> Result<Self, InclusionVerifError>

Constructs a InclusionProof from the given bytes.

Errors

If when bytes.len() is not a multiple of H::OutputSize::USIZE, i.e., when bytes is not a concatenated sequence of hash digests.

Trait Implementations

impl<H: Clone + Digest> Clone for InclusionProof<H>

fn clone(&self) -> InclusionProof<H>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Digest> Debug for InclusionProof<H>

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

Formats the value using the given formatter.

impl<H: PartialEq + Digest> PartialEq for InclusionProof<H>

fn eq(&self, other: &InclusionProof<H>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<H: Eq + Digest> Eq for InclusionProof<H>

impl<H: Digest> StructuralPartialEq for InclusionProof<H>