A Merkle root summarizes a tree of hashes. In Bitcoin's transaction tree, transaction identifiers form the leaves, pairs are combined and hashed, and the process repeats until one value remains. The block header commits to that root. Changing a committed transaction changes the expected root under the hash construction's security assumptions. The root is useful because it is compact regardless of how many transactions the block contains; it is not a compressed copy from which those transactions can be recovered.

Consider eight transactions arranged as leaves in a balanced binary tree. To demonstrate one leaf's membership, a proof supplies the neighboring hash needed at each level rather than all seven other transactions. The verifier recomputes the path and compares the result with a trusted root. For this simple example, three sibling hashes suffice. Position and ordering matter: swapping the order in which values are combined generally changes the result. Real protocols specify serialization and edge cases that an implementation must reproduce exactly.

A valid inclusion proof says that specified data belongs to a commitment; it does not independently establish that the containing block follows every consensus rule, that the transaction succeeded economically, or that the data remains available elsewhere. The verifier also needs a justified way to trust the root, such as an authenticated chain of headers. Proof systems on other networks may commit to account state, receipts, or scripts using different tree structures. Identify the committed object before interpreting what a proof actually demonstrates.