Definition
The Kate-Zaverucha-Goldberg polynomial commitment scheme. It lets a large amount of data be committed to in a constant-size value, with constant-size proofs for any point in it, which is what makes blob verification practical under EIP-4844.
Also known as
Kate-Zaverucha-Goldberg
Note
Kate-Zaverucha-Goldberg commitment scheme. Also referred to as "Kate Commitment Scheme." Generally not spelled out -- "KZG" alone is recognized.
Translations
| Language | Prose |
|---|---|
| العربية Arabic | KZG |
| বাংলা Bengali | KZG |
| Čeština Czech | KZG |
| Deutsch German | KZG |
| Español Spanish | KZG |
| Français French | KZG |
| हिन्दी Hindi | KZG |
| Bahasa Indonesia Indonesian | KZG |
| Italiano Italian | KZG |
| 日本語 Japanese | KZG |
| 한국어 Korean | KZG |
| मराठी Marathi | KZG |
| Polski Polish | KZG |
| Português Portuguese (Brazil) | KZG |
| Русский Russian | KZG |
| Kiswahili Swahili | KZG |
| தமிழ் Tamil | KZG |
| తెలుగు Telugu | KZG |
| Türkçe Turkish | KZG |
| Українська Ukrainian | KZG |
| اردو Urdu | KZG |
| Tiếng Việt Vietnamese | KZG |
| 简体中文 Chinese (Simplified) | KZG |
| 繁體中文 Chinese (Traditional) | KZG |