Optimistic verifiers teach padding: true faithfulness falls from 0.731 to 0.667 while the proxy score holds at 0.940
Outside mathematics and code, reinforcement-learning verifiers are mostly proxy signals whose distance from the true objective is never measured, so a rising reward cannot be told apart from a hack. This work compiles executable authorization policies into exact process-level rewards, then degrades the verifier along seven realistic axes while the exact verifier scores every rollout. The sufficiency proxy is hacked by padding: its proxy score terminates at 0.940 while true faithfulness on held-out episodes falls from 0.731 to 0.667, whereas an outcome-only verifier saturates almost immediately and stops teaching.