This paper develops preconditioners for singular black box matrix problems. We introduce networks of arbitrary radix switches for matrices of any square dimension, and we show random full Toeplitz matrices are adequate switches for these networks. We also show a random full Toeplitz matrix to satisfy all requirements of the Kaltofen-Saunders black box matrix rank algorithm without requiring a diagonal multiplier.