i've been reading this thread since last week till now and I don't find the answer
so if the program is limited to 125bit interval, if i want to search for puzzle 130bit key, do i break the address space to 2 parts and run twice or on 2 computers and then merge?
how is the result, is it the private key in the result.txt file or do I need to do some scalar math to get the key
please help explain, thanks
you can search for privatekeys up to 256 bit, but program is limited to a 125bit interval search
interval search not means the range of privatekey but diff beetween start and end of privatekey.
Start range
End range
Key #1
Key #2
max different end_range-start_range < 2**128