basically doing it fast for large integers.

Here is the challenge I am working toward: https://en.wikipedia.org/wiki/RSA_Factoring_Challenge

If you have a breakthrough and start factoring RSA numbers and >=1000 bit composites (edit: on a system that costs less than 100 billion $), I would definitely start thinking about OpSec and finding a nice signal free place to crash. Good luck :)

lol.

Like I said, I don't expect to reach any tangible goal. However, I am not looking for an extended "search" algorithm. I am looking for a "solution" or at least a solution in say O(log(n)) to begin with. That's the goal I put up as a challenge. I will most likely not be able to do that but still fun to try :D

Edit: Forgot to say thanks!

Ok cool. I'm a big fan of taking on fundamental problems like this. Even if you're unlikely to get anywhere, you always learn a lot :)

Nice that there's a cash price for incentive as well.

IBM has these monthly challenges called Ponder This, and this month's challenge is to factor 3 large numbers (~100 decimal digits). Have a look:

https://www.research.ibm.com/haifa/ponderthis/challenges/Apr...

sweet!

I didn't know about this. Thanks for the link.