def WL
import lawful-bytes@0.1.1.0/proof_core.bend as ProofCoreimport Base
import lawful-arrays@0.1.0.0/defs.bend as A
import lawful-arrays@0.1.0.0/proof_tree.bend as P
22# The words of the block.
23def WL(+t: P.Tree<U32>) -> List<&2, U32>:
24 A.view(U32, P.fromT(U32, t))