---
title: Proof-Carrying Max-Cut on a GH200: 67 Biq Mac Optima Proved vs HiGHS's 49 | SpinForge
url: https://spin-forge.com/proof/s01
description: 67 vs 49: Biq Mac instances proved optimal, CertCut vs HiGHS (148). Rigorous Bounds in a GPU Branch-and-Bound, Every Proof Re-Checked by an Independent…
---

GARMO SOLVERS · S01

# Proof-Carrying Max-Cut on a GH200: 67 Biq Mac Optima Proved vs HiGHS's 49

Rigorous Bounds in a GPU Branch-and-Bound, Every Proof Re-Checked by an Independent Verifier.

67 vs 49 Biq Mac instances proved optimal, CertCut vs HiGHS (148)

58/83/7 wins / ties / losses vs HiGHS

71/71 Gset upper bounds re-verified by the CPU verifier

L = 9 2-D ±J torus: every seed proved up to n = 81

- Full Biq Mac: 67 vs 49 proved; W/T/L 58/83/7; 0 bound mismatches
- Sparse families (pre-declared 48): 44 vs 40 proved, 33/6/9
- Gset 71/71 rigorous bounds verified VALID; median certified gap 10.05 %
[Request the full poster by email](https://spin-forge.com/contact?product=portfolio&brief=Please%20send%20the%20full%20poster%3A%20Proof-Carrying%20Max-Cut%20on%20a%20GH200%3A%2067%20Biq%20Mac%20Optima%20Proved%20vs%20HiGHS%27s%2049%20%28S01%29.%0A%0AOur%20organization%20and%20intended%20use%3A%0A)

## More garmo solvers benchmark results

- [Weighted MaxSAT on a GH200: From 14/33/50 to 33/38/26 Against NuWLS-c-IBR](https://spin-forge.com/proof/s02)
- [Large-Instance TSP on 16 Arm Cores: 0.692 %  0.165 % Mean Gap, Still Behind LKH-3](https://spin-forge.com/proof/s03)
- [A Native QCDCL Solver vs DepQBF: From 0 vs 4 to a 15–15 Tie, Then 15 vs 18 on Fresh Instances](https://spin-forge.com/proof/s04)
- [Vehicle Routing vs PyVRP: a C++ Solver Wins 37/26/21 at Equal Budget](https://spin-forge.com/proof/s05)
- [ISPD98 Bisection: Our Partitioner Beats KaHyPar and mt-KaHyPar at Equal Budget](https://spin-forge.com/proof/s06)
- [An Evidence-Driven Solver Router: Regret 0.046 vs 0.190 for the Best Single Backend](https://spin-forge.com/proof/s07)
- [A Verified MIP Race: HiGHS, SCIP and GPU Primal Heuristics Against cuOpt on MIPLIB 2017](https://spin-forge.com/proof/s08)
- [Constraint Programming in C++: 39 of 40 Schedules Proved Optimal vs CP-SAT's 20](https://spin-forge.com/proof/s09)
- [Certified GPU Numerics: Every Answer Carries a Checkable Certificate: and Where It Costs](https://spin-forge.com/proof/s10)
- [LABS on a GH200: Exponent 1.24 to the Proven Optimum, Beside the QAOA Exponents](https://spin-forge.com/proof/s11)
- [UNISOLVE 0.16.1: One Solver Platform, 13 Problem Domains, Every Answer Checked](https://spin-forge.com/proof/s12)
- [Four Certified Builds: Toroidal Proofs, Unroutability Certificates, CertBQP and a 235× Batch Service](https://spin-forge.com/proof/s13)

[All results, charts and papers](https://spin-forge.com/proof)

Results describe the stated inputs, hardware and conditions and are not a guarantee of results in your environment. See the [Terms of Use](https://spin-forge.com/terms).