OctoInformBeta

OpenAI preprint, September 2026 · §7. Zero avoidance costs information

Increment words and their lengths: The word length Lj=2⌊2j/5⌋L_j = 2^{\lfloor 2j/5\rfloor} of batch jj divides each later one, and log⁡Lj\log L_j lies in [25jlog⁡2−log⁡2,25jlog⁡2][\tfrac25 j\log 2-\log 2, \tfrac25 j\log 2]

Increment words sum to the displacement over their window.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

A walk z0,z1,…z_0, z_1, \dots in ℤ[i]\mathbb{Z}[i] moves at time tt by the step zt+1−ztz_{t+1} - z_t, itself a Gaussian integer. Over a window of LL consecutive times the walk is described by its steps in order, a word of length LL over the alphabet ℤ[i]\mathbb{Z}[i], and one asks what that word records of the walk’s position.

The primes p≡1(mod⁡4)p \equiv 1 \pmod 4 fall into dyadic batches, the batch of index jj holding those with 2j≤p<2j+12^j \le p < 2^{j+1}. Each batch is given a word length, a power of two that depends on jj alone, and the question is how these lengths compare across batches and how fast they grow with jj.

The Claim

Definition 1. Let z0,z1,…z_0, z_1, \dots be a walk in ℤ[i]\mathbb{Z}[i], and let L,t≥0L, t \ge 0 be integers. The increment word of length LL at time tt of the walk is the word WL(t)W_L(t) of LL Gaussian integers WL(t)=(zt+1−zt,zt+2−zt+1,…,zt+L−zt+L−1).W_L(t) = (z_{t+1} - z_t,\ z_{t+2} - z_{t+1},\ \dots,\ z_{t+L} - z_{t+L-1}).(1)✦ Writing wk=zt+k−zt+k−1w_k = z_{t+k} - z_{t+k-1} for its kkth letter, the letters sum to the displacement of the walk from time tt to time t+Lt + L: w1+w2+…+wL=zt+L−zt.w_1 + w_2 + \dots + w_L = z_{t+L} - z_t.(2)✦ For an integer j≥0j \ge 0, the word length LjL_j of the dyadic batch of index jj is Lj=2⌊2j/5⌋.L_j = 2^{\lfloor 2j/5 \rfloor}.(3)✦ For integers 0≤i≤j0 \le i \le j, Li∣Lj,L_i \mid L_j,(4)✦ and for every integer j≥0j \ge 0, 25jlog⁡2−log⁡2≤log⁡Lj≤25jlog⁡2.\tfrac{2}{5}\, j \log 2 - \log 2 \;\le\; \log L_j \;\le\; \tfrac{2}{5}\, j \log 2.(5)✦

In the paper, the result reads: WL(t)=(zt+1−zt,…,zt+L−zt+L−1)W_L(t) = (z_{t+1} - z_t, \dots, z_{t+L} - z_{t+L-1}), with dyadic lengths LT=2⌊log⁡2(T2/5)⌋L_T = 2^{\lfloor \log_2 (T^{2/5}) \rfloor}, where TT is the scale of the paper’s batch ℬT\mathcal{B}_T of primes p≡1(mod⁡4)p \equiv 1 \pmod 4 in [T,2T][T, 2T].

What Is Checked

The word (1), the lengths (3) and the facts (2), (4) and (5) are stated over any walk z0,z1,…z_0, z_1, \dots in ℤ[i]\mathbb{Z}[i], self-avoiding or not and with steps of any size, and over all integers L,t≥0L, t \ge 0 and 0≤i≤j0 \le i \le j, the logarithms in (5) being natural logarithms of real numbers.