Metraipolis › archive › dc_5e737cf8536d
Merkle tree — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Merkle_tree
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:18:00.831Z
- SHA-256 of the archived text
d83c235897a557f4a1824c829d436c454a43409c6792261eba4da0d175f0400b- Stable URL of this page
https://metraipolis.com/documento/dc_5e737cf8536d
How to cite
Merkle tree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Merkle_tree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5e737cf8536d (Metraipolis archive dc_5e737cf8536d, sha256 d83c235897a557f4a1824c829d436c454a43409c6792261eba4da0d175f0400b)
BibTeX
@misc{dc5e737cf8536d,
title = {Merkle tree — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Merkle_tree},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5e737cf8536d; sha256 d83c235897a557f4a1824c829d436c454a43409c6792261eba4da0d175f0400b},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Merkle_tree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" node is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure. A hash tree is a generalization of a hash list and a hash chain. Demonstrating that a leaf node is a part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes in the tree. Conversely, in a hash list, the number is proportional to the number of leaf nodes itself. A Merkle tree is therefore an efficient example of a cryptographic commitment scheme, in which the root of the tree is seen as a commitment and leaf nodes may be revealed and proven to be part of the original commitment. The concept of a hash tree is named after Ralph Merkle, who patented it in 1979. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; categoria «Cryptographic hash functions»). Fonte: Wikipedia in inglese, voce «Merkle tree» — https://en.wikipedia.org/wiki/Merkle_tree Wikidata Q14746 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q14746 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Merkle_tree?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1375083916, consultata il 2026-10-05T23:04:28.105Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e437ee610a1eb24dc9667d4e9130501dd5ef9333136992cee1dfcf9030295265