Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
so there will still be 28453041475240576740 combinations, not 47478523248093572 
Yes, if the script uses 128-bit counters and 128-bit arithmetic. After that, the next step is optimizing this version for AVX2.
It will be interesting to see)
I've added a check for a max of 6 bytes for now, to discard unsuitable options faster)
https://github.com/NoMachine1/Mutagen/
sequential?
This puzzle solver uses a systematic, parallel enumeration approach that's neither purely sequential nor random.
Every possible combination is assigned to exactly one thread.
No combinations are skipped or duplicated.
The entire search space is covered systematically.
Total combinations = C(n,k) is precisely calculated.
Ranking/unranking provides a perfect 1:1 mapping.
Work division covers every rank from 0 to C(n,k)-1
Thread processing is gap-free within each range
Multiple threads search different regions simultaneously
No fixed order: Threads don't proceed in a predetermined sequence
The first thread to find the solution stops all others
Putting a random generator in this is blasphemy.