A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
A counterexample to the quadratic sensitivity conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:1
Category:Theoretical computer science Lean version:YES! ✔
Rate this game! 4.1 out of 5 (8,807 votes)

>>> How to Play <<<
A superquadratic separation of sensitivity and block sensitivity. Constructs total Boolean functions with block sensitivity $\mathop{\mathrm{bs}}\nolimits (f)\ge s(f)^\alpha$ for a fixed α > 2, disproving the quadratic strengthening of the Sensitivity Conjecture. Here $s(f)$ counts influential individual-bit flips, while block sensitivity allows disjoint groups of bits to change together.

>>> Level Select <<<
released 2026-09-25  |  1 theorem · 5 lemmas · 8 proofs · 4,637 words  |  PLAY LEVEL 1 »  (pdf)
We disprove the quadratic strengthening of the Sensitivity Conjecture by constructing nonconstant total Boolean functions whose block sensitivity grows faster than any constant multiple of sensitivity squared. In fact, for some fixed α > 2, our examples have unbounded block sensitivity and satisfy $\mathop{\mathrm{bs}}\nolimits (f)\ge s(f)^\alpha$.

More Theoretical computer science Games!
The 2-to-1 Games Conjecture with perfect completenessHardness of coloring three-colorable graphs HOT!Matrix multiplication with exponent at most $9/4$ HOT!A cubic permanent–determinant lower bound
Integer multiplication below $n\log n$ HOT!Optimal-order randomized $k$-server on arbitrary metricsOne-sample matroid prophet inequalities against an almighty adversaryBeyond the square-root exponent for depth-three circuits

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games