KappaBound (2⁻¹⁸²) from the machine alone

KappaBound (2⁻¹⁸²) from the machine alone. With the explicit parameters of §9.2 and n₀ = 2^{2^{2^{132}}}, the only remaining hypotheses concern the multitape machine: it is correct for every n ≥ 1, and for n ≥ n₀ it runs in time C₀ (V(n) · Ncost(p, d, K, ℓ, α) + n) (Table 1 normalized cost).

The following holds (Lean statement, in the scope of module Solutions.GlueParams):

theorem IntMul.OpenAI.Glue.kappaBound_of_machine (M : IntMul.MultitapeTM)
    (hcorr : ∀ n : ℕ, 1 ≤ n → ∃ T : ℝ, IntMul.MultipliesAt M n T)
    (C₀ : ℝ) (hC₀ : 0 ≤ C₀)
    (htime : ∀ n, n0 ≤ n → IntMul.MultipliesAt M n
      (C₀ * (VP n * Ncost (6 * (IntMul.lg n : ℝ)) (dP n) (KP n) (ℓP n) (αP n) + n))) :
    IntMul.KappaBound (1 / 2 ^ 182)

Context. The lemma belongs to the part Glue 3: explicit parameters n ↦ (b, L, T, d, K, ℓ, α, p) of §9.2 and the threshold n₀: For an input length n (§9.2.1):

• b = lg n (bP), p = 6b (pP), d = ⌊b^ε⌋ (dP), K = ⌊d^c⌋ (KP), α = ⌈(12 d² b)^{1/4}⌉ (αP);
• L (LP) = the least L with 4n ≤ 2^L b, T = 2^L (TP), so 4n ≤ T b < 8n;
• ℓ = ⌈L/d⌉ (ℓP, RP.ell), r = 2^ℓ (rP), bit volume V = T p (VP), γ = 2dα² (γP).

Formalization Note. This lemma belongs to the Lean formalization (integer-multiplication-kappa campaign) of the OpenAI preprint Integer multiplication below $n\log n$: the array model of tape data (mixed-radix arrays and pull maps), the interchange networks of §3–4 (Propositions 7, 8, 11, Lemmas 9–12), the butterfly layers of §5 (Lemma 13, Proposition 14), the synthesis of §6–7 (Lemma 16, Proposition 18), the resampling and parameter choices of §8–9, and the final glue IntMul.OpenAI.Glue.kappaBound_of_machine, which derives the platform bound KappaBound (1/2^182) (from Def_IntMul_MultitapeModel) for any correct multitape machine meeting the paper's time recurrence. All names refer to the definition bundles IntMul_Kappa_K_Defs1–IntMul_Kappa_K_Defs9.