Type Alias storage_proofs_core::merkle::LCTree

pub type LCTree<H, U, V, W> = MerkleTreeWrapper<H, LevelCacheStore<<H as Hasher>::Domain, File>, U, V, W>;

A tree that is partially stored on disk, some levels are in memory.

It’s generic over the hash function H, the base arity U, sub-tree arity V and top tree arity W.

The base arity is used for for all levels up to the top. Non zero arties of the top-tree and/or sub-tree each add another layer on top. So a tree with e.g. U = 8, V = 4, W = 2 would create a tree where the top level has two children, the levels below 4 children and all other levels below have 8 children.

Aliased Type

struct LCTree<H, U, V, W> {
    pub inner: MerkleTree<<H as Hasher>::Domain, <H as Hasher>::Function, LevelCacheStore<<H as Hasher>::Domain, File>, U, V, W>,
    pub h: PhantomData<H>,
}

Fields

inner: MerkleTree<<H as Hasher>::Domain, <H as Hasher>::Function, LevelCacheStore<<H as Hasher>::Domain, File>, U, V, W>

h: PhantomData<H>