Paper 2019/1296

FastSwap: Concretely Efficient Contingent Payments for Complex Predicates

Mathias Hall-Andersen

Abstract

FastSwap is a simple and concretely efficient contingent payment scheme for complex predicates, inspired by FairSwap. FastSwap only relies on symmetric primitives (in particular symmetric encryption and cryptographic hash functions) and avoids `heavy-weight' primitives such as general ZKP systems. FastSwap is particularly well-suited for applications where the witness or predicate is large (on the order of MBs / GBs) or expensive to calculate. Additionally FastSwap allows predicates to be implemented using virtually any computational model (including branching execution), which e.g. enables practitioners to express the predicate in smart contract languages already familiar to them, without an expensive transformation to satisfiability of arithmetic circuits. The cost of this efficiency during honest execution is a logarithmic number of rounds during a dispute resolution in the presence of a corrupted party (compared to constant round complexity for existing schemes). Let the witness be of size $$ and the predicate of size $$, where computing $$ takes $$ steps. In the honest case the off-chain communication complexity is $$ for a small constant $$, the on-chain communication complexity is $$ for a small constant $$. In the malicious case the on-chain communication complexity is $$ with small constants. Concretely with suitable optimizations the number of rounds (on-chain transactions) for a computation of $$ steps can be brought to $$ in the honest case with an estimated cost of $$ USD on the Ethereum blockchain and to $$ rounds with an estimated cost of $$ USD in case of a dispute.