✳flâneur — a map of the web's best reading

Braid drafts/time-machines

braid.org · saved by 1 readers

Time Machines are a generalization of OT and CRDT that have the combined capabilities of both, giving them both peer-to-peer consistency of a CRDT and the flexible history of OT. We show two breakthrough Time Machine algorithms: (1) the world's first p2p text synchronizer that can prune history, and (2) the world's fastest text synchronizer. It has often been thought that CRDT and OT are competing algorithms, but we show that they are actually capabilities, not algorithms, and that their capabilities can be combined in the implementation of a single algorithm. We show that this algorithm performs the function of Time Travel in a distributed polythread of execution. A Time Machine is made from a CRDT by giving it the ability to read and write edits relative to different times in history. This allows one to perform OT using a CRDT. Time Machines provide the guaranteed consistency of CRDTs, but can prune their metadata overhead down to zero in cases of reduced concurrency, which allows pr

Time Machines are a generalization of OT and CRDT that have the combined capabilities of both, giving them both peer-to-peer consistency of a CRDT and the flexible history of OT. We show two breakthrough Time Machine algorithms: (1) the world's first p2p text synchronizer that can prune history, and (2) the world's fastest text synchronizer. It has often been thought that CRDT and OT are competing algorithms, but we show that they are actually capabilities, not algorithms, and that their capabilities can be combined in the implementation of a single algorithm. We show that this algorithm perfo

Explore this link on the map →

related reading