Evasiveness conjecture for monotone transitive Boolean functions

A Boolean function is a function $f:\{0,1\}^n\to\{0,1\}$. Its decision-tree complexity $D(f)$ is the minimum number of input bits an adaptive algorithm must query to determine $f$, and $f$ is evasive when $D(f)=n$. The function is monotone if $f(x_1,\ldots,x_n)\leq f(y_1,\ldots,y_n)$ whenever $x_i\leq y_i$ for every $i$, and transitive if its symmetry group acts transitively on the coordinates. Evasiveness conjecture. Every non-constant monotone, transitive Boolean function is evasive.