google / google/heir

PolynomialToModArith: branch lowerings based on eval form vs coeff form

Open
#2,849 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
MLIR
Stars
906
Forks
171
Avg merge
4d 12h
Merged PRs (30d)
32

Description

polynomial.mul currently lowers via `polynoimal-to-mod-arith` to a convolution-based polynomial multiplication routine, assuming coefficient form. Now that we have NTT outputs as polynomial types with a "form" attribute, we need to support lowering a polynomial.mul op in `eval` form to an elementwise product with no ring reduction.

Similarly, we should review all the polynomial-to-mod-arith op lowerings and see which need to branch based on eval/coeff form differences in the input.

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.