Merkle Patricia tree
E466596
A Merkle Patricia tree is a hybrid data structure combining Merkle trees and Patricia tries, widely used in systems like Ethereum to provide efficient, verifiable key–value storage.
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
authenticated data structure
ⓘ
data structure ⓘ key–value store index ⓘ |
| basedOn |
Merkle tree
NERFINISHED
ⓘ
Patricia trie NERFINISHED ⓘ |
| comparedWith |
plain Patricia trie
ⓘ
simple Merkle tree ⓘ |
| designedFor |
blockchain systems
ⓘ
untrusted distributed environments ⓘ |
| enables |
efficient state pruning strategies
ⓘ
lightweight fraud proofs ⓘ stateless client designs ⓘ |
| ensures |
data authenticity
ⓘ
data integrity ⓘ efficient verification without full data download ⓘ |
| hasComponent |
branch node
ⓘ
extension node ⓘ leaf node ⓘ |
| hasProperty |
deterministic structure for a given key–value set
ⓘ
hash-based node addressing ⓘ prefix-compressed keys ⓘ supports efficient synchronization ⓘ supports light client verification ⓘ supports sparse key space ⓘ |
| provides |
compact proofs of exclusion
ⓘ
compact proofs of inclusion ⓘ cryptographic commitment to data ⓘ efficient key deletion ⓘ efficient key insertion ⓘ efficient key lookup ⓘ tamper-evident storage ⓘ |
| rootStoredIn | Ethereum block header NERFINISHED ⓘ |
| rootType |
receiptsRoot
ⓘ
stateRoot ⓘ transactionsRoot ⓘ |
| usedFor |
account state storage
ⓘ
receipt trie in Ethereum blocks ⓘ state storage in Ethereum ⓘ storage trie for smart contracts ⓘ transaction trie in Ethereum blocks ⓘ verifiable key–value storage ⓘ |
| usedIn |
Ethereum
NERFINISHED
ⓘ
Ethereum mainnet NERFINISHED ⓘ Ethereum testnets NERFINISHED ⓘ |
| uses |
cryptographic hash function
ⓘ
hexary (16-way) branching in Ethereum ⓘ key hashing before insertion in Ethereum ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.