Skip to content

Prove an all-bundle direct-delivery price floor for the selected BIT word - #7741

Open
aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-064
Open

aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-064

Conversation

@aliromman

@aliromman aliromman commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

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^t for 0<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.

Evidence Coverage
New support certificate All 514 eligible donors; exact support masks, ranks and image dimensions
New target distances All 511 coset vectors, full weight histograms and minimum witnesses
Causal stability 4,112 donor-library equality checks across later deadlines
Separate row representation Coordinate sets agree with the retained packed interpreter on all 5,742 paid rows
Attainment Every original source contains its required row at the old deadline; all original pairs are nested
Replayed dependency The predecessor's 5,733 full-span exclusions, 4,626 singleton checks and 478,764 pair checks
Controls Four false support caps, nine current-arrival deadline leaks, strict budget and binary addition

Python 3.12, standard library only:

python3.12 -B scripts/research_package.py --package research/bit-all-bundle-price-floor

Both registered normal and optimized commands print:

PASS_BIT_ALL_BUNDLE_PRICE_FLOOR 5742 arrivals; 511 cosets; distance>=48>30

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 requires make 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: PR7739 7e44f44b8078b3788256772533890fbf85503a0c; retained model proof: PR7723 a4fd22c08058c0fef830306b2d46e4a51f091939. 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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant