3 ms·

I don't think a proof that P = or ≠ NP would give you any polynomial-time algos for arbitrary problems either.