Merkle Patricia Trie | ethereum.org
ethereum.org · 2,738 words · saved by 1 readers
Introduction to Merkle Patricia Trie.
Merkle Patricia Trie Copy .md Copy .md Edit page (opens in a new tab) On this page The state of Ethereum (the totality of all accounts, balances, and smart contracts), is encoded into a special version of the data structure known generally in computer science as a Merkle Tree. This structure is useful for many applications in cryptography because it creates a verifiable relationship between all the individual pieces of data entangled in the tree, resulting in a single root value that can be used to prove things about the data. Ethereum's data structure is a 'modified Merkle-Patricia Trie', nam
related reading
- The Hitchhiker's Guide to Ethereum - Delphi Digitalmembers.delphidigital.io
- How does Ethereum work, anyway?preethikasireddy.com
- Merklizing the key/value store for fun and profit | Joel Gustafsonjoelgustafson.com
- Merkle Tree | Brilliant Math & Science Wikibrilliant.org
- How Cursor Indexes Codebases Fastread.engineerscodex.com
- Merkle Trees · tendermint/tendermint Wiki · GitHubgithub.com
- Verkle trees | ethereum.orgethereum.org
- Trie - Wikipediaen.wikipedia.org
- Should Ethereum be okay with enshrining more things in the protocol?vitalik.eth.limo
- Merkle Trees & Merkle Roots: Bitcoin & Blockchain | Geminigemini.com
- On Abstraction | Ethereum Foundation Blogblog.ethereum.org
- EVM Codes - Opcodesevm.codes