How Does a Merkle Proof Allow a Light Client to Verify a Transaction?

A Merkle Proof provides the minimal set of hashes required to verify that a specific transaction is included in a block, without downloading the entire block. A light client only needs the Merkle Root of the block and the proof (a branch of hashes from the transaction up to the root) to confirm the transaction's existence.

The client re-computes the path and checks if the final hash matches the known Merkle Root.

What Is a SPV Client and How Does It Use the Merkle Root?
How Does a ‘Light Client’ Utilize the Merkle Root for Verification?
How Is the Merkle Tree Structure Used to Verify Transactions Efficiently?
How Does a Merkle Tree Relate to Transaction Integrity?
What Is a Merkle Tree and How Does It Use Hashing to Verify Transactions?
How Does a Merkle Tree Use Hashing to Verify Transactions?
In a Financial Context, How Does the Merkle Root Ensure Data Integrity?
How Is the Merkle Root Calculated from the Individual Transaction Hashes?

Glossar