Richard122
1.6K posts

Richard122
@Richardx1202
Fulltime web3. Research & Moderator






Touch the bar, not the grass this weekend







Ethereum validators: speed = yield. On Hoodi testnet, @get_optimum is showing: • Block & blob propagation 6–20x faster • Latency around 150ms • Stable attestations + big bandwidth savings This isn’t theory , it’s live data. If you’re running a node and care about MEV & rewards, you should be testing this network layer now. Feedback matters. Join the testnet, push it, and share your experience. 𝐒𝐩𝐞𝐞𝐝 𝐢𝐬 𝐦𝐨𝐧𝐞𝐲. Don’t get left behind. cc : @cryptooflashh @blockchainjeff @aqccapital







When data is transmitted over the Internet, it's normal for some packets to get lost along the way. The traditional solution is to resend the missing packets. While this works for many everyday applications, it's not ideal for blockchain networks, where transactions need to propagate as quickly as possible. Repeated retransmissions increase network traffic and introduce unnecessary latency. That's where erasure coding comes in. Instead of waiting to resend lost data, the system generates extra redundant packets in advance. As long as the receiver collects enough of these packets, it can reconstruct the original data—even if some packets never arrive. Today, there are three common types of erasure coding: Reed-Solomon (RS) Fountain Code Random Linear Network Coding (RLNC) Reed-Solomon (RS) is one of the oldest and most widely used erasure coding techniques. It powers technologies such as CDs, DVDs, QR codes, and storage systems. While reliable, RS was designed for relatively stable environments and only performs encoding at the source. That makes it less suitable for decentralized blockchain networks, where thousands of nodes constantly exchange data. -------------------------------------------------- Fountain Codes are more flexible. Instead of producing a fixed number of encoded packets, they can generate an almost unlimited stream of them. The receiver simply collects enough unique packets to recover the original data, making Fountain Codes well suited for broadcasting and streaming applications where packet loss varies across users. -------------------------------------------------- RLNC takes the concept a step further. Not only can the sender encode data, but intermediate nodes can also combine and re-encode packets before forwarding them. This gives the network more opportunities to deliver useful information without relying on retransmissions. Think of it like sending a 100-piece jigsaw puzzle. With Reed-Solomon, you include a few extra backup pieces, so losing some pieces won't prevent the puzzle from being completed. Fountain Codes let you create as many backup pieces as needed, and the receiver only needs enough of them to reconstruct the picture. RLNC works differently. Every packet is a mathematical combination of multiple original pieces. As the packets travel through the network, intermediate nodes can create new combinations from the packets they receive. The receiver doesn't need the original packets—only enough independent combinations to reconstruct the complete data. This is why RLNC is particularly well suited for blockchain and Web3. It speeds up data propagation, reduces retransmissions, lowers bandwidth consumption, and ensures that critical information reaches more nodes even when the network experiences congestion or packet loss. For these reasons, @get_optimum has adopted RLNC as its core technology to accelerate the propagation of transactions, blocks, and data blobs, making blockchain networks faster, more efficient, and more resilient. @get_optimum @aqccapital



