What is the \Sigma_3^2-circuit complexity (depth 3, bottom-fanin 2) of the 2n-bit inner product function? The complexity is known to be exponential 2^{\alpha_n n} for some \alpha_n=\Omega(1). We show that the limiting constant \alpha=\limsup \alpha_n satisfies
