law mod_shift

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/sha/conformance.bend:631

import Base

631# Sixty-four divmod steps return to the initial counter state with a larger quotient.
632law mod_shift:
633  for +x: Nat
634  {Nat.mod(Nat.add(64n, x), 64n) == Nat.mod(x, 64n) : Nat}