law mod_shift

bend-collections@1.0.0.0 · proofs/crypto/sha/packed/conformance.bend:632

import Base

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