The Prime Digit Distribution Conjecture: A Formal Proof of Average Digit Equidistribution in the Prime Numbers

Let $S_n=\{p\in \mathbb{P}:p<{10}^n\}$, $N_n$ denote the total number of decimal digits occurring in the primes of $S_n$, $C_n(d)$ be the number of occurrences of a digit $d\in \{0,\dots ,9\}$ among those digits, and $P_n(d)$ be the probability of occurrence of a digit, $d$ among those digits. We prove that $$P_n(d)=\frac{C_n(d)}{N_n}=\frac{1}{10}+O\text{\hspace{0.17em}⁣}\left(\frac{\log n}{n}\right),n\to \mathrm{\infty },$$ uniformly for every decimal digit $d$. The argument is entirely unconditional and combines the Prime Number Theorem, the Erdős–Turán discrepancy inequality, and classical Vaughan–Vinogradov estimates for exponential sums over primes. The principal step establishes quantitative equidistribution for interior digit positions, while the logarithmically many exceptional positions near the ends of the decimal expansion are shown to have asymptotically negligible influence after averaging over all digit positions and prime lengths. Consequently, the decimal digits occurring in primes, when pooled over all positions and all primes below ${10}^n$, become asymptotically equidistributed. We also clarify the precise scope of the theorem by distinguishing this averaged equidistribution result from the substantially stronger and presently unresolved questions concerning pointwise digit equidistribution, normality, and higher-order digit correlations in the sequence of prime numbers.