Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science
Stellar Colosseum coordinates parallel strategy search, falsification, decomposition, and verifier feedback for long research tasks. Its harness patterns may transfer to agents handling interdependent coding work.
Stellar Colosseum is a model-agnostic many-agent harness for long-horizon mathematics and theoretical computer science. It explores competing strategies, gates decomposition on readiness, attacks candidates through falsification, and routes verifier findings back to affected proof sections.
Agent builders should reconsider immediate task decomposition: search and challenge candidate plans first, then split only mature routes into linked subproblems. The same workflow appears in Google Antigravity Teamwork as the **Long Proof pattern**.
Stellar Colosseum is a model-agnostic many-agent harness for long-horizon mathematics and theoretical computer science. It explores competing strategies, gates decomposition on readiness, attacks candidates through falsification, and routes verifier findings back to affected proof sections. Agent builders should reconsider immediate task decomposition: search and challenge candidate plans first, then split only mature routes into linked subproblems. The same workflow appears in Google Antigravity Teamwork as the **Long Proof pattern**. With specified Gemini models, the harness reports **71.0% on TCS-Bench** and **218 of 222 Codeforces problems** solved with execution feedback. Those results concern proofs and competitive programming, so transfer to general software projects remains untested here.
Stellar Colosseum makes delayed decomposition a concrete many-agent control pattern: explore and falsify candidate routes before splitting mature ones, then send verifier findings back to the affected proof sections. This sharpens prior long-horizon guidance around compositional trajectories and evidence-backed completion, while its strong reported results remain bounded to proofs and competitive programming.