Reproduce “SAT Sampling at Scale via GPU-based Boolean Constraint Propagation” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Alexander Nadel, Yogev Shalmon, Ofer Strichman
Gpap-S generates valid hardware-verification stimuli by propagating many independent candidate assignments against shared constraints on a GPU. Contradictory candidates are discarded, while completed assignments yield valid samples. In Sequential rare-target tests at T=25, it produced 67,600 samples per second versus CMSGen’s 811, a reported 83.4× geometric-mean speedup across 18 instances where both emitted; this comparison covers the tested setup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.