Verkle Tree is an important part of the ETH2.0 upgrade. Compared with Merkle Tree, the size of Proof has been greatly improved; for data with a scale of one billion, the proof of Merkle Tree needs about 1kB, while for Verkle Tree, it will be less than 150Bytes.
first level title
Merkle Tree
Merkle Tree is a common accumulator, which can be used to prove that an element exists in the accumulator, as shown in the following figure:
first level title
Verkle Trees - concept
Basis
KZG for single point
secondary titleSchwartz‒Zippel lemma）。
KZG for multi-points
Verkle Tree - ETH
Compress for multi-polys
first level title
Key properties
a. This scheme allows any number of Prove points, and the size of Proof is constant (one promise, one proof: π )
b. The value of yi can not be provided explicitly, because it is the hash of the value of the next layer;
c. The value of xi may not be provided explicitly, but can be judged according to the Key;
first level title
about Us
1. PCS multiproofs using random evaluation - Dankrad Feist；
about Us
Sin7y was established in 2021 and is composed of top blockchain developers. We are both a project incubator and a blockchain technology research team, exploring the most important and cutting-edge technologies such as EVM, Layer2, cross-chain, privacy computing, and autonomous payment solutions.
WeChat public account: Sin7Y
GitHub | Twitter | Telegram | Medium| Mirror | HackMD | HackerNoon
IOS
Android