It is slow compared to ICE secp256k1. Twice the speed...However, I am currently creating a script that will be Full ICE - to search for lost parts of the private key. About 2 million per second per CPU thread..

I would love to see your 2 mil/sec as I am stuck on 500k/s with ice. Would be interested to see which route you went.
Edit: 2 mil+... CPU dependent. But that is on a public key hunt. So for those who want to try their luck.... It's set for 120 bit key...I guess if you link enough machines with enough CPU's you may hit in a few hundred years.
import secp256k1 as ice
from timeit import default_timer as timer
import random
import multiprocessing
cores = 1
perRound = 1000000
bitRange = 120
target_Key = '02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630'
def new_Number():
doneSet = set()
rotate = True
with open("120-Nums.txt", "r+") as textfile:
for checking in textfile: doneSet.add(str(checking.replace("\n","").replace(",", "")))
while rotate != False:
number = round(random.randint(2**(bitRange-1),2**bitRange)/perRound)
if str(number) not in doneSet:
rotate = False
textfile.write(str(number) + "\n")
if str(number) in doneSet:
print('Collision')
textfile.close()
return number
def seek(r,cores):
startStart = timer()
dog = False
while dog != True:
number = new_Number()
p = (ice.scalar_multiplication(number*perRound))
start = timer()
check = str((ice.point_sequential_increment(perRound, p)).hex())
if target_Key[5:25] in check:
print('Success: ' + str(number))
print('Test Run Time Length: ' + str((timer()-startStart))[:6])
with open("results.txt", "a") as completed:
completed.write(str(p) + ' ' + str(number))
completed.close()
dog = True
else:
print('Core: ' + str(r) + ' Key/s: ' + str(perRound/(timer()-start))[:10] + ' Time: ' + str(timer()-start)[:6] + ' RandInt: ' + str(number))
if __name__ == '__main__':
jobs = []
for r in range(cores):
p = multiprocessing.Process(target=seek, args=(r,cores))
jobs.append(p)
p.start()