The Fast Rust-Powered SAT Solver API
Spectral SAT solving — 1.34n vs 4n complexity on structured UNSAT.
Your App HYP3RSAT
│ │
│ POST /v1/solve │
│ {"cnf": "p cnf..."} │
├──────────────────────────►│
│ │ ┌─────────────────┐
│ │ │ Spectral CDCL │
│ │ │ Solver Engine │
│ │ └─────────────────┘
│◄──────────────────────────┤
│ {"status": "SAT", │
│ "assignment": [1,-2,3]} │
▼ ▼
Powered by proprietary spectral heuristics that dramatically reduce search space.
Achieves 1.34n conflict scaling vs resolution's 4n (Haken lower bound).
PHP-12: 0.04s (MiniSat/Kissat timeout) | PHP-21: 0.9s (both timeout) | Queens-11: 2 conflicts
Proprietary eigenspace techniques reduce clause complexity, achieving 1.34n scaling vs resolution's 4n on structured problems. The core breakthrough behind our performance.
Auto-detects problem structure and selects optimal solving strategy. Near-optimal polarity selection on structured instances — Queens-11 solves with just 2 conflicts.
On pigeonhole PHP-n: MiniSat needs ~4n conflicts (Haken bound). HYP3RSAT achieves ~1.34n — solving PHP-21 in 0.9s while MiniSat would need years.
Pure HTTP API on Cloudflare's edge. Works from Python, JavaScript, Go, Rust, curl. No dependencies to manage — just send CNF, get results.
# Python import requests result = requests.post( "https://api.hyp3rsat.com/v1/solve", headers={"Authorization": "Bearer YOUR_KEY"}, json={"cnf": "p cnf 3 2\n1 -2 0\n2 3 0"} ).json() print(result["status"]) # "SAT" print(result["assignment"]) # [1, -2, 3] print(result["runtime_ms"]) # 0.4