![]() |
|
|
#34 | |
|
May 2008
21078 Posts |
Quote:
|
|
|
|
|
|
|
#35 |
|
Sep 2009
2·1,039 Posts |
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 Chris K |
|
|
|
|
|
#36 | |
|
May 2008
3·5·73 Posts |
Quote:
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. |
|
|
|
|
|
|
#37 | |
|
Sep 2009
207810 Posts |
Quote:
Chris K |
|
|
|
|
|
|
#38 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72×131 Posts |
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'. |
|
|
|
|
|
#39 |
|
May 2008
3·5·73 Posts |
Nothing is wrong. -np1 will always end with that error. I could make the error go away but it is only a cosmetic issue.
|
|
|
|
|
|
#40 |
|
Feb 2011
7 Posts |
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)
|
|
|
|
|
|
#41 | |
|
Oct 2004
Austria
2×17×73 Posts |
Quote:
|
|
|
|
|
|
|
#42 | ||
|
"Frank <^>"
Dec 2004
CDP Janesville
2·1,061 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#43 | |
|
Feb 2011
710 Posts |
Quote:
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 |
|
|
|
|
|
|
#44 |
|
Sep 2009
977 Posts |
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. |
|
|
|
![]() |
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 |