REVIEW 2 cited by
A Review of zk-SNARKs
Not yet reviewed by Pith; the record is open.
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
read the original abstract
A zk-SNARK is a protocol that lets one party, the prover, prove to another party, the verifier, that a statement about some privately-held information is true without revealing the information itself. This paper describes technical foundations, current applications, and some novel applications of zk-SNARKs. Regarding technical foundations, we go over the Quadratic Arithmetic Program reduction and the Pinocchio protocol. We then go over financial security applications like Zcash and Tornado Cash, and zk-Rollup applications like zkEVM and Darkforest. We propose novel zk-SNARK protocols for private auctions and decentralized card games on the blockchain, providing code for the proposed applications. We conclude by touching on promising zk-SNARK innovations, such as zk-STARKs.
Forward citations
Cited by 2 Pith papers
-
Engineering Trustworthy Machine-Learning Operations with Zero-Knowledge Proofs
A systematic review of 57 ZKP-for-ML papers concludes that inference verification dominates the field and that research is converging toward a unified ZKMLOps framework for trustworthy, auditable AI.
-
Dynamic Fraud Proof
A proposed optimistic rollup mechanism replaces the long challenge window with a short, randomly sampled approval quorum and exponential timeouts, but the security argument for keeping the single-honest-node guarantee...
Discussion (0). Continue with ORCID to comment.