How Does a Merkle Tree Enable “Simplified Payment Verification” (SPV)?

A Merkle Tree organizes all transactions in a block into a single root hash. SPV clients, typically light wallets, only need the block header and a small path of hashes, called a Merkle proof, to verify that a specific transaction was included in the block.

They do not need to download the entire blockchain, saving bandwidth and storage. This path confirms the transaction's inclusion without revealing all other transactions.

What Are the Security Trade-Offs of Using an SPV Wallet versus a Full Node?
Can SPV Be Used to Verify the State of a Smart Contract?
How Is a Merkle Proof Used to Verify a Transaction without Downloading the Entire Blockchain?
How Does the Reduced Security of an SPV Client Manifest Compared to a Full Node?
How Is the Merkle Tree Root Hash Used to Prove the Inclusion of a Transaction in a Block?
Why Is the Merkle Root Essential for Simplified Payment Verification (SPV)?
How Does a Block header’S Merkle Root Relate to the Immutability of the Block’s Transaction Data?
How Does a Merkle Proof Verify a Transaction without Revealing All Data?

Glossar