Triton is a virtual machine that comes with Algebraic Execution Tables (AET) and Arithmetic Intermediate Representations (AIR) for use in combination with a STARK proof system.
I finished a first draft for documentation on the validity rules for transactions here. It highlights one important issue and anticipates a solution.
The issue is this: with the current Triton VM, we cannot generate a single-proof for a transaction without recursion, even if all parts not related to recursion are an order of magnitude less complex. In particular, we need to prove, for every lock script and type script, that those scripts halt gracefully.
The anticipated solution is this: generate a single-proof for multiple claims. If memory serves, Ferdinand had articulated the idea a while ago. The integrity of the AET implies the truth of not one but several claims.
I finished a first draft for documentation on the validity rules for transactions here. It highlights one important issue and anticipates a solution.
The issue is this: with the current Triton VM, we cannot generate a single-proof for a transaction without recursion, even if all parts not related to recursion are an order of magnitude less complex. In particular, we need to prove, for every lock script and type script, that those scripts halt gracefully.
The anticipated solution is this: generate a single-proof for multiple claims. If memory serves, Ferdinand had articulated the idea a while ago. The integrity of the AET implies the truth of not one but several claims.