mersenneforum.org Help need to running Msieve
 Register FAQ Search Today's Posts Mark Forums Read

2016-04-05, 04:14   #1
appleseed

Apr 2016

7 Posts
Help need to running Msieve

Hi I am new to factoring field, i am currently try to run the miseve on my computer

My computer is running windows 10 64bit

My computer have
Microsoft Visual C++ 2005, 2010, 2012, 2013, 2015

I followed the guide and stuck on Step 3 - Polynomial Selection
http://gilchrist.ca/jeff/factoring/n...ers_guide.html

I run the command and there is no responds at all and there is no error code i am not sure what i done wrong.

Quote:
 C:\GGNFS\example>python ..\factMsieve.py example C:\GGNFS\example>
http://gilchrist.ca/jeff/factoring/index.html

ggnfs-svn413-win64-core2.zip
msieve152_svn942_win64_cuda.zip

I unziped ggnfs and then unzip miseve152 into ggnfs folder and replaced the file with same name.

and obtained factmsieve.py from
https://github.com/GDSSecurity/cloud...ctmsieve.74.py

and follow the guide to edit facmsieve.py with
Code:
61 GGNFS_PATH = '../'
62 MSIEVE_PATH = '../'
65 NUM_CORES = 4
72 USE_CUDA = True
73 GPU Number = 1  (i change this myself, however either 0 or 1 not working)
84 USE_KLEINJUNG_FRANKE_PS = True
85 USE_MSIEVE_POLY = False
and example.n with
n: 2881039827457895971881627053137530734638790825166127496066674320241571446494762386620442953820735453

i am not sure why it is not working

 2016-04-05, 12:21 #2 appleseed   Apr 2016 7 Posts ok i figure out that the facmsieve.py 0.72 i got give me the problem. now i download a copy from http://www.mersenneforum.org/showthread.php?t=20328 but now it run into this error. i am using the exact example from Jeff's guide. n: 2881039827457895971881627053137530734638790825166127496066674320241571446494762386620442953820735453 I am not sure what is missing Please help!! Code: Total yield: 186760 11624/6841 mpqs failures, 103438/60211 vain mpqs milliseconds total: Sieve 468148 Sched 0 medsched 151707 TD 538303 (Init 11362, MPQS 358443) Sieve-Change 261013 TD side 0: init/small/medium/large/search: 2856 27082 5151 8387 45624 sieve: init/small/medium/large/search: 8831 104535 6827 104463 42269 TD side 1: init/small/medium/large/search: 2243 24931 5022 8096 397528 sieve: init/small/medium/large/search: 5102 67039 7038 107666 14378 appending spairs.out.T0 to spairs.out appending spairs.out.T1 to spairs.out appending spairs.out.T2 to spairs.out appending spairs.out.T3 to spairs.out appending spairs.out to example.dat compressing spairs.out to spairs.save.gz Found 10156635 relations, 118.8% of the estimated minimum (8550000). -> msieve -s example\example.dat -l example\example.log -i example\example.ini -nf example\example.fb -t 4 -nc1 read 10M relations -> Running matrix solving step ... -> msieve -s example\example.dat -l example\example.log -i example\example.ini -nf example\example.fb -t 4 -nc2 Return value -1073740940. Terminating... Thanks
 2016-04-05, 15:54 #3 chris2be8     Sep 2009 24·139 Posts Look in example\example.log (msieve writes messages there). If you can't fix it from them then post them to the list. Also try: msieve -h which should give you a list of options you can pass msieve. The first line should say what version of msieve you have, post that here if you are still having problems. Chris
2016-04-06, 12:37   #4
appleseed

Apr 2016

7 Posts

Quote:
 Originally Posted by chris2be8 Look in example\example.log (msieve writes messages there). If you can't fix it from them then post them to the list. Also try: msieve -h which should give you a list of options you can pass msieve. The first line should say what version of msieve you have, post that here if you are still having problems. Chris
where do I put the msieve -h? I am very new to this program.

I found CUDA is giving me trouble so I change the my msieve to i7/i5 1.52dev SVN 939 and disabled CUDA

still got same error that "the msieve.exe has stopped working" also log file looks different from first time i try to run this, but error message from CMD still same.

any idea what went wrong?

Example.log
Code:
Tue Apr 05 23:50:37 2016  polynomial selection complete
Tue Apr 05 23:50:37 2016  R0: -1254294131197214369619869
Tue Apr 05 23:50:37 2016  R1: 3527685689521
Tue Apr 05 23:50:37 2016  A0: -12780673231830721477265202912
Tue Apr 05 23:50:37 2016  A1: 3231819315866440433328
Tue Apr 05 23:50:37 2016  A2: -29157963878076698
Tue Apr 05 23:50:37 2016  A3: -1218961057
Tue Apr 05 23:50:37 2016  A4: 1164
Tue Apr 05 23:50:37 2016  skew 3836463.64, size 1.037e-013, alpha -5.932, combined = 1.246e-008 rroots = 2
Tue Apr 05 23:50:37 2016  elapsed time 00:24:12
Tue Apr 05 23:50:37 2016 -> Selected lattice siever: gnfs-lasieve4I12e
Tue Apr 05 23:50:37 2016 -> Creating param file to detect parameter changes...
Tue Apr 05 23:50:37 2016 -> Running setup ...
Tue Apr 05 23:50:37 2016 -> Estimated minimum relations needed: 4.095e+06
Tue Apr 05 23:50:37 2016 -> cleaning up before a restart
Tue Apr 05 23:50:37 2016 -> Running lattice siever ...
Tue Apr 05 23:50:37 2016 -> entering sieving loop
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 900000 in 900000 .. 912500 as file example.job.T0
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 912500 in 912500 .. 925000 as file example.job.T1
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 925000 in 925000 .. 937500 as file example.job.T2
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 937500 in 937500 .. 950000 as file example.job.T3
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 950000 in 950000 .. 962500 as file example.job.T4
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 962500 in 962500 .. 975000 as file example.job.T5
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 975000 in 975000 .. 987500 as file example.job.T6
Tue Apr 05 23:50:37 2016 -> making sieve job for q = 987500 in 987500 .. 1000000 as file example.job.T7
Tue Apr 05 23:50:37 2016 -> Lattice sieving algebraic q from 900000 to 1000000.
Tue Apr 05 23:50:37 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T0 -v -n0 -a example.job.T0
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T1 -v -n1 -a example.job.T1
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T2 -v -n2 -a example.job.T2
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T3 -v -n3 -a example.job.T3
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T4 -v -n4 -a example.job.T4
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T5 -v -n5 -a example.job.T5
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T6 -v -n6 -a example.job.T6
Tue Apr 05 23:50:38 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T7 -v -n7 -a example.job.T7
Tue Apr 05 23:59:29 2016 Found 1162674 relations, 28.4% of the estimated minimum (4095000).
Tue Apr 05 23:59:29 2016 LatSieveTime: 532.328
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1000000 in 1000000 .. 1012500 as file example.job.T0
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1012500 in 1012500 .. 1025000 as file example.job.T1
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1025000 in 1025000 .. 1037500 as file example.job.T2
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1037500 in 1037500 .. 1050000 as file example.job.T3
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1050000 in 1050000 .. 1062500 as file example.job.T4
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1062500 in 1062500 .. 1075000 as file example.job.T5
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1075000 in 1075000 .. 1087500 as file example.job.T6
Tue Apr 05 23:59:29 2016 -> making sieve job for q = 1087500 in 1087500 .. 1100000 as file example.job.T7
Tue Apr 05 23:59:29 2016 -> Lattice sieving algebraic q from 1000000 to 1100000.
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T0 -v -n0 -a example.job.T0
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T1 -v -n1 -a example.job.T1
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T2 -v -n2 -a example.job.T2
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T3 -v -n3 -a example.job.T3
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T4 -v -n4 -a example.job.T4
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T5 -v -n5 -a example.job.T5
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T6 -v -n6 -a example.job.T6
Tue Apr 05 23:59:29 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T7 -v -n7 -a example.job.T7
Wed Apr 06 00:08:03 2016 Found 2325576 relations, 56.8% of the estimated minimum (4095000).
Wed Apr 06 00:08:03 2016 LatSieveTime: 513.931
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1100000 in 1100000 .. 1112500 as file example.job.T0
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1112500 in 1112500 .. 1125000 as file example.job.T1
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1125000 in 1125000 .. 1137500 as file example.job.T2
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1137500 in 1137500 .. 1150000 as file example.job.T3
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1150000 in 1150000 .. 1162500 as file example.job.T4
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1162500 in 1162500 .. 1175000 as file example.job.T5
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1175000 in 1175000 .. 1187500 as file example.job.T6
Wed Apr 06 00:08:03 2016 -> making sieve job for q = 1187500 in 1187500 .. 1200000 as file example.job.T7
Wed Apr 06 00:08:03 2016 -> Lattice sieving algebraic q from 1100000 to 1200000.
Wed Apr 06 00:08:03 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T0 -v -n0 -a example.job.T0
.
.
.
Wed Apr 06 00:08:03 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T7 -v -n7 -a example.job.T7
Wed Apr 06 00:16:56 2016 Found 3538121 relations, 86.4% of the estimated minimum (4095000).
Wed Apr 06 00:16:56 2016 LatSieveTime: 533.235
Wed Apr 06 00:16:56 2016 -> making sieve job for q = 1200000 in 1200000 .. 1212500 as file example.job.T0
Wed Apr 06 00:16:56 2016 -> making sieve job for q = 1212500 in 1212500 .. 1225000 as file example.job.T1
.
.
.
Wed Apr 06 00:16:56 2016 -> making sieve job for q = 1287500 in 1287500 .. 1300000 as file example.job.T7
Wed Apr 06 00:16:56 2016 -> Lattice sieving algebraic q from 1200000 to 1300000.
Wed Apr 06 00:16:56 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T0 -v -n0 -a example.job.T0
.
.
.
Wed Apr 06 00:16:56 2016 -> gnfs-lasieve4I12e -k -o spairs.out.T7 -v -n7 -a example.job.T7
Wed Apr 06 00:25:28 2016 Found 4720541 relations, 115.3% of the estimated minimum (4095000).
Wed Apr 06 00:25:28 2016
Wed Apr 06 00:25:28 2016  Msieve v. 1.52 (SVN 939)
Wed Apr 06 00:25:28 2016  random seeds: f73d0024 69e40e6f
Wed Apr 06 00:25:28 2016  factoring 2881039827457895971881627053137530734638790825166127496066674320241571446494762386620442953820735453 (100 digits)
Wed Apr 06 00:25:29 2016  searching for 15-digit factors
Wed Apr 06 00:25:29 2016  commencing number field sieve (100-digit input)
Wed Apr 06 00:25:29 2016  R0: -1254294131197214369619869
Wed Apr 06 00:25:29 2016  R1: 3527685689521
Wed Apr 06 00:25:29 2016  A0: -12780673231830721477265202912
Wed Apr 06 00:25:29 2016  A1: 3231819315866440433328
Wed Apr 06 00:25:29 2016  A2: -29157963878076698
Wed Apr 06 00:25:29 2016  A3: -1218961057
Wed Apr 06 00:25:29 2016  A4: 1164
Wed Apr 06 00:25:29 2016  skew 3836463.64, size 1.037e-013, alpha -5.932, combined = 1.246e-008 rroots = 2
Wed Apr 06 00:25:29 2016
Wed Apr 06 00:25:29 2016  commencing relation filtering
Wed Apr 06 00:25:29 2016  estimated available RAM is 16266.8 MB
Wed Apr 06 00:25:29 2016  commencing duplicate removal, pass 1
Wed Apr 06 00:25:44 2016  found 514638 hash collisions in 4720540 relations
Wed Apr 06 00:25:50 2016  added 148735 free relations
Wed Apr 06 00:25:50 2016  commencing duplicate removal, pass 2
Wed Apr 06 00:25:51 2016  found 281103 duplicates and 4588172 unique relations
Wed Apr 06 00:25:51 2016  memory use: 20.6 MB
Wed Apr 06 00:25:51 2016  reading ideals above 100000
Wed Apr 06 00:25:51 2016  commencing singleton removal, initial pass
Wed Apr 06 00:26:13 2016  memory use: 94.1 MB
Wed Apr 06 00:26:13 2016  reading all ideals from disk
Wed Apr 06 00:26:13 2016  memory use: 141.4 MB
Wed Apr 06 00:26:13 2016  keeping 4736488 ideals with weight <= 200, target excess is 22941
Wed Apr 06 00:26:14 2016  commencing in-memory singleton removal
Wed Apr 06 00:26:14 2016  begin with 4588172 relations and 4736488 unique ideals
Wed Apr 06 00:26:15 2016  reduce to 2030005 relations and 1675050 ideals in 12 passes
Wed Apr 06 00:26:15 2016  max relations containing the same ideal: 113
Wed Apr 06 00:26:16 2016  removing 588637 relations and 424465 ideals in 164172 cliques
Wed Apr 06 00:26:16 2016  commencing in-memory singleton removal
Wed Apr 06 00:26:16 2016  begin with 1441368 relations and 1675050 unique ideals
Wed Apr 06 00:26:17 2016  reduce to 1324067 relations and 1121340 ideals in 8 passes
Wed Apr 06 00:26:17 2016  max relations containing the same ideal: 86
Wed Apr 06 00:26:17 2016  removing 486140 relations and 321968 ideals in 164172 cliques
Wed Apr 06 00:26:17 2016  commencing in-memory singleton removal
Wed Apr 06 00:26:17 2016  begin with 837927 relations and 1121340 unique ideals
Wed Apr 06 00:26:17 2016  reduce to 728735 relations and 676236 ideals in 9 passes
Wed Apr 06 00:26:17 2016  max relations containing the same ideal: 60
Wed Apr 06 00:26:18 2016  removing 114399 relations and 88512 ideals in 25887 cliques
Wed Apr 06 00:26:18 2016  commencing in-memory singleton removal
Wed Apr 06 00:26:18 2016  begin with 614336 relations and 676236 unique ideals
Wed Apr 06 00:26:18 2016  reduce to 599339 relations and 572164 ideals in 7 passes
Wed Apr 06 00:26:18 2016  max relations containing the same ideal: 50
Wed Apr 06 00:26:18 2016  relations with 0 large ideals: 394
Wed Apr 06 00:26:18 2016  relations with 1 large ideals: 383
Wed Apr 06 00:26:18 2016  relations with 2 large ideals: 4857
Wed Apr 06 00:26:18 2016  relations with 3 large ideals: 29847
Wed Apr 06 00:26:18 2016  relations with 4 large ideals: 95743
Wed Apr 06 00:26:18 2016  relations with 5 large ideals: 173930
Wed Apr 06 00:26:18 2016  relations with 6 large ideals: 167392
Wed Apr 06 00:26:18 2016  relations with 7+ large ideals: 126793
Wed Apr 06 00:26:18 2016  commencing 2-way merge
Wed Apr 06 00:26:18 2016  reduce to 359435 relation sets and 332260 unique ideals
Wed Apr 06 00:26:18 2016  commencing full merge
Wed Apr 06 00:26:22 2016  memory use: 40.5 MB
Wed Apr 06 00:26:22 2016  found 176193 cycles, need 172460
Wed Apr 06 00:26:22 2016  weight of 172460 cycles is about 12142894 (70.41/cycle)
Wed Apr 06 00:26:22 2016  distribution of cycle lengths:
Wed Apr 06 00:26:22 2016  1 relations: 13697
.
.
.
Wed Apr 06 00:26:22 2016  9 relations: 11103
Wed Apr 06 00:26:22 2016  10+ relations: 41760
Wed Apr 06 00:26:22 2016  heaviest cycle: 21 relations
Wed Apr 06 00:26:22 2016  commencing cycle optimization
Wed Apr 06 00:26:24 2016  pruned 34575 relations
Wed Apr 06 00:26:24 2016  memory use: 36.1 MB
Wed Apr 06 00:26:24 2016  distribution of cycle lengths:
Wed Apr 06 00:26:24 2016  1 relations: 13697
.
.
.
Wed Apr 06 00:26:24 2016  9 relations: 11291
Wed Apr 06 00:26:24 2016  10+ relations: 38414
Wed Apr 06 00:26:24 2016  heaviest cycle: 21 relations
Wed Apr 06 00:26:24 2016  RelProcTime: 55
Wed Apr 06 00:26:24 2016  elapsed time 00:00:56
Wed Apr 06 00:26:24 2016 LatSieveTime: 567.998
Wed Apr 06 00:26:24 2016 -> Running matrix solving step ...
Wed Apr 06 00:26:24 2016
Wed Apr 06 00:26:24 2016
Wed Apr 06 00:26:24 2016  Msieve v. 1.52 (SVN 939)
Wed Apr 06 00:26:24 2016  random seeds: 380d3900 589f3d04
Wed Apr 06 00:26:24 2016  factoring 2881039827457895971881627053137530734638790825166127496066674320241571446494762386620442953820735453 (100 digits)
Wed Apr 06 00:26:25 2016  searching for 15-digit factors
Wed Apr 06 00:26:25 2016  commencing number field sieve (100-digit input)
Wed Apr 06 00:26:25 2016  R0: -1254294131197214369619869
Wed Apr 06 00:26:25 2016  R1: 3527685689521
Wed Apr 06 00:26:25 2016  A0: -12780673231830721477265202912
Wed Apr 06 00:26:25 2016  A1: 3231819315866440433328
Wed Apr 06 00:26:25 2016  A2: -29157963878076698
Wed Apr 06 00:26:25 2016  A3: -1218961057
Wed Apr 06 00:26:25 2016  A4: 1164
Wed Apr 06 00:26:25 2016  skew 3836463.64, size 1.037e-013, alpha -5.932, combined = 1.246e-008 rroots = 2
Wed Apr 06 00:26:25 2016
Wed Apr 06 00:26:25 2016  commencing linear algebra
Wed Apr 06 00:26:25 2016  read 172460 cycles
Wed Apr 06 00:26:25 2016  cycles contain 578054 unique relations
Wed Apr 06 00:26:28 2016  read 578054 relations
Wed Apr 06 00:26:28 2016  using 20 quadratic characters above 67094558
Wed Apr 06 00:26:30 2016  building initial matrix
Wed Apr 06 00:26:34 2016  memory use: 73.0 MB
Wed Apr 06 00:26:34 2016  read 172460 cycles
Wed Apr 06 00:26:34 2016  matrix is 172281 x 172460 (51.3 MB) with weight 16566850 (96.06/col)
Wed Apr 06 00:26:34 2016  sparse part has weight 11544077 (66.94/col)
Wed Apr 06 00:26:35 2016  filtering completed in 2 passes
Wed Apr 06 00:26:35 2016  matrix is 172191 x 172370 (51.3 MB) with weight 16562182 (96.09/col)
Wed Apr 06 00:26:35 2016  sparse part has weight 11542126 (66.96/col)
Wed Apr 06 00:26:35 2016  matrix starts at (0, 0)
Wed Apr 06 00:26:35 2016  matrix is 172191 x 172370 (51.3 MB) with weight 16562182 (96.09/col)
Wed Apr 06 00:26:35 2016  sparse part has weight 11542126 (66.96/col)
Wed Apr 06 00:26:35 2016  saving the first 48 matrix rows for later
Wed Apr 06 00:26:35 2016  matrix includes 64 packed rows
Wed Apr 06 00:26:35 2016  matrix is 172143 x 172370 (49.5 MB) with weight 13077274 (75.87/col)
Wed Apr 06 00:26:35 2016  sparse part has weight 11250310 (65.27/col)
Wed Apr 06 00:26:35 2016  using block size 8192 and superblock size 786432 for processor cache size 8192 kB
Wed Apr 06 00:26:36 2016  commencing Lanczos iteration
Wed Apr 06 00:26:36 2016  memory use: 37.2 MB
Error Message from CMD window

Code:
Total yield: 155243
382/145 mpqs failures, 10959/4492 vain mpqs
milliseconds total: Sieve 86630 Sched 0 medsched 32520
TD 261718 (Init 5852, MPQS 184307) Sieve-Change 78949
TD side 0: init/small/medium/large/search: 1281 8247 1608 1734 26843
sieve: init/small/medium/large/search: 3035 21265 2140 9547 11649
TD side 1: init/small/medium/large/search: 414 7070 1623 1753 205288
sieve: init/small/medium/large/search: 1358 12425 2182 11234 11795
appending spairs.out.T0 to spairs.out
appending spairs.out.T1 to spairs.out
appending spairs.out.T2 to spairs.out
appending spairs.out.T3 to spairs.out
appending spairs.out.T4 to spairs.out
appending spairs.out.T5 to spairs.out
appending spairs.out.T6 to spairs.out
appending spairs.out.T7 to spairs.out
appending spairs.out to example.dat
compressing spairs.out to spairs.save.gz
Found 4720541 relations, 115.3% of the estimated minimum (4095000).
-> msieve -s example\example.dat -l example\example.log -i example\example.ini -nf example\example.fb -t 8 -nc1
-> Running matrix solving step ...
-> msieve -s example\example.dat -l example\example.log -i example\example.ini -nf example\example.fb -t 8 -nc2
Return value -1073741819. Terminating...

Last fiddled with by appleseed on 2016-04-06 at 12:39

 2016-04-06, 15:58 #5 chris2be8     Sep 2009 24·139 Posts Run msieve -h on the command line, it should tell you what command line options msieve takes. The log output you posted says what version you have. I can't tell why msieve crashed when it did, the messages look normal up to the point when they stopped. The only thing I can think of is that it looks as if you are running the script from the directory above the one with example.n in it. Look in that dir and the one above it to see if any files have been created in the wrong place. I would cd into the directory with example.n in it and run the script from there (create a new dir with just example.n in it if you want to start again). If that isn't it I can't help any more. I only use Linux so I don't know how to debug problems on Windows. Chris
2016-04-06, 16:48   #6
appleseed

Apr 2016

7 Posts

Quote:
 Originally Posted by chris2be8 Run msieve -h on the command line, it should tell you what command line options msieve takes. The log output you posted says what version you have. I can't tell why msieve crashed when it did, the messages look normal up to the point when they stopped. The only thing I can think of is that it looks as if you are running the script from the directory above the one with example.n in it. Look in that dir and the one above it to see if any files have been created in the wrong place. I would cd into the directory with example.n in it and run the script from there (create a new dir with just example.n in it if you want to start again). If that isn't it I can't help any more. I only use Linux so I don't know how to debug problems on Windows. Chris
i run the msieve -h, it shows Msieve v. 1.51 (SVN Official Release)

here its output.
Code:
Msieve v. 1.51 (SVN Official Release)

usage: Msieve [options] [one_number]

numbers starting with '0' are treated as octal,
numbers starting with '0x' are treated as hexadecimal

options:
-s <name> save intermediate results to <name>
-i <name> read one or more integers to factor from
from the command line
-m        manual mode: enter numbers via standard input
only print any factors found
-d <min>  deadline: if still sieving after <min>
minutes, shut down gracefully (default off)
-r <num>  stop sieving after finding <num> relations
-p        run at idle priority
as well as to logfile
-t <num>  use at most <num> threads

elliptic curve options:
-e        perform 'deep' ECM, seek factors > 15 digits

-c        client: only perform sieving

number field sieve options:

[nfs_phase] "arguments"

where the first part is one or more of:
-n        use the number field sieve (80+ digits only;
performs all NFS tasks in order)
-nf <name> read from / write to NFS factor base file
<name> instead of the default msieve.fb
-np       perform only NFS polynomial selection
-np1      perform stage 1 of NFS polynomial selection
-nps      perform NFS polynomial size optimization
-npr      perform NFS polynomial root optimization
-ns       perform only NFS sieving
-nc       perform only NFS combining (all phases)
-nc1      perform only NFS filtering
-nc2      perform only NFS linear algebra
-ncr      perform only NFS linear algebra, restarting
from a previous checkpoint
-nc3      perform only NFS square root

the arguments are a space-delimited list of:
polynomial selection options:
polydegree=X    select polynomials with degree X
min_coeff=X     minimum leading coefficient to search
in stage 1
max_coeff=X     maximum leading coefficient to search
in stage 1
stage1_norm=X   the maximum norm value for stage 1
stage2_norm=X   the maximum norm value for stage 2
min_evalue=X    the minimum score of saved polyomials
poly_deadline=X stop searching after X seconds (0 means
search forever)
X,Y             same as 'min_coeff=X max_coeff=Y'
line sieving options:
X,Y             handle sieve lines X to Y inclusive
filtering options:
filter_mem_mb=X  try to limit filtering memory use to
X megabytes
filter_maxrels=X limit the filtering to using the first
X relations in the data file
filter_lpbound=X have filtering start by only looking
at ideals of size X or larger
target_density=X attempt to produce a matrix with X
entries per column
X,Y              same as 'filter_lpbound=X filter_maxrels=Y'
linear algebra options:
skip_matbuild=1  start the linear algebra but skip building
the matrix (assumes it is built already)
square root options:
X,Y       use dependencies X through Y, 1<=X<=Y<=64)
is that possible my factmsieve.py still the problem? can you share yours if you using python?

 2016-04-06, 18:54 #7 wombatman I moo ablest echo power!     May 2013 32×199 Posts What processor do you have?
2016-04-06, 19:12   #8
appleseed

Apr 2016

7 Posts

Quote:
 Originally Posted by wombatman What processor do you have?
I encounter similar error on both my desktop and laptop

My desktop using i7-3770k 3.5GHz Core 4 Thread 8
My Laptop using i7-4720HQ 2.6GHz core 4 Thread 8

 2016-04-06, 20:18 #9 wombatman I moo ablest echo power!     May 2013 32×199 Posts I'll upload the version I have compiled when I get home. It's more recent than the one on Jeff Gilchrist's page and it's built for an i7 processor. That way we can (hopefully) eliminate the executable as the issue. Edit: Actually, check here: http://mersenneforum.org/showthread.php?t=20796&page=5 There are several versions (CUDA-enabled and non-enabled) compiled for different processors. Perhaps one will work for you. Last fiddled with by wombatman on 2016-04-06 at 20:20
2016-04-06, 20:50   #10
appleseed

Apr 2016

7 Posts

Quote:
 Originally Posted by wombatman I'll upload the version I have compiled when I get home. It's more recent than the one on Jeff Gilchrist's page and it's built for an i7 processor. That way we can (hopefully) eliminate the executable as the issue. Edit: Actually, check here: http://mersenneforum.org/showthread.php?t=20796&page=5 There are several versions (CUDA-enabled and non-enabled) compiled for different processors. Perhaps one will work for you.
Thanks, will give a try on those. hope will found one will work for my computers

2016-04-07, 02:50   #11
appleseed

Apr 2016

7 Posts

Quote:
 Originally Posted by wombatman I'll upload the version I have compiled when I get home. It's more recent than the one on Jeff Gilchrist's page and it's built for an i7 processor. That way we can (hopefully) eliminate the executable as the issue. Edit: Actually, check here: http://mersenneforum.org/showthread.php?t=20796&page=5 There are several versions (CUDA-enabled and non-enabled) compiled for different processors. Perhaps one will work for you.
OMG Thank you so much, it is indeed Msieve version give me trouble the msieve-svn991-cuda75-haswell.zip works perfect on my laptop, yet it does not work for my Desktop, but the
SVN 991M you post works perfect for my Desktop, so the different CPU require different msieve version, now I have finished several factoring already without error!

Thank you so much!! problem solved.

after several run I found a 104 digit number i am testing only take 1 sec to compile while other number i test takes range from half hour to 4 hours to compile. what is the reason this number able to factor so fast?

Code:
Msieve v. 1.53 (SVN unknown)
Wed Apr 06 21:48:12 2016
random seeds: d5dd5e00 6101e0b5
factoring 13270693758489295980223043261833153409168505210538146384653262578584663296471619841442958585315929292397 (104 digits)
searching for 15-digit factors
P-1 stage 1 factor found
p47 factor: 15630142427492468388372081926250991439041076399
p57 factor: 849044966803818375324759862315880105960150311070093456803
elapsed time 00:00:01
-> Computing 1.46e+09 scale for this machine...
-> procrels -speedtest> PIPE
Scaled time: 7644545824.37 units (timescale= 5.236).
Traceback (most recent call last):
File "../factmsieve.py", line 2034, in <module>
output_summary(NAME, fact_p, pols_p, poly_p, lats_p)
File "../factmsieve.py", line 1892, in output_summary
with open(NAME + '.poly', 'r') as in_f:
IOError: [Errno 2] No such file or directory: '104.poly'

Last fiddled with by appleseed on 2016-04-07 at 02:52

 Similar Threads Thread Thread Starter Forum Replies Last Post aein Msieve 9 2019-02-25 14:09 mohamed Msieve 20 2013-08-01 08:27 ryanp Msieve 3 2012-06-12 03:27 Sab Msieve 4 2009-07-07 06:19 Phil MjX Msieve 244 2008-03-20 02:35

All times are UTC. The time now is 11:17.

Thu Jan 27 11:17:47 UTC 2022 up 188 days, 5:46, 1 user, load averages: 1.28, 1.30, 1.32