Proof
The proof does not need our word — it is designed to be checked.
Conduct, not capability
A machine's capability can be demonstrated on a bench: how fast, how accurate, how strong. Its conduct — what it chooses to do when it matters — cannot be benchmarked in advance, and conduct is what a buyer, an insurer, or a court actually needs to trust.
Offline by design
Every decision made under the Laws is written to a tamper-evident, append-only record that travels with the agent. That record verifies offline: disconnect the machine from every network and the verification still completes, because it never depended on a server, a dashboard, or anyone's say-so.
Cut the network. The record still verifies.
A bounded result
Verification returns a bounded result. It states what it confirms — that the record is intact and that a decision can be re-derived and checked — and it states just as plainly what it does not assert: it does not certify that a decision was wise, and it never claims more than the record can carry. That stated boundary is the credibility of the proof.
For serious parties
A reviewer package exists for insurers, auditors, and researchers who want to examine the record discipline directly. The ask is one email: contact@lawsofrobots.net
This design expects adversaries. If you would rather try to break it than read about it, the invitation — and the disclosure channel — live on the Security page.