Yes, this is an old idea (which I really like) but it hasn't really taken off yet. GridCoin was one example, where you solved BOINC problems or RLC that's for more general computation.
This is very much not true. A central class in complexity is NP whose problems are hard to answer but easy to verify if the answer is yes.
E.g. is there a path visiting all nodes in this graph of length less than 243000? Hard to answer but easy to check any proposed answer.
Training NN ML is much slower than inference (1000x at least) because it has to calculate all of the gradients.