This is the Chein search hardware for my implementation of a Reed-Solomon decoder. The hardware is slightly modified to start evaluation at a^1, instead of a^0. This will be used to generate a sorted list when the inverses of the roots are calculated. a^+0 = a^-0, thus this element will be out of place in a sorted list.