def neg_v

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/scalarops.bend:136

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/secp256k1/field.bend as FS
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/limbs.bend as L
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/scalar.bend as S
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/limbs.bend as LV
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/fprot.bend as FR
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/consts.bend as K
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/negate.bend as NG

136def neg_v(+one: Nat, +h1: {one == 1n : Nat}, +b: List<&2, Nat>, +hb: {FS.reduced(one, FS.order(one), b) == True{} : Bool}) -> {FS.value(one, S.neg(b)) == FS.mneg(FS.order(one), FS.value(one, b)) : Nat}:
137  %Equal.sym(List<&2, Nat>, S.neg(b), S.neg_u(b), FR.s_neg(b)) : {FS.value(one, _) == FS.mneg(FS.order(one), FS.value(one, b)) : Nat}
138  %Equal.sym(Nat, FS.value(one, S.reduce_u(L.neg_raw(S.c(), b))), Nat.mod(LV.ev(L.neg_raw(S.c(), b)), FS.order(one)), red_v(one, h1, L.neg_raw(S.c(), b), neg_hx(one, h1, b, hb))) : {_ == Nat.mod(Nat.sub(Nat.add(0n, FS.order(one)), Nat.mod(FS.value(one, b), FS.order(one))), FS.order(one)) : Nat}
139  %Equal.sym(Nat, FS.value(one, b), LV.ev(b), LV.ev_value(one, h1, b)) : {Nat.mod(LV.ev(L.neg_raw(S.c(), b)), FS.order(one)) == Nat.mod(Nat.sub(Nat.add(0n, FS.order(one)), Nat.mod(_, FS.order(one))), FS.order(one)) : Nat}
140  %Equal.sym(Nat, FS.order(one), 1n+K.np(one), K.order_eq(one, h1)) : {Nat.mod(LV.ev(L.neg_raw(S.c(), b)), _) == Nat.mod(Nat.sub(Nat.add(0n, FS.order(one)), Nat.mod(LV.ev(b), FS.order(one))), FS.order(one)) : Nat}
141  %Equal.sym(Nat, FS.order(one), 1n+K.np(one), K.order_eq(one, h1)) : {Nat.mod(LV.ev(L.neg_raw(S.c(), b)), 1n+K.np(one)) == Nat.mod(Nat.sub(Nat.add(0n, _), Nat.mod(LV.ev(b), FS.order(one))), FS.order(one)) : Nat}
142  %Equal.sym(Nat, FS.order(one), 1n+K.np(one), K.order_eq(one, h1)) : {Nat.mod(LV.ev(L.neg_raw(S.c(), b)), 1n+K.np(one)) == Nat.mod(Nat.sub(Nat.add(0n, 1n+K.np(one)), Nat.mod(LV.ev(b), _)), FS.order(one)) : Nat}
143  %Equal.sym(Nat, FS.order(one), 1n+K.np(one), K.order_eq(one, h1)) : {Nat.mod(LV.ev(L.neg_raw(S.c(), b)), 1n+K.np(one)) == Nat.mod(Nat.sub(Nat.add(0n, 1n+K.np(one)), Nat.mod(LV.ev(b), 1n+K.np(one))), _) : Nat}
144  NG.sub_mod(K.np(one), 0n, LV.ev(b), LV.ev(L.neg_raw(S.c(), b)), rlt(one, h1, b, hb), negr_e(one, h1, b, hb))