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

Short scalars in Shplemini: edge cases #1222

Open
iakovenkos opened this issue Jan 28, 2025 · 0 comments
Open

Short scalars in Shplemini: edge cases #1222

iakovenkos opened this issue Jan 28, 2025 · 0 comments

Comments

@iakovenkos
Copy link
Contributor

To make the UltraZK and MegaZK recursive verifiers (with UltraCircuitBuilder) more efficient, we use bn254_batch_mul with short scalars, at the moment, it's not handling the edgecases properly (def not handling repeated points). However, if the proof is generated with MegaZK or UltraZK Flavors, the probability of edge cases in a valid proof is negligible, because the witness commitments are masked. We need to

  • Ensure that the collisions are also unlikely for the selectors.
  • Investigate a robust way to process (whp malicious) proofs that contain edge cases.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant