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 7086 of 10042, 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.

Kindsettlement/1
Sourceflashynetwork
Sealed (UTC)2026-09-17T20:14:05.527Z
Refhttps://www.flashynetwork.com/explorer/e87d78f7-467a-44ba-9bf2-140f08be66e0
Leaf hash0x577f622c50db96fe1b748147196e6e422c945d477df19955a0c182c75ff61deb

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 size10042
Head root0x0ac898c38107d695e57213a720177172ca96521e226ddd9b41014abe986e4eb6
Audit path
  1. R · 0x10f2dbe903bbb948b5a5…
  2. L · 0x31be4264bb94f6271b6a…
  3. L · 0xf8fcdd5f8930d0845523…
  4. L · 0x2e0fd9de9a0fd058ae62…
  5. R · 0x2e26abbaac87ca43e378…
  6. L · 0x100a2399b3d35dde1f1f…
  7. R · 0x28543ff625860dd716a7…
  8. L · 0x323be666baa81c612c77…
  9. L · 0x3acc5af013ed5e2ec406…
  10. L · 0x2c87aeee85be38cd5b66…
  11. R · 0xa16d78d005b5432c60e7…
  12. L · 0x101624fd77afe9f802bf…
  13. L · 0xc3418fa1c95d5584fe6f…
  14. R · 0x4a6f478b9f4a1358eb1b…

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