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 3110 of 6637, 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-29T09:42:34.851Z
Refhttps://www.flashynetwork.com/explorer/32682e00-42cc-426c-9ed5-fc4c3aeba604
Leaf hash0x5d71119900a01542a7ca077dda7c8a74fbee81c6c4248099666392e6c74ea1b2

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 size6637
Head root0xf953f8a1fe68082733380333a6afc47b58babc1ecb99c7e6a8d9040c9c37bc28
Audit path
  1. R · 0x7066f0611674c452d627
  2. L · 0x718ecae492298bd2536a
  3. L · 0x81006675d27b8a318c62
  4. R · 0x36cd200c9b0b8d15b9a8
  5. R · 0x09df5dcc6fff7404c883
  6. L · 0xb8ed72a77f6366c94d95
  7. R · 0x9aca67c9f2c5146cfc2f
  8. R · 0x12a27eefb032f5988ff1
  9. R · 0x678fde05dd18f4c7fdb6
  10. R · 0xdc4a033d85aeece0b7ee
  11. L · 0x4525fc8cf1cc137e4891
  12. L · 0x09110d2b2c54a59b6703
  13. R · 0xeab059704c2cc7e24d2a

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