The Case for Automated Hyperspecialization: Evidence from SAT

📅 2026-09-13
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文通过自动化超专业化方法,为特定输入类别合成高效的SAT求解器,成本低廉且性能显著优于通用求解器。
📝 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.
Problem

Research questions and friction points this paper is trying to address.

hyperspecialization
software
single class of inputs
automated
performance
Innovation

Methods, ideas, or system contributions that make the work stand out.

automated hyperspecialization
SAT solving
workload-specific solvers
performance improvement
🔎 Similar Papers
No similar papers found.