mirror of
https://github.com/logos-storage/constantine.git
synced 2026-01-02 21:23:11 +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.8 KiB
Nim
58 lines
1.8 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
|
|
std/macros,
|
|
../config/curves,
|
|
../extension_fields,
|
|
./bls12_377_endomorphisms,
|
|
./bls12_381_endomorphisms,
|
|
./bn254_nogami_endomorphisms,
|
|
./bn254_snarks_endomorphisms,
|
|
./bw6_761_endomorphisms,
|
|
./pallas_endomorphisms,
|
|
./vesta_endomorphisms
|
|
|
|
{.experimental: "dynamicBindSym".}
|
|
|
|
macro dispatch(C: static Curve, tag: static string, G: static string): untyped =
|
|
result = bindSym($C & "_" & tag & "_" & G)
|
|
|
|
template babai*(F: typedesc[Fp or Fp2]): untyped =
|
|
## Return the GLV Babai roundings vector
|
|
const G = if F is Fp: "G1"
|
|
else: "G2"
|
|
dispatch(F.C, "Babai", G)
|
|
|
|
template lattice*(F: typedesc[Fp or Fp2]): untyped =
|
|
## Returns the GLV Decomposition Lattice
|
|
const G = if F is Fp: "G1"
|
|
else: "G2"
|
|
dispatch(F.C, "Lattice", G)
|
|
|
|
macro getCubicRootOfUnity_mod_p*(C: static Curve): untyped =
|
|
## Get a non-trivial cubic root of unity (mod p) with p the prime field
|
|
result = bindSym($C & "_cubicRootOfUnity_mod_p")
|
|
|
|
func hasEndomorphismAcceleration*(C: static Curve): bool =
|
|
C in {
|
|
BN254_Nogami,
|
|
BN254_Snarks,
|
|
BLS12_377,
|
|
BLS12_381,
|
|
BW6_761,
|
|
Pallas,
|
|
Vesta
|
|
}
|
|
|
|
const EndomorphismThreshold* = 196
|
|
## We use substraction by maximum infinity norm coefficient
|
|
## to split scalars for endomorphisms
|
|
## For small scalars the substraction will overflow
|
|
##
|
|
## TODO: implement an alternative way to split scalars. |