arnaucube.com/public/kzg-batch-proof.html
public/kzg-batch-proof.htmlRaw
1<!DOCTYPE html>
2<html lang="en">
3
4 <head>
5 <meta name="description" content="The benefit of batch proof is that allows us to proof multiple points while the proof size remains constant to one G1 point." />
6 <meta charset="utf-8">
7 <title> Batch proof in KZG Commitments - arnaucube - blog</title>
8 <meta name="title" content=" Batch proof in KZG Commitments - arnaucube - blog">
9 <meta name="description" content="The benefit of batch proof is that allows us to proof multiple points while the proof size remains constant to one G1 point.">
10
11 <meta property="og:title" content=" Batch proof in KZG Commitments - arnaucube - blog" />
12 <meta property="og:description" content="The benefit of batch proof is that allows us to proof multiple points while the proof size remains constant to one G1 point." />
13 <meta property="og:url" content="https://arnaucube.com/blog/kzg-batch-proof.html" />
14 <meta property="og:type" content="article" />
15 <meta property="og:image" content="https://arnaucube.com/blog/" />
16 <meta name="twitter:title" content=" Batch proof in KZG Commitments - arnaucube - blog">
17 <meta name="twitter:description" content="The benefit of batch proof is that allows us to proof multiple points while the proof size remains constant to one G1 point.">
18 <meta name="twitter:image" content="https://arnaucube.com/blog/">
19 <meta name="twitter:card" content="summary_large_image">
20 <meta name="author" content="arnaucube">
21
22 <meta name="viewport" content="width=device-width, initial-scale=1">
23
24 <link href="css/bootstrap.min.css" rel="stylesheet">
25 <link rel="stylesheet" href="css/style.css">
26
27 <!-- highlightjs -->
28 <!-- <link rel="stylesheet" href="js/highlightjs/atom-one-dark.css"> -->
29 <link rel="stylesheet" href="js/highlightjs/gruvbox-dark.css">
30 <script src="js/highlightjs/highlight.pack.js"></script>
31
32 <!-- katex -->
33 <link rel="stylesheet" href="js/katex/katex.min.css">
34 </head>
35
36 <body>
37
38 <!-- o_gradient_background" -->
39 <nav id="mainNav" class="navbar navbar-default navbar-fixed-top"
40 style="height:50px;font-size:130%;">
41 <div class="container">
42 <a href="/blog" style="color:#000;">Blog index</a>
43 <div style="float:right;">
44 <a href="/" style="color:#000;display:inline-block;">arnaucube.com</a>
45 <div class="onoffswitch" style="margin:10px;display:inline-block;" title="change theme">
46 <input onclick="switchTheme()" type="checkbox" name="onoffswitch" class="onoffswitch-checkbox"
47 id="themeSwitcher">
48 <label class="onoffswitch-label" for="themeSwitcher"></label>
49 </div>
50 </div>
51 </div>
52 <img style="height:5px; width:100%; margin-top:8px;" src="img/gradient-line.jpg" />
53 </nav>
54
55
56
57 <div class="container" style="margin-top:40px;max-width:800px;">
58 <h2>Batch proof in KZG Commitments</h2>
59
60<p><em>2021-08-14</em></p>
61
62<blockquote>
63<p><strong>Warning</strong>: I want to state clearly that I’m not a mathematician, I’m just an amateur on math studying in my free time, and this article is just an attempt to try to sort the notes that I took while reading about the KZG Commitments.</p>
64</blockquote>
65
66<p>Last week I posted some <em><a href="https://arnaucube.com/blog/kzg-commitments.html">notes on KZG Commitmens</a></em>, which overviews the scheme for single proofs. The current notes, try to overview the <em>batch proof</em> iteraton on KZG Commitments, and the <em>vector commitment</em> usage of it. Again (as in the previous post), big thanks to <a href="https://dankradfeist.de/ethereum/2020/06/16/kate-polynomial-commitments.html">Dankrad Feist</a> and <a href="https://alinush.github.io/2020/05/06/kzg-polynomial-commitments.html">Alin Tomescu</a> for their articles which helped me to follow a bit the reasoing behind this, and again, I recommend spending the time reading their articles instead of this current notes.</p>
67
68<h4>Batch proof</h4>
69
70<p>The benefit of <em>batch proof</em> is that allows us to proof multiple points while the proof size remains constant to one <span class="math inline">\(\mathbb{G}_1\)</span> point.
71Let <span class="math inline">\((z_0, y_0), (z_1, y_1), ..., (z_k, y_k)\)</span> be the points that we want to proof, and that we have a polynomial <span class="math inline">\(p(x)\)</span> that goes through the points.
72The <em>commitment</em> to the polynomial stands the same than for single proofs: <span class="math inline">\(c=[p(\tau)]_1\)</span>.</p>
73
74<p>For the evaluation proof, while in the single proofs we compute <span class="math inline">\(q(x) = \frac{p(x)-y}{x-z}\)</span>, we will replace <span class="math inline">\(y\)</span> and <span class="math inline">\(x-z\)</span> by the following two polynomials.
75The constant <span class="math inline">\(y\)</span> is replaced by a polynomial that has roots at all the points that we want to prove. This is achieved by computing the <a href="/blog/shamir-secret-sharing.html#lagrange-polynomial%20interpolation">Lagrange interpolation</a> for the given set of points:</p>
76<p><span class="math display">\[
77I(x) = \sum_{j=0}^k y_j l_j(x)\newline
78where \space\space\space l_j(x) = \prod\_{0\leq m \leq k} \frac{x-x_m}{x_j - x_m}
79\]</span></p><p>And the <span class="math inline">\(x-z\)</span>, which was to ensure that <span class="math inline">\(q(x)\)</span> had a root at <span class="math inline">\(z\)</span>, now, as we want to ensure that <span class="math inline">\(q(x)\)</span> has roots at all the points of the commitment, we will use the <em>zero polynomial</em>:</p>
80<p><span class="math display">\[
81Z(x) = \prod_{i=0}^{k} x-z_i =\newline
82=(x-z_0)(x-z_1)...(x-z_k)
83\]</span></p><p>This polynomial ensures that when <span class="math inline">\(x=z_i\)</span> (<span class="math inline">\(z_i\)</span> being one of our points), the polynomial evaluation will be zero.</p>
84
85<p>Now we can put <span class="math inline">\(I(x)\)</span> and <span class="math inline">\(Z(x)\)</span> in place, obtaining <span class="math inline">\(q(x)=\frac{p(x)-I(x)}{Z(x)}\)</span>. And the batch proof evaluation is obtained by <span class="math inline">\(\pi=[q(\tau)]_1\)</span>.</p>
86
87<p>The verification is quite similar than what we did for single proofs, but using the mentioned <span class="math inline">\(z(x)\)</span> and <span class="math inline">\(I(x)\)</span>:</p>
88<p><span class="math display">\[
89\hat{e}(\pi, [Z(\tau)]_2) == \hat{e}(c - [I(\tau)]_1, H)
90\]</span></p><p>Which, as we did with the single proofs in the previous post, we can unroll it and see that:</p>
91<p><span class="math display">\[
92\hat{e}(\pi, [Z(\tau)]_2) == \hat{e}(c - [I(\tau)]_1, H)\newline
93\Rightarrow \hat{e}([q(\tau)]_1, [Z(\tau)]_2) == \hat{e}([p(\tau)]_1 - [I(\tau)]_1, H)\newline
94\Rightarrow [q(\tau) \cdot Z(\tau)]_T == [p(\tau) - I(\tau)]_T
95\]</span></p><p>From where we see that is the equation <span class="math inline">\(q(x)\cdot Z(x)=p(x)-I(x)\)</span>, which can be expressed as <span class="math inline">\(q(x) = \frac{p(x) - I(x)}{Z(x)}\)</span>, evaluated at <span class="math inline">\(\tau\)</span> from the trusted setup, which is not known: <span class="math inline">\(q(\tau) = \frac{p(\tau) - I(\tau)}{Z(\tau)}\)</span>.</p>
96
97<h4>Vector commitments</h4>
98
99<p>As mentioned earlier, this scheme can be used as a <em>vector commitment</em> scheme.</p>
100
101<p>A vector commitment allows a prover to commit to a vector and later proof that a certain value belongs to that vector. As a traditional example, we can think of <em>Merkle Trees</em>, where we can commit to a vector of values, which are placed in the tree leafs. Then we compute the <em>root</em> which acts as the commitment. Then we can provide a proof that a certain leaf belongs to the vector for the commitment (<em>root</em>) that we showed earlier.
102The problem with Merkle Trees is that the proof size grows linearly with the size of the tree, as it contains the siblings from the leaf to the root. Here is where <em>KZG Commitments</em> can be benefitial, as the proof always stands with the same size, one <span class="math inline">\(\mathbb{G}_1\)</span> point, no matter of how many points we are batching.</p>
103
104<p>We can use KZG Commitments as a vector commitment scheme by mapping the <em>vector</em> as a batch of points that build the polynomial, so when commiting to the polynomial we are commiting to the vector. Then, it’s a matter of using the <em>batch proof</em> approach explained above in order to proof multiple elements of the vector in a single proof that can be verified later.</p>
105
106<h4>Final note</h4>
107
108<p>I’m fascinated by this scheme and its potential. One next rabbit hole (related to KZG Commitments) to look at, would be the <a href="https://vitalik.ca/general/2019/09/22/plonk.html">Plonk</a> and other similar constructions. Also, another use case that is getting attention in the Ethereum community is the <a href="https://vitalik.ca/general/2021/06/18/verkle.html"><em>Verkle Trees</em></a>.</p>
109
110<p>As in the previous notes, in order to try to put in practice the concepts, I’ve added the <em>batch proof</em> logic at <a href="https://github.com/arnaucube/kzg-commitments-study">https://github.com/arnaucube/kzg-commitments-study</a>.</p>
111
112 </div>
113
114 <footer style="text-align:center; margin-top:100px;margin-bottom:50px;">
115 <div class="container">
116 <div class="row">
117 <ul class="list-inline">
118 <li><a href="https://twitter.com/arnaucube"
119 style="color:gray;text-decoration:none;"
120 target="_blank">twitter.com/arnaucube</a>
121 </li>
122 <li><a href="https://github.com/arnaucube"
123 style="color:gray;text-decoration:none;"
124 target="_blank">github.com/arnaucube</a>
125 </li>
126 </ul>
127 </div>
128 <div class="row" style="display:inline-block;">
129 Blog made with <a href="http://github.com/arnaucube/blogo/"
130 target="_blank" style="color: gray;text-decoration:none;">Blogo</a>
131 </div>
132 </div>
133 </footer>
134
135 <script>
136 </script>
137 <script src="js/external-links.js"></script>
138 <script>hljs.initHighlightingOnLoad();</script>
139 <script defer src="js/katex/katex.min.js"></script>
140 <script defer src="js/katex/auto-render.min.js"></script>
141 <script>
142 document.addEventListener("DOMContentLoaded", function() {
143 renderMathInElement(document.body, {
144 displayMode: false,
145 // customised options
146 // • auto-render specific keys, e.g.:
147 delimiters: [
148 {left: '$$', right: '$$', display: true},
149 {left: '$', right: '$', display: false},
150 {left: "\\[", right: "\\]", display: true},
151 {left: "\\(", right: "\\)", display: false},
152 ],
153 // • rendering keys, e.g.:
154 throwOnError : true
155 });
156 });
157
158 ///
159 let theme = localStorage.getItem("theme");
160 if ((theme === "light-theme")||(theme==null)) {
161 theme = "light-theme";
162 document.getElementById("themeSwitcher").checked = false;
163 } else if (theme === "dark-theme") {
164 theme = "dark-theme";
165 document.getElementById("themeSwitcher").checked = true;
166 }
167 document.body.className = theme;
168 localStorage.setItem("theme", theme);
169
170 function switchTheme() {
171 theme = localStorage.getItem("theme");
172 if (theme === "light-theme") {
173 theme = "dark-theme";
174 document.getElementById("themeSwitcher").checked = true;
175 } else {
176 theme = "light-theme";
177 document.getElementById("themeSwitcher").checked = false;
178 }
179 document.body.className = theme;
180 localStorage.setItem("theme", theme);
181
182 console.log(theme);
183 }
184 </script>
185 <script>
186 function tagLinks(tagName) {
187 var tags = document.getElementsByTagName(tagName);
188 for (var i=0, hElem; hElem = tags[i]; i++) {
189 if (hElem.parentNode.className=="row postThumb") {
190 continue;
191 }
192 hElem.id = hElem.innerHTML.toLowerCase().replace(" ", "-");
193 hElem.innerHTML = "<a style='text-decoration:none;color:black;' href='#"+hElem.id+"'>"+hElem.innerHTML+"</a>";
194 }
195 }
196 tagLinks("h2");
197 tagLinks("h3");
198 tagLinks("h4");
199 tagLinks("h5");
200 </script>
201 <script src="js/mermaid.min.js"></script>
202
203
204 </body>
205</html>
206