lab notes
The punchline first: the incremental insert is finally done on the Prolly Tree. I don't think I've ever spent so much time on such a small, core piece of code. It was also a lesson for me to lean into the struggle and talk about it.
lab notes
A problem was that traversal in a layer would be backward. I'd need to traverse left-to-right to match the build process when building the Prolly Tree from scratch. No problem, I'll just loop through the children backward when processing top-down.
QnA
❓What is this? LinkedIn sometimes suggests that I take an unpaid gig as an advice columnist. Here, I take them up on it, especially if my answers run contrary to typical answers.It's easy to fall into the trap of Seeing like a State [https://www.ribbonfarm.com/
lab notes
I've been stuck on the incremental insertion of a key in a Prolly Tree, and feeling like I'm in a bog. The version where a Prolly Tree is built from scratch was relatively straightforward. I was able to write it in a day. The incremental version
lab notes
Last week, I built Prolly Trees from scratch and probed some of its properties. This week, I started building a Prolly Tree incrementally, by inserting one key at a time. It was more challenging than I suspected at first glance, seeing as I implemented it three times. In a typical
lab notes
Alright, party people. This week I went back to reimplementing Prolly Trees. I wanted to finish out the Lattice Merkle Tree. But given that my goals aren't to just fiddle around in applied research and Prolly Trees already work, I reimplemented Prolly Trees from scratch. I was delighted
techno-optimism
Recently, the Rabbit r1 launched. It's a new handheld device that promises a new primary interaction model with compute: by talking to them in the context of the real world. In turn, they would help us perform actions to help us with unstructured, but menial tasks throughout our
programming
👉When I had mistakenly thought that Prolly Trees weren't uncit, I thought maybe an interesting way forward was to leverage the same mechanism CRDTs use to converge. Below is a mathematical description of what I called a Lattice Merkle Tree, still incomplete. I had time-boxed this, so I
lab notes
This past week, I'd been working on exploring a new construction for a unicit B+tree. I wanted to know if the mechanisms for uncoordinated synchronization of CRDT could be applied here. Given the research nature of the task, I indulged myself with a limited timebox to the
lab notes
In Lab note #029 [https://interjectedfuture.com/lab-notes/lab-notes-029-balancing-nodes-in-a-unicit-tree/] , I was thinking about a different way to construct a unicit tree. Can we create both a description of the splits in a tree and a comparator that would make it a partially ordered set? And with that partially ordered set
QnA
❓What is this? LinkedIn sometimes suggests that I take an unpaid gig as an advice columnist. Here, I take them up on it, especially if my answers run contrary to typical answers.For a long time, my impression of LinkedIn as a product was that it was mostly a tool
lab notes
In my previous lab note #028 [https://interjectedfuture.com/lab-notes/lab-note-028-consistent-splitting-for-node-sizes/] , I was worried that Prolly trees [https://github.com/attic-labs/noms/blob/master/doc/intro.md#prolly-trees-probabilistic-b-trees] were not unicit. When I inserted keys in different orders, there was a small chance that splits would propagate to the end