We show that if an NP‐complete problem has a nonadaptive self‐corrector with respect to any samplable distribution, then coNP is contained in NP/poly and the polynomial hierarchy collapses to the third level. Feigenbaum and Fortnow [SIAM J. Comput., 22 (1993), pp. 994–1005] show the same conclusion under the stronger assumption that an NP‐complete problem has a nonadaptive random self‐reduction. A self‐corrector for a language L with respect to a distribution is a worst‐case to average‐case reduction that transforms any given algorithm that correctly decides L on most inputs (with respect to ) into an algorithm of comparable efficiency that decides L correctly on every input. A random self‐reduction is a special case of a self‐corrector, where the reduction, given an input x, is restricted to only making oracle queries that are distributed according to . The result of Feigenbaum and Fortnow depends essentially on the property that the distribution of each query in a random self‐reduction is independent of the input of the reduction. Our result implies that the average‐case hardness of a problem in NP or the security of a one‐way function cannot be based on the worst‐case complexity of an NP‐complete problem via nonadaptive reductions (unless the polynomial hierarchy collapses).