We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the l065-digit (23539+1)/3, the first ordinary Titanic prime.
['François Morain']
Distributed primality proving and the primality of (2 3539 +1)/3