GPT-6 Astra Just Broke a Long-Standing Complexity Bound
This is a AI post classified by Jev as Frontier models (a model release), kept by the AI Radar because it carries real work, not commentary.
GPT-6 Astra Just Broke a Long-Standing Complexity Bound GPT-6 Astra reduced a competitive programming problem from O(np(n)) to O(n² polylog n), far beyond what contestants had long considered optimal. The bigger shift is that frontier models are now producing algorithms whose mathematics can take experts significant time to unpack. Zhihu contributor chenzhe, who published the original roundup, says the change became clear this year. During verification for the highly difficult CCPC Final, GPT Pro quickly solved all 13 problems, while even top human teams completed only 7 to 9 in competition.
Posted by Zhihu Frontier (12.1k followers) 1 days ago · 19 likes · 1.6k views · view the original post on X. Kept by the AI Radar as Frontier models.
More AI work like this
- Les premières pièces totalement modélisés par GPT6-Astra — @DFintelligence
- gpt 5.6 terra = gpt 6 astra — @notjazii
- wow — @HarshithLucky3
- 🚨 Gemini 4 Pro is absolutely cooking — @Mr_Salio
- anthropic is about to mog everyone with new models — @notjazii
- woke people still don’t want to accept AIs good potential, while AI be like to them🖕🏻 — @SciTechera
- @AdamHoltererer — @AdamHoltererer
- GPT 6 Astra Pro builds OCD simulator: — @AdamHoltererer
Every post is read and classified by Jev (TypeSafe): what it is, which market it belongs to, and whether the link is a real tool. 27.2k posts from 4.8k X accounts over the last 14 days, 1.2k tools, 19 markets. Collected every 5 minutes, fully re-ranked every hour — last update 2026-09-19 18:50 UTC. Full method.