Pith. sign in

REVIEW 1 cited by

Proof of Sampling: A Nash Equilibrium-Based Verification Protocol for Decentralized Systems

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 2405.00295 v3 pith:XM4S2A57 submitted 2024-05-01 cs.GT

Yue Zhang , Shouqiao Wang , Sijun Tan , Xiaoyuan Liu , Ciamac C. Moallemi , Raluca Ada Popa This is my paper · ORCID
classification cs.GT
keywords protocoldecentralizedpospapplicationsnashproofverificationequilibrium-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper introduces the Proof of Sampling (PoSP) protocol, a Nash Equilibrium-based verification mechanism, and its application to decentralized machine learning inference through spML. Our protocol has a pure strategy Nash Equilibrium, compelling rational participants to act honestly. It economically disincentivizes dishonest behavior, making it costly for participants to compromise the network's integrity. In our spML protocol, we apply PoSP to decentralized inference for AI applications via a novel cryptographic protocol. The resulting protocol is much more efficient than zero knowledge proof based approaches. Moreover, we anticipate that the PoSP protocol could be effectively utilized for designing verification mechanisms within Actively Validated Services (AVS) in restaking solutions. We further expect that the PoSP protocol could be applied to a variety of other decentralized applications. Our approach enhances the reliability and efficiency of decentralized systems, paving the way for a new generation of decentralized applications.

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. TAO: Tolerance-Aware Optimistic Verification for Floating-Point Neural Networks

    cs.CR 2025-10 conditional novelty 7.0 of 10

    A tolerance-aware optimistic verification protocol makes floating-point neural-network inference verifiable on heterogeneous GPUs by accepting outputs within per-operator error bounds and resolving disputes via a Merk...

Pith tools