mirror of
https://github.com/codex-storage/constantine.git
synced 2025-01-15 21:44:15 +00:00
5806cc4638
* consistent naming for dbl-width * Isolate double-width Fp2 mul * Implement double-width complex multiplication * Lay out Fp4 double-width mul * Off by p in square Fp4 as well :/ * less copies and stack space in addition chains * Address https://github.com/mratsim/constantine/issues/154 partly * Fix #154, faster Fp4 square: less non-residue, no Mul, only square (bit more ops total) * Fix typo * better assembly scheduling for add/sub * Double-width -> Double-precision * Unred -> Unr * double-precision modular addition * Replace canUseNoCarryMontyMul and canUseNoCarryMontySquare by getSpareBits * Complete the double-precision implementation * Use double-precision path for Fp4 squaring and mul * remove mixin annotations * Lazy reduction in Fp4 prod * Fix assembly for sum2xMod * Assembly for double-precision negation * reduce white spaces in pairing benchmarks * ADX implies BMI2
130 lines
3.4 KiB
Nim
130 lines
3.4 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/[unittest, times],
|
|
# Internal
|
|
../constantine/arithmetic,
|
|
../constantine/io/[io_bigints, io_fields],
|
|
../constantine/config/[curves, common, type_bigint],
|
|
# Test utilities
|
|
../helpers/prng_unsafe
|
|
|
|
const Iters = 24
|
|
|
|
var rng: RngState
|
|
let seed = uint32(getTime().toUnix() and (1'i64 shl 32 - 1)) # unixTime mod 2^32
|
|
rng.seed(seed)
|
|
echo "\n------------------------------------------------------\n"
|
|
echo "test_fr xoshiro512** seed: ", seed
|
|
|
|
proc sanity(C: static Curve) =
|
|
test "Fr: Squaring 0,1,2 with "& $Fr[C] & " [FastSquaring = " & $(Fr[C].getSpareBits() >= 2) & "]":
|
|
block: # 0² mod
|
|
var n: Fr[C]
|
|
|
|
n.fromUint(0'u32)
|
|
let expected = n
|
|
|
|
# Out-of-place
|
|
var r: Fr[C]
|
|
r.square(n)
|
|
# In-place
|
|
n.square()
|
|
|
|
check:
|
|
bool(r == expected)
|
|
bool(n == expected)
|
|
|
|
block: # 1² mod
|
|
var n: Fr[C]
|
|
|
|
n.fromUint(1'u32)
|
|
let expected = n
|
|
|
|
# Out-of-place
|
|
var r: Fr[C]
|
|
r.square(n)
|
|
# In-place
|
|
n.square()
|
|
|
|
check:
|
|
bool(r == expected)
|
|
bool(n == expected)
|
|
|
|
block: # 2² mod
|
|
var n, expected: Fr[C]
|
|
|
|
n.fromUint(2'u32)
|
|
expected.fromUint(4'u32)
|
|
|
|
# Out-of-place
|
|
var r: Fr[C]
|
|
r.square(n)
|
|
# In-place
|
|
n.square()
|
|
|
|
check:
|
|
bool(r == expected)
|
|
bool(n == expected)
|
|
|
|
proc mainSanity() =
|
|
suite "Fr: Modular squaring is consistent with multiplication on special elements" & " [" & $WordBitwidth & "-bit mode]":
|
|
sanity BN254_Snarks
|
|
sanity BLS12_381
|
|
|
|
mainSanity()
|
|
|
|
proc randomCurve(C: static Curve) =
|
|
let a = rng.random_unsafe(Fr[C])
|
|
|
|
var r_mul, r_sqr: Fr[C]
|
|
|
|
r_mul.prod(a, a)
|
|
r_sqr.square(a)
|
|
|
|
doAssert bool(r_mul == r_sqr)
|
|
|
|
proc randomHighHammingWeight(C: static Curve) =
|
|
let a = rng.random_highHammingWeight(Fr[C])
|
|
|
|
var r_mul, r_sqr: Fr[C]
|
|
|
|
r_mul.prod(a, a)
|
|
r_sqr.square(a)
|
|
|
|
doAssert bool(r_mul == r_sqr)
|
|
|
|
proc random_long01Seq(C: static Curve) =
|
|
let a = rng.random_long01Seq(Fr[C])
|
|
|
|
var r_mul, r_sqr: Fr[C]
|
|
|
|
r_mul.prod(a, a)
|
|
r_sqr.square(a)
|
|
|
|
doAssert bool(r_mul == r_sqr)
|
|
|
|
suite "Fr: Random Modular Squaring is consistent with Modular Multiplication" & " [" & $WordBitwidth & "-bit mode]":
|
|
test "Random squaring mod r_BN254_Snarks [FastSquaring = " & $(Fr[BN254_Snarks].getSpareBits() >= 2) & "]":
|
|
for _ in 0 ..< Iters:
|
|
randomCurve(BN254_Snarks)
|
|
for _ in 0 ..< Iters:
|
|
randomHighHammingWeight(BN254_Snarks)
|
|
for _ in 0 ..< Iters:
|
|
random_long01Seq(BN254_Snarks)
|
|
|
|
test "Random squaring mod r_BLS12_381 [FastSquaring = " & $(Fr[BLS12_381].getSpareBits() >= 2) & "]":
|
|
for _ in 0 ..< Iters:
|
|
randomCurve(BLS12_381)
|
|
for _ in 0 ..< Iters:
|
|
randomHighHammingWeight(BLS12_381)
|
|
for _ in 0 ..< Iters:
|
|
random_long01Seq(BLS12_381)
|