Author: Christian Decker 2021-02-27 10:02:29
Published on: 2021-02-27T10:02:29+00:00
The use of reversal payments and "option not to release scalar" can possibly express any Boolean logic, enabling complex use-cases. It is trivial to prove that any boolean logic can be expressed by this construction, and a functionally complete set can be built by constructing a NAND, NOR, or {AND, NOT}. The resulting expressions may not be nice and require multiple payments going back and forth between participants. The problem now lies in finding a minimal representation for a given expression to minimize the funds committed to an instance of the expression. Functional completeness is explained as a powerful, non-Turing-complete, and consistent programming language.
Updated on: 2023-06-02T18:50:58.494806+00:00