OurBigBook About$ Donate
 Sign in Sign up

Merkle tree

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Error detection and correction
 1 By others on same topic  0 Discussions Create my own version
A Merkle tree, also known as a binary hash tree, is a data structure that is used to efficiently and securely verify the integrity of large sets of data. It is named after Ralph Merkle, who first published the concept in the 1970s. Here's how a Merkle tree works: 1. **Leaf Nodes**: Data is divided into chunks, and each chunk is hashed using a cryptographic hash function (like SHA-256).

 Ancestors (6)

  1. Error detection and correction
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Merkle tree by Ciro Santilli 37 Updated 2025-07-16
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook