balanced-153.patch

--- a/build/main.tex
+++ b/build/main.tex
@@ -27,7 +27,7 @@
 \begin{abstract}
 We give a deterministic algorithm that multiplies two $n$-bit integers
 in $O(n(\lg n)^{1-\kappa})$ worst-case time, with
-$\kappa=2^{-182}$, on one fixed finite-alphabet Turing machine with a
+$\kappa=2^{-153}$, on one fixed finite-alphabet Turing machine with a
 fixed finite number of one-dimensional tapes. The algorithm is exact
 for every input length and disproves the $n\log n$ optimality conjecture
 of Sch\"onhage and Strassen in this model.
--- a/build/sections/00-introduction.tex
+++ b/build/sections/00-introduction.tex
@@ -25,7 +25,7 @@
 inputs. Its worst-case running time satisfies
 \[
  T_A(n)=O\!\left(n(\lg n)^{1-\kappa}\right),
- \qquad \kappa=2^{-182}.
+ \qquad \kappa=2^{-153}.
 \]
 \end{theorem}
 
--- a/build/sections/08-assembly.tex
+++ b/build/sections/08-assembly.tex
@@ -20,9 +20,9 @@
 \begin{equation}\label{eq:fixed-parameters}
 \begin{gathered}
  \tau=\sigma=1-2^{-50},\qquad \beta=\frac12,\qquad \delta=\frac1{16},\\
- \lambda=1-2^{-52},\qquad c=2^{-56},\qquad
- \lambda'=1-2^{-54},\\
- C_1=20,\qquad \epsilon=2^{-75},\qquad \kappa=2^{-182}.
+ \lambda=1-3\cdot2^{-102},\qquad c=2^{-51},\qquad
+ \lambda'=1-2^{-101},\\
+ C_1=20,\qquad \epsilon=2^{-51},\qquad \kappa=2^{-153}.
 \end{gathered}
 \end{equation}
 These constants are deliberately conservative; no optimization is claimed.
@@ -30,7 +30,7 @@
 The layer conditions hold with room to spare:
 \[
  \max\{\tau,\sigma\}<\lambda<1,\qquad
- \tau(1+c/\beta)<1-31\cdot2^{-55}<\lambda,
+ \tau(1+c/\beta)=1-2^{-100}<1-3\cdot2^{-102}=\lambda,
 \]
 and
 \[
@@ -184,8 +184,8 @@
 All remaining scalar setup, including comparisons for fixed rational
 powers, modular inverses,
 prime products and shape descriptors, has cost polynomial in $p$.
-For example, $d=\lfloor b^{2^{-75}}\rfloor$ is found by binary search
-using exact comparisons $d^{2^{75}}\le b$; the exponent is fixed.
+For example, $d=\lfloor b^{2^{-51}}\rfloor$ is found by binary search
+using exact comparisons $d^{2^{51}}\le b$; the exponent is fixed.
 The same procedure computes $K$ and all other fixed rational powers.
 All primes and length parameters are therefore generated by the machine;
 they are not advice.
@@ -860,10 +860,10 @@
 \end{equation}
 Direct substitution gives
 \[
- g_1>\frac12,\quad g_2=2^{-181},\quad g_3=2^{-129},\quad
- g_4>2^{-51},\quad g_5>\frac18,\quad g_6>\frac12,\quad g_7=2^{-75}.
-\]
-Thus $\min_i g_i=2^{-181}=2\kappa$.  This explicit slack will cover
+ g_1>\frac12,\quad g_2=2^{-152},\quad g_3=2^{-152},\quad
+ g_4>2^{-52},\quad g_5>\frac18,\quad g_6>\frac12,\quad g_7=2^{-51}.
+\]
+Thus $\min_i g_i=2^{-152}=2\kappa$.  This explicit slack will cover
 any remaining fixed power of $\log p$.
 
 Here $d^2$ is absorbed by $d^2\ell^\tau$, and