Type Alias RewardMerkleTreeV2 

pub type RewardMerkleTreeV2 = UniversalMerkleTree<RewardAmount, Keccak256Hasher, RewardAccountV2, REWARD_MERKLE_TREE_V2_ARITY, KeccakNode>;

Canonical reward Merkle tree type (single-level, 160-bit).

This is the “reference” implementation used for:

• Testing two-level tree correctness (commitments must match)
• Understanding the logical tree structure
• Generating test vectors

Production code uses InMemoryRewardMerkleTreeV2 for better performance and storage efficiency.

Aliased Type

pub struct RewardMerkleTreeV2 { /* private fields */ }

Trait Implementations

impl MerklizedState<SeqTypes, { Self::ARITY }> for RewardMerkleTreeV2

type Key = <UniversalMerkleTree<RewardAmount, Keccak256Hasher, RewardAccountV2, REWARD_MERKLE_TREE_V2_ARITY, KeccakNode> as MerkleTreeScheme>::Index

type Entry = <UniversalMerkleTree<RewardAmount, Keccak256Hasher, RewardAccountV2, REWARD_MERKLE_TREE_V2_ARITY, KeccakNode> as MerkleTreeScheme>::Element

type T = KeccakNode

type Commit = <UniversalMerkleTree<RewardAmount, Keccak256Hasher, RewardAccountV2, REWARD_MERKLE_TREE_V2_ARITY, KeccakNode> as MerkleTreeScheme>::Commitment

type Digest = Keccak256Hasher

fn state_type() -> &'static str

Retrieves the name of the state being queried.

fn header_state_commitment_field() -> &'static str

Retrieves the field in the header containing the Merkle tree commitment for the state implementing this trait.

fn tree_height() -> usize

Get the height of the tree

fn insert_path( &mut self, key: Self::Key, proof: &MerkleProof<Self::Entry, Self::Key, Self::T, { Self::ARITY }>, ) -> Result<()>

Insert a forgotten path into the tree.