NSF award 2505130 · University of California-Berkeley

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

Final report due

28 January 2030

in 1,198 days · The award ends on 30 September 2029.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Jun 2029in 958 days
award ending 2029-09-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 Aug 2029in 1033 days
award ending 2029-09-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Sep 2029in 1068 days
award ending 2029-09-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Jan 2030in 1198 days
award ending 2029-09-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Jan 2030in 1198 days
award ending 2029-09-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Jan 2030in 1198 days
award ending 2029-09-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 September 2029.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 January 2030.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2505130
Period of support: 1 Oct 2025 – 30 Sep 2029
Amount: $300,000
Awardee: University of California-Berkeley, Berkeley, CA
Program: Software & Hardware Foundation
Directorate: CSE

Abstract

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…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.