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

Drop Cached Polynomials from Just-In-Time Code Path #287

Open
aszepieniec opened this issue May 23, 2024 · 0 comments
Open

Drop Cached Polynomials from Just-In-Time Code Path #287

aszepieniec opened this issue May 23, 2024 · 0 comments
Labels
🤖 code Changes the implementation ✨ enhancement Improvement or new feature 💫 good first issue Good for newcomers 🟢 prio: low Not at all urgent

Comments

@aszepieniec
Copy link
Collaborator

The new and improved twenty-first repo contains functions for fast parallel batch coset extrapolation, meaning that it is possible to go straight from the execution trace columns (interpreted as RS codewords over the trace domain) to the rows requested by FRI (which represent evaluations of the corresponding polynomials on a different domain). This allows us to drop the cached polynomials (that interpolate the trace columns) from the just-in-time code path, saving 50% of the memory cost at a (now) modest performance degradation.

@aszepieniec aszepieniec added 💫 good first issue Good for newcomers ✨ enhancement Improvement or new feature 🟢 prio: low Not at all urgent 🤖 code Changes the implementation labels May 23, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
🤖 code Changes the implementation ✨ enhancement Improvement or new feature 💫 good first issue Good for newcomers 🟢 prio: low Not at all urgent
Projects
None yet
Development

No branches or pull requests

1 participant