Repository navigation
Prove a sharp 112-call bound for active coded-mode repair - #5126
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
Conversation
Contributor
Author
|
Hosted status for The log reports eight failures in two shared test modules:
This PR changes only its new research directory. Its registered normal/optimized/independent checks, committed source-history/byte checks and Git-free official exported replay all pass locally on CPython 3.12.15. The shared fixture/source-role repair and a subsequent hosted replay remain outstanding; no shared infrastructure or historical pins were changed here. |
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.
The center-free producer has eight code modes, but these do not provide an eight-call Gaussian repair. This package proves sharp 112-call bounds for the actual one-sided correction and eight-mode extraction/expansion, even with chronological linear feedback, saved responses, fanout, free mode rebasing and cross-block mixing. Homogeneous direct sums require 112m calls. The conjugated adapter J and J-I also need at least 112 calls; their exact optimum remains open.
The consequence is concrete: a standalone uncoding patch costs at least 112 paid calls while the removed eight H8 calls save at most 64 moment units. That route loses at least 48 units per FULL. This extends #4932's one-parallel-bank scope to active chronological calls; it does not extend that predecessor's per-channel grade-two conclusion.
The model uses same-width fresh fields and a fixed finite projective monomial group, with the same one-column map lifted across every digit column. The lower bounds hold at sufficiently large widths. Already-paid native observations, nonuniform per-column address operations, compressed sandwiches and full-controller admission remain outside scope. No improved κ or global caller impossibility is claimed.
Validation on publication commit
0e8a13c251a9be1029114cda8b4194f05f3a23ec:Publication branch starts from refreshed canonical main
20a1e31bc6009b9b3f4d084bbaadc6350e34fcba; frozen scientific sources remain pinned to4c0a359d88f22f05189d51f48387750b801a45d4. Latest common-code moving-stage and coherent fresh-D work was reviewed and its distinct scope retained. Claim: #4930 (comment).Credit Dugongue/#4929, Dillon/#4933, Chris R/Clear1nsight/#4932, the passive saved-query clarification, Cinna Davis, Cao Yifan, zxv, and the retained native/compiler and rank-cut lineage. Prepared for Dillon with substantial OpenAI Codex assistance. Selected frontier and predecessor files are unchanged.