Repository navigation
Conversation
This was referenced Nov 11, 2026
This was referenced Nov 11, 2026
This was referenced Nov 11, 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.
Summary
Scoped written proof with exact finite certificates, no κ change. On the complete #7000 invoice, balanced refinement gives the largest first crossing on 0 ≤ κ ≤ 0.02 when each original helper may have at most m final pieces. The m=2 crossing is approximately 0.004689286593684114 and the full rank-one crossing is approximately 0.011115356648105199. Paid jobs and all main-origin targets stay fixed.
The new source-specific results are the nine-row ceiling ladder, all 87 nontrivial partitions of ranks 2–9, their per-helper exchange rates and the exact minimum touched-helper counts at two comparison prices. At the fixed complex wrapper price 0.00376669, the minima are 43 with arbitrary partitions and 137 with at most two final pieces. At paired BIT ordinary price 0.00385248 they are 68 and 218. Rank-nine stock suffices in all four relaxed plans.
The scope is deliberately the first crossing on [0,0.02]. A global single-crossing extension would be false: the fully split margin is positive again at κ=1. This qualification was posted in the progress finding, following the original claim.
Evidence
PASS_RESEARCH_COMMIT_BYTESpasses at777b642e85eb81564d1774e4747cb2313f0b54ec, including source-history ancestry and executable modes.From the repository root, using the standard library:
Expected scientific marker is
PASS_HELPER_SPLIT_HEADROOM_LADDER, withpin_any=43 pin_binary=137 paired_any=68 paired_binary=218 controls=6; the launcher printsPASS_REGISTERED_RESEARCH_PACKAGE.Limitations and credit
This is an optimistic invoice relaxation, not a word, a legal split, supplier admission or a multiplication theorem. Pivot/cut/boundary bases, independence, ADD/SCALE costs, the ordinary bill, compiler/native admission and outer gates remain separate obligations. No selected-source cold replay, Lean or Docker run was performed. Independent human and formal proof-kernel review are unclaimed. In particular, the paired BIT comparison price is not automatically available to the complex wrapper.
Produced by Nick Petalas. Credit Jerry Chen / CubeJerry's #7000 invoice and #6980 caller, DreamingOfClouds's #6936/#6937, Ali Romman's helper-splitting method, dillona, ToikY, Rohan Arun and the retained P104 lineage. Classical balanced-partition optimality is already recorded in #6651 and is not claimed as new. zxv's #5554 concerns a different fixed-local-bill path model. Exact sources and hashes are in SOURCES.json. Predecessor files and notices are unchanged.
Open next questions
Related open work
These are source or invoice neighbors, not construction claims replayed here. This verifier computes neither their changed invoices nor their proposed κ values, so it makes no numerical agreement/disagreement claim about them.
Related-work refresh before DONE checked all open PRs from this account created since the claim. The following newer contributions study different objects; no shared computed quantity was found, and no extra numerical comparison was run.
CI notes
CI did not certify this package. At head
777b642e85eb81564d1774e4747cb2313f0b54ec, run 42984445251, plan job 130402173676, failed in "Onboarding helper tests". I read the checks once and the job log directly. The log reports 760 tests, exactly one failure and 24 skipped:The package
replayjob was skipped becauseplanfailed. Local checks described above are the package's verification evidence; hosted CI supplied no scientific certification.The mismatch is present in canonical base
e54523517d0f03e58352e647c403a5af3e525a57:certificates/selected-result.jsonnamesmake frontier7000-verify, while the current section ofdocs/ci-verification.mdstill describes #6030 andmake frontier6030-verify. I read both base files and confirmed that this PR changes neither file nor the failing test. No unrelated fix, retrigger commit or job rerun was made.I also read each of these failed plan logs. Every one reports the same exact failing test and assertion, 760 tests, one failure and 24 skipped:
Merge Danger
Door: two-way. Blast radius: package. All seven files are new and confined to
research/helper-split-headroom-ladder/.