Quote:
Originally Posted by Prime95
What system is this? A PRP test using 32-bit Windows Prime95 on a Core 2 works using a 4K FFT.
|
Hi,
I can now add some precisions about this problem :
-It occurs each time I am running a Lucas PRP test on a k*b^n+c number with c != 1 AND a full complex FFT is chosen.
- If I force a larger FFT, the test works as soon as Zero padded is chosen.
- It works also if I force generic reduction.
- No matter if the base b is two or not...
- Surprisingly, the simple strong Fermat PRP test (which uses only gwsquare) works always!
For the Lucas test, I get a segmentation fault on these two systems :
On Windows 2000 and VC 6.0 :
CPU Information:
Intel(R) Pentium(R) 4 CPU 2.53GHz
CPU speed: 2533.16 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 8 KB
L2 cache size: 512 KB
On Linux with 32 bit gcc and gwnum library :
CPU Information:
AMD Athlon(tm) 64 Processor 3700+
CPU speed: 2199.85 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 1024 KB
I hope it will help...
Regards,
Jean