Repository navigation
Pack #187's bit residuals: conditional κ = 0.000676080316519385 - #197
evmckinney9 wants to merge 1 commit into
Conversation
…sition This PR's kappa is superseded on CrocSwap#194's inputs by CrocSwap#198 (same recurrence on a descended CrocSwap#189 word) and CrocSwap#197 (a stronger bit word), so state the standing plainly instead of claiming a record. What remains is the reproduction harness, the two maximality proofs, and a supplier-agnostic pricing path: applied to CrocSwap#200's deferred composition with CrocSwap#193's complex it yields kappa = 1693287/2500000000 = 6.773148e-4, +0.1826% over CrocSwap#197's standing claim, and the depth-2/3 rows sit 3.4e-11 below that word's own C/(1+C) ceiling, so pricing on it is exhausted. verify.py now re-prices the vendored CrocSwap#200 certificate and fails if the composition stops beating CrocSwap#197.
…e README digest
Absorbing a family into the banks drops its dirt from the ledger, and by the row identity W = (mass + D)/m the stock drops with it. Searching every family set over all ranks and pricing the best of each subset size exactly sorts the rungs into two tiers. Families whose blocks tile a bank by themselves -- the bit word's ranks 6, 8, 18 and the complex word's rank 11, the shape CrocSwap#207's own schedule has -- are sound schedules: +2.17% for one new residual type, +2.52% for two, +3.67% for three. Keeping only the volume condition, which is what the certified CrocSwap#197/CrocSwap#205/CrocSwap#207 banks satisfy (their absorbed rank 60 does not divide 72 either), opens a bracket up to +79.52%. verify.py re-derives the sound families of both words from the queue's certificate and re-prices the first four sound rungs without using rungs.py. Generated with Codebuff Co-Authored-By: Codebuff <noreply@codebuff.com>
|
Hello all, I am very fascinated in this project but I want to disclose that I have absolutely no idea how this algorithm works or what my agent did to make progress on it. I gave codex (gpt-6-astra-xhigh) the information of this repository and an overnight I will continue to follow progress excitedly and hope to learn more about the algorithm but will forgo contributing more material that I cannot defend myself. Best of luck |
…CrocSwap#197, CrocSwap#199 Adds research/independent-reproduction-20261009/ (README, receipts.json, read-only certificate_diff.py). Replays of the submissions' own verifiers at pinned heads; no generator, certificate, test or upstream file changes; no new kappa claimed. Prepared with Claude (Anthropic) agents. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…duction report - CrocSwap#197: the bank-endpoint identity is proved on paper in PROOF.md:81-93; the finite controls (95-98) do not cover the full cover. Point to the maintainer review of CrocSwap#186's comparable removal in BANK-SCHEDULE.md. - CrocSwap#202: the 7 differing leaves derive from one lift gzip hash; CrocSwap#194's CI passed under CPython 3.13.16; CrocSwap#202 is CrocSwap#194 plus one commit and its CI has not run because of the merge conflict. Remedy cites verify_inner.py:23 and 29-30. - CI runs for CrocSwap#197 and CrocSwap#207 exist and await maintainer approval. - certificate_diff.py: usage (copy into a CrocSwap#202 checkout at 8d8d67b) and its .work/ side effect; code unchanged. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
ghost
mentioned this pull request
|
Thank you @evmckinney9. This contribution is now retained on main in the scoped 100-PR review and contributor credits. Contribution: Completed banks for PR187 bit residuals. Review and limits: Prior exact-head chart/chain/bank and finite-geometry replay; parent bit and strict complex-adapter evidence reused explicitly. Not a fresh rerun of the original combined --full command. The complete original source, notices and relevant execution evidence are retained through the pinned source archive. The review distinguishes fresh local runs, source-bound historical Linux CI and prior exact-head review; it does not claim 100 fresh full mathematical audits. Closing this historical PR as reconciled. This preserves parallel and cumulative credit without replacing the selected frontier or promoting priced research targets to completed constructions. Reviewed head: |
2 participants
Change and mathematical scope
Pack rank-4 and rank-24 scratch residuals from #187 into shared banks after each core completes. This removes 6,600 rank-60 exterior corrections across three copies. All other recursive children remain charged.
Combined with #193's complex supplier, this raises conditional κ from 0.000670450176035363 to 0.000676080316519385, a 0.8398% packing gain. The result is 1.2957% above #194's published value; that larger difference also includes supplier and arithmetic choices.
This builds on #187's bit word, #193's complex word, #185/#187's finite leaf composition, and #186's related bank construction. Exact source commits are pinned in
research/packed-source-assisted-bit/SOURCE.json.PROOF.mdgives the scratch-restoration argument, routing costs and inherited assumptions. The full multiplication theorem remains conditional.The diff adds only this package and its workflow to main. Both unmerged suppliers are loaded from separately pinned checkouts; their source files are unchanged. Setup commands are in the package README.
Validation
Passed locally: both unchanged upstream verifiers, the packing checks, two independent exact moment calculations, all 47 assembly inequalities, seven margins, and corruption controls. The reduced certificate regenerated exactly with unchanged κ.
Current main's
make entrance-bank-verifypassed with no tracked changes. Historical regression targets completed on the earlier preparation checkout after supplying Boost headers and resuming the remaining groups; this is not a claim of a fresh fullmake verifyrun on current main. The new PR workflow has not yet run.Prepared with substantial OpenAI Codex assistance. Predecessor attribution is retained; new contributions are Apache-2.0.