The absolute low bar of competence he could not pass, leaving many hired under him without a livelihood (and in this case, any supplies ever) feels VERY on brand for Elon Musk. I hope you agree this little/lengthy fact shines new light on the Elon Musk in your comic.

11/11

Elon Musk has lost his crypto wallet to chinese quantum hackers because it was identified by a cryptographic ID only twice as long as what would have been feasible for classical computers to crack.

10/11

That's all it takes, and that's even assuming quantum computers will get CPU clock cycles as fast as our current computers (unlikely). No fancy Shor's Algorithm resistent encryption methods needed! (although that research is interesting in its own right).

9/

Alright, let me wrap this up. To make our encryption keys as hard to crack for quantum computers, as they currently are to crack for our classical computers, all we have to do is double up the bits. Encryption key with 2^128 options now has 2^256.

8/11

It's from there 𝘐 was made aware that Quantum computers don't just break encryption as readily as "1 step" or "virtually instantly".

7c tangent/11

Still though, if you are interested in a good explanation of how Shor's algorithm only really has O(square root of n), I recommend watching 3Blue1Brown's video on the topic.

7b tangent/11

I won't bore you with the details of the math, though I presume you are a bit geeky given your focus on space in many of your comics, MATH geek is quite specific.

7a tangent/11

In computer science, we say that algorithms that "no matter the size we are working with, we can do it in one step", have a run-time of O(1). That means "for some N, it takes 1 step". Shor's algorithm has a run-time of O(square root of N).

7/11

RSA is usually 2^2048 or even 2^4096. Much much bigger numbers, but quantum computers are NOT there yet. The team that cracked RSA encryption with quantum computers did so on a key that could have looked 2^50 different ways (1 quadrillion options).

6a tangent/11

The quantum computers that you see in headlines breaking AES or even RSA (our current encryption methods) run Shor's algorithm. It does not work this way. Moreover, AES is not just 1,000,000 unique keys. It's 2^128 unique keys (thats 340 undecillion, aka 340 and 36 zeros)

6/11

The above would indicate that a quantum computer does not care if its checking 1,000 keys or 1,000,000 keys. It can find the correct key something has been encrypted with, virtually instantaneously (1 step).

5/11

For example, if there is 1,000,000 unique keys, then a classical computer would have to check all those keys individually. The Quantum computer should be able to all those checks simultaneously. This is quite misleading!

4/11

There's a widespread misconception about the powers of Quantum computing and what it would take to make Post-quantum cryptography. Most sources will say that, what takes a classical computer many many many steps, a quantum computer can do instantly if only we build them with enough qubits.

3/11

it might initially look like an attempt at correcting your several-year-old comic, but I actually think it adds to the comic knowing this fact.

2/11

My motor skills might not be what they should be

Kudos to them for tolerating it at any time. That takes resolve, or perhaps more fittingly, guts

Don't make a mess, and leave the place how you found it. Leave no trace of yourslf (that's probably good h@cking advice anyways).

VERY IMPORTANT!: Remember to play nicely and follow their rules. You are playing on a server that many other play on too, and is maintained out of the good will of the owner.