Struct fuel_merkle::sum::MerkleTree

pub struct MerkleTree<TableType, StorageType> { /* private fields */ }

The Binary Merkle Sum Tree is an extension to the existing Binary MerkleTree. A node (leaf or internal node) in the tree is defined as having:

• a fee (u64, 8 bytes)
• a digest (array of bytes)

Therefore, a node’s data is now a data pair formed by (fee, digest). The data pair of a node with two or more leaves is defined as:

(left.fee + right.fee, hash(0x01 ++ left.fee ++ left.digest ++ right.fee ++ right.digest))

This is in contrast to the Binary Merkle Tree node, where a node has only a digest.

See the specification for more details.

Details

When joining subtrees a and b, the joined subtree is now defined as:

fee: a.fee + b.fee data: node_sum(a.fee, a.data, b.fee, b.data)

where node_sum is defined as the hash function described in the data pair description above.

Implementations

impl<TableType, StorageType> MerkleTree<TableType, StorageType>

pub const fn empty_root() -> (u64, Bytes32)

impl<TableType, StorageType, StorageError> MerkleTree<TableType, StorageType>where TableType: Mappable<Key = Bytes32, Value = Node, OwnedValue = Node>, StorageType: StorageMutate<TableType, Error = StorageError>,

pub fn new(storage: StorageType) -> Self

pub fn root(&mut self) -> Result<(u64, Bytes32), StorageError>

pub fn push(&mut self, fee: u64, data: &[u8]) -> Result<(), StorageError>