Repository navigation
Conversation
This was referenced Nov 18, 2026
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.
Every original paid BIT arrival retains its minimum price under arbitrary finite bundles of direct nested deliveries from its fixed, strictly earlier chart libraries. This closes the nine higher-arity exceptions left by PR #7739. The theorem covers both orientations, all 659 independent inputs, free retention and destination XOR, and every tariff
rank^tfor0<t<=1. The original single delivery attains the floor. No new kappa follows; the compatible paid-moment gain within this contract is at most zero.Read the proof, full support/coset certificate, verifier, source pins and credits.
The predecessor already excludes 5,733 of 5,742 arrivals by the sum of all lower-rank donor spaces. The remaining nine are rank-seven arrivals into chart 0. A strictly cheaper bundle must have total rank at most six. In one fixed 135-dimensional quotient, the largest donor support unions at ranks 1, 2, 4 and 6 have sizes 1, 2, 17 and 30. Thus every affordable bundle, of any arity, has support at most 30. The complete target cosets have minimum weights 56, 58, 52, 50, 51, 50, 50, 48, 48. Each exceeds 30.
Keeping the initial quotient is essential: the later free destination rows remain an explicit span of dimension at most eight. This reduces the whole higher-arity question to 511 exact coset vectors, without enumerating arbitrary donor subsets. It proves an obstruction in this model, not a failed finite search.
Python 3.12, standard library only:
Both registered normal and optimized commands print:
Normal/optimized registered replay, committed bytes/source history/modes, export and sealed read-only Git-free serial replay pass. Hosted CI did not certify this package. The plan job failed in the shared
test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requiresmake frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence. The source rational geometry and full-donor reduction are shared code. Separate row reconstruction is not independent human or formal-kernel acceptance.Credit Nick Petalas for the full-donor reduction and two-delivery proof and checker. Ali Romman's PR #7723 supplied the fixed-library model. Jerry Chen supplied the selected PR #7001 caller; its notice credits zxv and the retained native authors, DreamingOfClouds for the chain-root caller, and the earlier root lineage. Their exact source bytes and notices remain intact.
The result fixes libraries, target rows, destinations and deadlines. New charts, intermediate relays, adaptive libraries, helper promises and matrix-valued reconstruction remain outside the contract. A useful continuation must change the information or boundary and charge formation, delivery, storage and restoration. No physical implementation of free storage is supplied. All five framework assumptions and the selected frontier remain unchanged. The selected cold replay, other predecessor full suites, Lean and Docker were not run.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, revision 8. Consumed pending head: PR77397e44f44b8078b3788256772533890fbf85503a0c; retained model proof: PR7723a4fd22c08058c0fef830306b2d46e4a51f091939. Eight retained files have exact byte pins; no unmerged source ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim.