[Vitalik: Blockchain's Layered Structure for Scalability in Computation, Data, and State] Ethereum co-founder Vitalik Buterin published an article explaining the scalability hierarchy within blockchain, specifically computation, data, and state. He stated that computation is relatively the easiest to scale, achievable through parallel processing, requiring block builders to provide 'hints,' or directly replacing extensive computation with proofs. Data falls in the middle tier; if data is required to have availability guarantees, this requirement cannot be bypassed. However, it can be split using technologies like sharding or erasure coding (e.g., PeerDAS) and can achieve graceful degradation (e.g., nodes with only 1/10 of the data capacity can still produce blocks 1/10 the size). State is the hardest to scale. To ensure the verifiability of a single transaction, the complete state must be obtained. If the state is replaced with a tree and only the root hash is retained, updating the root still requires the complete state. Although there are methods to split the state, these methods often involve architectural changes and lack general applicability. Therefore, he concluded that if data can replace state or computation can replace data without introducing new centralization risks, such solutions should be seriously considered in principle.