anchor.diff:    This is conveniently designed to work on entire leaf nodes, so that iteration is as easy as using the same logic as a non-augmented B+ tree, and simply expanding each leaf node from the standard iteration.
   
   `lookup`, `insert`, `delete`, `lookup-fwd-iter`::
  -  These are the basic operation on hitchhiker trees. They correspond to `get`, `assoc`, `dissoc`, and `subseq` on sorted maps.
  +  These are the basic operations on hitchhiker trees.
  +  There are implementations in `hitchhiker.tree.core` and `hitchhiker.tree.messaging` which leverage their respective tree variants.
  +  They correspond to `get`, `assoc`, `dissoc`, and `subseq` on sorted maps.
  +
  +`hitchhiker.core.b-tree`::
  +  This is how to make a new hitchhiker or B+ tree.
  +  You should either use the above mutation functions on it from one or the other namespace; it probably won't work if you mix them.
  
positive.code:   Generally, this shouldn't need to be re-implemented;
    however, if the hitchhiker was to be enhanced with key & value size awareness during splits and merges, you'd want to adjust the methods of this protocol.
  
  `hitchhiker.tree.core/IBackend`::
    This protocol implements a backend for the tree.
  +
  
negative.code: 
  - Most inserts are a single append to the root's event log
  - Although there are a linear number of events, nodes are exponentially less likely to overflow the deeper they are in the tree
  - All data needed for a query exists along a path of nodes between the root and a specific leaf node. Since the logs are constant in size, queries still only read `log(n)` nodes.
  
  Thus we dramatically improve the performance of insertions without hurting the IO cost of queries.
  
  