The consensus layer's way of fingerprinting its data so any single piece can be proven.
The idea: The consensus layer's version of the same trick: every field of the beacon state sits at a fixed position in a tree of SHA-256 hashes, so a light client holding the root can check any single field, such as a validator's balance, with a short branch of hashes.
Why it matters: Light clients and bridges rely on it.
A tree of fingerprints
Every box is the hash of the two boxes below it. To prove that item 3 is in the tree, hand over just the three orange hashes. The verifier hashes item 3 with them, climbing the blue path, and checks that the result equals the published root. Changing any item would change the root, unless someone could find a hash collision.
The details
On the map: beacon state roots, deposit tree (SHA-256)
The consensus layer serializes everything with SSZ and computes Merkle roots with SHA-256[1], so any field of the beacon state can be proven with a short branch. The deposit contract keeps its own SHA-256 Merkle tree of all validator deposits[2].
Light clients and many bridges verify beacon-chain data through these roots. Security needs SHA-256's collision resistance.