GitHub · Python
Swapnil-jain/integer-mult-kappa
Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks
- Stars
- 27
- Forks
- 3
- Stars gained in 24 hours
- 0
- Forks gained in 24 hours
- 0
Topics: algorithms, arithmetic-complexity, certificates, complexity-theory, computational-complexity, fast-fourier-transform, fine-grained-complexity, formal-verification, integer-multiplication, interval-arithmetic
Latest data point: Nov 21, 2026 · 27 stars · 3 forks