Trait filecoin_proofs_api::MerkleTreeTrait

pub trait MerkleTreeTrait: Send + Sync + Debug {
    type Arity: 'static + PoseidonArity;
    type SubTreeArity: 'static + PoseidonArity;
    type TopTreeArity: 'static + PoseidonArity;
    type Hasher: 'static + Hasher;
    type Store: Store<<Self::Hasher as Hasher>::Domain>;
    type Proof: MerkleProofTrait
    where
        <Self::Proof as MerkleProofTrait>::Hasher == Self::Hasher,
        <Self::Proof as MerkleProofTrait>::Arity == Self::Arity,
        <Self::Proof as MerkleProofTrait>::SubTreeArity == Self::SubTreeArity,
        <Self::Proof as MerkleProofTrait>::TopTreeArity == Self::TopTreeArity;

    fn display() -> String;
    fn root(&self) -> <Self::Hasher as Hasher>::Domain;
    fn gen_proof(&self, index: usize) -> Result<Self::Proof, Error>;
    fn gen_cached_proof(
        &self, 
        i: usize, 
        rows_to_discard: Option<usize>
    ) -> Result<Self::Proof, Error>;
    fn row_count(&self) -> usize;
    fn leaves(&self) -> usize;
    fn from_merkle(
        tree: MerkleTree<<Self::Hasher as Hasher>::Domain, <Self::Hasher as Hasher>::Function, Self::Store, Self::Arity, Self::SubTreeArity, Self::TopTreeArity>
    ) -> Self;
}

Trait used to abstract over the way Merkle Trees are constructed and stored.

Required Associated Types

type Arity: 'static + PoseidonArity

type SubTreeArity: 'static + PoseidonArity

type TopTreeArity: 'static + PoseidonArity

type Hasher: 'static + Hasher

type Store: Store<<Self::Hasher as Hasher>::Domain>

type Proof: MerkleProofTrait
where
    <Self::Proof as MerkleProofTrait>::Hasher == Self::Hasher,
    <Self::Proof as MerkleProofTrait>::Arity == Self::Arity,
    <Self::Proof as MerkleProofTrait>::SubTreeArity == Self::SubTreeArity,
    <Self::Proof as MerkleProofTrait>::TopTreeArity == Self::TopTreeArity

Required Methods

fn display() -> String

Print a unique name for this configuration.

fn root(&self) -> <Self::Hasher as Hasher>::Domain

Returns the root hash of the tree.

fn gen_proof(&self, index: usize) -> Result<Self::Proof, Error>

Creates a merkle proof of the node at the given index.

fn gen_cached_proof(
    &self,
    i: usize,
    rows_to_discard: Option<usize>
) -> Result<Self::Proof, Error>

fn row_count(&self) -> usize

fn leaves(&self) -> usize

fn from_merkle(
    tree: MerkleTree<<Self::Hasher as Hasher>::Domain, <Self::Hasher as Hasher>::Function, Self::Store, Self::Arity, Self::SubTreeArity, Self::TopTreeArity>
) -> Self

Implementors

impl<H, S, U, V, W> MerkleTreeTrait for MerkleTreeWrapper<H, S, U, V, W> where
    H: 'static + Hasher,
    S: Store<<H as Hasher>::Domain>,
    U: 'static + PoseidonArity,
    V: 'static + PoseidonArity,
    W: 'static + PoseidonArity, 

type Arity = U

type SubTreeArity = V

type TopTreeArity = W

type Hasher = H

type Store = S

type Proof = MerkleProof<<MerkleTreeWrapper<H, S, U, V, W> as MerkleTreeTrait>::Hasher, <MerkleTreeWrapper<H, S, U, V, W> as MerkleTreeTrait>::Arity, <MerkleTreeWrapper<H, S, U, V, W> as MerkleTreeTrait>::SubTreeArity, <MerkleTreeWrapper<H, S, U, V, W> as MerkleTreeTrait>::TopTreeArity>