Evaluate polynomials with about n/2 multiplications
Fast Polynomial Evaluation is an in-browser chain compiler that preprocesses and evaluates polynomials using significantly fewer multiplications than traditional methods like Horner's rule. By leveraging rational preprocessing, it allows users to evaluate a degree-n polynomial with about n/2 multiplications instead of n.
It solves the computational inefficiency of polynomial evaluation for tasks requiring high performance, such as approximating functions like exp, sin, and cos, or applications in cryptography, hashing, and coding theory. The tool is designed for mathematicians, cryptographers, and developers who need to optimize polynomial evaluation schedules.
Users can simply type a polynomial, pick a field such as Q, R, C, a Mersenne prime, or a binary field, and instantly receive the preprocessed evaluation chain as math, C code, or a circuit.
