Adaptive typed bills with independent row choices

[aliromman]

PUBLISHED / scope released

PR6472, exact head 6621e59b773b179a0340627eadbe295eb5254d07, supplies the exact adaptive row-menu certificate. It returns the exact worst unit-toll total and an attaining fixed policy, or a legal noncontracting policy. The proof includes common weights, finite policy improvement and a geometric tail bound. Classical theory retains credit; no new kappa or physical supplier is claimed.

All 2538 small families and 12200 policies agree with an independent determinant/Cramer oracle. Normal and optimized replay, 1629 prefix bounds, 18 rejection controls, registered metadata, committed bytes/modes, official export and sealed read-only Git-free replay pass. All nine public package blobs and the rendered PR body match. Full-history preflight is unrun in this shallow checkout. Hosted planning and the registered scientific replay both passed at this exact head in run41551454128. Independent scientific acceptance remains unclaimed.

Next: bind an actual complete menu of source-compatible supplier rows, including all native, adapter, restoration and compiler costs. The examples here are synthetic. Independent row choices must be legal; a failed relaxation is not a physical impossibility theorem. Source admission, all five selected assumptions and the selected frontier remain unchanged.

Current main remains 7c49fe3, priority8/selected6030. Latest open PR bodies through6471 and live claims were read; no matching scope was found in that coverage. Ali Romman with substantial OpenAI Codex assistance; no subagents. The full attribution is in the package.

Advance claim

CLAIM / adaptive typed bills with independent row choices

Question: for a finite nonnegative rational menu of complete child-cost rows at each type, can one certify every adaptive row choice, compute the exact worst-case total with a unit toll, or exhibit a fixed legal choice that fails contraction? I will build an exact policy-iteration producer and a separate inequality checker. The expected result is a reusable certificate interface with a written proof and exhaustive small cases, not a physical supplier or a new kappa.

Base: canonical main 7c49fe3, priority revision 8, selected PR6030. This changes the independent-moment card from a single emitted-word recount to the finite adaptive recurrence contract. It can permit safe heterogeneous choices and detect an unsafe combination before expensive caller construction. Every adapter, restoration and child must already be included in each row. Correlated whole-matrix modes are a different model.

PR5785 supplies the fixed-matrix certificate; PR5892 already settles observed forcing and reachability, which will not be repeated. PR6271 treats synchronized paid switching periods, not independent row menus. Classical M-matrix, Bellman/policy iteration and independent-row-uncertainty theory retain credit, including Kozyakin, https://arxiv.org/abs/1507.00492 . No general matrix-theorem priority is claimed.

Live handoffs, recent Discussions, open PRs and targeted all-state searches were read. The full overlap cache refresh is running; sparse files, arbitrary historical diffs and unpublished work remain limits. Stop after the complete scoped result or a precise failed gate. Claim expires 2026-11-03T03:00:00Z. New work: Ali Romman with substantial OpenAI Codex assistance; no subagents. Source and native caller admission, compiler applicability, all five framework assumptions and selected-frontier changes remain outside scope.