mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2011-02-04, 20:56   #34
jrk
 
jrk's Avatar
 
May 2008

21078 Posts
Default

Quote:
Originally Posted by debrouxl View Post
Some stats about polynomial selection for the remaining C164 of near-repdigit http://hpcgi2.nifty.com/m_kamada/f/c.cgi?q=77771_297 , which has been running on one of my cores for nearly 98 hours:

* the Murphy E values range from ~5.1e-13 to ~8.5e-13;
The 8.5e-13 score is excellent for this input.
jrk is offline   Reply With Quote
Old 2011-02-05, 15:10   #35
chris2be8
 
chris2be8's Avatar
 
Sep 2009

2·1,039 Posts
Default

I've noticed the following at the end of the screen output for RSA110's msieve -np1:
Code:
hashtable: 138 entries,  0.14 MB
polynomial selection complete
error generating or reading NFS polynomials
elapsed time 00:21:09
Does this mean a problem? Whenever I see the word error output by a program I start worrying.

Chris K
chris2be8 is offline   Reply With Quote
Old 2011-02-05, 16:17   #36
jrk
 
jrk's Avatar
 
May 2008

3·5·73 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
I've noticed the following at the end of the screen output for RSA110's msieve -np1:
Code:
hashtable: 138 entries,  0.14 MB
polynomial selection complete
error generating or reading NFS polynomials
elapsed time 00:21:09
Does this mean a problem? Whenever I see the word error output by a program I start worrying.

Chris K
-np1 only produces partial (unoptimized) polynomials, so it is normal that you won't get a full polynomial at the end when you use that option. But now that you have finished -np1, you can run -np2 to get the full polynomials.

If you don't want to run msieve twice like this in the future, you may run with -np only, which will run both stages in sequence.
jrk is offline   Reply With Quote
Old 2011-02-06, 15:30   #37
chris2be8
 
chris2be8's Avatar
 
Sep 2009

207810 Posts
Default

Quote:
Originally Posted by jrk View Post
-np1 only produces partial (unoptimized) polynomials, so it is normal that you won't get a full polynomial at the end when you use that option. But now that you have finished -np1, you can run -np2 to get the full polynomials.

If you don't want to run msieve twice like this in the future, you may run with -np only, which will run both stages in sequence.
I'm running -np1 and -np2 in parallel by making msieve.dat.m a named pipe. See my previous post. What I want to know is if the "error generating or reading NFS polynomials" message means -np1 didn't search as far as it should have.

Chris K
chris2be8 is offline   Reply With Quote
Old 2011-02-06, 16:53   #38
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

72×131 Posts
Default

The 'error generating ...' message appears if there aren't any entries in msieve.dat.p after the polynomial-selection pass; I see it from time to time running msieve -np with sub-optimal parameters where not a single curve is found in some A5 range.

Obviously -np1 will finish with nothing in msieve.dat.p.

So, it's just an artefact of the shape of the program; don't worry about it. Same as the way that a -ncr run will finish saying something unclear about square roots, when all it means is 'now run -nc3'.
fivemack is offline   Reply With Quote
Old 2011-02-06, 16:56   #39
jrk
 
jrk's Avatar
 
May 2008

3·5·73 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
I'm running -np1 and -np2 in parallel by making msieve.dat.m a named pipe. See my previous post. What I want to know is if the "error generating or reading NFS polynomials" message means -np1 didn't search as far as it should have.
Nothing is wrong. -np1 will always end with that error. I could make the error go away but it is only a cosmetic issue.
jrk is offline   Reply With Quote
Old 2011-02-10, 23:46   #40
tristarman
 
Feb 2011

7 Posts
Default

i made a polynominal selection with msieve 1.47 and factmsieve.py (v0.74).. is it possible to do the sieving with msieve 1.48 and factmsieve.py (v0.76)? i tried it already and it seems that the sofware was working but i have seen a message about an unknown revision (see attachment)
Attached Thumbnails
Click image for larger version

Name:	ggnfs.jpg
Views:	225
Size:	115.5 KB
ID:	6214  
tristarman is offline   Reply With Quote
Old 2011-02-11, 05:50   #41
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2×17×73 Posts
Default

Quote:
Originally Posted by tristarman View Post
i made a polynominal selection with msieve 1.47 and factmsieve.py (v0.74).. is it possible to do the sieving with msieve 1.48 and factmsieve.py (v0.76)? i tried it already and it seems that the sofware was working but i have seen a message about an unknown revision (see attachment)
this unknown revision message comes from the GGNFS siever, it has nothing to do with msieve. For me it looks as it seems to work.
Andi47 is offline   Reply With Quote
Old 2011-02-11, 08:11   #42
schickel
 
schickel's Avatar
 
"Frank <^>"
Dec 2004
CDP Janesville

2·1,061 Posts
Default

Quote:
Originally Posted by tristarman View Post
i made a polynominal selection with msieve 1.47 and factmsieve.py (v0.74).. is it possible to do the sieving with msieve 1.48 and factmsieve.py (v0.76)? i tried it already and it seems that the sofware was working but i have seen a message about an unknown revision (see attachment)
Quote:
Originally Posted by Andi47 View Post
this unknown revision message comes from the GGNFS siever, it has nothing to do with msieve. For me it looks as it seems to work.
It's not an error....it's the display of one of the compile-time settings and the revision level. I forget what the L1_BITS setting is for (see here), but the "SVN $Revision$" would have been filled in by SourceForge with the SVN revision level (read this post and the next one.....)
schickel is offline   Reply With Quote
Old 2011-02-11, 15:17   #43
tristarman
 
Feb 2011

710 Posts
Default

Quote:
Originally Posted by Andi47 View Post
this unknown revision message comes from the GGNFS siever, it has nothing to do with msieve. For me it looks as it seems to work.

i think no work correct.. see log:
Code:
Thu Jan 27 21:41:35 2011 Found 61251994 relations, 107.4% of the estimated minimum (57029236).
Thu Jan 27 21:41:36 2011  
Thu Jan 27 21:41:36 2011  
Thu Jan 27 21:41:36 2011  Msieve v. 1.48
Thu Jan 27 21:41:36 2011  random seeds: b92f8348 af47d834
Thu Jan 27 21:41:36 2011  factoring 6703927226456845236092787161565505201973340970658566195176653288974766211804013820621945450203151220760800372906178064984350552502078301558004672244602561 (154 digits)
Thu Jan 27 21:41:37 2011  searching for 15-digit factors
Thu Jan 27 21:41:37 2011  commencing number field sieve (154-digit input)
Thu Jan 27 21:41:37 2011  R0: -691476128642256065160939049252
Thu Jan 27 21:41:37 2011  R1:  294702069223281919
Thu Jan 27 21:41:37 2011  A0: -184422675619174088372745165230333093301
Thu Jan 27 21:41:37 2011  A1:  391969234366257563885098121836119
Thu Jan 27 21:41:37 2011  A2:  753365188154393180431079
Thu Jan 27 21:41:37 2011  A3: -15135336978267099247
Thu Jan 27 21:41:37 2011  A4: -1021680147138
Thu Jan 27 21:41:37 2011  A5:  42408
Thu Jan 27 21:41:37 2011  skew 8660622.41, size 5.939e-015, alpha -7.615, combined = 3.177e-012 rroots = 3
Thu Jan 27 21:41:37 2011  
Thu Jan 27 21:41:37 2011  commencing relation filtering
Thu Jan 27 21:41:37 2011  estimated available RAM is 4096.0 MB
Thu Jan 27 21:41:37 2011  commencing duplicate removal, pass 1
Thu Jan 27 21:42:16 2011  error -15 reading relation 4727791
Thu Jan 27 21:42:17 2011  error -15 reading relation 4738955
Thu Jan 27 21:42:17 2011  error -15 reading relation 4750202
Thu Jan 27 21:42:17 2011  error -11 reading relation 4761516
Thu Jan 27 21:42:17 2011  error -9 reading relation 4777009
Thu Jan 27 21:42:17 2011  error -11 reading relation 4792503
Thu Jan 27 21:42:17 2011  error -15 reading relation 4808145
Thu Jan 27 21:42:17 2011  error -15 reading relation 4823147
Thu Jan 27 21:42:17 2011  error -15 reading relation 4838798
Thu Jan 27 21:42:17 2011  error -15 reading relation 4854262
Thu Jan 27 21:42:18 2011  error -15 reading relation 4869845
Thu Jan 27 21:42:18 2011  error -11 reading relation 4885366
Thu Jan 27 21:42:18 2011  error -15 reading relation 4885550
Thu Jan 27 21:42:18 2011  error -15 reading relation 4885704
Thu Jan 27 21:42:18 2011  error -15 reading relation 4885856
Thu Jan 27 21:42:18 2011  error -11 reading relation 4886011
Thu Jan 27 21:49:51 2011  error -6 reading relation 58704035
Thu Jan 27 21:49:51 2011  error -6 reading relation 58704065
Thu Jan 27 21:49:51 2011  error -6 reading relation 58704095
Thu Jan 27 21:49:51 2011  error -1 reading relation 58704125
Thu Jan 27 21:49:51 2011  error -9 reading relation 58704155
Thu Jan 27 21:49:51 2011  error -9 reading relation 58704185
Thu Jan 27 21:49:51 2011  error -1 reading relation 58704215
Thu Jan 27 21:49:51 2011  error -1 reading relation 58704245
Thu Jan 27 21:49:51 2011  error -2 reading relation 58704275
Thu Jan 27 21:50:12 2011  found 21381319 hash collisions in 61251968 relations
Thu Jan 27 21:51:02 2011  added 7 free relations
Thu Jan 27 21:51:02 2011  commencing duplicate removal, pass 2

Last fiddled with by wblipp on 2011-02-11 at 20:35 Reason: added code tags
tristarman is offline   Reply With Quote
Old 2011-02-11, 15:31   #44
debrouxl
 
debrouxl's Avatar
 
Sep 2009

977 Posts
Default

A C154 by GNFS... could that be a 512-bit RSA key, per chance ?

One third of duplicate relations is a rather large ratio, but not disproportionate. You'll just probably want to sieve further, until 65M or 70M raw relations.
debrouxl is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Polynomial selection Max0526 NFS@Home 9 2017-05-20 08:57
SNFS Polynomial selection help? mhill12 Factoring 59 2013-09-09 22:40
Best way to scale polynomial selection pastcow Msieve 6 2013-05-08 09:01
2^877-1 polynomial selection fivemack Factoring 47 2009-06-16 00:24
Polynomial selection CRGreathouse Factoring 2 2009-05-25 07:55

All times are UTC. The time now is 00:59.


Sat Jul 17 00:59:34 UTC 2021 up 49 days, 22:46, 1 user, load averages: 1.84, 1.40, 1.36

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.