Sign-rank and discrepancy are two central notions in communication complexity. The seminal work of Babai, Frankl, and Simon from 1986 initiated an active line of research that investigates the gap between these two notions. In this article, we establish the strongest possible separation by constructing a Boolean matrix whose sign-rank is only 3 , and yet its discrepancy is 2 − ( n ) . We note that every matrix of sign-rank 2 has discrepancy n − O (1) . Our result in particular implies that there are Boolean functions with O (1) unbounded error randomized communication complexity while having ( n ) weakly unbounded error randomized communication complexity.