On random matrices with large corank Let 1 ≤ k ≤ n and M be a random n × n matrix with independent uniformly random {±1}-entries. We show that there exists an absolute constant c > 0 such that P[rank(M) ≤ n − k] ≤ exp(−cnk). This confirms a well-known prediction in the area, extending a result of Rudelson (who previously proved this same result under the restriction k ≤ √n, via different methods). 2026 12 Oxford University Press application/pdf