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
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)
Executable certificate framework for a proof candidate of Graham’s rearrangement conjecture / Erdős #475, with local branch checkers and reproducible audit scripts.
Computer-certified seven-point refinement for a 67.30255% research-draft lower bound on simple critical-line zeta zeros
Computer-assisted proof that the minimal superpermutation on six symbols has length 872. Machine-checked evidence ledger, adversarial audits, 15-second verification path. Preliminary.
Open, fully rigorous re-certification of White's lower bound for Erdős's minimum-overlap problem (#36), with an independent verifier
Computer-assisted proof that the 7₂ knot regulator integral in Ramanujan Challenge 3.1 equals 4π²/85.
Calibrated residual-landscape survey of the linearized Navier–Stokes operator at the Hou–Wang–Yang self-similar profile
https://en.wikipedia.org/wiki/Proof_assistant; 一錯特錯錯到底! 爆炸原理是重哪來的?
Computer-assisted proof and reproducibility package for Erdős Problem 848, with exact certificates and separately implemented checkers.
Candidate resolutions of R(C4,K1,39) and R(C4,K1,51), with exact verification artifacts
Certified theorems closing the transitive case of Frankl's union-closed conjecture up to 15 points: no family invariant under any transitive permutation group on up to 15 points violates the conjecture. LRAT certificates, formally verified checking (cake_lpr). Sequel to frankl-cyclic-sat.
Edges of the uniform random forest of K_n are pairwise negatively correlated for every n — paper and exact verification
Certified eliminations in the planar six-body central-configuration problem: paper, certificates, pinned solver inputs, and a dependency-free reproduction pipeline
Computer-assisted proofs and clean-room audits for the r=10 and r=11 fixed cases of Erdős Problem 617.
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."