def ModInverse.inverse

bend-collections-laws-crypto@1.0.0.0 · spec/math/natural.bend:259

import Base
import bend-collections-laws-crypto@1.0.0.0/src/math/natural.bend as M

259def ModInverse.inverse(+a: Nat, +mp: Nat, +x: Nat, +h: {M.mod_inverse(a, 1n+mp) == Done{x} : Result<&2, &2, M.MathError, Nat>}) -> Type:
260  {Nat.mod(Nat.mul(a, x), 1n+mp) == Nat.mod(1n, 1n+mp) : Nat}