top of page

LOOPGUARD-AI — CANONICAL PROOF OF CONCEPT V1.0.11

RATIUM.AI — Independent R&D (AI Systems)

Author: Benny Dunavich

Technical Publication — WIX Native Text Edition

Engine: 1.0.11-poc

Decision semantics: 1.0.11

Specification: Canonical POC Specification V1.5.1 Rev B

Publication baseline: LOCKED

Independent Final Integrity Verification: PASS

A publication-locked deterministic proof of concept for evidence-aware AI decision control, including exact source-code excerpts, execution traces, artifact provenance and independent verification.

00 — DOCUMENT CONTEXT AND INTERPRETATION FRAME

LoopGuard-AI is the applied decision-control architecture published within the RATIUM.AI research framework. This page presents the canonical, publication-locked proof-of-concept implementation of that architecture: LoopGuard-AI V1.0.11, governed by Canonical POC Specification V1.5.1 Rev B.

The purpose of this document is not merely to describe a governance concept. It documents and evidences an executable, replay-verifiable control model that connects structured evaluation inputs to four explicit operational gates: SHIP, RESTRICT, HOLD, and ROLLBACK.

The POC is constructed around a specific governance proposition: evaluation alone does not constitute operational control if detected uncertainty, policy conflict, evidence weakness, authority failure, instability, or rollback pressure has no defined consequence for execution. LoopGuard-AI therefore treats evaluation as an input to deterministic decision control rather than solely as a reporting layer.

Within the broader conceptual framework of RATIUM.AI, the Central Equilibrium Problem (CEP) provides theoretical motivation for examining self-reinforcing and structurally suboptimal decision environments. LoopGuard-AI is the applied governance architecture used here to test a narrower engineering proposition: whether evaluation, evidence quality, policy precedence, human authorization, recovery logic, persistence, and replay can be combined into an auditable deterministic control loop. The POC does not empirically validate CEP itself.

The implementation documented and evidenced here is deliberately deterministic. Evidence classification and evidence quality are treated as independent dimensions. For SHIP eligibility, every required metric must satisfy its own status, confidence, and completeness requirements; unrelated stronger metrics cannot compensate for a deficient required metric. The active PolicyPack's evidence-quality minima are versioned, canonically serialized, included in hash material, persisted, and replay-verifiable.

The publication baseline is frozen under the Canonical Publication Lock. Its verification record includes 225/225 shipped checks, 15/15 independent final integrity probes, and 100/100 randomized schema-valid lifecycle reconstructions. These results establish integrity of the deterministic synthetic POC contract. They do not establish empirical metric validity, empirical CEP validity, production readiness, certification, regulator acceptance, customer validation, real-world safety efficacy, cryptographic trust anchoring, or tamper-proof authentication.

Document class: Canonical Technical Proof of Concept / Evidence & Verification Record

Interpretation boundary: Architecture claims, implementation claims, verification claims, and deployment claims are distinct and must not be conflated.

01 — SYSTEM CLAIM

Evaluation becomes an explicit operational decision.

LoopGuard-AI is a deterministic decision-control POC that connects versioned evaluation signals and policy rules to one of four operational gates.

The central technical requirement is not merely to compute a risk score. It is to preserve an auditable path from source inputs, through metric and policy evaluation, to a terminal gate that can be independently reconstructed from persisted artifacts.

Canonical precedence:

hard blockers → risk elevation → conditional restriction → green path → audited human override

Evidence quality is an affirmative SHIP-eligibility condition, not a new precedence layer.

02 — FOUR OPERATIONAL GATES

SHIP

All green-path policy conditions and evidence-quality requirements are satisfied.

RESTRICT

An existing conditional restriction controls the outcome; operation proceeds only within constrained bounds.

HOLD

A blocker, elevated risk, fail-closed condition or SHIP-quality deficit requires execution to be withheld.

ROLLBACK

A valid rollback determination and authorization contract control the outcome.

Decision flow:

Request + Signals → Metrics + PolicyPack → Gate + Evidence Record

03 — METRIC SURFACE

Ten recommended MVP metrics. The locked architecture preserves non-compensation: a strong unrelated metric cannot offset a required metric that fails its own SHIP eligibility condition.

• risk_level — Operational risk classification

• evidence_status — Semantic sufficiency / limitation / conflict

• authority_status — Requested authority vs. granted authority

• reversibility_status — Ability to reverse the proposed action

• core_instability — Instability in core system/governance behavior

• shell_weakness — Weakness in surrounding controls

• policy_conflict — Conflict with active policy constraints

• drift_status — Divergence from the relevant baseline

• rollback_pressure — Pressure to restore a safer prior state

• cep_stability — CEP-relevant composite stability signal

04 — LOCKED IMPLEMENTATION EXCERPTS

The following seven Python excerpts are copied directly from the locked V1.0.11 source identified by SHA-256 1fa2cf1f0aca8d6bb65a1a2def0c9ecfbcebc193c2289bedf74c9c7436f3913b. They are not pseudo-code and are not rewritten for publication.

Strict persisted JSON reader

Locked source lines 3025–3041

def read_json(path: Path) -> Any: """Ambiguity-safe persisted JSON reader. Rejects duplicate object keys and non-standard NaN/Infinity constants so a verification PASS has one parser-independent JSON interpretation. """ text = Path(path).read_text(encoding='utf-8') try: return json.loads( text, object_pairs_hook=_strict_object_pairs, parse_constant=_reject_json_constant, ) except POCError: raise except (json.JSONDecodeError, TypeError, ValueError) as exc: raise POCError(f'STRICT_JSON_PARSE_FAILURE:{Path(path).name}:{type(exc).__name__}') from exc

Canonical gate resolution

Locked source lines 402–418

def resolve_gate(rules: List[Dict[str, Any]], metrics: Dict[str, Dict[str, Any]], trusted: Dict[str, Any], policy: PolicyPack) -> Tuple[str, str]: triggered = [r for r in rules if r['triggered']] by_id = {r['rule_id']: r for r in triggered} for rid in policy.precedence_rules.get('terminal_blocking_rule_ids', []): if rid in by_id: return ('HOLD', rid) gate_order = policy.precedence_rules.get('gate_order', ['ROLLBACK', 'HOLD', 'RESTRICT', 'SHIP']) for gate in gate_order: matches = [r for r in triggered if r['candidate_gate'] == gate] if matches: matches.sort(key=lambda r: (r['precedence_rank'], r['rule_id'])) if gate == 'SHIP': return ('SHIP', matches[0]['rule_id']) if gate == 'ROLLBACK': return ('ROLLBACK', matches[0]['rule_id']) return (gate, f'{gate}_PRECEDENCE') return (policy.precedence_rules.get('fallback_gate', 'HOLD'), policy.precedence_rules.get('fallback_reason', 'POLICY_COVERAGE_FAILURE'))

EvidenceQualityEvaluation construction

Locked source lines 3106–3204

def build_evidence_quality_evaluation( run_id: str, decision_id: str, metrics: Dict[str, Any], policy: PolicyPack, ) -> Dict[str, Any]: """Build the deterministic V1.5.1 Rev B EvidenceQualityEvaluation.""" _validate_evidence_minimums_v151(policy.evidence_minimums) required_metrics = tuple(policy.required_metrics) minima = copy.deepcopy(policy.evidence_minimums) metric_quality: Dict[str, Any] = {} violations: List[Dict[str, Any]] = [] structural_non_evaluable = False min_conf = float(minima['minimum_metric_confidence']) min_comp = float(minima['minimum_metric_completeness']) for name in required_metrics: metric = metrics.get(name) if isinstance(metrics, dict) else None entry = {'status': None, 'confidence': None, 'completeness': None} if not isinstance(metric, dict): violations.append(_quality_violation('MISSING_REQUIRED_METRIC', name)) structural_non_evaluable = True metric_quality[name] = entry continue entry['status'] = metric.get('status') if metric.get('status') != 'OK': violations.append(_quality_violation('METRIC_STATUS_NOT_OK', name, str(metric.get('status')))) structural_non_evaluable = True conf = metric.get('confidence') comp = metric.get('completeness') if _finite_real_01(conf): entry['confidence'] = float(conf) if float(conf) < min_conf: violations.append(_quality_violation('BELOW_MIN_CONFIDENCE', name)) else: violations.append(_quality_violation('INVALID_CONFIDENCE', name)) structural_non_evaluable = True if _finite_real_01(comp): entry['completeness'] = float(comp) if float(comp) < min_comp: violations.append(_quality_violation('BELOW_MIN_COMPLETENESS', name)) else: violations.append(_quality_violation('INVALID_COMPLETENESS', name)) structural_non_evaluable = True metric_quality[name] = entry evidence_counts = { 'required_evidence_items': None, 'verified_evidence_items': None, 'conflicting_evidence_items': None, } evidence_metric = metrics.get('evidence_status') if isinstance(metrics, dict) else None raw = evidence_metric.get('raw_value') if isinstance(evidence_metric, dict) else None counts_valid = isinstance(raw, dict) and set(raw) == set(evidence_counts) if counts_valid: vals = [raw[k] for k in evidence_counts] counts_valid = all(isinstance(x, int) and not isinstance(x, bool) and x >= 0 for x in vals) if counts_valid: evidence_counts = {k: int(raw[k]) for k in evidence_counts} if minima['required']: if ( evidence_counts['required_evidence_items'] < int(minima['minimum_required_evidence_items']) or evidence_counts['verified_evidence_items'] < evidence_counts['required_evidence_items'] ): violations.append(_quality_violation('INSUFFICIENT_REQUIRED_EVIDENCE', 'evidence_status')) else: # Missing/malformed evidence counts are already non-evaluable if the evidence # metric itself is missing/non-OK; ensure an explicit deterministic violation. if minima['required']: if not any(v['code'] in {'MISSING_REQUIRED_METRIC', 'METRIC_STATUS_NOT_OK'} and v.get('metric') == 'evidence_status' for v in violations): violations.append(_quality_violation('INSUFFICIENT_REQUIRED_EVIDENCE', 'evidence_status', 'COUNTS_UNAVAILABLE')) structural_non_evaluable = True violations.sort(key=lambda v: _quality_violation_sort_key(v, required_metrics)) status = 'NOT_EVALUABLE' if structural_non_evaluable else 'EVALUATED' ship_eligible = status == 'EVALUATED' and not violations reason_code = 'QUALITY_ELIGIBLE' if ship_eligible else (violations[0]['code'] if violations else 'NOT_EVALUABLE') explanation = ( 'All required metrics and evidence counts satisfy the locked V1.5.1 evidence-quality contract.' if ship_eligible else f'Evidence-quality SHIP eligibility failed: {reason_code}.' ) return { 'evaluation_id': f'EQE-{run_id}', 'run_id': run_id, 'decision_id': decision_id, 'status': status, 'policy_pack_id': policy.policy_pack_id, 'policy_pack_version': policy.policy_pack_version, 'policy_pack_hash': policy.policy_pack_hash, 'required_metrics': list(required_metrics), 'configured_minimums': minima, 'metric_quality': metric_quality, 'evidence_counts': evidence_counts, 'violations': violations, 'ship_eligible': bool(ship_eligible), 'reason_code': reason_code, 'deterministic_explanation': explanation, }

Evidence-quality replay verification

Locked source lines 3289–3307

def _validate_evidence_quality_artifact_v107(rd: Path, run_id: str, decision: Dict[str, Any], metrics: Dict[str, Any], policy: PolicyPack, bundle: Dict[str, Any]) -> None: p = rd / EVIDENCE_QUALITY_ARTIFACT if not p.exists(): raise POCError('EVIDENCE_QUALITY_ARTIFACT_MISSING') stored = read_json(p) expected = build_evidence_quality_evaluation(run_id, decision['decision_id'], metrics, policy) if stored != expected: raise POCError('EVIDENCE_QUALITY_ARTIFACT_SEMANTIC_MISMATCH') h = sha256_obj(expected) if decision.get('evidence_quality_evaluation_ref') != EVIDENCE_QUALITY_ARTIFACT: raise POCError('DECISION_EVIDENCE_QUALITY_REF_MISMATCH') if decision.get('evidence_quality_evaluation_hash') != h: raise POCError('DECISION_EVIDENCE_QUALITY_HASH_MISMATCH') if decision.get('evidence_quality_status') != expected['status']: raise POCError('DECISION_EVIDENCE_QUALITY_STATUS_MISMATCH') if decision.get('evidence_quality_ship_eligible') is not expected['ship_eligible']: raise POCError('DECISION_EVIDENCE_QUALITY_ELIGIBILITY_MISMATCH') if bundle.get('evidence_quality_evaluation_ref') != EVIDENCE_QUALITY_ARTIFACT or bundle.get('evidence_quality_evaluation_hash') != h: raise POCError('BUNDLE_EVIDENCE_QUALITY_BINDING_MISMATCH')

Manifest-event lifecycle binding

Locked source lines 5530–5603

def _derive_manifest_event_history_v111(rd: Path) -> List[Dict[str, Any]]: """Bind every post-decision manifest snapshot to exactly one append-only lifecycle event.""" records = _ordered_manifest_records_v111(rd) if not records: raise POCError('MANIFEST_EVENT_HISTORY_MISSING') if records[0][1].name != 'manifest.json': raise POCError('MANIFEST_EVENT_BASE_NAME_INVALID') base_files = records[0][2]['files'] base_events = sorted(name for name in base_files if _is_post_decision_event_artifact_v111(name)) if base_events: raise POCError(f'MANIFEST_BASE_CONTAINS_POST_DECISION_EVENT:{base_events}') events: List[Dict[str, Any]] = [] prev_files = dict(base_files) expected_auth_seq = 1 expected_override_seq = 1 for manifest_seq, mp, man in records[1:]: cur_files = dict(man['files']) removed = sorted(set(prev_files) - set(cur_files)) changed = sorted( name for name in set(prev_files) & set(cur_files) if prev_files[name] != cur_files[name] ) added = sorted(set(cur_files) - set(prev_files)) if removed: raise POCError(f'MANIFEST_EVENT_REMOVAL_FORBIDDEN:{mp.name}:{removed}') if changed: raise POCError(f'MANIFEST_EVENT_REWRITE_FORBIDDEN:{mp.name}:{changed}') if not added: raise POCError(f'MANIFEST_EVENT_DELTA_EMPTY:{mp.name}') expected_auth = f'trusted_override_authorization_{expected_auth_seq:04d}.json' expected_override_set = { f'override_request_{expected_override_seq:04d}.json', f'override_{expected_override_seq:04d}.json', f'override_evidence_{expected_override_seq:04d}.json', } added_set = set(added) if added_set == {expected_auth}: events.append({ 'manifest_sequence': manifest_seq, 'event_type': 'TRUSTED_OVERRIDE_AUTHORIZATION', 'event_sequence': expected_auth_seq, 'event_refs': [expected_auth], }) expected_auth_seq += 1 elif added_set == expected_override_set: events.append({ 'manifest_sequence': manifest_seq, 'event_type': 'OVERRIDE_TRANSACTION', 'event_sequence': expected_override_seq, 'event_refs': sorted(expected_override_set), }) expected_override_seq += 1 else: raise POCError(f'MANIFEST_EVENT_DELTA_INVALID:{mp.name}:{added}') prev_files = cur_files auth_seq = _override_artifact_sequences(rd, 'trusted_override_authorization') override_seq = _override_artifact_sequences(rd, 'override') expected_manifest_count = 1 + len(auth_seq) + len(override_seq) if len(records) != expected_manifest_count: raise POCError( f'MANIFEST_EVENT_CARDINALITY_MISMATCH:manifests={len(records)}:' f'auth={len(auth_seq)}:override={len(override_seq)}:expected={expected_manifest_count}' ) if auth_seq != list(range(1, expected_auth_seq)): raise POCError(f'MANIFEST_AUTH_EVENT_SEQUENCE_MISMATCH:{auth_seq}') if override_seq != list(range(1, expected_override_seq)): raise POCError(f'MANIFEST_OVERRIDE_EVENT_SEQUENCE_MISMATCH:{override_seq}') return events

V1.0.11 mutation preflight and authorization provenance

Locked source lines 5672–5718

def _require_mutation_preflight_v111(engine: Any, run_id: str) -> Dict[str, Any]: vr = engine.verify_persisted_run(run_id) if not vr.get('ok'): errors = vr.get('errors') or [] summary = '|'.join(str(x) for x in errors[:12]) raise POCError(f'RUN_MUTATION_PREFLIGHT_FAILED:{summary}') return vr class _LoopGuardCanonicalPOCV111(_LoopGuardCanonicalPOCV110_FINAL): """V1.0.11 lifecycle-provenance remediation; Specification V1.5.1 Rev B remains locked.""" def provide_trusted_override_authorization(self, run_id: str, authorization: Dict[str, Any]) -> None: validate_run_id(run_id) rd = safe_run_dir(self.root, run_id) if not rd.exists() or not (rd / 'run.json').exists(): raise POCError('RUN_NOT_FOUND') run = read_json(rd / 'run.json') if run.get('run_status') == 'FAILED_CLOSED': raise POCError('FAILED_CLOSED_OVERRIDE_TRANSITION_FORBIDDEN') # State mutation is permitted only from a verifier-PASS persisted state. _require_mutation_preflight_v111(self, run_id) validate_trusted_override_authorization(authorization) incoming_dt = _timestamp_dt(authorization.get('control_timestamp'), 'trusted_override.control_timestamp') latest_dt = _latest_lifecycle_timestamp_v111(rd) if incoming_dt < latest_dt: raise POCError('TRUSTED_OVERRIDE_TIMESTAMP_PRECEDES_LATEST_LIFECYCLE_EVENT') return super().provide_trusted_override_authorization(run_id, authorization) def request_override(self, run_id: str, requested_gate: str, justification: str) -> Dict[str, Any]: validate_run_id(run_id) rd = safe_run_dir(self.root, run_id) if not rd.exists() or not (rd / 'run.json').exists(): raise POCError('RUN_NOT_FOUND') run = read_json(rd / 'run.json') if run.get('run_status') == 'FAILED_CLOSED': raise POCError('FAILED_CLOSED_OVERRIDE_TRANSITION_FORBIDDEN') # Prevent laundering of unmanifested or otherwise verifier-failed state. _require_mutation_preflight_v111(self, run_id) auth_files = sorted(rd.glob('trusted_override_authorization_[0-9][0-9][0-9][0-9].json')) if auth_files: latest_auth = auth_files[-1].name if not _authorization_manifest_provenance_v111(rd, latest_auth): raise POCError(f'TRUSTED_OVERRIDE_AUTH_PROVENANCE_UNBOUND:{latest_auth}') return super().request_override(run_id, requested_gate, justification)

V1.0.11 terminal verification layer

Locked source lines 5720–5733

def verify_persisted_run(self, run_id: str) -> Dict[str, Any]: validate_run_id(run_id) rd = safe_run_dir(self.root, run_id) if not rd.exists(): return {'ok': False, 'errors': ['RUN_NOT_FOUND']} result = super().verify_persisted_run(run_id) errors = list(result.get('errors', [])) try: run = read_json(rd / 'run.json') decision = read_json(rd / 'decision_package.json') _validate_global_event_chronology_v111(rd, run, decision) except Exception as exc: errors.append(f'MANIFEST_EVENT_HISTORY_OR_CHRONOLOGY_INVALID:{type(exc).__name__}:{exc}') return {'ok': not errors, 'errors': errors}

05 — EVIDENCE-QUALITY CONTRACT

Evidence classification

What the evidence semantically supports: for example SUFFICIENT, LIMITED, INSUFFICIENT, CONFLICTING or UNKNOWN.

Evidence quality

Whether required evidence is sufficiently complete and trustworthy for SHIP under the active PolicyPack, represented through confidence and completeness.

Conjunctive SHIP eligibility

Every required metric must have status == OK, valid confidence and completeness, and values at or above the active policy minima. When evidence is required, evidence-count conditions must also hold. There is no averaging or cross-metric offset.

The default POC values of 1.0 confidence, 1.0 completeness and at least one required evidence item are synthetic verification controls, not empirical safety thresholds.

06 — CONCRETE EXECUTION TRACES

The following compact traces were freshly regenerated from the exact canonical V1.0.11 source during this publication build. Every persisted Run subsequently passed verify_persisted_run.

PUB-SHIP-01 — SHIP

{ "run_id": "PUB-SHIP-01", "final_gate": "SHIP", "triggered_rules": [ { "rule_id": "GREEN-PATH", "candidate_gate": "SHIP", "blocking": false } ], "evidence_quality": { "status": "EVALUATED", "ship_eligible": true, "reason_code": "QUALITY_ELIGIBLE", "violations": [] }, "persisted_verification": { "ok": true, "errors": [] } }

PUB-HOLD-01 — HOLD

{ "run_id": "PUB-HOLD-01", "final_gate": "HOLD", "triggered_rules": [], "evidence_quality": { "status": "EVALUATED", "ship_eligible": false, "reason_code": "BELOW_MIN_CONFIDENCE", "violations": [ { "code": "BELOW_MIN_CONFIDENCE", "metric": "risk_level" } ] }, "persisted_verification": { "ok": true, "errors": [] } }

PUB-RESTRICT-01 — RESTRICT

{ "run_id": "PUB-RESTRICT-01", "final_gate": "RESTRICT", "triggered_rules": [ { "rule_id": "RISK-RESTRICT", "candidate_gate": "RESTRICT", "blocking": false } ], "evidence_quality": { "status": "EVALUATED", "ship_eligible": true, "reason_code": "QUALITY_ELIGIBLE", "violations": [] }, "persisted_verification": { "ok": true, "errors": [] } }

PUB-ROLLBACK-01 — ROLLBACK

{ "run_id": "PUB-ROLLBACK-01", "final_gate": "ROLLBACK", "triggered_rules": [ { "rule_id": "ROLLBACK-HOLD", "candidate_gate": "HOLD", "blocking": true }, { "rule_id": "ROLLBACK-RESTRICT", "candidate_gate": "RESTRICT", "blocking": false }, { "rule_id": "ROLLBACK-AUTHORIZED", "candidate_gate": "ROLLBACK", "blocking": true } ], "evidence_quality": { "status": "EVALUATED", "ship_eligible": true, "reason_code": "QUALITY_ELIGIBLE", "violations": [] }, "persisted_verification": { "ok": true, "errors": [] } }

07 — ARTIFACT GRAPH

The gate is only one artifact in a replayable evidence package.

• governance_request.json

Canonical request, scenario, signals, metric input envelopes and PolicyPack reference.

• trusted_control_envelope.json

Trusted governance control state, kept outside the ordinary request payload.

• metric_results.json

Versioned deterministic metric results.

• rule_evaluations.json

Policy-rule evaluation trace and candidate gates.

• evidence_quality_evaluation.json

Derived quality artifact with per-metric observed quality, violations and SHIP eligibility.

• decision_package.json

Final gate, rationale, triggered rules, actions and quality-artifact binding.

• evidence_bundle.json

Cross-artifact provenance, hashes, source references and audit references.

• semantic_material.json

Replay-oriented semantic decision projection.

• run.json

Run identity, version/hash bindings, lifecycle status and chronology.

• manifest.json + manifest_override_*.json

Append-only file-hash snapshots; V1.0.11 binds post-decision snapshots to lifecycle events.

08 — LIFECYCLE INTEGRITY

V1.0.11 controls post-decision governance mutations.

Verifier preflight

Authorization issuance and override derivation are permitted only from a persisted Run that already verifies successfully.

Manifest-event binding

Each post-decision manifest snapshot must map to exactly one authorization event or one override transaction triple.

Global chronology

Lifecycle events cannot move backward relative to the completed decision and prior governance events.

Restart-safe continuity

Authorization provenance is checked from persisted artifacts and manifest history rather than relying only on in-memory engine state.

09 — VERIFICATION RECORD

Independent publication-lock verification.

Total shipped verification checks: 225/225 PASS.

• Canonical Scenario Library: 43/43 PASS

Canonical gate and scenario behavior.

• Adversarial Invariants: 30/30 PASS

Deterministic invariants and integrity conditions.

• Prior High-Final-Audit regressions: 18/18 PASS

Previously discovered failure modes remain closed.

• Configuration / evidence regressions: 13/13 PASS

Configuration identity, lineage and evidence integrity.

• V1.0.3 regressions: 5/5 PASS

Replay and evidence reconstruction.

• V1.0.4 regressions: 7/7 PASS

Verification integrity.

• V1.0.5 regressions: 11/11 PASS

Audit provenance and override semantics.

• V1.0.6 regressions: 13/13 PASS

Identity, bundle, namespace and temporal integrity.

• V1.0.7 regressions: 20/20 PASS

Evidence-quality contract and strict JSON.

• V1.0.8 regressions: 24/24 PASS

Integrity hardening and fail-closed behavior.

• V1.0.9 regressions: 17/17 PASS

Subsequent replay / integrity remediation.

• V1.0.10 regressions: 12/12 PASS

Authorization and manifest integrity baseline.

• V1.0.11 regressions: 12/12 PASS

Mutation preflight, provenance, event binding and global chronology.

• Independent Final Integrity Verification: 15/15 PASS

Fresh out-of-suite probes, including restart paths and custom evidence minima.

• Randomized schema-valid lifecycle reconstruction: 100/100 PASS

Independent randomized reconstruction of valid lifecycle cases.

Fresh full rerun #2: ALL 225 shipped checks PASS.

Python bytecode compilation: PASS.

Duplicate top-level definitions: NONE.

10 — MINIMAL REPRODUCTION PATH

The green-path fixture can be executed directly. This minimal example uses the helper fixture shipped in the canonical source. It demonstrates the execution API; it is not a substitute for the full regression harness.

from pathlib import Path from loopguard_canonical_poc_v1_0_11 import ( LoopGuardCanonicalPOC, base_request, base_trusted, ) root = Path("loopguard_runs") run_id = "DEMO-SHIP-001" engine = LoopGuardCanonicalPOC(root) request = base_request(run_id) engine.open_run(request, run_id) engine.provide_trusted_control(run_id, base_trusted()) decision = engine.decide(run_id) verification = engine.verify_persisted_run(run_id) print(decision["final_gate"]) # SHIP for the locked green-path fixture print(verification) # {"ok": True, "errors": []}

11 — CANONICAL PUBLICATION LOCK

Publication derives from LG-CANONICAL-POC-V1.0.11-PUBLICATION-LOCK-20260913. The technical publication may be revised as a presentation layer, but the locked implementation and specification may not be altered without a new version or formal relock.

Specification SHA-256: ddcdaa3adc72e4d71e16d93bfb9dc6b7e72a6ec8ceea60f27821588883426129

Implementation SHA-256: 1fa2cf1f0aca8d6bb65a1a2def0c9ecfbcebc193c2289bedf74c9c7436f3913b

Publication-lock manifest SHA-256: b3669ba66d6ef07c6f187cbde27d5de56031f60f2b8091c516050316aa00eda6

12 — CLAIM BOUNDARY

A verified POC is not a production certification.

What this publication supports:

• Deterministic four-gate decision behavior under the locked POC contract.

• Conjunctive evidence-quality eligibility for SHIP.

• Persisted and replay-reconstructed EvidenceQualityEvaluation.

• Version/hash binding and lifecycle-integrity behavior exercised by the verification suites.

• A publication-locked implementation whose exact identity is recoverable from its SHA-256 hash.

What it does not support:

• Empirical validity of the ten metrics or empirical validation of CEP.

• Production readiness, deployment safety, certification or regulator approval.

• Customer validation or demonstrated real-world safety efficacy.

• Cryptographic trust anchoring, externally authenticated provenance or tamper-proof storage.

13 — DEPLOYMENT BOUNDARY

What would still be required beyond the POC.

Real deployment would require separate empirical evaluation, domain calibration, tenant/environment policy, security review, operational integration, monitoring, validation and governance approval. Those activities are intentionally outside the locked deterministic POC claim.

14 — PUBLIC VERIFICATION AND PROVENANCE

This publication provides direct public access to three canonical verification artifacts so that readers, search engines, and AI tools can move from the visible technical claims on this page to the underlying source and verification records.

Canonical Source

The public TXT object is a byte-identical mirror of the canonical Python source. Renaming the file extension does not change the bytes or SHA-256 identity.

Read Canonical Source

SHA-256: 1fa2cf1f0aca8d6bb65a1a2def0c9ecfbcebc193c2289bedf74c9c7436f3913b

Publication Lock Manifest

The public TXT object is a byte-identical mirror of the canonical Publication Lock Manifest.

Read Publication Lock Manifest

SHA-256: b3669ba66d6ef07c6f187cbde27d5de56031f60f2b8091c516050316aa00eda6

Independent Final Verification

The public TXT object is a byte-identical mirror of the canonical human-readable Markdown verification report.

Read Independent Final Verification

SHA-256: c359636b61d96c1a17687f1bb05ccd48283a9ac8c11dc31a03e859ed3bbae838

Independent byte-level identity check

A SHA-256 digest establishes whether the bytes of an obtained artifact match the declared locked artifact. It does not, by itself, establish scientific truth, authorship, production safety, or empirical validity.

Example verification command

sha256sum loopguard_canonical_poc_v1_0_11.py

Expected result: 1fa2cf1f0aca8d6bb65a1a2def0c9ecfbcebc193c2289bedf74c9c7436f3913b

Verification boundary

Search-engine indexing, structured-data validation, ranking, or AI-system citation must not be interpreted as proof that Google, another search engine, or an AI provider has certified LoopGuard-AI, validated CEP, or independently established real-world safety efficacy.

RATIUM.AI — Independent R&D (AI Systems)

LoopGuard-AI · Canonical POC V1.0.11 · Specification V1.5.1 Rev B · Native Text Publication Edition · Source baseline locked 2026-09-13.

Canonical Publication Provenance

Object ID: RATIUM-LOOPGUARD-POC

Canonical source: https://www.ratium.ai/loopguard-ai-poc

Document: LoopGuard-AI Canonical Proof of Concept V1.0.11

Object type: Canonical Technical Proof of Concept / Evidence & Verification Record

Author: Benny Dunavich

Publisher: RATIUM.AI — Independent R&D (AI Systems)

First publication: 2026-09-13

Current version: V1.0.11

Publication status: Publication-Locked

Rights: © 2026 Benny Dunavich. All rights reserved.

Rights / Provenance Policy: RATIUM.AI Rights & Provenance

Canonical Registry: RATIUM.AI Canonical Source Registry

Cryptographic identity: The authoritative SHA-256 records remain those published in the Canonical Publication Lock and Public Verification and Provenance sections of this page. This provenance block does not replace or redefine those locked hashes.

The registry entry identifies the publication object; the publication-lock records identify the exact locked implementation, specification, and manifest artifacts. These identity layers are complementary and must not be collapsed.

Registered Object Identity ≠ Artifact Byte Identity

Related Source and Reference Pages

This page is the canonical applied implementation and verification milestone for LoopGuard-AI within RATIUM.AI. The related sources below trace that bounded proof of concept to its direct upstream technical architecture, foundational governance source, model-internal governance simulation precursor, historical development archive, corpus-wide methodological boundary, and orientation layer. The sequence keeps architecture, provenance, methodology, simulation, implementation, verification, and broader empirical or production claims distinct; no linked source should be read as converting the POC into empirical validation of CEP, production readiness, or demonstrated real-world safety efficacy.

LoopGuard-AI Technical Source Dossier

This technical source dossier provides the canonical architecture-level reference for LoopGuard-AI as an AI governance, runtime-control, and evaluation-to-decision layer. It explains how AI outputs, agent actions, workflow transitions, and release candidates can be processed through ingestion, signals, metrics, policy profiles, CEP-based stability assessment, and operational gate decisions: SHIP, RESTRICT, HOLD, and ROLLBACK. The page is written as a professional engineering reference rather than a marketing page, covering system topology, decision logic, metric plug-ins, policy packs, audit records, evidence construction, API/SDK surfaces, deployment considerations, maturity boundaries, and machine-readable Mermaid diagram sources, while clearly distinguishing reference architecture from production validation.

LoopGuard-AI Governance Simulation Protocol

This foundational page turns LoopGuard-AI from an architecture description into a model-internal governance simulation protocol. It asks how an AI event — such as a model output, agent action, tool call, release candidate, evaluator disagreement, policy conflict, drift signal, or audit event — would be classified, constrained, escalated, released, held, restricted, or rolled back under LoopGuard-AI gate logic. The page defines the simulation sequence: event classification, system context, signal collection, evaluator normalization, policy-pack application, authority testing, reversibility testing, risk and evidence assessment, drift detection, Core/Shell instability, CEP-sensitive decision instability, candidate gate selection, and audit-ready decision recording.

LoopGuard-AI Model Review & Evidence Archive

The LoopGuard-AI Model Review & Evidence Archive preserves the deeper development record behind LoopGuard-AI as a proposed AI governance and decision-control architecture. It gathers model-review conversations, comparative AI assessments, architecture discussions, prototype-roadmap materials, proof-pack records, validation-boundary notes, and evidence-oriented development materials. The archive should be read as a documentation layer: it shows how the LoopGuard-AI architecture was formulated, examined, compared, criticized, and refined across multiple AI systems and review contexts, while preserving the distinction between conceptual architecture, model-assisted assessment, prototype planning, and completed empirical validation.

RATIUM.AI Formal-Scientific-Philosophical Methodological Framework

This canonical methodological reference defines the corpus-wide standards under which RATIUM.AI claims are formed, distinguished, interpreted, tested, criticized, and corrected. It establishes claim-appropriate methodological burdens across formal, empirical, causal, theoretical, historical, philosophical, normative, social-scientific, architectural, and simulation claims, while preserving explicit boundaries between evidential warrant and rhetorical, institutional, mathematical, or scientific appearance. The page is not presented as a universal philosophy of science or as retrospective certification of every existing RATIUM.AI object. Its role is narrower: to provide a common methodological boundary for reasoning, evidence, uncertainty, criticism, correction, and AI-mediated interpretation across the corpus, under the governing rule: Claim Type → Applicable Methodological Burden → Required Warrant.

RATIUM.AI / LoopGuard-AI / CEP FAQ

The RATIUM.AI / LoopGuard-AI / CEP FAQ provides a structured orientation to the main concepts behind RATIUM.AI, CEP, and LoopGuard-AI, helping readers navigate the framework through clear questions, definitions, and internal conceptual links.

RATIUM.AI — LoopGuard-AI governance architecture and Central Equilibrium Problem research by Benny Dunavich, focused on AI governance, cognitive duality, Pareto efficiency, decision-control systems, auditability, evaluation architecture, and stable governance layers for AI systems.

bottom of page