Certified companion to the Dixmier counterexample in A3 + explicit Poisson-conjecture witness (runnable exact-arithmetic certificate)
The Koras-Russell cylinder as an affine modification of A^4 — a commuting square through a motivic 4-sphere, a one-point Borel-Moore defect, and a machine-certified verification layer anyone can re-run in one command
Open, fully rigorous re-certification of White's lower bound for Erdős's minimum-overlap problem (#36), with an independent verifier
Certified exact-integer verifier and certificate for prime-power threshold cutoff tail bounds.
Add a description, image, and links to the certified-computation topic page so that developers can more easily learn about it.
To associate your repository with the certified-computation topic, visit your repo's landing page and select "manage topics."