High Performance Memory For The World Computer
summary
Optimum ships a memory stack — Optimum P2P, DROM and DAM — built on Random Linear Network Coding (RLNC) that composes equations at intermediate nodes instead of forwarding shards. Testnet benchmarks show Optimum P2P cuts average latency and its standard deviation versus GossipSub, with the largest gains under congestion where gossip latency spikes nonlinearly. The system runs live with validators on board, improves bandwidth utilization and reduces transaction-delays and gas-fee exposure, and the encoded, decentralized propagation proves functional in production tests.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:31Speaker Background & Motivation
- 1:22Tech Transfer from MIT & Optimum’s Mission
- 2:02Defining Memory in Decentralized Systems
- 3:11The Role of Memory in Computation & Web3 Stack
- 5:28Challenges: Bandwidth, Storage, and Scaling
- 6:09Optimum’s Product Suite Overview
- 6:32Random Linear Network Coding (RLNC) Introduction
- 7:13Performance Benchmarks & Testnet Results
- 8:45Nonlinear Network Behavior & Congestion
- 10:10Benefits Under Network Stress
- 10:35How RLNC Works
- 12:15Unique Features: Equation Composition & Decentralization
- 13:22Impact: Bandwidth, Latency, and Tradeoffs
- 15:22Who Benefits: Validators, dApps, End Users
- 16:51Collaboration & Specialization in Blockchain Infrastructure
- 17:50Conclusion
related talks
13mBuilding the Fastest Decentralized Internet Protocol for Web3
25mDisaggregating Persistent Memory and Controlling Them Remotely
45mBeyond Machine Boundaries: Experience with Memory Disaggregation
17mTopoOpt: Co-optimizing Network Topology and Parallelization Strategy for Distributed...
12mCharacterizing and Optimizing Remote Persistent Memory with RDMA and NVM
16mOneSidedMW: Managing Disaggregated Memory Efficiently, Flexibly, and Securely with RNIC
15mMore Than Capacity: Performance-oriented Evolution of Pangu in Alibaba
28mPersistent Memory plus RDMA, new age remote device
