Viewing profile — nused
nused
HN member- Joined
- Thu, May 24, 2018, 6:30 PM UTC
- HN karma
- 35
- Public activity
- 16 items
- HN profile
- View on Hacker News ↗
About nused
Recent public activity
-
comment
Comment #19932085
> 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 fro…
-
comment
Comment #19901474
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 ba…
-
comment
Comment #19901408
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 for…
-
comment
Comment #18411836
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…
-
comment
Comment #18286008
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 …
-
comment
Comment #18234735
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 incorre…
-
comment
Comment #18231537
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…
-
comment
Comment #18218232
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 …
-
comment
Comment #18217899
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, inse…
-
comment
Comment #18204413
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? Contr…
-
comment
Comment #18203454
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 …
-
comment
Comment #18198405
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 the…
-
comment
Comment #18197793
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 substan…
-
comment
Comment #18197321
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 contradic…
- story
- story