> There must be existing uses of this encoding, but I’ve been unable to find any or even determine what its name is. not a tree guru.. but isn't this somewhat

> There must be existing uses of this encoding, but I’ve been unable to find any or even determine what its name is. not a tree guru.. but isn't this somewhat related to 'fractal tree indexing': https://en.wikipedia.org/wiki/Fractal_tree_index https://en.wikipedia.org/wiki/Fractal_tree_index Each internal node of a B-tree will contain a number of keys that is one less than its branching factor. The keys act as separation values which divide its subtrees. Keys in subtrees are stored in search tree order, that is, all keys in a subtree are between the two bracketing values. In this regard, they are just like B-trees. also, thanks for the plan9 stuff :D