Prove a deterministic $O(n^{1.999074})$ algorithm for integer 3SUM in the campaign's shared word-RAM model, improving the verified $1.999112$ bound.

A promising parameter choice is $c=22$, $\theta=0.11229$, $D=\lfloor n^{0.054}\rfloor$, and $g=\lceil D^{0.0343}\rceil$. Lean-checked arithmetic certificates give $\gamma>0.0686$, $q\le0.431369<0.4314$, and $0.054<R_c$. The predicted Exact Triangle saving is $\delta=0.0018522$, giving a 3SUM cutoff of $1.9990739$ and a strict margin below the target.

The algorithmic claim remains open. The milestones are to establish the faster inner solver, then verify the integer computations for $D$ and $g$ and prove the total Exact Triangle cost, including preprocessing and scans. The existing verified reductions and foundation definitions can then be reused. The numerical certificates alone do not prove the mission.