One public list. It only grows.
Every receipt and record listed here is hashed into one tree. Hive signs the root at each size. If anything already in the list were changed, removed or reordered, the root would change and the proofs below would fail. You do not have to take our word for it: this page recomputes every hash in your browser from the published files.
Result
Checking…
Signed tree heads
Each head names the tree size and its root, signed with key .
Append-only proof
A consistency proof shows the older tree is the start of the newer one, using only a few hashes.
Is this receipt in the log?
Paste any receipt or record JSON. The page hashes it, finds its entry and checks its inclusion proof against the signed root.
Entries
| # | Source | Content SHA-256 | Inclusion |
|---|
How it works, and what it does not show
- Hashing follows RFC 6962, the scheme behind Certificate Transparency. The leaf for each entry is the SHA-256 of its JSON with keys sorted.
- Files: sth.json (latest head), sth-history.json (every head and consistency proof), entries.json, proofs.json and key.json. Anyone can save them and recompute later without Hive.
- Hive runs this log and holds its signing key. Keep a copy of a head you have seen: if Hive ever published a different root for the same size, your copy is the evidence.
- The log shows what was published, when it entered the list, and that it has not changed since. It does not show that the contents are correct. The ICE receipts and agent conduct records in it are fictional examples.