A commitment tree using vector commitments, enabling smaller proofs than Merkle trees for large state.
Verkle trees use vector commitments to drastically reduce proof sizes when proving membership or values in large maps, improving stateless client designs.
"Stateless Ethereum proposals use Verkle trees so light clients can verify state with much smaller proofs."
A Merkle tree is a binary tree of hashes that enables efficient verification of large data sets, used in blockchains for transaction inclusion proofs.
An execution environment that runs smart contract code deterministically across nodes (e.g., EVM).
A Layer-2 technique that executes transactions off-chain and posts compressed proofs or data to the base chain.
All terms and definitions may update as the Cryptionary improves.