mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2007-11-04, 14:10   #1
masser
 
masser's Avatar
 
Jul 2003
Behind BB

7×269 Posts
Default fun with snfs

We have 1 candidate in our dat file with n < 200. If anybody wants to try to factor them, please post here so we don't have duplicate efforts occurring.

Code:
325846*5^159-1 done: p54*p63 (michaf)
322498*5^163-1 done: p47*p74 (michaf)
177742*5^165-1 done: p59*p63 (konrad127123)
146756*5^172-1 done: p58*p68 (konrad127123)
313126*5^183-1 done: p45*p89 (michaf)
   254*5^186-1 done: p57*p77 (michaf)
146264*5^194-1 done: p56*p85 (michaf)

37714*5^172+1 done: p53*p73 (michaf)
51208*5^176+1 done: p44*p85 (konrad127123)
71098*5^176+1 done: p47*p82 (konrad127123)
24032*5^181+1 reserved      (michaf)
81556*5^184+1 done: p47*p74 (michaf)
Here is the list of all candidates in our dat file with n < 400.

Reservations beyond 200:
53546*5^200-1: konrad127123
Attached Files
File Type: txt small_n.txt (2.1 KB, 247 views)

Last fiddled with by michaf on 2007-11-09 at 09:32 Reason: less numbers left
masser is offline   Reply With Quote
Old 2007-11-04, 17:16   #2
michaf
 
michaf's Avatar
 
Jan 2005

1110111112 Posts
Default

doing 37714*5^172+1 at this moment
michaf is offline   Reply With Quote
Old 2007-11-04, 22:05   #3
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

37714*5^172+1 done:
Quote:
Number: 37714_5_172p1
N=63000405172760666624090120201344367236022709460176129121835319112085796466367896466811981959210697823436930775642395019531251
( 125 digits)
SNFS difficulty: 124 digits.
Divisors found:
r1=14465582032370667658227372663294106255168415715560083 (pp53)
r2=4355193246409315121729483588897346062978427046592466831662252772288990497 (pp73)
Version: GGNFS-0.77.1-20060513-athlon-xp
Total time: 4.63 hours.
Taking 325846*5^159-1
michaf is offline   Reply With Quote
Old 2007-11-05, 06:31   #4
konrad127123
 
konrad127123's Avatar
 
Jun 2005

2116 Posts
Default

I'll have a go at 322498*5^163-1.
konrad127123 is offline   Reply With Quote
Old 2007-11-05, 18:51   #5
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

A nice p54 in there:

Quote:
Number: 325846_5_159m1
N=445905761139047210246302333785826183313621321008491365394486007844094594852399349171889753051800653338432312011718749
( 117 digits)
SNFS difficulty: 117 digits.
Divisors found:
r1=946950638415393627493165185410649986962675544483131457 (pp54)
r2=470885960735203795153789083353972970130329307107530121167440157 (pp63)
Version: GGNFS-0.77.1-20060513-athlon-xp
Total time: 2.57 hours.
Reserving 146264*5^194-1

Last fiddled with by michaf on 2007-11-05 at 18:52 Reason: Reservation added
michaf is offline   Reply With Quote
Old 2007-11-05, 22:59   #6
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

186916 Posts
Default

Where would I find a copy of SNFS to possibly try factoring one of these? Or, would the number field sieve (not the quadratic sieve) included with msieve do fine?
mdettweiler is offline   Reply With Quote
Old 2007-11-05, 23:15   #7
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

The numbers are still fine for msieve.Ggnfs is a way quicker with the sieving.
(With gnfs the flipover is around 100 digits for my computer, never actually tested that with snfs).

You can check for ggnfs at http://tech.groups.yahoo.com/group/ggnfs/

msieve is obtainable at http://www.boo.net/~jasonp/qs.html
michaf is offline   Reply With Quote
Old 2007-11-05, 23:27   #8
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3×2,083 Posts
Default

Quote:
Originally Posted by michaf View Post
The numbers are still fine for msieve.Ggnfs is a way quicker with the sieving.
(With gnfs the flipover is around 100 digits for my computer, never actually tested that with snfs).

You can check for ggnfs at http://tech.groups.yahoo.com/group/ggnfs/

msieve is obtainable at http://www.boo.net/~jasonp/qs.html
Thanks--actually, I already have a copy of the latest version of msieve. I can't quite seem to find where to download ggnfs on the page you listed, though.

Also, how would I go about setting up ggnfs for use with these types of numbers? I've heard it's quite complex and confusing.
mdettweiler is offline   Reply With Quote
Old 2007-11-06, 10:57   #9
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

Oh, my apologies,

the files can be gotten from
http://sourceforge.net/projects/ggnfs/

It's not very easy to set up, but once you are there, the factlat script has most of the work done for you.

Below are the results of my latest snfs-number, the .poly file needs to contain:

n: ....
upto
Y1: ....

Quote:
Number: 146264_5_194m
N=582529988224692499618380406247741498832443291651732985315777101149184326567264847130450243590182000941180007203001878224313259124755859374999
( 141 digits)
SNFS difficulty: 141 digits.
Divisors found:
r1=97356790107191842626782568435872836358484589585664856887 (pp56)
r2=5983455160994060256472046195943542849302859922603898311097732575706621446100614038177 (pp85)
Version: GGNFS-0.77.1-20060513-athlon-xp
Total time: 13.57 hours.
Scaled time: 19.43 units (timescale=1.432).
Factorization parameters were as follows:
n: 582529988224692499618380406247741498832443291651732985315777101149184326567264847130450243590182000941180007203001878224313259124755859374999
type: snfs
skew: 0.12786936592
c5: 146264
c0: -5
Y0: -1818989403545856475830078125
Y1: 1
Name: 146264*5^194-1Factor base limits: 1300000/1300000
Large primes per side: 3
Large prime bits: 26/26
Sieved special-q in [650000, 2450001)
Relations: rels:2815184, finalFF:248289
Initial matrix: 200651 x 248289 with sparse part having weight 27234076.
Pruned matrix : 195350 x 196417 with weight 17653842.
Total sieving time: 12.80 hours.
Total relation processing time: 0.11 hours.
Matrix solve time: 0.58 hours.
Time per square root: 0.08 hours.
Prototype def-par.txt line would be:
snfs,141,5,0,0,0,0,0,0,0,0,1300000,1300000,26,26,45,45,2.3,2.3,100000
total time: 13.57 hours.
In short, this is how I got there:
146264*5^194-1
I wanted a degree 5 polynomial for this size numbers:
5*146264*5^194-1 = 146264*5^195-5
now, 146264 is c5 (c5 because it's a degree 5 polynomial
-5 is c0
Y0: - 5^(195/5)
Y1: 1
(I'm still confused about which one needs to be negative, but ggnfs seems to prefer Y1 positive :>)
skew: (c0/c5)^(1/5)

On this forum, and on the ggnfs mailinglist a lot of info can be found on how and what, but the best thing to learn from, is from making errors.
michaf is offline   Reply With Quote
Old 2007-11-06, 12:20   #10
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

22·3·941 Posts
Default

Quote:
Originally Posted by michaf View Post
On this forum, and on the ggnfs mailinglist a lot of info can be found on how and what, but the best thing to learn from, is from making errors.
Correction: making errors, thinking about the error messages and attempting to work out what went wrong before even thinking of asking for assistance.

If you can show you've made an honest attempt to correct your errors and are still stuck a number of people here will attempt to help you, even (especially) those who don't suffer fools gladly.

Paul
xilman is online now   Reply With Quote
Old 2007-11-06, 15:47   #11
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3×2,083 Posts
Default

Quote:
Originally Posted by michaf View Post
Oh, my apologies,

the files can be gotten from
http://sourceforge.net/projects/ggnfs/

It's not very easy to set up, but once you are there, the factlat script has most of the work done for you.

Below are the results of my latest snfs-number, the .poly file needs to contain:

n: ....
upto
Y1: ....



In short, this is how I got there:
146264*5^194-1
I wanted a degree 5 polynomial for this size numbers:
5*146264*5^194-1 = 146264*5^195-5
now, 146264 is c5 (c5 because it's a degree 5 polynomial
-5 is c0
Y0: - 5^(195/5)
Y1: 1
(I'm still confused about which one needs to be negative, but ggnfs seems to prefer Y1 positive :>)
skew: (c0/c5)^(1/5)

On this forum, and on the ggnfs mailinglist a lot of info can be found on how and what, but the best thing to learn from, is from making errors.
Whew. Looks tricky. I think I'll stick with the msieve number field sieve for now, though I'll keep your instructions in mind in case I try it out later--thanks!
mdettweiler is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
SNFS targets which need more ECM XYYXF XYYXF Project 57 2017-07-04 19:15
SNFS(27x) How much ECM before switching to NFS? YuL Factoring 24 2015-06-08 01:26
SNFS polynomials for k*b^n+-1 mdettweiler Factoring 15 2010-01-14 21:13
SNFS Sample(10^4+1) nuggetprime Factoring 1 2007-06-11 16:31
Completed my first SNFS job schickel Factoring 0 2007-05-27 05:42

All times are UTC. The time now is 19:31.


Wed May 18 19:31:53 UTC 2022 up 34 days, 17:33, 0 users, load averages: 1.58, 1.66, 1.79

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”