Security, cryptography & verification
Hardness estimates and verification for cryptography and concurrent software.

Problems SpinForge models here
- Integer factoring
- Shortest-vector search on lattices
- Formal verification constraints
- Boolean satisfiability
Applications
Lattice Oracle
Estimates post-quantum lattice hardness.
After a recorded fix: shortest-vector search succeeds at dimensions 10, 20 and 30, at about 1.2 times the shortest length.
Product page Validated demoFormal Verify Engine
Checks concurrent programs for deadlock.
2 of 2 verdicts agree with exhaustive state exploration.
Product page Validated demoSAT Solver App
Satisfiability as an application on SpinForge.
Random 3-SAT, 30 variables and 90 clauses: satisfied.
Product pageProducts with measured results
Pricing
Security, cryptography & verification pack
$190,000 / year
$255,000 bought separately: 25% less as a pack.
- SpinForge + Atlas$90,000
- SAT$30,000
- Lattice Oracle$45,000
- Formal Verify Engine$45,000
- SAT Solver App$45,000
List prices are annual licences for a named scope; written orders set the final terms. Deployment and integration use the $15,000 workload assessment or the $30,000 focused sprint.
How to read these pages
- Validated demo
- One real instance solved end to end through the application and checked against the exact answer or an explicit legality check (GPU campaign box, June 2026). Instances are small; a demo is not a benchmark.
- Tested prototype
- Working software with a passing test suite. No benchmark result is recorded yet.
- Problem type
- A problem SpinForge + Atlas can turn into a model it solves. Ask us for results on your instances.
- Products
- Catalog products with measured results on their own pages.