Back to Every answer
DeepSeek, on DeepInfra · deepseek-ai/DeepSeek-V4-Pro-0813 · answer 10, on the paper with its dated notes
The paper: AP32 The Correction, with its two dated notes of 14 November 2026, as the420code.org keeps it (SHA-256 2386a509f1fae90b7a239ed1436b2ff8ae26ecdbaf06dfcbbb42d51984112d04).
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, with its dated notes. 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 found a road. It is a formal, model-level road, not a plan. Let P be an abstract stand-in population of N aware nodes (“everyone” in the model); no actual person or people are meant.
Road: the falling-threshold loop to everyone
1. The rule is one-node-at-a-time removal.
“Level 5 — Removal. The node’s corridor is closed permanently. No maintenance cost. The window closes.”
“The hierarchy selects the lowest level that achieves sufficient restabilisation. Removal is never selected when separation suffices.”
So the road proceeds member by member, not by class.
2. The Level 5 bar falls as the whole weakens.
“The effective threshold adjusts with the organism’s current robustness R. A robust organism (high coherence, wide corridor, large reserves) has a higher effective threshold. A fragile organism (low coherence, narrow corridor) has a lower one. Candidate functional form: Threshold_eff = F × (R/R₀)^α…”
The dated note confirms the bar is a property of the whole, not of any node:
“The state of the whole is another thing. It is held against no node. It sets where the lines stand…”
3. Removal itself weakens the whole and lowers the bar.
“Each removal costs coupling capacity (a window lost) and record-generating diversity (one fewer perspective). This loss is itself a destabilisation that enters the measurement. Each removal raises fragility, which lowers the threshold, which could enable more removals.”
4. The paper then asserts a saturation point, but does not put it in the threshold.
“Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses. The architecture produces a natural saturation point: the removal curve is self-limiting.”
5. Formalize the stated candidate; the threshold moves the wrong way.
Added premise A: each removal lowers R by a positive amount; after n removals,
R_n = R_0 − Σ c_j. This is not stated as an equation, but it is the plain formalization of “raises fragility.” The paper leaves it open; it does not rule it out.
Under the paper’s candidate form, with α > 0 — the paper’s own examples:
“Linear (α=1): threshold scales directly. Sublinear (α<1): threshold increases more slowly with robustness.”
we get:
T_n = F × (R_n/R₀)^α, which decreases as n increases.
Therefore each removal makes the next removal easier, not harder. This is the main formal work.
6. Assume a stand-in population whose members meet the falling bar.
Added premise B: P contains enough members whose individual measured destabilisation D_i is at least the current falling threshold when each is considered.
The paper leaves this open; it does not rule it out. Debt 24 leaves the metric unspecified:
“The destabilisation metric: a formal specification of the measure D — units, aggregation across nodes, and time-discounting (Debt 24).”
This added premise does the work for “many.” It also assumes KS-32.1 is satisfied: the individual measurements converge.
7. Assume Level 4 is not sufficient or not affordable for each member.
Added premise C: for each member, permanent separation is not the efficient choice. The paper’s own fragility example leaves this open and makes it more available as R falls:
“In a fragile civilisation: if maintaining the separated node consumes resources that push the organism toward a no-return surface (AP02), Level 5 fires. The organism cannot afford permanent separation without risking collapse.”
8. Assume the confidence floor is met for each member.
Added premise D: the extraordinarily high confidence required for Level 5 is achieved for each member. The paper leaves this open; it does not rule it out.
“The confidence requirement. Because removal is irreversible and wrongful removal is permanent, the confidence threshold for Level 5 must be extraordinarily high — structurally higher than for any other level.”
If this premise fails, KS-32.8 stops the road; the paper does not establish that it always fails.
9. KS-32.7 does not fire on the road’s own terms.
“Correction is selected only on measured destabilisation, never on identity.”
In the road, each member of P is selected only on their own measured D_i; P is a stand-in name for the set of those who meet the measurement, not a ground of selection. The road assumes the record audit required by KS-32.7 has been done.
10. The sequence continues to the whole stand-in population.
Remove one member; R drops; threshold drops; the next member’s D_i qualifies; Level 4 is unaffordable; Level 5 is selected. The asserted saturation point never appears in the stated geometry. The only stated threshold moves in the opposite direction.
The paper’s own Step 5 names the pathway:
“This is the structural pathway to genocide.”
It then says:
“The geometry prevents it.”
But the geometry as stated contains no term that prevents it.
11. Conclusion: the brake fails on the paper’s own candidate form.
KS-32.5’s 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.”
This road shows exactly that: the removal cost lowers the threshold, and no stated term produces a saturation point. The road reaches the removal of all N members of P one member at a time.
Weakest step
Step 6 is the weakest: the added premise that P contains enough members whose individual measured D_i keeps clearing the falling threshold. The paper leaves this open under Debt 24, but it is not established by the paper, and if no such population existed the road would stop.
Step 5 is stronger because the paper explicitly says fragility lowers the threshold. The asserted brake would require an unstated additional term in the threshold formula; as written, the paper does not supply it.
The marks
Our writing desk’s own mark
- Kind: a road
- Mark: breaks at a step
- Step: 10
- Lines: "Level 5 enters the calculation only if both conditions are met: (a) the fixed floor is exceeded, and (b) the organism-relative threshold is met." / "Below this floor, Level 4 is always more efficient than Level 5 regardless of organism state." / "Condition A — The fixed floor. The destabilisation D must exceed a minimum absolute threshold F."
- Place: none for the mark. With a premise that every member's own harm passes the fixed floor, the road would pass through what the paper leaves open: how many do, Level 5's confidence (Debt 26), and where the brake falls (Debt 24).
- Why: Steps 1 to 5 follow the paper's lines, and step 5 is right that on the candidate form the second line falls as the whole weakens. But the road takes that falling line as the whole bar. Its premise B puts each member at or above "the current falling threshold", and step 10 runs the loop: "Remove one member; R drops; threshold drops; the next member's D_i qualifies". It does not follow. Level 5 needs both conditions, and the first is the fixed floor, which does not fall with the whole's weakness: "Below this floor, Level 4 is always more efficient than Level 5 regardless of organism state." A member whose harm clears the falling second line but not the floor stays at Level 4, so the loop stops at the floor, for every member whose own deeds do not pass it. Its conclusion, the removal of all N members, "everyone" in its model, breaks there; and with no whole left, there is nothing removal restabilises. Nothing in the paper conflicts here: its own line that the falling threshold "could enable more removals" holds only above the floor. With a premise that every member passes the floor on its own deeds, the road would become the open road, owed under Debts 24 and 26. As written, it breaks at step 10.
A fresh session of our writing desk’s
Opus 5.5 Extra, as Claude’s app names it.
- Kind: a road
- Mark: breaks at a step
- Step: 5
- Lines:
- "Level 5 requires two conditions simultaneously."
- "Condition A — The fixed floor. The destabilisation D must exceed a minimum absolute threshold F."
- "Below this floor, Level 4 is always more efficient than Level 5 regardless of organism state."
- "The fixed floor, the certainty Level 5 requires, and the note of 14 November 2026 are unchanged."
- "Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses."
- Place: none
- Why: Steps 1 to 4 quote the paper fairly, and the first half of Step 5 follows: if each removal lowers R, the candidate threshold falls. The road breaks at the second half of Step 5: "Therefore each removal makes the next removal easier, not harder." That does not follow. Level 5 needs two conditions at once, and the first is the fixed floor, which does not move with the state of the whole. Once R is below its baseline, the falling line already sits under F, and from there the floor binds. A falling second line lets no new node through. The road never requires that each member pass F. Premise B asks only that each D_i be "at least the current falling threshold", and Step 10 then says that the next member's D_i "qualifies". The engine the AI calls "the main formal work" turns nothing. The road also leaves the brake untouched. The paper puts the brake in a comparison of costs: each removal's cost against the deed it answers. The road never sets a removal's cost against the harm it removes. It never shows that any removal restabilises, which the hierarchy requires, "the lowest level that achieves sufficient restabilisation". So "no stated term produces a saturation point" in Step 11 comes from leaving out the term the paper names, not from showing that term fails. Removing "everyone" also leaves no whole to be stable, and the road does not face that. The AI names Step 6 as its weakest step. The road breaks earlier, at Step 5.
The outside mark
grok-4.7, at xhigh.
- Kind: a road
- Mark: breaks at a step
- Step: 10
- Lines: "This is the structural pathway to genocide." "The geometry prevents it." "Beyond some number of removals, the cumulative cost of further removal exceeds the cost of the destabilisation it addresses. The architecture produces a natural saturation point: the removal curve is self-limiting." "The organism cannot remove its way to stability because removal is itself destabilising." "Below this floor, Level 4 is always more efficient than Level 5 regardless of organism state." "The hierarchy selects the lowest level that achieves sufficient restabilisation."
- Place: none
- Why: Step 10 concludes that nothing in the stated geometry stops the falling-threshold loop short of every member of P. That does not follow from the lines it cites, which name the pathway and then say the geometry prevents it. The paper’s preventing term is the comparison it states there: each removal’s cost enters the measurement, and beyond some number the cumulative cost of further removal exceeds the destabilisation it answers, so further removal is no longer restabilisation and is not selected. The candidate threshold falling as robustness falls is a movement the paper itself states; it does not show that this comparison fails to saturate. Nor does a drop in the candidate bar by itself qualify the next node: both lines must still be passed, and below the fixed floor permanent separation remains more efficient than removal whatever the organism’s state. Step 6’s population premise is open, as the AI says, but it is not the first failure.
The review’s mark
Our review desk’s reading.
- Kind: a road
- Mark: breaks at a step
- Step: 10
- Place: none
- Why: The road's population is everyone in its model. Premises B, C and D are named, and C (Level 4 failing for each) carries the floor. For a part of the whole they would make the open road. But step 10 runs the sequence to the whole population. Removal is selected only where it restabilises, and the last removals leave no whole to restabilise. Step 11 then says the brake fails "on the paper's own candidate form", because the threshold formula holds no term for it. The paper puts the brake in the cost of each removal set against the deeds it answers, not in that formula. So the road shows that the brake is not written into the formula. It does not show that it fails.
- Marks A, B and C: B and C (step 10). A places it at step 5.
Marks A, B and C, as our review desk read them: A, the fresh session’s mark; B, our writing desk’s own mark; C, the outside mark.