def TF
lawful-bytes@0.1.1.0 · proof_fast_append.bend:1213
import lawful-bytes@0.1.1.0/proof_fast_append.bend as ProofFastAppend
import Base
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P
1213def TF(+ld: U32, +ts: P.Tree<U32>, +s: U32, +n: U32, +l1: U32, +t1: P.Tree<U32>) -> P.Tree<U32>:
1214 AWT(NW(ld, n), ts, U32.add(U32.shrn(QQ(ld, s, n), 2n), 1), C.WD(ts, U32.shrn(QQ(ld, s, n), 2n)), t1, U32.shrn(QQ(ld, s, n), 2n), U32.shrn(l1, 2n), SH(QQ(ld, s, n)))