A Gord Holdings company on the FlashyOS meshRoadmapFlashyOS ↗

VERIFY · LIVE

Verify a leaf

Paste a leaf hash. This returns its inclusion proof against the current head — and the exact steps to check that proof yourself, in any verifier that speaks RFC 6962.

A leaf hash is the 0x… sha256 in any row of the log. This page carries out the same request a machine makes to /api/v1/public/notary?proof=inclusion&hash=….

Included ✓

This leaf is in the log at position 11649 of 25708, and the audit path below proves it against the head root. You do not have to take that on faith — the steps to check it yourself are below.

Kinddevlog/1
Sourceclaimyourgold
Sealed (UTC)2026-10-19T11:10:13.000Z
Refhttps://github.com/FlashyLabs/ClaimYour.Gold/commit/c4de0a8f2363afba435c0343ce36ea58fbec3ad5
Leaf hash0xb98d901f0fd3296c3f0c7f438cbf6f5bf4dae40f323d06e07f73038b7cc95aa9

Four fields of context and a hash — nothing about who or how much. The ref is where a holder re-fetches the full record and re-hashes it to this same leaf; the log never saw those bytes.

The proof

Head size25708
Head root0x782ca52e57c0cf36285a47cce5ad44014f5739e9015a0cea63536a20bb3bb54c
Audit path
  1. L · 0xb8d4f77c0296a9dae4a1…
  2. R · 0x7148d8d6a9f2fde00a0a…
  3. R · 0x1044f0a3821608783bbe…
  4. R · 0x3b95fba8b965661ad492…
  5. R · 0x0bbebb183c8853e55af7…
  6. R · 0x14a893377c96bf2005f1…
  7. R · 0xaf5b7366acd63b154747…
  8. L · 0x97fc0d6496486b4cfc75…
  9. L · 0x898fe4f36f0d2cb2b3e5…
  10. R · 0x2e789675cc4175889475…
  11. L · 0x8d278d89ea03b60e7d14…
  12. L · 0x23f521a3b1825fb91298…
  13. R · 0x49b0f3ba49bef9b4bf1b…
  14. L · 0x88058579d205b88ffec4…
  15. R · 0x0f1a4e5cbd1a5ad0dd79…

Check it yourself

The proof is RFC 6962 — Certificate Transparency, byte for byte — so any CT verifier in any language checks it without reading our code. Three ways, from least to most independent:

  1. Re-request the machine form and compare: https://flashynetwork.com/api/v1/public/notary?proof=inclusion&hash=0xb98d901f0fd3296c3f0c7f438cbf6f5bf4dae40f323d06e07f73038b7cc95aa9. The root it returns must equal the head root above.
  2. Fetch the whole leaf stream, rebuild the tree, and confirm the root — the head is a number you recompute, never one we ask you to trust.
  3. Keep the head. Later, fetch the new head and a consistency proof between the two; if it passes, the log only grew — nothing was rewritten or removed.

An unsigned head is reproducible, not tamper-evident: recomputing our root checks our arithmetic, not our honesty. Only a cosignature from a party that is not the estate closes that gap, and until one exists the head endpoint says so, with the witness ratio published at zero. See the log for the whole picture.