Abstract
dc:descriptionIn this thesis, our focus is on exploring the parallelization of the KZG10 polynomial commit- ment scheme. Our goal is to parallelize a specific part of the EIP-4844 proposal, as implemented by c-kzg-4844, and compare the results with go-kzg-4844, which already incorporates parallelism. The parallelization of the MSM algorithm led to significant improvements in computation speed for most EIP-4844 benchmarks. However, our study fell short in certain benchmarks related to the MSM algorithm when compared to go-kzg-4844. This suggests the potential that go-kzg-4844 has some additional optimizations that we were unaware of. Nonetheless, our parallelized approach outperformed go-kzg-4844 by approximately 59.25% in the batched blob KZG proof verification benchmark, specifically when all blobs were accumulated before verification. Further investigation is required to fully understand the optimizations present in go-kzg-4844 that contribute to its superior performance in specific areas.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Povilaitis, Tautvydas,
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD192845909&prefLang=en_US