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 22540 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-10-30T02:09:42.000Z
Refhttps://github.com/FlashyLabs/botz-group/commit/9429a9962224342eaa458ed2dc16315348fba61a
Leaf hash0xaefec7b215bf0df03699b8dfa80d7c51f98fa8d96a5d1b8a750803ce21e7f831

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. R · 0xbeddb69c9b5480dcf42a…
  2. R · 0x6997f46e64cfb60028eb…
  3. L · 0x2b5595f781a0c4a4bd70…
  4. L · 0xbb911d32323be90ee4ec…
  5. R · 0xbf3d851ad38aa862a0a5…
  6. R · 0x8d94841f9e014e2c1eae…
  7. R · 0x93d3499254c293fb0555…
  8. R · 0xa9ddec02bbb01085c174…
  9. R · 0x7a2ae6d675a356f9c1a8…
  10. R · 0x6a3c77591dbbc608fa8e…
  11. R · 0xb408d67ca64e76de0816…
  12. L · 0x781283ff035c9111e9af…
  13. L · 0x7a0de61653e600effd0e…
  14. 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=0xaefec7b215bf0df03699b8dfa80d7c51f98fa8d96a5d1b8a750803ce21e7f831. 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.