HvdH machine lemma Rsp.ptP_run (The `bapL` slice program)

The following holds (Lean statement, in the scope of module NLogN.HRspBap):

theorem NLogN.Rsp.ptP_run (s t kb : ℕ) (ht : 0 < t) (hco : Nat.Coprime s t) (hkb : t ≤ 2 ^ kb)
    (V : List (ℤ × ℤ)) (hV : V.length = t) (τ : IState HS) (RU : List Item)
    (hU : τ.G CU = gints V ++ RU) (h1 : ∃ L, τ.G 1 = .int (t : ℤ) :: L)
    (h2 : ∃ L, τ.G 2 = .int (kb : ℤ) :: L) (h3 : ∃ R, τ.G 3 = natInts (ptKeys s t) ++ R) (B : ℕ)
    (hB : ∀ z ∈ V, zsz z.1 ≤ B ∧ zsz z.2 ≤ B) :
    ptP.ok τ ∧ ptP.run τ = τ.upd CU (gints (ptL s t V) ++ RU) ∧
      ptP.cost τ ≤ 10 ^ 6 * (kb + 1) * (t + 1) * (2 + 1) * (B + kb + 2 + 4)

Context. The lemma belongs to the part The bapL slice program: bapP = P̃_s⁻¹ ∘ D̃' ∘ J̃' ∘ C̃ ∘ P̃_t on the slice stack CU:

• P̃_t, P̃_s⁻¹: permP 2 relocated (stack 0 ↔ CU, key stack 3 ↔ KS);
• C̃: a gresP stage with one all-ones weight row (tables relocated BW ↔ W1, BD ↔ D1);
• J̃': JP (the E parameters / tables are the native ones);
• D̃': a gresP stage with the diagonal table (relocated BW ↔ W3).

Formalization Note. This is a lemma of the Lean development NLogN, a multitape-Turing-machine implementation of the Harvey–van der Hoeven $O(n\log n)$ integer multiplication algorithm, used in the proof of NLogN.FIN.theorem_1_1_nlogn : IntMul.MulTimeBound fun n => n * Real.log n. All names refer to the definition bundles IntMul_HvdH_M_Defs1–IntMul_HvdH_M_Defs8 (namespace NLogN), built on the platform model Def_IntMul_MultitapeModel and the published reference Def_IntMul_HvdH_MachineRef. The machine layer: IState HS is a state of 64 item stacks; RM programs have a semantics p.run s, a definedness predicate p.ok M s and a cost p.cost M s relative to a multiplication spec M : MulSpec; zsz z is the bit length of $|z|$.