mirror of
https://github.com/codex-storage/constantine.git
synced 2025-02-08 17:03:30 +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
63 lines
2.1 KiB
Nim
63 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
|
|
# Standard library
|
|
std/[os, times, strformat],
|
|
# Internals
|
|
../../constantine/platforms/abstractions,
|
|
../../constantine/math/[arithmetic, extension_fields, ec_shortweierstrass],
|
|
../../constantine/math/io/io_extfields,
|
|
../../constantine/math/config/curves,
|
|
../../constantine/math/pairings/pairings_bls12,
|
|
# Test utilities
|
|
../../helpers/prng_unsafe
|
|
|
|
# Testing multipairing
|
|
# ----------------------------------------------
|
|
|
|
var rng: RngState
|
|
let timeseed = uint32(toUnix(getTime()) and (1'i64 shl 32 - 1)) # unixTime mod 2^32
|
|
seed(rng, timeseed)
|
|
echo "\n------------------------------------------------------\n"
|
|
echo "test_pairing_bls12_377_multi xoshiro512** seed: ", timeseed
|
|
|
|
proc testMultiPairing(rng: var RngState, N: static int) =
|
|
var
|
|
Ps {.noInit.}: array[N, ECP_ShortW_Aff[Fp[BLS12_381], G1]]
|
|
Qs {.noInit.}: array[N, ECP_ShortW_Aff[Fp2[BLS12_381], G2]]
|
|
|
|
GTs {.noInit.}: array[N, Fp12[BLS12_381]]
|
|
|
|
for i in 0 ..< N:
|
|
Ps[i] = rng.random_unsafe(typeof(Ps[0]))
|
|
Qs[i] = rng.random_unsafe(typeof(Qs[0]))
|
|
|
|
# Simple pairing
|
|
let clockSimpleStart = cpuTime()
|
|
var GTsimple {.noInit.}: Fp12[BLS12_381]
|
|
for i in 0 ..< N:
|
|
GTs[i].pairing_bls12(Ps[i], Qs[i])
|
|
|
|
GTsimple = GTs[0]
|
|
for i in 1 ..< N:
|
|
GTsimple *= GTs[i]
|
|
let clockSimpleStop = cpuTime()
|
|
|
|
# Multipairing
|
|
let clockMultiStart = cpuTime()
|
|
var GTmulti {.noInit.}: Fp12[BLS12_381]
|
|
GTmulti.pairing_bls12(Ps, Qs)
|
|
let clockMultiStop = cpuTime()
|
|
|
|
echo &"N={N}, Simple: {clockSimpleStop - clockSimpleStart:>4.4f}s, Multi: {clockMultiStop - clockMultiStart:>4.4f}s"
|
|
doAssert bool GTsimple == GTmulti
|
|
|
|
staticFor i, 1, 17:
|
|
rng.testMultiPairing(N = i)
|