Repository navigation
Independently check #4541's packed RAM transfer: §1 parameters exactly, §2-3 macro steps by a separate packed simulator (no new κ) - #4552
Merged
Conversation
…s exactly, §2-3 macro steps by a separate packed simulator (no new κ) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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
This adds
research/pr4541-packed-transfer-check/, an independent check of Dugongue's #4541 (head46ca24a8), the packed Word RAM transferO((T+n+m)/log(n+2) + (n+2)^(1/16) log(n+2)). It covers the §1 parameter arithmetic and the macro-step invariant and halting of §§2–3. All checked claims are confirmed. No new κ.The verifier was written from #4541's
PROOF.mdtext alone, vendored with its blob43a6afbeand SHA256 pinned. Nothing is imported from #4541's code.Checks
k ≤ 8,c ∈ {2,4,8},s ≤ 10,λ ≤ 3000):16b ≤ λabove the stated cutoff, so the table has at most(n+2)^(1/16)rows;128Kc·r ≥ λ;L ≤ B;cr < b;H > 2·2^(a−4)(n+2)^d(12,288 cases).old + local − r. Against direct execution on 486 random multi-tape machines:outcome=partial, 4.3 s).Limitations:
Head:
a821e926e3d7eaeae8b12be974dc5083360f6494. Base: canonical mainf626db5c.Credit: Dugongue (#4541); Hopcroft, Paul and Valiant (1975). Prepared by Ryanson Jonathan with substantial Claude Code (Claude Opus 5.5) assistance.
🤖 Generated with Claude Code