Don't believe the claims. Recompute them.
Everything below runs in your browser over the public evidence bundle: real SHA-256, real RFC 6962 Merkle construction, the real published MIT verifier doing real Ed25519 and ML-DSA-65 signature checks. If we were lying, this page would say so.
Under 3× sustained overload, was anything accepted silently dropped, or any phantom event invented? We recompute, per tenant, the sum over all agents of head_index + 1 and check it equals the on-chain count equals the accepted count — then sum the five tenants. Real arithmetic over the real reconciliation artifact, computed now.
| Tenant | Agents | Recomputed | On-chain | Reconciles |
|---|---|---|---|---|
| 2126d5f72838 | 3 agents | Σ(idx+1) = 24,774 | on-chain 24,774 | ✓ = accepted 24,774 |
| d9f85899ab34 | 3 agents | Σ(idx+1) = 24,935 | on-chain 24,935 | ✓ = accepted 24,935 |
| 83b13d268d3e | 3 agents | Σ(idx+1) = 25,036 | on-chain 25,036 | ✓ = accepted 25,036 |
| 2feacb7576e8 | 3 agents | Σ(idx+1) = 24,923 | on-chain 24,923 | ✓ = accepted 24,923 |
| b16d9dc2f247 | 3 agents | Σ(idx+1) = 25,132 | on-chain 25,132 | ✓ = accepted 25,132 |
| 5 tenants · 15 agents | 124,800 | = 124,800 accepted | 0 errors · byte-exact |
Proves: byte-exact ledger arithmetic — nothing accepted was dropped, no phantom events appeared. Does not prove: the signatures or the time anchor — those are tabs B and D.
Why this matters more than a certificate: a badge asserts that someone checked once. This lets anyone check continuously, offline, with software we cannot withdraw.
You just verified our evidence with software we can't revoke.
Now see what the same proof does for your regulator, auditor, or insurer. We're taking on a small number of design partners — and you'll get a sample court-grade certificate on the first call.