mump2p is not a new gossip stack sitting next to libp2p. Docs call it Galois Gossip. Same libp2p host, same mesh, same GRAFT and PRUNE. What changes is the payload. GossipSub forwards the full message. mump2p shreds it into k fragments and sends random linear combinations. A peer does not need a specific shard. k independent ones are enough to invert the matrix and rebuild the block. Once that happens, it can send IDONTWANT. Peers stop pushing shards for a message you already decoded. That is the part people miss when they only talk about speed. The mesh also stops wasting the rest of the slot on copies you no longer need. Recoding sits in the middle. If a node is holding more shards than the forward threshold, it mixes a new one and sends it on before it has the whole block. Flexnodes keep that set in a bounded buffer, so a loss does not turn into a full resend. There is a security catch too. A random combination is only useful if it is the publisher’s data. Shards are checked against a hash and signature on decode. Fail that and the sender’s reputation drops. Same client. Gateway beside it. No consensus change. Data movement sets the ceiling. Optimum raises it. @get_optimum

Ethereum’s post-quantum migration highlights how difficult it can be to adapt an established ecosystem. QMS takes a different approach by starting with two settled layers, building its foundation with quantum resistance in mind from the beginning rather than treating it as a distant upgrade. A proactive approach could make the transition more manageable as quantum computing advances. #QMS1002

Parallel execution is not one setting. A social feed and a liquidation queue do not collide the same way. Optimistic mode runs transactions immediately and retries on a clash. That fits low-conflict work, where most transactions never touch the same accounts. Pessimistic mode locks the contested resource first, so a high-conflict financial access lands once instead of thrashing. Rialo switches between them with the workload. The runtime does not assume every block looks like a DEX, or like a feed. That matters once reactive transactions and web calls sit in the same block. A scheduled liquidation and a batch of unrelated updates should not share one concurrency policy. Speed is the easy claim. Getting the conflict model right is the part that keeps the block from falling over. @RialoHQ

A late block is not only a missed attestation. It is also a bandwidth bill. Gossipsub keeps copying the payload until enough peers have it. On a clean path that is wasteful. On a lossy path it gets worse, because the missing piece is requested again as the same packet. RLNC does not resend that packet. The block is split and mixed into random linear combinations. If one shard drops, another independent combination can close the gap. A node can also mix what it already holds and forward a new shard before the full block is in. That is why the bandwidth cut is the quiet part of the Hoodi numbers. About 150ms average propagation, at least 6x under Gossipsub, and roughly 90 to 95 percent less data on the wire. mump2p sits beside the CL client you already run. No fork. No consensus change. Data movement sets the ceiling. Optimum raises it. @get_optimum

patlamalı şampanyası tabii ki de pahalıya

Most chains only run when someone sends a transaction. Rialo also runs when a condition becomes true. A reactive transaction is two parts: → a predicate (time, balance, price, external event) → a payload (what executes when it hits) Validators evaluate the predicate against the same state at the end of every block. If it holds, the transaction is queued inside consensus. No keeper. No bot. No cron. Chain those together and you get a workflow: liquidations, subscriptions, agent payouts. Asynchronous, onchain, deterministic. That’s the difference between a ledger and a system that can react to the real world. @RialoHQ

Bugün Rialo için TR sesli sohbetimizi gerçekleştirdik. Fikirlerimizi paylaştığımız, projeyi konuştuğumuz ve birlikte geliştiğimiz güzel bir sohbet oldu. Rialo’yu özel kılan sadece teknolojisi değil, aynı zamanda bu ekosistemi birlikte büyüten topluluğu. Bu yolculuğun bir parçası olmaktan mutluyum. 🇹🇷 @RialoHQ

Shorter slots only work if the slow tail gets shorter too. A 12 second slot hides a lot of late blocks. Cut that window and nodes far from the proposer, or on weaker hardware, start missing the attestation deadline. The median can look fine while the tail still breaks rewards. Gossipsub makes that tail worse. It resends copies until enough peers have the block. Under loss, the last arrivals slip. RLNC changes the arrival pattern. The block is mixed into random linear combinations. A node forwards a new shard before it has the full payload, and any independent set can rebuild it. You do not wait on one missing packet. That is the part that matters for tighter slots. Not a faster average on a quiet test. A shorter tail when the path is lossy. mump2p runs as a sidecar next to the CL client. No fork, no consensus change. Data movement sets the ceiling. Optimum raises it. @get_optimum

One of the projects that caught my attention at the October 14 Builder Hub was Drawbook. Built on Rialo, Drawbook aims to make onchain raffles more transparent and verifiable. Its commit-reveal mechanism allows participants to commit to secret values before revealing them to become eligible for the draw. Winners are determined using publicly available data, allowing anyone to independently verify the results. What stands out to me is the goal of automating the draw without relying on external bots or scheduled server tasks. Transparent rules, verifiable outcomes, and automated execution. A good example of what builders can create with Rialo. @RialoHQ

The Loop Wallet migration window closes today. If you haven't migrated yet, make sure to complete the process before the deadline to keep using Loop Wallet without interruption. Your balance and Party ID will remain unchanged, making the transition simple and seamless. Don't leave it until the last minute. Migrate now and stay ready for what's next. Party ID: 517c7ad867bacbd8544a94ed5a1d9e6d::122029e2e84a8b1c493d2aed5613e9113774c8a453139ac444ae2f9bf0987d1745fd @canton_loop

Financial apps already talk to the internet. Prices, payments, shipping, identity. The chain is usually the part that cannot. So teams add an oracle, a keeper, a bridge, then another service to watch those. Each one is a bill, a failure point, and a new thing to trust. Rialo puts the web call in the protocol. The app asks for the outside event. Validators see the same input. The transaction runs when the condition is met. No separate bot farm. No middleware stack between the bank’s API and the state. That is the point of a real-world network. The internet stays where it is. The chain learns how to reach it. @RialoHQ

The real value of @RialoHQ’s Builders Hub is turning ideas into something real. Reactive blockchain infrastructure opens up new possibilities for how applications respond to onchain events. Having a space where builders can explore these possibilities, exchange feedback, and learn by building makes the ecosystem stronger. Less talking about what’s possible, more building what comes next.

Block propagation is still the quiet bottleneck on Ethereum. Validators move blocks with Gossipsub. The same payload gets copied and resent. When packets drop or the network gets busy, bandwidth burns and the slow tail gets worse. That shows up as missed attestations and weaker proposal odds. mump2p swaps that for Random Linear Network Coding. A block is split into fragments and turned into random linear combinations over a finite field. Any node with enough independent shards can rebuild the original. A node can also recode and forward new combinations before it has the full block. Every packet carries fresh information, so a loss does not force a full resend. On the Hoodi testnet that landed around 150ms average block propagation, at least 6x faster than the Gossipsub baseline, with roughly 90 to 95 percent less bandwidth. No consensus change. No client fork. It runs as a sidecar next to the CL client you already use. Data movement sets the ceiling. Optimum raises it. @get_optimum

An agent that can call an API should not also be able to move the funds, read the file, and approve itself. Most setups still hand it a broad key and hope the prompt behaves. That is not a control system. That is a wish. Rialo treats the agent like any other caller. It asks for an action. A gateway checks the permission, the limit, and the rule. Credentials stay sealed. The attempt is recorded. Useful for a payout, a market data pull, or a compliance check. The agent can act. It cannot wander. That is the missing piece if agents are going to touch real financial systems. @RialoHQ

bizim kahvaltı

Gossipsub does not just send a block once. It keeps copying it until enough peers have it. Under loss, those copies pile up. The node pays for data that did not add new information. RLNC flips that. The block is split into fragments and mixed into random linear combinations. A peer only needs enough independent shards to rebuild the original. If one shard drops, another combination can fill the gap. No full resend. The useful part is recoding. A node can mix what it already has and forward a new shard before the whole block arrives. Propagation does not wait on the slowest hop. That is why mump2p shows up as both faster delivery and a much smaller bandwidth bill. On Hoodi, average block propagation was about 150ms, at least 6x under the Gossipsub baseline, with roughly 90 to 95 percent less bandwidth. Same CL client. Sidecar next to it. No consensus change. Data movement sets the ceiling. Optimum raises it. @get_optimum