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:
“A tree that can fill the span of a man’s arms
Grows from a downy tip;
A terrace nine stories high
Rises from hodfuls of earth;
A journey of a thousand miles
Starts from beneath one’s feet.”
—Lao-Tzu (6th century B.C.)