Vitalik Buterin's Layered Understanding of Blockchain Scalability

Why are some aspects of a blockchain easier to scale than others? Vitalik Buterin, co-founder of Ethereum, provides a clear answer: he proposes a hierarchy of difficulty where fundamental components exhibit very different levels of complexity. His layered understanding reveals that not all scalability challenges are equal, and this distinction is key to understanding future expansion strategies.

According to the analysis shared by Odaily, Buterin classifies blockchain components from the simplest to the most complex: computation, data, and state. This hierarchy is not arbitrary but reflects the inherent technical limitations at each level.

Why is Computation the Easiest to Scale?

Computation presents the least challenge within this layered understanding. Through parallelization and the “trails” provided by block builders, processing can be significantly optimized. Additionally, replacing intensive computation with cryptographic proofs, such as zero-knowledge proofs, offers an alternative scalability route that has proven effective. This flexibility makes computation relatively manageable.

Data: The Balance Between Availability and Scalability

Data availability represents an intermediate-level difficulty. While simple systems can do without robust guarantees, those requiring distributed verification must address this problem carefully. Smart data partitioning and methods like erasure coding, exemplified in proposals like PeerDAS, enable storage optimization. Equally important is allowing nodes with lower capacity to continue participating in the network through “elegant degradation,” where they can maintain smaller blocks without losing critical functionality.

The State, the True Challenge of Layered Understanding

State constitutes the most severe bottleneck. This is where the fundamental complexity lies: even to verify a single transaction, nodes need full access to the state. Although the state could be modeled as a tree where only the root is stored, updating that root still depends on the entire state. State sharding is possible but typically requires deep architectural modifications that are not universally applicable to all systems.

Buterin concludes with a clear prioritization of this layered understanding: if data can replace state efficiently without introducing new forms of centralization, that should be the priority. Similarly, if computation can substitute data while maintaining the same decentralization guarantees, that option deserves serious consideration. This efficient substitution logic is at the heart of his approach to blockchain scalability.