Hash Tree
In cryptography and computer science hash trees or Merkle trees are a type of data structure that contains a tree of summary information about a larger piece of data – for instance a file – used to verify its contents. The concept is named after Ralph Merkle. Hash trees are a combination of hash lists and hash chaining, which in turn are extensions of hashing. Hash trees in which the underlying hash function is Tiger are often called Tiger trees or Tiger tree hashes.
Read more about Hash Tree: Uses, How Hash Trees Work, Tiger Tree Hash
Famous quotes containing the word tree:
“And out of the ground made the Lord God to grow every tree that is pleasant to the sight, and good for food: the tree of life also in the midst of the garden, and the tree of knowledge of good and evil. And a river went out of Eden to water the garden.”
—Bible: Hebrew Genesis 2:9-10.