OpenAI's "Galactic Algorithm" Mocked for Absurd Threshold

Developers and cryptographers are mocking OpenAI's claimed ETH-solving "galactic algorithm," which only avoids an exponential-time subroutine when the number of variables exceeds an absurd 10^10^25—meaning no real-world instance would ever benefit.

2026-10-28 ~ 2026-10-29 · 4 related posts

• Dev mocks OpenAI's "galactic algorithm": exponential-time subroutine below 10^10^28 variables — beenwrekt · 2026-10-28
• Cryptographer mocks OpenAI's exponential-time subroutine bound: 'infinity plus 1' — matthew_d_green · 2026-10-29
• Complexity theory joke: OpenAI's 'galactic algorithm' only runs exponential subroutine past n > 10^10^25 — brandondamos · 2026-10-29
• Mocking OpenAI's 'galactic algorithm': an exponential fallback behind a 10^10^25 threshold — qberthet · 2026-10-29