Freaks City

A binary hash tree—often called a Merkle tree—compresses an arbitrary amount of data into a single 256-bit digest while still allowing anyone to prove that a specific element belongs to the original set. The construction is straightforward: hash every item, pair the hashes, hash the pairs, and continue until one value remains. That final value ...