Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Yeah, ok, for a while I tought that the possible number of combinations are fixed and repeating each time that we start the programm, and that we need to go through them all again.
That's why I keep saying that adding a random function to this would just waste unnecessary memory
what if we use libsecp256k1? it seems to have avx2 support under the hood)
Try it. Test it. Make a benchmark to see which one is faster.
P.S. It may be too complicated. This script not only uses SECP256K1 but also Int from the JLP script, IntMod, and other components.
yes, I see, half of this will have to be rewritten
