- Patricia Tree
Definition of "Patricia Tree"
- A data structure which stores the state of every account. The trie is built by starting from each individual node, then splitting the nodes into groups of up to 16 and hashing each group, then making hashes of hashes and so forth until there is one final "root hash" for the entire trie. The trie has the important properties that (1) there is exactly one possible trie and therefore one possible root hash for each set of data, (2) it is very easy to update, add or remove nodes in the trie and generate the new root hash, (3) there is no way to modify any part of the tree without changing the root hash, so if the root hash is included in a signed document or a valid block the signature or proof of work secures the entire tree, and (4) one can provide just the "branch" of a tree going down to a particular node as cryptographic proof that that node is indeed in the tree with that exact content. Patricia trees are also used to store the internal storage of accounts as well as transactions and uncles.
Articles Related to "Patricia Tree"
Parity Acts Quickly To Patch Ethereum Bug
A Survey Of Second Layer Solutions For Blockchain Scaling, Part 3
Much Ado About Blockchain During UK Parliament Treasury Committee Hearing