Verify a Merkle tree
Answer a question about the Merkle profile alone: rebuild a root from a list of digests, or check that one leaf belongs to a tree you already know the root of.
Everything runs on your device. Nothing you paste is sent anywhere.
The profile these answers follow
- A leaf is the SHA-512 of the raw file bytes, unmodified.
- Leaves are ordered by certified item position.
- An internal node is SHA-512(0x01 || left || right).
- An incomplete level duplicates its last node, at every level including the leaves. A single leaf therefore has a root of SHA-512(0x01 || leaf || leaf), and is not the leaf itself.