mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory > PARI/GP

Reply
 
Thread Tools
Old 2022-01-04, 09:40   #1
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

1111000112 Posts
Default primecert() vs Primo

My main issue with Primo is that is requires a GUI. I recently found out that PARI offers an ECPP test via primecert(). How fast is it compared to Primo? In another thread it was mentioned that a 30k digits number was proven prime with PARI, so I assume it can be very fast - was it done without any modifications to primcert()?

And(1) since they used MPI it seems to be possible to run it multithreaded. I know there are options for parallel programming in PARI, but I don't know how to use them for this specific problem.


And(2), I wanted to test it with a random 300 digits PRP from factordb but the certificate isn't accepted: "No input number found in file." I attached the cert, it seems to contain the input number.
Attached Files
File Type: txt cert.txt (16.6 KB, 21 views)
bur is offline   Reply With Quote
Old 2022-01-04, 09:49   #2
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

33·31 Posts
Default

It occurred to me that my Primo certificates have lines of the format [capital letter]=[-]$[hex digits], while your certificate has [capital letter]=[-]0x[hex digits]. I changed the format and tried your file - "number already proven", which seems to be a different error than you have got. Maybe you can try this with another number and report back?

Last fiddled with by kruoli on 2022-01-04 at 10:31 Reason: Additions. Grammar.
kruoli is online now   Reply With Quote
Old 2022-01-04, 10:29   #3
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

3×7×23 Posts
Default

Ah, thanks. Number already proven just means that in the meantime the number was proven prime. I tested your suggestion with another number and it works.
bur is offline   Reply With Quote
Old 2022-01-05, 08:48   #4
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

3×7×23 Posts
Default

I found this presentation by Jared Asuncion. According to them, the speed they achieved is even higher than that of Primo. At least of the ecpp() they present and I am not sure if that is the same algorithm PARI is using for primecert(), but I assume it is.

The question remains how to make this run multithreaded and also preferrably with checkpoints.
bur is offline   Reply With Quote
Old 2022-01-05, 09:43   #5
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

15058 Posts
Default

Have you tried contacting them?

Regarding MPI, there is a limited amount of functions that can make use of MPI, according to the manual. The Cert functions do not belong to them, unfortunately. So there is surely some kind of manual intervention involved.
kruoli is online now   Reply With Quote
Old 2022-01-05, 12:42   #6
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

3·7·23 Posts
Default

Yes, I am in contact with them, it should be possible to have it run multithreaded.

He also wrote that the certificate can be generated in steps. I am not sure if these steps are independent, which would allow distributed computing, but let's see. For now I'd be happy to finally be able to use ECPP via terminal.
bur is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Primo ET_ FactorDB 169 2022-01-20 19:41
Primo Browser? yeneb Information & Answers 4 2020-07-15 20:01
Primo Verifier... WraithX Software 15 2013-09-10 07:24
PRIMO 3.0.7 Cybertronic Five or Bust - The Dual Sierpinski Problem 17 2009-08-13 20:42
primo question fivemack Math 35 2009-04-28 15:03

All times are UTC. The time now is 00:22.


Fri Jan 21 00:22:25 UTC 2022 up 181 days, 18:51, 0 users, load averages: 1.59, 1.66, 1.54

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

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