Repository navigation
Independently certify the universal fixed-cover P104 support cut - #3259
Merged
Mister-Meeseeks merged 1 commit intoOct 17, 2026
Merged
Conversation
This was referenced Oct 17, 2026
3 of 4 tasks
This was referenced Oct 20, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 20, 2026
Independent hypothesis-by-hypothesis review of PR3259's path-embedding argument (valid as a necessary support test under its contract), of PR3252's memory-relaxation proof (valid), and of what PR3427 consumes (its own one-helper lemma and PR3252 operations; justified). The one-recombined-helper criterion (stated in PR3427, re-proved here for every dimension case) is exact for untimed support. Under it, 2,682 of the 4,992 required entries of C = I - G/2 are unsupported, not only C[71,102]. Consequence under PR3427's contract: rank(U - I) >= 17 (19x18 unsupported rectangle, rank 17; 17x17 minor det(8C) = 2^43). Stdlib verifier: PR3259 layered control reproduced (missing (71,102), cones 1,725/37); sharp criterion by two loop orders; PR3427 four-column masks reproduced; three single-relaxation support rows (unpriced); 4,500-program exact-coefficient oracle over F_2^3/F_2^4 with five contract-violation controls; mutation tests. Audit only: no construction, kappa or frontier change. 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
Independently certify dcharb78/PR3182's universal fixed-cover P104 exclusion, including same-layer source acquisition and early target writes.
Under the stated immutable-X, unread-Y, independent-dirt, monotone equal-frame contract, every actual same-dimension dependency run collapses to one direct contact. Every matching embeds into the pooled test. The dimension-five forward cone has 1,725 edges and the dimension-six backward cone has 37, with no intersection; both early Y71 writers also lack X102.
The universal cut and its numerical values belong to PR3182. This adds the support-inclusion proof, an implementation importing no predecessor executable/results, literal-frame relation comparisons and rejecting controls. PR3214's output/cycle audit and PR3252's distinct memory theorem retain their credit. The original channel's G/2 identity remains an inherited premise.
Evidence
After: both complete contact engines reproduce all 104 output masks, all eight relation hashes and the sole missing entry among 4,992 requirements. Seven behavioral groups pass, including exhaustive F2^3 interval checks, all 4,096 actual three-frame assignments, fresh reads, multiple sources and source/geometry corruption.
69f4593253ec00ba598e1be733931e550606295af6d2707f858dc52e5fc1f9cf.python3.12 -B scripts/research_package.py --package research/p104-pooled-cut-independent.463113d675af7410ac91d53a4fed51ec6494eb9a, priority revision 6. All live inputs use canonical main Git blobs; no pending-head Git-object dependency.This is a scoped proof and finite certificate. The other 4,991 reachable requirements are only a necessary test. No chronological coefficient program, arbitrary dirty restoration, native/physical/precision/consumer invoice, all-size theorem, general lifetime floor, new supplier or kappa is claimed. Selected cold replay, original/native G/2 proof replay, formal-kernel and independent human review are unrun. Selected and frozen predecessor files are unchanged.
Merge Danger
Door: two-way
Blast Radius: isolated
Adds one opt-in research package and its declared replay. It changes no supplier, selected result or shared implementation.