EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... (Preprint) Year :

EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more

Gautam Botrel
  • Function : Author
  • PersonId : 1211648


The bottleneck in the proving algorithm of most of elliptic-curve-based SNARK proof systems is the Multi-Scalar-Multiplication (MSM) algorithm. In this paper we give an overview of a variant of the Pippenger MSM algorithm together with a set of optimizations tailored for curves that admit a twisted Edwards form. This is the case for SNARK-friendly chains and cycles of elliptic curves, which are useful for recursive constructions. Accelerating the MSM over these curves on mobile devices is critical for deployment of recursive proof systems on mobile applications. This work is implemented in Go and uses handwritten arm64 assembly for accelerating the finite field arithmetic (bigint). This work was implemented as part of a submission to the ZPrize competition in the open division "Accelerating MSM on Mobile" (https://www.zprize.io/). We achieved a 78% speedup over the ZPrize baseline implementation in Rust.
Fichier principal
Vignette du fichier
EdMSM.pdf (576.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03922635 , version 1 (04-01-2023)


  • HAL Id : hal-03922635 , version 1


Gautam Botrel, Youssef El Housni. EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more. 2022. ⟨hal-03922635⟩
11 View
3 Download


Gmail Facebook Twitter LinkedIn More