Things I’ve seen, like Shor’s algorithm, have a better chance of finding, say, the private key for any given SHA-256 public key. AFAIK it would not mean they would get the whole rainbow table made GGEZ all at once. More like there’s more of a chance to not strike out all the time so bad when looking for needles in haystacks of haystacks of haystacks due to being able to harness qubits to bring factorial time complexity down to polynomial time

When it first starts to be compromised, I think it is likely it will maybe it will be possible to spend a not prohibitive amount of time compromising one address… let’s say a year. Then as things get more and more sophisticated the whole shebang is completely compromised.

The timeframe is usually 10-20 years from now when you hear security researchers mention the horizon.

I prefer pessimistic and consider that safety is more likely 2-5 years with great confidence and reassess based on current news at regular intervals.