FastECPP over MPI - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2024

FastECPP over MPI

Andreas Enge

Abstract

The FastECPP algorithm is currently the fastest approach to prove the primality of general numbers, and has the additional benefit of creating certificates that can be checked independently and with a lower complexity. This article shows how by parallelising over a linear number of cores, its quartic time complexity becomes a cubic wallclock time complexity; and it presents the algorithmic choices of the FastECPP implementation in the author's \cm\ software \\ \centerline {\url {https://www.multiprecision.org/cm/}} which has been written with massive parallelisation over MPI in mind, and which has been used to establish a new primality record for the ``repunit'' $(10^{86453} - 1) / 9$.
Fichier principal
Vignette du fichier
ecppmpi.pdf (175.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY SA - Attribution - ShareAlike

Dates and versions

hal-04522492 , version 1 (08-04-2024)
hal-04522492 , version 2 (01-05-2024)

Licence

Attribution - ShareAlike

Identifiers

  • HAL Id : hal-04522492 , version 2

Cite

Andreas Enge. FastECPP over MPI. 2024. ⟨hal-04522492v2⟩
24 View
8 Download

Share

Gmail Facebook X LinkedIn More