Let X m \eps be the distribution over m bits ( X 1 X m ) where the X i are independent and each X i equals 1 with probability (1 + \eps ) 2 and 0 with probability (1 − \eps ) 2 . We consider the smallest value \eps of \eps such that the distributions X m \eps and X m 0 can be distinguished with constant advantage by a function f : 0 1 m S which is the product of k functions f 1 f 2 f k on disjoint inputs of n bits, where each f i : 0 1 n S and m = n k .