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 3450 of 6224, 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-26T10:00:14.222Z
Refhttps://www.flashynetwork.com/explorer/dba048ac-e895-4836-9ed6-b34f42dd1e1b
Leaf hash0x9ef7ab348d5ab70ee459eefed87c027669496ed93e87c51e884cae2d8f9c6969

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 size6224
Head root0xf089780484991486462d9b597b0fcaf66754667221fab0c22c62aa708f9d386d
Audit path
  1. R · 0x62e6dad21a2bf1b00d94
  2. L · 0x1b5911c10b82ee28d6f1
  3. R · 0xa8ca9749569ab0008e30
  4. L · 0x01ebfac458550a356fc6
  5. L · 0x632252fbf93c0bae3809
  6. L · 0x7d2fb5dc768aa900f81d
  7. L · 0x84c8411e19a84b3c9deb
  8. R · 0x6edac455bf768260bae0
  9. L · 0x78f0178a75f2f1d04b24
  10. R · 0xdc4a033d85aeece0b7ee
  11. L · 0x4525fc8cf1cc137e4891
  12. L · 0x09110d2b2c54a59b6703
  13. R · 0xb056a4a3d3b5ac09cc1c

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