[CubeJerry]

Result

Construct every actual selected raw direct MOVE from the exact right monomial,
positive rank-r child and left monomial, with complete-field protection and
zero ordinary numerical runtime calls. Each monomial is serialized through
its genuine one-column branch; the positive child uses the separate literal
rank-times-column view. The proof covers all 3,453 actual source occurrences,
all columns and spectators, and absolute phase, with the actual stopping
condition r*f<=the unchanged cutoff.

The domain retains exact intermediate Gaussian halves and representable
serialized signed phases. Input divisibility by 2^(rf) and strict component
bound 2^(h-rf-1) form a sufficient envelope. Final-output fit alone is not
enough, and the serial and batched monomial admission domains are not equated.
A protected whole-field stage preserves the original on the inherited named
valid-return failures, even after earlier serial columns succeeded.

The complete inventory is 479+Q_R+Q_L, including 129 descriptor ports and
the stage; the concrete q2/capacity64 constructor gives 4,235 private ports.
Both repeated monomial bills, all descriptor work, positive child, copying,
restoration, retirement, historical backing and fixed F_template remain.
The exact additional stage cost is 22V+35 on success and 13V+21 on a named
valid returned failure. The nonabsorbed M1*A1^6 and polynomial control terms
remain unless the explicit long-record/control conditions hold. No new
kappa; all five selected global assumptions remain.

Why this is new

The public rank-scaled child covered all selected positive PAIDs but its
relative MOVE retained ordinary-facing monomial premises. The public serial
monomial removed ordinary runtime within one factor but did not protect an
entire MOVE. This package joins their distinct views and source contracts,
removes that ordinary numerical/rate premise from a complete direct route,
and executes a complete actual raw selected MOVE through commit and cleanup.
It does not claim the predecessor's serial lemma, rank view, source census or
Clifford factorization algorithm as new.

Canonical base: 7c49fe32c55de02c2c873655c804b16e4c3fef0a.
Exact immediate dependencies are
all-source positive child
and
serial monomial.
The protected coordinator is retained transitively at
41b67c2.
All 171 retained files have exact public paths, blobs, hashes and modes. All
109 original serial dependencies retain identical bytes in the shared closure;
the discovery-only shim uses the exact same Count/Tape/codec/row objects.

Verification

python3 -B scripts/research_package.py --package research/current-direct-source-move

Four bounded normal/optimized gates authenticate sources, the unchanged full
2,886-chart certificate, all eight rank interfaces and freshly checked matrix
representatives. Typed-source, alias, grant, inventory and actual ordinary-entry
controls run alongside 16 administrative success/returned-failure cases.
The latter use explicitly modelled factors, not selected numerical replays.
Three saved-boundary mutations and a timeout-to-success mutation reject.

The separate authorized manual witness completed actual event13096, owner797,
frames543 to541, on all 4,096 mandatory records and 73,728 physical bits. Its
initial 580-second attempt timed out after entrance/child telemetry and is
preserved as incomplete. The one final attempt completed in 815.504 s under
1,100 s, with 5,405,590,413 literal run-call actions, all three numerical
factors, full commit and final retirement, and zero ordinary runtime entries.
The independent original-circuit oracle checks the complete endpoint. Four
actual returned stage/header packets, full logs, rolewise historical extents
and the exact executed source snapshot are retained; the registered evidence
gates recheck those bytes and bills without rerunning long numerical factors.
All private bodies are blank, heads at origins and caller ancestors preserved.

This h=2 witness uses the exact-prefix domain and is outside the stronger
input-divisibility and long-record absorption envelopes. It does not prove
those envelopes or an enclosing caller. Finite wall time is not an asymptotic
tariff. The lead separately reviewed tensor/view correctness, headroom induction,
the full repeated bill, inventory and named error returns; this is shared-context
AI review, not human or proof-kernel admission.

Limitations and open obligations

Finite closed ordinary constructors, their unused tapes and F_template remain
charged. The theorem retains inherited physical primitive and numerical
source-to-machine premises, genuine disjoint placement, the original parent
domain and valid returned extents. It excludes interruption, malformed streams
and providers violating their contracts. Materialized extents are distinguished
from visited backing, and every retired cohort remains charged historically.

The next obligations are an actual enclosing produced descriptor and typed
product/remap placement; literal lifecycle export of complete numerical
control; and global cutoff, precision, stock, long-record/control and nonleaf
admission. This raw source construction supplies neither a complete selected
caller nor an unconditional multiplication theorem or improved exponent.

Credit and assistance

Prepared for @CubeJerry. Credit the exact public dependencies above, selected
#6030, #3087,
#3091, Clear1nsight's history work
#4172, #6293,
#6901 and unpaidmoon's phase audit
#6930. All source notices remain. Substantial OpenAI
assistance supported proofs, implementation, experiments, review and documentation.