Closed Solicitation · DEPT OF DEFENSE

    Exponentiating Mathematics (expMath)

    Sol. HR001125S0010SolicitationARLINGTON, VA
    Closed
    STATUS
    Closed
    closed Jul 15, 2025
    POSTED
    Jun 10, 2025
    Publication date
    NAICS CODE
    541715
    Primary industry classification
    PSC CODE
    AC12
    Product & service classification

    AI Summary

    The Department of Defense's Defense Advanced Research Projects Agency (DARPA) is soliciting proposals for the expMath initiative, aimed at accelerating advancements in pure mathematics through artificial intelligence. The project seeks to address the slow progress in mathematics by improving the decomposition of problems into useful lemmas and automating the proof process. Bidders should focus on innovative solutions that bridge the gap between AI capabilities and mathematical research, with a submission deadline of July 15, 2025.

    Contract details

    Solicitation No.
    HR001125S0010
    Notice Type
    Solicitation
    Posted Date
    June 10, 2025
    Response Deadline
    July 15, 2025
    NAICS Code
    541715AI guide
    PSC / Class Code
    AC12
    Contract Code
    97AE
    Primary Contact
    BAA Coordinator
    State
    VA
    ZIP Code
    222032114

    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 mathematic

    Key dates

    1. June 10, 2025Posted Date
    2. July 15, 2025Proposals / Responses Due

    Frequently asked questions

    Exponentiating Mathematics (expMath) is a federal acquisition solicitation issued by DEPT OF DEFENSE. Review the full description, attachments, and submission requirements on SamSearch before the response deadline.

    SamSearch Platform

    Stop searching. Start winning.

    AI-powered intelligence for the right opportunities, the right leads, and the right time.