Struct ConsistencyProof 

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

A proof that one Merkle tree is a prefix of another. In other words, tree #2 is the result of appending some number of items to the end of tree #1.

Implementations

impl<H: Digest> ConsistencyProof<H>

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

Returns the byte representation of this consistency proof.

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

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

Constructs a ConsistencyProof 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.

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

Constructs a ConsistencyProof from a sequence of digests.

Trait Implementations

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

fn clone(&self) -> ConsistencyProof<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 ConsistencyProof<H>

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

Formats the value using the given formatter.