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.

Sign up for GitHub

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

Jump to bottom

Investigate and optimize the efficiency of FK23 PCS multi-openings #396

Closed
chancharles92 opened this issue Nov 2, 2023 · 2 comments
Closed

Investigate and optimize the efficiency of FK23 PCS multi-openings #396

chancharles92 opened this issue Nov 2, 2023 · 2 comments
Assignees
@chancharles92

Comments

@chancharles92
Copy link
Contributor

The VID disperse function is bottlenecked by the generation of PCS batch opening proofs. Thus investigate whether we can further optimize the performance.
@chancharles92 chancharles92 self-assigned this Nov 2, 2023
@chancharles92
Copy link
Contributor Author

The bottleneck is the computation of the h_poly, which involves expensive Toeplitz matrix multiplication (over group elements). It takes ~1s to compute the h_poly with polynomial degree 1024, which accounts for most of the computation. Also we note that the FFT over group elements is 400x more expensive than an FFT over field elements.

@chancharles92
Copy link
Contributor Author

close after #394 and #442

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@chancharles92 chancharles92

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@chancharles92