**[Vitalik Buterin: The Core Difficulties of Blockchain Scalability Are Computation, Data, and State in Order]** Odaily Planet Daily News: Vitalik Buterin published an article explaining his layered understanding of blockchain scalability, pointing out that the difficulties of blockchain scalability, from lowest to highest, are computation, data, and state. Vitalik stated that computation is the easiest to scale. This can be achieved through parallelization, introducing "hints" provided by block builders, or replacing large amounts of computation with proofs such as zero-knowledge proofs. Data scalability is moderately difficult. If the system requires data availability guarantees, this requirement cannot be avoided. However, it can be optimized by splitting data, using erasure coding (such as PeerDAS), and supporting "graceful degradation," meaning that even when a node's data capacity is low, it can still generate blocks of the corresponding size. In contrast, state is the most challenging part to scale. Vitalik pointed out that to verify even a single transaction, nodes require the complete state. Even if the state is abstracted into a tree and only the root node is stored, updating the root still depends on the complete state. Although there are methods to split the state, they usually require significant architectural adjustments and are not universal solutions. Based on this, Vitalik concluded: If it is possible to replace state with data without introducing new centralization assumptions, it should be prioritized. Similarly, if it is possible to replace data with computation without introducing new centralization assumptions, it should also be seriously considered.