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 4088 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-21T10:00:17.747Z
Refhttps://www.flashynetwork.com/explorer/8e7dc002-8c8c-49eb-b923-97fc5295523b
Leaf hash0x46dc448dc994fba09f83788b8836a6d4ef57dc1f7da42748094f76c15da67965

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 · 0x579f8b69e44e32e058bc
  2. R · 0x4b62f4efac74b1747ed7
  3. R · 0xf7ea65c2424f91f82801
  4. L · 0xf1606ce786d5cf0c9d2f
  5. L · 0xb62fb43885b44e2c9304
  6. L · 0x0731c89f0d811776b087
  7. L · 0x37f880dc9c3e7599d92c
  8. L · 0x7a37cd700caeacff2930
  9. L · 0xbfe17226ca0f4476ce8f
  10. L · 0xcd9b428126cc75881c4c
  11. L · 0x4525fc8cf1cc137e4891
  12. L · 0x09110d2b2c54a59b6703
  13. R · 0x92d6396723eff5869838

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