contains bugfixes regarding missed writes and branches when merging.
   i started looking into append-only behavior (writing only to the last
   offset) and performance seems much worse than other implementations
   (every root is increasingly wide), maybe because i am rebalancing the
   tree by simply attaching branches to the root.
   it's a little confusing to me nowadays, how when the tree is balanced,
   if using append only storage, this means adding internodes to the same
   storage location as the root. forming an equivalency between an ideal
   tree and the "update" tree where each newly added node as leaves are
   added all go in the same "update" root node, could be helpful.