integer-mult-bounds

This repository presents community research on a sharper exponent for integer multiplication, stated as a bound T(n)=O(n(log n)^{1−κ}), where κ is the exponent saving. ^[1a][1b] It records conditional proofs, exact certificates, and reproducible audits for reviewed results. ^[2a][2b] The work is conditional on the OpenAI #109 framework and is not a complete Lean theorem or independent human proof of integer multiplication. ^[3a][3b]