Trial factoring

Citrix · 2004-02-24, 03:13

I am looking for the trial factoring code used in Prime95. Could some one point me to the file that contains the code for this, in the Prime95 source release.

Thanks,
Citrix

nfortino · 2004-02-24, 03:34

Quote:

Originally Posted by Citrix

I am looking for the trial factoring code used in Prime95. Could some one point me to the file that contains the code for this, in the Prime95 source release.

Thanks,
Citrix

As far as I can tell, for Prime95 in the version 23 source, factor64.asm, not that I can read any line that doesn't begin with a colon.

Citrix · 2004-02-24, 05:24

I know C/C++ and other high level languages but unfortunately not assembly. Anyway, is there some other way I could use trial factoring code that is as fast as Prime95.

If anyone can provide me with some code that would be great.
I am sieving a series similar to mersenne,in the form of the factors.

Citrix

ET_ · 2004-02-24, 12:02

Quote:

Originally Posted by Citrix

is there some other way I could use trial factoring code that is as fast as Prime95?

Not that I am aware of...

Even using GMP library with -O3 optimizations, the resulting code would be less than 45% as efficient.

Luigi

PrimeCruncher · 2004-02-24, 19:49

Quote:

Originally Posted by Citrix

I know C/C++ and other high level languages but unfortunately not assembly. Anyway, is there some other way I could use trial factoring code that is as fast as Prime95.

I believe there is a way in C/C++ to do in-line assembly, though I don't do any work in either language.

rogue · 2004-02-25, 01:21

That depends entirely upon the compiler. Visual C++ does support inline assembly. gcc is an entirely different matter.

ET_ · 2004-02-25, 08:35

Quote:

Originally Posted by rogue

That depends entirely upon the compiler. Visual C++ does support inline assembly. gcc is an entirely different matter.

Also gcc does, but it has AT&T Assembly style, not INTEL.

Luigi

cheesehead · 2004-02-26, 03:24

Quote:

Originally Posted by Citrix

I know C/C++ and other high level languages but unfortunately not assembly. Anyway, is there some other way I could use trial factoring code that is as fast as Prime95.

The reason Prime95's trial factoring code is so fast is that it takes advantage of certain features and properties of Intel CPU instruction operations that are not able to be accessed by existing high-level languages. If you want code that is just as fast as Prime95's, you (or someone else) also will have to use assembly language (or else invent a new high-level language that allows doing what the assembly language allows doing). :-)

2004-02-24, 03:13	#1
Citrix Jun 2003 3·5·107 Posts	Trial factoring I am looking for the trial factoring code used in Prime95. Could some one point me to the file that contains the code for this, in the Prime95 source release. Thanks, Citrix

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
What is Trial Factoring?	Unregistered	Information & Answers	5	2012-08-02 03:47
How much Trial Factoring to do?	odin	Software	4	2010-08-08 20:23
How far to do trial factoring	S485122	PrimeNet	1	2007-09-06 00:52
How to only do Trial Factoring?	michael	Software	23	2004-01-06 08:54
About trial factoring	gbvalor	Math	4	2003-05-22 02:04

2004-02-24, 05:24	#3
Citrix Jun 2003 3·5·107 Posts	I know C/C++ and other high level languages but unfortunately not assembly. Anyway, is there some other way I could use trial factoring code that is as fast as Prime95. If anyone can provide me with some code that would be great. I am sieving a series similar to mersenne,in the form of the factors. Citrix

2004-02-25, 01:21	#6
rogue "Mark" Apr 2003 Between here and the 5·7·199 Posts	That depends entirely upon the compiler. Visual C++ does support inline assembly. gcc is an entirely different matter.