Isn't this susceptible to a trusting trust[0] attack, where your verifier has a bug that makes it verify itself, even though it shouldn't ?
It's always possible there is a loop somewhere. The best you can hope for is make it infinitesimally small.
It's always possible there is a loop somewhere. The best you can hope for is make it infinitesimally small.
That's not to say there's no way to close the loop here, simply that I don't know that this is it.
A medium-assurance solution is 3+ compilers with same input and output on diverse hardware by diverse teams unlikely to collude all producing ssme result. If hardware, you can do that with chips plus voting scheme.
EDIT: Whew!