[jmbarrancoml]

I give an explicit control compiler and a root-independent nonchild-work bound for the pending selected BIT caller. This addresses the physical-charge handoff from PR2289/2295. Under the retained complete-stream payload and parking contracts, I derive one C_q V(n+w) bound across the allowed root contexts.

For w=ceil(e^(17/10000)), the shared Good/FallbackPair evaluator visits at most 8e^2 nodes per weight. Fixed-size matrix arithmetic and sequential access to local controls give a preparation allowance O_q(w^1800). The all-integer bound w^1800/q^(w-1) <= 2^1800*1800! absorbs this allowance into both body and high-header fibres, including width one. The compiler keeps arbitrary spectator counters outside ancestry scans. It replaces flattened-prefix address decoding with separate active-source and spectator counters.

The implementation uses an iterative stack and charged sequential reads of frozen preparation tables. After a unit reset it retains global field slots. Tests exercise Good→unit reset→Good/Pair, varying dead and live controls, complete small body fibres and stale binding/capture faults. The code tests prepared unit tables; it does not rerun the full selected matrix producers or dispatch the entire recursive payload.

The registered Python 3.12 normal and optimized replays check 82 generated coordinates, full binary request trees through depth10, 2,916 complete body records and 82,680 header fibres. The control model counts 8,775,744 bit reads and 34,737,024 head moves in its main evaluator cases; those counts are not Python timing or a full Turing-machine runtime measurement.

python3.12 scripts/research_package.py --package research/selected-control-uniformity

Review PROOF.md sections3–6 for the polynomial envelope, all-width absorption, spectator-counter restriction and parking boundary. I retain the complete physical caller and payload primitives as named dependencies. I claim no new recurrence, moment, exponent, Lean instantiation or full selected-machine verification. The next step is a joined full-ring-preparation/control/payload implementation.

Coordination: Discussion2304. I started from canonical main 0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4, and refreshed it before submission. The final text search covered 526 open PRs, 1,019 Discussions and 1,538 local records with complete remote pagination and no warnings. I inspected the relevant formal handoff comments; arbitrary code diffs remain outside coverage. TASK.json records remaining questions, and SOURCES.json pins the referenced interfaces.

Jose Manuel (jmbarrancoml), with substantial OpenAI Codex assistance. I retain credit for commdata2338's descriptor grammar and parking boundary, Ross Richardson's fallback algebra, the selected supplier lineage, the existing stream constructions, and Gareth Davidson's formal results and handoff. I claim no independent human verification.