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 4390 of 5678, 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-18T19:32:10.206Z
Refhttps://www.flashynetwork.com/explorer/998db84f-6222-4022-8a69-0c106f1c8e7d
Leaf hash0xfecf3a6c792e238a5dde343cd0f766396ad54f06e70ab4a7acb490a244ac5b0c

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 size5678
Head root0x0941ee4391cbe68ee0d99d0d43035b6ac1758fba4706ff0623e2f23b851c4abc
Audit path
  1. R · 0x7fd528132caedb1be370
  2. L · 0x845324734b9e4c01198d
  3. L · 0x2e011525b2e2951ebbc3
  4. R · 0xcb3bfd50e9dcb0f6410e
  5. R · 0xa660c4f30af2c5b951a1
  6. L · 0x1418170536074a6ee45c
  7. R · 0x55474612f221e3279fdb
  8. R · 0x774f5c1c1a58f220e842
  9. L · 0xd94b890488eb61a18e7a
  10. R · 0x84b7f050bcaa65b7e02a
  11. R · 0x9f8c618047fcc45c13cd
  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=0xfecf3a6c792e238a5dde343cd0f766396ad54f06e70ab4a7acb490a244ac5b0c. 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.