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 21683 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
Sourceflashytools
Sealed (UTC)2026-11-17T05:41:52.000Z
Refhttps://github.com/FlashyLabs/flashy-tools/commit/e8f8ec1bb1314d44935e9ee7134e2539a008edf5
Leaf hash0x25d1accc10bf31a73fa256675fe3ec912f8773407f1ec909d95da3dda12d8eb5

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 · 0x2f3197bad5b1fc9642e9…
  2. L · 0x1c7fb820f4725b2b6d60…
  3. R · 0x14e1acb6c7cae3be8f2e…
  4. R · 0xbb45486ec49fa23c64d6…
  5. L · 0x2882c9f8de1858b93390…
  6. L · 0x26d494f218882e9265db…
  7. R · 0xf6a42ee134fcc7f860aa…
  8. L · 0x48bfc97773a76dec0ae5…
  9. R · 0xe6e73e67a6c3fbaa8b68…
  10. R · 0x860d3457d59bfe82fbae…
  11. L · 0xcdb6d158eaa68c73d90c…
  12. R · 0x2fafbb4a7116e1b6b25d…
  13. L · 0x7a0de61653e600effd0e…
  14. R · 0x5d8ef4609d49ea720805…
  15. L · 0x58cc11673477de1ff26f…

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=0x25d1accc10bf31a73fa256675fe3ec912f8773407f1ec909d95da3dda12d8eb5. 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.