Exponentiating Mathematics (expMath)
| Location: |
Federal |
| Posted: |
Apr 30, 2025 |
| Due: |
Jul 8, 2025 |
| Agency: |
DEPT OF DEFENSE |
| Type of Government: |
Federal |
| Category: |
- A - Research and development
|
| Solicitation No: |
HR001125S0010 |
| Publication URL: |
To access bid details, please log in. |
Exponentiating Mathematics (expMath)
Active
Contract Opportunity
Department/Ind. Agency
DEPT OF DEFENSE
Sub-tier
DEFENSE ADVANCED RESEARCH PROJECTS AGENCY (DARPA)
Office
DEF ADVANCED RESEARCH PROJECTS AGCY
Looking for contract opportunity help?
General Information
-
Contract Opportunity Type: Solicitation (Original)
-
Original Published Date: Apr 30, 2025 01:51 pm EDT
-
Original Date Offers Due: Jul 08, 2025 05:00 pm EDT
-
Inactive Policy: Manual
-
Original Inactive Date:
Aug 07, 2025
-
Initiative:
Classification
-
Original Set Aside:
-
Product Service Code: AC12 - NATIONAL DEFENSE R&D SERVICES; DEPARTMENT OF DEFENSE - MILITARY; APPLIED RESEARCH
-
NAICS Code:
-
541715 - Research and Development in the Physical, Engineering, and Life Sciences (except Nanotechnology and Biotechnology)
-
Place of Performance:
Description
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.
Attachments/Links
Contact Information
Contracting Office Address
-
675 NORTH RANDOLPH STREET
-
ARLINGTON , VA 222032114
-
USA
Secondary Point of Contact
History
-
Apr 30, 2025 01:51 pm EDTSolicitation (Original)
Daily notification on new contract opportunities
With GovernmentContracts, you can:
- Find more opportunities and win more business
- Receive daily alerts for all new bid opportunities
- Get contract opportunities matched to your business
ONE WEEK FREE TRIAL
* Disclaimer: Information regarding bids, requests for proposals (RFPs), or requests for qualifications (RFQs) is provided on this website only for convenience and does not constitute official public notice. Persons wishing to respond to or inquire about bids, RFPs, or RFQs should contact the appropriate government department.