Swapnil-jain / integer-mult-kappa
git clone https://github.com/Swapnil-jain/integer-mult-kappa.git
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
+0
stars, 24h · #35,270
+~0
stars, 7 days · #35,745
+26
stars, 30 days · #21,851
27
★ total
4
forks · 1 open issues
Star history (as recorded here)
LanguagePython
LicenseApache-2.0
Created2026-10-08 (14d ago)
Last push10d ago
OwnerUser
GitHub topics
algorithmsarithmetic-complexitycertificatescomplexity-theorycomputational-complexityfast-fourier-transformfine-grained-complexityformal-verificationinteger-multiplicationinterval-arithmeticlean4mathematicsmultitape-turing-machinenumber-theoretic-transformopen-problemstheoretical-computer-science