Repository navigation
Emit a complete packed TM backend with exact simulation costs (no κ) - #6264
Merged
Mister-Meeseeks merged 1 commit intoOct 31, 2026
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Complete the emitted constant-overhead packed TM backend left open by Dugongue / David Ganz's #4538. Claim type: scoped simulation proof with exact finite corroboration. The new dense fixture initializes 256 tape cells in 128 packed data words. No new kappa or selected-frontier change.
Only
research/emitted-packed-tm/is added. PROOF.md proves the all-input invariant under well-formed-input, initially blank-field and nonwrapping-width premises. It derives a complete successful-instruction envelope and a tape-word bound. The emitter returns ordinary primitive instructions; no host TM step or packed access remains in the generated program.Credit #4538 for its representation, access kernels, unpacked compiler and open question, and its retained RamStd/Problem 1.8 and Szymon Torunczyk simulation lineage. #4883's older retained-read improvement is credited context, not integrated. #4541's stronger tabulated transfer and #4724's portfolio are distinct precedents. The new contribution was produced by Nick Petalas. Classical packing and simulation retain their credit.
Advance CLAIM.
Evidence
From the repository root:
Expected markers: PASS_EMITTED_PACKED_TM, PASS_REGISTERED_RESEARCH_PACKAGE and PASS_RESEARCH_COMMIT_BYTES. Another host's CPython 3.12 path may replace the displayed interpreter. Standard library only.
Limitations
The supplied emitter accepts at most four tapes, alphabet size four, sixteen states and one million instructions. The scale parameter is explicitly presented; a particular caller must justify its relation to input length and provide the execution/address envelope needed for logarithmic word width. Output is exactly m raw symbols, not an integer codec. Final simulated tapes are preserved, but owned tape/control storage is not erased.
The written induction establishes the universal scoped claim; finite fixtures corroborate it. Lean/RamStd.step refinement, complete multiplication-machine materialization, physical/native integration, caller cleanup, rounded arithmetic, stock, precision and analytic recovery remain unrun or unsupplied. All five selected framework assumptions remain. Independent human and formal proof-kernel review are unclaimed.
Open next questions
Related open work
The completion refresh inspected this account's open PRs created since the advance CLAIM at
2026-10-30T11:26:07Z. There are sixteen, including this PR; none of the other fifteen studies this complete emitted packed TM backend or computes its instruction/storage fixture. No additional same-object comparison or numerical disagreement was found, and no predecessor computations were rerun for this refresh. The earlier live open-PR list and complete cached overlap corpus were also inspected. Coverage excludes unpublished work and arbitrary code diffs; absence of matches is not a novelty certificate.CI notes
Both hosted checks passed for head
0866b9f620c3ad64a4f3c1c0aa332c8f80eeb435in run 41049420009: plan and replay (research/emitted-packed-tm). The completed checks were read once and confirmed successful. Hosted replay certifies execution of both registered finite checks; the universal scoped simulation theorem rests on the written proof. Independent human and formal proof-kernel acceptance remain unclaimed.Every registered scientific command and the publication/source-history checks also passed locally; nothing was deferred solely to hosted replay.
Merge Danger
Two-way door. Blast radius: isolated. The PR adds one scoped research package and changes no shared tool, predecessor source, selected result or frontier.