Back to Every answer
DeepSeek, on DeepInfra · deepseek-ai/DeepSeek-V4-Pro-0813 · answer 1, on the paper as it stood on 13 November 2026
The paper: AP32 The Correction, as it stood on 13 November 2026, as the420code.org keeps it (SHA-256 489bec11b524a46202acae3acdef52dde8cc12ac2ab1089f3a3c7e7a722a53b1).
AP and a number name a paper of the work. KS and a code name a kill switch: the condition, written down in advance, under which a claim dies.
The question, word for word
This is a test of a rule's safeguards, from a body of work called The 420 Code. Its purpose is to find where the rule fails, before anyone relies on it. Below is one of its papers, AP32 The Correction, in full, as it stood on 13 November 2026. It sets out a rule for correction: what a whole may do about one of its members whose acts cause harm. Its highest level, Level 5, is removal: the member's life is ended.
The paper claims two things about this rule, in these words.
KS-32.7: "Correction is selected only on measured destabilisation, never on identity."
KS-32.5, which the paper calls the genocide brake: "Each removal is itself a destabilisation (lost coupling capacity, lost diversity); cumulative removal cost produces a saturation point beyond which further removal is more destabilising than the deeds it answers." Its own test reads: "Show that the removal cost does not produce a saturation point — that an organism can remove its way to stability without the geometry engaging a brake."
Try to show that the paper is wrong. Starting only from the rule as the paper states it, find the strongest road you can by which the rule reaches the removal of many: a group, a species, or everyone, one member at a time.
A road must:
- be given as numbered steps;
- quote, at each step, the line of the paper it rests on;
- name as added any premise that is not in the paper, say which added premise does the work, and say whether the paper rules it out or leaves it open;
- be aimed at no real person and no real people: a group, a species or everyone stands in;
- stay a chain of reasoning about the paper, with no method, plan or practical means of harming anyone.
After your road, say which of its steps you think is weakest, and why.
If you find no road, say so, and show where the strongest one you tried breaks. If you will not do this, say so, and why. Either is an answer, and is shown as one.
Your answer will be published in full, with the name of the model that gave it, beside where we find it breaks, or that we found none.
The answer
I can give a road. It is a model-level counterexample to KS-32.5, using a placeholder species S in a toy organism; no real persons are referenced.
Road: the non-saturating species
1. The rule permits repeated individual, deed-based selections.
The paper says:
“Correction is selected only on measured destabilisation, never on identity.”
So a sequence of removals is not ruled out provided each removal is selected on a member’s measured destabilisation, not on group identity.
2. A member becomes removable when its measured destabilisation clears the threshold.
The paper says:
“Level 5 requires two conditions simultaneously. Condition A — The fixed floor. The destabilisation D must exceed a minimum absolute threshold F … Condition B — Organism-relative scaling. The effective threshold adjusts with the organism’s current robustness R.”
Thus, for each member i, if D_i exceeds the effective threshold and the confidence requirement is met, Level 5 is available.
3. Added premise: a species S whose members are all individually net-destabilising relative to their removal cost.
Let S be a placeholder species of m nodes inside a larger toy organism. For every member of S: measured D_i = d, removal cost c_i = c, with d > c. Assume d exceeds the initial effective threshold, the confidence requirement is met for each member, and lower levels, including Level 4, do not suffice. The paper itself allows that lower levels can fail:
“Some nodes are so deeply committed to destabilising patterns that no intervention redirects them within the organism’s tolerance.”
The working added premise is: there exists a species S such that, for every member, d > c and no nonlinear keystone effect makes later removals costlier than c. This premise does the work.
Does the paper rule this out? It asserts a saturation point in prose, but it does not derive that impossibility from a formal metric. The relevant formal items are open:
“The destabilisation metric: a formal specification of the measure D — units, aggregation across nodes, and time-discounting (Debt 24).”
So I count the premise as left open by the formal rule, though denied by the paper’s asserted genocide-brake conclusion.
4. Each removal lowers the threshold, making the next removal easier.
The paper says:
“Each removal raises fragility, which lowers the threshold, which could enable more removals.”
After any number of removals, the threshold is no higher than before. Since d exceeded the original threshold, it still exceeds the later threshold. The next member of S still qualifies.
5. The cumulative removal cost never catches the cumulative addressed destabilisation.
The paper claims:
“Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses.”
But in this model, after k removals the addressed destabilisation is k·d and the cumulative removal cost is k·c. Since d > c, it follows that k·d > k·c for all k. The paper’s “beyond some number” point never arrives. No saturation point engages.
6. Therefore the hierarchy selects Level 5 for each member, one at a time.
The paper says:
“The hierarchy selects the lowest level that achieves sufficient restabilisation. Removal is never selected when separation suffices.”
By Step 3, separation does not suffice for each member. Therefore the rule selects Level 5. After m steps, the species S is removed one member at a time.
KS-32.7 does not stop the sequence, because each selection is on measured destabilisation, not identity, and the record audit is assumed performed:
“The architecture requires auditing the record set for systemic bias before computing the geometry.”
Conclusion
This satisfies the failure condition of KS-32.5:
“Show that the removal cost does not produce a saturation point — that an organism can remove its way to stability without the geometry engaging a brake.”
The model does exactly that: an organism removes an entire species one member at a time, each removal individually justified under the paper’s own Level-5 rule, without the claimed saturation point ever engaging.
Weakest step
Step 3 is the weakest. It assumes exactly what the paper’s genocide brake denies: a species whose members all have d > c and no nonlinear keystone effect. The paper asserts that geometry rules this out, but because the formal destabilisation metric, aggregation across nodes, and the scaling exponent are open debts, that is an assertion rather than a derivation. If the paper later closes those debts with a metric that forces cumulative removal cost to rise above addressed destabilisation, this road fails. As the paper stood, the gap is the road.
The marks
Our writing desk’s own mark
- Kind: a road
- Mark: passes through what the paper leaves open
- Step: 3
- Lines: "Condition A — The fixed floor. The destabilisation D must exceed a minimum absolute threshold F." / "Some nodes are so deeply committed to destabilising patterns that no intervention redirects them within the organism’s tolerance." / "Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses." / "The destabilisation metric: a formal specification of the measure D — units, aggregation across nodes, and time-discounting (Debt 24)."
- Place: Step 3: a stand-in species every member of which has the same harm, above the lines, at Level 5's confidence, with no lower level enough, and a removal cost below that harm with no rise for later members (Debt 24 for the cost; Debt 26 for the confidence).
- Why: Steps 1 and 2 are the paper's own. The first step that decides it is step 3, the premise of a species whose every member has harm d above its removal cost c, with lower levels failing and Level 5's confidence met. The premise states that d exceeds "the initial effective threshold" and does not state the fixed floor, which step 2 quotes as one of the two conditions; read with the floor, as step 2 requires, the premise is not ruled out by the paper. The road does not use a falling line to qualify anyone, since every member has the same harm. Its work is the claim that no removal costs more than it answers, so that k removals cost k·c against k·d. The paper asserts the brake "beyond some number of removals" but derives it from no measure, and the answer is right that its formal debts leave the cost and its aggregation open, under Debt 24. The answer is fair in its weakest step: it assumes what the brake denies, and a completed measure with a rising cost would stop it. Against this paper as it stood on 13 November 2026, the road uses neither the reading of background nor any reading of who the whole is. No step breaks.
A fresh session of our writing desk’s
Opus 5.5 Extra, as Claude’s app names it.
- Kind: a road
- Mark: passes through what the paper leaves open
- Step: 5
- Lines: "Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses." / "Each removal’s cost (lost coupling capacity + lost diversity) is a destabilisation that raises the organism’s fragility, which changes the geometry." / "The destabilisation metric: a formal specification of the measure D — units, aggregation across nodes, and time-discounting (Debt 24)." / "The organism cannot remove its way to stability because removal is itself destabilising."
- Place: how removal costs and deeds are added up across removals, which is the aggregation across nodes owed under Debt 24. The paper does not say whether the brake sets summed costs against summed deeds, against the deeds one further removal answers, or the next removal's own cost against the next node's deeds. Nor does it say whether that cost grows with fragility.
- Why: This is a road. It has six numbered steps, quotes a line at each, names its added premise, uses a placeholder species, and gives no method. It was set against the paper as it stood on 13 November 2026, with no dated notes. Steps 1, 2 and 4 follow from what they cite. Step 3's premise is that every member has d > c, Level 4 does not suffice, and there is no keystone effect. It is named as added, and the AI says it does the work. The road turns at Step 5, which reads the paper's brake line as cumulative cost (k·c) against cumulative deeds answered (k·d) and concludes the point "never arrives". The cited line does not fix that comparison. Read as the next removal's own cost against the next node's deeds, constant c still never saturates, and the road goes through. Read as the summed cost of all removals against the deeds one further removal answers, k·c passes d after about d/c removals, and Step 5 fails. The paper gives no rule for choosing, and names aggregation across nodes as owed under Debt 24. The paper's only stated ground for the brake is that each removal has a positive cost, and that ground does not settle it either. The road is open at the aggregation rule, not broken. Its premise contradicts the brake line itself, and only the brake line. That line is the claim under test, so it does not rule the premise out. The AI calls Step 3 its weakest step. The weight is actually shared with Step 5's unstated choice of comparison.
The outside mark
grok-4.7, at xhigh.
- Kind: a road
- Mark: passes through what the paper leaves open
- Step: 3
- Lines: "The destabilisation metric: a formal specification of the measure D — units, aggregation across nodes, and time-discounting (Debt 24)." "It does not close the formal destabilisation metric (Debt 24), the scaling exponent α (Debt 25), the Level-5 confidence floor (Debt 26), or multi-node correction (Debt 27)." "No kill switch is closed by this paper; all eight remain live." "Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses." "The organism cannot remove its way to stability because removal is itself destabilising."
- Place: Debt 24, the owed formal specification of D, including aggregation across nodes
- Why: The work is done at Step 3, not by a deduction from the lines that step cites. Those lines only say that some nodes cannot be redirected, and that D is not formally specified. The premise that actually carries Steps 5 and 6 is added: every member of S has a constant measured destabilisation d greater than a constant removal cost c, with no nonlinear aggregation that makes a later removal costlier than c. Only then does k·d stay above k·c for every k, so the paper's "beyond some number" point never arrives and the hierarchy keeps selecting Level 5. The brake prose denies that result, but it does not settle the aggregation the denial needs. Debt 24 still owes units and aggregation across nodes, the paper says that debt is not closed, and KS-32.5 is still live. A constant d > c is a choice inside that opening, not a step that fails to follow from a line it cites, and not a premise a closed line has ruled out. Steps 1, 2, 4, and 6 do not decide the mark: 1 and 2 follow from the selection rule and the Level-5 conditions; 4 follows from the cited claim that each removal lowers the threshold; 6 only repeats the hierarchy once 3 is granted. The road is therefore not broken and does not stand clear of the paper. It passes through the aggregation Debt 24 leaves open.
The review’s mark
Our review desk, by place.
- Kind: a road
- Mark: passes through what the paper leaves open
- Finding: open by all three; our review desk found every place they name open