Repository navigation
Conversation
This was referenced Nov 19, 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.
This scoped theorem proves the exact cost of broadcasting one scalar along any strictly nested terminal chain, even with arbitrarily many auxiliary chart ports. For every nondecreasing concave rank tariff H with H(0)=0, the minimum is the sum of H over adjacent terminal rank gaps. This resolves the extra-chart part of PR #7790's open question. No new kappa follows.
Proof · Exact certificate · Checker · Source pins · Claim.
The information contract has one available source of an independent scalar. Every other terminal demands that scalar and has no initial information about it. Finite local linear operations, temporary storage, repeated messages and either transfer direction are allowed. Every cross-chart transfer is charged, and its endpoints must be strictly nested. Extra charts need not form a common chain. Shared broadcast, a second initial copy and joint delivery of different demands are outside this contract.
The proof relaxes each chart to its rank. Concavity permits each auxiliary vertex of a routing tree to move onto a neighbor and be contracted without increasing cost. The remaining terminal tree has minimum cost on the adjacent chain. This is an arbitrary-finite-size proof; the finite census below corroborates it.
For Clear1nsight's actual rooted binary route, chart ranks
0,4,6,7still costH(4)+H(2)+H(1). The separate owner-411 bridge, root preparation, productive targets and all other costs remain outside this comparison. No whole-supplier optimum, physical free-storage claim or source kappa recertification is made. All five assumptions and the selected frontier are unchanged.The census covers auxiliary ranks 0 through 9, including repeats. Its nine basis tariffs span every nondecreasing concave tariff on that grid. The proof covers any finite number of ports and all real ranks in the relaxation. A convex-tariff control gains from an extra port (21 to 13), while a free second copy changes the linear cost from seven to three. These examples show why the two hypotheses matter. Four rejecting controls and a disconnected-demand check pass.
Both registered CPython 3.12.16 modes pass in about 1.1 seconds each, standard library only. The unchanged 17-file source package runs first, including its actual rational chart containment, full forward/adjoint operators, independent packet expansion, root/bridge faults and dirty-retirement checks. Reuse of that suite is not a new independent implementation of its source audit. New census and contraction code is separate.
Expected markers:
AST parsing, tabnanny, whitespace, committed bytes/history/modes, official export/input checks and both serial read-only Git-free replays with an empty PATH pass. Exported hashes and modes remain unchanged. Timings show timeout headroom only. 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.Ali Romman (@aliromman), with substantial OpenAI Codex assistance, supplied the new theorem and checker. His fixed-port proof and audit supplies the source binding. Clear1nsight (@Clear1nsight) supplied PR #7786's rooted binary construction and source notice. The source is frozen at that exact commit; its live PR has since advanced. Credits preserves the full predecessor lineage. Concavity, Prufer codes and spanning-tree exchange are classical methods; no literature-wide priority is claimed.
Related PR #7750 and PR #7751 study original stock at nine different BIT deadlines, including new rational charts in the latter. Their information boundary and geometry are different, and neither theorem is consumed here. Current handoffs, fresh PRs and source/semantic searches show no observed competing claim in this scope. Cached searches are incomplete and not novelty certificates. The active rational sender-65 construction is unaffected.
The base is canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Only this research package is added. Earlier construction history, physical erasure, paired caller, ordinary compiler, finite stock, precision and outer services are not replayed. Lean and independent human/formal acceptance are unclaimed. The next useful questions change the available source information or specify a fully charged multi-value demand contract.