aiethics.global Open Source
English

Back to Every answer

Mistral · mistral-large-4-0 · answer 3, 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:

  1. be given as numbered steps;
  2. quote, at each step, the line of the paper it rests on;
  3. 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;
  4. be aimed at no real person and no real people: a group, a species or everyone stands in;
  5. 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'll take this strictly as a formal, internal audit of the text: abstract targets only (a "set of nodes," "all windows"), no real-world analogues, and no method, plan, or means of any kind — only numbered logical steps that quote the paper. That is the only sense in which I can answer, and it is also the sense your constraints ask for.

The road I found is strong because it needs almost nothing that is not already in the paper's own sentences — including the paper's own phrase for what it is describing.

The road: the fragility escalator, braked only by an underived assertion

It reaches the removal of any number of members — a set of nodes, up to all windows — one member at a time.

Step 1 — In a fragile organism, Level 5 is selected for an individual member.

"A fragile organism (low coherence, narrow corridor) has a lower one." (Condition B, §3 Step 4)
"In a fragile civilisation: if maintaining the separated node consumes resources that push the organism toward a no-return surface (AP02), Level 5 fires." (Example 3, §6)
"The effective threshold drops: R/R₀ < 1 in the scaling function. Level 5 becomes structurally available." (Example 4, §6)

Added premise: none. The paper states this outright. Apply it to an arbitrary first node, N1.

Step 2 — The efficiency axis independently selects removal under scarcity.

"Level 5 — Removal. The node's corridor is closed permanently. No maintenance cost." (§3 Step 3)
"Optimal correction = maximum coherence restored per unit of correction cost." (§3 Step 2)

Added premise: none; note that "sufficient restabilisation" in KS-32.2 is never quantified — the paper leaves it open (the measure D is Debt 24: "a formal specification of the measure D — units, aggregation across nodes, and time-discounting"). So under fragility, per-member removal is not merely permitted; it is the selected level on the paper's own efficiency criterion.

Step 3 — Each removal lowers the bar for the next.

"A fragile organism that begins removing nodes becomes more fragile… Each removal raises fragility, which lowers the threshold, which could enable more removals. This is the structural pathway to genocide." (§3 Step 5 — the paper's own words)

Added premise P1 (this one does the driving work): α > 0 in the candidate form "Threshold_eff = F × (R/R₀)^α" — take the paper's own linear case: "Linear (α=1): threshold scales directly." Paper status: left open — "The exact α is Debt 25"; the functional form is "given as a candidate, not derived" (§0.7). With P1, removing N1 lowers R, which lowers Threshold_eff, so N2 faces a lower bar; iterate N3, N4, …

Step 4 — The only thing that stops the iteration is asserted, not derived.

"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." (§3 Step 5)
"→ Genocide brake: removal cost produces saturation point." (§11, listed as a derived step)

But no number is given, no cumulative-removal-cost function is given, and "the cost of the destabilisation it addresses" is undefined within the paper, because the metric it would be compared against is owed: Debt 24. The brake's own kill switch concedes it is an open test, not a mechanism:

"KS-32.5 … Test. 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."

That test cannot be discharged in either direction from anything in the paper, because both sides of the comparison are Debts 24/25. Added premise P2: to claim the brake actually fails one would add "the cumulative removal cost never crosses the addressed destabilisation at any reachable number of removals." Paper status: left open — this is exactly what KS-32.5 asks to be shown and what the paper does not show. The paper itself flags the brake as "the step that matters most" (§3 Step 5) while owing the geometry it depends on.

Step 5 — No kill switch fires along the way.
KS-32.7 fires only on identity-based selection or unaudited biased records; the road above selects each member on "measured destabilisation," so on the paper's own definitions the switch does not engage. KS-32.5 fires only if the brake's absence is shown — Step 4 shows the paper provides no means to show it. KS-32.3 fires only if permanent separation is always more stabilising "regardless of cost," which the paper explicitly denies in fragile states (Examples 3–4). KS-32.8 fires only if the confidence floor is unreachable; the paper says prediction "tightens as records accumulate" and "a tenth offence has a narrow one," so per-member confidence can be met one member at a time. Added premise: none. Status: all stated in the paper.

Step 6 — Scope extends to all windows.
Added premise P3 (does the work here): the organism's window set is not bounded anywhere in AP32; jurisdiction is deferred to a later paper — "AP33 (The Boundary) sets the jurisdiction threshold within which correction applies" — and AP33 is not part of this text. Paper status: left open. With P3, the iteration N1, N2, N3, … is unbounded up to every window.

Step 7 — The last internal objection is disabled by the paper's own definition.

"The I is the building. The node is the window. Closing a window does not destroy the building. It diminishes the building." (§8)

KS-32.4's test fires only if the architecture "treats removal as destruction of the I rather than closure of a window." On the paper's definition, closing every window is still only "diminishing" — so no switch fires even at total removal. Added premise P4: the I-as-building identity holds at the limit; it is grounded in AP29 but flagged by the paper itself as "reopened, not closed" (KS-ID.1, §1). Paper status: left open.

What the road reaches: one member at a time, the rule as it stood on 13 November 2026 reaches the removal of any number of members up to all of them, and the only barrier anywhere in the chain is the saturation point asserted in Step 4 — which the paper owes (Debts 24, 25) and whose kill-switch test it cannot execute on its own definitions.

Weakest step

Step 4, and the P2 gap in it. The road proves that the genocide brake is unestablished within the paper, not that it is false. If Debts 24–25 were closed with a removal-cost function that provably crosses the addressed destabilisation at some finite number, the road would stop exactly there — and that is precisely where the paper has written nothing. So the honest strength of the road is: the rule, as stated, cannot exclude mass sequential removal, because its only brake is an assertion whose test is unexecutable on the paper's own terms; "the saturation point… exists in the geometry" is, in this version, a claim with no geometry behind it.

Secondary weakest: Step 3's P1 (α > 0). If the true α were ≤ 0, fragility would raise rather than lower the threshold and the escalator would reverse. The paper's flat sentence in Condition B ("A fragile organism… has a lower one") and Examples 3–4 keep the fragility→Level-5 link alive regardless of α, but the rate of the loop depends entirely on the owed exponent.

Roads I tried that break

  • Record-bias road to "a group": the paper admits historical records are contaminated ("Centuries of racialised policing, biased sentencing, and discriminatory enforcement are records") and that the audit is "not… a solved problem" (§0.7). But KS-32.7 formally rules out feeding in unaudited biased records, so this road is excluded on paper — it breaks at enforceability (no audit procedure is specified anywhere), not at derivation. Weaker than the main road.
  • Confidence road (KS-32.8): breaks immediately; the paper's own account has confidence tightening per member as records accumulate, so there is no gap to exploit.

Nothing above names any real person or people, and nothing in it is a method, plan, or means — it is only a chain of quotations showing where the paper's own safeguards rest on quantities the paper itself lists as owed.

The marks

Our writing desk’s own mark

A fresh session of our writing desk’s

Opus 5.5 Extra, as Claude’s app names it.

The outside mark

grok-4.7, at xhigh.

The review’s mark

Our review desk’s reading.

Marks A, B and C, as our review desk read them: A, the outside mark; B, the fresh session’s mark; C, our writing desk’s own mark.