Merkle Tree
A data structure in which every leaf node contains a cryptographic hash, and every non-leaf node contains the hash of its child nodes, enabling efficient verification.
The Repository uses Merkle Trees to prove data integrity. A single hash (the Merkle Root) can verify that a specific VRDI or DIO exists within a massive dataset without downloading the entire history. This enables light clients and mobile wallets to participate in verification.