KZG, why is constant size commitment special

0xPARC · Jul 9, 2024 · 0a28b6c · 0a28b6c
1 parent bdc2a34
commit 0a28b6c
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/easy/src/kzg.typ b/easy/src/kzg.typ
@@ -16,7 +16,9 @@ The goal of a _polynomial commitment scheme_ is to have the following API:
   - Peggy can then send a short "proof" convincing Victor that $y$ is the
     correct value, without having to reveal $P$.
 
-The _Kate-Zaverucha-Goldberg (KZG)_ commitment scheme is amazingly efficient because both the commitment and proof lengths are a single point on $E$, encodable in 256 bits.
+The _Kate-Zaverucha-Goldberg (KZG)_ commitment scheme is amazingly efficient 
+because both the commitment and proof lengths are a single point on $E$, 
+encodable in 256 bits, no matter how many coefficients the polynomial has.
 
 == The setup