What a Merkle Tree Is
A Merkle tree is a data structure in which every leaf node contains the hash of a data block, and every non-leaf node contains the hash of its children. The root of the tree — the Merkle root — is a single hash that represents the entire dataset. If any data block changes, the Merkle root changes, making the modification immediately detectable.
Merkle trees were invented by Ralph Merkle in 1979 and are now used in Bitcoin, Git, certificate transparency logs, and a growing number of business registry systems.
Why Merkle Trees Matter for Business Registries
A business registry that stores millions of records faces a verification challenge: how do you prove that a specific record has not been tampered with without requiring a verifier to download the entire registry? Merkle trees solve this with Merkle proofs.
A Merkle proof for a specific record consists of the hashes of the sibling nodes on the path from the record's leaf to the Merkle root. A verifier can use these hashes to recompute the Merkle root and confirm it matches the published root — without downloading any other records. The proof is logarithmic in size: for a registry of one million records, a Merkle proof requires only 20 hashes (log₂ of 1,000,000).
Practical Application: Certificate Transparency
The most widely deployed use of Merkle trees in identity verification is Certificate Transparency (CT), the system that prevents fraudulent TLS certificates. Every certificate issued by a trusted certificate authority must be logged in a CT log — a Merkle tree of certificate records. Anyone can verify that a certificate is in the log using a Merkle proof, and anyone can verify that the log has not been modified by checking the Merkle root against independently published checkpoints.
Business registries can apply the same architecture: publish a Merkle root of all verified passports at regular intervals, and provide Merkle proofs for individual passports on request. This allows any party to verify a specific passport's inclusion in the registry without trusting the registry operator.
The Difference Between Hashing and Merkle Trees
Individual SHA-256 hashing (as used in AI Verified passports) verifies the integrity of a single record. Merkle trees extend this to verify the integrity of a set of records and prove membership in that set. For a business registry, both are useful: individual hashes for per-passport verification, and Merkle trees for auditing the registry as a whole.