Skip to content
CTC • Admissible Automation Standard

# Admissible Automation.

When automation touches lives and public money, decisions must be replay‑verifiable from machine‑verifiable evidence — otherwise systems fail closed into HOLD/manual review.

Download Constitution (PDF)
Open on Zenodo Procurement kit Contact security
Safety property Fail‑closed

### Not replayable → not admissible

Convert narrative compliance into machine‑verifiable receipts and replay outputs.

Procurement fit Audit

### Deterministic reason codes

Failures map to stable, enumerable reason codes suitable for procurement scoring and remediation workflows.

DOI Public draft

### 10.5281/zenodo.18340955

A standards‑track draft for procurement / audit / interoperability rigor.

Research page

## Implementation anchors

CTC is written to be implementable — not aspirational.

Canonical receipts Signed

### Stable bytes → stable proofs

Receipts are canonicalized and signed so independent verifiers can recompute identical bytes and digests.

Continuity‑Verified Log Freshness

### Append‑only anchoring

Receipts are anchored to append‑only heads with inclusion/consistency proofs under freshness bounds.

Replay verification Deterministic

### Independent recomputation

Verifiers reconstruct required structures, recompute metrics, resolve pinned policy artifacts, and reproduce the decision.

### Interoperability path (FHIR‑friendly)

The Constitution includes guidance for transporting receipts via FHIR resources (DocumentReference + Provenance + AuditEvent) while preserving canonical bytes for verification.

Download PDF Contact security