law window_rounds_correct

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

import Base
import bend-collections@1.0.0.0/src/crypto/sha/packed/core.bend as Runtime
import bend-collections@1.0.0.0/src/crypto/sha/state.bend as S
import bend-collections@1.0.0.0/proofs/crypto/sha/packed/core_model.bend as C

219law window_rounds_correct:
220  for +q: Nat
221  for +a: U32
222  for +b: U32
223  for +c: U32
224  for +d: U32
225  for +e: U32
226  for +f: U32
227  for +g: U32
228  for +h: U32
229  for +i: U32
230  for +j: U32
231  for +k: U32
232  for +l: U32
233  for +m: U32
234  for +n: U32
235  for +o: U32
236  for +p: U32
237  for +rest: List<&2, U32>
238  for +ks: List<&2, U32>
239  for +s: S.State
240  {C.window_rounds(q, Runtime.W{a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p}, ks, s) ==
241    C.expanded_rounds(q, a <> b <> c <> d <> e <> f <> g <> h <> i <> j <> k <> l <> m <> n <> o <> p <> rest, ks, s) : S.State}