Are there zero-knowledge proofs for every answer to the $P=NP$ question?
For instance, if you have a polynomial-time algorithm of moderate complexity for the graph-coloring problem, then it is easy to prove that you have such an algorithm without revealing the algorithm itself. Are zero-knowledge proofs also possible for other proofs that $NP=P$ or for proofs that $NP\ne P$?