[ItsMonkk]

His more recent paper on the move operation[0] goes into some of the details further and while I don't fully understand it myself, the claims he makes along with the proof assistant nature he uses to work through them are fairly compelling.

The simple intuition is that because his CRDT's are associative and everyone else is not using associative data types, he simplifies the space and the impossible becomes possible.

[0]: https://news.ycombinator.com/item?id=30811072

[somezero]

Thanks! I’ll definitely take a look. These works are valuable but my problem is just with that particular claim about CAs.

1. This impossibility theorem is proved in a really broad setting (assuming a “broadcast communication cloud” and a P2P channel). If he wants to circumvent the impossibility theorem he should clearly specify the system model and say how it differs from Doceur’s. There are other instances where by playing with the model you go around an impossibility theorem, but you have to specify the differences. Especially since this theorem is so well known/cited.

2. Some claims in the old paper are just plain wrong. Like, you can’t say it’s Sybil resistant just because it tolerates arbitrary number of Byzantine nodes. Dolev-Strong also needs just one honest party, but it requires a CA.