# Is there a language which has a polynomial length certificate but not known to have a polynomial time verifier?

The question came to my mind while studying the NP definition. Do we know any such languages?

Every NEXPTIME complete language has a certificate of length 0 that can be checked in time $$2^{2^{n^{O(1)}}}$$, but does not have polynomial length certificate that can be checked in polynomial time.