๐ Researching zkEVM can be a real pain if you don't understand the technology.
Are you ready to be the pioneer in discovering the alpha?
Let's break down Zero-Knowledge Proofs in simple words!
๐
๐ท ZK-rollup technology has been gaining more and more attention lately:
Solving data privacy concerns and increasing decentralization, this mechanism offers interesting developments.
Let's find out how it works.โฌ๏ธ
๐ท What is a zero-knowledge proof?
In this ingenious method, the Prover can provide evidence to the Verifier without compromising their privacy.
It's a way for someone to prove they know something without giving any specifics.
๐ท ZKP has 3 conditions:
Completeness - honest verifier convinced if statement is true.
Soundness - dishonest prover can't convince honest verifier of false statement.
Zero knowledge - verifier knows nothing beyond truth of statement.
๐ท The simplest example.
Suppose Prover and Verifier meet outside a house with a closed door inside.
Prover needs to prove to Verifier that he has the key to the door.
๐ท The first one to enter the house, Prover selects a route that leads to a closed door.
๐ท Now Verifier enters the house and asks Prover to come out of side 1.
๐ทImagine this scenario:
Prover doesn't have a key to the door, but he tries to cheat.
With a 50/50 chance he randomly chooses side 1.
Verifier could ask him to come out of side 1 and then Prover would not have to open the door.
๐ท If you do the experiment 100 times:
โข The probability of Prover succeeding on all 100 attempts is almost zero (1/2)^100 = 0.000000000788.
โข Prover can prove to Verifier that they possess the key by successfully exiting the door on the correct side at all 100 times.
๐ฐ You are now covered! Good luck finding Alpha!
