# Merkle Tree and Transaction Hashing

<figure><img src="/files/S01vlDkYmQ7KvFcDZytS" alt=""><figcaption></figcaption></figure>

*To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree, with only the root included in the block's hash.*

Satoshi Nakamoto, Bitcoin Whitepaper

To facilitate the removal of individual transactions without compromising the integrity of the block's hash, a **Merkle Tree** is employed. This data structure allows for the efficient organization and verification of transactions.

Each transaction is hashed, and **these hashes are combined (concatenated) in pairs to create parent hashe**s, ultimately leading to a single **Merkle Root** that represents all transactions in the block.

This hierarchical structure **resembles an inverted family tree**, where each level reduces the number of data items until reaching the root.

The **Merkle root is embedded in the block header**, ensuring that any alteration to a transaction would result in a different root hash, thus maintaining the integrity of the blockchain.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-whitepaper-series/section-7-reclaiming-disk-space-bitcoin-whitepaper/merkle-tree-and-transaction-hashing.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.