Stateless Ethereum: How Verkle Trees Make Ethereum Lean and Mean by Guillaume Ballet

TL;DR

Vertical trees are a new way of organizing data in Ethereum, offering benefits such as self-contained execution units, smaller proof sizes, and state expiry capabilities.

Transcript

foreign hi um yeah excellent so uh yeah I'm going to talk about Virgo trees I've been making a few presentations about those already but they tended to be a bit too uh deep technically speaking so because this is Defcon and we're trying to onboard more people this one is going to be a bit more high level so hopefully enough to to raise your interes... Read More

Key Insights

• 💨 Vertical trees offer a more efficient way of accessing and executing specific blocks in Ethereum by creating self-contained execution units.
• 😒 The use of vertical trees reduces proof sizes, making it cheaper and faster to retrieve deleted states in Ethereum.
• 🌲 The transition to vertical trees requires overcoming challenges such as the conversion from a Merkle tree, slower cryptographic primitives, and adaptations in database design.
• 🌲 Vertical trees have applications in blockchain tooling, wallets, and Layer Two solutions, providing opportunities for innovation and optimization.
• 🫢 The gas model in Ethereum will change with the introduction of vertical trees, potentially rendering some contract optimization techniques obsolete.
• 🏆 Two test nets for vertical trees implementation are currently available, offering opportunities for developers to test and experiment with the new system.

Questions & Answers

Q: What are the main advantages of using vertical trees in Ethereum?

Vertical trees allow for self-contained execution units, smaller proof sizes, and state expiry capabilities.

Q: How do vertical trees address the issue of accessing specific blocks in Ethereum?

By including all necessary data in the block, vertical trees allow for easier access and execution of specific blocks without the need for synchronization.

Q: How do vertical trees reduce proof sizes in Ethereum?

Vertical trees only require passing the necessary nodes along the path to a specific value, eliminating the need to pass sibling data and resulting in smaller proof sizes.

Q: What challenges are associated with the transition to vertical trees in Ethereum?

Challenges include the conversion from a Merkle tree, slower cryptographic primitives, and database design adaptations.

Key Insights:

• Vertical trees offer a more efficient way of accessing and executing specific blocks in Ethereum by creating self-contained execution units.
• The use of vertical trees reduces proof sizes, making it cheaper and faster to retrieve deleted states in Ethereum.
• The transition to vertical trees requires overcoming challenges such as the conversion from a Merkle tree, slower cryptographic primitives, and adaptations in database design.
• Vertical trees have applications in blockchain tooling, wallets, and Layer Two solutions, providing opportunities for innovation and optimization.
• The gas model in Ethereum will change with the introduction of vertical trees, potentially rendering some contract optimization techniques obsolete.
• Two test nets for vertical trees implementation are currently available, offering opportunities for developers to test and experiment with the new system.
• Pre-image availability and the optimization of cryptographic primitives are areas of improvement for vertical trees implementation in Ethereum.

Summary & Key Takeaways

• Vertical trees allow for the creation of self-contained execution units in Ethereum blocks, making it easier to access and execute specific blocks of interest.

• The use of vertical trees reduces proof sizes, making it cheaper and faster to resurrect deleted states in Ethereum.

• The transition to vertical trees requires overcoming challenges such as the conversion from a Merkle tree, slower cryptographic primitives, and database design adaptations.