> I guess it's a fundamental difference between RLIBM and your algorithm---you don't guarantee correctly rounded results, right? Yes, but note that the linked

> I guess it's a fundamental difference between RLIBM and your algorithm---you don't guarantee correctly rounded results, right? Yes, but note that the linked package doesn't even attempt to implement a polynomial approximation (for use in software), rather it just finds the coefficients of a polynomial. Another WIP package of mine will use FindMinimaxPolynomial to actually implement the approximation (with source code output etc), however even that package was never meant to guarantee correctly rounded results. In particular their work is more ambitious than mine in that they seem to account for the range reduction and output compensation while looking for the coefficients with LP, which enables them to guarantee correctly rounded results.