Merkle Patricia Trie | ethereum.org
ethereum.org
A Merkle Patricia Trie provides a cryptographically authenticated data structure that can be used to store all (key, value) bindings. This means that they have the same root hash, Moreover, they are simpler to understand and code than more complex comparison-based alternatives, like red-black trees
2 Users
0 Comments
12 Highlights
0 Notes
Top Highlights
- A Merkle Patricia Trie provides a cryptographically authenticated data structure that can be used to store all (key, value) bindings.
- This means that they have the same root hash,
- Moreover, they are simpler to understand and code than more complex comparison-based alternatives, like red-black trees
- NULL (represented as the empty string) branch A 17-item node [ v0 ... v15, vt ] leaf A 2-item node [ encodedPath, value ] extension A 2-item node [ encodedPath, key ]
- , we convert both paths and values to bytes.
Tags
merklepatriciatree
Domain
Ready to highlight and find good content?
Glasp is a social web highlighter that people can highlight and organize quotes and thoughts from the web, and access other like-minded people’s learning.