Checkables
The Checkables page on this wiki explains the concept of easily verifiable things, an idea related to complexity theory in computer science.
Checkables are things that are easy to verify. In Computer Science, the rigorous idea is the class of problems in NP. But normal English makes this wordy.