[ToikY]

Change and mathematical scope

On the exact eight-port #7001 BIT retag, no retained strict subchart supplies the required row for any of the 35 adjusted deliveries, even if every earlier row can be cached for free until the deadline. The exact 973 chart cases consist of 79 empty, 512 explicit duals, and 382 covered by 24 recipient-wide duals. Zero paid credit. At the raw trial 0.004008162992724 the eight-port retag remains about 4.923875093080274 over its conditional allowance per changed native call. NO VERIFIED GAIN in κ. The independently replayed complete comparator remains #7161 at 0.003644890067940.

Task and overlap

Refines the bit-helper-contract task at canonical base e545235. The selected record remains unchanged. #7177 supplies the formal QUERY deletion and leaves the physical provider open. #7198 constructs cache for a common scalar query stream. This result concerns availability of a literal retained row in a strict BIT address chart. #7188/#7190 cover different paired IDLE mechanisms. The separate navigation commit reuses #7161's already replayed CI documentation.

Validation

From a clean checkout with CPython 3.12 and assertions, run:

python3.12 -B scripts/research_package.py --package research/bit-strict-prefix-envelope

Three canonical #7001 inputs are pinned by path, Git blob and SHA-256. The standalone replay checks the original and retagged 659-column normalized endpoints, exact chart nesting, 237 owned peak and erasures, all duals and both paid invoices. An independent chronological check reproduces the scope and directed price. Corrupting one dual or duplicating a case key is rejected. Local registered replay, all 12 byte/mode/source-history checks and six navigation tests passed. Hosted checks are pending at submission.

Credit

CubeJerry #7001 supplies the native word, caller and arithmetic. Credit #6726/#6834/#6980 and delayed-cover authors for the native/projector lineage, #7177 for the formal QUERY change, and earlier #7111 rounds for the eight-port retag and quiet-window bounds. OpenAI Codex and subagents materially assisted the proof, implementation and independent replay.

Open next questions

A changed mechanism needs a new cache row or a changed physical transport. Start with one explicit paid nonnested or oblique donor and charge formation, routing and restoration before testing its arbitrary-input signed action. The 103 other ports, physical multi-chart synthesis, compiler, precision/tape and full application remain open.