Complexity as it relates to verifiers of languages
It is an open question whether $P=NL$, where $NL$ is the class of languages verifiable in logarithmic space. It is known that $NL \subseteq P$ (why?), and strongly suspected that $NL \neq P$, but we don't know for sure.