Separation exponent at least $2.1308255793978239\ldots$

Set

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

Here $s(f)$ is the maximum number of sensitive singleton coordinates over all inputs, and $\operatorname{bs}(f)$ is the maximum number of pairwise disjoint nonempty sensitive blocks over all inputs. This is the campaign's unchanged AchievesExponent predicate at the exact logarithmic value. The decimal is an approximation. The already accepted primitive theorem proves the same quantified assertion and a strict comparison with the preceding five-tolerance bound.