Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fast polynomial multiplication and division in lagrange domain. #34

Open
Tracked by #25
0xJepsen opened this issue May 6, 2024 · 2 comments
Open
Tracked by #25

fast polynomial multiplication and division in lagrange domain. #34

0xJepsen opened this issue May 6, 2024 · 2 comments
Assignees
Labels
need more information Issue or PR needs more explanation before it can be worked on Polynomials Pertaining to polynomials

Comments

@0xJepsen
Copy link
Contributor

0xJepsen commented May 6, 2024

No description provided.

@Autoparallel Autoparallel self-assigned this May 6, 2024
@Autoparallel
Copy link
Contributor

This overlaps pretty heavily with FFT (division less so).

Can we refine this issue? It is a bit unclear at the moment.

@Autoparallel Autoparallel added the need more information Issue or PR needs more explanation before it can be worked on label May 10, 2024
@0xJepsen 0xJepsen added the Polynomials Pertaining to polynomials label May 10, 2024
@lonerapier
Copy link
Collaborator

@Autoparallel we can implement this now right? as we have DFT to change the basis. Multiplication and division in monomial basis takes O(n^2), while in lagrange basis, it's O(n). I understood it from these amazing stark anatomy blogs.

Plonkathon also has it implemented in it's polynomial module.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
need more information Issue or PR needs more explanation before it can be worked on Polynomials Pertaining to polynomials
Projects
None yet
Development

No branches or pull requests

3 participants