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

perf(spartan): Optimize SparsePolynomial evaluate to O(n) complexity #353

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

perf(spartan): Optimize SparsePolynomial evaluate to O(n) complexity #353

wants to merge 1 commit into from

Conversation

VolodymyrBg
Copy link

  • Pre-compute 1-r[i] values to avoid repeated subtraction
  • Remove separate compute_chi function call overhead
  • Use direct iteration and fold for efficient computation
  • Improve time complexity from O(n log n) to O(n)

sjudson added a commit that referenced this pull request Feb 12, 2025
@sjudson
Memory Efficient Basic Block Caching (#353)
2db02f4 
* More memory efficient basic block caching.

* Format and clippy.

* Better none checks.

* Use inclusive map.

* Revert "Use inclusive map."

This reverts commit 5b37ef21a1d2135ff28cadd467e8f5bf3827e460.

* Get the right suffix of the block.

* More formatting.

* Attempt unified interface.

* Revert "Attempt unified interface."

This reverts commit 6f62f46a81985254281877e0583027573ea55bd3.

* Improve readability.

* Remove suffix interface and calculate at execution.

* Formatting and clippy.

* Fix tests.

* Simplify

* Formatting
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@VolodymyrBg