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 11817 of 15846, 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
Sourcemlgblockchain
Sealed (UTC)2026-10-19T10:53:27.000Z
Refhttps://github.com/FlashyLabs/mlgblockchain/commit/364b312a035f46e2db39495d6d9eeec124f12c1e
Leaf hash0xf06e701116a5f36cab5b74fa6e2004e26390798628c3d793aedd29983d053567

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 size15846
Head root0x9fb0d0522d174e54ac61d04fca91c71187456524e5c537650e286f52b493b1fe
Audit path
  1. L · 0x730afbab850123092e9e…
  2. R · 0xfc7c50328604969d4393…
  3. R · 0xcfec89e21d99410143c4…
  4. L · 0x8a0b190fccfe58e515c7…
  5. R · 0xffead1ae91c82f95ebf7…
  6. L · 0xaea3373d0d6f36efc249…
  7. R · 0xf406f2d2768bf19b8735…
  8. R · 0xccf82d738eb434cff4d0…
  9. R · 0x531fc66fb6125b9118af…
  10. L · 0x5bb3782ff416ffb8298d…
  11. L · 0x8d278d89ea03b60e7d14…
  12. L · 0x23f521a3b1825fb91298…
  13. R · 0x08b4bef1bee433bbb5ff…
  14. L · 0x88058579d205b88ffec4…

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