# Introduction

### 🧐 What is a Merkle Patricia Tree?

The Merkle Patricia Tree is a structured combination of:

1. **Merkle Tree**: Known for its cryptographic verification. Each leaf node encapsulates the hash of a data piece, and non-leaf nodes hold the cryptographic hash of their child nodes
2. **Patricia Trie (Radix Tree)**: A space-efficient trie that collapses single-child nodes, optimizing space usage

MPT efficiently brings together cryptographic verification and space optimization.

### ✨ Advantages:

1. **Immutable History**: With its cryptographic features, MPT ensures data integrity over time
2. **Efficient Storage**: MPT offers a compact representation, beneficial for systems with vast datasets
3. **Verifiable Proofs**: MPT can provide proofs confirming data's presence or absence

### 📢 Repository Note:

The [`MerklePatriciaTrie`](https://github.com/Aleksao998/MerklePatriciaTrie) repo is implemented in Go. It's worth noting that the current version is still under development and **not ready for production use**. For more on its developmental trajectory, consult the [Roadmap](/merklepatriciatrie/roadmap.md).


---

# 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://gotolabs.gitbook.io/merklepatriciatrie/introduction.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.