15.Cryptography: Merkle Tree, Validation of Data скачать в хорошем качестве

15.Cryptography: Merkle Tree, Validation of Data

****************************************************** Source: EDX LinuxFoundationX LFS170x Blockchain: Understanding Its Uses and Implications ****************************************************** A) Merkle Tree: A special type of data storage structure based on hash functions is called a Merkle tree: It is structured as a binary tree; the leaves contain the values to be stored and each internal node is the hash of its two children. It provides efficient lockups and protection against forgery since verifying a transaction is included in the tree. Can be accomplished by sending only the transaction, the hash contained in each node between the transaction leaf node and the root, and the hash values used to create each hash sent. Looking up a transaction in a Merkle tree with three levels includes sending two transactions (the desired one and the other child of its parent) and three hashes (the transaction’s parent, the root, and the root’s other child).