gritzko

17 ms·

271.
by gritzko 2y ago
Ha. I just realized it is 10 years since me, Alexei and Oleg launched our CRDT demo on HN. Funnily enough, it featured this mouse-cursor trick as well. It was a demo of the lib. It was August 2014 if I remember correctly. The post was submi
272.
by gritzko 2y ago
Do you know Nikita? He likes to provoke and manipulate the audience. Check the today's twin post on the same subject: https://news.ycombinator.com/item?id=40772955 Comments are 100% on the point, both bland and boring.
273.
by gritzko 2y ago
Excellent. This approach to CRDTs existed even before the term itself was invented. In the 2010 article[2] on Causal Trees[1], your humble servant calls these per-peer op logs "yarns". In the 2011, observing the proliferation of p
274.
by gritzko 3y ago
The feature they call "branches" is more accurately to call "snapshots" or "checkpoints". Creating CoW writable versions and rolling back to past versions - that's snapshots. Branches imply merging, which
275.
by gritzko 3y ago
Torvalds is cautiously optimistic, hopes that AI will be able to spot bugs in the code. That kind of AI I did not see yet. All the concerning issues from the Gentoo post I can see on a regular basis. For example, plausibly looking BS or AI
276.
by gritzko 3y ago
The author clarifies that there is no way to detect it. He only wants it explicitly stated in the policy: "don't bring that".
277.
RDX CRDT: turn any LSM database (LevelDB, Cassandra) into a CRDT db(github.com)
1 points by gritzko 3y ago|0 comments
278.
by gritzko 5y ago
see later in the article, Ctrl+F "mushrooms"
279.
by gritzko 5y ago
Nope. Missed a heartbeat means gone. We discuss churn later in the article. Its effects are complicated, but as long as d holds, everything else holds.
280.
by gritzko 5y ago
Actually, I may address it here. > This algorithm requires a lot of messages The algorithm requires (1) data propagation (proposal) messages and (2) heartbeat messages that confirm progress similar to TCP ACKs. The amount of heartbeat me
281.
by gritzko 5y ago
If I understand correctly, Stellar assumes there is some core of the network where quorum slices intersect?
282.
by gritzko 5y ago
On the formal side, SC is deterministic and nodes only talk to their friends, which is the opposite of Avalanche. The article has some calculations for the case of real-world time, but in the end it is always a question of acceptable timeou
283.
by gritzko 5y ago
Thanks, we will address that.
284.
by gritzko 5y ago
Very good question. The article clearly lacks a section on that. This form of consensus is made for a different set of trade-offs than Raft or Paxos or blockchains. It implies a swarm of participants of an unknown size and, mainly, CRDT dat
285.
by gritzko 5y ago
In a fundamental way: a node is not tracking all other nodes. The number of nodes may be unknown. A node only tracks its adjacent nodes.
286.
Swarm consensus [pdf](replicated.cc)
122 points by gritzko 5y ago|31 comments
287.
by gritzko 5y ago
Wow
288.
by gritzko 5y ago
> External Debt in Ukraine increased to 125281 USD Million in the second quarter of 2021 from 123107 USD Million in the first quarter of 2021. source: National Bank of Ukraine This is comparable to the Soviet Union debt just before the c
289.
by gritzko 5y ago
OK guys, OK, please stop downvoting. Russia invades Ukraine because Russians hate freedom.
290.
by gritzko 5y ago
I observe the Ukrainian drama for many years. I strongly suspect that the actual game maybe the opposite of the picture in the media. Ukraine is looted to the bone and the economy is in downward spiral. The beneficiaries of the looting may
291.
Papyrus: A rich text CRDT from 2012(github.com)
1 points by gritzko 5y ago|0 comments
292.
by gritzko 5y ago
Here is Kotlin https://github.com/decentralized-hse/collab-edit libron will be released, yes.
293.
by gritzko 5y ago
Thanks. No, I didn't release it, although there are implementations on GitHub. Rust and Kotlin, at least. The RON proof-of-concept wiki runs on the (unreleased) C++ implementation [1]. I benchmarked it at some point, everything was lik
294.
by gritzko 5y ago
About a decade ago, I implemented the Causal Tree CRDT (aka RGA, Timestamped Insertion Tree) in regular expressions using a Unicode string as a storage. Later we made a collaborative editor for Yandex based on that code. It used many of t
295.
by gritzko 5y ago
> We present Verkle Trees, which are constructed similarly to Merkle Trees, but using Vector Commitments rather than cryptographic hash functions. In a Merkle Tree, a parent node is the hash of its children. In a Verkle Tree, a parent no
296.
by gritzko 6y ago
See it this way. Those corrupt "regimes" are simply making the money. Similarly, toppling those regimes is a highly profitable activity. There is an often cited claim: when Yanukovich was toppled in Ukraine, >$30bn disappeared
297.
by gritzko 6y ago
Like I am trying to argue with a guy who is arguing with the map...
298.
by gritzko 6y ago
Crimea was historically a part of Imperial Russia for more than a century. In my understanding, if Ukraine becomes a NATO country, European Russia becomes indefensible. That means, the Russian govt is ready to escalate the matter all the wa
299.
by gritzko 6y ago
RON progressed over these three years. RON docs now sit in a RON-based revision control system coupled with a RON based wiki http://doc.replicated.cc/^Wiki/ron.sm
300.
by gritzko 6y ago
Thanks. It makes all block level formatting aligned to 4 char indents. Hence, paddings. Hence the one letter limitation. The terrible HTML comment hack is straight from the CommonMark spec... it solved a Markdown syntax issue... hope to kil

More ›