Verkle trees require just 150 bytes to produce proofs for a billion data points. It is most expensive as compared to other forms of trees in blockchain.
A Merkle tree would require 1 kilobyte for the same amount of data.
When cryptographic hashes are used to generate proofs of data in a binary tree then it is called a Merkle tree. It was created by Ralph Merkle in 1988. It is used with bitcoin and ethereum. It is a hash based mathematical data structure that assembles and put together the abstract of each operation in a block.
And when polynomial commitments are used to organize data and create witnesses for proofs of data it is called as Verkle Tree. It was created by John Kuszmaul in 2018. It is used with upcoming ethereum upgrades. The nodes of the Verkle tree resemble Ethereum’s current Merkle Patricia tree having three dominant properties. The first one is that it is empty, secondary its a leaf node with key and value, and thirdly, it is an intermediate node with an establis
We współpracy z: https://www.thecoinrepublic.com/2023/04/28/merkle-trees-or-verkle-trees-which-is-better/
