# Proof of Inclusion via Merkle Root

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

The **Merkle Root** plays a pivotal role in providing a **proof of inclusion** for transactions within a block. By retaining only the Merkle root and a compact set of hashes, nodes can demonstrate that a specific transaction is part of a block without needing to store the entire Merkle tree. This proof of inclusion is achieved through a process known as the **Merkle path**, which consists of the hashes required to verify the transaction's presence in the tree. This compact representation not only saves storage space but also enhances the speed and efficiency of transaction verification.


---

# 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/proof-of-inclusion-via-merkle-root.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.