AppendCompleteSubTree appends a complete subtree to an existing tree See above description of trees for rules on how appending can occur.

AppendLeaf appends a leaf to a subtree Leaves are just complete subtrees at level 0, however we hash the leaf before putting it into the tree to avoid root collisions.

LeastSignificantBit of a 64bit unsigned integer.

MaximumAppendBetween finds the highest level which can be appended to tree of size startSize without creating a tree with size greater than end size (inclusive) Subtrees can only be appended according to certain rules, see tree description at top of file for details.

MostSignificantBit of a 64bit unsigned integer.

Root of the subtree.

TreeSize calculates the full tree size represented by a merkle expansion.

VerifyPrefixProof verifies that a pre-root commits to a prefix of the leaves committed by a post-root Verifies by appending sub trees to the pre tree until we get to the size of the post tree and then checking that the root of the calculated post tree is equal to the supplied one.

MAX_LEVEL for our binary trees.