Skip to content

feat(research): price escape from refined P104 intervals - #2148

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
petalas:research/p104-refinement-rank-budget
Oct 15, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
petalas:research/p104-refinement-rank-budget

Conversation

@petalas

@petalas petalas commented Oct 14, 2026

Copy link
Copy Markdown
Contributor

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.

56 independent R-side source arrays
8 original entering array positions + at most B added positions
B >= 48
retained no-credit mass >= 60,840 / 60,736 = 585/584 > 1

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 main 0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Canonical claim and status.

Evidence

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.

@Mister-Meeseeks
Mister-Meeseeks merged commit 6bd33bc into CrocSwap:main Oct 15, 2026
31 of 61 checks passed
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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants