def f_mul_b

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/fprot.bend:35

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/field.bend as F

35def f_mul_b(+a: List<&2, Nat>, b: List<&2, Nat>) -> {F.mul_b(a, b) == F.mul_u(a, b) : List<&2, Nat>}:
36  match b:
37    case Nil{}:
38      {==}
39    case y <> u:
40      {==}