A research draft claims a stronger sub-n log n multiplication bound
A research draft claims a stronger sub-n log n integer-multiplication bound, with exponent saving kappa = 8.3 x 10^-11, giving researchers written proofs and reproducible checks to inspect rather than an opaque model output. Its construction moves compact control fields instead of whole spaced windows, removing a K^tau movement-cost factor. The result is not independently reviewed or fully formalized, and it assumes the upstream multiplication theorem.