Repository navigation
Negative result: P112 fixed-reader two-total COPY at source union 48 — two-column loss bound exactly 5 (attained), full-rank lower bound 65, COPY >= 64 extends (PR2382 OQ1) - #2581
Merged
Mister-Meeseeks merged 3 commits intoOct 16, 2026
Conversation
Close band 48 of PR2382 open next question 1 with an independent stdlib verifier (no predecessor code imported). At |U| = 48 the geometric deletion loss of the eight P112 coordinate readers reaches 8 (5 through 47), but every configuration with loss >= 6 has a fully specified rank-3 minor, so a two-column correction ZA^t retains loss at most 5; an explicit full-rank two-column decoder attains 5 (bill 74). Charging both added terms (price minimum 6) gives a full-rank COPY floor of 65 at 48 (66 through 47, reproduced). No new kappa; negative result. Prepared by thakrarsagar with substantial AI assistance from Claude (Anthropic, Claude Opus 5.5). Apache-2.0. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Check that x_j x_k is 12/12 balanced on all 28 cuts and use it to show every nonzero vector of col W has >= 12 ports in the realized 4+1 shape, so that shape's full-rank COPY bill is >= 66; the overall floor at 48 remains 65 because shapes 3+1+1, 2+1+1+1 and 1^5 are not analysed. Receipt regenerated; verifier PASS unchanged. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…, credit) Rephrase PR2382 extension, label 65 as a lower bound with attainment open, note the witness's PR1197 disjoint-coefficient class, correct band-49 open question, pin inherited PROOF.md sources, route NC4 through the real comparison function, check --write target before the run. 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
Status: Negative result (no new κ, supplier or decoder; the selected record is unchanged).
This closes band 48 of PR2382's open next question 1, using an independent stdlib re-implementation that imports no PR2382 code and uses exact Fraction and F2 arithmetic. The setting is the pinned P112 fixed-reader exact two-total decoder
XX^t = XY^t + (XA)Z^t, withY = X - ZA^t,A8x2,Z112x2 and deletion union|U| = 48.Geometric loss at 48 is 8, up from 5 at 44..47. One example is a four-dimensional 48-port support of reader 0 containing a cut, which gives loss vector
(4,0,1,1,1,1,0,0). There are also seven 8-reader single-word unions.The two-column retained-loss bound is exactly 5. Every configuration with loss 6 or more contains a fully specified column subset whose exact rank is 3. A rank-two
ZA^tcannot match such a subset. The completeness argument is a case split on the largest closed support:The bound uses only
rank(ZA^t) <= 2.An explicit decoder attains loss 5, at a bill of 74. It is a two-column decoder with
rank Z = rank A = 2andrank[X Z] = 10, in shape4+1. The identity holds on all 12,544 pairs. Retained ranks are(4,7,8,8,8,8,8,8)and added ranks are(8,7).A = [e_0, e_1]) lies in PR1197's disjoint-coefficient class. The sameWin an overlapping basis keeps loss 5, but that representative's added bill was not computed.Lower bound at 48 is 65. This is a provable lower bound in the full-rank on-column (PR1197 residual) case,
64 - 5 + 6, using the inherited price minimum of 6. Whether 65 is attained is open; the only witness costs 74.4+1costs at least 66. This is a written argument; its 12/12 cut sign-balance premise is machine-checked.3+1+1,2+1+1+1and1^5are not analysed this way.The "COPY at least 64" statement extends to union 48. The dependency chain is:
It does not depend on the open PR2382.
Positive control at cap 47. This reproduces PR2382 independently: geometric maximum 5, bound 4, floor 66 for
M = 44..47, and single-word census2032/280252/9072/42/0.Base and pins
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2(origin/main is unchanged at submission).research/p112-single-lift/reference-geometry.json, sha2564f44af368e046002553d632ee90c6470990827cea3fae41f0f54018522d7a080.SOURCES.jsonwith git blob and sha256.research/p112-two-total-union48-seed30/. Only this directory is added;upstream/and the frozen packages are untouched.Reproduce
Expected final line (about 165 s on one core, peak RSS about 175 MB, CPython 3.14):
RESULT.jsonis compared exactly. A metadata check is also available:python3 scripts/research_package.py --package research/p112-two-total-union48-seed30 --check-onlyreportsPASS_PACKAGE_METADATA_AND_PINS.Negative controls (must be rejected)
{0,1,2,3,12,13,14,15}and columns{0,2,3}, replacing the third column by the sum of the first two drops the rank from 3 to 2.4+1+1correction reaches loss 6 but hasrank W = 3, so it is not a two-column correction.receipt_matchesfunction used for the real comparison must reject a copy of the receipt with the floor field incremented.Independent review checks:
FAIL RESULT.json mismatch;Yentry are each rejected;Search record
Scope, inherited assumptions, unresolved obligations
Inherited, not re-proved here:
r >= p(m);Open:
3+1+1,2+1+1+1and1^5are realizable (the rank-two condition is necessary, not sufficient);s > 36branch stays cut-only; thes = 36branch widens to a budget of 13.Other limits:
Overlap and credit
Overlap snapshot, about 15:13Z on 2026-10-15:
2d7807f6, open) stops at 47 and names band 48 as its next step. It is cited, and its ≤47 numbers are reproduced independently; its code is not imported.Predecessors:
Sprint: track 20-39 (complex supplier), seed 30. Claim: #1163 (comment)
Contributor: @thakrarsagar, with substantial AI assistance from Claude Opus 5.5 via Claude Code, run in an automated sprint loop. The mathematics, implementation, checks and writing were AI-assisted, and the reviews were AI-run. Apache-2.0.
🤖 Generated with Claude Code