Notable P vs. NP proof attempts.

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.

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.

python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time

P ≠ NP via Ising Energy Landscape Fragmentation — OGP 0.00%, 35/35 checks, n = 50,000, SOS conjecture ⟹ P ≠ NP

Unity Equilibrium Theory (UET)

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.

A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.

OPEN PROBLEMS WANT TO STAY OPEN

P != NP

Terminal obstruction (Cyclone) for locality-bounded computation: overlap-rank BOM, AKR CPD₁ kernel, entropy-depth lower bounds, and Lean formalization toward P≠NP.

Labs for the Advanced Algorithms course

Reframing the P vs NP Problem

Novel mathematical framework connecting P vs NP to the golden ratio phi via witness space geometry. Part of the unified E8/H4/phi theory.

An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.

Informational Repo covering the Satisfiability of formulas in 3 Conjunctive Normal Form. Includes Demos of solving algorithms, and detailed analysis.

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.

Investigacion experimental abierta sobre P vs NP: transicion de fase SAT, geometria del espacio de soluciones y complejidad computacional. Con IA. @Investigador_Amateur

"Formal Audit and Systematic Convergence of the Millennium Prize Problems using the 107.19 Master Space-Lock with the raw .0214- .03 latency from the average of the magnetic field and .67 Logic Gate."

Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis