nx_proofs_pvsnp_pending.nx
buildroot/runtime/nx_proofs_pvsnp_pending.nx
about
nx_proofs_pvsnp_pending.nx -- honest treatment of Wiedijk #92 P vs NP.
Per user 2026-05-14: "why would you skip just solve".
Honest answer: nobody has solved P vs NP -- it's an open Clay
Millennium Prize problem since Cook 1971 (55 years). My 2-3 node
derivation chains kernel-verify STRUCTURAL VALIDITY (the inference
rules + axioms cited are valid), not SEMANTIC TRUTH of the
conclusion. Emitting a chain that claims to prove P vs NP would
be a falsehood the kernel would technically accept but would
violate every honest-verdict cardinal we have shipped.
What this file does instead: ship the SCHEMA for whichever side
gets proved. Three derivation chains, one per outcome, each
tagged UNRESOLVED. When the world produces an actual proof, the
matching chain becomes the substrate's record of it. Until then,
honest UNRESOLVED.
dependencies 5 imports · 0 importers
imports: nx_syscalls.nxnx_runtime.nxnx_tier.nxnx_axioms.nxnx_derive.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 30 | const NX_PVSNP_UNRESOLVED: nx_int = 0 |
| 31 | const NX_PVSNP_P_EQUALS_NP: nx_int = 1 |
| 32 | const NX_PVSNP_P_NOT_EQUAL_NP: nx_int = 2 |
| 33 | const NX_PVSNP_INDEPENDENT: nx_int = 3 // independent of ZFC |
functions
| 35 | func main() -> nx_exit |