The argument is silly, dev tools that allow you to run code were never allowed. There is no selective enforcement here and nothing has changed doesn’t matter if the code was written by a human or not.
Just to point it out this isn’t a jab at QC but rather a jab at project 11 and possibly the submission author, basically they failed to validate the submission properly and the code proves that the solution is classical.
Recovering a 17bit ecc key isn’t a challenge for current classical computers via brute force.
OK, so what I don't get is that from the GitHub page, it seems like that statement is purposely misleading. For the 17-bit key, the quantum computer correctly recovered the key in it's single run, while urandom used 2/5 runs. At 5 runs, I don't think one could say the quantum calculation is definitely better with any confidence, but the reverse should also be true; he hasn't actually proven that urandom performed at an equivalent rate to the quantum calculation. The only thing I can think of is if he is saying that the original group should have done more runs on the quantum computer to prove it. But from the framing he is using, seems like he is disingenuously declaring that the quantum computer is equivalent to a random number generator.
It depends, for example - I would consider Google Drive uptime as part of say Google Docs’ overall uptime because if I can’t access my stored documents or save a document I’ve been working on for the past 3 hours because Drive is down I would be very pissed and wouldn’t care if it’s Drive or Docs that is the problem underneath I still can’t use Google Docs as a service at that point.
reply