The Clay Institute offers $1,000,000 for each of six unsolved problems.
Every one has a finite mirror in the ring Z/2310Z.
Not solutions — structural reflections. All computed. All verifiable.
Click each problem. Run the computation yourself.
1318 lines of C → JavaScript. gcc -O2 -lm. Zero dependencies.
Six of humanity's hardest problems. All have finite mirrors in the ring. All break at the same threshold. 1318 lines of C. Zero dependencies.
| CRT ANALYSIS | STANDARD STATUS | |
|---|---|---|
| Riemann | Poisson (KS=0.027). CRT = integrable. | Unsolved (164 years) |
| Yang-Mills | gap = 4sin²(π/p). Exact formula. | Unsolved (70 years) |
| P vs NP | 82.5x CRT speedup on Z/2310Z | Unsolved (53 years) |
| Navier-Stokes | 5 independent channels. Regularity. | Unsolved (180 years) |
| Hodge | FAILS. 30 unreachable classes. | Unsolved (84 years) |
| BSD | L-value = product of 5 CRT factors | Unsolved (59 years) |