\documentclass[11pt]{amsart} \usepackage[margin=1in]{geometry} \usepackage{amsmath,amssymb,amsthm} \usepackage[hidelinks]{hyperref} \usepackage{booktabs} \newtheorem{theorem}{Theorem}[section] \newtheorem{theoremA}{Theorem} \renewcommand{\thetheoremA}{\Alph{theoremA}} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{conjecture}[theorem]{Conjecture} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \setlength{\emergencystretch}{1.5em} \newcommand{\eps}{\varepsilon} \newcommand{\Hoo}{\mathrm{H}} \newcommand{\Li}{\operatorname{Li}} \title{Hooley's twisted cancellation below level $4/15$ does not force primes} \author{Wren Aquila} \date{21 November 2026} \begin{document} \begin{abstract} We work in Ford and Maynard's framework for sieve problems with Type I and Type II information. To Type I information at level $1/2$ and Type II information for factors up to $x^\nu$, we add Hooley's condition: the parity bias of the sequence in arithmetic progressions is small on average over moduli up to $x^\alpha$. We construct prime-free sequences that satisfy all three for every Type II range $\nu < 1/30$ and every twisted level $\alpha < 4/15$, and strictly below each of four further corners $(\eta, \alpha')$ of a staircase in the $(\nu, \alpha)$-plane, from $(1/11, 1/10)$ to $(1/20, 1/5)$, that is, for every $\nu < \eta$ and every $\alpha < \alpha'$. The constructions add to Ford and Maynard's continuum model one function of the total size of the small prime factors for each number of them; these functions solve the twisted conditions exactly. Each case rests on a computer-assisted certificate in exact or directed-rounding integer arithmetic. Independent audits read the certificates' code for every case except $(1/11, 1/10)$ and $(1/14, 1/8)$, whose certificates had an independent review of their formulas and inputs but not of their code. The cases $(1/11, 1/10)$, $(1/14, 1/8)$ and $(1/30, 4/15)$ each rest on a single implementation. Conversely, the term $d = 1$ of Hooley's condition, global parity balance, already forces a positive proportion of primes once $\nu \ge 0.116$. For $\alpha > 1/3$ we exhibit twisted rows that the added functions cannot enter, and we conjecture, on floating-point evidence, that constructions of exactly this form cannot pass $\alpha = 1/3$ (Conjecture~\ref{conj:wall}). We also record what the constructions imply for sieve approaches to Goldbach's problem. \end{abstract} \maketitle \input{sec1_intro} \input{sec2_setting} \input{sec3_construction} \input{sec4_lift} \input{sec_certificates} \input{sec_rungs} \input{sec_converse} \input{sec_limits} \input{sec_goldbach} \input{sec_computations} \appendix \input{app_constants} \input{app_kernels} \input{app_enclosures} \input{refs} \end{document}