Disk covering problem (disc covering): global optimality proof claims for n = 11-20, exact certificates, Chinese proofs, and reproducible verification code. External review pending.
Open-source re-implementation of DeepMind's unstable singularity detection methods using PINNs for blow-up solutions in fluid dynamics
在固定尺规模型下研究最少作图步数：提供正十七边形 17E 与正257边形 69E 构造的精确证书、SageMath 验证、搜索记录和 Manim 动画。
Certified analytic geometry on an explicit K3 surface: a finite holomorphic atlas whose chart domains, transitions and branch continuations are machine-checked rather than asserted. Sixty chart types, exact transitions over Q, outward-rounded arithmetic elsewhere. No Ricci-flat metric claimed. One command checks nine of the fourteen certificates.
Audit the declarations a computational result carries, and check they are still true. Producer freshness, counter coherence, provenance pins, partial runs. Read-only by construction.
Proof claims and reproducible verification for the r=5,6,7,8 cases of Erdős Problem 617.
Computer-assisted proof that the minimal superpermutation on six symbols has length 872. Machine-checked evidence ledger, adversarial audits, 15-second verification path. Preliminary.
Rigorous partial progress toward a global 68.10% PairCeiling certificate
Complete reproducible working-proof chain and exact verification materials for Dittert’s conjecture (all dimensions; under review)
An adversarial, fully-banked search for a Navier-Stokes blow-up certificate: 440 legs, no solution found, and an honest record of why. Every claim tiered, every gate falsifiable, all data banked. Independently kernel-checked the Lean Navier-Stokes formalisation. MIT + CC BY - fork it and carry on.
Exact tensor-product and commuting-operator I3322 quantum supremum with finite-dimensional nonattainment and independently replayable certificates.
Computer-assisted proof that no [[14,3,5]] qubit stabilizer code exists, with exact certificates
Research notes, exact computations, and reproducible verification for MathOverflow 413935
Computer-assisted research on the covering number C(16,5,3). New certified lower bound: no 61-block cover exists, so 62 <= C(16,5,3) <= 65 (DRAT proofs verified). CC BY 4.0.
Computer-assisted proofs and clean-room audits for the r=10 and r=11 fixed cases of Erdős Problem 617.
Exact verification code and certificates for phase transitions in generalized Damascus inequality violation sets.
Proofs, finite certificates, and reproducible SAT/XOR records for crossing-maximal complete-graph drawings.
Counterexample family for finite grand couplings with reproducible computer-assisted state minimality
AI-assisted, unreviewed research artifact for a candidate 67.302666% lower bound on simple critical-line zeta zeros.
Computer-assisted proof and reproducibility package for Erdős Problem 848, with exact certificates and separately implemented checkers.
To associate your repository with the computer-assisted-proof topic, visit your repo's landing page and select "manage topics."