Frozen source 85d7d83c06f692f3fa7d19af42b6c988e0f58ca0: proofs/phase20_explicit_checkerboard_completion.md and formal/Phase20ExplicitCompletion.lean, exact theorem Rule30.full_checkerboard_completion_exists. Internal review/math-audit.md, 2026-10-08: PASS for the stated theorem after fresh proof reconstruction and Lean rebuild. Phase20ExplicitCompletion.lean SHA-256 afaba14b19f00aa57747bf9d8c42ea03e2b7bb2ec6acf423eebf0b893a8fadaf. The supplied later data commit 7cd3e0cdebf3802942d1579a96387ef1ece92374 was context only and was not needed for this proof.
范围
Full binary initial rows on the integer line. For every rightmost one R≥1, there is an S≥1 and a row v with v(n)=1 iff n-S is even for n≥S, preserving every t≥0 and every n≤0. No restriction on the left tail. The R=0 lone seed is checked separately; no assertion for all rows with R=0.
假设
Synchronous Rule 30 on the infinite integer line: next = left XOR (center OR right). u(R)=1, u(n)=0 for n>R, and R≥1. No left-support or initial-center-bit assumption.
工具链
Lean 4.34.0, x86_64-w64-windows-gnu, commit 293d5d0c0c3f3dded4688b3ccd6a33939ac5102b. Fresh rebuild of the ten frozen modules passed on 2026-10-08. Lean executable SHA-256 a8040e2cab341c12116ab591fed9f761816f5f6b08554f6cc1680e86dfbba0a2. Named theorem axioms: propext, Classical.choice, Quot.sound.
审查者
One independent runtime AI subagent, 2026-10-08; reconstructed argument, matched exact Lean hypotheses, rebuilt frozen dependency closure and ran a separately written bounded replay. Internal AI review only; no human, external or peer review is asserted.
Frozen source 85d7d83c06f692f3fa7d19af42b6c988e0f58ca0: formal/Phase17InfiniteFiber.lean, Rule30.infiniteEvenRow_same_left_trace and Rule30.infiniteEvenRow_same_center. File SHA-256 b85bedaa8878aa67f10b5270f4d575c76eff6d60a4b0f7ff9bd6cb9c9104264c. Internal review/math-audit.md checks this R=0 case separately and includes its module in the fresh build. The independent bounded replay also checked this pair through t=128 on n=-128,...,0; that finite replay is supplementary, not the all-time proof.
范围
The two specified full binary rows, including all negative positions initially zero; every nonnegative time and all integer positions n≤0. This is a direct zero-penultimate completion at R=0, not an extension of the general R≥1 theorem to all R=0 rows.
假设
Synchronous Rule 30 on the infinite integer line. u(n)=1 iff n=0; v(n)=1 iff n is a nonnegative even integer. In particular u(-1)=0.
工具链
Lean 4.34.0, x86_64-w64-windows-gnu, commit 293d5d0c0c3f3dded4688b3ccd6a33939ac5102b. Fresh rebuild of the ten frozen modules passed on 2026-10-08. Lean executable SHA-256 a8040e2cab341c12116ab591fed9f761816f5f6b08554f6cc1680e86dfbba0a2. Named theorem axioms: propext, Classical.choice, Quot.sound.
审查者
One independent runtime AI subagent, 2026-10-08; reconstructed argument, matched exact Lean hypotheses, rebuilt frozen dependency closure and ran a separately written bounded replay. Internal AI review only; no human, external or peer review is asserted.
R30-PRIZE-STILL-OPEN未解决
该构造没有解决单种子中央列的非最终周期性问题,也没有排除任何候选周期字。
形式化验证
无形式化验证
审查状态
内部核查
证据
Scope of proofs/phase20_explicit_checkerboard_completion.md at frozen source 85d7d83c06f692f3fa7d19af42b6c988e0f58ca0 and internal review/math-audit.md, 2026-10-08. Equality of two initial-row traces does not decide whether the shared center trace is eventually periodic.
范围
The separate Rule 30 single-seed center-column prize problem.
审查者
Internal AI mathematical and editorial scope checks; no claimed resolution of the open problem.
评论
讨论版本 2
暂无评论。
此版本的评论保留在这里。 在当前版本下评论 →