All the CRDTs I'm looking at here are doing the work in memory only. Adding a good persistence layer is a big missing piece here. But some people are working o

All the CRDTs I'm looking at here are doing the work in memory only. Adding a good persistence layer is a big missing piece here. But some people are working on adding CRDTs to sqlite: https://github.com/vlcn-io/cr-sqlite https://github.com/vlcn-io/cr-sqlite It'd be really fun to see if this approach can be adapted to sqlite's b-tree. But it might not work as-is. The b-tree implementation I have is quite a bit different from most b-trees because I'm storing offsets rather than "keys", and because I'm storing compacted runs of items rather than individual rows. I went into a lot more detail about what it might look like here: https://github.com/vlcn-io/cr-sqlite/issues/65#issuecomment-1325620964 https://github.com/vlcn-io/cr-sqlite/issues/65#issuecomment-...