![]() |
[QUOTE=Dubslow;324756]Hmm... what are the polys it's generating? Does that mean it's not crashing anymore? (Could a mod move these to the yafu bugs thread?)[/QUOTE]
When I run this: ./yafu "snfs(11471^37-1, (11471^37-1)/(11470))" -threads 8 I get this: nfs: commencing nfs on c151: 1604158774754369095369527255513708288084987926255394489995588072900274434149193480382752963251625180627330279865805719103619804038403082663575924043790 nfs: searching for brent special forms... total yield: 28841, q=4702037 (0.00253 sec/rel) Segmentation fault (core dumped) And then it ends. Carlos |
Ah, so it is producing polys and is even getting to sieving before failing... so maybe it's the siever that's failing?
Can you run the command with -v? |
[code]
eduardo@eduardo-SATELLITE-L850-1HZ:~$ ./yafu "snfs(11471^37-1, (11471^37-1)/(2*5*31*37))" -threads 8 -v 01/15/13 00:23:52 v1.33 @ eduardo-SATELLITE-L850-1HZ, System/Build Info: Using GMP-ECM 6.4.3, Powered by GMP 5.0.4 detected Intel(R) Core(TM) i7-3630QM CPU @ 2.40GHz detected L1 = 32768 bytes, L2 = 6291456 bytes, CL = 64 bytes measured cpu frequency ~= 2394.541280 using 20 random witnesses for Rabin-Miller PRP checks =============================================================== ======= Welcome to YAFU (Yet Another Factoring Utility) ======= ======= bbuhrow@gmail.com ======= ======= Type help at any time, or quit to quit ======= =============================================================== cached 78498 primes. pmax = 999983 >> nfs: checking for job file - no job file found nfs: checking for poly file - no poly file found nfs: commencing nfs on c151: 1604158774754369095369527255513708288084987926255394489995588072900274434149193480382752963251625180627330279865805719103619804038403082663575924043790 nfs: searching for brent special forms... nfs: input divides 11471^37 - 1 gen: ======================================================== gen: considering the following polynomials: gen: ======================================================== n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 162.38, anorm: -3.49e+31, rnorm: 2.74e+45 type: snfs size: 162 skew: 207.8037 c4: 1 c0: -1509398240111 Y1: -1 Y0: 39446892596694940551742693403134159615201 m: 39446892596694940551742693403134159615201 n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 154.26, anorm: -3.17e+20, rnorm: 1.11e+43 type: snfs size: 154 skew: 0.0966 c4: 11471 c0: -1 Y1: -1 Y0: 3438836421994154001546743387946487631 m: 3438836421994154001546743387946487631 n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 162.38, anorm: -3.49e+37, rnorm: 3.55e+37 type: snfs size: 162 skew: 71.4698 c5: 1 c0: -1509398240111 Y1: -1 Y0: 299785234242363699899463288984961 m: 299785234242363699899463288984961 n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 158.32, anorm: -1.29e+29, rnorm: 1.69e+35 type: snfs size: 158 skew: 0.0238 c5: 131583841 c0: -1 Y1: -1 Y0: 26134184835006860770592214191 m: 26134184835006860770592214191 gen: ======================================================== gen: best 3 polynomials: gen: ======================================================== n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 154.26, anorm: -3.17e+20, rnorm: 1.11e+43 # scaled difficulty: 162.08, suggest sieving rational side type: snfs size: 154 skew: 0.0966 c4: 11471 c0: -1 Y1: -1 Y0: 3438836421994154001546743387946487631 m: 3438836421994154001546743387946487631 n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 158.32, anorm: -1.29e+29, rnorm: 1.69e+35 # scaled difficulty: 167.46, suggest sieving rational side type: snfs size: 158 skew: 0.0238 c5: 131583841 c0: -1 Y1: -1 Y0: 26134184835006860770592214191 m: 26134184835006860770592214191 n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 162.38, anorm: -3.49e+37, rnorm: 3.55e+37 # scaled difficulty: 174.56, suggest sieving rational side type: snfs size: 162 skew: 71.4698 c5: 1 c0: -1509398240111 Y1: -1 Y0: 299785234242363699899463288984961 m: 299785234242363699899463288984961 nfs: guessing snfs difficulty 154 is roughly equal to gnfs difficulty 116 nfs: guessing snfs difficulty 158 is roughly equal to gnfs difficulty 118 nfs: guessing snfs difficulty 162 is roughly equal to gnfs difficulty 120 test: generating factor bases test: fb generation took 0.6737 seconds test: commencing test sieving of polynomial 0 on the rational side over range 4700000-4702000 gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ FBsize 328419+0 (deg 4), 328963+0 (deg 1) total yield: 28841, q=4702037 (0.00255 sec/rel) 141 Special q, 1005 reduction iterations reports: 36382097->5126785->4713897->3443486->2995691->2649547 Number of relations with k rational and l algebraic primes for (k,l)=: Total yield: 28841 0/0 mpqs failures, 15826/22734 vain mpqs milliseconds total: Sieve 24930 Sched 0 medsched 11630 TD 21440 (Init 710, MPQS 11130) Sieve-Change 15480 TD side 0: init/small/medium/large/search: 230 1290 380 740 2150 sieve: init/small/medium/large/search: 350 4540 480 6250 650 TD side 1: init/small/medium/large/search: 400 1420 370 910 1580 sieve: init/small/medium/large/search: 570 4350 440 6350 950 test: new best score of 0.002555 sec/rel test: estimated total sieving time = 1h 6m 48s (with 8 threads) test: yield greater than 3x/spq, lowering siever version test: generating factor bases test: fb generation took 0.8260 seconds test: commencing test sieving of polynomial 1 on the rational side over range 5100000-5102000 gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ FBsize 354981+0 (deg 5), 354970+0 (deg 1) total yield: 18280, q=5102059 (0.00361 sec/rel) 133 Special q, 1005 reduction iterations reports: 39065974->4919416->4553852->2449821->2020235->1756914 Number of relations with k rational and l algebraic primes for (k,l)=: Total yield: 18280 0/0 mpqs failures, 13870/9987 vain mpqs milliseconds total: Sieve 23690 Sched 0 medsched 11020 TD 15440 (Init 650, MPQS 7100) Sieve-Change 15780 TD side 0: init/small/medium/large/search: 310 1120 460 780 1320 sieve: init/small/medium/large/search: 440 4450 450 5910 820 TD side 1: init/small/medium/large/search: 260 890 310 840 1330 sieve: init/small/medium/large/search: 470 4050 450 6010 640 test: score was 0.003620 sec/rel test: estimated total sieving time = 1h 34m 39s (with 8 threads) test: generating factor bases test: fb generation took 0.8591 seconds test: commencing test sieving of polynomial 2 on the rational side over range 5500000-5502000 gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ FBsize 380947+0 (deg 5), 380799+0 (deg 1) total yield: 3889, q=5502041 (0.01410 sec/rel) 127 Special q, 641 reduction iterations reports: 20792000->1569895->1449984->606348->492951->412806 Number of relations with k rational and l algebraic primes for (k,l)=: Total yield: 3889 0/0 mpqs failures, 3092/2291 vain mpqs milliseconds total: Sieve 21530 Sched 0 medsched 10910 TD 6190 (Init 250, MPQS 1540) Sieve-Change 16230 TD side 0: init/small/medium/large/search: 430 480 410 660 380 sieve: init/small/medium/large/search: 370 4080 350 5510 500 TD side 1: init/small/medium/large/search: 330 300 400 640 340 sieve: init/small/medium/large/search: 330 3900 380 5780 330 test: score was 0.014159 sec/rel test: estimated total sieving time = 6h 10m 12s (with 8 threads) test: test sieving took 197.31 seconds gen: ======================================================== gen: selected polynomial: gen: ======================================================== n: 2026820318771232850238860054901018897773791663817557000979720026924963481851034866416737869304199536604897863811255208174972689390481420089 # 11471^37-1, difficulty: 154.26, anorm: -3.17e+20, rnorm: 1.11e+43 # scaled difficulty: 162.08, suggest sieving rational side type: snfs size: 154 skew: 0.0966 c4: 11471 c0: -1 Y1: -1 Y0: 3438836421994154001546743387946487631 m: 3438836421994154001546743387946487631 nfs: guessing snfs difficulty 154 is roughly equal to gnfs difficulty 116 nfs: commencing rational side lattice sieving over range: 2385000 - 2390000 nfs: commencing rational side lattice sieving over range: 2365000 - 2370000 nfs: commencing rational side lattice sieving over range: 2350000 - 2355000 nfs: commencing rational side lattice sieving over range: 2360000 - 2365000 nfs: commencing rational side lattice sieving over range: 2370000 - 2375000 nfs: commencing rational side lattice sieving over range: 2380000 - 2385000 nfs: commencing rational side lattice sieving over range: 2355000 - 2360000 nfs: commencing rational side lattice sieving over range: 2375000 - 2380000 gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ Warning: lowering FB_bound to 2384999. gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ Warning: lowering FB_bound to 2359999. Warning: lowering FB_bound to 2364999. gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ Warning: lowering FB_bound to 2379999. Warning: lowering FB_bound to 2354999. gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ Warning: lowering FB_bound to 2369999. Warning: lowering FB_bound to 2349999. gnfs-lasieve4I13e (with asm64): L1_BITS=15, SVN $Revision: 399 $ Warning: lowering FB_bound to 2374999. FBsize 328419+0 (deg 4), 174915+0 (deg 1) FBsize 328419+0 (deg 4), 173562+0 (deg 1) FBsize 328419+0 (deg 4), 174252+0 (deg 1) FBsize 328419+0 (deg 4), 175264+0 (deg 1) FBsize 328419+0 (deg 4), 173214+0 (deg 1) FBsize 328419+0 (deg 4), 172872+0 (deg 1) FBsize 328419+0 (deg 4), 173911+0 (deg 1) FBsize 328419+0 (deg 4), 174577+0 (deg 1) total yield: 20949, q=2386667 (0.00426 sec/rel) [/code] I think now it is running.... Carlos |
11471^37-1
I'll let it run through the night the 11471^37-1 from composites page of OP.
|
Just a quick note... you could also do yafu "nfs(11471^37-1)" and it will remove the algebraic factors automatically (in your case just 11470). the snfs(form, cofactor) function is mostly for when there are known non-algebraic factors such as those found by ecm.
|
[QUOTE=pinhodecarlos;324763]I'll let it run through the night the 11471^37-1 from composites page of OP.[/QUOTE]
I didn't run it because too much heat here in Brazil. I'm going to try it again in the fresh morning... Edit: I can't...laptop cpu temps reaches 100 ºC, idle cores at 58 ºC!!!! Can't help. Unreserve 11471^37-1. |
[QUOTE=pinhodecarlos;324796]I didn't run it because too much heat here in Brazil. I'm going to try it again in the fresh morning...
Edit: I can't...laptop cpu temps reaches 100 ºC, idle cores at 58 ºC!!!! Can't help. Unreserve 11471^37-1.[/QUOTE] I'll take it. It was -15C here this morning so heat is definitely not an issue :) |
11471^37-1
[CODE]PRP78 = 479919453522719678701326964384071638384795569078561760013197236308176851466851 PRP54 = 659764522602077743376337633409998146360609360420969711[/CODE] |
[QUOTE=Dubslow;324634]
I've just started 200029^37-1 [/QUOTE] [url]http://factordb.com/index.php?query=200029%5E37-1[/url] P52*P140 |
[QUOTE=wblipp;324691] Offlist, Ryan Propper has recently factored over 30 of Pascal's most heavily weighted roadblocks below 200 digits. I'll post more about this in the not-too-distant future..[/QUOTE]
Could you produce a list of roadblocks sorted by (weight of roadblock)/(estimated time to factor)? That would say which are most worth factoring. Chris |
[QUOTE=bsquared;324764]Just a quick note... you could also do yafu "nfs(11471^37-1)" and it will remove the algebraic factors automatically (in your case just 11470). the snfs(form, cofactor) function is mostly for when there are known non-algebraic factors such as those found by ecm.[/QUOTE]
Just a question, yafu runs the LA phase, correct? |
| All times are UTC. The time now is 22:26. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.