We prove a sharp lower bound on the distributional communication complexity of the exact gap-hamming problem.