\section{The pointwise count} Let \(\A=\{a\in\Z_{>0}:p\mid a\Rightarrow p\equiv1\bmod3\}\), where \(p\) always denotes a prime. Write \(3\!\cdot\!\A=\{3a:a\in\A\}\). We count ordered pairs \((s_1,s_2)\) of positive integers summing to \(n\), with \[ (s_1,s_2)\in \begin{cases} \A\times\A,&n\equiv2\pmod6,\\ \A\times(3\!\cdot\!\A)\text{ or }(3\!\cdot\!\A)\times\A, &n\equiv4\pmod6. \end{cases} \] In the second line one orientation is prescribed in advance. For \(00\) without restricting the summand sizes. Howe, Huffman, Kohlmeyer and Kruer \cite[Theorem~1.1]{Euler} prove existence for every positive target \(2\bmod4\), using quaternionic norm counts and a sieve on the representing vectors. The prime sets used here and in the Gaussian problem are incomparable, as \(7\) and \(17\) show. We use the same norm-counting principle for the Eisenstein ring. The new estimates needed here are angular localization with prescribed residue conditions, the densities when a sieving prime divides the target, and a lower bound that counts distinct value pairs at the integer-sieve scale. Ramar\'e and Viswanadham \cite[Introduction and Theorem~1.6]{RV} discuss the split-prime Eisenstein set in their sieve framework and prove a ternary additive theorem for primitive Gaussian values. The Frobenian correlation theorem of Loughran and Matthiesen \cite[Theorem~1.9]{LM} requires pairwise independent linear parts. Fixing the total gives the one-variable forms \(t,n-t\), with proportional linear parts. In the mixed case, restricting to the necessary residue class and dividing one form by \(3\) leaves the same dependence. Freeing the total gives a two-variable sum, which averages over the slices that our theorem estimates individually. Iwaniec's half-dimensional sieve \cite[Theorem~1]{IwaniecHalf} uses a half-dimensional local product and a remainder from counts in residue classes. Sieving both summands directly excludes two residues per inert prime away from the target divisors. As the inert primes have density \(1/2\), this gives sieve dimension one. A half-dimensional sieve on one summand with the other already restricted would require progression estimates for that restricted sequence in translated windows, uniformly in the target. Greaves \cite[main theorem]{Greaves} obtains a bound of order at least \(n/(\log n)^{5/2}\) for prime pairs whose complementary value is a sum of two squares. The cutoff \(p,q\le\sqrt n/2\) in that Gaussian input leaves the split of the complementary sum of two squares free. Here the angular Hecke estimate supplies the window-dependent distribution, and the split-factor sum reaches the scale of distinct values. \begin{corollary}\label{cor:ranges} The count in every fixed interval of positive length for \(s_1/n\) inside \((0,1)\) is of order \(nJ(n)/\log n\). In particular the unrestricted count has this order. At any fixed interior share, windows of width \(n^\theta\) have count of order \(n^\theta J(n)/\log n\) for \(2/3<\theta<1\). For \(1/2<\theta<1\) and fixed \(0\le a