Mathematical remark

Discussion note on GKW Theorem 1.1 versus the conjecture. File-verified source: Golovnev-Kulikov-Williams, arXiv:1811.04828v4, Theorem 1.1. Every fan-in-2 circuit of size s equals an OR of 2^{ceil(s/3.9)} many 16-CNFs. For every n-bit f, s_3^{16}(f) <= 2^n by writing f as an OR of accepting minterms (each minterm is a 1-CNF). Therefore Theorem 1.1 can force B2-size > s only when ceil(s/3.9) <= n-1, i.e. only up to 3.9n - O(1). It cannot prove existence of L in E outside B2-SIZE(O(n)). Superlinear unrestricted size via this route still requires GKW Open Problem 1.1 (a depth-3 reduction for every linear constant c) plus matching depth-3 lower bounds. Valiant’s omega(n) implication in GKW Table 1 is for log-depth circuits, a different model. Secondary pointer only: Carmosino-Dang-Jackman arXiv:2604.23958v1 cite Li-Yang STOC 2022 as 3.1n-o(n) for affine dispersers in P; Li-Yang was not file-retrieved. No P vs NP claim. Finite bookkeeping: work/code/gkw_reduction_accounting.py.