title: What would a P=NP proof be like, hypothetically?
body: <p>Would it be an polynomial time algorithm to a specific NP-complete problem, or just abstract reasonings that demonstrate solutions to NP-complete problems exist?</p>
  
  <p>It seems that the a specific algoithm is much more helpful. With it, all we'll have to do   to polynomially solve an NP problem is to convert it into the specific NP-complete problem for which the proof has a solution, and we are done.</p>