Trait InclusionProvable

pub trait InclusionProvable {
    type ProofNodeType;
    type TreeStruct;

    // Required methods
    fn generate_inclusion_proof(
        tree: &Self::TreeStruct,
        list: &[TreeIndex],
    ) -> Option<Self>
       where Self: Sized;
    fn verify_inclusion_proof(
        &self,
        leaves: &[Self::ProofNodeType],
        root: &Self::ProofNodeType,
    ) -> bool;
}

Trait for generating and verifying inclusion proofs.

Required Associated Types

type ProofNodeType

The data type of a node with necessary information in Merkle proofs.

type TreeStruct

The data type of the Merkle tree.

Required Methods

fn generate_inclusion_proof( tree: &Self::TreeStruct, list: &[TreeIndex], ) -> Option<Self>

where Self: Sized,

Generate an inclusion proof for the input list of indexes.

fn verify_inclusion_proof( &self, leaves: &[Self::ProofNodeType], root: &Self::ProofNodeType, ) -> bool

Verify the inclusion proof according to the leave nodes and the root.

Implementors

impl<P: Clone + Default + Mergeable + Paddable + ProofExtractable> InclusionProvable for MerkleProof<P>

where <P as ProofExtractable>::ProofNode: Clone + Default + Eq + Mergeable + Serializable,

type ProofNodeType = <P as ProofExtractable>::ProofNode

type TreeStruct = SparseMerkleTree<P>