How to verify computation with a rational network
This addresses the challenge of ensuring trust and efficiency in outsourced computation, particularly for optimization problems, though it appears incremental as it builds on existing verification methods.
The paper tackles the problem of verifying outsourced computation securely and efficiently by introducing a protocol that uses an interactive game between prover and challenger to minimize verification overhead, with financial incentives to deter fake participants.
The present paper introduces a practical protocol for provably secure, outsourced computation. Our protocol minimizes overhead for verification by requiring solutions to withstand an interactive game between a prover and challenger. For optimization problems, the best or nearly best of all submitted solutions is expected to be accepted by this approach. Financial incentives and deposits are used in order to overcome the problem of fake participants.