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 2982 of 6640, 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-30T18:23:16.774Z
Refhttps://www.flashynetwork.com/explorer/d396f505-37fc-43f7-af95-83c583695857
Leaf hash0x5fbf9381defcd605190eb12e23fda04f584b3844c5c6505a74f0397b075a069a

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 size6640
Head root0xa2ee1704de7b98f8456ab2322b0ae276925462d5782d99e47048b4f0a0ad5ba1
Audit path
  1. R · 0xa13fdd8de7447cf121d6
  2. L · 0x02c4610f85d928f57efe
  3. L · 0x4b947a235bde657bec82
  4. R · 0xcad1cc827fd1a07a62f4
  5. R · 0xf8395e67926e10d0c6d6
  6. L · 0xd54c40da9530172a2ae4
  7. R · 0x5779133942071f92c0b7
  8. L · 0xe39914c5edc723b4f8ae
  9. L · 0x689c76038c5d79b68324
  10. L · 0x4b31dc84685398a221ee
  11. R · 0x6e78db5a27c8f744372d
  12. L · 0x09110d2b2c54a59b6703
  13. R · 0x0899cc1d8120130f977d

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