nused

5 ms·

1.
by nused 7y ago
> The general outlook is that, OT - while being simple, they have this classic TP2 problem that would make it harder to arrive at a consistent state eventually - without a help from a central server. The alternative is to have a complica
2.
by nused 7y ago
Enjoyed your demos. Quill.js delta fits nicely with OT (and we do mentioned in https://arxiv.org/pdf/1905.01517.pdf ). Here is a Quill.js coediting demo, without using a ShareDB backend: https://codepen.io&#x
3.
by nused 7y ago
Thanks for the mention. We've re-organized the material and updated the submissions by splitting into three parts. We wanted to extend the content but felt that in its original form the article was too dense. The new structure consists
4.
by nused 8y ago
It appears you have specific comments and/or feedback? Either post them on HN or send them to the primary contact's email. Either way, we'll make an earnest effort to respond. This discussion is of interest to folks both insi
5.
by nused 8y ago
DOI 10.1145/2957276.2957300 is an attempt at using binary-tree variants to improve CRDT's searching performance bottleneck in converting external index position to internal object identifiers. We address these specific complexitie
6.
by nused 8y ago
This paper follows the same reasoning as in http://hal.inria.fr/inria-00071213/ , so it invariably arrives at the same bogus conclusion "Most OT algorithms have been proved incorrect". Please feel free to expl
7.
by nused 8y ago
No points were missed - the paper just showed why the points are wrong. I'd be happy to discuss them if you care to read it: there are three concrete correctness problems with CRDT (Logoot) in sections 4.2.4 - 4.2.6. Re: the articles y
8.
by nused 8y ago
Enjoyed reading your thinking around what "Intention preservation" means for CoCalc. I think "Intention" was left open-ended since it was always meant to be defined in the context of a specific application, e.g. image vs
9.
by nused 8y ago
Yes, OT has a time complexity of O(1) for processing a local change. 1. I think you are confusing the cost of OT with the cost of implementing standard editor operations (i.e, insert/delete characters/strings/object). Edito
10.
by nused 8y ago
There are a few things related to TP2, aka Convergence Property 2 (CP2), that needs to be unpacked here. Do your system always need to preserve TP2/CP2 to converge correctly? Contrary to what many folks and papers will claim, answer
11.
by nused 8y ago
<- This, concurs with our experience. When we profiled our string OT implementation on a single 2-3 GHz CPU, with 2-3 CPI (Cycle Per Instruction)), it was able to handle about 10M transformations per second. On a half dozen of OT based s
12.
by nused 8y ago
I think you'll find the article supports your sentiment to an extent. One of the key messages we tried to get across is that academic research for co-editing ought to go beyond theoretical analysis but rather drive research by pushing
13.
by nused 8y ago
I co-authored the paper and stand by the rigor of the evidence and arguments. If you believe there is a mistake, I would be happy to have that discussion to the extent that substantive arguments and/or evidences are presented. In refer
14.
by nused 8y ago
Casual and blanket theoretical characterizations of OT and CRDT algorithms is exactly the kind of folly that the article is trying to address. For example, it's a logical contradiction to begin the statement with "OT's comple
15.
Show HN: Real-time coediting API demo for TinyMCE(codepen.io)
5 points by nused 8y ago|0 comments