law suffix_correct
import bend-collections@1.0.0.0/proofs/crypto/sha/packed/conformance.bend as Conformanceimport Base
import bend-collections@1.0.0.0/proofs/crypto/sha/packed/core_model.bend as C
import bend-collections@1.0.0.0/spec/crypto/sha.bend as F
594law suffix_correct:
595 for +n: Nat
596 {C.suffix(n) == F.padding_suffix(n) : List<&2, U32>}