So this is my approach I am not sure if there is a tool like this

I have an idea of 2 Python codes, 1st code adding +G+G+G+G+G+G to the public key of 32BTC puzzle and saving only those iteration numbers (number of G added) and X value of public key only if X starts with "145D"... of course do not save it to a txt file 1 by 1 but first into RAM and then periodically save it to a txt file

2nd code will start to scan and it also searches for "145d" X values... When it finds one check if that X value is in the txt file of the first code (also periodically load txt file of first code to RAM to gain faster read) and if it is not this scanner can jump by reading the last added iteration value (the number of +G+G+G added).. Make like scan.txt and periodically save the state so you can continue...

By the time you make bigger and bigger jumps... and also X value starting with 145D approximately shows Each FFFF keys so you do not need hi speed of scanning...

Sory for my bad English this is just IDEA... If someone can write this by using CUDA or OpenCL it will be good...

Also I am not sure maybe I described some other algorithm... I do not know