lab notes
Last time [https://interjectedfuture.com/lab-notes/lab-note-028-consistent-splitting-for-node-sizes/] , I found balancing nodes seemed to be in conflict with the property of a unicit tree. A balanced tree is desirable for efficient queries. A unicit tree is desirable for Merkle Trees for fast equality comparisons. Was there a way to get both?
lab notes
👉See Lab note #30 [https://interjectedfuture.com/lab-notes-030-prolly-trees-are-unicit] for corrections. Prolly Trees are unicit, and don't exhibit the bad behavior I've outlines below.Last week [https://interjectedfuture.com/lab-notes/lab-note-027-breadcrumb-to-prolly-trees/] , I was looking at Prolly Trees [https://github.com/attic-labs/noms/blob/master/doc/intro.md#
crdt
🔰If CRDTs are new to you, here are some introductory links. - An interactive intro to CRDTs [https://jakelazaroff.com/words/an-interactive-intro-to-crdts/] - An introduction to state-based CRDTs [https://www.bartoszsypytkowski.com/the-state-of-a-state-based-crdts/] - CRDTs for non-academics [https://www.youtube.com/watch?v=vBU70EjwGfw] - CRDT: The Hard Parts [https:
ai-assist
These last couple of days, I've been trying to deepen my understanding of CRDTs. There aren't too many papers on CRDTs, so you can get caught up quickly by diligently reading the papers. Though I haven't read them all, I was surprised by my
lab notes
When I found the splitting of nodes for Merkle Search Trees to be problematic [https://interjectedfuture.com/lab-notes/lab-notes-025-split-condition-for-merkle-search-trees/] , I stumbled upon Prolly Trees [https://github.com/attic-labs/noms/blob/master/doc/intro.md#prolly-trees-probabilistic-b-trees] . They were first described by the Noms, a git for databases [https://github.com/attic-labs/
crdt
🔰If CRDTs are new to you, here are some introductory links.  - An interactive intro to CRDTs  - An introduction to state-based CRDTs  - CRDTs for non-academics  - CRDT: The Hard Parts  - Readings in CRDTs  - crdt.tech What are the trade-offs between different kinds of CRDTs (Conflict-free Replicated
ai-assist
> Still getting used to the future: ChatGPT as a copy and paste assistant for note taking. Don't want to wait to unroll a tweet thread, but don't want to do it by hand? Cut and paste the page, and ask GPT to clean it up
lab notes
Most desktop, mobile, and web apps use a form-based metaphor to manipulate the state of the digital objects sitting in the database. This is a little odd when you think about it. Most things in the real-world don't work like this, aside from our complex machines. What would
lab notes
Most desktop, mobile, and web apps use a form-based metaphor to manipulate the state of the digital objects sitting in the database. This is a little odd when you think about it. Most things in the real-world don't work like this, aside from our complex machines. What would
lab notes
I started outlining how to compose different CRDTs together to make an Immutable Conflict-free Resolution Relations [1] construction, based on the Merkle Search Tree. When designing it, I first tried sketching out the entire construction by drawing, but I was left confused. I wasn't sure if all the
lab notes
I been reading various papers on CRDTs to deepen my understanding of them. That's when I happened upon a paper that constructed Merkle-CRDTs from Merkle-DAGs [https://arxiv.org/pdf/2004.00107.pdf]. > Surprisingly, the internal merkle data structure of Git is like a vector clock. It establishes
lab notes
A major implication not often included in discussions of local-first software is how to deal with migrations. The degree of the problem depends largely on how you fence the boundaries of your system. If your local-first system allows any number of replicas to come in and out of the network