If NP-completeness proofs rely on unresolved foundational assumptions about computational complexity...