github/consensus-specs
1
1
Fork 0
mirror of https://github.com/ethereum/consensus-specs.git synced 2026-02-02 06:04:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

adjustments based on review by @dankrad

Browse Source
This commit is contained in:
protolambda
2021-01-02 22:31:25 +01:00
parent 5e57ff0ab1
commit a1831940ea
3 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
specs/phase1/beacon-chain.md
View File

@@ -67,7 +67,6 @@ We define the following Python custom types for type hinting and readability:
| - | - | - |
| `Shard` | `uint64` | A shard number |
| `BLSCommitment` | `bytes48` | A G1 curve point |
| `BLSKateProof` | `bytes48` | A G1 curve point |
## Configuration
@@ -190,7 +189,7 @@ class ShardHeader(Container):
# The actual data commitment
commitment: DataCommitment
# Proof that the degree < commitment.length
degree_proof: BLSKateProof
degree_proof: BLSCommitment
```
TODO: add shard-proposer-index to shard headers, similar to optimization done with beacon-blocks.

14
specs/phase1/data-availability-sampling.md
View File

@@ -52,7 +52,7 @@ class DASSample(Container):
slot: Slot
shard: Shard
index: SampleIndex
proof: BLSKateProof
proof: BLSCommitment
data: Vector[BLSPoint, POINTS_PER_SAMPLE]
```
@@ -70,7 +70,7 @@ class ShardBlob(Container):
```
Note that the hash-tree-root of the `ShardBlob` does not match the `ShardHeader`,
since the blob deals with full data, whereas the header includes the Kate commitment instead.
since the blob deals with full data, whereas the header includes the KZG commitment instead.
### SignedShardBlob
@@ -156,21 +156,21 @@ def unextend_data(extended_data: Sequence[Point]) -> Sequence[Point]:
```
```python
def check_multi_kate_proof(commitment: BLSCommitment, proof: BLSKateProof, x: Point, ys: Sequence[Point]) -> bool:
def check_multi_kzg_proof(commitment: BLSCommitment, proof: BLSCommitment, x: Point, ys: Sequence[Point]) -> bool:
"""
Run a KZG multi-proof check to verify that for the subgroup starting at x,
the proof indeed complements the ys to match the commitment.
"""
... # Omitted for now, refer to Kate implementation resources.
... # Omitted for now, refer to KZG implementation resources.
```
```python
def construct_proofs(extended_data_as_poly: Sequence[Point]) -> Sequence[BLSKateProof]:
def construct_proofs(extended_data_as_poly: Sequence[Point]) -> Sequence[BLSCommitment]:
"""
Constructs proofs for samples of extended data (in polynomial form, 2nd half being zeroes).
Use the FK20 multi-proof approach to construct proofs for a chunk length of POINTS_PER_SAMPLE.
"""
... # Omitted for now, refer to Kate implementation resources.
... # Omitted for now, refer to KZG implementation resources.
```
```python
@@ -207,7 +207,7 @@ def verify_sample(sample: DASSample, sample_count: uint64, commitment: BLSCommit
sample_root_of_unity = ROOT_OF_UNITY**MAX_SAMPLES_PER_BLOCK # change point-level to sample-level domain
x = sample_root_of_unity**domain_pos
ys = reverse_bit_order_list(sample.data)
assert check_multi_kate_proof(commitment, sample.proof, x, ys)
assert check_multi_kzg_proof(commitment, sample.proof, x, ys)
```
```python

3
specs/phase1/p2p-das.md
View File

@@ -181,7 +181,8 @@ TODO: make double blob proposals slashable?
#### Vertical subnets: `das_sample_{subnet_index}`
Shard blob samples can be verified with just a 48 byte Kate proof, against the commitment specific to that `(shard, slot)` key.
Shard blob samples can be verified with just a 48 byte KZG proof (commitment quotient polynomial),
against the commitment to blob polynomial, specific to that `(shard, slot)` key.
The following validations MUST pass before forwarding the `sample` on the vertical subnet.
- _[IGNORE]_ The commitment for the (`sample.shard`, `sample.slot`, `sample.index`) tuple must be known.