Skip to main content

Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems

NSF

closed
OpenLast verified: 2026-06-20

About This Grant

Boolean satisfiability (SAT) is a core problem in computing with broad, high-impact applications. A wide range of critical problems in industry and defense, e.g., in hardware and software design and verification, artificial intelligence, robotics, and drug discovery, use SAT solvers and often take weeks to complete on modern large-scale computing systems. This project will develop new types of accelerator chips custom-designed for SAT to reduce the time and energy required to solve all such important problems by more than two orders of magnitude compared to the best-known existing approaches. Completely new ways to combine logic circuits and memories will be developed, along with methods and tools to create these chips. The development of this hardware will dramatically benefit organizations across engineering, artificial intelligence, science, business, logistics, and defense. This project will also advance the art and science of custom computing, which will continue to increase in importance in the foreseeable future. Students will be trained in this new art and science. The models, methods, and tools developed will be shared with researchers as well as industry and defense experts to foster a vibrant community. The project will develop an algorithm-to-transistors co-optimization approach to accelerator design for SAT and an extensive set of combinatorial problems, demonstrating significantly higher efficiency than existing solutions. It will also provide new computer-aided design (CAD) tools for the realization of powerful SAT accelerators by mapping SAT algorithms and heuristics to optimized architectures, including combinations of memories, content-addressable memories, near-memory logic, and custom interconnects that enable maximal parallelization. The advantages of the new designs will be demonstrated via chip fabrication, silicon measurements, and the development of chiplet-based architectures enhancing the economics of accelerators for SAT and other problems. The technological advancements pursued by this project, and especially the new methods and tools for the design of hardware accelerators, will contribute to the state of the art in custom computing, which will become increasingly more important in the post-Moore era. The resulting designs will dramatically benefit organizations across engineering, artificial intelligence, science, business, logistics, and defense. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

Grant Summary

Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems is a NSF grant providing up to $300K for university, nonprofit, small business. Applications are due 2029-09-30 (open). Check eligibility and apply with FindGrants.

Focus Areas

engineering

Eligibility

universitynonprofitsmall business

How to Apply

Funding Range

Up to $300K

Deadline

2029-09-30

Complexity
Medium
  1. 1Confirm your organization is eligible for Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems from NSF, checking organization type, location, and any population or project requirements.
  2. 2Gather the required documents and information, including your organization details, project plan, and budget figures.
  3. 3Draft your application narrative and budget addressing the funder's priorities and review criteria. FindGrants can draft each section for you to review and edit.
  4. 4Review every section against the requirements checklist, then export a submission-ready application pack and submit it to NSF before the deadline.
This record is a past award, contract, or funder profile — useful for research, but not an open grant application. Check the original source for current opportunities from this funder.

Don't want to draft it yourself?

We'll draft the complete application against NSF's requirements, run a quality review, and email you a submission-ready PDF plus an editable Word doc within 5 business days. Most orders deliver in 24-48 hours. Flat $399, any grant size.

AI Requirement Analysis

Detailed requirements not yet analyzed

Have the NOFO? Paste it below for AI-powered requirement analysis.

0 characters (min 50)

Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems: Frequently Asked Questions

Who is eligible for the Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems?

Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems is offered by NSF and is generally open to university, nonprofit, small business. It is open to organizations nationwide unless the funder specifies otherwise. Review the specific eligibility terms before applying, since funders set their own requirements around organization type, location, and the population or project being served.

How much funding does the Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems provide?

Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems provides up to $300K per award from NSF. Actual award sizes depend on the scope of your project, available program funds, and the number of applicants, so build a budget that reflects realistic, allowable costs rather than the maximum figure.

When is the Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems deadline?

Applications for Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems are due 2029-09-30 (open). Because deadlines can change, verify the date with the funder, NSF, and give yourself enough time to prepare a complete, competitive application before the close date.

How do you apply for the Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems?

To apply for Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems, confirm your eligibility, gather the required documents, and prepare a narrative and budget that address the funder's priorities. FindGrants guides you step by step and can draft each section, then exports a submission-ready application pack for this grant from NSF.

Browse More Grants

Related Grants