Kronecker's conjecture on infinitely many prime differences

Let $\mathbb{P}$ denote the set of primes. An even number is an element of $2\mathbb{N}$. Kronecker's conjecture. Every even number can be expressed in infinitely many ways as the difference of two primes. This is a stronger form of Maillet's conjecture; the supplied text does not state that it has been resolved.