|BABA|STAMP
Glossary

Merkle proof

A short chain of hashes that proves one item is included in a dataset represented by a single root hash.

A Merkle tree hashes data in pairs, then hashes those results in pairs, and so on, until a single value remains: the Merkle root. A Merkle proof (or inclusion proof) is the small set of sibling hashes along the path from one leaf to the root. With it, anyone can recompute the root and confirm the item was part of the tree, without seeing the other items.

Why timestamping uses it

Merkle trees let a timestamping service combine thousands of document hashes into one root and anchor only that root on-chain. Each document then carries a short Merkle proof linking its hash to the anchored root, so one blockchain transaction can timestamp an entire batch at negligible per-item cost.

FAQ

Does a Merkle proof reveal the other documents in the batch?

No. It contains only sibling hashes along the path to the root, which disclose nothing about the content of the other items in the tree.

How large is a Merkle proof?

Tiny and logarithmic: proving inclusion in a batch of a million items needs only about twenty hashes.

Timestamp your first file — free

Anchor a SHA-256 hash on Polygon and Bitcoin and get an independently verifiable certificate. No credit card.