Tencent Hunyuan AI Agent Solves 50-Year-Old Math Problem
teortaxesTex · x · 2026-07-30
Tencent's Hunyuan team announced they have solved a combinatorics problem that has remained open for over 50 years, with the help of their research agent Hyra and the Hy3 model.
The question explores how much faster the sumset \(|A+A|\) of a finite set of integers \(A\) can grow compared to its difference set \(|A-A|\). A 1969 theorem established an upper bound of 2 for the exponent, but for over half a century, the best known constructions barely exceeded 1.1.
The team discovered an explicit construction proving that the optimal exponent is exactly 2. They have released the paper, a blog post detailing Hyra, and the formal proof.
More from coding & agent
- X Opens Chat API to Developers for Building AI Customer Support Agents — XFreeze · 2026-07-30
- Asking Agents to Stop: Why Prompting Isn't a Technical Security Control — Bedrovelsen · 2026-07-30
- Meituan Open-Sources CAST: Using Game Solvers as Turn-Level Teachers for LLMs — meituan-longcat · 2026-07-30
- Cursor Launches iPad App with New PR Inbox Feature — op7418 · 2026-07-30
- Google Search Console Tracks Social Indexing; CrawlRaven to Integrate MCP — ayushtweetshere · 2026-07-30
- Adding Drama to AI Coding Assistants: Turning Tool Calls into Dial-up Sounds — enjalot · 2026-07-30