Back to Glossary
Blockchainmerkle-tree-general

Merkle Tree

Also known asHash Tree
A binary tree where each leaf node is a hash of data and each internal node is the hash of its two children. The root hash (Merkle root) uniquely represents all underlying data. Merkle trees enable efficient proof of inclusion—proving a specific element exists requires only O(log n) hashes. Used in blockchains for transaction verification and state storage.
Decode this term

Related terms

2
Blockchain

Hash Function (Cryptographic)

A one-way mathematical function that maps arbitrary-length input to a fixed-size output (digest). Properties: determinis...

ZK & Compression

Merkle Proof

A Merkle proof is the minimal set of sibling node hashes (the proof path) along the branch from a specific leaf to the t...