Boolean functions are central to cryptography and coding theory, where nonlinearity measures how far a function is from the closest affine function. For balanced 8-variable Boolean functions, a long-standing open problem asked whether a nonlinearity of 118 was possible. The new arXiv preprint answers this question in the negative.

The paper proves that the maximum nonlinearity for such functions is 116, not 118. This settles a famous open problem and provides a definitive bound for this class of functions. Since the source is an abstract, the proof techniques are not detailed, but the stated result is clear and direct.

The result is significant because it narrows the search space for Boolean functions with optimal cryptographic properties. Researchers looking for functions with the highest possible nonlinearity can now focus on the value 116 as the true ceiling for balanced 8-variable cases.