Exponentiating Mathematics (expMath)
Closed Solicitation Posted
- Solicitation number
- HR001125S0010
- Agency
-
Defense Advanced Research Projects Agency
Department of Defense
- Responses due
- Set-aside
- No set-aside
Opportunity facts
- NAICS code
- 541715 Research and Development in the Physical, Engineering, and Life Sciences (except Nanotechnology and Biotechnology)
- Points of contact
-
- BAA Coordinator expmath@darpa.mil
Notice details come from SAM.gov. Updated .
About this opportunity
The Defense Advanced Research Projects Agency (DARPA) is soliciting innovative proposals for the Exponentiating Mathematics (expMath) program, seeking to develop artificial intelligence technologies that can dramatically accelerate progress in pure mathematics research. The procurement focuses on creating an AI "co-author" capable of proposing and proving useful mathematical abstractions through two technical areas: TA1 will develop AI for automated problem decomposition and formalization/informalization of mathematical proofs, while TA2 will create evaluation methods for assessing AI performance at professional mathematics levels. Proposers must demonstrate strong expertise in both mathematics and artificial intelligence, with evaluation criteria emphasizing technical approach, team capabilities, and potential impact on mathematical research. Key program metrics include achieving 90% accuracy in predicting and proving lemmas and demonstrating a 100x reduction in solution time compared to manual graduate student work. The solicitation timeline includes an abstract submission deadline of May 15, 2025, and a full proposal deadline of July 15, 2025.
This opportunity does not utilize any set-aside designations and is open to all qualified organizations including large businesses, small businesses, educational institutions, and nonprofit organizations. No current incumbents or contractors are identified in the solicitation materials. While specific award values are not disclosed, the program anticipates multiple awards using various instrument types including procurement contracts, cooperative agreements, and other transactions, with template documents suggesting potential contract values under $2 million for some award mechanisms. The program will span 36 months with performance beginning January 1, 2026, and will conduct evaluations every six months across diverse mathematical subfields including partial differential equations, number theory, and computational complexity. The place of performance is not specifically restricted, allowing for distributed research teams, though the program emphasizes open-source development and collaborative approaches between the mathematics and AI research communities.
Notice text
2 versions
Update #2 · Latest ·
MATHEMATICS IS THE SOURCE OF SIGNIFICANT TECHNOLOGICAL ADVANCES; HOWEVER, PROGRESS IN MATH IS SLOW. Recent advances in artificial intelligence (AI) suggest the possibility of increasing the rate of progress in mathematics. Still, a wide gap exists between state-of-the-art AI capabilities and pure mathematics research.
Advances in mathematics are slow for two reasons. First, decomposing problems into useful lemmas is a laborious and manual process. To advance the field of mathematics, mathematicians use their knowledge and experience to explore candidate lemmas, which, when composed together, prove theorems. Ideally, these lemmas are generalizable beyond the specifics of the current problem so they can be easily understood and ported to new contexts. Second, proving candidate lemmas is slow, effortful, and iterative. Putative proofs may have gaps, such as the one in Wiles’ original proof of Fermat’s last theorem, which necessitated more than a year of additional work to fix. In theory, formalization in programming languages, such as Lean, could help automate proofs, but translation from math to code and back remains exceedingly difficult.
The significant recent advances in AI fall short of the automated decomposition or auto(in)formalization challenges. Decomposition in formal settings is currently a manual process, as seen in the Prime number theorem and beyond and the Polynomial Freiman-Ruzsa conjecture, with existing tools, such as Blueprint for Lean, only facilitating the structuring of math and code. Auto(in)formalization is an active area of research in the AI literature, but current approaches show poor performance and have not yet advanced to even graduate-level textbook problems. Formal languages with automated theorem-proving tools, such as Lean and Isabelle, have traction in the community for problems where the investment in manual formalization is worth it.
The goal of expMath is to radically accelerate the rate of progress in pure mathematic
Update #1 ·
MATHEMATICS IS THE SOURCE OF SIGNIFICANT TECHNOLOGICAL ADVANCES; HOWEVER, PROGRESS IN MATH IS SLOW. Recent advances in artificial intelligence (AI) suggest the possibility of increasing the rate of progress in mathematics. Still, a wide gap exists between state-of-the-art AI capabilities and pure mathematics research.
Advances in mathematics are slow for two reasons. First, decomposing problems into useful lemmas is a laborious and manual process. To advance the field of mathematics, mathematicians use their knowledge and experience to explore candidate lemmas, which, when composed together, prove theorems. Ideally, these lemmas are generalizable beyond the specifics of the current problem so they can be easily understood and ported to new contexts. Second, proving candidate lemmas is slow, effortful, and iterative. Putative proofs may have gaps, such as the one in Wiles’ original proof of Fermat’s last theorem, which necessitated more than a year of additional work to fix. In theory, formalization in programming languages, such as Lean, could help automate proofs, but translation from math to code and back remains exceedingly difficult.
The significant recent advances in AI fall short of the automated decomposition or auto(in)formalization challenges. Decomposition in formal settings is currently a manual process, as seen in the Prime number theorem and beyond and the Polynomial Freiman-Ruzsa conjecture, with existing tools, such as Blueprint for Lean, only facilitating the structuring of math and code. Auto(in)formalization is an active area of research in the AI literature, but current approaches show poor performance and have not yet advanced to even graduate-level textbook problems. Formal languages with automated theorem-proving tools, such as Lean and Isabelle, have traction in the community for problems where the investment in manual formalization is worth it.
The goal of expMath is to radically accelerate the rate of progress in pure mathematics by developing an AI co-author capable of proposing and proving useful abstractions. expMath will be comprised of teams focused on developing AI capable of auto decomposition and auto(in)formalization and teams focused on evaluation with respect to professional-level mathematics. We will robustly engage with the math and AI communities toward fundamentally reshaping the practice of mathematics by mathematicians.
Files
Show all 25
Similar open opportunities
| Opportunity | Agency | Set-aside | Responses due |
|---|---|---|---|
| Information Processing Techniques Office Office-Wide | Defense Advanced Research Projects Agency | No set-aside | |
| Defense Sciences Office (DSO) Office-wide BAA | Defense Advanced Research Projects Agency | No set-aside | |
| MXO Office-wide Innovative Solutions Opening | Defense Advanced Research Projects Agency | No set-aside |
On GovTribe
Work this opportunity
- Track it in your pipeline
- Find teaming partners
- Similar opportunities
- Ask GovTribe AI about this opportunity