• Generates Labels for a HashTree. Labels are bitstring representations of position of the node in the tree.
  • A unique identifier for a node in a hash tree. A label is defined by its value, length, and bits_per_level. Just |value| is not sufficient, because the root’s length is 0 and thus the understood value is also 0. Because children are 0-indexed, then all nodes on the left-most branch of the root will have the value 0.
  • __Visitor 🔒
  • __Visitor 🔒




  • Calculate the amount of bits required to hold n children. e.g.: 4 children can fit in 2 bits (00, 01, 10, 11)