jchanimal
jchris@fireproof.storage
๐ Joined in 2017
๐ผ 1,775 Karma
โ๏ธ 467 posts
Load more
(Replying to PARENT post)
(Replying to PARENT post)
(Replying to PARENT post)
(Replying to PARENT post)
(Replying to PARENT post)
(Replying to PARENT post)
Cross AZ traffic is exactly the sort of thing companies with budgets need, that small projects donโt.
(Replying to PARENT post)
When I started reading blogs, the format reminded me of his essays.
(Replying to PARENT post)
I agree MCP isnโt a big change, but that is a good thing. Itโs more about making the implicit interface into something portable and reusable.
Most posix commands arenโt impressive in their own right, itโs the composability that gives them power. MCP plus data sync is similar.
(Replying to PARENT post)
This is a super simple codebase so if you fork it and make something real, please share it with us.
(Replying to PARENT post)
Merkle proofs are rad b/c they build causal consistency into the protocol. But there are lots of ways to find agreement about the latest operation in distributed systems. I've built an engine using deterministic merge -- if anyone wants to help with lowest common ancestor algorithms it's all Apache/MIT.
While deterministic merge with an immutable storage medium is compelling, it doesn't solve the finality problem -- when is an offline peer too out-of-date to reconcile? This mirrors the transaction problem -- we all need to agree. This brings the question I'm curious about to the forefront: can a Merkle CRDT use a Calvin/Raft-like agreement protocol to provide strong finality guarantees and the ability to commit snapshots globally?
Apologies for the noise.
(Replying to PARENT post)