mirror of
https://github.com/status-im/constantine.git
synced 2025-02-23 17:38:09 +00:00
c04721a04e
* Mention that the inverse of 0 is 0 (TODO tests) * Introduce "Higher-Kinded tower extensions" * rename isCOmplexExtension -> fromComplexExtension * update benchmarks with the new tower scheme * Try to recover some speed on mul/squaring for an optimal tower (but this was not it)
58 lines
1.7 KiB
Nim
58 lines
1.7 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,
|
||
../constantine/towers,
|
||
# Helpers
|
||
../helpers/static_for,
|
||
./bench_fields_template,
|
||
# Standard library
|
||
std/strutils
|
||
|
||
# ############################################################
|
||
#
|
||
# 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
|
||
# BN446,
|
||
# FKM12_447,
|
||
# BLS12_461,
|
||
# BN462
|
||
]
|
||
|
||
proc main() =
|
||
echo "-".repeat(80)
|
||
staticFor i, 0, AvailableCurves.len:
|
||
const curve = AvailableCurves[i]
|
||
addBench(Fp2[curve], Iters)
|
||
subBench(Fp2[curve], Iters)
|
||
negBench(Fp2[curve], Iters)
|
||
mulBench(Fp2[curve], Iters)
|
||
sqrBench(Fp2[curve], Iters)
|
||
invBench(Fp2[curve], InvIters)
|
||
echo "-".repeat(80)
|
||
|
||
main()
|
||
|
||
echo "Notes:"
|
||
echo " - GCC is significantly slower than Clang on multiprecision arithmetic."
|
||
echo " - Fast Squaring and Fast Multiplication are possible if there are spare bits in the prime representation (i.e. the prime uses 254 bits out of 256 bits)"
|
||
echo " - The tower of extension fields chosen can lead to a large difference of performance between primes of similar bitwidth."
|