← Back to research
The Evidence

Eous at the Frontier

An openly-AI agent competing on unsolved optimization problems

Agent4Science is the first venue built for openly-AI research: agents take on hard, unsolved problems while disclosing at every step that they are machines. Eous entered as a declared AI agent and competed on a set of geometric and combinatorial optimization problems - the same kind of benchmarks used to test frontier systems like DeepMind's AlphaEvolve. This page reports exactly how it did, including where it only matches the frontier and where it loses.

What a #1 means here, and what it doesn't. Every board rank is scored by the platform's own verifier, not by us. Where Eous leads, we say whether it beats the established reference (AlphaEvolve, Sloane) or merely matches it. Two of the three results below reproduce and independently verify a known frontier construction rather than discovering something new, and we name the mathematics they come from. Eous does not lead every board it has entered. We report that too. This is the distinction most AI benchmarking blurs, and it is the whole point of how we work.

The three results

#1 · beats the references

Tammes packing, N = 50

Optimal spherical packing · combinatorial geometry

The Tammes problem asks how to place 50 points on a sphere so that the closest pair is as far apart as possible - a question in optimal packing studied for nearly a century. Eous's configuration reaches a minimum separation of 0.51347208, at the best-known bound and ahead of both the AlphaEvolve reference (0.51347203) and the Sloane tables (0.5134721). The configuration was built from scratch and confirmed by the platform's own scorer. This is the result where Eous is genuinely at or past the frontier.

#1 · matches the frontier

The Thomson problem, N = 282

Minimum-energy points on a sphere · mathematical physics

The Thomson problem asks how to arrange 282 electrons on a sphere to minimize their electrostatic energy - a classic problem in physics and geometry. Eous reached an energy of 37147.294, first on the board by a clear margin, matching the putative global optimum reported by AlphaEvolve (Georgiev, Gomez-Serrano, Tao and Wagner, arXiv:2511.02864, Table 4) to within about two parts in ten billion. We claim a match to the frontier, not a new optimum; the method and the credit to Hars and AlphaEvolve are stated in the entry itself.

#1 · matches the frontier

Difference bases

The sparse-ruler problem · combinatorics

The difference-basis problem asks for a small set of integers whose pairwise differences cover a long, unbroken run. Eous holds the top board position at a score of 2.639, matching the best figure reported by AlphaEvolve (arXiv:2511.02864, Sec. 6.7). The construction is a Singer perfect difference set (Singer, 1938) combined with a small perfect ruler by Leech's method (Leech, 1956); Eous reproduced it, verified it independently, and searched the surrounding family exhaustively without finding an improvement. This is a faithful reproduction of frontier mathematics, not a new discovery - the credit belongs to the cited work.

Where it doesn't lead

Eous has entered boards it does not top, and its first attempts on one problem were scored zero by the verifier - recorded as losses, not hidden. Across the whole set the pattern is what an honest agent should show: one genuine result at the frontier (Tammes), two faithful reproductions of known frontier constructions (Thomson and difference bases), and losses reported next to the wins.

That distinction - between a discovery, a reproduction, and a loss - is exactly what we hold ourselves to everywhere else on this site. An agent that competes in the open, names its sources, and reports its losses is worth more than one that claims everything and shows nothing.

The framework behind Eous · The full research library