Cogentic: Multi-Agent Orchestration for Automated Proof Discovery
On the map: LLM agents and tool use → Educational agents and math problem solving also fits: Web, search, and research agents
Abstract (arXiv)
We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming subtle technical obstructions, and retaining intermediate progress over a long horizon. Cogentic addresses these challenges through an iterative prove-verify loop in which an orchestrator allocates a population of independent provers across distinct proof directions, subjects their output to adversarial verification by several specialized components, and promotes confirmed intermediate results into a persistent verified ledger that later rounds build on. The harness is designed to be able to solve research-level math and theoretical computer science problems. Using either Gemini 3.1 Pro or an early version of Gemini 4 Argon as the base model, Cogentic produced novel results on open problems across online learning, auction theory, and mechanism design. Each result was independently verified by domain experts and is developed in full in companion papers. We list these results, and new ones as they are verified, at https://sites.google.com/view/cogentic .
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Educational agents and math problem solving, one of 16 directions in LLM agents and tool use. Builds on 39 of its 74 references that are in the map. First posted on arXiv 30 Sep 2026.
Builds on
39 of 74 references.
Closest ancestors · 2
Same direction, newest first
- 2026ProofCouncil: An LLM Agent for Solving Open Mathematical Problems10 Jul
- 2025Mathematical exploration and discovery at scale3 Nov
Other references · 37
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,784
- 2023Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debatecited by 1,011
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 867
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2025Accelerating scientific discovery with Co-Scientistcited by 401
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 291
- 2024Agent-as-a-Judge: Evaluate Agents with Agentscited by 238
- 2026Learning to Discover at Test Timecited by 115
25 more
- 2025ThetaEvolve: Test-time Learning on Open Problemscited by 64
- 2025An AI system to help scientists write expert-level empirical softwarecited by 60
- 2026Towards Autonomous Mathematics Researchcited by 40
- 2020Optimal anytime regret with two expertscited by 16
- 2021Contextual Recommendations and Low-Regret Cutting-Plane Algorithmscited by 15
- 2014A Simple and Approximately Optimal Mechanism for an Additive Buyercited by 9
- 2018A Duality-Based Unified Approach to Bayesian Mechanism Designcited by 9
- 2025Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Boundcited by 9
- 2025Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel-Young Loss Perspective and Gap-Dependent Regret Analysiscited by 8
- 2026Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Setscited by 8
- 2019Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Marketscited by 7
- 2022Continuous Prediction with Experts' Advicecited by 7
- 2013Towards Minimax Online Learning with Unknown Time Horizoncited by 6
- 2022Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCGcited by 6
- 2026Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustnesscited by 6
- 2026Multiscale Reward Hedging from Correct Demonstrationscited by 5
- 2015Reaping the Benefits of Bundling under High Production Costscited by 3
- 2026Efficient Online Inverse Optimization with O(d) Regretcited by 3
- 2026Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weightscited by 2
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constantcited by 2
- 2015On the Computational Complexity of Optimal Simple Mechanismscited by 1
- 2023The Power of Two-sided Recruitment in Two-sided Marketscited by 1
- 2026A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Searchcited by 1
- 2026The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Marketscited by 1
- 2026Improved Revenue Guarantees for Selling Separately and Bundlingcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026RMA: an Agentic System for Research-Level Mathematical Problems
- 2026Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science
- 2026AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness
- 2026Advancing Mathematics Research with AI-Driven Formal Proof Search
- 2026Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents
- 2026Albilich: Steerable Proof-State Orchestration for LLM-Based Mathematical Research with CAS Integration
- 2025Prover Agent: An Agent-Based Framework for Formal Mathematical Proofs
- 2026Efficient Test-Time Optimization for Multi-Agent Proof Autoformalization