mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2022-10-20, 18:00   #1
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

22·5·31 Posts
Default llrCUDA Version 3.8.7 is released!

Hi All,

I uploaded to-day the new version 3.8.7 of llrCUDA on my personal site jpenne.free.fr

What is new in this version :

I added two new ABC formats, principally to help PRP searchers.
- k*b^n+c format with k, b, c fixed, for example : ABC 22*17^n+13
- (k*b^n+c)/d format with k, b, c, d fixed, for example : ABC (16^n+619)/5
- In Proth or LLR tests, even values of k yield a false result...
These bugs are now fixed.
May 2022 : The range of available FFT lengthes has been extended using
SSE2 Woltman tables. This allowed this version to test successfully
M82589933 in less than 8 days!

Here are some of previous updates :

- The maximum value of bits per input double word that was defaulted to 35.0 is now defaulted to 37.0.
moreover, it may be changed by user, using -oMAXBPD=xx.x option.
It can be useful to decrease this value if too much round off errors occur...

- In previous Version 3.8.4, one call to free() function was missing in Gerbicz
error checking code ; this caused an important memory leak...
This issue is now fixed here!
No much new feature, but some improvements related to reliability and speed.

Please, let me know if you have any problem to run the binary on Linux and/or to build it on your system.

I wish you many successes in prime hunting!
Best Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2022-10-21, 12:48   #2
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

22·5·31 Posts
Default Fixing a Round off errors cause.

Hi,

While testing k*2^n+c or (k*2^n+c)/d numbers using this new version, I saw many Round off errors...
This was due to an under estimate of the number of bits per words in the double words array form of the number, when abs(c) > 1
This drawback is fixed to-day.

Best Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2022-10-22, 13:48   #3
pepi37
 
pepi37's Avatar
 
Dec 2011
After 1.58M nines:)

2·33·31 Posts
Default

I download to try new llrCUDA on Linux since it can be used for PRP searching. Linux box has installed latest nvidia drivers ,and all GPU works , running GFN search.


root@OMICRON:~/LLR# ./llrCUDA
./llrCUDA: error while loading shared libraries: libcufft.so.8.0: cannot open shared object file: No such file or directory


So can you build static app? I try to compile it, but got many errors since first line in make file point to non exit directory in my installation.
pepi37 is offline   Reply With Quote
Old 2022-10-23, 12:10   #4
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

11548 Posts
Default Linking with current directory

Quote:
Originally Posted by pepi37 View Post
I download to try new llrCUDA on Linux since it can be used for PRP searching. Linux box has installed latest nvidia drivers ,and all GPU works , running GFN search.


root@OMICRON:~/LLR# ./llrCUDA
./llrCUDA: error while loading shared libraries: libcufft.so.8.0: cannot open shared object file: No such file or directory


So can you build static app? I try to compile it, but got many errors since first line in make file point to non exit directory in my installation.
I did not succeed to build a static application, but I could cheat by uploading a llrCUDA binary with libcudart and libcufft libraries included in your current directory. It results in a voluminous compressed file (117 MO), but I hope it will resolve your problem...
Would you inform me about that.

Best Regards,

Jean
Jean Penné is offline   Reply With Quote
Old 2022-10-23, 14:22   #5
pepi37
 
pepi37's Avatar
 
Dec 2011
After 1.58M nines:)

2×33×31 Posts
Default

Quote:
Originally Posted by Jean Penné View Post
I did not succeed to build a static application, but I could cheat by uploading a llrCUDA binary with libcudart and libcufft libraries included in your current directory. It results in a voluminous compressed file (117 MO), but I hope it will resolve your problem...
Would you inform me about that.

Best Regards,

Jean
Waiting for link,and of course I will inform you of result.
Best regards
pepi37 is offline   Reply With Quote
Old 2022-10-25, 17:03   #6
pepi37
 
pepi37's Avatar
 
Dec 2011
After 1.58M nines:)

68A16 Posts
Default

I download your copy with so files, but since my system is on latest drivers , cuda 8 was not working. Then I need to download latest cuda toolkit (11.8) recompile all, and got few warnings when I compile llrcuda , but at the end it looks working



Code:
root@THETA:~/llrcuda# ./llrCUDA -d -q"7567567*2^67679-1"
Starting Fermat PRP test of 7567567*2^67679-1
Using complex zero-padded rational base DWT, FFT length = 8704, a = 3
7567567*2^67679-1 is not prime.  RES64: 2CC12983FF83092B.  Time : 52.935 sec.


You need to add option for devices ( since I can only use one device on multidevice box) ( switch like -d1 , -d2...)
It looks too slow on any other base then 2.
Maybe it is slower because those errors while compiling....but I remember in past that llrCUDA was never fast as cpu llr
pepi37 is offline   Reply With Quote
Old 2022-10-27, 10:35   #7
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

11548 Posts
Default Static binary for llrCUDA 3.8.7

Hi,

I succeeded to-day to build a static binary for llrCUDA 3.8.7 by updating correctly the Makefile.
So, I uploaded the new binaries and the source directory accordingly.

Best Regards,

Jean
Jean Penné is offline   Reply With Quote
Old 2022-10-28, 04:10   #8
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

72018 Posts
Default

Quote:
Originally Posted by pepi37 View Post

Code:
root@THETA:~/llrcuda# ./llrCUDA -d -q"7567567*2^67679-1"
Starting Fermat PRP test of 7567567*2^67679-1
Using complex zero-padded rational base DWT, FFT length = 8704, a = 3
7567567*2^67679-1 is not prime.  RES64: 2CC12983FF83092B.  Time : 52.935 sec.
7567567*2^67679-1 is divisible by 5, trial factoring (or sieving progress) can show that it is composite immediately, this number need not to use LLR or PFGW
sweety439 is offline   Reply With Quote
Old 2022-10-28, 11:45   #9
pepi37
 
pepi37's Avatar
 
Dec 2011
After 1.58M nines:)

110100010102 Posts
Default

Quote:
Originally Posted by sweety439 View Post
7567567*2^67679-1 is divisible by 5, trial factoring (or sieving progress) can show that it is composite immediately, this number need not to use LLR or PFGW
I dont care is that candidate have factor or not, I just write it to test speed.
pepi37 is offline   Reply With Quote
Old 2022-10-28, 13:42   #10
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

47×79 Posts
Default

Quote:
Originally Posted by pepi37 View Post
I dont care is that candidate have factor or not, I just write it to test speed.
For numbers with small prime factors (i.e. prime factors < 10^4), LLR and PFGW will return composite for a very short time (<0.01 second)
sweety439 is offline   Reply With Quote
Old 2022-10-29, 06:39   #11
pepi37
 
pepi37's Avatar
 
Dec 2011
After 1.58M nines:)

2·33·31 Posts
Default

Quote:
Originally Posted by sweety439 View Post
For numbers with small prime factors (i.e. prime factors < 10^4), LLR and PFGW will return composite for a very short time (<0.01 second)
Once and again, I need to see time that llrCUDA need, to compare with llr...
pepi37 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
llrCUDA Version 3.8.6 is released! Jean Penné Software 0 2022-05-25 13:28
llrCUDA Version 3.8.5 is released! Jean Penné Software 13 2022-05-09 05:19
llrCUDA version 3.8.4 is released! Jean Penné Software 0 2021-05-02 14:39
llrCUDA version 3.8.3 is released! Jean Penné Software 13 2021-03-19 20:29
LLR Version 3.8.9 released Jean Penné Software 37 2013-10-31 08:45

All times are UTC. The time now is 12:59.


Sun Jun 4 12:59:32 UTC 2023 up 290 days, 10:28, 1 user, load averages: 0.79, 0.77, 0.82

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔