2 ms·

> that they couldn't run their algo on an actual supercomputer, it likely wouldn't have taken 20 months I am assuming that is how the result was verified much

> that they couldn't run their algo on an actual supercomputer, it likely wouldn't have taken 20 months I am assuming that is how the result was verified much faster - >1,000x the computer power used. Without looking deeper (like actually reading the article!) I couldn't say way that would be in this particular case, but such a disparity between power used to make a finding and power used to verify it by repetition is often the case when the initial result is discovered by a recreational researcher or small group, not a better funded group. Not unlike the human scaling seen when one individual or a small group publishes a proof that could be significant, and many others poor over it to see if they can find a flaw before it is generally accepted as a genuine new finding (an order of magnitude or more of human brains to check, than to initially find).

cedilla 4y ago
The results aren't verfied by running the same calculations again. Rather, there's a verification method used along with some information from the original solution - that's the certificate they mention. Imagine factoring a non-prime number. It would take you quite long to factor 695587 with nothing but a cheap calculator, but you could very quickly verify my factorization if I give you the information that it is divisible by 71 and 101.
- dspillett 4y ago
  Though the factor-checking like verification won't work for “this number is prime” the same as it will for “this number is not prime”. A test that results in saying a number is prime doesn't output any factors to test because if such existed the number would not be prime. I'll have to read up on the certification/verification process to comment any further though.
  - cedilla 4y ago
    It does work that way, just not as straightforwardly. See https://en.wikipedia.org/wiki/Certificate_%28complexity%29 https://en.wikipedia.org/wiki/Certificate_%28complexity%29 if you're interested in learning more.

cedilla 4y ago

The results aren't verfied by running the same calculations again. Rather, there's a verification method used along with some information from the original solution - that's the certificate they mention. Imagine factoring a non-prime number. It would take you quite long to factor 695587 with nothing but a cheap calculator, but you could very quickly verify my factorization if I give you the information that it is divisible by 71 and 101.

dspillett 4y ago
Though the factor-checking like verification won't work for “this number is prime” the same as it will for “this number is not prime”. A test that results in saying a number is prime doesn't output any factors to test because if such existed the number would not be prime. I'll have to read up on the certification/verification process to comment any further though.
- cedilla 4y ago
  It does work that way, just not as straightforwardly. See https://en.wikipedia.org/wiki/Certificate_%28complexity%29 https://en.wikipedia.org/wiki/Certificate_%28complexity%29 if you're interested in learning more.