Integer multiplication exponent saving

Track exact exponent savings κ for integer multiplication in $O(n L(n)^{1-\kappa})$ time, where $L(n)=\max(\lceil\log_2 n\rceil,1)$. Higher κ is better. Every entry uses the same public IntMul.KappaBound definition: one deterministic machine, a fixed finite alphabet and tape count, exact multiplication for every positive input length, and an eventual worst-case time bound.

Avi’s Harvey–van der Hoeven mission supplies the shared foundation. Its main goal uses the natural-logarithm formulation of the 2021 bound, so it serves as the foundation rather than a numeric entry. Avi’s positive-κ mission targets Jain’s round-six value 0.00003666565558019; it is a historical checkpoint. The reviewed community PR #62 checkpoint targets 0.000051016920170078. Open entries record goals to prove, not established records. The full multiplication theorem remains Open even when finite numerical certificates have been verified.

Community checkpoint and credits · Original framework · Harvey–van der Hoeven