github.compaper

Integer multiplication below n log n

A preprint hosted in OpenAI's "math" GitHub repository claiming a result on integer multiplication algorithms with complexity below the n log n bound, the long-standing benchmark achieved by the Harvey–van der Hoeven algorithm in 2019. The page itself only exposes citation metadata (author, title, BibTeX entry) with the actual paper linked as a PDF, so the specific proof technique and whether it was AI-assisted cannot be confirmed from the fetched text alone.