keyhunt questions

Hey guys, I'm curious about the upper limits for **k** and **n** in the BSGS mode. Like, how long would it take to generate those values and how much storage would they eat up? Also, what's the biggest range that **keyhunt** can effectively search to snag a private key in **two or three days**? Is it realistic to find a private key within a range of \(2^{100}\) in just an hour or two? What kind of values do we need for this, and what are the time and space costs for generating them? appreciate any insights!

https://neuromancer.sk/std/secg/secp256k1 In secp256k1, n-value is constant. It can be increased as much as you want, as long as it will be a prime number. But then, you will land on a different curve than secp256k1, and no OP_CHECKSIG will work for you anymore. Much longer, than overwriting the whole chain from 2009, up to today. And much more storage, than exists in our universe, if you will use trivial brute force, and try to compute all possible values, without any shortcuts and optimizations. It depends on your computing power. It is different for different hardware. Well, 130-bit public key is now broken. It is 2^30 times away from 2^100, and if you check, how much time it took to break 130-bit key, then you should get your answer. It depends on your hardware, and your optimizations. Many puzzle solvers develop their own tools. Things, which are already public, are mainly intended as examples for wider audience, to let them understand, how things were broken. But people who actually break keys, which are not yet solved, often use their own code for doing that, and their implementation is better, than things which were publicly shared.