Where do you want to start?

The site hosts 573 research papers — too many to read linearly. Pick one of the three paths below. Each is a curated sequence that gets you to a useful understanding in about an hour.

I want to understand the thesis

Start with the Latent framework
  1. The Latent: Finite Sufficient Representations of Smooth Systems
  2. The Operational Curry–Howard: Proof Discovery as Navigated Software Architecture
See the methodology collection →

I want to see the hardest problems

Millennium & Smale problems
  1. Grade Decomposition and Gevrey Regularity for Navier-Stokes: A Machine-Checked Conditional Framework
  2. Dimension-Independent Finiteness of Central Configurations for Positive Masses
  3. The Riemann Hypothesis via Zeta Moment Hankel Positivity
Browse all problems →

I want machine-verified results

Papers with Lean 4 proofs
  1. The Operational Curry–Howard: Proof Discovery as Navigated Software Architecture
  2. Adam's Convergence Proof Was Wrong: A Machine-Checked Verification of the Bug and the Fix
  3. Turbulence Scaling Laws from the Grade Equation: Kolmogorov Spectrum and Intermittency from Analyticity
Browse the proof catalog →

Not sure yet?

Browse the Collections for themed reading lists, the Problems page for open questions the research targets, or the Graph for a visual map of how every paper connects to every other.