You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the process for a client to verify the kzg commitment contained in the BlobCommitment involves recomputing the commitment, and checking whether the computed commitment matches the received commitment
This is not always ideal, since computing the commitment requires the blob to have SRS data for the whole length of a blob (currently 32MiB, could be increased in the future)
Optimization
The proposed optimization involves computing an opening pi of the kzg commitment, and including pi in the BlobCommitment
With access to pi from the BlobCommitment, a client will be able to check the equality of these pairings, thus verifying the commitment without any SRS data
Implementation Details
pi must be added to the BlobCommitment
any party creating the BlobCommitment will be responsible for also computing pi
this is either the client doing the dispersal, or the disperser
The text was updated successfully, but these errors were encountered:
Problem
BlobCommitment
involves recomputing the commitment, and checking whether the computed commitment matches the received commitmentOptimization
pi
of the kzg commitment, and includingpi
in theBlobCommitment
e(pi, s-z) = e(C-y, H)
:z
is the blob hashC
is the kzg commitment to the blob polynomialp
pi
is the evaluation ofC
atz
s
is the first public SRS pointy
is the evaluation ofp
atz
H
is the g2 generatorpi
from theBlobCommitment
, a client will be able to check the equality of these pairings, thus verifying the commitment without any SRS dataImplementation Details
pi
must be added to theBlobCommitment
BlobCommitment
will be responsible for also computingpi
The text was updated successfully, but these errors were encountered: