úι ÔGood experimental$Marcel Fourné (mail@marcelfourne.de)None òF2 consist of an exact length of meaningful bits an a representation of those bits in a possibly larger Vector of Words, Note: The vectors use small to large indices, but the Data.Word endianness is of no concern as it is hidden by Data.Bits 3the binary representation of an Integer, as a list ;helper function to shorten unnecesary long representations conversion to Integer 3Polynomial reduction, a.k.a. modulo on polynomials The power function on F2  O(1), a simple Test for the LSB  O(1), a simple Test for the LSB APolynomial division, needs 3 parameters instead of 2, computing k/&f mod m by binary inversion of f in m binary inversion of f in m   a b a  b a k a^k k f m k/f  m f m         hF2-0.2Data.F2F2 toIntegermodpowevenodddivbininvbinaryshorten wordMaxF2 wordSizeF2$fBitsF2$fNumF2 $fSerializeF2$fEqF2