Half a Billion Spins. 21 Seconds. One GPU.
Configure a problem and watch the engine solve it in real time.
Live demonstrations proving engine capability across 6 real-world domains.
Classic 3-regular graph with known optimal cut of 12/15 edges. Verify the engine finds the exact solution.
The FMO light-harvesting complex transfers energy at 95%+ efficiency via quantum coherence. Find the optimal energy pathway.
Partition co-occurring cancer mutations to separate driver mutations from passenger noise using graph partitioning.
Color edges of the complete graph on 9 vertices avoiding monochromatic triangles and K4 cliques. A frontier combinatorics problem.
Find the shortest tour visiting 10 cities exactly once. The quintessential NP-hard routing problem solved via Ising encoding.
At the critical clause ratio α=4.267, satisfiability undergoes a sharp phase transition. Navigate this computational boundary.
Sherrington-Kirkpatrick model with dense random couplings. The prototypical NP-hard problem from statistical mechanics.
Markowitz mean-variance portfolio selection encoded as QUBO with cardinality constraints. Find the minimum-risk asset allocation.
Partition a drug-drug interaction graph to identify potentially dangerous combination clusters.
Optimize warehouse-to-store delivery routes across a clustered distribution network.
Partition a network graph to isolate vulnerable nodes from critical assets.
Optimize item placement to minimize picker travel distance using co-order frequency.
Optimize a simplified protein folding energy landscape on a lattice model.
Schedule 16 exams across time slots to minimize student conflicts.
Performance data from reproducible benchmark suites.
Run a live GPU benchmark at 500K, 1M, 2M, 5M, and 10M spins on the RTX 6000 Ada (48GB VRAM).
RESTful JSON API for programmatic access. All endpoints are proxied with server-side authentication.
/v1/solve
Submit a problem for solving. Returns a job ID for async polling.
// Request
{
"problem_type": "maxcut",
"n": 10,
"edges": [[0,1,1.0], [1,2,-0.5], [2,3,1.0]],
"preset": "production"
}
// Response
{
"job_id": "j_8f3a2b1c",
"status": "queued"
}/v1/jobs/{id}
Poll the status and result of a solve job.
{
"job_id": "j_8f3a2b1c",
"status": "completed",
"result": {
"best_energy": -3064.0,
"best_solver": "SA",
"best_spins": [1, -1, 1, "..."],
"elapsed_secs": 0.142,
"i_value": 0.847,
"t_class": "GueRandom",
"solver_order": ["SA", "SBM", "..."],
"all_results": [
{"solver_name": "SA", "energy": -3064.0, "elapsed_secs": 0.142, "stagnated": false},
{"solver_name": "SBM", "energy": -3060.0, "elapsed_secs": 0.098, "stagnated": false}
]
}
}/v1/info
Returns engine capabilities, supported problem types, and limits.
{
"name": "DSC-3 Isomorphic Engine",
"version": "3.2.0",
"solvers": 16,
"gpu_available": true,
"features": ["auto_sparse", "z2_symmetry", "spectral_analysis"],
"problem_types": ["maxcut", "ising", "sat", "tsp", "ramsey", "qubo"],
"presets": ["fast", "production", "quality"],
"max_n": 50000000
}/v1/health
Returns engine health status and uptime.
{
"status": "healthy",
"uptime_secs": 84321
}/v1/generate
Generate a random problem instance for testing or benchmarking.
// Request
{
"n": 500,
"density": 0.1,
"seed": 42
}
// Response
{
"problem_type": "ising",
"n": 500,
"matrix": [[0.0, 0.73, -1.2, "..."], "..."],
"field": [0.1, -0.3, "..."]
}