Yes, NP-style verification is a prime candidate. But even for something like a+b, you have lots of properties you can test. All the group theory axioms (insof

Yes, NP-style verification is a prime candidate. But even for something like a+b, you have lots of properties you can test. All the group theory axioms (insofar as they are supposed to hold) for example. See https://news.ycombinator.com/item?id=45820009 https://news.ycombinator.com/item?id=45820009 for more.