So you can write a program of 8+C bytes that can generate ~42 primes in linear time. Is there a theoretical minimum program size that can generate n primes in O

So you can write a program of 8+C bytes that can generate ~42 primes in linear time. Is there a theoretical minimum program size that can generate n primes in O(n) time?