One thing I learned today:

Verkle Trees:

In order for Ethereum to reach a stateless clients there needs to be a way for clients to validate incoming blocks without storing the entire ETH database. Stateless clients would use a “witness” to the data instead. Right now, witnesses are too large for clients to use and validate within the 12 second slot. Verkle trees would enable small witnesses.

What is a Witness?

In order to verify a block, the it requires re-executing the transactions in the block to calculate root hash and matching it with the one within the block. This is to ensure the computation by the proposer was actually done. In order to update the ETH blockchain, clients require access to the whole database (state). Witnesses allow verifiers to verify blocks without downloading the entire dataset and instead breaking it down into fragments.

Every witness contains smaller fragments of data, so in order for the block to be verified the fragment of data needs to be small enough to be verified by multiple computers in under 12 seconds. If it takes longer than 12 seconds it creates a more centralized ecosystem with computers that only have the necessary computing power to be able to download the data.

Verkle trees allow for all the necessary information to verify a block to be within the block itself. This eliminates the need for the ETH blockchain to be stored on hard drive.

Verkle Trees enable smaller witnesses by creating a more efficient path from the leaves of the tree to the root. It can do this by eliminating the need to provide sibling nodes to verify the root hash.

Introducing a polynomial commitment scheme also creates a fixed size for the witnesses that create an easier way for witnesses to be passed along the peer-to-peer network under 12 seconds to be validated.

Structure of Verkle Tree vs Merkle Tree:

Verkle Trees create a smaller proof size between the leaves and root of the data tree. As shown above, the verkle tree creates an extension with a suffix tree that then creates a location parameter for the transaction. This allows the witness to verify the transaction in a much more efficient way.

For a more in-depth read on Verkle Trees please read the two articles below on the ETH roadmap website and Vitalik’s blog.

https://ethereum.org/roadmap/verkle-trees#verkle-trees

Affirmations:

I will run the 2024 NYC marathon under 4:00:00 and exceed my fundraising goal

I will grow my blog by 10% every month using web3 tools

Gratitude:

Grateful for the sun being out more recently. It has made being and running outside much easier as of late.

Miracle morning:

Read: yes

Meditate: yes

Workout: Yes (run and chest)

Make my bed: yes

Affirmations: yes

gratitude: yes

One thing I learned today:

Verkle Trees:

In order for Ethereum to reach a stateless clients there needs to be a way for clients to validate incoming blocks without storing the entire ETH database. Stateless clients would use a “witness” to the data instead. Right now, witnesses are too large for clients to use and validate within the 12 second slot. Verkle trees would enable small witnesses.

What is a Witness?

In order to verify a block, the it requires re-executing the transactions in the block to calculate root hash and matching it with the one within the block. This is to ensure the computation by the proposer was actually done. In order to update the ETH blockchain, clients require access to the whole database (state). Witnesses allow verifiers to verify blocks without downloading the entire dataset and instead breaking it down into fragments.

Every witness contains smaller fragments of data, so in order for the block to be verified the fragment of data needs to be small enough to be verified by multiple computers in under 12 seconds. If it takes longer than 12 seconds it creates a more centralized ecosystem with computers that only have the necessary computing power to be able to download the data.

Verkle trees allow for all the necessary information to verify a block to be within the block itself. This eliminates the need for the ETH blockchain to be stored on hard drive.

Verkle Trees enable smaller witnesses by creating a more efficient path from the leaves of the tree to the root. It can do this by eliminating the need to provide sibling nodes to verify the root hash.

Introducing a polynomial commitment scheme also creates a fixed size for the witnesses that create an easier way for witnesses to be passed along the peer-to-peer network under 12 seconds to be validated.

Structure of Verkle Tree vs Merkle Tree:

Verkle Trees create a smaller proof size between the leaves and root of the data tree. As shown above, the verkle tree creates an extension with a suffix tree that then creates a location parameter for the transaction. This allows the witness to verify the transaction in a much more efficient way.

For a more in-depth read on Verkle Trees please read the two articles below on the ETH roadmap website and Vitalik’s blog.

https://ethereum.org/roadmap/verkle-trees#verkle-trees

Affirmations:

I will run the 2024 NYC marathon under 4:00:00 and exceed my fundraising goal

I will grow my blog by 10% every month using web3 tools

Gratitude:

Grateful for the sun being out more recently. It has made being and running outside much easier as of late.

Miracle morning:

Read: yes

Meditate: yes

Workout: Yes (run and chest)

Make my bed: yes

Affirmations: yes

gratitude: yes