Repository navigation
Prove a zero-to-D helper-split rank bill is maximized at an endpoint - #285
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
The contact-free rank bill is convex on a zero-to-D boundary, so dimensions 0 and D are ordinary endpoint cases. Selected kappa is unchanged. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
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
Prove that a contact-free helper split on a boundary from the zero subspace to a
D-dimensional space has a convex rank bill. Form ≥ 1paths and any exponent0 < t < 1, the maximum ofon every closed feasible interval
[A, B]ismax(G(A), G(B)). The identity includesA = 0andB = D. An interior dimension, including a join or meet of three or four paths, cannot raise the bill. Whenm ≥ 2, or when the single path is not the full span(0, D), every interior dimension is strictly below that maximum. The one-path full span is constant. Under the single-leg chargec = (b-a)^t, the endpoint values arek(a)andk(b), andk(u) > 0foru ∈ (0, D).This is a proof under those hypotheses. The program adds an exhaustive finite census at
t = 1/2on the integer domains named below. A positiveGis a rank-bill signal. It is not a legal cut, not a paid-profile improvement, and not a change in the selected exponent. Selected κ stays363005817/100000000000.Remaining obligations: a proper helper boundary whose terminal lies strictly between
0andD; the actual chargesc_ion the published 68-split word; legality, ownership and the complete invoice.Task and overlap
Base commit
e54523517d0f03e58352e647c403a5af3e525a57. Priority revision 8. Cardp104-side-correction, scope changed: the card asks whether a legal causal split improves the complete invoice, and this package only closes the endpoint case of the rank bill inresearch/p104-shared-native-helper-splits/EXPLORATION.md.Session r271, item 4 of the ordered eligible list. Three open handoffs remain ahead of it (seven-call signed frames, comment 19377832; eight-source singleton, comment 19537798; six-source
c = 7, comment 19537594). Conditional-κ review requests whose canonical artifact is an open pull request, including CrocSwap#7148, CrocSwap#7158, CrocSwap#7161 and CrocSwap#7244, are outside the list.On 2026-11-11,
scripts/find_overlap.pyrefreshed 566 open upstream PR records and 7234 discussion records with complete pagination. The phrasescontact-free transportandendpoint rank billhad no matches. Closed work was searched through local notes and ledgers only. That report is a lead, not a novelty certificate. The predecessor exploration states convexity and leaves an extremum at0orDas a separate integer case. This proof shows that case is the same endpoint comparison.Validation
Python 3.12, standard library only, from the repository root:
Author-run marker:
The census domains are complete for what they claim: every
1 ≤ D ≤ 12and every one-path window; every ordered pair of windows for1 ≤ D ≤ 6; everyu^swiths = 2q-p,2 ≤ q ≤ 5,1 ≤ p < qand1 ≤ u ≤ v ≤ 40. Signs of square-root sums usemath.isqrtwith a strict error bound. Failure controls reject a reversed power comparison, a forged interior win, and a dropped0^t = 0convention.make frontier7000-verify, Lean, Docker and the 68-split discovery screens were not run.EXPLORATION.mdis cited and is not a live verifier input.Credit
The rank-bill formula and the open endpoint sentence are from @CubeJerry's shared-native helper-split exploration, on the shared two-chain word from DreamingOfClouds in CrocSwap#6902. The basis-splitting lineage is Ali Romman's CrocSwap#5599. Retained native and compiler authors of that construction stay credited there. Prepared by unpaidmoon with substantial Cursor Grok assistance. No formal-kernel review and no independent human review are claimed. New work is Apache-2.0.
Open next questions
0andD? The curvature comparison uses both helper legs against the full dimensionD. First step: one proper terminal and one path whose upper end passes it.G(A)andG(B)from the pinned witnesses, without a new geometry search. That payload is outside this package. A positive rank bill would still leave legality and the paid profile open.Workflow feedback (optional)
CrocSwap#1200