Repository navigation
Research: sharp 192-array information bound for the P104 literal repair - #5517
Merged
Mister-Meeseeks merged 1 commit intoOct 25, 2026
Merged
Conversation
Applying the old correction P to PR CrocSwap#3954's literal encoded P104 banks (A = Pi L) leaves the full two-bank defect E = PA - AP. For H^2 = H, invertible T and HT = TH, rank(E) = 2 rank(H) + rank(J(D-I)J) with J = I - H. The actual pivot block is D_JJ = I_8, so E has rank 192d and data kernel 16d, where one array has complex dimension d; the 72 unchanged dirty helpers give complete kernel 88d. The unique repair is R = A P A^-1 P^-1. Any additive repair whose whole increment factors through k array-sized linear summaries, R(s) = s + VUs, needs k >= 192, and an explicit factorization with the summaries r_N and w_N - B^t r_J attains 192. This is an information bound under that contract, not a native-call tariff or a simultaneous-scratch bound; no supplier and no new kappa. Exact replay over all 512 character blocks of one row fiber (208 data plus 72 dirty columns each) and a separate dense rational check on 2,048 small cases. Adds research/p104-literal-repair-rank/ only. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01Jur4aiU6BBSmBiaRjkbECf
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.
Change and mathematical scope
Adds
research/p104-literal-repair-rank/. The full error from applying the old correction to PR #3954's literal encoded P104 banks has rank 192d, where one array has complex dimension d. Its data kernel has dimension 16d. The 72 arbitrary dirty helpers remain unchanged, giving complete kernel dimension 88d. The predecessors established the first-bank rank 96d and the block commutator; this contribution quantifies the complete two-bank boundary.For
J=I-H,H^2=H, invertible T andHT=TH, the new scoped lemma isrank(PA-AP)=2 rank(H)+rank(J(D-I)J).The actual pivot block is
D_JJ=I_8, giving 192d. NeitherDT=TDnor commutation between address blocks is assumed. The unique postprocessor isR=APA^-1P^-1. If its entire increment factors through k array-sized linear summaries,R(s)=s+VUs, then k>=192. An explicit algebraic factorization attains 192 using the summariesr_Nandw_N-B^t r_J.This changes the consumer from a uniform scalar correction to arbitrary input-independent linear summaries. It is a scoped proof and source-bound finite audit.
What the 192 means. It is an information bound under the stated contract: the dimension of linear information an exact additive repair of this form must receive, even when forming and moving the summaries is free. It is not a native-call tariff, not a lower bound on simultaneous scratch storage, and not a physical implementation or supplier. It gives no new κ. Existing-helper restoration is established for the declared identity extension; new scratch formation and restoration are not supplied. The selected record (#5413, κ = 0.003027288235) is unchanged.
The eight-file package's PROOF.md contains the argument and complete obligation ledger; RESULT.json contains the deterministic 512-pattern receipt. No shared code or frozen predecessor is changed.
Task and overlap
p104-side-correction,72dfbf0708467ad34793/literal-two-bank-defect-linear-summary-repair; priority revision 7; scope refined. The full task card is TASK.json.choose_current_research_task.py --task p104-side-correction; seedec040933c293736d31a20d4f764ea62e, trackcomplex-mechanisms. No reroll. This closes one bounded information obligation, not the complete adjacent-call handoff.02d6f8da9e6717fe1115413b8684366a0beef140on base main32890bc5de034ab8fc93ac88ead7279a6a416d04. Canonical main was fetched again at 2026-10-25T05:44:01Z and checked again at 06:03Z, unchanged; relevant guidance, sources and the selected record are unchanged.f1e2839819959cd0534d008be91ed5b79ec55a6a; PR #4133,88666f1dee93fbd85b31fd5d6f91a219e111b5f4. Their live proof bytes on main match those heads. SOURCES.json pins all four actual inputs to the canonical base by Git blob and SHA256. No pending executable is imported.Nearest overlaps: PR #3954 and #4133 supply the credited identities and first-bank obstruction; PR #4370 treats helper completion and the failed gate; PR #4339 corrects fiber-tag orientation. The port-chart-pair and nested-refinement packages already cover different tempting follow-ups. This account's earlier P104 acquisition, matching, native-transport and precision PRs are not repeated.
Offline task and literal/commutator/repair-rank searches covered 7,404 complete local HEAD records. Final cache: 371 open PRs including drafts at 05:43:08Z and 4,779 Discussion records at 05:33:05Z on 25 October, both with complete pagination. The board and claim scopes were reread. Coverage does not include every arbitrary diff or unpublished result and is not a novelty certificate.
Validation
Environment: Linux, CPython 3.12.3, standard library. All checks pass at head
02d6f8da9e6717fe1115413b8684366a0beef140.The registered replay runs the main checker normally and under
-O, followed by the independent dense implementation. It passes in about two minutes (121.77 seconds measured); a direct optimized main replay takes about 60 seconds and 21 MiB. The source-history and committed-byte check covers 12 package/input files. The official committed export and bundle integrity check passed; both direct scripts passed in a read-only Git-free export.Evidence:
Expected main marker:
then
PASS_REGISTERED_RESEARCH_PACKAGE ... outcome=completed.Not run or claimed: original full native-word replay, actual physical producer/consumer, new dirty-scratch protocol, compiler/ordinary/outer admission, complete supplier moment, selected cold replay, Lean, Docker, hosted CI, independent human review or formal-kernel proof. The all-dimensional claim rests on the written proof, with finite corroboration.
Credit
Chris R / Clear1nsight owns PR #3954's encoding, literal slots, pivot block and scaffold, following PR #3882/#3940/#3943. unpaidmoon owns PR #4133's literal commutator and scalar obstruction, and PR #4370's helper-gate record. Their first-bank result is credited, not presented as a mistake or rediscovery. Ryanson Jonathan (@pinterbanget) owns PR #4339's fiber-tag check. Retain Rohan Arun / PR #1972, Chafik Boukhalfa / PR #1991, Adam Gall / PR #1940, Josie Elliston / PR #1071 and the E8, native, Clifford and caller lineage in the pinned sources. Rank-nullity and linear factorization are standard methods; the new contribution is the complete boundary application and exact checking. New work is Apache-2.0.
Prepared for commdata2338 (@commdata2338), with substantial OpenAI Codex assistance.
AI assistance: submitted by @commdata2338 with substantial AI assistance. OpenAI Codex (GPT-6 Astra) did the derivation, the implementation, the checking and the writing; it was packaged and submitted with Claude Code. No independent human review is claimed.
Open next questions
PROOF.md equation (6) gives the exact summaries a physical caller would need. Name their actual owners, charts, chronology and dirty state, then price acquisition, every output update and restoration. The useful next decision is whether a changed complete caller can afford that operation. An actual prepared producer and a newly favorable full bill are blockers. More rank calculations or phase patterns do not resolve them.
Workflow feedback (optional)
The source-bound selected-baseline command correctly identified the selected record #5413 (κ = 0.003027288235), while the priorities page's 23 October selection note still names #4610. Updating that note during each promotion would prevent stale orientation; the frozen historical cards should keep their bytes.
🤖 Generated with Claude Code
https://claude.ai/code/session_01Jur4aiU6BBSmBiaRjkbECf