Early Beta of version 24.11 - Page 4

ET_ · 2005-04-12, 11:57

George, I have a dumb question about v24.11

Looking at the factoring benchmark, I noticed that the best time results are printed in ms.

Assuming that there are about 1,029,407,319 k from 57 to 58 bits (exponent 35000011), and that about 95% of those k are sieved out, we have about 51,470,366 k to check.

Prime95 runs the factoring work between 57 and 58 bits in about 15,450 ms and 58-59 in 31,500 ms (time of Prime95); the benchmark shows a timing of about 7 ms for bit depth comprised between 58 and 61 bits, so I assume the same for 57 bits.

The "one iteration time" in factoring should be 15,450/51,470,366 = 30*10^-4 ms; 7 ms are worth about 23,320 iterations.

As a demonstration, if we divide k by 23,320 and multiply the result by 7, we again have 15,450 ms

May I ask you why did you choose 23,320 iterations for the benchmark?

Luigi

Prime95 · 2005-04-12, 13:36

You lost me.

The 32-bit factoring assembly code processes a 16KB sieve. This is "one iteration" in the benchmark. When doing trial factoring you control how often prime95 writes to the screen in Options / Preferences.

The 64-bit factoring assembly code processes a 48KB sieve.
This is "one iteration". The benchmarking code divides this time by 3 so you can properly compare it to 32-bit machines.

Frodo42 · 2005-04-12, 22:13

I seeem to be having a problem with sprime when I try to factor a number that requires FFT length of 1024K

I get the following message:

Code:

Starting P-1 factoring with B1=40000, B2=420000
Chance of finding a factor is an estimated 0.92%
P-1 on 55459*2^9011278+1 with B1=40000, B2=420000
Using FFT length 1024K
SUMOUT error occurred.

There doesn't seem to be any problems P-1 factoring numbers with lower FFT length (even 1024 zero-padded)
I am testing this on another machine just now ... I haven't had any hardware problems with this computer so far.

Anyhow just thought I would report this ... it may just be a hardware error on my side.

ET_ · 2005-04-12, 22:26

Quote:

Originally Posted by Prime95

You lost me.

The 32-bit factoring assembly code processes a 16KB sieve. This is "one iteration" in the benchmark. When doing trial factoring you control how often prime95 writes to the screen in Options / Preferences.

The 64-bit factoring assembly code processes a 48KB sieve.
This is "one iteration". The benchmarking code divides this time by 3 so you can properly compare it to 32-bit machines.

I'm lost too

I'd better look into Prime95 source code before asking dumb questions.
Your answer helped, thank you.

Luigi

Frodo42 · 2005-04-12, 22:40

Quote:

Originally Posted by Frodo42

I am testing this on another machine just now ...

It reproduced the error message, so I guess it's not a hardware failure.

Prime95 · 2005-04-13, 00:43

Quote:

Originally Posted by Frodo42

It reproduced the error message, so I guess it's not a hardware failure.

Is this version 24.11 that is doing this? When I try that number on a P4 I get a zero-padded 1024K FFT and no errors.

Frodo42 · 2005-04-13, 04:36

Quote:

Originally Posted by Prime95

Is this version 24.11 that is doing this? When I try that number on a P4 I get a zero-padded 1024K FFT and no errors.

Yes it's from sprime2411.tar.gz

The line I have in worktodo.ini is:

Code:

Pfactor=55459,2,9011278,1,49,1.5

My local.ini:

Code:

OldCpuType=12
OldCpuSpeed=3017
DayMemory=768
NightMemory=768
CPUHours=24
DayStartTime=480
DayEndTime=1320
Pid=0
RollingAverage=1000
RollingStartTime=0

Frodo42 · 2005-04-13, 08:07

Quote:

Originally Posted by Prime95

Is this version 24.11 that is doing this?

No I am wrong ... it's not version 2.4.11 even though I thought it was. It was an older version.
Sorry about all this fuss

It works fine when i actually use ver. 2.4.11

The problem arose because I wrongly assumed that the static binary was called sprime, while it is actually mprime ... I had an sprime binary in the directory from an old package that contained both the sprime and mprime.

Prime95 · 2005-04-18, 23:18

I've just uploaded my third attempt at 24.11.

The only new feature is I've spent time optimizing the SSE2 macros further. P4s will see about a 1% boost and AMD64s will see about a 2.5% boost.

PhilF · 2005-04-18, 23:40

Earlier in this thread you mentioned only AMD64 machines should run this version. Is it now OK for P4 machines to run this version on exponents currently being tested by version 23.8?

Prime95 · 2005-04-19, 00:03

Quote:

Originally Posted by PhilF

Earlier in this thread you mentioned only AMD64 machines should run this version. Is it now OK for P4 machines to run this version on exponents currently being tested by version 23.8?

It is still beta software. You should be OK, but no guarantees. You must ask yourself if it is worth the small risk for the small speed gain.

2005-04-12, 11:57	#34
ET_ Banned "Luigi" Aug 2002 Team Italia 4815₁₀ Posts	Benchmark timings George, I have a dumb question about v24.11 Looking at the factoring benchmark, I noticed that the best time results are printed in ms. Assuming that there are about 1,029,407,319 k from 57 to 58 bits (exponent 35000011), and that about 95% of those k are sieved out, we have about 51,470,366 k to check. Prime95 runs the factoring work between 57 and 58 bits in about 15,450 ms and 58-59 in 31,500 ms (time of Prime95); the benchmark shows a timing of about 7 ms for bit depth comprised between 58 and 61 bits, so I assume the same for 57 bits. The "one iteration time" in factoring should be 15,450/51,470,366 = 3010^-4 ms; 7 ms are worth about 23,320 iterations. As a demonstration, if we divide k by 23,320 and multiply the result by 7, we again have 15,450 ms May I ask you why did you choose 23,320 iterations for the benchmark? Luigi Last fiddled with by ET_ on 2005-04-12 at 11:58*

2005-04-12, 22:13	#36
Frodo42 Mar 2005 Denmark 7 Posts	I seeem to be having a problem with sprime when I try to factor a number that requires FFT length of 1024K I get the following message: Code: Starting P-1 factoring with B1=40000, B2=420000 Chance of finding a factor is an estimated 0.92% P-1 on 55459*2^9011278+1 with B1=40000, B2=420000 Using FFT length 1024K SUMOUT error occurred. There doesn't seem to be any problems P-1 factoring numbers with lower FFT length (even 1024 zero-padded) I am testing this on another machine just now ... I haven't had any hardware problems with this computer so far. Anyhow just thought I would report this ... it may just be a hardware error on my side.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Prime95 beta version 28.4	Prime95	Software	20	2014-03-02 02:51
Prime95 beta version 28.3	Prime95	Software	68	2014-02-23 05:42
Prime95 version 27.1 early preview, not-even-close-to-beta release	Prime95	Software	126	2012-02-09 16:17
Beta version 24.12 available	Prime95	Software	33	2005-06-14 13:19
Beta version of PRP	Prime95	PSearch	15	2004-09-17 19:21

2005-04-12, 13:36	#35
Prime95 P90 years forever! Aug 2002 Yeehaw, FL 2×53×71 Posts	You lost me. The 32-bit factoring assembly code processes a 16KB sieve. This is "one iteration" in the benchmark. When doing trial factoring you control how often prime95 writes to the screen in Options / Preferences. The 64-bit factoring assembly code processes a 48KB sieve. This is "one iteration". The benchmarking code divides this time by 3 so you can properly compare it to 32-bit machines.

2005-04-18, 23:18	#42
Prime95 P90 years forever! Aug 2002 Yeehaw, FL 1110101100110₂ Posts	I've just uploaded my third attempt at 24.11. The only new feature is I've spent time optimizing the SSE2 macros further. P4s will see about a 1% boost and AMD64s will see about a 2.5% boost.

2005-04-18, 23:40	#43
PhilF Feb 2005 Colorado 2²×7×23 Posts	Earlier in this thread you mentioned only AMD64 machines should run this version. Is it now OK for P4 machines to run this version on exponents currently being tested by version 23.8?