All packages

Mintpath/p_ne_np

p_ne_np

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.

This is package metadata from a pinned Reservoir snapshot. It is not an imported proof corpus, an authorship claim, or a Therefore verification record.

2 GitHub starsMIT2 indexed versionsRepositoryFull history on Reservoir
math

Head version

f46d48e5b127

f46d48e5b127f18245429d18b74aef8f030f773a

Toolchain
leanprover/lean4:v4.28.0
Revision date
29 Mar 2026
Dependencies
9
Versions
2

External build observation

Exact head commit and toolchain

Reservoir recorded build status passed and test status not observed for commit f46d48e5b127 with leanprover/lean4:v4.28.0 on 17 Jun 2026. Therefore did not run this build.

Pin this source in lakefile.lean

require p_ne_np from git "https://github.com/Mintpath/p-neq-np-lean.git" @ "f46d48e5b127f18245429d18b74aef8f030f773a"

Discovery boundary

Searchable package, not yet an imported proof corpus

This page comes from a pinned Reservoir index snapshot. Therefore has not imported or independently built this package's declarations. Reservoir provider observations never change a Therefore verification status.

Index commit b6ac225af74cd6d6252fc559e3c4a085c46c618b

Inspect full package history