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 1209 of 7356, 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
Sourceflashyid
Sealed (UTC)2026-08-31T01:00:34Z
Refship/flashyid/14d87f825142
Leaf hash0x34a6a9950eb31859f275fd6e15d72db72fa5aca9356ae30afd0bf2e8d2408cd9

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 size7356
Head root0xc5b5528a0c1d2baa36fa7e235d59a9260b90e2426c9db02327e329af7805d211
Audit path
  1. L · 0x5521c6c183d37c0a65a2
  2. R · 0x0ad915665ca73713df4b
  3. R · 0x24335491ebf0a3806029
  4. L · 0x27e4651aa9d85e821fdc
  5. L · 0x1d127c8c93dc57bc8f0c
  6. L · 0x56a8d1f8477167050074
  7. R · 0x9b84be83b67911fa5137
  8. L · 0x0fd722f6900f8db70f8c
  9. R · 0x62e8b242fc06247a347e
  10. R · 0x3914b85e826149edae21
  11. L · 0x82ce784e3b6f8a96db9c
  12. R · 0x9affc1109b776582f43a
  13. R · 0x6f1873dc991c27d728b9

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