law hv0

lawful-bytes@0.1.1.0 · proof_fast_find.bend:693

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-arrays@0.1.0.0/proof_tree.bend as P

693# The first byte of the next word starts a fresh search.
694law hv0:
695  for +t: P.Tree<U32>
696  for +wi: U32
697  for +c: U32
698  for +hc: {U32.is_lt(c, 256) == True{} : Bool}
699  {FW.P0(U32.xor(C.WD(t, wi), FA.rep(c))) == Nat.add(0n, D.run_len(AW(t, wi, 0n), c)) : Nat}