3 ms·

>When you use ZK, you are issuing the proof AND have knowledge of the inputs. The prover needs to know the inputs, but does not need to reveal them to the verif

>When you use ZK, you are issuing the proof AND have knowledge of the inputs. The prover needs to know the inputs, but does not need to reveal them to the verifier (which happens on chain). Can you elaborate more on this? What is this a ZKP proof for? That the transaction is valid? Also from all the ZKP examples I've seen in crypto[graphy] class, soundness relies on the ability to repeat the process again and again. How does this work for the blockchain case where it seems like there's only one round of communication between prover/verifier?

shakow 4y ago
ZK rollups/EVMs are one among the myriad of arguably badly named things in maths & CS. They are named so because they are an implementation of what is called ZK proofs, but they leverage them to be able to prove a succession of modifications of the state (i.e. the accounts and their money) in a quick & easy way to check. As a simplification, you may think of them as a hash of transactions & smart contract executions that are a tad expensive to compute, but trivial to check. The end goal typically being to multiplex multiple level-2 transactions onto a single Ethereum transaction to enhance bandwidth and reduce fees. However, they are not ZK in the applied sense of it; e.g. they do not even try to mask the operations; anyone could rebuild them themselves with a bit of effort.