Hardness amplification within NP

In this paper we investigate the following question: if NP is slightly hard on average, is it very hard on average? The computational result we prove essentially matches an information-theoretic bound