Spaces:
Sleeping
Sleeping
File size: 2,601 Bytes
886f2cc 3459700 886f2cc c4326a3 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 886f2cc 3459700 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | ---
title: Daugherty Engine
emoji: 🧮
colorFrom: green
colorTo: blue
sdk: gradio
sdk_version: 5.9.1
python_version: "3.10"
app_file: app.py
pinned: false
license: apache-2.0
short_description: GPU-accelerated SAT & Ising solver - quantum-competitive
tags:
- optimization
- sat-solver
- ising-model
- constraint-satisfaction
- quantum-computing
- gpu
- nvidia
---
# Daugherty Engine
**GPU-accelerated constraint satisfaction and combinatorial optimization achieving quantum-competitive results on classical hardware.**
## What You Can Test
| Problem Type | Description | Quantum Equivalent |
|-------------|-------------|-------------------|
| **3-SAT** | Boolean satisfiability at phase transition (α=4.27) | Gate-based quantum computing |
| **Ising Model** | Spin glass energy minimization | Quantum annealing (D-Wave) |
## Key Results
- **128x more power efficient** than D-Wave Advantage
- **8x cheaper** per solve than quantum cloud services
- Runs on a single NVIDIA RTX 6000 Ada ($1.57/hour)
## How It Works
This Space provides **API-only access** to the Daugherty Engine. No proprietary algorithms or source code are exposed. You interact with the same verification endpoints available at [1millionspins.originneural.ai](https://1millionspins.originneural.ai).
### API Endpoints Used
- `POST /api/verify/sat` - 3-SAT verification
- `POST /api/verify/ising` - Ising model optimization
- `GET /api/health` - System status
## The Science
### 3-SAT at Phase Transition
At the clause-to-variable ratio α = 4.27:
- Problems are maximally hard (neither clearly SAT nor UNSAT)
- This is the "computational phase transition"
- First proven NP-complete problem (Cook-Levin, 1971)
### Ising Model
The Ising Hamiltonian: `H(s) = -Σᵢⱼ Jᵢⱼ sᵢ sⱼ - Σᵢ hᵢ sᵢ`
- Native problem type for quantum annealers
- Maps to QUBO (Quadratic Unconstrained Binary Optimization)
- Applications: portfolio optimization, logistics, ML
## Hardware
| System | Power | Cost/Hour | Qubits/Cores |
|--------|-------|-----------|--------------|
| **Daugherty Engine** | 195W | $1.57 | 18,176 CUDA |
| D-Wave Advantage | 25kW | $13.20 | 5,000 qubits |
| IBM Quantum | 15kW | $1.60 | 127 qubits |
## Links
- [Full Demo](https://1millionspins.originneural.ai) - Interactive visualizations
- [Origin Neural](https://originneural.ai) - Company website
- [SmartLedger Solutions](https://smartledger.solutions) - Blockchain partner
## Contact
**Shawn@smartledger.solutions**
---
*Built with [Gradio](https://gradio.app) on [Hugging Face Spaces](https://huggingface.co/spaces)*
|