> There are harder problems in NP
That is an unresolved question. It might turn out that every problem in NP is equally hard. (Up to a polynomial translation cost.)