Introducing The Agentic Satisfiability Acceleration Competition

View leaderboard Learn More

Leaderboard

Loading results…

The first hardware accelerator competition for SAT solving

The Symbolic AI Revolution Awaits

Since 1998, researchers have explored using Field Programmable Gate Arrays (FPGAs) to accelerate Boolean satisfiability (SAT), the canonical NP-complete problem. An FPGA is a special kind of chip whose circuitry can be reconfigured after fabrication. They offer ultra-low latency and massive parallelism, but symbolic AI methods such as SAT solvers have yet to see their hardware breakthrough. Modern solvers have long chains of sequential dependencies and are bound by memory access, which makes them hard to express in digital logic.

That is beginning to change. AI agents are steadily improving at register-transfer level (RTL) design, the abstraction most commonly used to describe digital circuits. Designing hardware is no longer limited to specialists. However, it is limited to those with an FPGA board and, often, a costly license for an electronic design automation (EDA) toolchain.

The Columbia Formal Methods and Reasoning Group is working to change that. Over the past six months, we have built a managed cloud platform for the Lattice ECP5, a low-cost, off-the-shelf FPGA supported by free and open-source toolchains. Our pilot currently runs on FPGAs in our lab, and we are now opening it to outside researchers. If you have looked at nearly three decades of prior work and thought, “Maybe I can figure this out,” we want you to take part. The next advance in hardware-accelerated reasoning may well come from you.

30 years of FPGA SAT acceleration · 1998 – 2025

  1. 1998

    Accelerating Boolean Satisfiability with Configurable Hardware

    Zhong et al.

  2. 2004

    A Software/Reconfigurable Hardware SAT Solver

    Skliarova & Ferrari

  3. 2008

    A Practical Reconfigurable Hardware Accelerator for Boolean Satisfiability Solvers

    Davis et al.

  4. 2019

    SAT-Hard: A Learning-Based Hardware SAT-Solver

    Ustaoglu et al.

  5. 2025

    SAT-Accel: A Modern SAT Solver on a FPGA

    Lo, Chang & Cong

Launching early 2027

Coming Soon

The Agentic Satisfiability Acceleration Competition plans to launch in early 2027. For now, feel free to pre-register your team and learn more about competition participation.

Pre-register your team How to participate