> For the complete documentation index, see [llms.txt](https://gotolabs.gitbook.io/merklepatriciatrie/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://gotolabs.gitbook.io/merklepatriciatrie/introduction.md).

# 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).