This is the second of a series of articles Iām trying out called ā5 points & 1 resourceā (think tl;dr but 5p;1r) where I summarize a list of bullet points that would have helped me start learning a new topic. It is intentionally far from a complete source of data. You can find the first one here: 5P;1R - Bitcoin’s Elliptic Curve Cryptography
A Patricia Trie is a prefix tree where edge values are concatenated as you navigate down the tree to form a key associated with the nodeās value. All leaf nodes must have a value while it remains optional for parent nodes.
A Merkle Tree is a hash tree where the value of every non-leaf node is the hash of the sum of hashes of all of its children.
A Merkle Patricia Tree (MPT) is used to store keys (hashes of values) and values (serialized data structures) using Leaf Nodes (containing a key-end & value) and Branch Nodes (containing pointers to other nodes & optional value).
Assuming the key is of size N bits (e.g. N = 256 bits) and the encoding chosen is M bits (e.g. M = 2^4 ā hex / base 16), a branch node can have at most M + 1 elements (e.g. 1 optional value + 16 hex digits / nibbles) and the Tree can have a maximum depth of N / M (e.g. 256 / 4 = 64).
Ethereumās Modified MPT also contains Extension Nodes which is an optimization of Branch Nodes that only have one child by compressing them into a Leaf-Node-like structure while replacing the key-end with shared-nibbles and node value with the child path/hash, and using a special hex prefix value to differentiate Extension Nodes from Leaf Nodes:
If I only had to recommend one resource out of all the references I looked through, it would be: https://medium.com/@chiqing/merkle-patricia-trie-explained-ae3ac6a7e123
https://ethereum.stackexchange.com/questions/6415/eli5-how-does-a-merkle-patricia-trie-tree-work