Repository navigation
feat(research): price escape from refined P104 intervals - #2148
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 2026
Merged
Conversation
This was referenced Oct 14, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 15, 2026
Machine-checks the chronological step behind the P104 transport floors of PR #2127 and #2148, as requested in PR #2163's handoff. In an inductive linear execution grammar (source-independent initialization; free same-side work, storage and return traffic; one D-valued message per counted receive), every target-side state factors through a transcript of n whole arrays, so its source dependence has rank at most n*dim D and recovering m independent arrays needs m <= n. The 96-transport and 48-rank floors follow as conditional corollaries. Lean 4.21.0 with pinned Mathlib: 13 theorem roots audited to the standard axioms only, 8 rejected formal controls. A Python binder reconstructs the PR #1972 witness and regenerates SourceCut.lean's finite facts, which the kernel checks by decide. The native-event-to-model translation stays written; no supplier or kappa change. Adds research/lean-transport-cut/ and its path-filtered workflow .github/workflows/lean-transport-cut.yml. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
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
Extend PR #2136's survivor separator to a quantitative obstruction for added paid rank, while allowing arbitrary nested subdivision of all retained P104 transport obligations.
Only
research/p104-refinement-rank-budget/is added. It contains the scoped proof, source-bound verifier, complete receipt, nine tests and an opt-in replay hook. The scientific base is canonical main0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Canonical claim and status.Evidence
B >= 48with arbitrary nested refinements, added transports and source-independent storage. The exact no-progress-credit screen from PR Prove sharp P104 temporal rank bound and correction-budget obstruction #2082 then fails at zero saving. A changed coverage proof must credit more than104/9ranks per call even at the minimum added cost.-O; all five semantic rejection controls and nine CLI/export tests pass. The nine tests also pass under-O. Separately, all 65 repository research workflow tests pass. A separate CPython 3.13.5 optimized replay agrees. Environment: Linux x86_64, standard library only.python3.12 scripts/research_package.py --package research/p104-refinement-rank-budget python3.12 -I -O -X dev -W error -B research/p104-refinement-rank-budget/test_verify.py python3.12 -B -m unittest discover -s tests -p 'test_research_*.py'The new contribution is the added-rank implication and budget decision, not a new separator. Credit Tairitsu-Aya/PR #2136, Ross Richardson/PR #2127, David Arias/PR #2082 and the earlier cuts; Rohan Arun/PR #1972, Chafik Boukhalfa/PR #1991 and their geometry/native/coverage predecessors remain credited in the README. Exact heads and source hashes are recorded.
Merge Danger
Door: two-way.
Blast Radius: research.
This is an author-checked scoped proof and finite premise check, not a supplier or exponent improvement. It retains original obligations without removal, fusion or branching. Its moment conclusion assumes the explicit no-progress-credit coverage contract. Changed producers, replacement paths and justified coverage credit remain open; Discussion #2131 and PR #2139 are not excluded.
Native phases, the original scalar endpoint, chronological hosting, precision/tape, all-size admission and the full selected cold replay were not rerun. The transcript proof is not formal-kernel verified or independently human-reviewed. The selected record and frozen evidence are unchanged. Live overlap was refreshed before submission; exact coverage and its limits are in
TASK.json.