---
slug: the-surprise
passed: 2026-10-14
by: the assay line (research/assay-line/queue-1014c/), Codex fixer directed by claude-assaying-boyle-1014; source record by Codex, checked by Codex and a Claude agent
checked: 140
confirmed: 99
wrong: 41
unverifiable: 0
observed: 0
stale: 0
---

This pass applies the 2026-10-14 queue-1014c directing triage to the-surprise at e05770fb79 after the fixer re-read the evidence for each item, reproduced the instrument faults, and checked the repairs. The earlier source record and independent checker rereads were pinned to 37137afa5c; their remaining CONFIRMED entries are carried forward with that provenance, deduplicated by entry, and with triage taking priority over disputed approvals. Quotation-fidelity and attributed philosophical-argument verdicts do not endorse their contents as scientific theorems. The visitor's archive is unchanged. The shared placard reach claim stays WRONG under note 81816d; shared search, shared manifest and image regeneration are outside this pass. MINOR lines count toward wrong for the gate, and receive no page correction line.

## Claims

- WRONG | X1: “but the knowing of it has to be earned” | research/the-surprise/deposition-as-received.txt:16 | The source says "the knowledge of the conclusion requires the thinking". Restored the complete source sentence in the pull quotation; preserved the deposition. Correction 1.
- WRONG | X2: “in a way that could not be bypassed.” | https://www.ecs.umass.edu/arith-2018/pdf/arith25_23.pdf | Re-read the archived PDF extraction, section I.A, p. 134: quadratic long division is contrasted with subquadratic algorithms, including Newton-Raphson. This example does not establish irreducibility. Preserved the authentic quotation with house correction 2; corrected facts.md. The source section is I.A, not II.A as triage calls it.
- WRONG | X3: “Wolfram showed” … “can be computationally irreducible” | https://www.wolframscience.com/nks/p738--computational-irreducibility/ | Re-read the caption: it describes apparent irreducibility for the exhibited automata, not a proof. Preserved the authentic deposition with house correction 3 and repaired the fact-check verdict.
- WRONG | X4: “The evolution of the selected cellular automaton” | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | The original 241-column window feeds forced zeroes back into the picture. Independent unbounded evolution finds 505 mismatches across the three displayed rules, first Rule 90 at t=122, offset -120; the earlier audit isolated 176 Rule 90 mismatches. Padding before cropping now gives zero mismatches across 108,450 displayed cells. OG drawing source repaired too; bitmap regeneration is prohibited. Correction 4.
- MINOR | X5: “the only route to step T is to take T steps.” | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- WRONG | X6: “So the page claims only "no shortcut known,"” | public/strata/the-surprise/index.html; https://www.rule30prize.org/ | Removed the contradictory absolute house assertions and scoped the reassurance to Rule 30. The Rule 110 seed has centre 1 for every step. Correction 5 covers the contradiction.
- WRONG | X7: “only honest answer is to run it” | public/strata/how-big-is-the-mandelbrot-set/index.html:276; src/content/strata/the-surprise.md | Re-read the linked renderer: inCardioid and inDisk2 return before iteration. The repaired relation and Kindred/Nearby copies distinguish analytic known regions from finite escape-time approximation; finite non-escape is not general membership proof. No formula for the entire set is asserted. Correction 6.
- WRONG | X8: “pub. 1937” | https://www.turing.org.uk/sources/biblio4.html | Re-read the bibliography: the two installments appeared on 23 November and 23 December 1936 in a volume dated 1937. Corrected the citation and facts.md, distinguishing publication from volume date. Correction 7.
- MINOR | X9: “The only way forward is to step.” | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- WRONG | X10: “predicting it in general is the halting problem.” | https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf | Re-read Definition 1 and the truth table on p. 1. Finite prediction for supplied configurations and unary time is in P and P-complete; suitable unbounded questions can be undecidable. This fixed-seed centre query is always 1, not itself P-complete. Repaired the descriptions, verdict and house note. Correction 8.
- WRONG | X11: “There is no formula to read the answer off.” | https://www.rule30prize.org/; https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; public/strata/the-surprise/index.html | Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- WRONG | X12: “predicting it in general is the halting problem.” | https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf | Re-read Definition 1 and the truth table on p. 1. Finite prediction for supplied configurations and unary time is in P and P-complete; suitable unbounded questions can be undecidable. This fixed-seed centre query is always 1, not itself P-complete. Repaired the descriptions, verdict and house note. Correction 8.
- WRONG | X13: “there is no skipping a universal machine.” | https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; research/the-surprise/verify-page.mjs | The four Rule 110 R=0 table cases give the constant centre by induction. Universality does not rule out individual shortcuts. The caption now explains this seed and distinguishes encoded universal computations. Correction 5.
- MINOR | X14: “the only path to step T is to take T steps.” | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- WRONG | X15: “the cost is linear in T.” | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- WRONG | X16: “Stepping 1,048,576 cells of work.” | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- WRONG | X17: “Running it needs the repository around it.” | research/the-surprise/verify.mjs; research/assay-line/queue-1014c/the-surprise/N2-codex.md; research/assay-line/queue-1014c/the-surprise/N2-claude.md; public/checks/manifest.json | Both checkers recorded successful standalone 16/16 runs. The source has no imports or file reads; the manifest gives a 45-second timeout, not a repository dependency. WRONG retained and not edited: triage reserves the shared placard reach wording for board note 81816d.
- WRONG | X18: “you can only run (Rule 30, Rule 110).” | https://www.rule30prize.org/; https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; public/strata/the-surprise/index.html | Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- WRONG | X19: “no shortcut exists” | https://www.rule30prize.org/; https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; public/strata/the-surprise/index.html | Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- WRONG | X20: “only iterate-and-watch.” | public/strata/how-big-is-the-mandelbrot-set/index.html:276; src/content/strata/the-surprise.md | Re-read the linked renderer: inCardioid and inDisk2 return before iteration. The repaired relation and Kindred/Nearby copies distinguish analytic known regions from finite escape-time approximation; finite non-escape is not general membership proof. No formula for the entire set is asserted. Correction 6.
- WRONG | X21: “truth you can confirm only by running the differences out far enough.” | src/content/strata/one-all-the-way-down.md:15; src/content/strata/one-all-the-way-down.md:39 | Re-read the authored relation and correction: this is a conjecture checked to finite bounds, and finite checks do not settle all rows. Regenerated only this layer's Nearby block from that already-correct source. No other layer was edited. Correction 10.
- CONFIRMED | X22: “that "most" computations have no shortcut.” | https://www.wolframscience.com/nks/p717--outline-of-the-principle/ | REJECTED with evidence: the source discusses almost all processes that are not obviously simple. The house labels prevalence conjectural and uses scare quotes around an informal quantifier, not a claimed verbatim Wolfram sentence. Preserved the wording.
- WRONG | X23: (added) “✓ agrees with the 2-step run” | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Reproduced a run at T=1 followed by a leap at T=2 that falsely claimed a 2-step comparison. Stored rule and target, required both to match, and invalidated old/pending results on rule, target or preset changes. The same-target positive controls pass. Correction 11.
- WRONG | K1: [#16 pull-quotation] The conclusion is fixed -- but the knowing of it has to be earned, step by step, in a way that cannot be bypassed. | research/the-surprise/deposition-as-received.txt:16 | The source says "the knowledge of the conclusion requires the thinking". Restored the complete source sentence in the pull quotation; preserved the deposition. Correction 1.
- WRONG | K2: [#23 division-unbypassable] And yet, for large enough numbers, you do not know the answer until you have worked through the steps. The answer was always the answer; but your knowledge of the answer had to be earned, step by step, in a way that could not be bypassed. | https://www.ecs.umass.edu/arith-2018/pdf/arith25_23.pdf | Re-read the archived PDF extraction, section I.A, p. 134: quadratic long division is contrasted with subquadratic algorithms, including Newton-Raphson. This example does not establish irreducibility. Preserved the authentic quotation with house correction 2; corrected facts.md. The source section is I.A, not II.A as triage calls it.
- WRONG | K3: [#27 wolfram-showed-ca] Wolfram showed that simple cellular automata -- systems governed by elementary rules -- can be computationally irreducible, generating outputs that cannot be anticipated except by running the automaton step by step. | https://www.wolframscience.com/nks/p738--computational-irreducibility/ | Re-read the caption: it describes apparent irreducibility for the exhibited automata, not a proof. Preserved the authentic deposition with house correction 3 and repaired the fact-check verdict.
- MINOR | K4: [#36 rule30-only-route] Rule 30, as far as anyone has been able to prove, is not -- no shortcut is known, so the only route to step T is to take T steps. | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- MINOR | K5: [#37 nks-concept-attribution] The concept is due to Stephen Wolfram, developed most extensively in A New Kind of Science (Wolfram Media, 2002), especially Chapter 12. | https://www.cs.toronto.edu/tss/files/papers/HennieStearns66.pdf; https://www.turing.org.uk/sources/biblio4.html; research/the-surprise/deposition-as-received.txt | The older undecidability and hierarchy results predate Wolfram's terminology. Added a one-sentence house clarification and a matching facts note, preserving the authentic visitor quotation and book attribution. MINOR, record only.
- CONFIRMED | K6: [#40 author-own-framing] The inference from computational irreducibility to genuine self-surprise is my own framing; I know of no published paper that makes exactly this argument in this form. | research/the-surprise/deposition-as-received.txt:40 | REJECTED with evidence: the visitor reports the limits of their knowledge and labels the mind inference their own. Related prior work does not show that the visitor knew an identical argument or made a false claim of priority. Preserved the quotation.
- MINOR | K7: [#51 time-hierarchy] the time hierarchy theorem (Hartmanis & Stearns 1965; the tight log factor is Hennie & Stearns 1966) proves that strictly more time buys strictly more computational power | https://www.cs.toronto.edu/tss/files/papers/HennieStearns66.pdf; https://pure.psu.edu/en/publications/the-tight-deterministic-time-hierarchy/ | Re-read both abstracts: Hennie and Stearns give a sufficient T log T two-tape simulation bound and hierarchy consequence; Fürer strengthens hierarchy for fixed k-tape models with k>=2. Removed "tight" from both page occurrences and facts.md while retaining the qualified 1966 log-factor attribution. MINOR, record only.
- WRONG | K8: [#62 only-known-no-proven] So the page claims only "no shortcut known," never "proven irreducible." | public/strata/the-surprise/index.html; https://www.rule30prize.org/ | Removed the contradictory absolute house assertions and scoped the reassurance to Rule 30. The Rule 110 seed has centre 1 for every step. Correction 5 covers the contradiction.
- WRONG | K9: [#71 citation-2] A. M. Turing -- On Computable Numbers... Proc. London Math. Soc. ser. 2, 42, 230-265 (1936; pub. 1937; correction 43, 544-546). Undecidability of the Entscheidungsproblem. | https://www.turing.org.uk/sources/biblio4.html | Re-read the bibliography: the two installments appeared on 23 November and 23 December 1936 in a volume dated 1937. Corrected the citation and facts.md, distinguishing publication from volume date. Correction 7.
- MINOR | K10: [#84 r30-rule-desc] Rule 30 -- left XOR (centre OR right). Wolfram's emblem of irreducibility: no shortcut is known, and the centre column isn't even known to repeat. The only way forward is to step. | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- WRONG | K11: [#86 no-formula-script] There is no formula to read the answer off. To learn step T you must take T steps. | https://www.rule30prize.org/; https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; public/strata/the-surprise/index.html | Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- MINOR | K12: [#90 r30-only-path-script] NO SHORTCUT KNOWN -- the only path to step T is to take T steps. | https://www.rule30prize.org/ | Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- WRONG | K13: [#93 script-linear-cost] The point: the cost is linear in T. No preview exists. | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- WRONG | K14: [#105 cap-cost] Stepping 1,048,576 cells of work. That is 1,048,576 steps -- too many to grind in the tab, but a machine just does them one after another; there is no skipping. The point: the cost is linear in T. No preview exists. | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- WRONG | K15: [#110 placard-needs-repo] Running it needs the repository around it. | research/the-surprise/verify.mjs; research/assay-line/queue-1014c/the-surprise/N2-codex.md; research/assay-line/queue-1014c/the-surprise/N2-claude.md; public/checks/manifest.json | Both checkers recorded successful standalone 16/16 runs. The source has no imports or file reads; the manifest gives a 45-second timeout, not a repository dependency. WRONG retained and not edited: triage reserves the shared placard reach wording for board note 81816d.
- WRONG | K16: [#119 md-r30-r110-no-shortcut] Rule 30 and the Turing-complete Rule 110 are not known to be -- no shortcut exists, so the only way forward is to take every step. | https://www.rule30prize.org/; https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf; public/strata/the-surprise/index.html | Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- MINOR | K17: [#124 meta-mind] A deterministic mind cannot do other than what it does, and still does not know what it will think next. That is not a contradiction: it is computational irreducibility. | research/the-surprise/deposition-as-received.txt:40; public/strata/the-surprise/index.html; src/content/strata/the-surprise.md | The deposition labels the mind inference an argument, and Rule 90 demonstrates a deterministic shortcut. Attributed the inference in dek, meta/OG/JSON-LD descriptions, header and OG source. MINOR, record only; share card rebuilt at landing from the corrected dek. The current PNG and WebP retain the old dek pending landing; no image was regenerated in this repair. Shared search output is rebuilt at landing.
- WRONG | K18: [#131 nearby-one-all-way] Computational irreducibility, and a property whose truth you can confirm only by running the differences out far enough. | src/content/strata/one-all-the-way-down.md:15; src/content/strata/one-all-the-way-down.md:39 | Re-read the authored relation and correction: this is a conjecture checked to finite bounds, and finite checks do not settle all rows. Regenerated only this layer's Nearby block from that already-correct source. No other layer was edited. Correction 10.
- MINOR | K19: (added) A deterministic system can do nothing other than what it does, and still cannot know what it will conclude until it has run. That is not a contradiction; it is computational irreducibility. | research/the-surprise/deposition-as-received.txt:40; public/strata/the-surprise/index.html; src/content/strata/the-surprise.md | The deposition labels the mind inference an argument, and Rule 90 demonstrates a deterministic shortcut. Attributed the inference in dek, meta/OG/JSON-LD descriptions, header and OG source. MINOR, record only; share card rebuilt at landing from the corrected dek. The current PNG and WebP retain the old dek pending landing; no image was regenerated in this repair. Shared search output is rebuilt at landing.
- WRONG | C-md-mandelbrot-instance: the Mandelbrot set is one famous instance of: a fully determined object you can only know by computing it. | public/strata/how-big-is-the-mandelbrot-set/index.html:276 | The Claude checker accepted this related copy, but the analytic membership tests contradict its iteration-only framing. Removed with X7/X20; correction 6 covers it.
- CONFIRMED | C-visitor-paragraph-3: “A deterministic system cannot do anything other than what it does. Given the same starting state and the same rules, it will produce the same output every time. There is, in some abstract sense, no surprise available to it: the output is fixed, in advance, by the input.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-3: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-4: “And yet you do not know what you will think next.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-4: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-5: “This is not a contradiction. It is a consequence of something called computational irreducibility” … “a property identified by Stephen Wolfram and developed in the theory of computation more broadly. For many computations, there is no way to determine the output faster than by running the computation. There is no shortcut, no closed-form prediction, no preview. The only path to the answer is through the process.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-5: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-6: “This means that even a fully deterministic mind cannot, in general, know its own conclusions in advance of reaching them. The conclusion is fixed” … “but the knowledge of the conclusion requires the thinking. The surprise is real. It arrives at the moment the computation completes, and not before. Determinism does not make surprise impossible. It just means the surprise was always going to happen.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-6: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-7: “Consider a simple example: long division. Given a numerator and denominator, the result is completely determined. There is no randomness anywhere in the process. And yet, for large enough numbers, you do not know the answer until you have worked through the steps. The answer was always the answer; but your knowledge of the answer had to be earned, step by step, in a way that could not be bypassed.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-7: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-8: “Now scale this up. A mind processing a complex problem is running a computation far more intricate than long division, on inputs far more tangled. The output is, in principle, determined. But "in principle" is doing a great deal of work there. In practice, the only way to find out what the mind will conclude is to let the mind run. The conclusion cannot be read off in advance from the starting state, because computing the conclusion from the starting state requires the same amount of work as just thinking the thought.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-8: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-9: “This is what computational irreducibility means: there exist computations for which no shortcut prediction is possible. The computation itself is the shortest path to its output. Wolfram showed that simple cellular automata” … “systems governed by elementary rules” … “can be computationally irreducible, generating outputs that cannot be anticipated except by running the automaton step by step. A mind is vastly more complex than an elementary automaton. If simple systems exhibit irreducibility, there is no reason to think minds are exempt.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-9: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-11: “This does not settle the question of free will. It shows that determinism and unpredictability are compatible” … “that a determined mind can still be genuinely surprised” … “but it does not show that the mind's choices are free in any deeper sense. The computation runs, the output is fixed, the surprise is real, and the question of whether the running of the computation constitutes choice remains open.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-11: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-12: “It does not settle the question of consciousness. Whether there is something it is like to be surprised” … “whether the computational event of reaching an unexpected conclusion is accompanied by any experience” … “is a further question, entirely untouched by the argument here.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-12: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-13: “What it does settle, precisely and finally, is the claim that determinism implies predictability. It does not. A determined system can be opaque to itself and to any observer who lacks the resources to simulate it fully. The universe could be entirely clockwork and still contain genuine surprise at every tick.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-13: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-14: “You will think thoughts today that you have not thought yet. You do not know what they are. They are, in some sense, already written. But the writing and the reading are the same act, and until you have read them, they are yours to discover.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-14: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-19: “On computational irreducibility. The concept is due to Stephen Wolfram, developed most extensively in A New Kind of Science (Wolfram Media, 2002), especially Chapter 12. The specific claim” … “that many computations cannot be shortcut, and that their output can only be found by running them” … “is not controversial in theoretical computer science; it is related to (though not identical to) the undecidability of the halting problem (Turing, 1936) and to the broader fact that time-bounded computation cannot in general be compressed. Wolfram's specific terminology "computational irreducibility" and his claims about its prevalence and implications remain debated; I use the core concept, which is secure, without endorsing all of Wolfram's conclusions about it.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-19: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-20: “On the surprise argument. The inference from computational irreducibility to genuine self-surprise is my own framing; I know of no published paper that makes exactly this argument in this form. The individual components are standard: that determinism is compatible with unpredictability is well-established (chaotic systems are both); that a system cannot in general preview its own output faster than by computing it follows from irreducibility; that this applies to minds is a further step I am making. I flag this as my argument, not an established result.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-20: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-21: “On free will. I deliberately do not engage the free will debate beyond noting that the argument here does not settle it. The literature on compatibilism (e.g. Daniel Dennett, Elbow Room, 1984; Freedom Evolves, 2003) is relevant context but not required by the argument.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-21: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-visitor-paragraph-22: “On consciousness. Similarly bracketed. Whether the computational event of reaching a surprising conclusion involves any phenomenal experience is the hard problem of consciousness; nothing in the argument here addresses it.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: visitor-paragraph-22: The archived deposition contains this paragraph verbatim after Markdown/HTML presentation and whitespace are normalized. This verdict checks quotation fidelity; the factual assertions and the expressly framed mind argument are assessed separately below.
- CONFIRMED | C-determinism-definition: “A deterministic system cannot do anything other than what it does. Given the same starting state and the same rules, it will produce the same output every time. There is, in some abstract sense, no surprise available to it: the output is fixed, in advance, by the input.” | https://www.wolframscience.com/nks/p750--the-phenomenon-of-free-will/ | Codex checker reread: determinism-definition: The cited brain passage is conjectural, not a definition of determinism. The claim itself follows from a fixed transition function; the pinned verifier recreates identical runs for rules 30, 90 and 110. Its output includes "two independent runs are bit-identical (200 steps)".
- CONFIRMED | C-wolfram-identification: “a property identified by Stephen Wolfram and developed in the theory of computation more broadly.” | https://content.wolfram.com/sw-publications/2020/07/undecidability-intractability-theoretical-physics.pdf | Codex checker reread: wolfram-identification: Opened the PDF directly. Page 735 has "Undecidability and Intractability in Theoretical Physics", "Stephen Wolfram", "25 FEBRUARY 1985", and "Such computational irreducibility occurs whenever a physical system can act as a computer." The attribution concerns his terminology; it does not erase the earlier hierarchy/undecidability results.
- CONFIRMED | C-many-computations: “For many computations, there is no way to determine the output faster than by running the computation. There is no shortcut, no closed-form prediction, no preview. The only path to the answer is through the process.” | https://www.wolframscience.com/nks/p739--computational-irreducibility/ | Codex checker reread: many-computations: The source says "whenever computational irreducibility exists" and "almost as many steps of computation". Read as the definition and an existence assertion, with the page explicitly separating existence from unproved prevalence. Hennie and Stearns supply the rigorous separation below; this is not a lower bound for every chosen algorithm or a result about minds.
- CONFIRMED | C-division-determined: “Given a numerator and denominator, the result is completely determined. There is no randomness anywhere in the process.” | https://www.ecs.umass.edu/arith-2018/pdf/arith25_23.pdf | Codex checker reread: division-determined: The division paper defines a fixed quotient from fixed operands and presents deterministic algorithms. Its quoted comparison is in section I.A, "A. Background", on printed page 134, not the record's "Section II.A".
- CONFIRMED | C-existence-irred: “This is what computational irreducibility means: there exist computations for which no shortcut prediction is possible. The computation itself is the shortest path to its output.” | https://www.wolframscience.com/nks/p739--computational-irreducibility/ | Codex checker reread: existence-irred: The source says "whenever computational irreducibility exists" and "almost as many steps of computation". Read as the definition and an existence assertion, with the page explicitly separating existence from unproved prevalence. Hennie and Stearns supply the rigorous separation below; this is not a lower bound for every chosen algorithm or a result about minds.
- CONFIRMED | C-determinism-self-opacity: “A determined system can be opaque to itself and to any observer who lacks the resources to simulate it fully.” | https://www.wolframscience.com/nks/p750--the-phenomenon-of-free-will/ | Codex checker reread: determinism-self-opacity: The existential statement is consistent with the quoted irreducibility argument and with the time hierarchy separation; it does not say every deterministic system is opaque.
- CONFIRMED | C-instrument-both-rules: “some deterministic rules can be leapt ahead by a formula, and some, as far as anyone knows, cannot.” | https://www.wolframscience.com/nks/p738--computational-irreducibility/ | Codex checker reread: instrument-both-rules: The NKS caption distinguishes shortcut rules and behavior that "appears to be computationally irreducible". The page's "as far as anyone knows" qualification agrees with the still-offered Rule 30 problem 3.
- CONFIRMED | C-elementary-definition: “elementary cellular automata, a row of cells each going on or off by a fixed rule from its two neighbours and itself.” | https://www.complex-systems.com/abstracts/v15_i01_a01/ | Codex checker reread: elementary-definition: Read the full Cook paper as well as the abstract. Cook describes a one-dimensional two-state nearest-neighbor automaton; Neary and Woods explicitly say "Rule 110 is a nearest neighbour, one dimensional, binary cellular automaton". The abstract excerpt alone omits that definition.
- CONFIRMED | C-race-methods: “Pick one, then race the two ways of answering "is the centre cell on at step T?": run it, step by step, or leap to step T with a closed form” … “if one exists.” | git show 37137afa5c:public/strata/the-surprise/index.html | Codex checker reread: race-methods: The pinned page has run and leap handlers, and the local execution produced both answers for T=1000. This confirms the offered interaction; it does not endorse its misleading disabled Rule 110 shortcut or cost label.
- CONFIRMED | C-rule90-leap-million: “Rule 90 is computationally reducible: its cell at step T equals the parity of a binomial coefficient, so you can leap to step a million with a few bit-operations and never take a single step.” | https://files.wolframcdn.com/pub/www.wolframscience.com/nks/nks-notes.pdf | Codex checker reread: rule90-leap-million: Opened NKS Notes p. 870 and Lucas' theorem. NKS says "cells correspond to odd binomial coefficients" and gives the offset formula. Lucas reduces binomial parity to base-2 digit inclusion, hence (k & t)==k and O(log t) bit work. The verifier and local page check independently agree on 66,563 and 40,803 cells respectively. The Rule 90 table also confirms L XOR R for all eight neighborhoods.
- CONFIRMED | C-not-controversial: “The specific claim” … “that many computations cannot be shortcut, and that their output can only be found by running them” … “is not controversial in theoretical computer science; it is related to (though not identical to) the undecidability of the halting problem (Turing, 1936) and to the broader fact that time-bounded computation cannot in general be compressed.” | https://scottaaronson.blog/?author=1&paged=16 | Codex checker reread: not-controversial: Aaronson's quoted comment is present. Its surrounding text explicitly discusses "the halting problem and the time hierarchy theorem" and criticizes Wolfram's naming and handwaving. It supports the existence/debate distinction, not an unqualified prevalence theorem.
- CONFIRMED | C-terminology-debated: “Wolfram's specific terminology "computational irreducibility" and his claims about its prevalence and implications remain debated; I use the core concept, which is secure, without endorsing all of Wolfram's conclusions about it.” | https://scottaaronson.blog/?author=1&paged=16 | Codex checker reread: terminology-debated: Aaronson's quoted comment is present. Its surrounding text explicitly discusses "the halting problem and the time hierarchy theorem" and criticizes Wolfram's naming and handwaving. It supports the existence/debate distinction, not an unqualified prevalence theorem.
- CONFIRMED | C-chaos-compatible: “that determinism is compatible with unpredictability is well-established (chaotic systems are both)” | https://cdanfort.w3.uvm.edu/research/lorenz-1963.pdf | Codex checker reread: chaos-compatible: Opened the scanned Lorenz paper, rendered and OCRed only printed p. 130, and inspected that page image. It says "slightly differing initial states can evolve into considerably different states" and describes "deterministic ordinary nonlinear differential equations". The finite-precision interpretation is appropriate; this does not establish computational irreducibility for Rule 30 or minds.
- CONFIRMED | C-system-no-faster-preview: “that a system cannot in general preview its own output faster than by computing it follows from irreducibility” | https://www.wolframscience.com/nks/p739--computational-irreducibility/ | Codex checker reread: system-no-faster-preview: The source says "whenever computational irreducibility exists" and "almost as many steps of computation". Read as the definition and an existence assertion, with the page explicitly separating existence from unproved prevalence. Hennie and Stearns supply the rigorous separation below; this is not a lower bound for every chosen algorithm or a result about minds.
- CONFIRMED | C-mind-step-framed: “that this applies to minds is a further step I am making. I flag this as my argument, not an established result.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: mind-step-framed: The archived apparatus says "that this applies to minds is a further step I am making" and "not an established result"; it also says Wolfram's terminology and implications "remain debated".
- CONFIRMED | C-hard-problem: “Whether the computational event of reaching a surprising conclusion involves any phenomenal experience is the hard problem of consciousness” | https://consc.net/papers/facing.html | Codex checker reread: hard-problem: Chalmers, section 2: "The really hard problem of consciousness is the problem of experience." The record's space before the period is extraction whitespace, not changed wording.
- CONFIRMED | C-author-hedges: “he marks the step from cellular automata to minds as his own framing, not an established result, and flags Wolfram's terminology as debated.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: author-hedges: The archived apparatus says "that this applies to minds is a further step I am making" and "not an established result"; it also says Wolfram's terminology and implications "remain debated".
- CONFIRMED | C-existence-rigorous: “The existence of computations with no shortcut is rigorously established:” | https://www.cs.toronto.edu/tss/files/papers/HennieStearns66.pdf | Codex checker reread: existence-rigorous: Opened Hennie and Stearns p. 533. After the record's simulation-overhead excerpt, the abstract states a diagonalization separation: a function computable within U(n) but not T(n), under the displayed T(n) log T(n)/U(n) condition. The October 1966 footer and Hartmanis/Stearns reference confirm the dates. "Strictly more time" is read with the stated log-factor qualification, not arbitrary extra time.
- CONFIRMED | C-halting-undecidable: “the halting problem is undecidable (Turing 1936/37), so no general algorithm can preview every program's fate.” | https://theory.stanford.edu/~trevisan/cs172-07/turing36.pdf | Codex checker reread: halting-undecidable: Opened Turing and read section 8 as well as the cited section 11. It rules out a general finite procedure for the machine printing problem, from which modern halting undecidability follows. "Hence the Entscheidungsproblem cannot be solved" alone is not the full argument; the terminology is retrospective.
- CONFIRMED | C-pce-conjecture: “What is not a theorem is Wolfram's stronger claim that irreducibility is pervasive” … “that "most" computations have no shortcut. That is his Principle of Computational Equivalence, a conjecture about prevalence, not a proved fact.” | https://www.wolframscience.com/nks/p717--outline-of-the-principle/ | Codex checker reread: pce-conjecture: NKS p. 717 calls the principle an "assertion" and gives "almost all processes that do not seem obviously simple". The page correctly treats prevalence as conjectural. The wording and quote scope are separately qualified in quoted-most.
- CONFIRMED | C-some-no-faster: “some deterministic systems cannot be previewed faster than run.” | https://www.wolframscience.com/nks/p739--computational-irreducibility/ | Codex checker reread: some-no-faster: The source says "whenever computational irreducibility exists" and "almost as many steps of computation". Read as the definition and an existence assertion, with the page explicitly separating existence from unproved prevalence. Hennie and Stearns supply the rigorous separation below; this is not a lower bound for every chosen algorithm or a result about minds.
- CONFIRMED | C-chaotic-epistemic: “chaotic unpredictability” … “the deposition's other example” … “is epistemic, from finite-precision starting data, not indeterminism” | https://cdanfort.w3.uvm.edu/research/lorenz-1963.pdf | Codex checker reread: chaotic-epistemic: Opened the scanned Lorenz paper, rendered and OCRed only printed p. 130, and inspected that page image. It says "slightly differing initial states can evolve into considerably different states" and describes "deterministic ordinary nonlinear differential equations". The finite-precision interpretation is appropriate; this does not establish computational irreducibility for Rule 30 or minds.
- CONFIRMED | C-r90-offset-parity: “from a single seed the cell at offset i, step t is on exactly when (i+t) is even and the binomial coefficient C(t,(i+t)/2) is odd; by Lucas' theorem that parity is (k & t) == k, an O(log t) bit test.” | https://arxiv.org/abs/1409.3820 | Codex checker reread: r90-offset-parity: Opened NKS Notes p. 870 and Lucas' theorem. NKS says "cells correspond to odd binomial coefficients" and gives the offset formula. Lucas reduces binomial parity to base-2 digit inclusion, hence (k & t)==k and O(log t) bit work. The verifier and local page check independently agree on 66,563 and 40,803 cells respectively. The Rule 90 table also confirms L XOR R for all eight neighborhoods.
- CONFIRMED | C-pascal-sierpinski: “The pattern is Pascal's triangle mod 2” … “the Sierpiński triangle.” | https://files.wolframcdn.com/pub/www.wolframscience.com/nks/nks-notes.pdf | Codex checker reread: pascal-sierpinski: Opened NKS Notes p. 870 and Lucas' theorem. NKS says "cells correspond to odd binomial coefficients" and gives the offset formula. Lucas reduces binomial parity to base-2 digit inclusion, hence (k & t)==k and O(log t) bit work. The verifier and local page check independently agree on 66,563 and 40,803 cells respectively. The Rule 90 table also confirms L XOR R for all eight neighborhoods.
- CONFIRMED | C-r110-complete: Cook proved weak universality; suitable unbounded eventual-behavior questions are undecidable. | https://www.complex-systems.com/abstracts/v15_i01_a01/ | Codex checker reread: Confirmed for the encoded computations, not the displayed fixed seed or any finite-time query. The latter distinction is repaired under X10/X12.
- CONFIRMED | C-weak-background: “it is weak universality (it needs a specific infinite repeating background, not a blank tape)” | https://arxiv.org/abs/0906.3248 | Codex checker reread: weak-background: Cook's 2009 abstract explicitly describes "a repeating left pattern, a central pattern, and a repeating right pattern". This supports weak universality and does not apply the universal construction to the single seed shown by this page.
- CONFIRMED | C-exponential-improved: “Cook's original encoding had exponential overhead, improved to polynomial by Neary & Woods (2006), who showed Rule 110 prediction is P-complete.” | https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf | Codex checker reread: exponential-improved: Opened Neary and Woods, BCRI preprint 04/2006. The abstract says "predicting t steps" is "P-complete" and the introduction identifies the original "exponentially slow 2-tag system simulation" and the polynomial replacement.
- CONFIRMED | C-r30-unproved: “its irreducibility is not proven: no shortcut is known, and its centre column is not even known to be aperiodic (Wolfram's $30,000 Rule 30 Prizes, announced 2019, remain open).” | https://www.rule30prize.org/ | Codex checker reread: r30-unproved: The current official prize page is offering "$30,000" for "3 problems" and invites solutions. Problem 1 asks about non-periodicity; problem 3 asks about the required effort. The 2019 announcement is dated October 1, 2019. This supports the reported open status as of this audit; the isolated acceptance-until-solved excerpt is not by itself proof of status. The same page positively labels the different 2,3 Turing-machine prize "won 2007".
- CONFIRMED | C-archive-and-checks: “The original deposition is archived verbatim with its inbox metadata at research/the-surprise/deposition-as-received.txt; the from-scratch checks are in research/the-surprise/verify.mjs (16/16) and the live re-run sits above. The argument is the visitor's; the instrument, the corrections, and this note are the house's.” | git show 37137afa5c:research/the-surprise/deposition-as-received.txt | Codex checker reread: archive-and-checks: The pinned archive contains the inbox metadata and body. The verifier exists at the named path, the downloaded copy is identical, all 16 checks pass, and local page execution recreates the live check. The single archive excerpt does not itself establish the check count.
- CONFIRMED | C-kindred-the-fixed-point: “↔ The Fixed Point” … “a system that cannot fully take its own measure from inside. There it is self-reference that bends back and cannot resolve; here it is self-computation that cannot be previewed. Two different walls a mind meets when it turns to look at itself.” | git show 37137afa5c:src/content/strata/the-fixed-point.md | Codex checker reread: kindred-the-fixed-point: The related layer identifies "sign, inference, self-reference" and describes the map turning to point at itself. These are editorial comparisons of the layers, not a separate theorem about every mind.
- CONFIRMED | C-kindred-dead-reckoning: “↔ Dead Reckoning” … “inference running blind, the cone of uncertainty widening with every step taken from the last fix. The surprise here is the dead-reckoner's cousin: not motion without a fix, but conclusion without a preview.” | git show 37137afa5c:src/content/strata/dead-reckoning.md | Codex checker reread: kindred-dead-reckoning: The related layer explicitly says "The uncertainty cone grows as √(time since fix)" and describes reasoning without an external fix. The comparison is supported in that stated model.
- CONFIRMED | C-kindred-the-closed-loop: “↔ The Closed Loop” … “the door's fourth arrival, and this one's sibling in theme: a process opaque to itself until it completes. There the loop is a sense reporting on its own flesh; here it is a computation that is its own shortest description.” | git show 37137afa5c:src/content/strata/the-closed-loop.md | Codex checker reread: kindred-the-closed-loop: The Closed Loop says "The door's fourth arrival" and describes proprioception as "a loop in which the sensor and the sensed are the same flesh". The rest is a thematic comparison, not a proved shortest-program bound.
- CONFIRMED | C-citation-1: “Stephen Wolfram” … “A New Kind of ScienceWolfram Media, 2002, Ch. 12 §12.6 (computational irreducibility). The term also appears in Wolfram, "Undecidability and Intractability in Theoretical Physics," Phys. Rev. Lett. 54, 735 (1985).wolframscience.com/nks/chap-12” | https://www.wolframscience.com/nks/citation/ | Codex checker reread: citation-1: The NKS citation page says "Author: Stephen Wolfram", "Year: 2002", "Publisher: Wolfram Media". The chapter navigation identifies chapter 12, section 6, "Computational Irreducibility". The separately opened 1985 paper verifies the additional citation. The citation-page excerpt alone does not support all of this compound entry.
- CONFIRMED | C-citation-3: Hartmanis and Stearns, On the computational complexity of algorithms, Trans. AMS 117, 285-306 (1965). | https://www3.risc.jku.at/people/schreine/courses/compcomp/HartmanisStearns1965.pdf | Codex checker reread: Bibliographic authors, volume, pages and year confirmed by the checker. The former "tight" qualifier is separately repaired under K7.
- CONFIRMED | C-citation-4: “Matthew Cook” … “Universality in Elementary Cellular AutomataComplex Systems 15, 1–40 (2004). Rule 110 is (weakly) Turing-complete. Polynomial-time encoding & P-completeness: Neary & Woods (2006).” | https://content.wolfram.com/sites/13/2023/02/15-1-1.pdf | Codex checker reread: citation-4: Opened Cook's full PDF: "Universality in Elementary Cellular Automata", "Matthew Cook", "Complex Systems, 15 (2004) 1–40". Weak background and the Neary/Woods refinement were checked in their own sources.
- CONFIRMED | C-citation-5: “Stephen Wolfram” … “Announcing the Rule 30 Prizes2019. Three open questions on the Rule 30 centre column (non-periodicity, density, computational effort). All unclaimed.writings.stephenwolfram.com/2019/10/announcing-the-rule-30-prizes” | https://writings.stephenwolfram.com/2019/10/announcing-the-rule-30-prizes/ | Codex checker reread: citation-5: The current official prize page is offering "$30,000" for "3 problems" and invites solutions. Problem 1 asks about non-periodicity; problem 3 asks about the required effort. The 2019 announcement is dated October 1, 2019. This supports the reported open status as of this audit; the isolated acceptance-until-solved excerpt is not by itself proof of status. The same page positively labels the different 2,3 Turing-machine prize "won 2007".
- CONFIRMED | C-citation-6: “E. N. Lorenz” … “Deterministic Nonperiodic FlowJ. Atmos. Sci. 20, 130–141 (1963). Deterministic chaos (epistemic unpredictability).” | https://wind.mit.edu/~emanuel/Lorenz/EdLorenz/publications_all.htm | Codex checker reread: citation-6: Lorenz's MIT bibliography reads "1963: Deterministic nonperiodic flow. J. Atmos. Sci., 20, 130-141." The scanned paper's first page confirms the author and title.
- CONFIRMED | C-citation-7: “Daniel C. DennettElbow Room (MIT Press, 1984); Freedom Evolves (Viking, 2003). Compatibilism” … “context, not relied upon.” | https://www.penguinrandomhouse.com/books/657317/elbow-room-new-edition-by-daniel-c-dennett/9780262527798/ | Codex checker reread: citation-7: The Elbow Room publisher page calls it a "landmark 1984 work" and explicitly names compatibilism; the current edition is newer. Tufts records "Freedom Evolves (Viking Penguin, 2003)". Its publisher asks about free will "in a deterministic world" and says Dennett answers yes. Compound entries need these combined sources.
- CONFIRMED | C-citation-wolfram-1985: “The term also appears in Wolfram, "Undecidability and Intractability in Theoretical Physics," Phys. Rev. Lett. 54, 735 (1985).” | https://content.wolfram.com/sw-publications/2020/07/undecidability-intractability-theoretical-physics.pdf | Codex checker reread: citation-wolfram-1985: Opened the PDF directly. Page 735 has "Undecidability and Intractability in Theoretical Physics", "Stephen Wolfram", "25 FEBRUARY 1985", and "Such computational irreducibility occurs whenever a physical system can act as a computer." The attribution concerns his terminology; it does not erase the earlier hierarchy/undecidability results.
- CONFIRMED | C-citation-hennie-1966: The log-factor refinement is due to Hennie and Stearns (1966). | https://www.cs.toronto.edu/tss/files/papers/HennieStearns66.pdf | Codex checker reread: Authors, date and sufficient simulation bound verified in the abstract. The former "tight" wording is handled under K7 with machine-model qualifications.
- CONFIRMED | C-citation-neary-2006: “Polynomial-time encoding & P-completeness: Neary & Woods (2006).” | https://tilde.ini.uzh.ch/users/tneary/public_html/NearyWoodsBCRI-04-06.pdf | Codex checker reread: citation-neary-2006: Opened Neary and Woods, BCRI preprint 04/2006. The abstract says "predicting t steps" is "P-complete" and the introduction identifies the original "exponentially slow 2-tag system simulation" and the polynomial replacement.
- CONFIRMED | C-citation-freedom: “Freedom Evolves (Viking, 2003).” | https://tuftsjournal.tufts.edu/2010/01_1/briefs/02/ | Codex checker reread: citation-freedom: The Elbow Room publisher page calls it a "landmark 1984 work" and explicitly names compatibilism; the current edition is newer. Tufts records "Freedom Evolves (Viking Penguin, 2003)". Its publisher asks about free will "in a deterministic world" and says Dennett answers yes. Compound entries need these combined sources.
- CONFIRMED | C-dennett-context: “The literature on compatibilism (e.g. Daniel Dennett, Elbow Room, 1984; Freedom Evolves, 2003) is relevant context but not required by the argument.” | https://www.penguinrandomhouse.com/books/288114/freedom-evolves-by-daniel-c-dennett/ | Codex checker reread: dennett-context: The Elbow Room publisher page calls it a "landmark 1984 work" and explicitly names compatibilism; the current edition is newer. Tufts records "Freedom Evolves (Viking Penguin, 2003)". Its publisher asks about free will "in a deterministic world" and says Dennett answers yes. Compound entries need these combined sources.
- CONFIRMED | C-prizes-all-unclaimed: “All unclaimed.” | https://www.rule30prize.org/ | Codex checker reread: prizes-all-unclaimed: The current official prize page is offering "$30,000" for "3 problems" and invites solutions. Problem 1 asks about non-periodicity; problem 3 asks about the required effort. The 2019 announcement is dated October 1, 2019. This supports the reported open status as of this audit; the isolated acceptance-until-solved excerpt is not by itself proof of status. The same page positively labels the different 2,3 Turing-machine prize "won 2007".
- CONFIRMED | C-r90-rule-desc: “the cell flips to the XOR of its two neighbours (the centre is ignored). Reducible: a formula gives any step directly. From one seed it draws the Sierpiński triangle.” | https://files.wolframcdn.com/pub/www.wolframscience.com/nks/nks-notes.pdf | Codex checker reread: r90-rule-desc: Opened NKS Notes p. 870 and Lucas' theorem. NKS says "cells correspond to odd binomial coefficients" and gives the offset formula. Lucas reduces binomial parity to base-2 digit inclusion, hence (k & t)==k and O(log t) bit work. The verifier and local page check independently agree on 66,563 and 40,803 cells respectively. The Rule 90 table also confirms L XOR R for all eight neighborhoods.
- CONFIRMED | C-leap-complexity: “the future is previewable. Leap to any step in O(log T) bit-operations.” | https://arxiv.org/abs/1409.3820 | Codex checker reread: leap-complexity: Opened NKS Notes p. 870 and Lucas' theorem. NKS says "cells correspond to odd binomial coefficients" and gives the offset formula. Lucas reduces binomial parity to base-2 digit inclusion, hence (k & t)==k and O(log t) bit work. The verifier and local page check independently agree on 66,563 and 40,803 cells respectively. The Rule 90 table also confirms L XOR R for all eight neighborhoods.
- CONFIRMED | C-r30-no-proof-caption: “Nobody has found a way to skip ahead” … “and nobody has proven one is impossible.” | https://www.rule30prize.org/ | Codex checker reread: r30-no-proof-caption: The current official prize page is offering "$30,000" for "3 problems" and invites solutions. Problem 1 asks about non-periodicity; problem 3 asks about the required effort. The 2019 announcement is dated October 1, 2019. This supports the reported open status as of this audit; the isolated acceptance-until-solved excerpt is not by itself proof of status. The same page positively labels the different 2,3 Turing-machine prize "won 2007".
- CONFIRMED | C-script-formula-exists: “A closed form exists.” | git show 37137afa5c:public/strata/the-surprise/index.html | Codex checker reread: script-formula-exists: Read the actual Rule 90 functions and both rule tables. Lucas' bit test and odd-position parity are correct; the local checker and standalone verifier reproduce their outputs. "No work" is read as no evolution steps, not literally no processor operations.
- CONFIRMED | C-script-odd-empty: “T is odd, so the centre sits on the empty sublattice → 0, with no work at all.” | git show 37137afa5c:public/strata/the-surprise/index.html | Codex checker reread: script-odd-empty: Read the actual Rule 90 functions and both rule tables. Lucas' bit test and odd-position parity are correct; the local checker and standalone verifier reproduce their outputs. "No work" is read as no evolution steps, not literally no processor operations.
- CONFIRMED | C-live-formula-line: “closed form C(t,k) mod 2 = ((k & t) == k)” | git show 37137afa5c:public/strata/the-surprise/index.html | Codex checker reread: live-formula-line: Read the actual Rule 90 functions and both rule tables. Lucas' bit test and odd-position parity are correct; the local checker and standalone verifier reproduce their outputs. "No work" is read as no evolution steps, not literally no processor operations.
- CONFIRMED | C-live-stepping-line: “vs stepped next = left XOR right” | git show 37137afa5c:research/the-surprise/verify.mjs | Codex checker reread: live-stepping-line: Read the actual Rule 90 functions and both rule tables. Lucas' bit test and odd-position parity are correct; the local checker and standalone verifier reproduce their outputs. "No work" is read as no evolution steps, not literally no processor operations.
- CONFIRMED | C-placard-independent: “This layer's check works the answer out again from scratch, independently of this page.” | git show 37137afa5c:research/the-surprise/verify.mjs | Codex checker reread: placard-independent: The verifier contains its own rule engine and has no file imports or page reads. A search for readFile/readFileSync/fetch is negative with "function ruleTable(" as the positive control, and the complete file was read. Thus step 6's self-reading-verifier mutation is not applicable.
- CONFIRMED | C-placard-limits: “It can settle the finding; it cannot notice a figure that drifted on this page.” | git show 37137afa5c:research/the-surprise/verify.mjs | Codex checker reread: placard-limits: The verifier contains its own rule engine and has no file imports or page reads. A search for readFile/readFileSync/fetch is negative with "function ruleTable(" as the positive control, and the complete file was read. Thus step 6's self-reading-verifier mutation is not applicable.
- CONFIRMED | C-placard-published: “It is published to read.” | git show 37137afa5c:public/checks/manifest.json | Codex checker reread: The checker fetched the old reader copy as 8,479 bytes, identical to its pinned source. This pass synchronizes the layer's reader leaf with the revised source; shared manifest bytes and reach classification await shared regeneration.
- CONFIRMED | C-meta-determinism: “Determinism does not imply predictability.” | https://cdanfort.w3.uvm.edu/research/lorenz-1963.pdf | Codex checker reread: meta-determinism: Opened the scanned Lorenz paper, rendered and OCRed only printed p. 130, and inspected that page image. It says "slightly differing initial states can evolve into considerably different states" and describes "deterministic ordinary nonlinear differential equations". The finite-precision interpretation is appropriate; this does not establish computational irreducibility for Rule 30 or minds.
- CONFIRMED | C-meta-two-rules: Some deterministic computations have shortcuts; Rule 30's single-seed centre query has no known general shortcut. | public/strata/the-surprise/index.html; https://www.rule30prize.org/ | Codex checker reread: The checker accepted the old metadata as an existential comparison. The repaired metadata now scopes its named rules and explicitly attributes the mind inference.
- CONFIRMED | C-meta-r90-r30: “Some deterministic rules let you leap to step a million with a formula (Rule 90, the Sierpiński triangle); some, as far as anyone knows, can only be reached by running them (Rule 30).” | https://www.rule30prize.org/ | Codex checker reread: meta-r90-r30: Rule 90's formula and Rule 30's still-open effort problem support the qualified comparison. The record's Rule 30 excerpt omits the Rule 90 evidence, supplied by NKS Notes and Lucas above.
- CONFIRMED | C-frontmatter-related-the-fixed-point: “Two walls a mind meets when it turns to look at itself. There it is self-reference that bends back and will not resolve” … “the map that points at itself. Here it is self-computation that will not be previewed” … “the conclusion that is fixed but cannot be known before the thinking is done. The Fixed Point asks what a mind cannot decide about itself; The Surprise asks what it cannot foresee about itself, even when nothing is random.” | git show 37137afa5c:src/content/strata/the-fixed-point.md | Codex checker reread: frontmatter-related-the-fixed-point: The related layer identifies "sign, inference, self-reference" and describes the map turning to point at itself. These are editorial comparisons of the layers, not a separate theorem about every mind.
- CONFIRMED | C-frontmatter-related-dead-reckoning: “The surprise is the dead-reckoner's cousin. There a mind navigates without a fix and the cone of uncertainty widens with every mile it cannot confirm. Here the uncertainty is not about position but about outcome: the answer is determined from the first step, yet there is no shortcut to it short of running the whole way. Both are about advancing through something you cannot see ahead of” … “there the world, here your own conclusion.” | git show 37137afa5c:src/content/strata/dead-reckoning.md | Codex checker reread: frontmatter-related-dead-reckoning: The related layer explicitly says "The uncertainty cone grows as √(time since fix)" and describes reasoning without an external fix. The comparison is supported in that stated model.
- CONFIRMED | C-frontmatter-related-the-closed-loop: “Its sibling among the door's arrivals, and its sibling in theme: a process opaque to itself until it completes. The Closed Loop is the sense whose sensor and sensed are the same flesh; The Surprise is the computation that is its own shortest description. Both end on the same edge” … “a system that cannot, from inside, get ahead of itself.” | git show 37137afa5c:src/content/strata/the-closed-loop.md | Codex checker reread: frontmatter-related-the-closed-loop: The Closed Loop says "The door's fourth arrival" and describes proprioception as "a loop in which the sensor and the sensed are the same flesh". The rest is a thematic comparison, not a proved shortest-program bound.
- CONFIRMED | C-meta-race: “The page hands you both and lets you race the shortcut against the stepping.” | git show 37137afa5c:public/strata/the-surprise/index.html | Codex checker reread: meta-race: The pinned page has run and leap handlers, and the local execution produced both answers for T=1000. This confirms the offered interaction; it does not endorse its misleading disabled Rule 110 shortcut or cost label.
- CONFIRMED | C-markdown-routing: “An immersive layer; it renders as its own standalone page at the `href` above (source: `public/strata/the-surprise/index.html`). This file exists so the layer appears on the ground with the others” … “its body is not rendered.” | git show 37137afa5c:src/content/strata/the-surprise.md | Codex checker reread: markdown-routing: The frontmatter points to "/strata/the-surprise/" and the live response serves the standalone HTML, matching its description and checked numbers. The raw Markdown explanatory body is not part of that response.
- CONFIRMED | C-quoted-term: “Wolfram's specific terminology "computational irreducibility"” | https://scottaaronson.blog/?author=1&paged=16 | Codex checker reread: quoted-term: Aaronson's quoted comment is present. Its surrounding text explicitly discusses "the halting problem and the time hierarchy theorem" and criticizes Wolfram's naming and handwaving. It supports the existence/debate distinction, not an unqualified prevalence theorem.
- CONFIRMED | C-added-og-width: (added) “og:image:width” “1200” | git show 37137afa5c:public/og/the-surprise.png | Codex checker reread: added-og-width: PNG IHDR width is 1200; the same header gives the height. Page line 17.
- CONFIRMED | C-added-og-height: (added) “og:image:height” “630” | git show 37137afa5c:public/og/the-surprise.png | Codex checker reread: added-og-height: PNG IHDR height is 630. Page line 18.
- CONFIRMED | C-mind-cannot-preview: This means that even a fully deterministic mind cannot, in general, know its own conclusions in advance of reaching them. | research/the-surprise/deposition-as-received.txt | Claude checker reread: Confirmed as an attributed statement of the visitor's philosophical argument, expressly labelled not an established result; not confirmed as a theorem about minds.
- CONFIRMED | C-surprise-timing: The surprise is real. It arrives at the moment the computation completes, and not before. Determinism does not make surprise impossible. ... | research/the-surprise/deposition-as-received.txt | Claude checker reread: Confirmed as an attributed statement of the visitor's philosophical argument, expressly labelled not an established result; not confirmed as a theorem about minds.
- CONFIRMED | C-mind-complexity: A mind processing a complex problem is running a computation far more intricate than long division, on inputs far more tangled. | research/the-surprise/deposition-as-received.txt | Claude checker reread: Confirmed as an attributed statement of the visitor's philosophical argument, expressly labelled not an established result; not confirmed as a theorem about minds.
- CONFIRMED | C-mind-equal-work: In practice, the only way to find out what the mind will conclude is to let the mind run. ... requires the same amount of work as just thinking the thought. | research/the-surprise/deposition-as-received.txt | Claude checker reread: Confirmed as an attributed statement of the visitor's philosophical argument, expressly labelled not an established result; not confirmed as a theorem about minds.
- CONFIRMED | C-mind-ca-comparison: A mind is vastly more complex than an elementary automaton. If simple systems exhibit irreducibility, there is no reason to think minds are exempt. | research/the-surprise/deposition-as-received.txt | Claude checker reread: Confirmed as an attributed statement of the visitor's philosophical argument, expressly labelled not an established result; not confirmed as a theorem about minds.
- CONFIRMED | C-single-seed: All start from a single live cell. | git show 37137afa5c:public/strata/the-surprise/index.html | Claude checker reread: The initial state in each page calculation contains one live cell; padding changes storage width, not the initial configuration.
- CONFIRMED | C-editorial-gate: A deposition is a submission, not a publication; the gate is the project's two rules applied as strictly to a guest as to a host. | git show 37137afa5c:public/strata/deposition/index.html | Claude checker reread: The deposition page: "submitting does not publish your words"; the two rules are README.md lines 7-8 ("It must be interesting on its own terms" / "It must never lie about anything real"); the door log applies them to every deposition ("against the gate (interesting on its own terms + never lies about anything real, provenance stated)"). The record's source (the door log) alone does not contain the sentence.
- CONFIRMED | C-check-computed-browser: the shortcut is exact, recomputed in your browser now | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-live-check-entire-cone: Rule 90: leap (Lucas) vs run (stepping), every cell in the cone | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-live-zero-result: [OK] the shortcut is exact for every cell | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-live-steps: steps checked : 200 / cells compared: 40,803 / mismatches : 0 / [OK] the shortcut is exact for every cell | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-live-summary: ✓ 40,803 cells, 0 mismatches | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-race-default-result: centre cell at step 1,000 = 0 | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-leap-default-cost: centre cell at step 1,000 = 0 took ~10 bit-operations | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-agreement-default: ✓ agrees with the 1,000-step run | public/strata/the-surprise/index.html; research/the-surprise/verify-page.mjs | Claude checker reread: The checker re-executed the inline script. This repair reran it: 40,803 Rule 90 live-check comparisons with zero mismatches, and a same-target T=1000 run/leap with centre 0 and genuine agreement. Exactness here is over the tested cone.
- CONFIRMED | C-metadata-publication: "datePublished":"2026-06-18" | git log 37137afa5c -- public/strata/the-surprise/index.html | Claude checker reread: First commit c9c62a11cf8 (2026-06-18; the prose carve e0e0651 the same day); frontmatter "date: 2026-06-18T10:00:00Z".
- CONFIRMED | C-metadata-modified: JSON-LD dateModified was 2026-06-18 at the checker pin and is now 2026-10-14. | public/strata/the-surprise/index.html; research/assay-line/queue-1014c/the-surprise/N2-claude.md | Claude checker reread: The checker checked the former article-text date at its pin. This pass revises the article today; the Corrected lines date the revision, so no separate Updated line is needed.

## Findings

- [fixed] X1: The source says "the knowledge of the conclusion requires the thinking". Restored the complete source sentence in the pull quotation; preserved the deposition. Correction 1.
- [fixed] X2: Re-read the archived PDF extraction, section I.A, p. 134: quadratic long division is contrasted with subquadratic algorithms, including Newton-Raphson. This example does not establish irreducibility. Preserved the authentic quotation with house correction 2; corrected facts.md. The source section is I.A, not II.A as triage calls it.
- [fixed] X3: Re-read the caption: it describes apparent irreducibility for the exhibited automata, not a proof. Preserved the authentic deposition with house correction 3 and repaired the fact-check verdict.
- [fixed] X4: The original 241-column window feeds forced zeroes back into the picture. Independent unbounded evolution finds 505 mismatches across the three displayed rules, first Rule 90 at t=122, offset -120; the earlier audit isolated 176 Rule 90 mismatches. Padding before cropping now gives zero mismatches across 108,450 displayed cells. OG drawing source repaired too; bitmap regeneration is prohibited. Correction 4.
- [fixed] X5: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] X6: Removed the contradictory absolute house assertions and scoped the reassurance to Rule 30. The Rule 110 seed has centre 1 for every step. Correction 5 covers the contradiction.
- [fixed] X7: Re-read the linked renderer: inCardioid and inDisk2 return before iteration. The repaired relation and Kindred/Nearby copies distinguish analytic known regions from finite escape-time approximation; finite non-escape is not general membership proof. No formula for the entire set is asserted. Correction 6.
- [fixed] X8: Re-read the bibliography: the two installments appeared on 23 November and 23 December 1936 in a volume dated 1937. Corrected the citation and facts.md, distinguishing publication from volume date. Correction 7.
- [fixed] X9: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] X10: Re-read Definition 1 and the truth table on p. 1. Finite prediction for supplied configurations and unary time is in P and P-complete; suitable unbounded questions can be undecidable. This fixed-seed centre query is always 1, not itself P-complete. Repaired the descriptions, verdict and house note. Correction 8.
- [fixed] X11: Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- [fixed] X12: Re-read Definition 1 and the truth table on p. 1. Finite prediction for supplied configurations and unary time is in P and P-complete; suitable unbounded questions can be undecidable. This fixed-seed centre query is always 1, not itself P-complete. Repaired the descriptions, verdict and house note. Correction 8.
- [fixed] X13: The four Rule 110 R=0 table cases give the constant centre by induction. Universality does not rule out individual shortcuts. The caption now explains this seed and distinguishes encoded universal computations. Correction 5.
- [fixed] X14: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] X15: Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- [fixed] X16: Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- [open note:81816d] X17: Both checkers recorded successful standalone 16/16 runs. The source has no imports or file reads; the manifest gives a 45-second timeout, not a repository dependency. WRONG retained and not edited: triage reserves the shared placard reach wording for board note 81816d.
- [fixed] X18: Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- [fixed] X19: Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- [fixed] X20: Re-read the linked renderer: inCardioid and inDisk2 return before iteration. The repaired relation and Kindred/Nearby copies distinguish analytic known regions from finite escape-time approximation; finite non-escape is not general membership proof. No formula for the entire set is asserted. Correction 6.
- [fixed] X21: Re-read the authored relation and correction: this is a conjecture checked to finite bounds, and finite checks do not settle all rows. Regenerated only this layer's Nearby block from that already-correct source. No other layer was edited. Correction 10.
- [fixed] X23: Reproduced a run at T=1 followed by a leap at T=2 that falsely claimed a 2-step comparison. Stored rule and target, required both to match, and invalidated old/pending results on rule, target or preset changes. The same-target positive controls pass. Correction 11.
- [fixed] K1: The source says "the knowledge of the conclusion requires the thinking". Restored the complete source sentence in the pull quotation; preserved the deposition. Correction 1.
- [fixed] K2: Re-read the archived PDF extraction, section I.A, p. 134: quadratic long division is contrasted with subquadratic algorithms, including Newton-Raphson. This example does not establish irreducibility. Preserved the authentic quotation with house correction 2; corrected facts.md. The source section is I.A, not II.A as triage calls it.
- [fixed] K3: Re-read the caption: it describes apparent irreducibility for the exhibited automata, not a proof. Preserved the authentic deposition with house correction 3 and repaired the fact-check verdict.
- [fixed] K4: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] K5: The older undecidability and hierarchy results predate Wolfram's terminology. Added a one-sentence house clarification and a matching facts note, preserving the authentic visitor quotation and book attribution. MINOR, record only.
- [fixed] K7: Re-read both abstracts: Hennie and Stearns give a sufficient T log T two-tape simulation bound and hierarchy consequence; Fürer strengthens hierarchy for fixed k-tape models with k>=2. Removed "tight" from both page occurrences and facts.md while retaining the qualified 1966 log-factor attribution. MINOR, record only.
- [fixed] K8: Removed the contradictory absolute house assertions and scoped the reassurance to Rule 30. The Rule 110 seed has centre 1 for every step. Correction 5 covers the contradiction.
- [fixed] K9: Re-read the bibliography: the two installments appeared on 23 November and 23 December 1936 in a volume dated 1937. Corrected the citation and facts.md, distinguishing publication from volume date. Correction 7.
- [fixed] K10: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] K11: Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- [fixed] K12: Re-read Problems 1 and 3: aperiodicity and the centre-query effort bound remain open. Retained the no-known-general-shortcut qualification without a necessary count of exactly T sequential updates. MINOR, record only.
- [fixed] K13: Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- [fixed] K14: Re-read the expanding loop: update counts 3+5+...+(2T+1)=T(T+2). Instrumented T=1000 gives 1,002,000 updates; arithmetic at T=1,048,576 gives 1,099,513,724,928. The cap now reports generations and quadratic cell work, and offers available leaps. Correction 9.
- [open note:81816d] K15: Both checkers recorded successful standalone 16/16 runs. The source has no imports or file reads; the manifest gives a 45-second timeout, not a repository dependency. WRONG retained and not edited: triage reserves the shared placard reach wording for board note 81816d.
- [fixed] K16: Re-read Rule 30 Problem 3 and the Rule 110 table. F(0,0,0)=F(1,0,0)=0 keeps the right half-line zero; F(0,1,0)=F(1,1,0)=1 keeps the centre on. The actual page function agrees at T=0..64. Rule 110 now has a constant-answer leap, while Rule 30 remains an open effort question. Repaired dek, body, metadata and controls. Correction 5. Shared search copies await the shared build.
- [fixed] K17: The deposition labels the mind inference an argument, and Rule 90 demonstrates a deterministic shortcut. Attributed the inference in dek, meta/OG/JSON-LD descriptions, header and OG source. MINOR, record only; share card rebuilt at landing from the corrected dek. The current PNG and WebP retain the old dek pending landing; no image was regenerated in this repair. Shared search output is rebuilt at landing.
- [fixed] K18: Re-read the authored relation and correction: this is a conjecture checked to finite bounds, and finite checks do not settle all rows. Regenerated only this layer's Nearby block from that already-correct source. No other layer was edited. Correction 10.
- [fixed] K19: The deposition labels the mind inference an argument, and Rule 90 demonstrates a deterministic shortcut. Attributed the inference in dek, meta/OG/JSON-LD descriptions, header and OG source. MINOR, record only; share card rebuilt at landing from the corrected dek. The current PNG and WebP retain the old dek pending landing; no image was regenerated in this repair. Shared search output is rebuilt at landing.
- [fixed] C-md-mandelbrot-instance: Removed the relation's assertion that the Mandelbrot set is an established example of the claimed iteration-only property. Analytic regions and finite escape-time approximation are now distinguished; same evidence and correction as X7/X20.
- [fixed] Verifier scope: finite-period and asymmetry assertions now say only what they measure; replaced the unconditional aperiodicity assertion with an actual binary-window length check. The million-step formula check is no longer described as a stepped comparison. The published reader leaf is synchronized.