Unlock your trading potential! Become a verified Bitget elite trader and earn 10,000 USDT to help skyrocket your profits. Join now and start your journey to success!
Share link:In this post: Ethereum is moving towards stateless validation to reduce data storage. Verkle Trees offer compact proofs for block verification, reducing storage requirements. STARKs provide smaller, faster proofs than Verkle Trees but require more computational power.
Ethereum’s network could progress towards stateless validation as its data storage and verification needs grow. Co-founder Vitalik Buterin proposes 2 solutions for this transition—Verkle trees and STARKs.
While both approaches make block verification more efficient and accessible, there are trade-offs regarding security, efficiency, and implementation complexity.
How STARKs weigh as an alternative to Verkle Trees?
Ethereum co-founder Vitalik Buterin has released another blog to explain the network’s possible future. Buterin has focused on stateless validation in this blog, where nodes can verify blocks without storing the full Ethereum state.Touching upon The Verge, he explains that it was earlier aimed at making the Ethereum protocol efficient by making the computational requirements for verification low. However, he adds that the goal now is to verify the chain with SNARKs.
Verkle trees and STARKs, both ways want to make the computational requirements for block verification lower. Meanwhile SNARKs—succinct non-interactive arguments of knowledge—are also part of Ethereum’s future.
Verkle trees would allow nodes to verify Ethereum blocks by generating compact proofs, which will reduce the need for nodes to store the entire state. However, Verkle trees could face potential limitations with quantum computing in the future. He believes that the complex technology is now more viable and could skip Verkle trees altogether.
Meanwhile, The Verge has 2 main goals. The first is to reduce the amount of data a node needs to store to verify Ethereum transactions. The second is to make the computational requirements for verification so low that even mobile devices and smartwatches can participate in the network.
So no matter which route Ethereum takes for stateless verification—Verkle or STARKs—the aim is to address the growing size of data. Buterin stated, “The raw state data increases by ~30 GB per year, and individual clients have to store some extra data on top to be able to update the trie efficiently.”
How deploying Stateless Verification could simplify node setup
Notably, growing size of Ethereum’s data has made it difficult for stakers to set up and upgrade their nodes. Due to this reason, Buterin advocates for stateless validation to solve this issue by letting nodes verify blocks without storing all the data. The process allows nodes to verify blocks using a witness that includes state values and cryptographic proofs. However, for stateless validation to work efficiently, Ethereum’s current Merkle Patricia tree structure would need to be replaced, as it’s not ideal for creating compact, easy-to-verify proofs.
See also Soneium phishing ad scam drains assets; 3 ways to protect connected wallet
But as stateless verification incorporates Verkle Trees or STARKs, which route would be better for Ethereum? Both methods have strengths and weaknesses. Verkle trees use elliptic curve-based vector commitments, which create compact proofs but may still be vulnerable to future quantum attacks. They are also easier to implement with Ethereum’s current architecture. STARKs, on the other hand, offer smaller proof sizes—about 100-300 kB compared to Verkle’s 2.6 MB—and potentially faster proving times. However, they require more computational power and have yet to be fully integrated into Ethereum’s system.
0
0
Disclaimer: The content of this article solely reflects the author's opinion and does not represent the platform in any capacity. This article is not intended to serve as a reference for making investment decisions.