DeserializeTree deserializes a serialized Merkle tree This is done by first reading the amount of leafs as a 64 bit int Then decoding the tree, bottom-up, starting with the leafs as the amount of nodes in one level defines the amount of nodes in its parent level NOTE that correctness of the tree is NOT validated as part of this method.

GrowTree constructs a Merkle from a list of leafData, the data of a given leaf is represented as a byte slice The construction rounds the amount of leafs up to the nearest two-power with zeroed nodes to ensure that the tree is perfect and hence all internal node's have well-defined children.

GrowTreeHashedLeafs constructs a tree from leafs nodes, i.e.

simple access by level, only levels between 0 and 64 inclusive are avaliable otherwise panics.

BytesInInt represents the amount of bytes used to encode an int.

bench and tune if it is an issue.

CommAndLoc represents Commitment and Location.

Location represents a location in the MerkleTree Level is counted from the leaf layer, with 0 being leaf layer.

MerkleTree represents a Merkle tree which can be used to construct proof of containment for either leafs, subtrees or a sequence of leafs (subtrees).