FE-based covenants use a function f to sign only transactions that comply with a specified spending policy. The general version, f(k, tx, program, proof), is more expressive than OP_CTV and can rely on a zero-knowledge proof to verify a complex condition without requiring a costly general-purpose interpreter. The proof can also allow a spending policy to depend on external data, including the result of an off-chain computation. However, compact functional encryption is at least as difficult to construct as indistinguishability obfuscation, and existing demonstrations remain far from practical use on Bitcoin. CTV-style opcodes are substantially more efficient but require a base-layer protocol change.
Source: Read the original article


