def sq_mod

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/curve25519/mulw.bend:157

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/curve25519/field.bend as FS
import bend-collections-laws-crypto@1.0.0.0/src/crypto/curve25519/field.bend as F
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/word.bend as WD
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/curve25519/limbs.bend as LM

157def sq_mod(+one: Nat, +h1: {one == 1n : Nat}, +pp: Nat, +hP: {Nat.add(1n+pp, 19n) == WD.sc(255n, one) : Nat}, +a: List<&2, U32>, +ha: {LM.okb(32n, a, 255n) == True{} : Bool}) -> {Nat.mod(FS.value(F.sq(a)), 1n+pp) == Nat.mod(Nat.mul(FS.value(a), FS.value(a)), 1n+pp) : Nat}:
158  mul_mod(one, h1, pp, hP, a, a, ha, ha)