Five-speed integer lift and complete bounded-map candidates

These files are candidates. The full five-speed classification is unfinished. No accepted root imports these new files.

Existing checked finite prototypes

At commit cd5608a5a97ee2aad2924ee99074f217360f2e50, hosted tasks bounded-map024 and bounded-map063 each passed source compilation of their 46-module dependency closure, the transitive axiom audit, and independent stock-kernel replay of every local module. The repaired bounded core passed the same gates for its 39-module closure. The associated source and artifact hashes are recorded in the workflow artifacts.

The complete 164-map catalogue now has a generated certificate module for each map. BoundedMaps combines their conclusions and converts the positive first integer parameter to the natural-parameter interface. The new bounded-maps task checks this entire closure. The two prototype passes do not by themselves establish the other 162 certificates or this aggregate.

Integer root lift

The six RootInteger modules convert modular root covers into an actual integer relation. They bound a product of 111 factors, use the product of distinct primes to force a zero integer factor, and recover either two distinct rows of the literal relation catalogue or a permuted positive {x,3*x,4*x} triple. The hypotheses still require a root cover at every chosen prime and the explicit prime-product inequality.

All six integer-lifting sources passed local warning-as-error compilation. The repaired final lift uses the frozen v2 source. The root-integer task checks all 29 modules in its closure, including every transitive project theorem and independent kernel replay.

PrimeData records the 230 root primes and 574 plane/prime pairs. PrimeProducts supplies the proposed numerical product inequalities at coordinate bound 279841. Its dedicated hosted task is the first complete gate for these literal data and proofs.

Assembly interfaces

FiniteAssembly proves the exact reduction from bounded-root coverage, canonical-plane coverage, and bounded-map coverage to sporadic exhaustion, assuming the four-speed gap. The gap is already an accepted unconditional theorem. RootReduction converts the integer-root outcome to the canonical representation required by the assembly. Both sources remain candidates; the finite-assembly task checks their complete dependency closure.

The missing concrete input is still complete root coverage across 230 primes. The plane certificates are being generated and checked separately. Three isolated root-block probes measure the guarded bit-search implementation at small and large primes; they do not claim a full root cover.

Every hosted task recompiles its local dependency closure, checks owned theorems against the standard three-axiom whitelist, and replays every local module using the unmodified pinned kernel checker. Generation and source compilation alone are not recorded as full verification.