The Helix Operator: The Exact Integer Helix on the Coprime Substrate

The Helix Operator is the exact transfer rule generated by the substrate basis -2, 3. Its path state is neither a circle nor a direct product: the order-6 walk generator C = (0, -2) and the order-4 switch generator D = (1, 3) generate the noncyclic dicyclic group Dic₃ — twelve elements, exponent twelve, and no element of order twelve. The pure generator skeleton has eight integer addresses; quotienting those addresses by reversal gives exactly the five Hamming-shell nodes at 0, 60, 90, 120 and 180 degrees, while the four-address complement is the unit group (Z/12) * = 1, 5, 7, 11 and is produced exactly by mixed generator compositions. The angles are the orientation-blind display of an exact integer object. Two other twelves occur, and neither is the path group. The single-rail F₉ endpoint matrices generate a 24-state group with abelianization C₃; the path group has abelianization C₄; and the simultaneous word image is the full product 24 x 12 = 288. Terminal monodromy therefore cannot recover path charge, while the combined abelian readout is C₃ x C₄ = C₁2. Separately, the paired-rail F₉ scattering group has genuine order-12 elements. The three objects are a noncyclic group of size twelve, order-12 scattering elements, and a cyclic C₁2 quotient. Part I closes the near field of the Gaussian Fourier nullity z₉ = dim ker (S + iA) over F₉ on the coprime substrate, deriving the seam ladder, the four-beat standing waves, the pure-imaginary middle theorem, the vacuum ladder, the primality-free gauge quadratic cₐ, and the bounded level differential. Part II implements that mathematics as the Helix Processor. HELIX evaluates the far field from the atoms alone; WINDOW replaces a dense near-field solve by a banded O (Delta) transfer; and DYON returns both the F₉ endpoint data and the independent exact integer path charge. Four named reductions carry the applied evidence: a Heat Diode with exact reciprocity walls, an O (N) ring solve demonstrated at one million sites, a staged contrast law and a bounded lunar-cycle valve calculation; a Seismic Array that recovers the splitting of two folded normal-mode multiplets from public post-Tohoku data; a Regolith Switchyard supplying a logical switch Address Book with exact support-policy pruning; and a Piezoelectric Superhighway whose closed three-switch compiler replaces a 16¹8 history room by ten congruence skeletons. A general scaling theorem covers every finite exact periodic Address Book: an s-state period block gives a recurrence of order at most s and an O (s² log L) exact evaluator after compilation. In the three-switch inverse family the generic order 26 collapses to five roots, giving O (25 log L) ring operations while the full integer retains a number of bits linear in L. This is a different scaling class, not a fixed-case ratio: exact streaming is linear in L while transported evaluation is logarithmic, and standard exact matrix powering is cubic in state size while the scalar recurrence is quadratic. The measured stream-to-transport operation ratio grows from 52. 2x at L = 600 to 11, 842. 0x at L = 600, 000. On an identical L = 18 full-field target, the generic frontier took 70. 870742 s while an independent ten-skeleton evaluator took a median 23. 1224 microseconds, a measured ratio of 3. 065 x 10⁶ with neither projected wall time nor recurrence-seed lookup. Section 12 reports the Cosmic Quine data on this exact lattice: the five shells and the 4+8 CRT split, the zero-free-parameter mass skeleton and Koide phase, the exact resolvent trace 103/24, the signed confinement laws, and the enclosure residual proportional to the inverse square of the age. Claims are graded as proven, bounded computational, or open, and the failures are printed alongside the successes: the counterexamples to the wall-count law, the common-mode and station-class failures that bound the seismic claim, and a conceded parity against single-thread SciPy/SuperLU on the identical 648 right-hand sides, where no irreducible elapsed-time advantage is claimed for the eight-degree linear layer. Every finite claim is either an exact identity or is checked against an independently implemented reference calculation on the same input. The bounded verification script verify. py is available from the author on reasonable request rather than posted with this record. This costs the reader nothing: every definition, identity and worked value the script checks is printed in full in the paper, and each check can be reimplemented independently from those statements alone. Patent reservation. The mathematics is disclosed here. The apparatus — the runtime that mines the store, mints and seals the warrants, and practices these primitives — is claimed in U. S. Provisional Patent Applications 64/031, 440; 64/054, 093; 64/062, 753; 64/094, 931; 64/098, 689; 64/103, 049; 64/109, 790; and 64/119, 218, and is not disclosed in this paper.