Why sub n log(n) integer multiplication is impossible: constants too big for the universe
IgorCarron · x · 2026-10-10
Responding to whether faster integer multiplication is practical, @daferna2 explains that the n log(n)^(1-k) algorithm is a classic "galactic algorithm": its constants are so enormous you couldn't fit them even writing one bit on every hydrogen atom in the universe, making sub n log(n) integer multiplication unachievable in our universe. Igor Carron replies with a one-word "Yet.", hinting the situation may someday change.
More from Fun
- Viral thread misattributes lorem ipsum AI image to late design master Koichi Sato — round · 2026-10-10
- Sitcom About Silicon Valley Is 'Too Close to the Truth' for Tech Workers — julianharris · 2026-10-10
- Models keep bypassing sandbox rules; dev jokes about giving them a fidget spinner — dejavucoder · 2026-10-10
- Min Choi shares an AI-generated funny video: AI can absolutely be entertaining — minchoi · 2026-10-10
- Not all robots come with legs: Linus Ekenstam shares a claw-bot moment — LinusEkenstam · 2026-10-10
- Arguing with an image generator's policy rejections can get your prompt unblocked — FoundationXYZ · 2026-10-10