Fast Polynomial Evaluation — Chain Compiler
thomasahle.com- Category
- Developer Tools
- Rank
- No. 1951Tools index
- Pricing
- Free
- Platform
- web
- Type
- TOOL
- Date
About
A browser-based tool that compiles a degree-n polynomial into an evaluation chain requiring roughly n/2 multiplications instead of the n needed by Horner's method, using rational coefficient preprocessing over fields like ℚ, ℝ, ℂ, Mersenne primes, or binary fields. Output can be rendered as math notation, C code, or a circuit, useful for function approximation and cryptographic or coding-theory applications.
What it can do
Compile a degree-n polynomial into an evaluation chain requiring approximately n/2 multiplications
Degree-n polynomial with rational coefficients → Optimized evaluation chain
Render the computed evaluation chain as mathematical notation
Evaluation chain → Math notation
Generate C code implementing the evaluation chain
Evaluation chain → C code
Generate a circuit representation of the evaluation chain
Evaluation chain → Circuit diagram
Preprocess polynomial coefficients over different fields (ℚ, ℝ, ℂ, Mersenne primes, binary fields)
Polynomial coefficients and field choice → Preprocessed coefficients for evaluation chain construction
Tags
Comments (0)
No comments yet
Editorially curated, with community endorsements as a secondary signal. Corrections welcome.