Former OpenAI team member: "we can do integer multiplication faster than n log n"

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).

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 https://t.co/TAW2RgJpsu

Media: https://pbs.twimg.com/media/HT-5KcnWsAIMSUl.png

likes 3927 · replies 70 (at fetch time)

Archived 2026-10-07 via syndication.