Repository navigation
Prove bounded native corrective ADD chains cannot improve paid profiles - #5170
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
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.
The fixed-scalar screens leave changing the scalar dependency graph open. This package checks corrective ADD expansions in Cao Yifan's frozen round-three native word, including nonadjacent pairs at raw-event distance at most 16 with fixed intervening contacts. It establishes no higher κ.
In each orientation, 381 adjacent and 1,512 nonadjacent pairs produce 5,679 corrective orders. The exact binary flag reduction covers every feasible intermediate subspace: 4,621 dimension triples, of which 4,400 preserve the complete paid histogram and 221 are strictly worse for every power price r^t, 0<t<1. Another 1,281 orders are infeasible. Integer truncated-rank inequalities prove the comparison for every concave rank tariff with f(0)=0. Every affected transition, including the bypass and final exits, is charged; all 408 productive boundaries and eight center jobs remain fixed.
This is a scoped source-specific result, not a whole-word optimum. Native-map changes, helper-boundary changes, interacting rewrites and retiming the intervening contacts remain outside it. Task
centre-path-sharingis explicitly refined to this supporting scalar-graph screen; the original sharing construction gate is not claimed. No selected source, frozen predecessor, shared code or selected frontier changes.Credit CubeJerry's PR589 corrective/flag/concavity screen, Ian Libânio/PR933, Dugongue's Steinberg and transported-frame work, Cao Yifan's round-three native word, Cinna Davis/#4470, zxv, Jacob Alan Sussman and the retained source lineage. Substantial OpenAI Codex assistance; no subagents, independent human review or proof-kernel acceptance claimed.
Validation at contribution head
5f3e088621e0a510f5b07ece590409e94ae45897, CPython 3.12.3:git diff --checkpasses. No Lean, optional solver, historical full supplier or outer theorem replay ran. Both hosted checks pass at the exact contribution head: planning and the registered package replay, run 39947855264. Run metadata confirms that head and success.Reproduce with
python3 -B scripts/research_package.py --package research/native-scalar-chain-screen.Canonical main was refreshed before submission at
a5df48c55ea806d7952b65acc9c76d878ff09b13, priority revision 7, with unchanged selected κ 0.00302015. The refreshed overlap report covered 331 open PRs, 4,340 discussion records and the complete 6,918-note HEAD inventory; it found the credited BIT predecessor and this local package for the specific corrective-chain queries. This is metadata coverage, not a novelty certificate. README and TASK retain the next-question gate; increasing this window without a new cost lever is not proposed.