law kr64_correct

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

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/sha/state.bend as S
import bend-collections-laws-crypto@1.0.0.0/src/crypto/sha/core.bend as C

659# Each literal-constant round refines one step of window_rounds over the
660# remaining FIPS constants; the window variables stay abstract, so every proof
661# is one unfolding followed by the next round's lemma.
662law kr64_correct:
663  for +q: Nat
664  for +win: C.ShaWindow
665  for +s: S.State
666  {C.kr64(q, win, s) == C.window_rounds(q, win, Nil{}, s) : S.State}