Open
Description
Problem
- 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 includingpi
in theBlobCommitment
- Looking at this formula
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 generator
- With access to
pi
from theBlobCommitment
, 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 theBlobCommitment
- any party creating the
BlobCommitment
will be responsible for also computingpi
- this is either the client doing the dispersal, or the disperser
Metadata
Metadata
Assignees
Labels
No labels
Activity