*Asked on MSE without response here.*

$\#$ of ways even $n$ can be represented by prime additions is hereafter denoted $G(n)$.

The Wiki article on the Goldbach conjecture states that

In 1975, Hugh Montgomery and Robert Charles Vaughan showed that "most" even numbers were expressible as the sum of two primes. More precisely, they showed that there exist positive constants $c$ and $C$ such that for all sufficiently large numbers N, every even number less than N is the sum of two primes, with at most $C N^{1-c}$ exceptions. In particular, the set of even integers which are not the sum of two primes has density zero.

Has the Goldbach conjecture been proved for any *specific* classes of $n$? By exhaustive search, it has been proved for $4\leq n \leq 10^{18},$ but my question is whether it has been proved for, *e.g.*, primorial multiples, where $G(n)$ generally reaches its maximum. I realise probabilistic arguments are difficult to make rigorous, but for the primorials, they are of course the most likely to have multiple additive prime partitions. Surely it is not difficult to prove for the primorials, or am I mistaken as to the sheer complexity of the task?

2more comments