Beyond the Square-Root Exponent for Depth-Three Boolean Circuits

We construct a language in deterministic polynomial time whose n-bit membership function requires $2^{\omega (\sqrt{n})}$ gates in an unbounded-fan-in OR–AND–OR circuit. The bound holds at every sufficiently large input length and counts all gates, including the bottom layer.