AI Falls Short on Millennium Prize Problems, But Test-Time Compute Has Room to Grow

polynoamial · x · 2026-08-01

The author shared results from attempting to solve major mathematical problems using AI. While no Millennium Prize problems have been cracked yet, the compute spent per problem was relatively low. The author notes that there is significant room to push test-time compute much further in the future.

Original post →

More from Research

Research channel →