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 4330 of 5380, 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-19T10:00:19.660Z
Refhttps://www.flashynetwork.com/explorer/1c3ca478-3863-45f2-88cc-f0c5e3bb6572
Leaf hash0xadede6795033a532d798a0d3ff2cc91c1d6246de111bb6b27dcbf99f4375f81d

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 size5380
Head root0xa442f7b3e70af3c7cc0c0e30def9ffe02cf1121799124fe3af46446588de1f13
Audit path
  1. R · 0x2ad5712415ebce3bc378
  2. L · 0x1028ad05527dc9ce0439
  3. R · 0x1e1fdd00da10e6634e11
  4. L · 0x1b5ac4973f8d3c0d6d5b
  5. R · 0xe4af5d45886682c980c6
  6. L · 0x1ab671f7dbdcce1630ba
  7. L · 0xa788c072d6cc662066dc
  8. L · 0x1ec57695c2d7e2ba5844
  9. R · 0x39b48fd6b40e32406939
  10. R · 0x84b7f050bcaa65b7e02a
  11. R · 0x80ba0de61b175de71211
  12. L · 0xc3418fa1c95d5584fe6f

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