Prime-Built Functions and Integer Hulls: Zeros, Counting Laws, Capture Mechanisms, and the Parity of the Prime Count

This paper unifies eight studies on functions built from the primes and on exact lattice-point counts for the primes. The analytic part is organised around the exponential atom uₙ(z)=log n· n⁻ᶻ. Its sum over integers gives F(z)=∑n≥2(n1/nᶻ-1), its sum over primes gives FP(z)=∑ₚ(p^p⁻ᶻ-1), and its product gives G(z)=∏ₚ12(1+p^p⁻ᶻ). All three are nonlinear deformations of ζ'-type objects. Three mechanisms recur: The Bohr torus. Every sharp abscissa computed is attained at one extremal character. In particular, we prove that the supremum of the real parts of the zeros of ζ' is σ₁=2.81301402025…. Winding on the critical line. It yields an exact crossing identity for F that reformulates the Riemann Hypothesis. It also shows that the zeros of FP follow those of ζ' (under RH), with an integer excess equal to 12 up to height 1000. Local models. For f=A+χ A(1-z), which has the functional equation of ζ but no Euler product, a two-parameter capture law decides which zeros leave the critical line. With no fitted parameters it classifies 146 of 147 cases, and it extends to unrelated series and to the Davenport–Heilbronn function. Two companions isolate what depends on arithmetic. The first is a Dirichlet series with harmonic exponents, with a Papkovich–Fadle chain of zeros and Euler’s constant in its zero count. The second is the power series ∑ zᵖ, whose truncations have a conjectured Mahler measure ~ e-γ/2√π(N)/2. The algorithmic part computes π(x) 2 deterministically in O(x5/12log² x) operations through a Möbius-free congruence. It also builds an exact three-dimensional integer-hull walk. Every statement carries a status label (proved, conditional, numerical or conjecture), and open problems are listed with their consequences.