How to use Local Merkle Proof Workbench
- To build, choose Build a tree and a proof from local files and select the ordered file collection. The tree follows the file order shown in its result.
- Set the file index for the proof, starting at 0 for the first file, and run Build or verify proof. Save the root, tree JSON, inclusion proof and leaf CSV.
- To verify later, choose Verify a proof against a supplied root. Select the saved proof JSON and the exact file whose inclusion it describes.
- Enter the lowercase SHA-256 root obtained separately, then run the check. Compare file, index, tree size and rebuilt root; trusting a root is a separate decision.
Example: Local Merkle Proof Workbench
Build a tree from first.txt, second.txt and third.txt in that order.
Options
- Expected SHA-256 root (verifying)
- Enter the 64-character lowercase root you obtained separately. A root read only from the proof file is not an independent reference.
- What to do
- Building reads ordered files and returns a root, a portable tree and a proof for your selected file index. Verifying checks a proof against the exact file and separately supplied root.
- File index for the inclusion proof (building)
- Zero is the first file, one the second. The proof uses the current ordered list; moving a file changes its index.
- Ordered local files (building)
- Up to 128 files, 10 MB each and 20 MB in total. Order matters: the list order is the tree order, so keep it fixed across builds.
- Proof JSON (verifying)
- A proof JSON saved by the build step, holding the tree size, the selected index, the sibling path and the root.
- Exact selected file (verifying)
- The exact local file whose inclusion the proof claims to show. Its bytes are hashed in the same way the tree hashed them.
Supported inputs and limits
- Build from 1–128 local files, at most 10 MiB each and 20 MiB combined.
- Verification uses one exact file up to 10 MiB, one supported proof JSON up to 2 MiB and a separately supplied lowercase SHA-256 root.
- This tool uses RFC 6962-style leaf/node domain separation and ordered splitting, without a Certificate Transparency service, blockchain, signature or trusted timestamp.
- JSON/CSV downloads contain tree/proof records, not original file contents.
- There is no pasted-leaf input or automatic trust in the proof’s stored root.
Where your input is processed
This tool does not upload your inputs. See the limits for anything saved on your device.
A proof relates bytes to a particular root
The domain-separated tree hashes leaves and parent nodes differently and preserves file order. A successful inclusion check connects the selected file bytes and position to the supplied tree root. You still need an independent reason to trust that root; the proof does not identify a publisher or supply a trusted timestamp.
Questions about Local Merkle Proof Workbench
What does inclusion prove?
That the exact selected bytes occupy the claimed position in the tree described by the supplied root.
Is a tree root trusted automatically?
No. Obtain or confirm it through an independent trusted channel.
Can files be reordered?
Order affects the tree. Rebuild the tree and proofs when the intended order changes.