Four Certified Builds: Toroidal Proofs, Unroutability Certificates, CertBQP and a 235× Batch Service
15 of 17 Toroidal Gset Instances Proved Optimal; Routing Infeasibility Certified in Seconds; Every Claim Checked.
15/17toroidal Gset instances proved optimal
0false infeasibility certificates
12/12k-cluster ER n = 40 proved (CertBQP)
235×batched throughput vs one by one
- Toroidal: 15/17 proved optimal, bound gaps closed vs CertCut on every instance
- Unroute: 0 false infeasibility on unmodified files; certificates in 2–76 s
- CertBQP: ER n = 40 12/12 proved; behind HiGHS on MIS and QKP
- Batch: 235× throughput, 200/200 reference hits vs 135/200
More garmo solvers benchmark results
- Proof-Carrying Max-Cut on a GH200: 67 Biq Mac Optima Proved vs HiGHS's 49
- Weighted MaxSAT on a GH200: From 14/33/50 to 33/38/26 Against NuWLS-c-IBR
- Large-Instance TSP on 16 Arm Cores: 0.692 % → 0.165 % Mean Gap, Still Behind LKH-3
- A Native QCDCL Solver vs DepQBF: From 0 vs 4 to a 15–15 Tie, Then 15 vs 18 on Fresh Instances
- Vehicle Routing vs PyVRP: a C++ Iterated Local Search Wins 37/26/21 at Equal Budget
- ISPD98 Bisection: a Multilevel FM + Flow Engine Beats KaHyPar and mt-KaHyPar at Equal Budget
- An Evidence-Driven Solver Router: Regret 0.046 vs 0.190 for the Best Single Backend
- A Verified MIP Race: HiGHS, SCIP and GPU Primal Heuristics Against cuOpt on MIPLIB 2017
- Lazy Clause Generation in C++: 39 of 40 Schedules Proved Optimal vs CP-SAT's 20
- Certified GPU Numerics: Every Answer Carries a Checkable Certificate: and Where It Costs
- LABS on a GH200: Exponent 1.24 to the Proven Optimum, Beside the QAOA Exponents
- UNISOLVE 0.16.1: One Solver Platform, 13 Problem Domains, Every Answer Checked