HvdH machine lemma Rsp.dWP_wspec (Building the `S` weight table and the step table)

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

theorem NLogN.Rsp.dWP_wspec (s0 : IState HS) (s t Bq : ℕ) (LS LT : List Item) (ht : 0 < t)
    (hS : s0.G TS = .int (s : ℤ) :: LS) (hT : s0.G NLogN.Rsp.TT = .int (t : ℤ) :: LT)
    (hBq : (s + t + 2) ^ 2 < 2 ^ Bq) :
    WSpec dWP BD TCI TCK s0 1 t (dWf s t) (40 * 10 ^ 7 * (Bq + 2) ^ 2)

Context. The lemma belongs to the part Building the S weight table and the step table: sTabP pushes ints (sTab p s t α).flatten on BW; sDelP pushes ints (sDel s t) on BD. Scalar parameters (registers): TP = p, TS = s, TT = t, TM = m = sWidth p α, TBe = betaT p α, TK2 = α² t², TRI = 2m+1; counters TCI, TCK.

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|$.