Staged Multi-step UTXO Workflows via Recursive Invariants
Paper proposes recursive invariants, a transaction-level logic and typed DSL, to enforce multi-step UTXO workflow rules without shared mutable state.
The paper introduces Recursive Invariants (RIs), transaction-level predicates over inputs and indexed successor positions that carry multi-step workflow rules forward via repeated one-step checking. A statically typed DSL with three-valued semantics (true/false/unknown) defers future-dependent obligations until they become checkable at validation time. The authors formalize UTXO validation and ledger extension, prove the deduction system sound, and implement a prototype interpreter benchmarked on six workloads and six practice-motivated case studies showing roughly linear cumulative validation-cost growth.
- Recursive Invariants express multi-step UTXO workflow rules as transaction-level predicates
- Three-valued DSL semantics defers future-dependent obligations until checkable
- Deduction system proven sound for validation and ledger extension
- Prototype toolchain benchmarked on six workloads and case studies
From the original article
1 min read at arxiv.orgStateless UTXO-style execution validates transactions using local and referenced data, enabling parallel validation and predictable serialized-size/weight accounting. Multi-step workflows thread state across outputs, and a prepared next-step transaction may become stale if another valid spend confirms first.
By Shuyang Tang · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.