Every part of this programme that could fail is published in advance. The falsification dashboard already lists the kill conditions, and this note explains what a failed sweep would look like in practice, so that when the data lands the reader is not asked to trust the programme's post-hoc narration.
The framework's central claim is that beta greater than k is the sufficient condition for stability against reward hacking as capability scales. If a cell shows the condition satisfied and the system still hacks, or the condition violated and the system does not, the mapping between the theoretical invariant and observable behaviour is broken. The framework may be salvageable with a more careful specification, but the version now published is not the salvage; it is the falsified claim.
The estimator itself can fail. If the bootstrap intervals for beta and k are so wide that no cell is significantly on either side of the boundary, the sweep produces no signal, which is a different failure. A dataset that cannot distinguish between coupled and decoupled architectures under any measured effect size means the instrument is not measuring what the theory says it measures. That is fatal to the instrument, not the theory, but from the reader's point of view the outcome is the same: no headline claim.
The manuscript retracts the operative claim in a labelled retraction with a timestamped commit. The falsification dashboard swaps its status from "condition holds" to "condition fails". The convergence register removes any row whose derivation used the retracted claim, or marks it as depending on a retracted premise. The programme has done this once already, moving the recursion exponent from about 2.24 to about 0.49 against itself; the mechanism is not hypothetical.
The policy notes that lean on the framework, chiefly on the argument that recursive self-improvement needs a measurable safety invariant, would remain intact as far as they name the shape of the problem. They would lose their proposed invariant. They would revert to the pre-programme position: recursive systems need safety architecture that scales with capability, and no one has yet demonstrated a measured invariant of that shape. That is a real loss and not a rhetorical hedge.
A programme without a written failure mode is not falsifiable. The tests are cheap enough to run. The theory is specific enough to break. If the reader cannot find the shape of a failure when it lands, the programme has not been honest about what it is doing.
A precise account of the outcomes that would refute the framework, published before the sweep runs. If the data comes in and this note reads like a self-fulfilling prophecy, that is the programme working as designed.
From the book Infinite Architects: Intelligence, Recursion, and the Creation of Everything by Michael Darius Eastwood.