Has it been proven that the optimization TSP is (or is not) polynomial-time verifiable if P ≠ NP?

Question

The optimization version of TSP asks for the length of the shortest tour. Unlike the decision version of TSP, there's no obvious way to verify a proposed solution of the optimization problem in polynomial time. But is there a proof of whether or not it can be verified in polynomial time assuming P ≠ NP?