The pixel purity index (PPI) algorithm proposed by Boardman, et al identifies potential endmember pixels in multispectral imagery. The algorithm generates a large number of skewers (unit vectors in random directions), and then computes the dot product of each skewer with each pixel. We report on a variant of the PPI algorithm in which blocks of B skewers are considered at a time. From the computation of B dot products, one can produce a much larger set of derived dot products that are associated with skewers that are linear combinations of the original B skewers. Since the derived dot products involve only scalar operations, instead of full vector dot products, they can be very cheaply computed.