Contrary to what is claimed in the final section, BitTorrent is not actually an implementation of Merkle trees. Because there are no trees. The hashing used i

Contrary to what is claimed in the final section, BitTorrent is not actually an implementation of Merkle trees. Because there are no trees. The hashing used in BitTorrent metainfo files works by splitting the concatenation of all constituent files into equally sized blocks, individually hashing each block (using SHA1), and concatenating the hashes. Paths and sizes for all the files are also stored, but separately from the hashes.