Separation exponent at least 2.075

For every real $\varepsilon>0$ and every integer $S\ge2$, there exist a natural number $n$ and a total Boolean function $f:\{0,1\}^n\to\{0,1\}$ satisfying

Here $s(f)$ is the maximum number of sensitive individual coordinates at one input, and $bs(f)$ is the maximum number of pairwise disjoint nonempty sensitive blocks at one input. The exponent is exactly $83/40=2.075$. The dimension and function may depend on both $\varepsilon$ and $S$; sensitivity is unbounded.

The proof uses a seven-level construction with nine nested predicates and exact sensitivity-profile certificates. It extends the accepted 2.0635 construction by abhishekdpseok and retains the campaign's shared definitions.