No, not directly at least. Encryption relies on the difficult nature of factorisation, not knowing if a specific number can’t be factorised (is prime).
Possibly some of the internal components of this could be extended to help factorisation problems (but also possibly not)
Most modern encryption algorithms moved away from primes because of other weaknesses like quantum factorisation anyway
Could primes being predictable result in a weakening of the design of encryption because it would be easier to calculate large primes?
No, not directly at least. Encryption relies on the difficult nature of factorisation, not knowing if a specific number can’t be factorised (is prime).