Are problems whose solutions can be quickly verified the same class as problems that can be quickly solved? The biggest open question in computer science. $1M prize.
From Wikipedia
The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.