A quorum that cannot be forged: building a safer AI by making it falsifiable
SQUIRL OS RESEARCH DISCLOSURE — READ FIRST. This record is part of the Squirrel OS research corpus. All measurements are reported with their denominators and their limits. Where a result is a development set, an unverifiable corpus, or a single-custodian artefact, the record says so in the same sentence as the result. The companion ledger is the public GitHub repository four-horsemen-public. This paper is not a claim to have made a safe AI. It is an account of what happened when one was built to be falsified, and it reports the falsifications. The work began with a narrow ambition: not a better model, but a better system around one. That ambition produced four legs over roughly a year: a cage whose behaviour is measured by adversarial probes rather than by the model's own assurances; a grounding check that refuses a claim unless it resolves to a hashed artifact with a matching span; an approval path that binds a human's intent to one exact state and makes the approval unusable afterwards; and a crossing gate requiring distinct post-quantum seat signatures over escrowed payload bytes, backed by an audit that recomputes the whole relation from stored state. The result that matters is not that the last leg passed its tests. It is that the last leg, when finally measured, was broken in four ways, and that the measurements which broke it are the same measurements that now certify it. A quorum counted vote rows instead of distinct seats and never read the vote value, so one assent plus one abstention agreed. A vote function verified a signature and then discarded it, so every row it wrote was unsigned. A vote row omitted the one field its own audit needed to choose a verification contract, so 24 correct signatures were reported invalid. A proposal path never held the payload bytes, so a payload that did not hash to its own digest was accepted. Three of those four were silences. The system did not fail loudly; it reported clean. We describe how each was found, what each cost, and the reporting discipline that keeps a clean audit count from being read as a clean system: every audit verdict in this paper is accompanied by the count of records it could not reach. We make no primacy claim. The components are old. What we claim is one specific combination and one transferable habit: a gate that states what it cannot verify, in the same sentence as what it can. What it buys is narrower than safety and more useful than assurance. An organisation that adopts this can show a third party, from a receipt alone, that a given effect was authorised by a named person against one exact state, that no agent's own judgement entered the path, that the approval cannot be reused, and that the keys doing the authorising never sat on the server. It also inherits the four questions that catch a governance system reporting green while broken. Two limits are stated here rather than buried in a limits section, because both bear on how the result should be read. The V2 vote contract binds the payload and the seat but not the vote value, so a signed row does not by itself prove what the seat voted. And every seat private key is held by one custodian, so 2-of-3 certifies that three distinct keys signed, not that three independent people consented.
Authors
- Long, Leon Calvin, II
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24385596
- Primary Topic
- Access Control and Trust
- Type
- preprint