0

Is this even something one should be worried about?

  • This is more fun to calculate for yourself than to ask for the answer. Why not try it and ask if you get stuck? – Nate Eldredge Nov 13 '19 at 19:45
  • I guess I should take the time it takes to calculate a single key pair and multiply it with the total number of private keys, not the total number of possible addresses (to account for expected(?) collisions). So, totalTime = singleKeyPairTime * 2^256. Right? – Nikos Lykouresis Nov 13 '19 at 23:06
  • Sure. Of course, they could be computed in parallel, so if you want the real time required to calculate all keys, you should divide by the number of machines being used. – Nate Eldredge Nov 13 '19 at 23:15
  • The closest I have come to answering how long a single ECDSA key generation takes is "some milliseconds". I ran the numbers and even if you run thousands of computers in parallel + assume one computer can calculate tens of thousands of keyGenerations/s, the infinitesimally small percentage of public keys you will find in your lifetime, is simply not worth it. – Nikos Lykouresis Nov 14 '19 at 2:06
0

No, you shouldn't worry about it.

3Blue1Brown has made a great video explaining how large 256 bit is, check it out

| improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.