Quantum computers are here, computing super fast. What threats does Bitcoin face? There are two types of threats: The first is the mining mechanism, which involves a group of miners trying different random numbers to find the minimum hash value. Currently, Bitcoin mining relies on the SHA-256 hash function, which means the computational difficulty is 2 to the power of 256; Quantum computers can use the Grover algorithm for square acceleration, reducing the computational complexity of cracking SHA-256 to the 128th power of 2. What does this magnitude of operation mean? A single CPU needs to calculate 10 to the power of 22 years; Modern GPU mining machines need to calculate 10 to the power of 17 years; The age of the universe is currently 13.8 billion years, approximately 1.38 * 10 to the power of 10. From the day of the birth of the universe to now, it is still endless. So, quantum computing poses no foreseeable threat to mining mechanisms. The second is the cracking of the private key, which is your password. The private key encryption method of Bitcoin is ECC elliptic curve encryption, where Q=k ⋅ P, where P is a known point on the elliptic curve, k is a large integer (requiring a protected private key), and Q is a calculated new point (a publicly available public key). Although Q and P are known, it is very difficult to calculate the k private key through Q and P. But it seems that just doing a division can solve it, right? The main difficulty lies in the 'finite field'. I'll try to explain it briefly. A finite field is a mathematical set of only a finite number of elements that supports operations such as addition, subtraction, multiplication, division, etc., and the results of these operations still remain within this set. for example Assuming that in the finite field F={0,1,2,3,4}, all computational results must also fall within this region, So, the way is to modulo the result by 5 mod (the remainder after dividing by 5) ·2+4=6≡1 (mod 5) ·3×4=12≡2 (mod 5) ·3−1≡2 (mod 5) In this case, even if you know the product and one of the multipliers, you cannot obtain the other multiplier through inverse operation. That is to say, there is no "division" on an elliptic curve, and it is impossible to calculate k through Q and P. So, currently, private keys cannot be theoretically deduced from public keys, and brute force cracking requires a computational load of 2 to the power of 128. Current computers are unable to calculate it at all. BTC