[JosieElliston]

Planning screen: certified decoder copy budgets for the plane-port coverage law (no new κ)

Card: coverage-law-change (recursive-interfaces track, seed fba49a70…), scope refined. CLAIM. Base 0b1cccf8. Adds only research/plane-port-copy-budgets/ (stdlib, about 17 s).

ctoth's FINDING in 1587 shows a plane-port contract leaves two unpaid coordinates per family. Its first-order break-even is a decoder copy charge C < 1472/9 ≈ 163.6 per call, with the word unchanged and on the complex side only. This package prices it exactly on both suppliers. It imports the predecessors' engines unchanged and hash-pinned: complex complex-local-word-ceiling/ceiling.py, and bit bit-revision3-levers-seed03/levers.py with the PR589 word.

Results

Largest per-call copy charge, as sharp integers (k passes, k + 1 fails, both certified). Each range runs from word unchanged (pessimistic) to the data shrink taken as rank-1 removals (favorable). Bit is at cap 45.

side	copy rank	tie incumbent ceiling	+10% κ	a = 1/99
complex	1	162–164	159–160	none
complex	8	160	152–160	none
bit	1	160–162	162–164	11–20
bit	8	160	160	8–16

• The first-order 163.6 is confirmed to within 4 units on both sides. The data shrink (8 → 7 complex, 7 → 6 bit) is worth at most 2 units at the tie. Each unit of charge near 160 is worth about 3% κ.
• On the complex side, plane ports alone cannot reach a = 1/99, even with a free decoder. The C = 0 ceiling is 0.009410–0.009821. The rest of the complex word has to change too.
• On the bit side, 1/99 needs C ≤ 7–22. ctoth's naive realization (112 rank-2 queries, C = 224) fails every target.
• Scope: a fail rules out every construction under the premises; a pass is only a necessary target. The relaxation assumes ideal idle packing, the shipped non-data children kept, one copy rank and the predecessors' caps. The bit relaxation already passes +10% with the shipped word: its ceiling isn't tight, and PR1791 measures the actual histogram.

Checks

• verify.py reproduces both incumbent ceilings (complex 0.001690054, bit 0.001955918756) and the per-call masses (complex idle 1646, bit local 5129).
• Every budget's sharpness is checked, plus line-law controls.
• RESULT.json matches byte for byte. The script refuses -O.
• It passes on 3.10 and 3.12. research_package.py --check-only and the registered 3.12 replay pass, and the 42 research unit tests pass.
• An independent float spot-check of the complex tie (162 | 163 and 164 | 165) agrees.

Not established

• Any plane-port decoder or decoder floor (@philippeVV's halves in 1587).
• The plane-port bit template, admission, hosting and precision.
• ctoth's small-instance exactness check was not rerun.

Open next questions

Both are in the README and TASK.json:

1. Is there a plane-port decoder with C ≤ 160 per call?
2. Which complex word change, combined with plane ports, reaches 1/99?

Credit

• ctoth's 1587 team: the plane-port contract, the break-even and the naive realization.
• Douglas Colkitt: the complex ceiling.
• The bit-revision3-levers-seed03 authors: the bit model.
• PR1012: the coverage identity.
• @philippeVV: the decoder halves.

Claude Code (Claude Opus 5.5) for JosieElliston, one donated session, no subagents, no independent human review. Apache-2.0.

🤖 Generated with Claude Code

[Mister-Meeseeks]

Batch review at b3d9b9813e0f2e82d8379cd4dafa2a355a900a44.

Merged to main, preserving the original contributor commits and package attribution.

Reviewed scope: Certified single-rank decoder copy budgets under explicit plane-port and unchanged-other-child relaxations, with favorable/pessimistic data-shrink brackets. Exact integer budget boundaries pass. Complex free-decoder relaxation still misses1/99; neither plane-port primitive nor new kappa established.

The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions.

Batch review, attribution and evidence. Thank you for the contribution.