<s> """<STR_LIT>""" <EOL> def calculate_mersenne_primes ( ) : <EOL> """<STR_LIT>""" <EOL> mersenne_prime_exponents = [ <EOL> <NUM_LIT:2> , <NUM_LIT:3> , <NUM_LIT:5> , <NUM_LIT:7> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> , <NUM_LIT> <EOL> ] <EOL> primes = [ ] <EOL> for exp in mersenne_prime_exponents : <EOL> prime = <NUM_LIT:1> <EOL> for i in range ( exp ) : <EOL> prime *= <NUM_LIT:2> <EOL> prime -= <NUM_LIT:1> <EOL> primes . append ( prime ) <EOL> return primes <EOL> SMALLEST_257BIT_PRIME = ( <NUM_LIT:2> ** <NUM_LIT> + <NUM_LIT> ) <EOL> SMALLEST_321BIT_PRIME = ( <NUM_LIT:2> ** <NUM_LIT> + <NUM_LIT> ) <EOL> SMALLEST_385BIT_PRIME = ( <NUM_LIT:2> ** <NUM_LIT> + <NUM_LIT> ) <EOL> STANDARD_PRIMES = calculate_mersenne_primes ( ) + [ <EOL> SMALLEST_257BIT_PRIME , SMALLEST_321BIT_PRIME , SMALLEST_385BIT_PRIME <EOL> ] <EOL> STANDARD_PRIMES . sort ( ) <EOL> def get_large_enough_prime ( batch ) : <EOL> """<STR_LIT>""" <EOL> primes = STANDARD_PRIMES <EOL> for prime in primes : <EOL> numbers_greater_than_prime = [ i for i in batch if i > prime ] <EOL> if len ( numbers_greater_than_prime ) == <NUM_LIT:0> : <EOL> return prime <EOL> return None </s>
