I used all the math I know to go from 352M to 12M CPU years

A subreddit dedicated to hacking and hackers. Constructive collaboration and learning about exploits, industry standards, grey and white hat hacking, new hardware and software hacking technology, sharing ideas and suggestions for small business and personal security.

Members Online

It's silly going afer Satoshi's wallet, I know. However, I was able to improve my algorithm's running time from 352 million cpu years to 12 million cpu years. All this was pure mathematical optimizations, no assembly or GPUs involved.
I used primitive roots to write a custom Pollard Kangaroo/Pollard Rho modulo the generator's order, not the curve's order
Here's the link for anyone interested