law pl

lawful-bytes@0.1.1.0 · proof_fast_word.bend:197

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_core.bend as C

197# The first word for a start place a (0 to 3, given as r).
198law pl:
199  for +w: U32
200  for +c: U32
201  for +a: U32
202  for +r: Nat
203  for +hc: {U32.is_lt(c, 256) == True{} : Bool}
204  for +hr: {U32.to_nat(a) == r : Nat}
205  for +hlt: {Nat.is_lt(r, 4n) == True{} : Bool}
206  {P0(U32.or(U32.xor(w, FA.rep(c)), U32.not(U32.shln(4294967295, U32.to_nat(U32.shln(a, 3n)))))) == Nat.add(U32.to_nat(a), D.run_len(List.drop(&2, U32, C.L4(w), U32.to_nat(a)), c)) : Nat}