# NP-hard problems which are easy on average

Are there any known NP-hard problems that are easy on average as per the definition of average-case complexity by Levin?

-

How about this: Recognize strings of $2n$ bits such that at least one of the first $n$ bits is $1$ or the last $n$ bits describe a satisfiable Boolean formula.