We propose a simple variant of the INW pseudo-random generator, where blocks have varying lengths, and prove it gives the same parameters as the more complicated construction of Armoni's PRG. This shows there is no need for the specialized PRGs of Nisan and Zuckerman and Armoni, and they can be obtained as simple variants of INW.

For the construction to work we need space-efficient extractors with tiny entropy loss. We use the extractors from Chattopadhyay et. al instead of Guruswami et. al taking advantage of the very high min-entropy regime we work with.

We remark that using these extractors has the additional benefit of making the dependence on the branching program alphabet $\Sigma$ correct.