Comment by mentat
5 years ago
> The major downside of having an “always syncable” data structure is that it gets really big, really quick
Perhaps it would be prudent to read the actual article before tossing off this sort of comment since it's indeed the whole point?
Normally I would downvote a comment that amounts to "read the article", except that this one is entirely on point.
One of the classic problems was size and performance. However both problems have now disappeared. Operations are `O(log(n))` and the size overhead is a factor of 1.5-2.0. That's quite workable.