law blocks_step_reified

bend-collections@1.0.0.0 · proofs/crypto/sha/packed/packed_proof.bend:816

import Base
import bend-collections@1.0.0.0/proofs/crypto/sha/packed/packed_array_proof.bend as A
import bend-collections@1.0.0.0/src/crypto/sha/packed/packed.bend as P
import bend-collections@1.0.0.0/spec/crypto/sha/packed.bend as R
import bend-collections@1.0.0.0/src/crypto/sha/state.bend as S

816law blocks_step_reified:
817  for +p: Nat
818  for +extra: Nat
819  for +index: U32
820  for +remain: Nat
821  for +total: Nat
822  for -a: Array<U32>
823  for +s: S.State
824  for view: Sigma<&2,&1,A.Tree,t => {a == A.thaw(t) : Array<U32>}>
825  for recurse: @pair: (Array<U32> & S.State) -> {P.blocks(extra,p,U32.add(index,16),remain,total,pair) == R.blocks(extra,p,U32.add(index,16),remain,total,pair) : Array<U32> & S.State}
826  {P.blocks(extra,1n+p,index,remain,total,(a,s)) == R.blocks(extra,1n+p,index,remain,total,(a,s)) : Array<U32> & S.State}