[spam][crazy][ot] log: #3 write-anywhere to an append-only-log

so i'm thinking the big remaining bit to make an algorithm here that i like is to implement moving parts into balanced/full trees, away from recent writes. maybe i'll just accumulate little bits around that. can use chunk structure: class Chunk: start, end, data, height, leaf_count, age def __len__( def is_leaf( def is_full( new basic concept for add() function: retain areas separate from writes, that are shrunk or grown to maximum depth using full trees only goal: write that part of an add() function