A software that assists a previous version of the proof of Gerver's conjecture, using a custom geometric branch-and-bound algorithm, and the exact rational QP solver powered by CGAL
An interval library for OCaml
A Lean 4 formalization of the ternary (weak) Goldbach theorem, with an explicit audited finite and computational trust boundary.
Efficient Encoding of the Queen Domination Problem into SAT Using Hilbert Curve Ordering, Static Symmetry Breaking and CnC
Open-source re-implementation of DeepMind's unstable singularity detection methods using PINNs for blow-up solutions in fluid dynamics
Executable certificate framework for a proof candidate of Graham’s rearrangement conjecture / Erdős #475, with local branch checkers and reproducible audit scripts.
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
Complete reproducible working-proof chain and exact verification materials for Dittert’s conjecture (all dimensions; under review)
Open, fully rigorous re-certification of White's lower bound for Erdős's minimum-overlap problem (#36), with an independent verifier
https://en.wikipedia.org/wiki/Proof_assistant; 一錯特錯錯到底! 爆炸原理是重哪來的?
Certified spectral instability of the excited De Gregorio profile f₃ - interval-arithmetic certificates, one-command reproduction, and diagnostics for CAP pipelines.
Certified eliminations in the planar six-body central-configuration problem: paper, certificates, pinned solver inputs, and a dependency-free reproduction pipeline
Counterexample family for finite grand couplings with reproducible computer-assisted state minimality
Enumerate, solve, and prove all prime neoplatonic solids (equilateral triangulated spheres, max degree 6, no degree-3 vertices).
Computer-assisted proof that the minimal superpermutation on six symbols has length 872. Machine-checked evidence ledger, adversarial audits, 15-second verification path. Preliminary.
Calibrated residual-landscape survey of the linearized Navier–Stokes operator at the Hou–Wang–Yang self-similar profile
Python codes of the article "A note on optimal degree-three spanners of the square lattice" by Damien Galant and Cédric Pilatte, available on arXiv (see the link below).
CC0 unrefereed candidate all-N determination for Erdős Problem 848, with replayable exact certificates and AI-readable evidence maps
A tighter proven upper bound for the Erdős minimum overlap constant, with machine-verifiable certificates (note + code + certs).
Research preview: Axis-Servant bound, LRAT-refuted 6x4 support formula, and 6x3 frontier lemma
Add a description, image, and links to the computer-assisted-proof topic page so that developers can more easily learn about it.
To associate your repository with the computer-assisted-proof topic, visit your repo's landing page and select "manage topics."