How Are zk-SNARKs Possible?by@Vitalik
370 reads

How Are zk-SNARKs Possible?

tldt arrow
Read on Terminal Reader🖨️

Too Long; Didn't Read

Perhaps the most powerful cryptographic technology to come out of the last decade is general-purpose succinct zero knowledge proofs, usually called zk-SNARKs ("zero knowledge succinct arguments of knowledge"). A zk-SNARK allows you to generate a proof that some computation has some particular output, in such a way that the proof can be verified extremely quickly even if the underlying computation takes a very long time to run. The "ZK" ("zero knowledge") part adds an additional feature: the proof can keep some of the inputs to the computation hidden. For example, you can make a proof for the statement "I know a secret number such that if you take the word ‘cow', add the number to the end, and SHA256 hash it 100 million times, the output starts with 0x57d00485aa". The verifier can verify the proof far more quickly than it would take for them to run 100 million hashes themselves, and the proof would also not reveal what the secret number is.

Companies Mentioned

Mention Thumbnail
Mention Thumbnail
featured image - How Are zk-SNARKs Possible?
Vitalik Buterin HackerNoon profile picture

@Vitalik

Vitalik Buterin
react to story with heart

RELATED STORIES

L O A D I N G
. . . comments & more!
Hackernoon hq - po box 2206, edwards, colorado 81632, usa