def inv_bz

bend-collections-laws-crypto@1.0.0.0 · proofs/math/natural/inverse.bend:140

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

140# the extended-Euclid state mod_inverse(a, m) ends in
141def inv_bz(+a: Nat, +mp: Nat) -> M.Bezout:
142  M.inv_go(1n+mp, 1n+mp, 1n+mp, 0n, Nat.mod(a, 1n+mp), 1n)