|
|
|
|
|
|
by raphlinus
2557 days ago
|
|
|
I think the original statement is defensible. Many of the original OT papers proposed algorithms that have since been shown not to converge in particular cases (especially the TP2 puzzle). It took a while for the fog to clear, in part because TP2 requires concurrent edits from 3 peers. I also highly recommend the talk "CRDTs and the Quest for Distributed Consistency"[0] from Martin Kleppmann, which I believe surveys the landscape in as clear and accessible a manner as I've seen; much of the literature is pretty dense. [0]: https://www.youtube.com/watch?v=B5NULPSiOGw |
|
|