Trait smtree::traits::PaddingProvable

pub trait PaddingProvable {
    type PaddingProof;
    fn prove_padding_node(
        &self, 
        idx: &TreeIndex, 
        secret: &Secret
    ) -> Self::PaddingProof;
    fn verify_padding_node(
        node: &<Self as ProofExtractable>::ProofNode, 
        proof: &Self::PaddingProof, 
        idx: &TreeIndex
    ) -> bool
    where
        Self: ProofExtractable;
}

Trait for prove and verify padding nodes at random sampling.

Associated Types

type PaddingProof

The data type of the proof for a padding node.

Required methods

fn prove_padding_node(
    &self,
    idx: &TreeIndex,
    secret: &Secret
) -> Self::PaddingProof

Generate the proof for padding node at given tree index.

fn verify_padding_node(
    node: &<Self as ProofExtractable>::ProofNode,
    proof: &Self::PaddingProof,
    idx: &TreeIndex
) -> bool where
    Self: ProofExtractable, 

Verify the proof for a padding node at given tree index with associated node data in the Merkle proof.

Note that node is the node data in the Merkle proof, proof is the proof of the padding node, idx is the tree index.

Implementors

impl PaddingProvable for SumNodeSmt

type PaddingProof = SumNodeSmt

impl<D: Clone + Digest> PaddingProvable for HashNodeSmt<D>

type PaddingProof = HashNodeSmt<D>

impl<D: Clone + Digest> PaddingProvable for MTreeNodeSmt<D>

type PaddingProof = MTreeNodeSmt<D>