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

Docs: Update README.md #6

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

Docs: Update README.md #6

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -64,11 +64,11 @@ The multiexponentiations are still the bottleneck and optimization efforts shoul

#### G1 multiexponentiation

- The [current best implementation](https://github.com/CodaProtocol/gpu-groth16-prover-3x/blob/master/multiexp/reduce.cu#L49) performs a "map-reduce" to implement the multiexponentiation with a batched double-and-add being the base multiexponentiation "map" function. The Pippenger algorithm ([described here](https://pdfs.semanticscholar.org/486e/573e23ad21623d6f4f7ff035b77e1db7b835.pdf) and implemented for another curve [here](https://github.com/matter-labs/belle_cuda/blob/master/sources/multiexp.cu) is likely to be significantly faster.
- The [current best implementation](https://github.com/CodaProtocol/gpu-groth16-prover-3x/blob/master/multiexp/reduce.cu#L49) performs a "map-reduce" to implement the multiexponentiation with a batched double-and-add being the base multiexponentiation "map" function. The Pippenger algorithm ([described here](https://pdfs.semanticscholar.org/486e/573e23ad21623d6f4f7ff035b77e1db7b835.pdf) and implemented for another curve [here](https://github.com/matter-labs/belle_cuda/blob/master/sources/multiexp.cu)) is likely to be significantly faster.

#### G2 multiexponentiation

- The above remarks about the Pippenger algorithm also apply here. To repeat, the [current best implementation](https://github.com/CodaProtocol/gpu-groth16-prover-3x/blob/master/multiexp/reduce.cu#L49) performs a "map-reduce" to implement the multiexponentiation with a batched double-and-add being the base multiexponentiation "map" function. The Pippenger algorithm ([described here](https://pdfs.semanticscholar.org/486e/573e23ad21623d6f4f7ff035b77e1db7b835.pdf) and implemented for another curve [here](https://github.com/matter-labs/belle_cuda/blob/master/sources/multiexp.cu) is likely to be significantly faster.
- The above remarks about the Pippenger algorithm also apply here. To repeat, the [current best implementation](https://github.com/CodaProtocol/gpu-groth16-prover-3x/blob/master/multiexp/reduce.cu#L49) performs a "map-reduce" to implement the multiexponentiation with a batched double-and-add being the base multiexponentiation "map" function. The Pippenger algorithm ([described here](https://pdfs.semanticscholar.org/486e/573e23ad21623d6f4f7ff035b77e1db7b835.pdf) and implemented for another curve [here](https://github.com/matter-labs/belle_cuda/blob/master/sources/multiexp.cu)) is likely to be significantly faster.

- The technique in [this paper](https://eprint.iacr.org/2008/117.pdf) can be used to speed up the G2 multi-exponentiation by about 2x.

Expand Down