We are publishing an update to OpenAI problem #109 (integer multiplication) with further tightening.
κ = 2⁻³⁴ (tightened from κ = 2⁻¹⁸²)
The exact witness is 8.3 × 10⁻¹¹, a roughly 48 million fold improvement over the previous result and a 2¹⁴⁸ fold improvement over original OAI result.
The improvement came from removing the spacing penalty behind the quadratic bottleneck. This was done by moving compact control bits instead of entire windows.