A Field Guide to zkSNARKs Part I: A Primer on Computation

Re:A Field Guide to zkSNARKs Part I: A Primer on Computation by lavrov on Monday May 25, 2020 @02:24AM (#23298526)

Didn’t read the entire post but I think the characterization of PCP’s is a bit off - some SNARK constructions and STARKs both use PCP’s - using a linear PCP vs a PCP doesn’t impact transparency or proof size, that’s more a function of the commitment scheme

[ Parent | on HN ]

Re:A Field Guide to zkSNARKs Part I: A Primer on Computation by madrafi on Monday May 25, 2020 @10:37AM (#23301541)

I meant to skip over PCPs because it would need a separate posts and make the whole longer, I also avoided explicitly mentioning PCPs or SNARKs constructions from PCPs[1] for the same reason. Yes, concluding about the transparency vs proof-size trade-off is a mistake of my part. Thanks for taking the time ! will push an update on that bit soon.

[1]: https://eprint.iacr.org/2012/718.pdf

[ Parent | on HN ]

Re:A Field Guide to zkSNARKs Part I: A Primer on Computation by Ar-Curunir on Monday May 25, 2020 @02:44AM (#23298631)

Yeah, it's a relatively good high level post about SNARKs, but there's some confusion about the role of PCPs in SNARKs.

(all SNARKs have some probabilistic checking at the core; that's how you get succinctness)

[ Parent | on HN ]

Re:A Field Guide to zkSNARKs Part I: A Primer on Computation by madrafi on Monday May 25, 2020 @10:31AM (#23301482)

Author here, I did gloss over PCPs certainly, and agree that SNARKs also use PCPs and I might have made the terrible conclusion about proof sizes. Will push an update soon ! thanks for taking the time.

[ Parent | on HN ]