STARKs, Part I: Proofs with Polynomialsby@Vitalik

STARKs, Part I: Proofs with Polynomials

tldt arrow
Read on Terminal Reader
Read this story w/o Javascript

Too Long; Didn't Read

ZK-SNARKs are general-purpose succinct zero knowledge proof technology that can be used for all sorts of usecases ranging from verifiable computation to privacy-preserving cryptocurrency. They come with much simpler cryptographic assumptions, avoiding the need for elliptic curves, pairings and the knowledge-of-exponent assumption. This also means that they are secure even against attackers with quantum computers. However, this comes at a cost: the size of a proof goes up from 288 bytes to a few hundred kilobytes.

Companies Mentioned

Mention Thumbnail
Mention Thumbnail

Coins Mentioned

Mention Thumbnail
Mention Thumbnail
featured image - STARKs, Part I: Proofs with Polynomials
Vitalik Buterin HackerNoon profile picture

@Vitalik

Vitalik Buterin

Receive Stories from @Vitalik

react to story with heart

RELATED STORIES

L O A D I N G
. . . comments & more!