Notable P vs. NP proof attempts.
-
Updated
Aug 18, 2023
#
p-vs-np
Here are 28 public repositories matching this topic...
This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.
polynomial-time computational-complexity non-determinism complexity-theory millennium-problems p-vs-np unsolved-problems
-
Updated
Oct 24, 2022
Formal verification of the logical incompatibility between the P=NP hypothesis and the Witten-Helffer-Sjöstrand tunneling theorems in spectral geometry. Implemented in Lean 4.
-
Updated
Feb 19, 2026 - Lean
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
-
Updated
Jul 10, 2025 - TeX
P ≠ NP via Ising Energy Landscape Fragmentation — OGP 0.00%, 35/35 checks, n = 50,000, SOS conjecture ⟹ P ≠ NP
gpu-computing ising-model computational-complexity 3sat spin-glass p-vs-np millennium-prize omega-24 overlap-gap-property
-
Updated
Apr 8, 2026 - TeX
Unity Equilibrium Theory (UET)
python research physics information-theory equation computational-physics fluid-dynamics quantum-gravity p-vs-np unified-theory neutrino-mass dark-matter-alternative origin-of-life yang-mills-mass-gap muon-g-2 conomic-stability hubble-tension-solution
-
Updated
Apr 5, 2026 - Rust
Machine-verified proof (0 sorries, 2 axioms) that P ≠ NP via exponential circuit lower bounds for Hamiltonian Cycle. Lean 4 formalization with Mathlib. Proves SIZE(HAM_n) ≥ 2^{Ω(n)} using frontier analysis, switch blocks, cross-pattern mixing, recursive funnel magnification, continuation packets, rooted descent, and signature rigidity.
-
Updated
Mar 29, 2026 - Lean
A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.
python computer-science benchmarking logic-programming cnf sat-solver heuristics sat 3sat p-vs-np p-vs-np-problems
-
Updated
Jun 14, 2025 - Python
OPEN PROBLEMS WANT TO STAY OPEN
physics philosophy theorem-proving mathematics navier-stokes pde formal-verification complexity-theory mathlib p-vs-np riemann-hypothesis lean4 open-source-research yang-mills hodge-conjecture birch-swinnerton-dyer poincare-conjecture millennium-prize-problems clay-millennium-prize sos-certificates
-
Updated
Apr 20, 2026 - Python
Labs for the Advanced Algorithms course
algorithms graph-algorithms dynamic-programming state-machines depth-first-search string-matching string-search heaps red-black-trees deflate-algorithm boyer-moore-algorithm splay-trees p-vs-np euler-circuit
-
Updated
Aug 31, 2023 - C++
Terminal obstruction (Cyclone) for locality-bounded computation: overlap-rank BOM, AKR CPD₁ kernel, entropy-depth lower bounds, and Lean formalization toward P≠NP.
entropy information-theory logic proof-assistant locality lean kernel-methods formal-verification computational-complexity p-vs-np expanders rigidity finite-model-theory ef-games
-
Updated
Apr 17, 2026 - Lean
Reframing the P vs NP Problem
-
Updated
Jan 4, 2026
Novel mathematical framework connecting P vs NP to the golden ratio phi via witness space geometry. Part of the unified E8/H4/phi theory.
mathematics np-complete fibonacci golden-ratio theoretical-computer-science sat-solver algorithm-analysis lower-bounds phi computational-complexity hamming-distance boolean-satisfiability satisfiability renormalization complexity-theory phase-transition p-vs-np e8-lattice millennium-prize witness-space
-
Updated
Jan 27, 2026 - Python
An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.
python research np-complete discrete-mathematics mathematical-logic polynomial-time subset-sum complexity-theory computational-theory p-vs-np algorithamic-complexity structured-algorithams
-
Updated
Jul 25, 2025 - TeX
Informational Repo covering the Satisfiability of formulas in 3 Conjunctive Normal Form. Includes Demos of solving algorithms, and detailed analysis.
-
Updated
Jan 9, 2025 - Python
Investigacion experimental abierta sobre P vs NP: transicion de fase SAT, geometria del espacio de soluciones y complejidad computacional. Con IA. @Investigador_Amateur
-
Updated
Apr 11, 2026 - Jupyter Notebook
Structural analyses of 11 Millennium-Class challenges (01/30/2026). Using the XYAKANYAA System, the repository documents how expanded observational context yields harmonic stabilization. Experimental, reproducible, and open to refutation.
reproducible-research geometry jupyter-notebook mathematics computational-mathematics navier-stokes golden-ratio collatz-conjecture phi millennium-problems p-vs-np riemann-hypothesis consciousness-studies hodge-conjecture abc-conjecture birch-swinnerton-dyer-conjecture poincare-conjecture yang-mills-mass-gap langlands-problem
-
Updated
Apr 3, 2026 - Jupyter Notebook
Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis
-
Updated
Sep 3, 2025 - Python
cNP-TSP — Resonance-Guided Fixed-Point Solver
travelling-salesman-problem complexity-theory p-vs-np resonance-field algorithmic-proof deterministic-solver fixed-point-emergence constructive-np global-optimum
-
Updated
Mar 3, 2026 - Python
Improve this page
Add a description, image, and links to the p-vs-np topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the p-vs-np topic, visit your repo's landing page and select "manage topics."