DAL integration#| octez.tezos.com
There's this thing called a Kate polynomial commitment, which is a polynomial commitment primitive that makes use of pairings. There's an excellent post from Dankrad which I would recommend reading instead of this post. I wrote this as a shorter summary of how you can commit to a polynomial, and then prove any evaluation $f(x) = y$. Here's how it works: You have a polynomial $f(x) = x^2 + 3x$ and ...| cryptologie.net
Introduction Over the last decade, SNARKs (succinct, non-interactive arguments of knowledge) and STARKs (scalable, transparent arguments of knowledge) have been gaining attention due to their applications in verifiable private computation and scalability of blockchains. Groth introduced this proof system in 2016 and saw an early application in ZCash. The protocol| LambdaClass Blog
Learn about Proto-Danksharding and Danksharding - two sequential upgrades for scaling Ethereum.| ethereum.org
原文链接： KZG Polynomial Commitments| Dankrad Feist
Multiproof scheme for polynomial commitments| Dankrad Feist
中文版本: 内积证明| Dankrad Feist