From 32fbf6e7b4fabc62f0ce72c3e5f1c5c0e752e900 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Pawe=C5=82=20Bylica?= Date: Wed, 11 Sep 2024 14:48:32 +0200 Subject: [PATCH] Update EIP-2537: fix typo Merged by EIP-Bot. --- EIPS/eip-2537.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/EIPS/eip-2537.md b/EIPS/eip-2537.md index 5e8a0872bb1a0..cf80a378f3707 100644 --- a/EIPS/eip-2537.md +++ b/EIPS/eip-2537.md @@ -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.