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.
Related event: Tencent Hunyuan AI Solves 50-Year-Old Combinatorics Problem(3 posts)→
More from coding & agent
- Harness open-sources desktop and mobile apps for orchestrating agent fleets across frameworks and machines — dee_hw · 2026-10-16
- Open-Source Google Analytics MCP Server Lets LLMs Query GA Data via Natural Language — modelcontextprotocol · 2026-10-16
- LLM ideation experiment: just ask for non-obvious ideas — and Opus beats smaller models by a wide margin — arjunrajlab · 2026-10-16
- a16z podcast: AI cut a 6-month feature to 10 days and widened engineer gaps 10x — a16z · 2026-10-16
- "Hold On, My Agents Are Freezing My Screen": The Daily Grind of the Agent Era — every · 2026-10-16
- Dev builds MCP feeding Claude 3,000 real launch videos to fix samey AI output — Designer_Landscape25 · 2026-10-16