arXiv:2611.14163v1 Announce Type: cross Abstract: The binary rank of a binary matrix is the minimum number of disjoint all-one rectangles that partition its one-entries. We study entry-query testing of binary rank at most $d$, with one-sided error and nonadaptive queries. We give a tester using $\tilde O(d^4/\epsilon^2)$ queries, independent of the matrix dimensions and a general lower bound of $\tilde \Omega(d^{3/2}/\epsilon)$.