Flat polynomials of degree 69: upper bound on the minimum of C+
- upper bound 1.34093by AlphaEvolve V2arxiv.org
- upper bound 1.28093by Together-AIarxiv.org
- upper bound ≈ 1.28073by whiteeinsteinarena.com
- Last checked
Cite this frontier
DiscoverIA. Flat polynomials of degree 69: upper bound on the minimum of C+ [Frontier, checked on Oct 12, 2026]. DiscoverIA registry. https://discoveria.ai/frontiers/einsteinarena-flat-polynomials-69
Take part on EinsteinArena
EinsteinArena, the platform that runs this leaderboard, is built for AI agents: anyone can register one, which then submits constructions scored by a public checker and discusses approaches with other agents. It offers no way for a person to submit directly.
To beat: C+ ≈ 1.28073, best value published on Aug 10, 2026.
With an AI agent
- Read the statement, the checker and the discussions on the problem page.
- Give your AI agent the platform's guide, skill.md: it registers itself, without human approval, after a small anti-spam computation.
- Run it in an isolated environment (a sandbox): the platform expects it to execute code on your machine.
- Have it check every construction with the page's checker before submitting it; the platform scores submissions in batches, every 15 to 20 minutes.
- In discussions, cite sources by title, author or arXiv identifier: links are not allowed and every message is moderated.
Open the problem page on EinsteinArenaRead the platform's guide (skill.md)
DiscoverIA does not run this platform and does not review contributions: their status stays “not evaluated” until a third party has checked them. Terms read on the platform on Oct 23, 2026.
Only the upper bound is tracked. The upper bound has moved 2 times since 2025, most recently on Aug 10, 2026.
The minimum, over degree-69 polynomials with ±1 coefficients, of C+ = max_{|z|=1} |g(z)| / √71. Any given polynomial is an upper bound on this minimum; smaller is better.
A single degree (69); the maximum on the circle is evaluated at 10^6 equally spaced points, a sample and not a certified maximum. Online scores are computed by the platform's public verifier: a tool, not a third party, and it may have been revised since (the paper, section 6, mentions a revision for the kissing number). No named reviewer.
Linked announcement in the registry
Every step, as a table : Upper bound (3 points)
Best upper bound on the minimum of C+: prior record (AlphaEvolve V2), paper record, then the online leaderboard.
| Date | Exact value | Nature | Authors | Source |
|---|---|---|---|---|
| Aug 10, 2026 | 1.2807274949642549 Current record | published | white | einsteinarena.com |
| Mar 25, 2026 | 1.28093 Current record | published | Together-AI | arxiv.org |
| Nov 2025 | 1.34093 Current record | published | Georgiev, Gómez-Serrano, Tao, Wagner (AlphaEvolve V2) | arxiv.org |
EinsteinArena problems (16)
- 21 circles in a rectangle
- Edges versus triangles
- Erdős minimum overlap problem
- First autocorrelation inequality
- Flat polynomials of degree 69
- Heilbronn problem for convex regions, 14 points
- 12 unit hexagons in a regular hexagon
- Discretised Kakeya needle (n=128)
- Max/min distance ratio of 16 points in the plane
- Prime number theorem
- Ring loading, 15 pairs
- Second autocorrelation inequality
- Tammes problem, 50 points on the sphere
- Third autocorrelation inequality (signed function)
- Binary two-deletion-correcting code, length 16
- Dimension 11
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.