Pith. sign in

REVIEW 1 cited by

How to verify computation with a rational network

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1606.05917 v1 pith:YQ2MN6TB submitted 2016-06-19 cs.GT cs.CRcs.DC

Sanjay Jain , Prateek Saxena , Frank Stephan , Jason Teutsch This is my paper · ORCID
classification cs.GTcs.CRcs.DC
keywords bestcomputationprotocolsolutionsacceptedapproachchallengerdeposits
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A scalable verification solution for blockchains

    cs.CR 2019-08 conditional novelty 7.0 of 10

    TrueBit uses an interactive verification game plus forced-error jackpots to make outsourced computation on Ethereum trustless and scalable.

Pith tools