Integer multiplication below n log n

{"summary":"This preprint signals a theoretical breakthrough in integer multiplication, showing a path below the long-standing \(n \log n\) complexity bound. For CIOs and technology leaders, the immediate business impact is not a direct product change, but a potential long-term shift in the performance ceiling of systems that depend on large-scale arithmetic, cryptography, scientific computing, and advanced AI workloads. Strategically, it reinforces how foundational algorithmic advances can even