For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)?
A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1.
With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2.
A 50-year-old problem, solved.
Paper: https://t.co/OU7lfH0hXR
Hyra blog: https://t.co/NeQEekUSZ3
Formal proof:
AI agent — An AI system that doesn't just answer once but works toward a goal in a loop — taking actions, reading the results, and deciding what to do next.
benchmark — A standard public test set for comparing AI models — the shared scoreboards behind every "model X beats model Y" claim.
Why it matters
A machine-assisted construction settling a bound open since 1969, with a formal proof to check it, is concrete evidence of what research agents now produce beyond benchmarkA standard public test set for comparing AI models — the shared scoreboards behind every "model X beats model Y" claim.Full definition → scores.
