🌴
MerklePatriciaTrie
  • Introduction
  • Nodes
    • Leaf
    • Extension
    • Branch
    • Hash
  • Util
    • Nibble
    • Compact Encoding
  • Operations
    • Put
    • Get
    • Del
    • Hash
    • Proof
    • Commit
  • Storage
    • Pebble
    • MPT
  • Integration tests
  • Test Coverage
  • Roadmap
Powered by GitBook
On this page

Last updated 1 year ago

🧐 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 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 .

  • 🧐 What is a Merkle Patricia Tree?
  • ✨ Advantages:
  • 📢 Repository Note:
NextLeaf

Introduction

Hello and welcome to the documentation for the MerklePatriciaTrie repository!

MerklePatriciaTrie
Roadmap