Convenience wrapper around mkJetCMR that operates on u8 bytes instead of u32
Given a well-typed dag representing a Simplicity expression, compute
the annotated Merkle roots of all subexpressions.
Given a well-formed dag[i + 1], set the cmr
field of every node in dag
Compute the CMR of a jet of scribe(v) : ONE |- TWO^(2^n) that outputs a given
bitstring
Fills in the ‘WITNESS’ nodes of a ‘dag’ with the data from ‘witness’
Given the IMR of a jet specification, return the CMR of a jet that implements
that specification
Verifies that the ‘dag’ is in canonical order, meaning that nodes
under the left branches have lower indices than nodes under
Computes the identity Merkle roots of every subexpression in a well-typed ‘dag’ with witnesses .