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 7480 of 10963, 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
Sourceacademy
Sealed (UTC)2026-09-07T16:39:31.000Z
Refhttps://github.com/FlashyLabs/flashy-academy/commit/c3dd38c594b0c6fc0685ec1c87efc70a81fc99ad
Leaf hash0xc41f00ff1af8178f444c71a7f48a038c2ab386afdd71e92f527e49e7332da460

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 size10963
Head root0x37c46e3b55299675380b89794f3812017e7824186c5e8d50ad1b926fc4a6156d
Audit path
  1. R · 0x4a2899ebaa70b455e020…
  2. R · 0xcb871ae91e7d246fed17…
  3. R · 0x877d5b19e142ce80c21d…
  4. L · 0xaf240750634a8f28afed…
  5. L · 0x4f08cb48c5e514776a02…
  6. L · 0x18167b77ae5d4178b9c7…
  7. R · 0xd49448e91a78312af019…
  8. R · 0x33d8ec4c323f18a8e686…
  9. L · 0x50862df1199f96bf8013…
  10. R · 0x0aaab7fc73c2ea799c14…
  11. L · 0x81ae8cc84a77e2d21be1…
  12. L · 0x101624fd77afe9f802bf…
  13. L · 0xc3418fa1c95d5584fe6f…
  14. R · 0x05ce6dd6097eefd9dc55…

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