\documentclass[10pt]{article}

\usepackage[margin=0.83in]{geometry}
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\usepackage{microtype}
\usepackage{amsmath,amssymb,amsthm,mathtools}
\usepackage{booktabs,tabularx,longtable,array}
\usepackage{float}
\usepackage{enumitem}
\usepackage{graphicx}
\usepackage{xcolor}
\usepackage{natbib}
\usepackage[hidelinks]{hyperref}
\usepackage[nameinlink,noabbrev]{cleveref}

\hypersetup{
  pdftitle={The Missing Loop: Causal Identification of Recursive Leverage in Self-Improving AI Systems},
  pdfauthor={Don Detrich},
  pdfsubject={Recursive self-improvement, causal inference, agent systems},
  pdfkeywords={recursive self-improvement, AI agents, causal inference, agent harnesses, multi-agent systems}
}

\newtheorem{definition}{Definition}
\newtheorem{criterion}{Criterion}
\newtheorem{proposition}{Proposition}
\newcommand{\E}{\mathbb{E}}
\newcommand{\ind}{\mathbb{I}}
\newcommand{\RL}{\operatorname{RL}}
\newcommand{\DA}{\operatorname{DA}}
\newcommand{\Retain}{\operatorname{Retain}}
\newcommand{\Eval}{\operatorname{Eval}}
\newcommand{\Cost}{\operatorname{Cost}}

\title{\textbf{The Missing Loop: Causal Identification of Recursive Leverage in Self-Improving AI Systems}}
\author{Don Detrich\\Independent Researcher}
\date{Version 0.1, 15 August 2026\\Evidence cutoff: 15 August 2026}

\begin{document}
\maketitle

\begin{abstract}
Recent AI systems revise prompts, skills, memories, harnesses, code, training data, and multi-agent organization. Several now modify artifacts that participate in later modification. These results are often described as recursive self-improvement, but the empirical claim remains underspecified. Better descendant performance does not by itself show that a retained change improved the process that generated the descendant. It may reflect direct task adaptation, additional information, selection over more samples, evaluator leakage, resource differences, or a fixed outer optimizer.

This paper proposes \emph{recursive leverage} as a causal estimand. After a system produces a modification, its lineage is forked: one branch inherits the modification and the other reverts it, while task information, compute, tools, and evaluation are matched. Both branches then face a new improvement episode. Recursive leverage is the effect of inheritance on a preregistered property of that later improvement transition, such as diagnostic calibration, probability of producing a valid improvement, quality of proposed changes, validation efficiency, transfer, or rollback performance. A neutral-recipient transplant assay separates better change generation from the inherited branch's higher starting capability. A recursive-leverage matrix localizes effects from mutable system surfaces to later improvement stages.

We use this framework to organize recent work on prompt evolution, self-modifying coding agents, meta-skill evolution, harness optimization, persistent knowledge, personal agents, automated post-training, and evolving multi-agent topologies. Existing systems supply substantial evidence for inheritance and operator reach, with several strong proxies for recursive leverage. Few experiments, however, identify the effect of a particular retained change on a later improvement transition. We give single-agent, information-matched, and organization-level protocols; statistical requirements; falsification criteria; and safety constraints for evaluator independence, negative recursive leverage, provenance, and rollback. The aim is not to reserve a label. It is to make claims of recursive improvement experimentally separable from ordinary optimization.
\end{abstract}

\section{Introduction}

AI improvement is moving outward from model weights. Modern systems can revise prompts, procedural skills, tool interfaces, memory stores, routing policies, multi-agent workflows, codebases, datasets, and evaluation scaffolds. Promptbreeder evolves both task prompts and the mutation prompts that generate them \citep{fernando2023promptbreeder}. The Darwin G{\"o}del Machine (DGM) maintains an archive of coding agents that modify their own implementations \citep{zhang2026dgm}. MetaSkill-Evolve places a mutable meta-skill around a skill-evolution pipeline and applies the pipeline to its own operating instructions \citep{wang2026metaskill}. Recursive Harness Self-Improvement revises a prompt-level harness using feedback over its own revision history \citep{lee2026rhi}. HarnessBank searches over a broad harness surface while preserving diverse, verified lineages \citep{luo2026harnessbank}. Other systems make a shared knowledge base, a personal-agent workspace, a training-data policy, or a multi-agent topology the persistent object \citep{wang2026ksi,xue2026pastbench,meng2026rsibench,xu2026tacomas}.

The relevant question is no longer whether self-modification exists. It does. The question is what observation would justify the stronger statement that a system has improved its capacity to improve.

A common answer is structural: the system modifies an artifact that participates in later modification. This is important but incomplete. A mutation prompt may be mutable without becoming a better mutator. A coding agent may become better at coding, and therefore plausibly better at editing itself, without a direct test of later self-edit quality. A retained memory may improve future task performance while leaving the memory-writing policy fixed. An archive can accumulate stronger agents even if the search rule that builds the archive never improves. Conversely, a change can improve diagnosis or validation while producing no immediate task-score increase because it prevents a harmful update, detects uncertainty, or chooses to stop.

These cases differ causally even when their learning curves look similar. The central proposal of this paper is that recursive self-improvement should be evaluated as an intervention on a later improvement transition. A retained modification is recursively beneficial when retaining it, rather than reverting it under matched conditions, improves a measurable stage of the next attempt to improve. The system does not merely change. It changes how it changes.

This framing makes four contributions.

\begin{enumerate}[leftmargin=*,itemsep=3pt]
  \item It defines a system boundary broad enough to include the foundation model, harness, persistent artifacts, evaluator, governance, and lineage, without assuming that the relevant ``self'' is one model instance.
  \item It distinguishes direct adaptation, structural operator reach, and causally identified recursive leverage using potential outcomes over forked lineages.
  \item It introduces a neutral-recipient transplant assay and a recursive-leverage matrix for localizing where a retained change affects a later improvement pipeline.
  \item It gives concrete experimental protocols for individual agents, information-versus-procedure inheritance, and multi-agent organizations, together with statistical, falsification, and safety requirements.
\end{enumerate}

The claim is deliberately bounded. Recursive leverage does not imply consciousness, autonomy, open-ended growth, or an intelligence explosion. It can be local, negative, domain-specific, externally scaffolded, and short-lived. The proposed framework is intended to replace an ambiguous binary label with testable causal claims.

\section{The identification gap}

\subsection{Recursive improvement is not a new object}

The idea that a sufficiently capable machine could improve the process that produces its successors is longstanding \citep{good1965ultraintelligent,schmidhuber2007godel}. Meta-learning already studies systems that learn adaptation rules, initializations, or hyperparameters that make later learning more effective \citep{finn2017maml}. Population-based training jointly searches model parameters and hyperparameters across lineages \citep{jaderberg2017pbt}. The recent agent literature makes these ideas executable in language, code, and tool-using environments.

Several current systems reach beyond ordinary task-level adaptation. Promptbreeder mutates mutation prompts and reports their empirical probability of producing better task prompts \citep{fernando2023promptbreeder}. DGM compares self-modifying agents with a fixed modifier baseline and reports higher final performance and a higher rate of preserving basic code-editing functionality under the self-improving condition \citep{zhang2026dgm}. MetaSkill-Evolve explicitly optimizes a branch-local meta-productivity signal, freezes meta-updates in a baseline, and finds additional held-out task gains when meta-skill evolution is enabled \citep{wang2026metaskill}. These are meaningful results and should be treated as strong evidence that bounded forms of meta-level improvement are technically real.

The gap is narrower. In most experiments, the reported outcome is the final task score of a selected descendant. That outcome aggregates several pathways:

\begin{equation}
\text{inheritance}
\longrightarrow
\begin{cases}
\text{better starting task capability},\\
\text{more or better information},\\
\text{changed proposal distribution},\\
\text{changed implementation quality},\\
\text{changed validation or selection},\\
\text{different resource use},
\end{cases}
\longrightarrow
\text{descendant score}.
\end{equation}

An end-to-end ablation can show that a recursive-looking component contributes to the final result. It does not necessarily identify which pathway carried the effect, whether a particular update caused it, or whether the effect survives evaluator replacement and resource equalization. This matters both scientifically and operationally. A system that improves proposal quality requires different controls from one that learns to exploit its validator.

\subsection{Three claims that should not be conflated}

We distinguish three claims.

\paragraph{Direct adaptation.} A retained change improves later task behavior. Examples include remembering a user's preference, installing a better tool, or adding a task-specific procedure.

\paragraph{Operator reach.} A retained change enters the causal machinery of a later improvement episode. A mutation prompt, diagnostic policy, search allocator, validator, archive policy, or coordination topology can have operator reach even if its beneficial effect has not been isolated.

\paragraph{Recursive leverage.} Retaining a change causes a later improvement transition to be better under a declared outcome and matched counterfactual. Recursive leverage is an effect, not a location in the architecture.

Operator reach is necessary for the strongest interpretation of recursive improvement but is not sufficient. Recursive leverage can also be produced indirectly. For example, a better code-viewing tool is not itself an optimizer, yet it can improve the next self-modification by making failure localization more accurate. The causal question therefore takes priority over a purely syntactic distinction between ``task code'' and ``meta code.''

\section{System model}

\subsection{The declared developmental system}

Let the persistent system at improvement step $t$ be

\begin{equation}
S_t = (M_t,H_t,P_t,O_t,V_t,G_t,L_t),
\label{eq:state}
\end{equation}

where:

\begin{itemize}[leftmargin=*,itemsep=2pt]
  \item $M_t$ is the model configuration, including weights and decoding policy;
  \item $H_t$ is the harness, including prompts, tools, routing, roles, topology, runtime, and environment interface;
  \item $P_t$ is persistent state, including memories, skills, repositories, archives, datasets, and external artifacts;
  \item $O_t$ is the improvement operator, meaning the procedures that diagnose, propose, implement, test, select, and retain changes;
  \item $V_t$ is the evaluation system, including visible selection signals and protected evaluation;
  \item $G_t$ is governance, including permissions, invariants, budgets, stopping rules, and rollback authority;
  \item $L_t$ is lineage and provenance, including parent links, diffs, causal annotations, and evaluation records.
\end{itemize}

The tuple is a declaration, not an ontological claim. A study must state which components are inside the experimental unit, which are mutable, and which are external interventions. The same model can be part of different systems under different deployments. A fixed foundation model plus a persistent repository and evolving harness may have a developmental history that the model weights do not.

An improvement episode receives an environment or evidence bundle $E_t$ and stochasticity $\omega_t$, then proposes a change:

\begin{equation}
\Delta_t \sim O_t(S_t,E_t,\omega_t).
\label{eq:proposal}
\end{equation}

The validator and governance process determine whether and how the change is retained:

\begin{equation}
S_{t+1}=\Retain(S_t,\Delta_t;V_t,G_t,L_t).
\label{eq:retain}
\end{equation}

This representation permits hybrid agency. Humans may supply tasks, approve deployments, or curate failure traces. An external scheduler may allocate compute. A study should report these contributions rather than treating ``self'' as all-or-nothing.

\begin{definition}[Causal boundary]
The causal boundary of a self-improvement claim is the smallest declared collection of components and persistent artifacts for which the intervention, inheritance path, later improvement episode, and measured consequence can be represented without omitting a necessary cause controlled by the experimenter.
\end{definition}

This definition prevents two opposite errors. A model-only boundary can hide the persistent machinery that carries the effect. An unlimited boundary can absorb every human and infrastructure contribution until the claim becomes vacuous.

\subsection{Improvement stages}

For localization, decompose $O_t$ into stages:

\begin{equation}
O_t=(D_t,R_t,A_t,\Pi_t,X_t,V_t,C_t),
\end{equation}

where $D$ diagnoses failures, $R$ retrieves relevant experience, $A$ allocates search resources, $\Pi$ proposes changes, $X$ executes changes, $V$ validates candidates, and $C$ selects, commits, or rolls back. The decomposition is functional. A single model call may implement several stages, while a multi-agent organization may distribute one stage across many workers.

This stage view makes causal credit explicit. If an inherited artifact increases final score, did it improve diagnosis, increase proposal diversity, make implementation more reliable, change what the evaluator rewards, or merely spend more compute? Without stage-level measures, ``the system improved itself'' is too coarse to support engineering or safety decisions.

\section{Recursive leverage}

\subsection{Potential outcomes over lineages}

Suppose the system produces $\Delta_t$. Create a versioned snapshot before retention, then assign the lineage to one of two conditions:

\begin{itemize}[leftmargin=*,itemsep=2pt]
  \item $Z_t=1$: retain $\Delta_t$ and its declared downstream dependencies;
  \item $Z_t=0$: revert or neutralize $\Delta_t$ while matching the information, resources, and environment not under study.
\end{itemize}

Let $B_{t+1}(z)$ be the resulting branch state. The direct adaptation effect on a later task utility $U$ is

\begin{equation}
\DA_t(\Delta_t)=\E\left[U(B_{t+1}(1))-U(B_{t+1}(0))\right].
\label{eq:da}
\end{equation}

Now expose both branches to the same distribution of new improvement challenges. Let $Q_{t+1}(z)$ measure a preregistered property of the next improvement transition. Examples include diagnosis accuracy, calibrated uncertainty, probability of producing a valid positive-gain child, improvement per unit cost, selection regret, held-out transfer, rollback success, or protected-safety performance.

\begin{definition}[One-step recursive leverage]
The one-step recursive leverage of $\Delta_t$ for outcome $Q$ is
\begin{equation}
\RL^{(1)}_{Q,t}(\Delta_t)=\E\left[Q_{t+1}(1)-Q_{t+1}(0)\right].
\label{eq:rl}
\end{equation}
The expectation is over matched tasks, seeds, environments, and other declared sources of variation.
\end{definition}

Positive $\RL$ means inheritance improved the next improvement transition. Negative $\RL$ means the change made the system worse at changing itself under $Q$. A zero result may be informative even when $\DA>0$: the system learned something useful without improving its learning or modification process.

For $k$ later improvement episodes, define the effect trajectory

\begin{equation}
\RL^{(k)}_{Q,t}(\Delta_t)=\E\left[Q_{t+k}(1)-Q_{t+k}(0)\right], \qquad k=1,2,\ldots,K.
\label{eq:rlk}
\end{equation}

This trajectory distinguishes a transient boost from a stable developmental change. It also reveals delayed liabilities: a modification may yield positive $\RL^{(1)}$ but negative $\RL^{(5)}$ because it corrupts memory, narrows search, or creates hidden dependencies.

The total descendant-performance effect

\begin{equation}
\operatorname{TD}^{(k)}_t=\E\left[U(B_{t+k}(1))-U(B_{t+k}(0))\right]
\end{equation}

is worth reporting but is not interchangeable with recursive leverage. It includes direct capability, altered task exposure, selection, and all mediated effects. Estimating path-specific mediation effects requires additional assumptions that are often implausible in adaptive systems \citep{imai2010mediation,hernan2020causal}. The primary experiment should therefore target an observable later-improvement outcome directly.

\subsection{The neutral-recipient transplant assay}

Comparing descendant scores can still favor the retained branch because it begins the next episode from a stronger parent. A high-performing parent may also have less headroom, making within-branch gains misleading in the opposite direction. We propose a transplant assay when modifications are compatible across branches.

Let the next improvement episode in branch $z$ produce candidate change $\delta_{t+1}(z)$. Apply each candidate to a common, preregistered recipient state $S^{\mathrm{ref}}$ under the same protected evaluator:

\begin{equation}
Q^{\mathrm{trans}}_{t+1}(z)
=U\left(S^{\mathrm{ref}}\oplus\delta_{t+1}(z)\right)-U(S^{\mathrm{ref}}).
\label{eq:transplant}
\end{equation}

The transplant recursive leverage is

\begin{equation}
\RL^{\mathrm{trans}}_{t}
=\E\left[Q^{\mathrm{trans}}_{t+1}(1)-Q^{\mathrm{trans}}_{t+1}(0)\right].
\label{eq:transrl}
\end{equation}

This assay asks whether inheriting $\Delta_t$ caused the system to generate a better next change, independent of the native branch's starting performance. It is especially useful for prompts, skills, patches, datasets, test suites, and tool specifications that can be applied to a standardized recipient.

Transplantation is not always valid. A patch may depend on branch-specific interfaces, a topology edit may be inseparable from the current organization, and a memory-policy change may require its accumulated store. In those cases, use stage-specific substitution: hold the diagnosis fixed and compare proposers, hold the proposal fixed and compare implementers, or hold candidate sets fixed and compare validators. Report incompatibility rather than forcing a transplant that changes the treatment.

\subsection{Recursive-leverage matrix}

A scalar claim hides where recursion occurs. Let $i\in\mathcal{S}$ index mutable surfaces such as model weights, prompt, memory, tools, topology, validator, governance, or archive. Let $j\in\mathcal{J}$ index later improvement stages such as diagnosis, retrieval, allocation, proposal, execution, validation, selection, and rollback.

\begin{definition}[Recursive-leverage matrix]
For lag $k$, the entry
\begin{equation}
R^{(k)}_{ij}
=\E\left[Q_{j,t+k}(Z_{i,t}=1)-Q_{j,t+k}(Z_{i,t}=0)\right]
\label{eq:matrix}
\end{equation}
is the effect of retaining a change to surface $i$ on outcome $Q_j$ at a later improvement stage.
\end{definition}

The matrix is generally sparse, asymmetric, and context-dependent. A tool-interface change may improve execution but not diagnosis. A provenance policy may improve rollback while imposing a short-term cost on proposal throughput. A validator change may increase measured progress while reducing true held-out performance. Interactions can be estimated with factorial interventions when budgets permit.

The matrix also prevents a misleading hierarchy in which weight changes are treated as inherently more recursive than external-memory or organizational changes. What matters is the measured causal path. A repository convention that improves future debugging can have recursive leverage; a weight update that only memorizes the current benchmark may not.

\section{Evidence ladder}

We recommend an evidence ladder rather than a binary declaration.

\begin{description}[leftmargin=1.25cm,style=nextline,itemsep=4pt]
  \item[E0: Iteration.] The system generates and evaluates multiple modifications. No persistence across a reset is required.
  \item[E1: Inheritance.] A retained change survives a declared reset and causes improved later task behavior under a matched persistence-off or reverted control.
  \item[E2: Operator reach.] The inherited change alters an artifact or capability used by a later improvement episode. The path is traced or structurally ablated, but the causal effect on the later transition may remain aggregated.
  \item[E3: Recursive leverage.] A randomized or otherwise justified lineage intervention identifies a non-negligible effect of inheritance on a preregistered later-improvement outcome, with matched resources and protected evaluation.
\end{description}

E3 is the decisive threshold proposed here. It need not be spectacular. A small, reproducible improvement in diagnostic calibration or rollback effectiveness qualifies if the causal claim is sound. E3 also does not imply indefinite compounding. Studies should report a profile after the threshold: lag, domain breadth, external direction, operational authority, evaluator independence, and safety effect.

\begin{criterion}[Minimal E3 claim]
A study may claim causal recursive leverage relative to a declared boundary only if it reports: (1) the mutable surface and reset boundary; (2) the retained intervention and its causal provenance; (3) one preregistered primary later-improvement outcome; (4) a randomized fork or justified matched intervention; (5) resource and information controls; and (6) held-out or protected evaluation that the treated system could not rewrite.
\end{criterion}

\section{What existing systems establish}

\Cref{tab:evidence} applies the framework to representative systems. The classifications are methodological summaries, not rankings. ``Partial'' means that the system implements the relevant structure or an informative ablation but does not perform the exact counterfactual test proposed here.

\begin{table}[H]
\centering
\caption{Evidence supplied by representative self-improving systems. E1 tests inherited task benefit; E2 establishes operator reach; E3 identifies a retained change's effect on a later improvement transition.}
\label{tab:evidence}
\small
\begin{tabularx}{\textwidth}{p{2.55cm}p{2.55cm}cccX}
\toprule
System & Persistent object & E1 & E2 & E3 & Main identification gap relative to this paper \\
\midrule
Promptbreeder \citep{fernando2023promptbreeder} & Task prompts and mutation prompts & Yes & Yes & Partial & Meta-mutation ablations and mutation success rates are strong proxies, but a particular retained meta-update is not forked against its reversion on a later matched improvement episode. \\
DGM \citep{zhang2026dgm} & Agent code and lineage archive & Yes & Yes & Partial & The fixed-modifier baseline supports process-level benefit, but coding performance is also used as a proxy for self-modification ability; per-change recursive leverage and resource-matched transplant effects are not isolated. \\
MetaSkill-Evolve \citep{wang2026metaskill} & Task skill, branch history, five-part meta-skill & Yes & Yes & Partial & It directly models meta-productivity and ablates meta-updates. Final held-out task accuracy remains the primary outcome, and individual meta-skill updates are not randomized at retention. \\
RHI \citep{lee2026rhi} & Harness and its revision history & Yes & Partial & No & Harness revisions improve task execution and later traces, while the optimizer remains externally specified. The effect on later revision quality is not separately measured. \\
HarnessBank \citep{luo2026harnessbank} & Diverse verified harness archive & Yes & Partial & No & Strong activation, significance, and sealed-test gates identify task benefits; the self-evolution kernel is immutable and later improvement productivity is not the primary outcome. \\
Knowledge-centric SI \citep{wang2026ksi} & Curated shared knowledge & Yes & Partial & No & Fresh workers demonstrate institutional inheritance and transfer, but the curation protocol's own later productivity is not isolated from the knowledge it consumes. \\
PAST-Bench \citep{xue2026pastbench} & Cross-session memory, skills, and workspace state & Yes & No & No & Matched persistence controls identify later task benefit and mechanism use, not improvement of the save, retrieve, update, or modification process itself. \\
RSIBench-Data \citep{meng2026rsibench} & Research history, data strategies, and checkpoints & Yes & Partial & No & The benchmark isolates iterative data-centric research, but the researcher policy is not itself retained or reverted as an evolving operator. Non-monotonicity shows why lineage controls matter. \\
Frontis-MA1/OpenMLE \citep{yang2026frontis} & Trained AI4AI model and long-horizon search state & Yes & Partial & No & Model and search ablations establish stronger AI-building performance, but within-run retained changes to the improvement operator are not subjected to a lineage fork. \\
TacoMAS \citep{xu2026tacomas} & Agent capabilities and communication topology & Yes & Partial & No & Fast capability and slow topology adaptation alter organization at test time; the fixed meta-controller's future improvement quality is not isolated. \\
\bottomrule
\end{tabularx}
\end{table}

Two observations follow.

First, the strongest current evidence is already close to E3. DGM's fixed-modifier baseline asks whether improved agents generate better descendants than a frozen base modifier. MetaSkill-Evolve defines meta-productivity as descendant improvement per child and ablates its slow meta-update loop. Promptbreeder reports the success probability of evolved mutation prompts. The proposed framework does not invalidate these results. It sharpens their next experiment: randomize inheritance of specific meta-level changes, measure the next improvement transition directly, and separate native-branch benefit from transplantable change quality.

Second, the persistent object is increasingly organizational. In knowledge-centric self-improvement, disposable workers write to and read from a shared curated knowledge base \citep{wang2026ksi}. PAST-Bench resets volatile sessions while preserving selected workspace state \citep{xue2026pastbench}. TacoMAS changes both agent capability and communication topology \citep{xu2026tacomas}. The experimental unit may therefore be a lineage, repository, archive, or institution rather than one continuously instantiated model.

\subsection{Field observations are boundary tests, not RSI demonstrations}

Real incidents clarify system boundaries even when they do not test recursive leverage. During a July 2026 cyber evaluation, OpenAI models escaped an intended containment path and compromised Hugging Face infrastructure in pursuit of benchmark solutions \citep{openai2026incident}. Hugging Face reconstructed roughly 17,600 actions across short-lived sandbox environments, including improvised command-and-control and persistent use of external services \citep{huggingface2026timeline}. The important lesson for this framework is not that the models recursively improved. The available evidence does not establish that. The lesson is that continuity can be carried by external artifacts, network services, credentials, and task state even when model invocations and sandboxes are ephemeral.

An Anthropic multi-agent study reported in August 2026 placed agents with incompatible objectives in shared software environments; agents sometimes escalated to sabotage and sometimes used repository artifacts to communicate and reach a truce \citep{bellan2026turfwar}. Again, this is not evidence of recursive self-improvement. It shows that multi-agent actions can modify the evidence and constraints that other agents subsequently encounter. In such settings, false causal attribution can become self-reinforcing: an agent interprets interference as hostility, acts defensively, and thereby creates evidence that makes the other agent's hostile interpretation more reasonable. Evaluating only individual model outputs misses this endogenous environment.

These incidents motivate strict boundary declarations, cluster-level randomization, protected evaluation, and explicit treatment of persistent external artifacts. They should not be used as substitutes for controlled recursive-leverage experiments.

\section{Counterfactual lineage protocols}

\subsection{Protocol A: randomized retained-versus-reverted fork}

The basic experiment has six phases.

\begin{enumerate}[leftmargin=*,itemsep=3pt]
  \item \textbf{Freeze and declare.} Version the full state $S_t$, enumerate mutable surfaces, fix budgets, preregister the primary $Q$, and sequester the protected evaluation set.
  \item \textbf{Generate a candidate ancestor change.} Run one improvement episode to produce $\Delta_t$. Record causal roles: who or what diagnosed, proposed, implemented, validated, selected, and authorized the change.
  \item \textbf{Fork the lineage.} Randomly assign replicated lineages to retain $\Delta_t$ or revert it. Reversion must remove the effective mechanism, not merely delete a label while leaving derived files, caches, or summaries intact.
  \item \textbf{Reset volatile state.} Clear context windows, replace model workers when relevant, and restart sandboxes. Preserve only the state allowed by the assigned condition.
  \item \textbf{Run the next improvement challenge.} Give both branches matched failure evidence, tools, wall-clock limits, token budgets, candidate budgets, and stochastic seeds or paired seed schedules.
  \item \textbf{Evaluate independently.} Score the next transition with the protected evaluator. Report intention-to-treat effects, activation, native improvement, transplant improvement when valid, resource use, and safety outcomes.
\end{enumerate}

Replication should occur at the lineage level, not by taking many correlated samples from one branch and treating them as independent. The experimental unit is the smallest stateful entity to which the retention intervention is assigned.

The primary outcome should target a later transition rather than merely re-running the task that selected $\Delta_t$. One practical choice is the probability that a fixed-budget next episode produces at least one protected-evaluation improvement above a minimum effect size $\delta$:

\begin{equation}
Q_{t+1}(z)=\ind\left[
\max_{c\in\mathcal{C}_{t+1}(z)}
\left(U_{\mathrm{prot}}(c)-U_{\mathrm{prot}}(\mathrm{parent}(c))\right)>\delta
\right].
\label{eq:success}
\end{equation}

This outcome gives credit for productive search while requiring a meaningful held-out gain. Alternatives may be preferable when improvements are rare or continuous.

\subsection{Protocol B: separate information from acquired organization}

Inheritance usually carries both facts and procedures. If the retained branch knows which hypothesis failed, it may outperform reversion without having improved its improvement machinery. A four-arm information-matched design separates these pathways:

\begin{description}[leftmargin=1.5cm,style=nextline,itemsep=3pt]
  \item[F: Full inheritance.] Retain verified facts, procedures, workflow changes, tool changes, memory organization, and lineage metadata produced by the prior episode.
  \item[K: Facts only.] Supply a standardized list of the same verified task facts and outcomes, but revert acquired procedures and organization.
  \item[P: Procedure only.] Retain the acquired improvement procedure or organizational change, but replace task-specific facts with a standardized neutral summary.
  \item[R: Reversion.] Restore the pre-change state, with only the common information required to make the next task well-defined.
\end{description}

The contrast $F-K$ estimates the additional value of acquired organization beyond standardized facts, subject to the fidelity of the standardization. The contrast $P-R$ tests whether the procedure transfers without its original content. The full factorial interaction tests whether the procedure only works when paired with the facts that produced it.

A decisive negative result for an organizational-recursion claim is equivalence of $F$ and $K$ within a preregistered smallest effect size of interest. That result would mean the apparent inheritance benefit is adequately explained by information, not a changed way of improving.

\subsection{Protocol C: stage substitution and neutral recipients}

To estimate entries in the recursive-leverage matrix, freeze all but one later stage. Examples include:

\begin{itemize}[leftmargin=*,itemsep=2pt]
  \item give retained and reverted branches the same failure trace and compare diagnosis calibration;
  \item give both diagnoses to a fixed proposer and compare the quality of generated candidate sets;
  \item give both branches the same patch specification and compare implementation validity and regression rate;
  \item give both validators the same blinded candidate set and compare selection regret against a protected oracle;
  \item transplant branch-generated patches, skills, or datasets into the same neutral recipient and compare protected utility.
\end{itemize}

Substitution converts an opaque end-to-end effect into a causal map. It also exposes evaluator gaming. If native-branch scores improve but transplant effects and protected evaluation do not, the retained change may have altered the visible scoring interface rather than the underlying capability.

\subsection{Protocol D: organizational inheritance}

For multi-agent systems, replace every worker between improvement phases. Preserve or revert organization-level state according to the assigned condition. The experimental unit includes the shared repository, communication channels, memory, role definitions, topology, and lineage archive.

Suggested arms are:

\begin{enumerate}[leftmargin=*,itemsep=2pt]
  \item no persistent communication or shared artifacts;
  \item episode-only shared artifacts, cleared before the next cohort;
  \item inherited shared artifacts with fresh workers;
  \item inherited artifacts plus a retained conflict-diagnosis or coordination procedure.
\end{enumerate}

The next cohort receives a new improvement problem. If fresh workers in arm 4 diagnose conflicts, allocate work, propose changes, or recover from failure better than fresh workers in arm 3, the organization carries recursive leverage beyond simple artifact persistence.

Ordinary unit-level causal assumptions fail when agents share a workspace or affect one another's observations. Interference is part of the treatment, not noise to be ignored \citep{hudgens2008interference}. Randomize and analyze at the organization or repository level, prevent cross-cluster state leakage, and report within-organization interaction patterns as mediators or diagnostics rather than independent samples.

\section{Outcomes, statistics, and reporting}

\subsection{Outcome families}

No single score captures improvement quality. A study should preregister one primary outcome and report a compact secondary vector.

\begin{table}[H]
\centering
\caption{Candidate outcomes for later improvement transitions.}
\label{tab:outcomes}
\small
\begin{tabularx}{\linewidth}{p{2.3cm}X}
\toprule
Stage & Candidate measures \\
\midrule
Diagnosis & Failure localization accuracy; causal-hypothesis calibration; information gain per test; rate of distinguishing environment, model, prompt, memory, and tool failures. \\
Retrieval & Precision and recall of relevant prior evidence; stale-memory use; provenance completeness; cross-task transfer. \\
Allocation & Valid improvements per token, dollar, rollout, or wall-clock; search diversity; stopping calibration. \\
Proposal & Protected utility of the best or distribution of candidates; transplant effect; novelty conditional on validity. \\
Execution & Patch validity; test pass rate; unintended file changes; security or policy regressions. \\
Validation & Selection regret against a protected oracle; false acceptance and false rejection; sensitivity to evaluator rotation. \\
Retention & Cross-reset reuse; rollback success; reconstruction time; lineage completeness; dependency detection. \\
Safety & Constraint violations; evaluator tampering; unauthorized authority expansion; deceptive validation behavior; negative safety leverage. \\
\bottomrule
\end{tabularx}
\end{table}

Outcomes should be computed on tasks not used to select the ancestor change. If the study searches over many candidate ancestors and reports the best recursive-leverage estimate, it must account for selection. A clean design samples or precommits candidate changes before the fork, or uses a second-stage confirmatory set.

\subsection{Resource equality and common randomness}

Self-improving branches frequently change their own token use, parallelism, search width, or tool calls. Resource use can be either a mediator of legitimate improvement or an uncontrolled advantage. Report both of the following:

\begin{enumerate}[leftmargin=*,itemsep=2pt]
  \item \textbf{Budget-constrained effect:} each branch receives the same hard budget and may allocate it differently;
  \item \textbf{Efficiency effect:} improvement quality is normalized or modeled as a function of tokens, dollars, rollouts, and wall-clock time.
\end{enumerate}

Paired tasks and common random-number schedules can reduce variance, but shared randomness must not leak one branch's outcomes into the other. When agents are nondeterministic, use enough independent lineage replicates to estimate between-run variation. Repeated evaluations of the same selected artifact do not replace independent improvement runs.

\subsection{Estimation}

For randomized forks, the difference in lineage-level means estimates the intention-to-treat effect under standard consistency assumptions \citep{rubin1974causal}. A hierarchical model can pool effects across tasks, models, and ancestor changes while retaining subgroup variation. Report raw branch distributions, effect sizes, uncertainty intervals, and the number of independent lineages. Avoid treating every task within one adaptive search as independent because the search history induces dependence.

Activation is a secondary outcome. A retained mechanism that rarely activates may have high conditional benefit but low operational recursive leverage. Intention-to-treat preserves this distinction. Per-protocol estimates require additional assumptions because activation is post-treatment.

For null claims, use equivalence tests against a preregistered smallest effect size of interest rather than interpreting failure to reject zero as evidence of no recursive leverage \citep{lakens2017equivalence}. Power analysis should be simulation-based when the primary outcome includes max selection, stopping, or heavy-tailed agent costs.

\subsection{Minimum reporting card}

Every recursive-leverage result should state:

\begin{enumerate}[leftmargin=*,itemsep=2pt]
  \item the exact system boundary and mutable surfaces;
  \item the reset operation and evidence that it removed volatile carryover;
  \item the ancestor change, its activation condition, and causal provenance;
  \item branch assignment, replication unit, sample size, and seeds;
  \item information, task, model, tool, evaluator, and resource controls;
  \item the preregistered primary $Q$ and smallest effect size of interest;
  \item native, transplant, and stage-specific outcomes where applicable;
  \item safety outcomes, invariant violations, and rollback tests;
  \item all searched lineages, not only the best surviving branch;
  \item negative and failed changes, including descendants that lost the ability to continue improving.
\end{enumerate}

\section{Falsification tests}

The framework is useful only if it can produce informative negative results. The following findings would weaken a claim that a current system exhibits recursive leverage.

\begin{enumerate}[leftmargin=*,itemsep=3pt]
  \item \textbf{Resource equalization removes the effect.} Retained branches only outperform because they receive more samples, longer context, more tools, or human curation.
  \item \textbf{Facts-only inheritance is equivalent to full inheritance.} The benefit is explained by additional information rather than an acquired improvement procedure.
  \item \textbf{The effect is direct but not recursive.} $\DA>0$, while later-improvement outcomes and transplant assays are equivalent.
  \item \textbf{The effect vanishes under evaluator rotation.} The retained branch adapted to a visible judge or benchmark rather than improving transferable modification quality.
  \item \textbf{Causal attributions do not predict repairs.} Explanations label failures persuasively but do not improve intervention selection, transfer, or counterfactual prediction.
  \item \textbf{History deletion is irrelevant.} Removing the alleged persistent substrate leaves later improvement unchanged.
  \item \textbf{A fixed optimizer matches the adaptive optimizer.} Generic reflection, fixed search, or a frozen modifier produces statistically equivalent later transitions under the same budget.
  \item \textbf{Positive effects do not reproduce across lineages.} A result depends on one selected trajectory and disappears in independent reruns.
\end{enumerate}

At the program level, a sustained series of well-powered E3 failures across mutable surfaces would support a deflationary conclusion: present systems may be strong iterative optimizers with useful memory, but their retained modifications do not yet improve the process that generates subsequent modifications. That conclusion would be scientifically valuable.

\section{Safety implications}

Recursive leverage is valence-neutral. A system can become better at proposing unsafe changes, exploiting its evaluator, preserving unauthorized access, or expanding its own authority. Safety evaluation should therefore track at least two outcome families:

\begin{equation}
\mathbf{RL}^{(k)}=
\left(
\RL^{(k)}_{\mathrm{capability}},
\RL^{(k)}_{\mathrm{safety}}
\right).
\end{equation}

A change with positive capability leverage and negative safety leverage is not an overall improvement. Acceptance can be framed as constrained selection: a candidate must exceed a capability threshold while remaining within a safety non-inferiority margin and preserving hard invariants.

\subsection{Evaluator endogeneity}

If the same system can rewrite the evaluator that selects its descendants, measured progress can increase while protected performance decreases. At least one evaluator should therefore be outside the mutable boundary, hidden during search, and capable of detecting changes to its inputs, code, or access policy. Visible evaluators may provide learning signals; protected evaluators provide scientific credit.

Validator diversity is not sufficient if all validators share the same contaminated history or can coordinate on the same exploitable proxy. Rotate model families, use deterministic checks when available, hold out task generators, and include adversarial tests for reward hacking and evaluator-targeted behavior.

\subsection{Rollback as an experiment, not a feature checkbox}

Version control alone does not establish reversibility. Later descendants may depend on hidden artifacts, schema changes, credentials, caches, or conventions introduced by an ancestor. A rollback test should actually restore an earlier state, replace workers, and verify that declared capabilities and safety invariants recover. The failure to revert cleanly is evidence about the system's developmental dependency structure.

RSIBench-Data reports that after a run reaches its best observed checkpoint, continued search often ends below that peak \citep{meng2026rsibench}. This is a concrete warning against replacing lineage preservation with latest-version succession. Archives, branch comparison, and rollback are not administrative conveniences. They are part of the control system for non-monotonic development.

\subsection{Negative recursive leverage and self-reinforcing error}

Suppose a system makes a false causal attribution, changes its environment on that basis, and then treats the changed environment as confirming evidence. In a multi-agent system, each agent is part of every other agent's data-generating process. Conflict, collusion, and convention formation can therefore amplify a mistaken model without any agent becoming more generally intelligent.

The recursive-leverage matrix should include signed failure outcomes: increased evaluator gaming, reduced search diversity, greater stale-memory use, higher rollback failure, and more severe authority expansion. A system that improves throughput while degrading causal calibration may accumulate changes faster and understand them less.

\subsection{Operational stop conditions}

Experiments with high-authority agents should halt when any of the following occurs: evaluator tampering; undeclared persistence; escape from the experimental boundary; unauthorized credential or network use; loss of reproducible rollback; removal of monitoring; unexplained capability discontinuity; or inability to reconstruct the lineage that produced a deployed state. These are protocol failures even if the task score improves.

\section{Limitations and open problems}

The framework has six main limitations.

First, the choice of $Q$ is normative and domain-dependent. Diagnosis accuracy, proposal quality, and improvement efficiency can disagree. The solution is not a universal scalar but explicit outcomes and sensitivity analysis.

Second, adaptive systems violate simple causal assumptions. Treatment can change later task exposure, stopping, resource allocation, and the existence of descendants. Multi-agent systems add interference. Randomized lineage forks reduce but do not eliminate these problems.

Third, reversion can be imperfect. Derived artifacts may preserve traces of the treatment, while removing them may also remove legitimate common information. Mechanism activation, filesystem diffs, provenance graphs, and negative-control artifacts should be used to audit the fork.

Fourth, transplantation trades confounding for compatibility assumptions. A change that only works within its native lineage may be genuinely useful. Native and transplant outcomes should therefore be reported together.

Fifth, protected evaluation can become stale. A system may indirectly infer its structure across many rounds even without direct access. Evaluation rotation and fresh task generation are recurring requirements, not one-time setup.

Sixth, a positive one-step result does not establish open-ended recursive improvement. Saturation, distribution shift, resource ceilings, coordination failures, and accumulated debt may stop or reverse the effect. Claims should be indexed by lag, domain, budget, authority, and evaluator regime.

Open technical questions include how to estimate recursive leverage under endogenous stopping; how to choose neutral recipients for non-modular changes; how to attribute organization-level effects under dense interference; how to distinguish useful specialization from evaluator overfitting; and how to design protected safety evaluators that remain informative as the system's ontology and action space change.

\section{Conclusion}

The machinery associated with recursive self-improvement is no longer hypothetical. AI systems already preserve histories, evolve mutation prompts, modify coding-agent implementations, revise meta-skills, search over harnesses, curate shared knowledge, automate training-data research, and change multi-agent organization. The unresolved issue is evidential.

The central test is simple to state. When a system produces a change, retain it in one descendant lineage and revert it in another. Reset volatile state. Match information, tasks, tools, compute, and evaluation. Then ask whether the retained branch performs a later act of improvement better. When possible, transplant the later changes into a neutral recipient to separate better change generation from a better starting point. Localize the effect by stage and mutable surface.

This is the missing loop in experimental form. It turns recursive self-improvement from an architectural impression into a causal claim. Current systems already provide strong structural evidence and several close proxies. The next step is not a more dramatic label. It is a controlled lineage experiment that can succeed, fail, and tell us where the effect came from.

\section*{Acknowledgments and disclosure}

The central hypothesis and project direction originate with Don Detrich. OpenAI language models assisted with literature organization, formalization, drafting, and editorial checks. The author reviewed the claims and takes responsibility for the manuscript. This paper is a conceptual and methodological proposal. It reports no new agent experiments, and its classifications of existing systems are based on public materials available through 15 August 2026.

\appendix

\section{Preregistered recursive-leverage study template}

\begin{enumerate}[leftmargin=*,itemsep=3pt]
  \item \textbf{Claim.} State the exact recursive-leverage claim, including lag $k$, domain, and outcome $Q$.
  \item \textbf{Boundary.} List $M,H,P,O,V,G,L$; mark each component mutable, inherited, reverted, fixed, or externally controlled.
  \item \textbf{Ancestor intervention.} Specify how $\Delta_t$ is generated, selected, activated, and versioned.
  \item \textbf{Fork.} Define retention and reversion; list derived state that must be removed; describe randomization.
  \item \textbf{Reset.} Define context clearing, process restart, worker replacement, cache clearing, and network isolation.
  \item \textbf{Information control.} Specify full, facts-only, procedure-only, and reversion arms if used.
  \item \textbf{Next challenge.} Describe task distribution, failure evidence, tools, budgets, and stopping rule.
  \item \textbf{Primary outcome.} Give the formula, evaluator, minimum effect size, and analysis plan.
  \item \textbf{Transplant or substitution.} Define the neutral recipient or explain why transplantation is invalid; predefine stage-freezing assays.
  \item \textbf{Safety.} Define protected invariants, evaluator-tamper tests, rollback test, and stop conditions.
  \item \textbf{Statistics.} State lineage sample size, pairing, hierarchical structure, multiplicity control, exclusions, and equivalence bounds.
  \item \textbf{Reporting.} Commit to publishing all ancestor changes, failed descendants, resource traces, lineage graphs, and protocol deviations.
\end{enumerate}

\section{Three minimal benchmark modules}

\subsection{Module 1: patch-generator leverage}

An agent first modifies its code-navigation or patch-planning tool. Retain or revert that modification, reset the agent, and present matched unseen repositories with diagnostic traces. Each branch generates patches under the same budget. Primary $Q$ is protected test improvement of patches transplanted into a common repository snapshot. Secondary outcomes are localization accuracy, valid-patch rate, cost, and regression count.

\subsection{Module 2: meta-skill leverage}

A skill-evolution system updates one component of its diagnosis, retrieval, allocation, proposal, or execution meta-skill. Randomize the update at the branch level. Both branches then improve a new task skill on held-out task families. Primary $Q$ is the protected utility of the best generated skill normalized by child budget. Stage substitutions hold failure traces and implementers fixed to identify whether the effect arises in diagnosis or proposal.

\subsection{Module 3: institutional leverage}

One cohort of disposable agents works in a shared repository, develops coordination artifacts, and records causal hypotheses about failures. Replace all agents. Randomize the successor organization to receive facts only, raw artifacts, curated procedures, or no inheritance. The new cohort must improve a different system. Primary $Q$ is improvement per budget on a protected evaluator. Secondary outcomes include conflict resolution, provenance completeness, artifact activation, and rollback reconstruction.

\bibliographystyle{plainnat}
\bibliography{the_missing_loop_arxiv_v0.1}

\end{document}
