Slightly off-topic, this article has one of the best expositions I've seen (the Arthur-Merlin stuff) of P, NP, NP-complete, witnesses, and the idea of "evidence" for what complexity class the problem is in.
Here are some gentle articles on the zero-knowledge in case anyone is curious:
https://blog.cryptographyengineering.com/2014/11/27/zero-kno...