≈2.6× the bug-catch rate of a plain LLM prompt
7 of 9vs3 of 10
Open-source bug cases found: Chipster against a single plain prompt to the same model.
Formal verification that compounds
Every proof should make the next one easier.
Frontier search and quantitative discipline, applied to formal verification.
01Search
Search built to compound.
Each pass informs the next.
Fig. 01
Results
Measured.
Matched open upstream PR #81 on Xilinx open-nic-shell.
1,010
1,010 candidate assertions, 558 proved, 315 counterexamples on an open I2C controller.
Compounding
Small gains, kept.
Fig. 06
Fig. 07
1240+600
Candidate checkers explored (illustrative)94%+16%
310+87
Checker patterns carried to the next design (illustrative)Silicon