bitmagic: binary search through a uint64 to find the index (least bit being 0) of the first set bit.

bitmagic: binary search through a uint64 to find the bit-length Zero is a special case, it has a 0 bit length.

bitmagic: binary search through a uint64, to find the BitIndex of next power of 2 (if not already a power of 2) Zero is a special case, it has a 0 depth.

target.IsRoot() and target.IsClose() must both be false.

initialize the zero-hashes pre-computed data with the given hash-function.

Merkleize with log(N) space allocation.

SummaryInto creates a SummaryLink that collapses the subtree at the target Gindex into just the root.

WriteRoots serialization, efficient version of List/Vector serialization.

Get a hash-function that re-uses the hashing working-variables.

An immutable (L, R) pair with a link to the holding node.

Node of a binary merkle tree.

A link is called to rebind a value, and retrieve the new root node.