The microblog: 2021.02.11 07:53:05

2021.02.11 07:53:05 (1359757329386754052) from Daniel J. Bernstein:

Guess for where the 20000 comes from: (1) X falls for D-Wave's BS that n-qubit quantum computers will magically minimize any n-variable quadratic, in particular breaking n-variable SAT. (2) X "discovers" well-known conversion of typical cipher into SAT with about 20000 variables.

2021.02.11 08:16:58 (1359763343599280130) from Daniel J. Bernstein:

It's easy to see how #2 turns into a press release if X is a snake-oil salesman, but I think the bigger problem is D-Wave's BS. Can we agree on some "Has D-Wave solved these yet?" challenge problems? What's the strongest cipher that we can express quadratically in n variables?