Compact Multiparty Verification of Simple Computations

We present a compact model for blind multiparty verification of compilation results. By employing a simple incentive scheme, we construct a mechanism, staking a deposit value on the correctness of compiled and deployed byte code. A blind committee of peers evaluate the authenticity of the deployed byte code by re-computing the task, hashing the source and target code into checksums, and submitting bids to the contract. If the evaluation round reveals inconsistencies in the checksums provided by the peers, the contract can be rejected and the deposit shared amongst contenders