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 1265 of 7357, 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-26T18:03:27.000Z
Refship/flashyid/b54a9ecca8b9
Leaf hash0x50d2b7e22454ee7f94328f6151c0b92a744152e89980ab6186d839488b073942

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 size7357
Head root0xc7634c7a09b345a2e0a107179889c19480c12109c40368b3056fabfba2890efb
Audit path
  1. L · 0x6eba76785590446cba4d
  2. R · 0x08af95d9f4b3ab17ceaa
  3. R · 0xa5f53a5accb82c8e8b89
  4. R · 0xa2c6abf36a36a880b054
  5. L · 0x0599fa712b422a0a1190
  6. L · 0xf7f128acb2acf4920e99
  7. L · 0xa0ba6ee7b4783e8b5991
  8. L · 0x0fd722f6900f8db70f8c
  9. R · 0x62e8b242fc06247a347e
  10. R · 0x3914b85e826149edae21
  11. L · 0x82ce784e3b6f8a96db9c
  12. R · 0x9affc1109b776582f43a
  13. R · 0xd0b58a6bcad1d41c9acb

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