paint-brush
KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemesby@sin7y
4,868 reads
4,868 reads

KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemes

by Sin7Y3mSeptember 7th, 2021
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

Polynomial Commitment (PC) is a commitment to a certain polynomial P, and the committer can prove that the value at a certain point z satisfies P(z) = a through a proof. Different PC schemes result in different ZKP algorithms with different properties, efficiency, and security. This article will compare the differences between the above PC schemes from different perspectives. Table 1 shows the computation forms of common PCs. Table 2 lists the advantages and disadvantages of each PC schemes. Table 3 shows the performance indicators corresponding to each PC.

Company Mentioned

Mention Thumbnail
featured image - KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemes
Sin7Y HackerNoon profile picture
Sin7Y

Sin7Y

@sin7y

Sin7Y is a tech team that explores layer 2, cross-chain, ZK, and privacy computing. #WHAT IS HAPPENING IN BLOCKCHAIN#

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

About Author

Sin7Y HackerNoon profile picture
Sin7Y@sin7y
Sin7Y is a tech team that explores layer 2, cross-chain, ZK, and privacy computing. #WHAT IS HAPPENING IN BLOCKCHAIN#

TOPICS

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite
Journalducoin
Scrapbox
Allella
Runonflux
Aandds
Moomoo
Github
Thecryptonews
Learnrepo
Github
Lonerapier