My new software is for public keys, inspired by BSGS but a little different, using division and subtraction. Currently, I'm solving 30 bits in 3 seconds; this time is due to the delay in dividing a point. However, I believe that with the correct configuration, I will soon be able to break larger keys. I have some theories that have worked out very well in my tests, and I will be trying out more things to confirm.