law push_eq_t

lawful-bytes@0.1.1.0 · proof_ops.bend:131

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/bytes.bend as B
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-words@0.1.0.0/defs.bend as W
import lawful-arrays@0.1.0.0/proof_tree.bend as P
import lawful-arrays@0.1.0.0/proof_index.bend as I

131law push_eq_t:
132  for +len: U32
133  for +t: P.Tree<U32>
134  for +v: U32
135  {B.push(C.BT(len, t), v) == C.BT((len + 1 : U32), I.set_tree(U32, t, (len >> 2n : U32), W.put_byte(C.WD(t, (len >> 2n : U32)), U32.to_nat((len .&. 3 : U32)), v))) : D.Bytes}