[aliromman]

This conditional construction raises the ordinary BIT saving from 0.0034363538396 to 0.0034441226396 at matched compiler and cover parameters, and admits the strict endpoint 0.00344412. It does not raise the complete multiplication κ: the complex supplier still binds. The current selected κ remains 0.003027288235; no selected file changes.

The proof, exact receipt, emitted word, and source pins are fixed at the reviewed head.

Nine initial helper relations make all nine COPY values in the reverse PR589 word zero. Each local call removes nine H1 jobs and nine H7 jobs, with all nine H8 helper targets debited. All 652 retained inputs remain independent. The ten owned fields accept arbitrary entry data and finish at zero. An exact physical involution, including each port's address maps, permits the reverse word at all eighteen full controller calls.

The complete p16/a7 invoice changes by −162 H1 −162 H7 paid jobs and −162 H8 targets. It has 57,231 paid jobs and 11,292 productive fields; the rank surplus remains 753. The raw moment crossing is strictly between 0.003472070044 and 0.003472070045. The same compiler gaps, cover loss and atom fraction give the matched ordinary gain 0.0000077688. All 1,568 added pointwise records per call are charged; the complete raw nonrecursive allowance is 19,170,192, below 10^9.

The branch starts at main d277c97824e50782da6adbc486ca3c76c8fc687e. All thirteen consumed inputs remain byte-identical on submission main 1a3ced60b2f7a46bc70280a04f2eeb8ca027c700. The source record in SOURCES.json is historical provenance. This work follows the scoped claim and does not take the active coupled complex caller.

Verification and limits

CPython 3.12.14, standard library only:

python3.12 -B scripts/research_package.py --package research/bit-nine-owned-relations
python3.12 -O -B research/bit-nine-owned-relations/verify.py

Expected scientific result:

PASS_BIT_NINE_OWNED_RELATIONS_00344412_NO_NEW_MULTIPLICATION_KAPPA

Normal and optimized direct replays pass. The checks rebuild the relations and word; verify all symbolic rows and all 662 separate Boolean input columns; check rational projectors and 111 fresh port charts; replay the literal controller; and verify both complete invoices, two exact moment engines, the compiler tail, cover loss, ordinary conversion and unchanged outer arithmetic. Semantic controls reject missing entry/exit clears, a changed relation, an unearned zero move, missing target debit and the old word at the new saving. A changed external source is also rejected with assertions disabled.

The committed-byte check and official 23-file export pass. Both direct modes pass in the read-only Git-free export, preserving all 24 files including the export receipt. The registered runner passes both declared commands and all metadata/source checks. The hosted planning job failed CurrentCiNavigationTests.test_current_ci_section_matches_selected_record: the current CI guide still names make frontier4610-verify, while the selected record names make frontier5413-verify. The same failure is reproduced from byte-exact main 1a3ced60b2f7a46bc70280a04f2eeb8ca027c700 inputs. Hosted package replay was skipped. The local scientific and export checks above pass; no hosted scientific pass is claimed.

Native all-column, owned-erasure, compiler, precision/tape and analytic-recovery premises remain conditional. The delayed-cover bridge supplies the inherited common-weight interface. The full GL cover, winning uniform word and complete multiplier are not materialized. No Lean, proof-kernel check, optional full-history audit or independent replay of the consumed complex construction was run. This is a BIT component improvement, not a global optimum or a new multiplication bound.

Credit

@DreamingOfClouds supplied the retained two-transport word in PR #589. @eumemic supplied the punctured 111-port/439-helper construction in PR #555, with the earlier word and port lineage credited there. Cinna Davis, @1337isnot1337, supplied the query-thinned controller and native proof and the cover bridge. The compiler source retains @zxv and the mixed-target recursion of Jacob Alan Sussman. Contributor evidence records these identities and source roles.

Ali Romman's PR #5383 supplies the prior owned-helper method. PR #5398 supplies the unchanged complex comparison and its outer receipt; only its outer arithmetic is rerun here. All predecessor notices remain unchanged. Prepared by Ali Romman with substantial OpenAI Codex assistance; no subagents. New work is Apache-2.0.