Partial Tree
The structure is a little different than that of Merkle Tree. Partial Tree might not be a full binary tree. Leaves represent either original Merkle tree leaves or cut subtree node with stored hash. We differentiate between the leaves that are included in a filtered transaction and leaves that just keep hashes needed for calculation. Reason for this approach: during verification it's easier to extract hashes used as a base for this tree.
Inheritors
Types
Link copied to clipboard
Link copied to clipboard
Link copied to clipboard
data class Node(val left: PartialMerkleTree.PartialTree, val right: PartialMerkleTree.PartialTree, val hashAlgorithm: String? = SecureHash.SHA2_256) : PartialMerkleTree.PartialTree