This visionary initiative, championed by Vitalik Buterin, aims to bolster ETH’s compatibility with ZK proofs, addressing existing limitations.
A technology recently discussed by Vitalik Buterin has the potential to substantially improve the primary network of Ethereum.
By transitioning Ethereum’s existing system to “Verkle trees,” this technology enhances the network’s compatibility with zero-knowledge proofs (ZKs). ZK proofs establish knowledge of a particular piece of information without disclosing that information.
As an element of Ethereum’s fundamental architecture, “keccak Merkle Patricia trees” are currently subject to limitations, as noted by Vitalik Buterin.
The enormous “witness sizes”—the quantity of data required to verify a transaction—which can reach 300 MB—are the primary concern. Such dimensions are not feasible for procedures that require a compact and efficient design, such as zero-knowledge proofs.
In contrast, “Verkle trees” are specifically engineered to facilitate zero-knowledge proofs. They employ an alternative cryptographic methodology and rely on a particular category of mathematical curves that is more suitable for this objective.
Vitalik Buterin’s Endorsement of Verkle Trees
Adopting of Verkle trees would facilitate the implementation of zero-knowledge proofs on Layer 1 of Ethereum.
Polygon’s zkEVM Type 1 has made significant technological progress. The network efficiently executes proofs by utilising the necessary computational resources.
The Ethereum community’s preference is for the implementation of Verkle trees, as opposed to the modifications proposed in proposals such as EIP-3102.
Generally, improvements in scalability and efficacy have a beneficial effect on the value of digital assets.
However, the implementation of Verkle trees may result in reduced transaction fees and speeds, which may entice additional developers and users to join the Ethereum network. Consequently, this increased demand and activity may cause the price of Ethereum to rise.
