yeah, thats what i meant, just to make clear "how" I am thinking it: It's just iterating through integers from n to k and calculating secp256k1, sha-256 and ripemd. So:
>> Puzzle #10 has 9 bits to guess, because it's between 10_0000_0000 and 11_1111_1111
means that I don't have to start at 0000 0000 0000 ... everytime, I can actually start at 2^5 and look up to 2^6 - 1, for example for the 6th address.
>> Puzzle #10 has 9 bits to guess, because it's between 10_0000_0000 and 11_1111_1111
means that I don't have to start at 0000 0000 0000 ... everytime, I can actually start at 2^5 and look up to 2^6 - 1, for example for the 6th address.