Daugherty Engine
GPU-accelerated constraint satisfaction and combinatorial optimization. Achieving quantum-competitive results on classical hardware.
Available Tests
| Problem | Description | Quantum Equivalent |
|---|---|---|
| 3-SAT | Boolean satisfiability at phase transition | Gate-based QC |
| Ising | Spin glass energy minimization | Quantum Annealing |
20 500
1 20
Problem Preview
| Parameter | Value |
|---|---|
| Variables | 100 |
| Clauses | 426 |
| Ratio (α) | 4.27 |
| Search Space | 2^100 (1.27e+30) |
| Difficulty | Medium |
Requires seconds
Click 'Run SAT Verification' to test
API-only demo — no proprietary code exposed. Built with Gradio.