Repository navigation
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.
A fixed-matrix test does not check every legal combination of supplier rows. This adds an exact producer and independent checker for finite nonnegative rational row menus. It returns either the exact worst unit-toll bill under all adaptive choices, with an attaining stationary policy and a common contraction bound, or a specific legal policy with a noncontraction witness.
The proof covers finite policy improvement and geometric tail bounds. The usable example has exact total (5,3) despite a row sum above one. A separate control catches an unsafe combination of two individually nilpotent modes. This is a scoped certificate implementation, with classical M-matrix, Bellman and independent-row-uncertainty theory credited. No general theorem priority or new kappa is claimed.
Normal and optimized CPython 3.12.13 checks agree on 2,538 families, all 12,200 policies, 1,629 prefix bounds and 18 rejection controls. An independent determinant/Cramer oracle checks the decisions and exact totals. Registered metadata, committed bytes/modes, official export integrity and read-only Git-free normal/optimized replay pass. See validation. Full-history preflight was not run in this shallow checkout. Both hosted checks, planning and the registered scientific replay, passed at this exact head in run 41551454128. CI certifies the bounded replay, not independent scientific acceptance.
Only
research/adaptive-row-bill/is added. Each row must already include every child, adapter and restoration charge, and row choices must be independently legal. No current physical supplier menu is bound here. Selected compiler applicability, native realization, all five selected assumptions and independent human review remain open. The default producer budget is 4,096 policy solves; exhaustion emits no certificate.Advance claim. Canonical base
7c49fe32c55de02c2c873655c804b16e4c3fef0a, priority 8, selected PR6030; submission refresh unchanged. Related work: PR5785 is the fixed-matrix interface; PR5892 already covers observed forcing and reachability; PR6271 treats synchronized paid switching. New PRs through #6466 and live Discussion claims concern other contracts. Sparse and unpublished work remain coverage limits.Prepared for Ali Romman with substantial OpenAI Codex assistance; no subagents. Credit Nick Petalas, David Ganz / Dugongue, Jose Manuel, the retained typed-recursion lineage and Kozyakin's classical theory. No predecessor scientific result is counted again. No merge, closure or selected-frontier change.
Verified head:
6621e59b773b179a0340627eadbe295eb5254d07.