Thread: Kibibitzing
View Single Post
Old 2017-06-27, 14:50   #2
jwaltos
 
jwaltos's Avatar
 
Apr 2012

33·13 Posts
Default

I've been sporadically benchmarking certain msieve polynomial searches. These are my best results to date.
The former can be factored with an appropriate polynomial but the latter is prohibitive due to memory even with a good poly.
The utility of the 199 and 298 digit values is that they can "theoretically" be used to factor their respective RSA numbers.
Does anyone have a better poly or an Aurifeuillian method?

Is there CUDA code that can solve the simple quadratic equation and handle hundreds of thousands digits using gpu's with cc 2.0 -> cc 5.2?
There is a lot of related pseudo code published but nothing specific that I could find. A pointer to implemented code somewhere would help (provided it's open).

As an aside, has anyone encountered a good paper on "white holes (any language)?" Laser induced artificial black holes have been demonstrated but I have not seen much on the converse.
Attached Files
File Type: txt 210-1536.txt (2.5 KB, 119 views)

Last fiddled with by jwaltos on 2017-06-27 at 14:53 Reason: correction
jwaltos is offline   Reply With Quote