Repository navigation
P104: prove owned-block cost floors and public delivery obstructions (no kappa) - #5584
Merged
Mister-Meeseeks merged 2 commits intoOct 25, 2026
Conversation
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.
PR5569 leaves owned-temporary cleanup as an open route to a cheaper P104 invoice. This package proves scoped cost floors and delivery obstructions for its exact word. No new kappa or global optimality claim.
The distinct results are:
0<t<=1, even allowing arbitrary rational internal words and zero-initialized private auxiliaries. Outside side information, changed productive targets and work shared across block boundaries are excluded.The independent 5,252-case public-window census is retained as corroborating source validation. Submission refresh found that Ali Romman had already published the same domain and separator mechanism in PR5579; we do not claim that overlap as novel. Discussion5575's compensated source substitution changes dependencies and remains outside these obstructions. PR5580's new contact gain does not contradict them; our finite certificates are pinned to PR5569, not automatically asserted for its descendant.
Review starts at
research/p104-owned-cleanup-obstruction/README.md; the separatePROOF-*.mdfiles state each model, proof and limitation.RESULT.jsoncontains exact covectors, nonzero minors, boundary ranks, window examples, witness hashes and semantic controls. Further progress must change the excluded dependencies/boundaries or produce a fully charged shared itinerary. Merely adding partners or coefficients to the tested common-chart mechanisms cannot help.Validation on Windows / CPython 3.12.14:
All pass. Direct replay takes about four seconds, uses only the standard library, checks all 743 source scalar endpoints, and includes positive fixtures, 15 corruption controls and additional omitted-delivery/scope controls. An independent agent implemented the window census separately; independent agents reviewed the new proofs, boundary ranks and inverse-covector argument. These are author checks, not independent human acceptance. The official committed export also passes isolated optimized replay with read-only files, empty PATH, no Git, and unchanged hashes. The original PR5569 complete native/caller/funding verifier passed unchanged before this analysis; this small package does not repeat or claim a new complete bound. Hosted CI is pending publication.
Base canonical main:
5e0052ca0aa3036a3afa8b0438927377c8d97d53. Source: PR5569 headaf9f091ac6f30c6eaacb9c27777bfbe2d0e5ffdf. Two unchanged compressed words are retained with hashes and attribution in a first commit; standard source pins refer to that ancestor in this publication's own history. This avoids relying on unmerged commits present only in a local object cache. Submission overlap coverage was the 100 most recently updated open PRs plus relevant public Discussion pages, not an exhaustive novelty claim.Prepared for flyingviper with substantial OpenAI Codex assistance and independent research/review agents. Credit Joel Pulikkan/GamingPuzzled (#5569, #5472), DreamingOfClouds (#5561, #5553), thu-nmrc (#5551), Ali Romman (#5544/#5545 and concurrent #5579), and the retained Gareth Davidson, David Arias, Cinna Davis, zxv, Cao Yifan and earlier P104 lineage. Primary literature consulted is documented separately, without importing its cost model. Apache-2.0. Selected frontier and predecessor files remain unchanged.