Introducing Optimum: Building the Missing Memory Layer for Web3
Optimum
0xBfAC
April 15th, 2025

Blockchain technology has been heralded as the foundation of a new decentralized internet, now referred to as Web3. But as this "world computer" grows, it’s becoming increasingly clear that something fundamental is missing: a high-performance memory layer.

Memory—the component that enables computers to store, access, and update data efficiently—is a key element of every computer on earth. From your laptop to a supercomputer, all rely on memory. This architecture, first outlined by John von Neumann, has been the backbone of computing for decades. The memory bus facilitates data exchange between the CPU and RAM. RAM provides temporary storage for the operating system, software, and data in use, enabling programs to run efficiently.

At the surface, blockchains do resemble traditional computers. We have operating systems like the EVM and SVM, running on decentralized nodes and powering a growing ecosystem of applications. But dig deeper, and the gaps start to show. What we find is that most of the top level computing parts are recognizable while the memory unit is not only unrecognizable but also inefficient.

The Current Memory Bottleneck

Instead of a proper memory architecture, blockchains rely on a mashup of different best-effort approaches, creating critical bottlenecks and costly operations:

  • Redundancy: Gossip networks have replaced memory buses but redundantly propagate the same data to multiple nodes, wasting bandwidth, slowing block confirmation, increasing overall system cost;

  • Congestion: Inefficient networking stacks & state access cause unpredictable delays and cost surges in transaction processing;

  • State Bloat: Full nodes must store all state data permanently, making retrieval costly and complex.

Today, most blockchain networks use gossip protocols to propagate data — broadcasting everything to everyone, redundantly. Bitcoin and Ethereum 1.0 relied on this approach, but it didn’t scale. Ethereum 2.0 had to rethink this with new wire protocols to cut down on message overload. Avalanche also had to push a software update to reduce "excessive gossip" between validator nodes as it was straining its network. Solana, on the other hand, sidestepped full history retention by storing only the recent state, relying on professional “warehouse nodes” to archive older data.

While today's solutions address data accessibility, they fail to solve the fundamental challenge of next-generation memory architecture—one that seamlessly integrates lightning-fast retrieval, atomic-level updates, and fluid real-time interactions. Existing technologies across platforms offer glimpses of this potential, but none deliver the comprehensive foundation required for a truly scalable world computer that can transform how we interact with decentralized information.

Despite years of R&D, this fundamental piece of architecture — memory — has yet to be solved. Until now.

Meet Optimum: The First Decentralized Memory Layer

Optimum is building the missing memory layer for Web3.

It’s the world’s first decentralized, high-performance memory infrastructure for any blockchain — designed to scale data access, reduce network strain, and power the next generation of dApps. Powered by Random Linear Network Coding (RLNC) — a proven, MIT-developed data encoding technique — Optimum turns sluggish, redundant networks into fast, efficient, scalable systems.

With Optimum, blockchains gain a memory bus and RAM that rivals the performance of modern computing. At its core, Optimum is building a provably optimal memory infrastructure that transforms blockchains into high-speed, scalable computing networks. The architecture is modular, permissionless, and easy to integrate via API.

Two Core Components of Optimum

OptimumP2P - A pub-sub protocol designed to replace outdated gossip networks with smart, coding-based data propagation. It dramatically cuts down redundancy and improves throughput — leading to higher APY for validators, faster transactions, and smoother user experiences for dApps, DEXs and more.

Optimum deRAM - A decentralized RAM layer that ensures Atomicity, Consistency, and Durability (ACD). deRAM gives applications real-time read/write access to blockchain state, enabling fast, cheap storage and access. This is what unlocks the next wave of latency-sensitive, on-chain use cases: trading, gaming, AI, and social.

What Powers Optimum: RLNC - The MIT-Incubated Breakthrough

At the heart of Optimum lies Random Linear Network Coding (RLNC), a breakthrough in data coding developed by MIT Professor Muriel Médard, Optimum’s co-founder and CEO.

RLNC has been refined over two decades. RLNC has garnered significant recognition for its transformative impact on data networks. It was honored with the IEEE Koji Kobayashi Computers and Communications Award in 2022 and has contributed to Muriel Médard’s election to the U.S. National Academy of Engineering.

Data coding has been around for decades and there are many iterations of it in use in networks today. RLNC is the modern approach to data coding built specifically for decentralized computing. This scheme transforms data into packets for transmission across a network of nodes, ensuring high speed and efficiency.

It’s a mathematical, provably optimal way to handle memory for distributed systems — and Optimum is the first to bring it on-chain.

Optimizing Web3 From Top to Bottom

High-performance Web3 memory powered by RLNC empowers faster data propagation, efficient storage, and real-time access, making it a key solution for scalability and efficiency.

Blockchains rely on data moving efficiently across a network of nodes. RLNC is an advanced encoding technique that transforms data into encoded fragments, allowing nodes to recover information efficiently from a subset rather than receiving everything.

Optimum's products include OptimumP2P and decentralized Random Access Memory (deRAM) deliver benefits across the entire blockchain ecosystem:

  • For L1 and L2 blockchains: Faster block propagation, reduced bandwidth consumption, and optimized storage

  • For validators: Accelerated data propagation, lower operational costs, higher APY and MEV income

  • For dApp developers: Improved transaction relay and prioritization, enabling latency, throughput, and cost-sensitive apps

  • For end users: Faster transactions and more responsive interfaces, improve user experience

Built by Experts, Backed by Leaders

Behind Optimum is a world-class founding team with deep expertise in distributed systems, cryptography, and high-performance computing.

Meet the Core Team

  • Prof. Muriel Médard (Co-Founder) Twitter | LinkedIn

    • NEC Chair of Software Science and Engineering at MIT

    • Co-inventor of Random Linear Network Coding (RLNC)

    • Ranked #1 globally in network coding citations (Google Scholar)

    • U.S. National Academy of Inventor, U.S. National Academy of Engineering, American Academy of Arts and Sciences and German National Academy of Science.

  • Dr. Kishori Konwar (Co-Founder) LinkedIn

    • Former Senior Engineer & Scientist at Meta, MIT PostDoc

    • Previously a Quant Developer at Goldman Sachs

    • Deep expertise in distributed systems and fault-tolerant computing

  • Kent Lin (Co-Founder) Twitter | LinkedIn

    • Former Partner at GSR Ventures, a $4B global VC

    • Harvard MBA, President of Harvard Blockchain, Co-founder of Plug and Play Crypto

    • Founder of McKinsey Crypto DAO, with a focus on blockchain infrastructure and strategy

Advisors

  • Prof. Sriram Viswanath

    • B.Tech. from IIT Madras, M.S. from Caltech, and Ph.D. from Stanford, all in electrical engineering

    • Recipient of the NSF CAREER Award and IEEE IT/ComSoc Best Paper Award

    • Renowned for his work on coding theory, data compression, and distributed algorithms

  • Prof. Nancy Lynch

    • Former NEC Chair of Software Science and Engineering at MIT (predecessor to Muriel Médard)

    • Published the foundational consensus results in 1985

    • Creator of the DLS algorithm in 1988, a foundational precursor to modern consensus systems like Tendermint

Strategic Backers

Optimum recently announced the successful closure of its $11M seed round, led by 1kx, with participation from top-tier investors including Robot Ventures, CMT Digital, Spartan, Finality Capital, SNZ, Triton Capital, Big Brain, CMS, LongHash, NGC, Animoca, GSR, Caladan, Reforge, and more.

Optimum's angel investors include many renowned builders and investors, such as Abhijeet Mahagaonkar (CTO, Polychain), Arthur Cheong (Founder CEO CIO, DeFiance Capital), Gracy Chen (CEO, Bitget), Robinson Burkey (Co-founder CCO, Wormhole), Sandeep Nailwal (Co-founder, Polygon), Sankha Banerjee (Chief Economist, Babylon), Saurabh Sharma (GP, Jump Crypto), Tal Tchwella (Head of Product, Solana), and Zaki Manian (Co-founder, Sommelier), as well as co-founders of Aethir, Aztec, Espresso, Magna, Pyth, Quantstamp, Taiko, Zama, ZkCloud and more.

Our Vision: Scaling the World Computer, For Real This Time

Web3 doesn’t just need more block space or cheaper gas. It needs architecture that supports real-time data access, minimal latency, and scalable throughput—without compromising decentralization.

“If you think of Web3 as a world computer, what we’re building is the critical component every computer needs—memory,” says Muriel Médard, co-founder and CEO of Optimum. “With a high-performance memory layer, our goal is to scale every blockchain.”

By applying core ACID principles—Atomicity, Consistency, and Durability—in a decentralized context, Optimum enables a new paradigm: decentralized systems that can finally scale. This unlocks real-time, cost-sensitive applications in trading, gaming, AI, and beyond—previously bottlenecked by legacy blockchain architecture.

Final Thoughts: A New Standard for Web3

Optimum isn’t just patching symptoms—it’s solving the root problem. By introducing a true memory layer to Web3, Optimum has the potential to redefine decentralized computing from the ground up. We’re not just making blockchains faster. We’re making them smarter, more responsive, and ready for what’s next.

The world computer was never complete—until now.

Join Us!

Optimum is the first decentralized high-performance memory layer for the world computer, designed to eliminate scalability bottlenecks by enabling fast data propagation, efficient storage, and real-time access.

Optimum is now live on private testnet with OptimumP2P, actively onboarding L1s, L2s, validators, and node operators to experience the world computer’s missing memory layer in action.

  • Learn more at getoptimum.xyz

  • Follow Optimum on x.com/get_optimum.

  • Check our open roles at jobs.ashbyhq.com/optimum

Subscribe to Optimum
Receive the latest updates directly to your inbox.
Nft graphic
Mint this entry as an NFT to add it to your collection.
Verification
This entry has been permanently stored onchain and signed by its creator.
Arweave Transaction
W3rOx6kpMFYaJyE…aZ237yx1k1f_5p8
Author Address
0xBfAC4db6d990A6c…45c447B18EbeF73
Nft Address
0x5B73C343BA36A70…952D70361fabcC1
Content Digest
mAMElnrnv_5F4eJ…YXF5G-iYL8mx8Mo
More from Optimum
View All

Skeleton

Skeleton

Skeleton

272 Collectors
LOADING TEXT
#1
LOADING TEXT
#2
LOADING TEXT
#3
LOADING TEXT
#4
LOADING TEXT
#5
LOADING TEXT
#6
LOADING TEXT
#7
LOADING TEXT
#8
LOADING TEXT
#9
LOADING TEXT
#10
LOADING TEXT
#11
LOADING TEXT
#12
LOADING TEXT
#13
LOADING TEXT
#14
LOADING TEXT
#15
LOADING TEXT
#16
LOADING TEXT
#17
LOADING TEXT
#18
LOADING TEXT
#19
LOADING TEXT
#20
LOADING TEXT
#21
LOADING TEXT
#22
LOADING TEXT
#23
LOADING TEXT
#24
LOADING TEXT
#25
LOADING TEXT
#26
LOADING TEXT
#27
LOADING TEXT
#28
LOADING TEXT
#29
LOADING TEXT
#30
LOADING TEXT
#31
LOADING TEXT
#32
LOADING TEXT
#33
LOADING TEXT
#34
LOADING TEXT
#35
LOADING TEXT
#36
LOADING TEXT
#37
LOADING TEXT
#38
LOADING TEXT
#39
LOADING TEXT
#40
LOADING TEXT
#41
LOADING TEXT
#42
LOADING TEXT
#43
LOADING TEXT
#44
LOADING TEXT
#45
LOADING TEXT
#46
LOADING TEXT
#47
LOADING TEXT
#48
LOADING TEXT
#49
LOADING TEXT
#50
LOADING TEXT
#51
LOADING TEXT
#52
LOADING TEXT
#53
LOADING TEXT
#54
LOADING TEXT
#55
LOADING TEXT
#56
LOADING TEXT
#57
LOADING TEXT
#58
LOADING TEXT
#59
LOADING TEXT
#60
LOADING TEXT
#61
LOADING TEXT
#62
LOADING TEXT
#63
LOADING TEXT
#64
LOADING TEXT
#65
LOADING TEXT
#66
LOADING TEXT
#67
LOADING TEXT
#68
LOADING TEXT
#69
LOADING TEXT
#70
LOADING TEXT
#71
LOADING TEXT
#72
LOADING TEXT
#73
LOADING TEXT
#74
LOADING TEXT
#75
LOADING TEXT
#76
LOADING TEXT
#77
LOADING TEXT
#78
LOADING TEXT
#79
LOADING TEXT
#80
LOADING TEXT
#81
LOADING TEXT
#82
LOADING TEXT
#83
LOADING TEXT
#84
LOADING TEXT
#85
LOADING TEXT
#86
LOADING TEXT
#87
LOADING TEXT
#88
LOADING TEXT
#89
LOADING TEXT
#90
LOADING TEXT
#91
LOADING TEXT
#92
LOADING TEXT
#93
LOADING TEXT
#94
LOADING TEXT
#95
LOADING TEXT
#96
LOADING TEXT
#97
LOADING TEXT
#98
LOADING TEXT
#99
LOADING TEXT
#100
LOADING TEXT
#101
LOADING TEXT
#102
LOADING TEXT
#103
LOADING TEXT
#104
LOADING TEXT
#105
LOADING TEXT
#106
LOADING TEXT
#107
LOADING TEXT
#108
LOADING TEXT
#109
LOADING TEXT
#110
LOADING TEXT
#111
LOADING TEXT
#112
LOADING TEXT
#113
LOADING TEXT
#114
LOADING TEXT
#115
LOADING TEXT
#116
LOADING TEXT
#117
LOADING TEXT
#118
LOADING TEXT
#119
LOADING TEXT
#120
LOADING TEXT
#121
LOADING TEXT
#122
LOADING TEXT
#123
LOADING TEXT
#124
LOADING TEXT
#125
LOADING TEXT
#126
LOADING TEXT
#127
LOADING TEXT
#128
LOADING TEXT
#129
LOADING TEXT
#130
LOADING TEXT
#131
LOADING TEXT
#132
LOADING TEXT
#133
LOADING TEXT
#134
LOADING TEXT
#135
LOADING TEXT
#136
LOADING TEXT
#137
LOADING TEXT
#138
LOADING TEXT
#139
LOADING TEXT
#140
LOADING TEXT
#141
LOADING TEXT
#142
LOADING TEXT
#143
LOADING TEXT
#144
LOADING TEXT
#145
LOADING TEXT
#146
LOADING TEXT
#147
LOADING TEXT
#148
LOADING TEXT
#149
LOADING TEXT
#150
LOADING TEXT
#151
LOADING TEXT
#152
LOADING TEXT
#153
LOADING TEXT
#154
LOADING TEXT
#155
LOADING TEXT
#156
LOADING TEXT
#157
LOADING TEXT
#158
LOADING TEXT
#159
LOADING TEXT
#160
LOADING TEXT
#161
LOADING TEXT
#162
LOADING TEXT
#163
LOADING TEXT
#164
LOADING TEXT
#165
LOADING TEXT
#166
LOADING TEXT
#167
LOADING TEXT
#168
LOADING TEXT
#169
LOADING TEXT
#170
LOADING TEXT
#171
LOADING TEXT
#172
LOADING TEXT
#173
LOADING TEXT
#174
LOADING TEXT
#175
LOADING TEXT
#176
LOADING TEXT
#177
LOADING TEXT
#178
LOADING TEXT
#179
LOADING TEXT
#180
LOADING TEXT
#181
LOADING TEXT
#182
LOADING TEXT
#183
LOADING TEXT
#184
LOADING TEXT
#185
LOADING TEXT
#186
LOADING TEXT
#187
LOADING TEXT
#188
LOADING TEXT
#189
LOADING TEXT
#190
LOADING TEXT
#191
LOADING TEXT
#192
LOADING TEXT
#193
LOADING TEXT
#194
LOADING TEXT
#195
LOADING TEXT
#196
LOADING TEXT
#197
LOADING TEXT
#198
LOADING TEXT
#199
LOADING TEXT
#200
LOADING TEXT
#201
LOADING TEXT
#202
LOADING TEXT
#203
LOADING TEXT
#204
LOADING TEXT
#205
LOADING TEXT
#206
LOADING TEXT
#207
LOADING TEXT
#208
LOADING TEXT
#209
LOADING TEXT
#210
LOADING TEXT
#211
LOADING TEXT
#212
LOADING TEXT
#213
LOADING TEXT
#214
LOADING TEXT
#215
LOADING TEXT
#216
LOADING TEXT
#217
LOADING TEXT
#218
LOADING TEXT
#219
LOADING TEXT
#220
LOADING TEXT
#221
LOADING TEXT
#222
LOADING TEXT
#223
LOADING TEXT
#224
LOADING TEXT
#225
LOADING TEXT
#226
LOADING TEXT
#227
LOADING TEXT
#228
LOADING TEXT
#229
LOADING TEXT
#230
LOADING TEXT
#231
LOADING TEXT
#232
LOADING TEXT
#233
LOADING TEXT
#234
LOADING TEXT
#235
LOADING TEXT
#236
LOADING TEXT
#237
LOADING TEXT
#238
LOADING TEXT
#239
LOADING TEXT
#240
LOADING TEXT
#241
LOADING TEXT
#242
LOADING TEXT
#243
LOADING TEXT
#244
LOADING TEXT
#245
LOADING TEXT
#246
LOADING TEXT
#247
LOADING TEXT
#248
LOADING TEXT
#249
LOADING TEXT
#250
LOADING TEXT
#251
LOADING TEXT
#252
LOADING TEXT
#253
LOADING TEXT
#254
LOADING TEXT
#255
LOADING TEXT
#256
LOADING TEXT
#257
LOADING TEXT
#258
LOADING TEXT
#259
LOADING TEXT
#260
LOADING TEXT
#261
LOADING TEXT
#262
LOADING TEXT
#263
LOADING TEXT
#264
LOADING TEXT
#265
LOADING TEXT
#266
LOADING TEXT
#267
LOADING TEXT
#268
LOADING TEXT
#269
LOADING TEXT
#270
LOADING TEXT
#271
LOADING TEXT
#272