mirror of
https://github.com/codex-storage/constantine.git
synced 2025-01-12 03:54:14 +00:00
e5612f5705
* unoptimized msm * MSM: reorder loops * add a signed windowed recoding technique * improve wNAF table access * use batchAffine * revamp EC tests * MSM signed digit support * refactor MSM: recode signed ahead of time * missing test vector * refactor allocs and Alloca sideeffect * add an endomorphism threshold * Add Jacobian extended coordinates * refactor recodings, prepare for parallelizable on-the-fly signed recoding * recoding changes, introduce proper NAF for pairings * more pairings refactoring, introduce miller accumulator for EVM * some optim to the addchain miller loop * start optimizing multi-pairing * finish multi-miller loop refactoring * minor tuning * MSM: signed encoding suitable for parallelism (no precompute) * cleanup signed window encoding * add prefetching * add metering * properly init result to infinity * comment on prefetching * introduce vartime inversion for batch additions * fix JacExt infinity conversion * add batchAffine for MSM, though slower than JacExtended at the moment * add a batch affine scheduler for MSM * Add Multi-Scalar-Multiplication endomorphism acceleration * some tuning * signed integer fixes + 32-bit + tuning * Some more tuning * common msm bench + don't use affine for c < 9 * nit
58 lines
1.6 KiB
Nim
58 lines
1.6 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/math/config/curves,
|
||
../constantine/math/extension_fields,
|
||
# Helpers
|
||
./bench_fields_template
|
||
|
||
# ############################################################
|
||
#
|
||
# Benchmark of 𝔽p2 = 𝔽p[𝑖]
|
||
#
|
||
# ############################################################
|
||
|
||
|
||
const Iters = 1_000_000
|
||
const InvIters = 1000
|
||
const AvailableCurves = [
|
||
# Pairing-Friendly curves
|
||
BN254_Nogami,
|
||
BN254_Snarks,
|
||
BLS12_377,
|
||
BLS12_381
|
||
]
|
||
|
||
proc main() =
|
||
separator()
|
||
staticFor i, 0, AvailableCurves.len:
|
||
const curve = AvailableCurves[i]
|
||
addBench(Fp2[curve], Iters)
|
||
subBench(Fp2[curve], Iters)
|
||
negBench(Fp2[curve], Iters)
|
||
ccopyBench(Fp2[curve], Iters)
|
||
div2Bench(Fp2[curve], Iters)
|
||
smallSeparator()
|
||
mulBench(Fp2[curve], Iters)
|
||
sqrBench(Fp2[curve], Iters)
|
||
smallSeparator()
|
||
mul2xUnrBench(Fp2[curve], Iters)
|
||
sqr2xUnrBench(Fp2[curve], Iters)
|
||
rdc2xBench(Fp2[curve], Iters)
|
||
smallSeparator()
|
||
invBench(Fp2[curve], InvIters)
|
||
invVartimeBench(Fp2[curve], InvIters)
|
||
isSquareBench(Fp2[curve], InvIters)
|
||
sqrtBench(Fp2[curve], InvIters)
|
||
separator()
|
||
|
||
main()
|
||
notes()
|