For large factoring problems like cracking 2048 RSA it seems easy to verify the answer but very few general problems with have this trap-door factoring property.Hi,
That's an interesting question and that is probably why they need more peer review.
However, sometimes a sanity check helps to convince even if not prove. This is probably what they did.
For example, if we had a prime number generator and generated a set of primes and chose one HUGE number that a classical method would have a hard time doing, we could test just that one using classical methods. IF that huge number failed it would mean the new method failed, but if it was large enough and it proved to be a real prime, then the new method would have merit. Not a proof of course, but some indication that the method might work. On the contrary, in the 1980's i knew of one prime number generator that could generate a ton of primes but failed on just ONE because it generated ONE prime that was not a true prime.