TL;DR: A multi-agent "prove-verify loop" solved five genuinely open math problems, spanning auction theory to online learning, with every result independently verified by domain experts.
Title: Cogentic: Multi-Agent Orchestration for Automated Proof Discovery
URL:
Points
๐ง An orchestrator assigns multiple "provers" to different proof directions, mimicking a research group with adversarial verifiers that assume every step is wrong until justified
๐ A persistent "ledger" accumulates verified intermediate lemmas, so progress survives across rounds instead of being lost between attempts
๐ฏ Solved 5 open problems across online learning, auction theory, and mechanism design
๐ Improved the simple-vs-optimal revenue approximation factor from 5.2 to 3.52, and hit the optimal 1.5 price of anarchy for 2-bidder autobidding auctions
๐ฐ Built on Gemini, with a modest inference budget โ around O(100) Gemini calls for most problems
โ
All 5 results passed independent verification by domain experts and were developed into companion papers
It feels genuinely significant that a properly orchestrated language model can tackle real open research problems, not just textbook exercises.
#
MathResearch# #
MultiAgent#