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

Enumerate, solve, and prove all prime neoplatonic solids (equilateral triangulated spheres, max degree 6, no degree-3 vertices).

Certified spectral instability of the excited De Gregorio profile f₃ - interval-arithmetic certificates, one-command reproduction, and diagnostics for CAP pipelines.

https://en.wikipedia.org/wiki/Proof_assistant; 一錯特錯錯到底! 爆炸原理是重哪來的?

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

Calibrated residual-landscape survey of the linearized Navier–Stokes operator at the Hou–Wang–Yang self-similar profile

Proof package for a certified pointwise lower bound in the Erdős unit-distance problem

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

An independent structural proof excluding the (72,108) case of the plane Jacobian Conjecture (GGHV, arXiv:2204.14178) — conditionally raising the counterexample degree bound from 108 to 125. Priority for the exclusion is B. Helali's (doi:10.5281/zenodo.21479814). Exact sympy checkers, spec-only auditors, Lean-certified core identity.

A tighter proven upper bound for the Erdős minimum overlap constant, with machine-verifiable certificates (note + code + certs).