What Is a Merkle Tree in the Context of a Block?

A Merkle Tree (or hash tree) is a data structure used to efficiently verify the integrity and validity of transaction data within a block. It works by repeatedly hashing pairs of transaction IDs until a single root hash, the Merkle Root, is produced.

This root is included in the block header.

How Does a Merkle Root Verify a Transaction without Exposing the Entire Block?
What Is a ‘Merkle Tree’ and Why Is It Essential for Blockchain Efficiency?
What Is a Merkle Tree and How Does It Use Hashing to Verify Transactions?
How Is the Merkle Tree Root Hash Used to Prove the Inclusion of a Transaction in a Block?
How Does a ‘State Root’ in Ethereum Compare to the Merkle Root in Bitcoin?
What Is the Purpose of a “Block Header” in a Blockchain?
What Is the Role of a Merkle Tree in Transaction Verification?
How Does a ‘Merkle Tree’ Relate to Off-Chain Data Verification?

Glossar