What is a root hash and why does it matter for blockchains?

A root hash is the single hash value at the top of a Merkle tree that acts as a compact fingerprint for all the data the tree contains. A Merkle tree organizes data into blocks; each block's hash is combined with its neighbor's hash, and those combined hashes are hashed again, repeating all the way up to one final value at the top. This process uses a cryptographic hash function such as SHA-256 or BLAKE2b. The critical property is that any change to even a single piece of data at the bottom of the tree completely changes the root hash. Blockchains rely on root hashes because they allow the network to rapidly verify that large datasets — like a block full of transactions — have not been altered, without rechecking every individual piece of data.