As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/p/2026-10-06-acerfur-integer-multiplication-below-n-log-n/ # Former OpenAI team member: "we can do integer multiplication faster than n log n" Acer (AcerFur) (@AcerFur), X, 2026-10-06. Source: https://x.com/AcerFur/status/2107606747972309163 ## Why it matters High-reach post (~264k views) from someone who says they were on the team, highlighting the integer-multiplication result. ## Summary Posted 22:59 UTC: "oh yeah btw guys we can do integer multiplication faster than n log n lol", "I was definitely very surprised when this one came in", linking preprints/Integer-multiplication-below-n-log-n-September-23-2026. ~264k views. The account's bio (fxtwitter, Oct 7) reads "pure maths student @Cambridge_Uni" and "prev: @OpenAI". Earlier post at 22:24 UTC (https://x.com/AcerFur/status/2107598008036806912, ~23k views) on the quasi-RH paper: "A uniform zero-free strip." It was "a huge honour to have been part of this team." HN discussion (item 49985524, ~90 points) noted the bound is n·log n raised to (1 − 2^−182). ## Archived text > oh yeah btw guys we can do integer multiplication faster than n log n lol > > I was definitely very surprised when this one came in lol > > https://t.co/o7iBA131nY Archived 2026-10-07 via syndication. Counts: 3,927 likes, 70 replies (at fetch time) Media: https://pbs.twimg.com/media/HT-5KcnWsAIMSUl.png ## Cited in - 2026-10-07: [Outside researchers using AI crowdsource a tighter exponent in OpenAI's integer-multiplication result #109, from 2^-182 to about 2^-8.4 (conditional)](https://postcutoff.com/e/2026-10-07-colkitt-codex-integer-multiplication-exponent/) - 2026-10-06: [OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems](https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/)