We give a length-efficient puncturing of Reed-Muller codes which preserves its distance properties. Formally, for the Reed-Muller code encoding n-variate degree-d polynomials over Fq with q(d) , we present an explicit (multi)-set SFnq of size N=poly(nd) such that every nonzero polynomial vanishes on at most N points in S. Equivalently, we give an explicit hitting set generator (HSG) for degree-d polynomials of seed length logN=O(dlogn+log(1)) with ``density" 1− (meaning every nonzero polynomial is nonzero with probability at least 1− on the output of the HSG). The seed length is optimal up to constant factors, as is the required field size (d) .

Plugging our HSG into a construction of Bogdanov (STOC'05) gives explicit pseudorandom generators for n-variate degree-d polynomials with error and seed length O(d4logn+log(1)) whenever the field size satisfies q(d62) .

Our approach involves concatenating previously known HSGs over large fields with multiplication friendly codes based on algebraic curves. This allows us to bring down the field size to the optimal bounds. Such multiplication friendly codes, which were first introduced to study the bilinear complexity of multiplication in extension fields, have since found other applications, and in this work we give a new use of this notion in algebraic pseudorandomness