Certificate-backed verification for known Schur and van der Waerden values, with explicit trusted bases.
-
Updated
Jun 19, 2026 - Python
Certificate-backed verification for known Schur and van der Waerden values, with explicit trusted bases.
Lean 4 verification portfolio: certified combinatorics, LRAT checking, toy robustness, and claim-boundary discipline.
Certified, composable map of impossibility claims with machine-checkable certificates and explicit trust rungs.
SAT + verified LRAT certificate for a covering-system lower bound (Erdős #273), plus a segmented sieve extending verified ranges for #385 and #647 to 1.0011e12
Add a description, image, and links to the lrat topic page so that developers can more easily learn about it.
To associate your repository with the lrat topic, visit your repo's landing page and select "manage topics."