Merkle Trees and Proof of Reserves for Crypto Custodians
Summary
The document explains how a Merkle tree summarizes transactions: individual transaction hashes are paired and repeatedly hashed until they form a single root. A change to a transaction changes the hashes above it, making the alteration detectable. This structure can support efficient verification that data, such as an account’s entries in a dataset, matches a committed record.
It then defines proof of reserves as evidence intended to show that a custodian holds assets sufficient to cover customer balances, using a reserve ratio of at least 100% as the stated benchmark. The article gives one exchange’s reported reserve ratio and describes public wallet addresses, user-level verification, and periodic snapshots as transparency measures. These are explanations and claims from an exchange-sponsored article; a reserve proof alone does not establish the completeness of liabilities or provide a full independent audit of solvency.
Key ideas
- A Merkle tree combines transaction hashes into a single root that represents the underlying dataset.
- Changing an included transaction changes the hashes up to the root, allowing the modification to be detected.
- Proof of reserves aims to show that a custodian holds assets against customer balances.
- A reserve ratio of 100% is presented as the minimum benchmark for matching reserves to user funds.
- Public wallet holdings and cryptographic verification can improve transparency, but the article does not establish that these checks cover all liabilities.
Tags
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.