FormalTCS: Benchmarking End-to-End Frontier Formal Theoretical Computer Science Research of Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have shown growing potential for automated theoretical computer science (TCS) research, yet existing benchmarks remain far from realistic research settings. We introduce ourbenchmark, an expert-validated benchmark for evaluating LLMs on frontier, end-to-end TCS research. ourbenchmark contains 143 instances drawn from papers accepted to STOC, FOCS, SODA, and COLT in 2025-2026, preserving paper-specific definitions, assumptions, and proof dependencies, with expert-verified Lean formalizations and proofs. Evaluations of leading LLMs reveal that current models remain far from reliably completing the full research pipeline. In particular, autoformalization is the sharpest bottleneck: the best model achieves only 11.5 on translating natural-language claims into formal theorem statements, compared with 28.6 Pass@8 when proving human-provided formal statements. Building on ourbenchmark, we further develop an automated TCS research framework that generates, formalizes, filters, and proves new claims. Of 64 generated claims, only 6 ultimately pass expert evaluation and proof verification, indicating that beyond formalization, limited research taste remains another major barrier to autonomous TCS research.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 27 references that are in the map. First posted on arXiv 20 Aug 2026.
Builds on
21 of 27 references.
References · 21
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 877
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
- 2024Can LLMs Generate Novel Research Ideas? A Large-Scale Human Study with 100+ NLP Researcherscited by 348
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 278
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
- 2024DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Datacited by 225
- 2024DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Searchcited by 189
- 2023Time Travel in LLMs: Tracing Data Contamination in Large Language Modelscited by 175
- 2025Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Provingcited by 126
- 2024Membership Inference Attacks Cannot Prove that a Model Was Trained On Your Datacited by 49
- 2025The Ideation-Execution Gap: Execution Outcomes of LLM-Generated versus Human Research Ideascited by 49
- 2024Reliable Evaluation and Benchmarks for Statement Autoformalizationcited by 25
9 more
- 2024Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchicallycited by 22
- 2025Reliable Fine-Grained Evaluation of Natural Language Math Proofscited by 14
- 2026LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalizationcited by 11
- 2025Reinforced Generation of Combinatorial Structures: Hardness of Approximationcited by 8
- 2025The Surprising Effectiveness of Membership Inference with Simple N-Gram Coveragecited by 7
- 2025Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairscited by 3
- 2026Theory-Scale Auto-Formalization of Logics for Computer Sciencecited by 3
- 2026TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Abilitycited by 3
- 2026BlueprintRepair: Typed Local Edits for Failed Lean Proof Blueprintscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.