Struct storage_proofs::piece_inclusion_proof::PieceInclusionProof

pub struct PieceInclusionProof<H: Hasher> { /* fields omitted */ }

Based on the alignment information (and sector size, provided during verification), the algorithm deterministically consumes the elements.

Methods

impl<H: Hasher> PieceInclusionProof<H>

pub fn new(
    piece_spec: PieceSpec,
    tree: &MerkleTree<H::Domain, H::Function>
) -> Result<PieceInclusionProof<H>>

pub fn verify(
    &self,
    root: &H::Domain,
    comm_p: &H::Domain,
    piece_leaves: usize,
    sector_leaves: usize
) -> bool

verify takes a merkle root and (pre-processed) piece data. Iff it returns true, then PieceInclusionProof indeed proves that piece's bytes were included in the merkle tree corresponding to root -- and at the position encoded in the proof. piece_leaves and sector_leaves are in units of Domain (i.e. NODE_SIZE = 32 bytes).

pub fn verify_all(
    root: &[u8],
    proofs: &[PieceInclusionProof<H>],
    comm_ps: &[Fr32Ary],
    piece_sizes: &[usize],
    sector_size: usize
) -> Result<bool>

verify_piece_inclusion_proofs returns true iff each provided piece is proved with respect to root by the corresponding (by index) proof.

Trait Implementations

impl<H: Hasher> From<PieceInclusionProof<H>> for Vec<u8>

fn from(proof: PieceInclusionProof<H>) -> Self

Performs the conversion.

impl<H: Clone + Hasher> Clone for PieceInclusionProof<H> where
    H::Domain: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher> Debug for PieceInclusionProof<H> where
    H::Domain: Debug, 

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

Formats the value using the given formatter.

impl<'_, H: Hasher> TryFrom<&'_ [u8]> for PieceInclusionProof<H>

type Error = Error

The type returned in the event of a conversion error.

fn try_from(bytes: &[u8]) -> Result<Self, Self::Error>

Performs the conversion.