W64.inv_step: def of bend-collections-laws-math@1.0.0.0
Import: import bend-collections-laws-math@1.0.0.0/src/math/w64.bend as W64
Lines 579-581 of bend-collections-laws-math@1.0.0.0/src/math/w64.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-math@1.0.0.0/src/math/w64.bend&start_line=579&end_line=581

import Base
import bend-collections-laws-math@1.0.0.0/src/math/u64.bend as W

# x (2 - m x): doubles the correct low bits of an inverse of m mod 2^64
def inv_step(+m: W.U64, +x: W.U64) -> W.U64:
  mul(x, sub(W.U64{2, 0}, mul(m, x)))

Uses (3):
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/src/math/u64.bend&name=U64
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/src/math/w64.bend&name=mul
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/src/math/w64.bend&name=sub