11 lines
358 B
Plaintext
11 lines
358 B
Plaintext
|
= Merkle Tree =
|
||
|
|
|
||
|
|
A Merkle tree (aka hash tree) is a tree where
|
||
|
|
|
||
|
|
* every leaf is labelled with the hash of a data block
|
||
|
|
* every branch is labelled with the cryptographic hash of the labels of its
|
||
|
|
child nodes
|
||
|
|
|
||
|
|
A hash tree is primarily used to verify the integrity of very large
|
||
|
|
datastructures in a very efficient manner. One such common use is in Bittorrent
|