Back to Glossary
AdvancedTechnology

Merkle Tree

Definition

A data structure where every leaf node contains a hash of a data block and every non-leaf node contains a hash of its child nodes, forming a tree that culminates in a single root hash (the Merkle root). Merkle trees allow efficient and secure verification that specific data is included in a large dataset without downloading the entire dataset — a property essential to blockchain scalability and light client operation.

Example

Bitcoin includes a Merkle root in each block header that summarizes all transactions in that block. A light wallet can verify a specific transaction is included by downloading only a small Merkle proof rather than the entire block.

Related Terms