Open CPerezz opened 1 year ago
I came across https://github.com/iden3/ffiasm and wondered if this asm code has ever been benched against the actual implementation. And if so, whether it is faster.
I did some initial exploration and saw that most of the asm backend we have at PSE (see here) is as optimized as what rust here compiles too. (At least for fns like double as seen in: https://github.com/zcash/pasta_curves/pull/44#issuecomment-1407313926
double
From a quick look, to functions like double or square looks like the exact same thing or even slightly worse:
square
From a superficial view is already obvious that PSE-ASM is has less ops.
So I just wonder if anyone has done a deep analysis on that. As from a short check, looks like is not worth even considering it.
I came across https://github.com/iden3/ffiasm and wondered if this asm code has ever been benched against the actual implementation. And if so, whether it is faster.
I did some initial exploration and saw that most of the asm backend we have at PSE (see here) is as optimized as what rust here compiles too. (At least for fns like
double
as seen in: https://github.com/zcash/pasta_curves/pull/44#issuecomment-1407313926From a quick look, to functions like
double
orsquare
looks like the exact same thing or even slightly worse:Square
Double
From a superficial view is already obvious that PSE-ASM is has less ops.
So I just wonder if anyone has done a deep analysis on that. As from a short check, looks like is not worth even considering it.