def dq
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/u32div.bend as U32divimport Base
26def dq(-m: Nat, r: Word(m) & U32) -> Word(m):
27 (q, s) = r
28 q
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/u32div.bend as U32divimport Base
26def dq(-m: Nat, r: Word(m) & U32) -> Word(m):
27 (q, s) = r
28 q