1/ It’s a brand new day to properly understand Zero-Knowledge Proofs (ZKP) and what they entail.
Today, let's dive into a scenario between two friends, Peggy and Victor.
2/ Peggy wants to prove to Victor that he holds two balls of different colors, but Victor is colorblind.
To us, it may seem impossible to prove this to Victor, but to Peggy, it can be done.
3/ This scenario is similar to how ZKPs work in reality: through an interactive series of events between the prover and verifier, which increases the probability of the outcome of the proof.
This is known as interactive ZKP.
4/ There is also non-interactive ZKP, which is more computational.
In this type of ZKP, the prover only needs to prove to the verifier once that a statement is accurate.
5/ On a sunny Sunday, Peggy and Victor went out for some fun.
They played table tennis with two balls, a white one and a red one.
However, because Victor is colorblind, he can only see the two balls as white.
Peggy kept winning even when they used both the white and red ball
6/ Victor became angry, thinking the white ball was faulty.
He asked Peggy to change the ball.
Peggy explained to him that there were a white and red ball, and that at least one of them wouldn't be faulty.
Victor didn't believe him,
7/ so Peggy had to show him that the two balls were different colors.
Peggy's task is to prove to Victor (the verifier) that the two balls are different colors and nothing else.
He will not reveal which one is white and which one is red.
8/ Peggy gives the two balls to Victor.
Victor places them behind his back, brings one out, and displays it, then places it back and randomly reveals one of the two balls.
Victor asks Peggy if he has switched the ball.
9/ Peggy will use his ability to see the difference in color to correctly guess whether or not Victor switched the balls with a higher than 50% probability; this means that if the two balls were the same color and indistinguishable,…
10/…Peggy would only be able to guess correctly 50% of the time by chance alone.
This is a way to prove that the balls are differently colored without revealing which one is white and which one is red.
11/ By repeatedly doing this process, the probability of guessing correctly by chance decreases while the probability of guessing correctly based on the color difference increases.
12/ This will convince Victor that the balls are differently colored even though he can't see the color difference.
The above is a Zero-Knowledge proof because it exhibits the following three properties of ZKP: Completeness, Soundness, and Zero-Knowledge.
13/ Completeness: if this process is repeated to Victor multiple times, he becomes convinced.
Soundness: there's a 0% chance that Peggy guessed correctly at all times by chance alone.
Zero-Knowledge: Victor gains no knowledge of which ball is white or red.
14/ In conclusion, ZKPs allow for a verifier to be convinced of a statement's accuracy without revealing any additional information.
15/ This scenario shows how Peggy was able to prove to Victor that he had two differently colored balls without revealing which one was white and which one was red, using an interactive series of events, increasing the probability of the outcome of the proof.
1/ A zkEVM is a virtual machine that runs on the Ethereum network and helps verify the correctness of smart contracts (programs stored on a blockchain) using zero-knowledge proofs.
2/ A Zero-Knowledge proof (ZKP) is a way of showing that a data is true without revealing any extra information.
At the start, Sidechains were thought to be an experiment, but today Sidechain technology has brought so much value to the Ethereum ecosystem (eg Polygon POS)
Here’s all you need to know on Sidechains
A thread 🧵
Off-chain transactions help to avoid congestion in the Ethereum network.
Off-chain solutions include L2s and sidechains; these solutions help Ethereum scale.
However, L2s inherit Ethereum L1 security while scaling it; sidechains, on the other hand, rely on their own security
1/ In this thread, we’ll talk about sidechains and their technology.
Sidechains are EVM-independent blockchains that employ their own consensus algorithm and block parameter structure and are connected to the Ethereum mainnet by a two-way bridge.