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

fix(proofs): reduce CompressedSNARK::prove time #322

Closed
2 tasks
Autoparallel opened this issue Nov 20, 2024 · 0 comments · Fixed by #318
Closed
2 tasks

fix(proofs): reduce CompressedSNARK::prove time #322

Autoparallel opened this issue Nov 20, 2024 · 0 comments · Fixed by #318
Assignees
Labels
performance ⚡️ benchmarks or performance Priority High 🔥 ASAP research 👨‍🔬 Research to see if we want to do something

Comments

@Autoparallel
Copy link
Contributor

Science

The science has told me that the things that contribute to this dominantly are:

  • The total circuits we have used in our ROM. We are currently in WIP to reduce circuits further with feat: hash-based JSON circuit web-prover-circuits#41
  • The commitment scheme. It appears HyperKZG is far more efficient at this stage. I believe we knew this before, but switched back to Pedersen for proof size worries. From my investigation, these seem to be far less of an issue now.
@Autoparallel Autoparallel added performance ⚡️ benchmarks or performance Priority High 🔥 ASAP research 👨‍🔬 Research to see if we want to do something labels Nov 20, 2024
@Autoparallel Autoparallel self-assigned this Nov 20, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
performance ⚡️ benchmarks or performance Priority High 🔥 ASAP research 👨‍🔬 Research to see if we want to do something
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant