|
@ -43,7 +43,7 @@ pub const SMT_MAX_DEPTH: u8 = 64; |
|
|
/// Every key maps to one leaf. If there are as many keys as there are leaves, then
|
|
|
/// Every key maps to one leaf. If there are as many keys as there are leaves, then
|
|
|
/// [Self::Leaf] should be the same type as [Self::Value], as is the case with
|
|
|
/// [Self::Leaf] should be the same type as [Self::Value], as is the case with
|
|
|
/// [crate::merkle::SimpleSmt]. However, if there are more keys than leaves, then [`Self::Leaf`]
|
|
|
/// [crate::merkle::SimpleSmt]. However, if there are more keys than leaves, then [`Self::Leaf`]
|
|
|
/// must accomodate all keys that map to the same leaf.
|
|
|
|
|
|
|
|
|
/// must accommodate all keys that map to the same leaf.
|
|
|
///
|
|
|
///
|
|
|
/// [SparseMerkleTree] currently doesn't support optimizations that compress Merkle proofs.
|
|
|
/// [SparseMerkleTree] currently doesn't support optimizations that compress Merkle proofs.
|
|
|
pub(crate) trait SparseMerkleTree<const DEPTH: u8> {
|
|
|
pub(crate) trait SparseMerkleTree<const DEPTH: u8> {
|
|
|