mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   PrimeNet (https://www.mersenneforum.org/forumdisplay.php?f=11)
-   -   P-1 factoring anyone? (https://www.mersenneforum.org/showthread.php?t=11101)

Dubslow 2012-03-20 18:44

[QUOTE=Dubslow;293588]Nope, it's randomly gone back to E=12, and for my most recent result (as of this post, the file is a symlink), it didn't print E at all.

[url]http://dubslow.tk/gimps/results.txt[/url][/QUOTE]

[QUOTE=Dubslow;293625]Huh, it had one random E=6 overnight.[/QUOTE]

I take it back, it appears to be correlated with exponent. I'm not sure what the actual boundary is, but 49M has so far been a good separator. Below that, I get E=6, above that, I get E=12, as well as a 45M that reported no E at all. Weird. I'll go through my [URL="http://dubslow.tk/gimps/old-results.txt"]old results[/URL] and see if there are any other correlations; preliminarily, I found M45520697 with E=12 (edit: and M45063679, M46104649), however all the rest under 49M appear to have E=6; I also found M52479659 without any E reported (edit: M52144357 has no E, nor do M52220219, M52567117). It seems that this 49M rule mostly applies, but not always. Thoughts?

(Request: Prime95 report version when recording results? As far as these files are concerned, I typically upgraded within a day of a new version coming out, excepting 27.1.)

c10ck3r 2012-03-24 03:15

If my P-1 code include an extra 2 and 3 in the E found using a given bound, will that throw off the result?

Dubslow 2012-03-24 03:28

No, it's called the Brent-Suyama extension to the P-1 algorithm.

The more memory you have available, the higher E you get -- Prime95 is able to select (I believe) E=2,3,4,6,8,12. Most of us doing serious amounts of P-1 get E=6 or 12. (3 GiB gives me E=6, and 10 GiB gives me E=12, for standard LL-size exponents).

What it does is allows certain possible factor candidates above B2 to be tested, but not all of them -- that would just be a higher B2. [URL="http://mersenne-aries.sili.net/exponent.php?exponentdetails=325517"]This[/URL], [URL="http://mersenne-aries.sili.net/exponent.php?exponentdetails=7175153"]this[/URL] and [URL="http://mersenne-aries.sili.net/exponent.php?factordetails=3546977485247966555997217"]this[/URL] are examples of a factor found with the Brent-Suyama extension -- note how the largest factor of k is in all cases (significantly) larger than B2.

LaurV 2012-03-24 07:47

P-1 factoring with cuda, anybody? :P

This is my first tentative, it can not handle numbers higher then 64 bits in an efficient manner, and there are lots and lots of things I don't know, about both cuda and the math... but I am learning...

Here is what you can get with a B1 up to 10k, and a B2 about 100 times larger, and if no factor is found after that, I still do a couple of squares (what is shown as stage 2b) so, first is the exponent (below 400), second is the factor found. Note that the factors may be composite (for such a small exponents the bounds are too large).

[CODE]
2 :: No factor. Try increasing the bound.
3 :: No factor. Try increasing the bound.
5 :: No factor. Try increasing the bound.
7 :: No factor. Try increasing the bound.
11 :: 23 is a factor in stage 2a.
13 :: No factor. Try increasing the bound.
17 :: No factor. Try increasing the bound.
19 :: No factor. Try increasing the bound.
23 :: 47 is a factor in stage 1.
29 :: 1103 is a factor in stage 1.
31 :: No factor. Try increasing the bound.
37 :: 223 is a factor in stage 2a.
41 :: 13367 is a factor in stage 1.
43 :: 2099863 is a factor in stage 1.
47 :: 2351 is a factor in stage 1.
53 :: 69431 is a factor in stage 1.
59 :: 179951 is a factor in stage 2a.
61 :: No factor. Try increasing the bound.
67 :: 761838257287 is a factor in stage 2a.
71 :: 212885833 is a factor in stage 1.
73 :: 439 is a factor in stage 1.
79 :: 2687 is a factor in stage 1.
83 :: 167 is a factor in stage 2a.
89 :: No factor. Try increasing the bound.
97 :: 11447 is a factor in stage 2a.
101 :: No factor. Try increasing the bound.
103 :: 2550183799 is a factor in stage 1.
107 :: No factor. Try increasing the bound.
109 :: 745988807 is a factor in stage 2a.
113 :: 78939089 is a factor in stage 1.
127 :: No factor. Try increasing the bound.
131 :: 263 is a factor in stage 1.
137 :: No factor. Try increasing the bound.
139 :: 5625767248687 is a factor in stage 2a.
149 :: No factor. Try increasing the bound.
151 :: 165799 is a factor in stage 1.
157 :: 852133201 is a factor in stage 2b.
163 :: 150287 is a factor in stage 1.
167 :: 2349023 is a factor in stage 2a.
173 :: 1505447 is a factor in stage 1.
179 :: 359 is a factor in stage 2a.
181 :: 43441 is a factor in stage 2a.
191 :: 383 is a factor in stage 1.
193 :: 13821503 is a factor in stage 1.
197 :: 7487 is a factor in stage 1.
199 :: No factor. Try increasing the bound.
211 :: 15193 is a factor in stage 2b.
223 :: 196687 is a factor in stage 1.
227 :: No factor. Try increasing the bound.
229 :: 20492753 is a factor in stage 1.
233 :: 189714193 is a factor in stage 2a.
239 :: 84487457 is a factor in stage 1.
241 :: 22000409 is a factor in stage 2a.
251 :: 503 is a factor in stage 2a.
257 :: No factor. Try increasing the bound.
263 :: 23671 is a factor in stage 2a.
269 :: 13822297 is a factor in stage 2a.
271 :: 15242475217 is a factor in stage 2b.
277 :: 1121297 is a factor in stage 2b.
281 :: 80929 is a factor in stage 2b.
283 :: 9623 is a factor in stage 1.
293 :: No factor. Try increasing the bound.
307 :: 14608903 is a factor in stage 1.
311 :: 5344847 is a factor in stage 2a.
313 :: 10960009 is a factor in stage 2a.
317 :: 9511 is a factor in stage 1.
331 :: No factor. Try increasing the bound.
337 :: 18199 is a factor in stage 1.
347 :: No factor. Try increasing the bound.
349 :: No factor. Try increasing the bound.
353 :: 931921 is a factor in stage 2b.
359 :: 719 is a factor in stage 2a.
367 :: 12479 is a factor in stage 2a.
373 :: 25569151 is a factor in stage 1.
379 :: 180818808679 is a factor in stage 1.
383 :: 1440847 is a factor in stage 2a.
389 :: 269160341965838569 is a factor in stage 2a.
397 :: 202471 is a factor in stage 1.
[/CODE]

firejuggler 2012-03-24 08:16

*jump on LaurV*
Give it to me!

James Heinrich 2012-03-24 11:28

:max:

KyleAskine 2012-03-24 12:47

So when does the OpenCL version come out! :wink:

davieddy 2012-03-24 15:11

[QUOTE=Batalov;293589]It would be preferable if you guys wouldn't shorten Brent-Suyama to BS.
(B.Sc. to BS is OK, that's pretty much fair in my book.)[/QUOTE]
BS here (and quite probably elsewhere) has only one meaning:

:poop:

Batalov 2012-03-24 19:25

1 Attachment(s)
[QUOTE=davieddy;294037]BS here (and quite probably elsewhere) has only one meaning:

:poop:[/QUOTE]

[ATTACH]7824[/ATTACH]

bcp19 2012-04-05 01:22

I just had an interesting P-1 find, [URL]http://mersenne-aries.sili.net/exponent.php?exponentdetails=8598691[/URL], which I am guessing is a B-S find, since the bounds used were 100,000 and 1,825,000, and it's listed as needing a minimum 12,796,033 B2.

James Heinrich 2012-04-05 02:44

[QUOTE=bcp19;295448]I just had an interesting P-1 find, [URL]http://mersenne-aries.sili.net/M8598691[/URL], which I am guessing is a B-S find, since the bounds used were 100,000 and 1,825,000, and it's listed as needing a minimum 12,796,033 B2.[/QUOTE]Certainly B-S.
If you submit your results to the site it would be graphed more clearly (the graph currently only shows the previous P-1 bounds).


All times are UTC. The time now is 22:50.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.