mirror of
https://github.com/codex-storage/constantine.git
synced 2025-01-18 06:51:04 +00:00
82819b1b10
* Addition chain for sqrt BLS12-381: 20% perf improvement * sqrt addchain for BN254_Snarks - 20% perf improvement as well * Fix operation count [skip ci] * BLS12-377 sqrt - 10% perf improvement * sqrt addition chain for BW6-761 - 6% speedup * BN254_Nogami inversion addchain * sqrt addchain for BN254_Nogami * Inversion addchain for BLS12-377 * inversion ddition chain for BW6-761
71 lines
2.1 KiB
Nim
71 lines
2.1 KiB
Nim
# Constantine
|
||
# Copyright (c) 2018-2019 Status Research & Development GmbH
|
||
# Copyright (c) 2020-Present Mamy André-Ratsimbazafy
|
||
# Licensed and distributed under either of
|
||
# * MIT license (license terms in the root directory or at http://opensource.org/licenses/MIT).
|
||
# * Apache v2 license (license terms in the root directory or at http://www.apache.org/licenses/LICENSE-2.0).
|
||
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
||
|
||
import
|
||
# Internals
|
||
../constantine/config/[curves, common],
|
||
../constantine/arithmetic,
|
||
../constantine/io/io_bigints,
|
||
../constantine/curves/[zoo_inversions, zoo_square_roots],
|
||
# Helpers
|
||
../helpers/static_for,
|
||
./bench_fields_template,
|
||
# Standard library
|
||
std/strutils
|
||
|
||
# ############################################################
|
||
#
|
||
# Benchmark of 𝔽p
|
||
#
|
||
# ############################################################
|
||
|
||
|
||
const Iters = 100_000
|
||
const ExponentIters = 100
|
||
const AvailableCurves = [
|
||
# P224,
|
||
BN254_Nogami,
|
||
BN254_Snarks,
|
||
# Curve25519,
|
||
# P256,
|
||
# Secp256k1,
|
||
BLS12_377,
|
||
BLS12_381,
|
||
BW6_761
|
||
]
|
||
|
||
proc main() =
|
||
separator()
|
||
staticFor i, 0, AvailableCurves.len:
|
||
const curve = AvailableCurves[i]
|
||
addBench(Fp[curve], Iters)
|
||
subBench(Fp[curve], Iters)
|
||
negBench(Fp[curve], Iters)
|
||
ccopyBench(Fp[curve], Iters)
|
||
div2Bench(Fp[curve], Iters)
|
||
mulBench(Fp[curve], Iters)
|
||
sqrBench(Fp[curve], Iters)
|
||
invEuclidBench(Fp[curve], ExponentIters)
|
||
invPowFermatBench(Fp[curve], ExponentIters)
|
||
when curve.hasInversionAddchain():
|
||
invAddChainBench(Fp[curve], ExponentIters)
|
||
when (BaseType(curve.Mod.limbs[0]) and 3) == 3:
|
||
sqrtP3mod4Bench(Fp[curve], ExponentIters)
|
||
when curve.hasSqrtAddchain():
|
||
sqrtAddChainBench(Fp[curve], ExponentIters)
|
||
when curve in {BLS12_377}:
|
||
sqrtTonelliBench(Fp[curve], ExponentIters)
|
||
sqrtTonelliAddChainBench(Fp[curve], ExponentIters)
|
||
# Exponentiation by a "secret" of size ~the curve order
|
||
powBench(Fp[curve], ExponentIters)
|
||
powUnsafeBench(Fp[curve], ExponentIters)
|
||
separator()
|
||
|
||
main()
|
||
notes()
|