program P-1 for K*2^n-1

jocelynl · 2003-12-16, 21:22

Hi All,

as promised here is a sample of P-1 for K*2^n-1
It is manual, but I'm working to get it to work with the NewPGen file. Have a try at it and let me know what you think.
I didn't make from gmp. Just to many includes in those files.
the source is from Andi34 and I as we were both coding factoring algorythm ecm, fermat, p-1, trial, etc...

p.s. it won't stop until it's done (unless you kill it)
Joss L15.

2003-12-17, 00:44

Now we are talkin!

Trying it now

SlashDude · 2003-12-17, 02:44

I'm running it on 210885*2^999997-1

fyi-
It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.

jocelynl · 2003-12-17, 03:21

It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.

Mark something must be wrong

try
210885 999997 10000

is should try p-1 up to prm(10000) wich is = 104729
is will test gcd every 827 p-1

I'll try 999996.
I'm at current=10 in 20 sec.

Joss.

jocelynl · 2003-12-17, 16:09

V1.1 is out K.2^n-1
It will do gcd more often.
It has nextk and nextn to quickly do the next one.

ET_ · 2003-12-17, 16:37

would you mind adding a short textfile to help us using it the right way?

Luigi

jocelynl · 2003-12-17, 17:17

A Small help file has been added.
Joss

ET_ · 2003-12-17, 17:29

GREAT!

Thank you!

Luigi

Kosmaj · 2003-12-18, 05:51

Thank you for a nice software! I tried it and it's working. It's a bit slow but my cpu is slow too, an old 800MHz P-3 (all fast cpu's are busy searching for primes

)

I opened an old sieving output file and gave him
to factor 1003166*2^1003166-1 with a known factor 2633. Instead he found 38,512,891!

By the way, in our case with trial factoring done to 4*10^12 what's your recommendation for P? And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...

jocelynl · 2003-12-18, 15:52

Quote:

And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...

Yes I'm working on the batch version to do the P-1

The sieve like NewPGen uses assembly and is very fast
My C++ is not fast enough.

I'm also working on the source file of LLR to get the P-1 to work directly from LLR.EXE It would be much faster than my P-1.
We would be able to use the second stage of P-1.

Joss

2003-12-28, 12:04

Hey Joss,

Would you mind, if p-1 is used for a General Mersenne project?

2003-12-16, 21:22	#1
jocelynl Sep 2002 2×131 Posts	*program P-1 for K2^n-1** Hi All, as promised here is a sample of P-1 for K2^n-1 It is manual, but I'm working to get it to work with the NewPGen file. Have a try at it and let me know what you think. I didn't make from gmp. Just to many includes in those files. the source is from Andi34 and I as we were both coding factoring algorythm ecm, fermat, p-1, trial, etc... p.s. it won't stop until it's done (unless you kill it) Joss L15. Last fiddled with by jocelynl on 2003-12-16 at 21:24*

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
GPU LLR program	jasong	GPU Computing	19	2011-08-23 03:32
So you think you can program	rogue	Lounge	5	2009-10-02 15:02
Program	Primeinator	Information & Answers	5	2009-07-16 21:42
Program for GPU	tribal	Information & Answers	5	2009-03-19 20:54
which program?	drakkar67	Prime Sierpinski Project	14	2005-11-29 06:25

2003-12-17, 00:44	#2
Val 3²·311 Posts	Now we are talkin! Trying it now

2003-12-17, 02:44	#3
SlashDude Aug 2002 Minneapolis, MN 344₈ Posts	I'm running it on 210885*2^999997-1 fyi- It's "stuck" at Current = 6 for the last 3 hours. I'll let it run overnight.

2003-12-17, 03:21	#4
jocelynl Sep 2002 2×131 Posts	It's "stuck" at Current = 6 for the last 3 hours. I'll let it run overnight. Mark something must be wrong try 210885 999997 10000 is should try p-1 up to prm(10000) wich is = 104729 is will test gcd every 827 p-1 I'll try 999996. I'm at current=10 in 20 sec. Joss.

2003-12-17, 16:09	#5
jocelynl Sep 2002 106₁₆ Posts	V1.1 is out K.2^n-1 It will do gcd more often. It has nextk and nextn to quickly do the next one.

2003-12-17, 16:37	#6
ET_ Banned "Luigi" Aug 2002 Team Italia 3×1,619 Posts	would you mind adding a short textfile to help us using it the right way? Luigi

2003-12-17, 17:17	#7
jocelynl Sep 2002 406₈ Posts	A Small help file has been added. Joss

2003-12-17, 17:29	#8
ET_ Banned "Luigi" Aug 2002 Team Italia 4857₁₀ Posts	GREAT! Thank you! Luigi

2003-12-18, 05:51	#9
Kosmaj Nov 2003 2·1,811 Posts	Thank you for a nice software! I tried it and it's working. It's a bit slow but my cpu is slow too, an old 800MHz P-3 (all fast cpu's are busy searching for primes ) I opened an old sieving output file and gave him to factor 10031662^1003166-1 with a known factor 2633. Instead he found 38,512,891! By the way, in our case with trial factoring done to 410^12 what's your recommendation for P? And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...

2003-12-28, 12:04	#11
Val 3·19·157 Posts	Hey Joss, Would you mind, if p-1 is used for a General Mersenne project?