Building the Fastest Decentralized Internet Protocol for Web3
summary
Claims a coded networking layer that achieves provably optimal data propagation using randomized algebraic recombination so nodes forward linear equations instead of raw shards. A private testnet shows >40% of state TVL onboarded and latency measurements report multi‑times speedups vs. gossip, with lower bandwidth waste. The network runs on lightweight flex nodes (a laptop with ~8 GB and half a CPU suffices), and a proven “perfect pipelining” result says random decentralized coding matches or outperforms an omniscient centralized scheduler.
AI-written summary · about
chapters (8)
- 0:00Decentralized web3 protocols
- 1:01Decentralization for scaling
- 3:34Decentralized data propagation
- 5:43Algebraic coding for transmission
- 8:13Equation recombination explained
- 10:02Flex nodes and participation
- 11:51Optimal decentralized performance
- 12:33Future hackathons and engagement
related talks
18mHigh Performance Memory For The World Computer
16mDispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks
03mHow DoubleZero’s Physical Fiber Infrastructure Makes Blockchains 100x Faster Than Public Internet
06mGradient Network
03mData Transfers at the Speed of Light
30mFireside Chat
20mHigh Performance Networking: How DoubleZero Enables IBRL
16mBuilding the Trust Layer of the Internet