Perfect completeness for 2-to-1 games

We prove the 2-to-1 Games Conjecture with perfect completeness. For every fixed rational $\delta \in (0,1)$, it is NP-hard to distinguish satisfiable 2-to-1 games from games of value at most δ, with a fixed alphabet and an explicitly listed unweighted multiset of constraints.