In this article we discuss the design of result verification algorithms for optimization problems. In particular, we design time-optimal result verification algorithms which verify the solution of all-pairs shortest paths, maximum flow, and matching problems. We prove that polynomial-time verification algorithms for AP-complete problems do not exist exist, unless P = NP. Result verification pro...