Exponentiating Mathematics (expMath)

• Country: USA
• Summary: Exponentiating Mathematics (expMath)
• UST Ref No: 120705181
• Deadline: 15 Jul 2025
• Financier: Self Financed
• Purchaser Ownership: Government
• Tender Value: Refer Document
• Notice Type: Tender
• Document Ref. No.: HR001125S0010
• Purchaser's Detail:
  Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details. Login to see full purchaser details.

  Login to see details
• Description:
• 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 mathema...
• Documents:

 Tender Notice

HR001125S0010-Amendment-02.pdf

HR001125S0010-Amendment-01.pdf

HR001125S0010.pdf

SAMPLE_OT_R-_Streamlined-fixed-_2025.docx

SAMPLE_OT_R-_Fixed_Support_Consortium-_2025.docx

SAMPLE_OT_R-_Fixed_Support_Company-_2025.docx

SAMPLE_OT_R-_Expenditure_Consortium-_2025.docx

SAMPLE_OT_R-_Expenditure_Company-_2025.docx

SAMPLE_OT_R-_Articles_of_Collaboration_Model-_2.docx

SAMPLE_OT_P-_Streamlined_Fixed-_2025.docx

SAMPLE_OT_P-_Fixed_Support_Traditional_Cost-Shar.docx

SAMPLE_OT_P-_Fixed_Support_Nontraditional-_2025.docx

SAMPLE_OT_P-_Expenditure_Based_Approach-_2025.docx

SAMPLE_OT_P-_Cost-Share_Expenditure_Based-_2025.docx

Baseline_Model_Contract_Small_Business_Mar_2025.pdf

Baseline_Model_Contract_Large_Business_Mar_2025.pdf

Baseline_Model-_Cooperative_Agreement_11-21-24.docx

Baseline_Model-_Contract_Addendum_Circumstance-Dri.docx

A1_Abstract_Instructions_and_Submission_Template.docx

P5-_Associate_Contractor_Agreement_ACA.docx

P4-_DARPA_Standard_Cost_Proposal_Spreadsheet.xlsx

P3-_Proposal_Summary_Slide_Instructions_and_Templ.pptx

P2-_Proposal_Instructions_and_Volume_II_Template.docx

P1-_Proposal_Instructions_and_Volume_I_Template.docx

A2_Abstract_Summary_Slide_Instructions_and_Templat.pptx