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 2046 of 6811, 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.

Kindship/1
Sourcegdagroup
Sealed (UTC)2026-08-07T22:02:15Z
Refship/gda-group/e3746d06eb9d
Leaf hash0x8dfd5a01f415596b72860f8a49a596a09190fbe13468260b428604860c650142

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 size6811
Head root0x9026f7eb76108b06d14caa8d362249c14427bb735d7e0ab10b29381c50a07480
Audit path
  1. R · 0x8f430d69b9f6e91087b7
  2. L · 0x34aa7f3c98f54bda5cc7
  3. L · 0x53858a15901a11d855ed
  4. L · 0xd71fc60d108a9de8c621
  5. L · 0xe62a214717156c2a2cb6
  6. L · 0x96ccbfc2500147875f79
  7. L · 0x23c0ab0d4de6ffb19516
  8. L · 0x2d80c82fc5f63ff4383e
  9. L · 0x326e51cfd08465881957
  10. L · 0xea278eef7c367597778e
  11. L · 0x82ce784e3b6f8a96db9c
  12. R · 0x9affc1109b776582f43a
  13. R · 0x8b4f87f6eb0e7325bef0

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