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 3060 of 6638, 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-08-30T00:31:20.484Z
Refhttps://www.flashynetwork.com/explorer/0f16e016-6be7-4cab-8307-986c8f0bbeed
Leaf hash0x6d14401179ad4d640a11bfa719dc37f2d2a53516f2bbe19535b086c9a49e4a4d

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 size6638
Head root0xe8102088363e890dbe4f1e599e5bb2dba5631eff1eddcfc559dbe40cd32b37c0
Audit path
  1. R · 0xbbc383b5e94b72cfa19d
  2. R · 0x5165b24358b64b8a56e2
  3. L · 0x00f9797dfe8c1bbf04e8
  4. R · 0x35819951b7435cfb41de
  5. L · 0x8d4069a49274b3f0557b
  6. L · 0xe0c7cecf04a47d9bd7b3
  7. L · 0x28328795ea5f545e9fa6
  8. L · 0xe39914c5edc723b4f8ae
  9. L · 0x689c76038c5d79b68324
  10. L · 0x4b31dc84685398a221ee
  11. R · 0x6e78db5a27c8f744372d
  12. L · 0x09110d2b2c54a59b6703
  13. R · 0xc19150613ddc20e67e74

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