We present the fastest known polynomial-space algorithm for the maximum independent set problem. It runs in time $2^{0.29n}$ in the worst case.