Block Chain Notes
  • Introduction
  • CryptoGraphy
    • Hashing
  • which type of Block chain
  • Projects
  • Why it is called block chain
  • First Block - Genesis Block
  • Block Chain Nodes
  • simulation
  • fullnodes Vs large Clients
  • How Conflicts are Resolved
  • When to use blockchain
  • Why Block chain is more secured
  • How Blckchain can be hacked
  • reasons to avoid blockchain
  • Agreements
  • What is blockchain
  • Requirements for a blockchain in a business environment
  • Why blockchain is relevant for business
  • SupplyChain Example
  • Componentns of BlockChain
  • Limititations
  • Merkle-Patricia-trie
  • Consensus
  • Private vs. Public and Permissioned vs. Permission-less
  • References
Powered by GitBook
On this page

Was this helpful?

Merkle-Patricia-trie

PreviousLimititationsNextConsensus

Last updated 5 years ago

Was this helpful?

Merkle tree are Hashes of Hashes, they have the advantage that you can verify only a subtree. Ethereum uses for transactions (as well as for state and transaction receipts).

what about Patricia ? What does a trie mean? And how is it used in Ethereum?

Trie (also called digital tree, prefix trie or radix trie)

An ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. A node's position in the tree defines the key with which it is associated.

Merkle Patricia Trie

the root node becomes a cryptographic fingerprint of the entire data structure

As described , the term Merkle implies that

here
https://easythereentropy.wordpress.com/2014/06/04/understanding-the-ethereum-trie/
Modified Merkle Patricia Tries