Right now, you have to share your birthdate, and your ID also happens to have tons of other personal information on it. Let’s say you go to a bar and have to prove to the bartender that you’re over the legal drinking age in your country. One way of understanding this is the use case of proving your age. In all these scenarios, we need to guarantee that we know some secret data, and that this data satisfies a requirement. Zero knowledge proofs are important for blockchains to function, as they allow them to utilize secret information on otherwise public system with no compromises to the system security.Īgain, a simple example of it can be that users do not want to revel their private keys every time they sign a transaction, or a more complex example would be where voters do not want to reveal who they voted for. This is why testing random options is extremely important in ZK proofs. Then she wouldn’t have to go through the magic door and take path A, and therefore he wouldn’t be able to prove that she knows the secret word. Let’s say Victor only shouted path B, and that happened to be the one that Peggy entered through. If they keep doing this over and over, Victor can conclude that it’s extremely likely that Peggy does in fact know the secret word to get through the door. The fact that she can come outside through both ways shows that she can go in and out of the magic door in the back that separates them, and therefore knows the secret word. He shouts the name of the paths at random and Peggy has to come outside using that path. So, they label the two paths in and out of the cave-A and B-and Victor stands outside the cave. Victor wants to know if Peggy knows the secret word, but Peggy doesn’t want to tell him the word. Peggy knows the secret word to open the door, which means she can go in and out of the cave freely through either pathway in the ring-shaped cave. There is a magic door in the back blocking the other path that can only be opened with a secret word. In the story, there is a cave shaped like a ring, with two paths to get to the back.
Peggy is the prover and Victor is the verifier. One common way of understanding how it works is the example of the Ali Baba cave described by Jean-Jacques Quisquater in a paper published in 1990. Zero-knowledge: the verifier learns nothing about the secret statement other than if it’s true or false.Knowledge Soundness: it is impossible to fool the protocol to verify a proof when you do not know the secret information.Completeness: the protocol always returns “true.”.For example, you use ZK proofs every time you sign an on-chain transaction: you prove that you possess the private key to your wallet without revealing what the private key is.Įvery valid ZK proof must satisfy these criteria: You use some simple ZK systems every day in web3. They were first invented in 1985 and used for small problems, but due to the inefficiency of the applications, it was hard to build substantial solutions until the introduction of SNARKs in the early 2010’s. ZK proofs use a combination of number theory, advanced mathematics, and cryptography. Zero knowledge adds a layer of privacy on top of that.Ī zero knowledge proof is the ability of a person to prove information (the prover) to someone else (the verifier) that they possess information without actually revealing the information to the verifier. You essentially prove that you did some type of computation correctly. What are Zero Knowledge Proofs?Ī proof is when someone proves a fact to someone else. So, we talked to one of our ZK research engineers right here in Aragon to learn about Zero knowledge proofs and how DAOs can use them to build private organizations. Regardless of the challenges in this nascent space, we see tons of possibilities for how this ZK technology can be applied to DAOs. This pace of innovation and divergent approaches in the ZK world is exciting, but also challenging. Now, everyone can create their own proving systems and their own languages, but there’s no dominant solution in the market.” “Back then, everyone could create their own processor. Zero knowledge proofs today “can be compared to how the space of computers looked in the 70’s,” said Artem, research engineer for the Aragon Zero Knowledge Guild on a Twitter space.
0 kommentar(er)
