3 ms·
XPM has nothing to do with finding primes used in RSA, I'm not sure where that came from. It's POW is finding cunningham chains of smaller sized primes. That
by slededit 9y ago
XPM has nothing to do with finding primes used in RSA, I'm not sure where that came from. It's POW is finding cunningham chains of smaller sized primes. That said I wouldn't be surprised if it could be adapted to find larger primes on a GPU significantly faster than a CPU.
- hvidgaard 9y agoIt was simply a response to your statement about bruteforcing anything. There is some ways to factor a prime that is much faster than bruteforcing, and yes they work on a GPU. But that has nothing to do with bruteforcing, but clever math.
- Dylan16807 9y agoThe statement was about the relative speed of a thousand dumb cores vs. a couple really good cores. Not about absolute speed.
- hvidgaard 9y agoThe statement was stating an absolute. Algorithmic complaxity matters more than the speed of the computing hardware. Obviously, more power means you can compute more, but not everything.
- slededit 9y agoThat's a very uncharitable reading of what I wrote. The topic of the conversation was GPU performance vs CPU performance. Despite being less flexible, the sheer quantity of execution units more than makes up for it. But no, I suppose its more likely I was really saying GPUs aren't bounded by the limits of the universe.
- hvidgaard 9y agoThe context is Primecoin and ability to find primes. Prime factorization is related to that, and it would be obvious to read your statement in absolut for that context and it's relation. At least I did.