law reify

bend-collections@1.0.0.0 · proofs/crypto/sha/packed/packed_array_proof.bend:13

import Base

13# Consume any linear array once, retaining a proof of its exact representation.
14law reify:
15  for a: Array<U32>
16  Sigma<&2,&1,Tree,t => {a == thaw(t) : Array<U32>}>