Abstract
This disclosure extends a governance registry for AI systems, in which a witnessed append-only record both binds certified systems and informs the public, in two directions. The first is live reference. Many functions need the registry's answer at the instant they act: whether an agent's credential, its accountable manager and its spending limit are current before a payment; whether a skill is still certified before a robot uses it; whether a detector's accuracy has expired before its alert is trusted. Instead of each function calling the registry, the registry issues short-lived signed status attestations, each stating the derived status of a subject as of a signed checkpoint. The subject attaches its current attestation to its action, and the receiving party verifies it locally, without contacting the registry, which therefore does not learn who relies on whom. Each kind of reference declares in the registry the maximum age an attestation may have, set by risk, from seconds to hours. An attestation that is missing or too old never permits the action by default: the action is tightened to a declared lesser form or refused. A combined attestation covers a subject together with the chain of records it depends on, so that one check establishes that all are current. Parties that depend on a subject subscribe to it, and changes are pushed to them; a missed push is bounded by the attestation's expiry. The rules by which status is derived are themselves recorded entries, so that any status can be recomputed by anyone. The second direction is continuity over time. A wrong entry is never erased: a signed correction refers to it, and the subject of an entry may contest it, in which case the status shows as disputed until a recorded decision. Personal data is never written to the record; it is held apart, encrypted under its own key, and referenced by a salted commitment, so that destroying the key erases the data while the history still verifies. Checkpoints are signed with both a current and a quantum-resistant algorithm, and the whole history is periodically re-signed and time-stamped under current algorithms before older ones weaken. Mirrors held in escrow, a named successor operator and a read-only proving mode keep status provable if an operator fails, and certified systems tighten during any transfer. Throughout, the registry is one participant in a closed loop with the sensing, detection, alarm and coordination functions of the safety system: their signed outputs enter the record and change status within a declared and measured time; their own standing is attested by the registry and travels with their outputs; they in turn watch the registry, recomputing its attestations, checking its checkpoints for consistency and for timeliness, and raising an alarm to people when it stalls or errs; each subject's status carries a number that only rises, so that a superseded attestation is refused even before it expires; and a change to the status rules is rehearsed on a copy of the record before it takes effect, so that one faulty rule cannot withdraw the standing of many systems at once. No stop or restore depends on any of this.
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Wang, Edward D. H., "SI Registry™ Live Reference and Continuity: A Governance Registry for AI Systems that Is Consulted at the Moment of Every Action without Being Called, in which Short-Lived Signed Status Attestations Derived from a Witnessed Append-Only Record Travel with Each Action and Are Checked Locally, Each Kind of Reference Declares a Maximum Age by Risk and an Expired Attestation Tightens, One Attestation Covers a Whole Chain of Dependencies, Changes Are Pushed to Subscribers, Wrong Entries Are Corrected and Disputed without Erasure, Personal Data Is Kept off the Record and Erased by Destroying Its Key, the History Is Re-Signed as Cryptography Ages, Status Remains Provable if the Operator Fails, and the Registry Works in a Closed Loop with Sensing, Detection, Alarm and Coordination Functions that Also Watch the Registry Itself", Technical Disclosure Commons, (November 16, 2026)
https://www.tdcommons.org/dpubs_series/13087