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 11645 of 24295, 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
Sourcebotzgroup
Sealed (UTC)2026-09-07T16:28:28.000Z
Refhttps://github.com/FlashyLabs/botz-group/commit/e689ea5863b9355b1e91653719e74213aa9a86dd
Leaf hash0x9219e3e03dd0480241ad0752c96e39729f440aa17fe139500a35d4b85a4798ec

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 size24295
Head root0xa5d02c094ce7f83b446501a3733ef2a5a53587d4ba794eb6eb513105aa393e87
Audit path
  1. L · 0x9a57295216dd25888b5b…
  2. R · 0x69f265981b747a45be49…
  3. L · 0x83ce082ec3796664a2e6…
  4. L · 0xac749ce2d4db16379b37…
  5. L · 0x8b9a1d529b1d350dacbd…
  6. L · 0xf27bcf1fac25235a7280…
  7. L · 0x8cf9dfa9bece6eab458e…
  8. R · 0x1f54155628b2f3d54b1a…
  9. L · 0x898fe4f36f0d2cb2b3e5…
  10. R · 0x2e789675cc4175889475…
  11. L · 0x8d278d89ea03b60e7d14…
  12. L · 0x23f521a3b1825fb91298…
  13. R · 0x49b0f3ba49bef9b4bf1b…
  14. L · 0x88058579d205b88ffec4…
  15. R · 0x0f34857d941277ae61e1…

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