The Case for Automated Hyperspecialization: Evidence from SAT
TL;DR
This paper explores one such problem, SAT solving, by synthesizing hundreds of workload-specific SAT solvers at an average cost of $37 each, and conjecture that coding agents make automated hyperspecialization cheap, effective, and safe for problems with measurable performance and checkable output.
Abstract
The software status quo is to use one system to process many different kinds of inputs. In contrast, we propose hyperspecialization: creating new software that is optimized for a single class of inputs. Hyperspecializing manually is anywhere from expensive to impossible. We conjecture that coding agents make automated hyperspecialization cheap, effective, and safe for problems with measurable performance and checkable output. This paper explores one such problem, SAT solving, by synthesizing hundreds of workload-specific SAT solvers at an average cost of \$37 each. Our specialists outperform their competition-winning, general-purpose cousins by 5$\times$ on average, and by over $10\times$ on a quarter of benchmark families. A general-purpose solver constructed from over a hundred of our prototype hyperspecialists won the SAT track at the 2026 SAT Competition.