Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | A scalable verification solution for blockchains |
|---|---|
| What the text proposes | Pay a solver to run a heavy computation off-chain, and pay a verifier only when they find a lie. An interactive game narrows the lie to one step. A jackpot is there so verifiers show up even when solvers are usually honest. |
| Who may write | Jason Teutsch and Christian Reitwiessner |
| What is settled | Solvers post results and a deposit. |
| Load-bearing assumption | Interactive games delay finality by the length of the challenge window. |
| What this library says afterwards | The paper's incentive story is delicate. A verifier market that nobody joins does not secure the result. |
| Rights | Official external source only |