Summary: We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let \(A\) be an \(n \times n\) random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least \(1-e^{-\log^2 n}\) \[\min \limits_{I\subset [n],|I|= m} \Vert \mathbf{v}_I \Vert \ge \frac{m^{3/2}}{n^{3/2}\log^Cn} \Vert \mathbf{v} \Vert\] for any real eigenvector \(\mathbf{v}\) and any \(m\in[\log^C n,n]\), where \(\mathbf{v}_I\) denotes the restriction of \(\mathbf{v}\) to \(I\). Further, when the entries of \(A\) are complex, with i.i.d real and imaginary parts, we show that with probability at least \(1-e^{-\log^2 n}\) all eigenvectors of \(A\) are delocalized in the sense that \[\min \limits_{I\subset [n],|I|= m} \Vert \mathbf{v}_I \Vert \ge \frac{m}{n\log^Cn} \Vert \mathbf{v} \Vert\] for all \(m\in [\log^C n,n]\). Comparing with related results, in the range \(m \in [\log^{C'} n,n/\log^{C'}n]\) in the i.i.d setting and with weaker probability estimates, our lower bounds on \(\Vert \mathbf{v}_I \Vert\) strengthen an earlier estimate \(\min_{|I|= m}\Vert \mathbf{{v}}_I\Vert \ge c(m/n)^6\Vert \mathbf{{v}}\Vert\) obtained in Rudelson and Vershynin (Geom Funct Anal 26(6):1716-1776, 2016), and bounds \(\min_{|I|= m}\Vert \mathbf{v}_I\Vert \ge c(m/n)^2\Vert \mathbf{v}\Vert\) (in the real setting) and \(\min_{|I|= m}\Vert \mathbf{{v}}_I\Vert \ge c(m/n)^{3/2}\Vert \mathbf{v}\Vert\) (in the complex setting) established in [K. Luh and S. O’Rourke, Random Struct. Algorithms 57, No. 1, 169–210 (2020; Zbl 1448.15046)]. As the case of real and complex Gaussian matrices shows, our bounds are optimal up to the polylogarithmic multiples. We derive stronger estimates without the polylogarithmic error multiples for null vectors of real \((n-1)\times n\) random matrices.