Satisfiability Problem

The satisfiability problem, often denoted as SAT, is the fundamental computational problem of determining if there exists an assignment of values to variables that makes a given logical formula true. In the context of blockchain security, it is the theoretical basis for constraint solving.

If a vulnerability in a smart contract can be expressed as a logical formula, then the satisfiability problem is to find the inputs that make that formula true, effectively uncovering the exploit. While the general satisfiability problem is NP-complete, modern SMT solvers use advanced heuristics to solve it efficiently for many practical code-related constraints.

It is the core challenge that automated security tools strive to overcome. Understanding this problem is key to grasping how formal analysis finds hidden bugs.