Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n\log(n)/\varepsilon)-query tester for unateness of Boolean functions f:\{0,1\}^n \mapsto \{0,1\}. In this note we describe a simple non-adaptive, O(n\log(n/\varepsilon)/\varepsilon) -query tester for unateness for functions over the hypercube with any ordered range.

As suggested by Oded Goldreich, we mention that our proof is essentially an implementation of Levin's investment strategy.

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n\log(n)/\varepsilon)-query tester for unateness of Boolean functions f:\{0,1\}^n \mapsto \{0,1\}. In this note we describe a simple non-adaptive, O(n\log(n/\varepsilon)/\varepsilon) -query tester for unateness for functions over the hypercube with any ordered range.