01The trick that keeps working
The fastest gains in AI over the last two years came from one loop: let the model try, let a program check the answer, reward what passes. Researchers call it reinforcement learning with verifiable rewards, or RLVR. It's how models went from fumbling competition maths to solving it, and from autocompleting code to fixing real bugs against real test suites.
The loop has one precondition: a checker. Unit tests for code. An exact answer for a maths problem. Where a cheap, reliable checker exists, models climb fast. Where it doesn't, they plateau on vibes and human ratings.
So the useful question isn't "can AI do my job?" It's narrower and more uncomfortable: can a program tell whether my work is right?
02Checkers are everywhere
Most skilled work ends in something a program can check. A floor plan either meets egress code or it doesn't, and a shortest-path computation over the plan says which. A card dispute is either valid under the network's reason code or it isn't. A flight plan carries enough fuel under the reserve rules, or it doesn't. A Nutrition Facts panel is rounded the way 21 CFR 101.9 says, to the gram. A construction pay application ties out to the contract ledger, to the cent.
None of these need a judge model. The rules are already written down. Often the simulator or validator already exists, and it's open source.
| # | Work | Graded by | Status |
|---|