pub type ConcurrentMerkleTree26<'a, H> = ConcurrentMerkleTree<'a, H, 26>;

Aliased Type§

struct ConcurrentMerkleTree26<'a, H> {
Show 16 fields pub height: usize, pub changelog_capacity: usize, pub changelog_length: usize, pub current_changelog_index: usize, pub roots_capacity: usize, pub roots_length: usize, pub current_root_index: usize, pub canopy_depth: usize, pub next_index: usize, pub sequence_number: usize, pub rightmost_leaf: [u8; 32], pub filled_subtrees: BoundedVec<'a, [u8; 32]>, pub changelog: CyclicBoundedVec<'a, ChangelogEntry<26>>, pub roots: CyclicBoundedVec<'a, [u8; 32]>, pub canopy: BoundedVec<'a, [u8; 32]>, pub _hasher: PhantomData<H>,
}

Fields§

§height: usize§changelog_capacity: usize§changelog_length: usize§current_changelog_index: usize§roots_capacity: usize§roots_length: usize§current_root_index: usize§canopy_depth: usize§next_index: usize§sequence_number: usize§rightmost_leaf: [u8; 32]§filled_subtrees: BoundedVec<'a, [u8; 32]>

Hashes of subtrees.

§changelog: CyclicBoundedVec<'a, ChangelogEntry<26>>

History of Merkle proofs.

§roots: CyclicBoundedVec<'a, [u8; 32]>

History of roots.

§canopy: BoundedVec<'a, [u8; 32]>

Cached upper nodes.

§_hasher: PhantomData<H>