total number of leaf nodes
tree height (0 == bottom == leaf nodes)
the number of nodes at the given height
compute the root hash of a partial merkle tree: Read a bit from the flag bit list: If it is '0': Read a hash from the hashes list, and return it as this node's hash.
compute the root hash of a partial merkle tree: Read a bit from the flag bit list: If it is '0': Read a hash from the hashes list, and return it as this node's hash. If it is '1' and this is a leaf node: Read a hash from the hashes list, store it as a matched txid, and return it as this node's hash. If it is '1' and this is an internal node: Descend into its left child tree, and store its computed hash as L. If this node has a right child as well: Descend into its right child, and store its computed hash as R. If L == R, the partial merkle tree object is invalid. Return Hash(L || R). If this node has no right child, return Hash(L || L).
total number of leaves
current height (0 == bottom of the tree == leaf nodes)
current position at this height, 0 = first node from the left
remaining hashes to read from
remaining flag bits to read from
a (hash, matched, remaining_hashes, remaining_bits) tuple where:
read a message from a stream
read a message from a stream
a deserialized message
read a message from a hex string
read a message from a hex string
message binary data in hex format
a deserialized message of type T
read a message from a byte array
read a message from a byte array
serialized message
a deserialized message
ttoal number of leaf nodes
the height of the root node. For example if yo have 5 leaf nodes, the height of the root node is 3.
write a message to a stream
write a message to a byte array