gritzko

13 ms·

211.
by gritzko 1y ago
Next objective absh ?
212.
Why Sync?(replicated.wiki)
3 points by gritzko 1y ago|0 comments
213.
by gritzko 1y ago
The author’s journey is probably just starting. I had this exact mindset about 10 years ago. Long story short: distributed systems are hard. A linear log of changes is an absolute lie, but it is a lie easy to believe in.
214.
by gritzko 1y ago
Interesting. I did not manage to navigate to the data though.
215.
by gritzko 1y ago
I would not mind using my mech keyboard and an iPad for coding
216.
Bsky.storage: Own Your Social Identity(medium.com)
5 points by gritzko 1y ago|1 comments
217.
by gritzko 1y ago
A big chunk of bugs there are Unicode related, that is my point. When people parse JSON they don't think that they also parse Unicode.
218.
by gritzko 1y ago
In theory, yes. In practice, there are throngs of parsers and converters who might handle such cases differently . https://seriot.ch/projects/parsing_json.html
219.
by gritzko 1y ago
I specialize in protocol design, unfortunately. A while ago I had to code some Unicode conversion routines from scratch and I must say I absolutely admire UTF-8. Unicode per se is a dumpster fire, likely because of objective reasons. Dealin
220.
by gritzko 1y ago
That's a long list. - RDX has a spec, so it can have compatible implementations. The result of a merge is specified to a bit. Automerge works the way Orion coded it (this time). - There are equivalent text and binary formats, JDR and R
221.
by gritzko 1y ago
Automerge is based on design decisions from 2014-2017. I remember that epoch and what everybody thought back then. The views have evolved since, but Automerge is a large project, many things have being built on top. It is unrealistic to cha
222.
by gritzko 1y ago
The classical paper-ledger bookkeeping is pretty much eventually consistent. They did not have the Internet when they invented it. Flight booking is often statistically consistent only. Overbooking, etc.
223.
by gritzko 1y ago
Once I was using Slack on a bad WiFi and it was an adventure. What I saw as "sent" others never saw.
224.
by gritzko 1y ago
The big idea behind CRDTs is that a data structures can have replicas synchronizing on a best-effort basis. That is much closer to the physical reality: server here, client there, phones all over the place. The basic CRDT ideas are actual
225.
by gritzko 1y ago
That is a private Ethereum instance, right?
226.
by gritzko 1y ago
It lacks a conclusion, except I can see that 750>500
227.
go-rdx: CRDT document store with finer-grained revision control(github.com)
2 points by gritzko 1y ago|0 comments
228.
by gritzko 1y ago
Aha, thanks https://dwheeler.com/readable/
229.
by gritzko 1y ago
Thanks. I recently had to reinvent LISP to script my CRDT database. That was not much work, because I already had the notation (I use RDX, a JSON superset with CRDT types). Still, I stumbled at the idiosyncratic LISP bracketing. Luckily, RD
230.
by gritzko 1y ago
I myself made a simple query language out of necessity. My key-value CRDT store [1] needed some syntax for basic queries. It was strictly minimalistic, like {type:fruit} would produce [{type:fruit name:banana}...] and so on. When I thin
231.
by gritzko 1y ago
[flagged]
232.
by gritzko 1y ago
Long-tail problems are not reiterated in the dataset. Making LLM remember that can be difficult.
233.
by gritzko 1y ago
Yep, feed those AI data centers with coal-generated electricity.
234.
by gritzko 1y ago
I think I understand the use case. Like, we have in fact several regional Postgreses, but we want them to be one physical database for the sake of simplicity. Probably this should be in the motivational part of the README.
235.
by gritzko 1y ago
So the outcomes are essentially random? It all feels like they expect developers to sift through the conflict log to resolve things manually or something. If a transaction did not go through on some of the nodes, what are the others doing t
236.
by gritzko 1y ago
Local first apps have some peculiar technical features, yes. I worked on CRDTs from maybe 2008 and in 2012 we made a collaborative editor. Local first, all data on the client, syncing by WebSocket. I remember when we debugged it we once had
237.
by gritzko 1y ago
Author here. Sorry for the quality of the text. It was flushed out in a brief moment of euphoria when a 0.1 feature list was complete. Never edited, never checked for Markdown bugs even. (Please come later)
238.
by gritzko 1y ago
I am a (co)author. Conflict resolution is CRDT in all cases. FIRST (Float Int Reference String Term): Last-Write-Wins based on the timestamp, PLEX: - Tuples: per-entry LWW or recursive, - Linear: DISCONT (CT/RGA type), - Eulerian: per-
239.
by gritzko 1y ago
Prolly Trees are Merkle-fied B-trees, essentially. I am working on related things[r], using Merkle-fied LSM trees. Ink&Switch do things that very closely resemble Merklefied LSM[h], although they are not exactly LSM. I would not be surp
240.
by gritzko 1y ago
Hi. I object. The trick#0 you mention is how I made an entire C dialect. Here is a generic binary heap, for example https://github.com/gritzko/librdx/blob/master/abc/HEAPx.h The syntax is a bit heav

More ›