The Blockchain Library

# Merkle Tree Content type: Glossary Term Summary: A binary tree data structure where each leaf node is a hash of a data block (e.g., a transaction), and each parent node is a hash of its children. The root hash summarizes all data, enabling efficient and verifiable inclusion proofs without downloading the entire dataset. Related resources: - Hash Function (Glossary Term): https://theblockchainlibrary.com/glossary/hash-function - Zero-Knowledge Proof (ZKP) (Glossary Term): https://theblockchainlibrary.com/glossary/zero-knowledge-proof

advanced

Merkle Tree

A binary tree data structure where each leaf node is a hash of a data block (e.g., a transaction), and each parent node is a hash of its children. The root hash summarizes all data, enabling efficient and verifiable inclusion proofs without downloading the entire dataset.

Examples

Bitcoin blocks use Merkle trees to summarize all transactions in a single root hash.
A Merkle proof lets you verify one transaction is in a block without downloading all transactions.

Knowledge Explorer

Explore This Concept in the Knowledge Graph

See how Merkle Tree connects to other concepts, books, research, and developer resources.

Explore Connections

Related Terms

Hash Function

A mathematical function that takes input of any size and produces a fixed-size output (hash). Cryptographic hash functions are deterministic, one-way, collision-resistant, and exhibit the avalanche effect — making them essential for blockchain integrity.

Zero-Knowledge Proof (ZKP)

A cryptographic method that allows one party (the prover) to prove to another (the verifier) that a statement is true, without revealing any information beyond the validity of the statement itself. ZKPs enable privacy and scalable verification in blockchain systems.