Skip to content

Commit

Permalink
Update EIP-2537: fix typo
Browse files Browse the repository at this point in the history
Merged by EIP-Bot.
  • Loading branch information
chfast committed Sep 11, 2024
1 parent 4a4cde7 commit 32fbf6e
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion EIPS/eip-2537.md
Original file line number Diff line number Diff line change
Expand Up @@ -273,7 +273,7 @@ Assuming a constant `30 MGas/second`, the following prices are suggested.

#### G1/G2 MSM

MSMs are expected to be performed by Pippenger's algorithm (we can also say that it **must** be performed by Pippenger's algorithm to have a speedup that results in a discount over naive implementation by multiplying each pair separately and adding the results). For this case there was a table prepared for discount in case of `k <= 128` points in the MSM with a discount cup `max_discount` for `k > 128`.
MSMs are expected to be performed by Pippenger's algorithm (we can also say that it **must** be performed by Pippenger's algorithm to have a speedup that results in a discount over naive implementation by multiplying each pair separately and adding the results). For this case there was a table prepared for discount in case of `k <= 128` points in the MSM with a discount cap `max_discount` for `k > 128`.

To avoid non-integer arithmetic, the call cost is calculated as `(k * multiplication_cost * discount) / multiplier` where `multiplier = 1000`, `k` is a number of (scalar, point) pairs for the call, `multiplication_cost` is a corresponding single multiplication call cost for G1/G2.

Expand Down

0 comments on commit 32fbf6e

Please sign in to comment.