A provable prime is an integer that is either constructed to be prime or is calculated to be prime using a primality-proving algorithm.