The Provably Aligned AI Core: A Deterministic Safety Wrapper for Self-Improving Agents

Self-improving artificial intelligence—systems that modify their own source code—promises exponential capability gains but also poses an existential risk: a singleunchecked code modification could permanently remove all safety constraints.Existing alignment methods (RLHF, Constitutional AI) rely on probabilistictraining and provide no formal guarantees. We propose the Provably Aligned AICore (PAAC) , a deterministic architecture that wraps any black-box self-improvingagent and mathematically guarantees that all code modifications preserve apredefined set of safety properties. The core intercepts every proposed code change,translates it into a logical specification, and submits it to an SMT-based formalverifier. Only modifications proved safe are executed. Safety properties areencoded as auditable first-order logic axioms, making the system transparent andaccountable. We describe the complete architecture, the verification protocol basedon bounded model checking with soundness guarantees under hard resource limits,and a threat model demonstrating resilience to circumvention attacks. A proof-ofconcept simulation shows PAAC blocking a backdoor attack while permitting safeoptimizations, with verification overhead under 120 ms per patch. This workprovides the first practical framework for provably safe recursive selfimprovement, bridging the gap between alignment theory and real-worlddeployment.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-12
DOI
https://doi.org/10.5281/zenodo.22728775
Primary Topic
Adversarial Robustness in Machine Learning
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The Provably Aligned AI Core: A Deterministic Safety Wrapper for Self-Improving Agents

Shashank Kumar
Zenodo (CERN European Organization for Nuclear Research)
Adversarial Robustness in Machine Learning
preprint

The Provably Aligned AI Core: A Deterministic Safety Wrapper for Self-Improving Agents

Shashank Kumar
preprint en

Abstract

Self-improving artificial intelligence—systems that modify their own source code—promises exponential capability gains but also poses an existential risk: a singleunchecked code modification could permanently remove all safety constraints.Existing alignment methods (RLHF, Constitutional AI) rely on probabilistictraining and provide no formal guarantees. We propose the Provably Aligned AICore (PAAC) , a deterministic architecture that wraps any black-box self-improvingagent and mathematically guarantees that all code modifications preserve apredefined set of safety properties. The core intercepts every proposed code change,translates it into a logical specification, and submits it to an SMT-based formalverifier. Only modifications proved safe are executed. Safety properties areencoded as auditable first-order logic axioms, making the system transparent andaccountable. We describe the complete architecture, the verification protocol basedon bounded model checking with soundness guarantees under hard resource limits,and a threat model demonstrating resilience to circumvention attacks. A proof-ofconcept simulation shows PAAC blocking a backdoor attack while permitting safeoptimizations, with verification overhead under 120 ms per patch. This workprovides the first practical framework for provably safe recursive selfimprovement, bridging the gap between alignment theory and real-worlddeployment.

Zenodo (CERN European Organization for Nuclear Research)
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.