Platform
One platform. Unlimited compute.
A 5-layer architecture that connects researchers, AI orchestration, distributed compute, and mathematical verification into a single platform.
Architecture
How it all fits together
Five layers, each with a clear responsibility. Problems flow down, results flow up.
Researchers
Define problemsDefine research initiatives, configure search parameters, and set verification requirements.
AI Engine
OrchestrateOODA decision loop observes network state, scores opportunities across 10 dimensions, and allocates compute.
Coordinator
DistributeGenerates work blocks, distributes to nodes via PostgreSQL row-level locking, tracks progress.
Nodes
ComputeOperator nodes claim work blocks, run sieve and primality tests in parallel using GMP and PFGW.
Verification
Prove3-tier verification: deterministic proofs (Pocklington/Morrison/BLS), BPSW+MR, and PFGW confirmation.
AI-orchestrated intelligence
The AI Engine
A unified decision loop that replaces manual strategy with autonomous, data-driven orchestration.
OODA Decision Loop
Observe network state, Orient with scoring model, Decide on resource allocation, Act by dispatching work, Learn from outcomes.
10-Component Scoring
Record gap, yield rate, cost efficiency, opportunity density, network fit, momentum, competition, GPU fit, storage fit, network locality.
Autonomous Learning
Online gradient descent on scoring weights, drift detection between snapshots, budget gates and stall penalties for safety.
How it works
Discovery Pipeline
Every candidate passes through four stages. Only proven primes survive.
Sieve
ELIMINATED
Wheel factorization, BSGS, and Pollard P-1 filtering remove composites before testing.
Test
MR ROUNDS
Proth, LLR, Pépin, and Frobenius tests accelerated by PFGW for large candidates.
Prove
DETERMINISTIC
Pocklington, Morrison, and BLS certificates with full witness data. Verifiable.
Coordinate
BLOCK CLAIM
Operator nodes claim work blocks via PostgreSQL. Results verified through trust-based quorum with adaptive replication.
Sieve
ELIMINATED
Wheel factorization, BSGS, and Pollard P-1 filtering remove composites before testing.
Test
MR ROUNDS
Proth, LLR, Pépin, and Frobenius tests accelerated by PFGW for large candidates.
Prove
DETERMINISTIC
Pocklington, Morrison, and BLS certificates with full witness data. Verifiable.
Coordinate
BLOCK CLAIM
Operator nodes claim work blocks via PostgreSQL. Results verified through trust-based quorum with adaptive replication.
Sieve
STEP 1
Wheel factorization, BSGS, and Pollard P-1 filtering remove composites before testing.
Test
STEP 2
Proth, LLR, Pépin, and Frobenius tests accelerated by PFGW for large candidates.
Prove
STEP 3
Pocklington, Morrison, and BLS certificates with full witness data. Verifiable.
Coordinate
STEP 4
Operator nodes claim work blocks via PostgreSQL. Results verified through trust-based quorum with adaptive replication.
Built with
Technology Stack
Rust
Zero-cost abstractions, memory safety, and fearless concurrency for the engine and server.
GMP (rug)
GNU Multiple Precision Arithmetic — the gold standard for arbitrary-precision integer math.
PFGW / GWNUM
Specialized number theory software for 50-100x acceleration on large primality tests.
PostgreSQL
Relational database for primes, workers, jobs, and work distribution with row-level locking.
Axum
Async Rust web framework for the coordinator REST API and WebSocket server.
Next.js
React framework for the dashboard (app.darkreach.ai) and website (darkreach.ai).
Be part of something bigger
Join researchers and operators building the world's biggest supercomputer. Get early access when we launch.