law hv02

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:188

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
import lawful-bytes@0.1.1.0/proof_fast_word.bend as FW
import lawful-bytes@0.1.1.0/proof_fast_find.bend as FF
import lawful-arrays@0.1.0.0/proof_tree.bend as P

188# The next word starts a fresh search.
189law hv02:
190  for +t: P.Tree<U32>
191  for +wi: U32
192  for +c1: U32
193  for +c2: U32
194  for +hc1: {U32.is_lt(c1, 256) == True{} : Bool}
195  for +hc2: {U32.is_lt(c2, 256) == True{} : Bool}
196  {Nat.min(FW.P0(U32.xor(C.WD(t, wi), FA.rep(c1))), FW.P0(U32.xor(C.WD(t, wi), FA.rep(c2)))) == Nat.add(0n, D.run_len2(FF.AW(t, wi, 0n), c1, c2)) : Nat}