mersenneforum.org GMP-ECM Request
 Register FAQ Search Today's Posts Mark Forums Read

 2009-11-23, 12:53 #1 rogue     "Mark" Apr 2003 Between here and the 17×353 Posts GMP-ECM Request I would like to see a feature to disable the PRP testing of the cofactor. This would be used on projects such as the primorial and factorial searches on PrimeGrid. All we want to do is "knock out" the original number from PRP testing if it is composite thus finding a factor is all that we need to do. PRP testing the cofactor adds no value to the project and can actually take longer than that PRP test for the original number (presuming GMP's PRP test is used).
 2009-11-23, 13:23 #2 akruppa     "Nancy" Aug 2002 Alexandria 25×7×11 Posts This can currently be done by configuring with --enable-shellcmd, and specifying a program that always returns true (exit code 0) to the -prpcmd, for example: ecm -prpcmd /bin/true [...] That way GMP-ECM thinks the cofactor is prime and stops trying to factor it. Code: echo "2^(2^9)+1" | ./ecm -prpcmd /bin/true 1e3 GMP-ECM 6.3 [configured with GMP 4.3.0 and --enable-asm-redc] [ECM] Input number is 2^(2^9)+1 (155 digits) Using B1=1000, B2=51606, polynomial x^1, sigma=3861836176 Step 1 took 5ms Step 2 took 6ms ********** Factor found in step 2: 2424833 Found probable prime factor of 7 digits: 2424833 Probable prime cofactor (2^(2^9)+1)/2424833 has 148 digits Alex
2009-11-23, 14:02   #3
rogue

"Mark"
Apr 2003
Between here and the

17×353 Posts

Quote:
 Originally Posted by akruppa This can currently be done by configuring with --enable-shellcmd, and specifying a program that always returns true (exit code 0) to the -prpcmd, for example: ecm -prpcmd /bin/true [...] That way GMP-ECM thinks the cofactor is prime and stops trying to factor it. Code: echo "2^(2^9)+1" | ./ecm -prpcmd /bin/true 1e3 GMP-ECM 6.3 [configured with GMP 4.3.0 and --enable-asm-redc] [ECM] Input number is 2^(2^9)+1 (155 digits) Using B1=1000, B2=51606, polynomial x^1, sigma=3861836176 Step 1 took 5ms Step 2 took 6ms ********** Factor found in step 2: 2424833 Found probable prime factor of 7 digits: 2424833 Probable prime cofactor (2^(2^9)+1)/2424833 has 148 digits Alex
I saw that feature, but I was hoping for something simpler that wouldn't require me to rebuild GMP-ECM. It was painful enough to build 64-bit GMP-ECM with gwnum, but that is a different topic.

2009-11-23, 14:37   #4
Jeff Gilchrist

Jun 2003

49116 Posts

Quote:
 Originally Posted by rogue I saw that feature, but I was hoping for something simpler that wouldn't require me to rebuild GMP-ECM. It was painful enough to build 64-bit GMP-ECM with gwnum, but that is a different topic.
If they added a feature to the code to do that, you would still have to rebuild GMP-ECM so either way you have another rebuild coming. The question is do you want to be able to get that functionality now or possibly sometime in the future?

2009-11-23, 15:07   #5
rogue

"Mark"
Apr 2003
Between here and the

10111011100012 Posts

Quote:
 Originally Posted by Jeff Gilchrist If they added a feature to the code to do that, you would still have to rebuild GMP-ECM so either way you have another rebuild coming. The question is do you want to be able to get that functionality now or possibly sometime in the future?
I can wait for it.

 Similar Threads Thread Thread Starter Forum Replies Last Post pinhodecarlos Lounge 3 2017-10-26 18:58 Dubslow YAFU 4 2012-03-31 03:07 Xyzzy Lounge 23 2011-03-08 17:50 10metreh Aliquot Sequences 8 2009-10-07 18:13 PageFault Marin's Mersenne-aries 11 2003-11-30 02:47

All times are UTC. The time now is 16:16.

Tue Nov 24 16:16:03 UTC 2020 up 75 days, 13:27, 4 users, load averages: 1.94, 1.85, 1.77