status-im
/
eth2.0-specs
mirror of https://github.com/status-im/eth2.0-specs.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Include state root blocks in crosslink data in non-block slots 

Also adds `total_bytes` to state. The goal is to facilitate easier fraud proofs, so that one needs to simply check two adjacent headers in a crosslink and their respective bodies to verify a fraud proof.
This commit is contained in:
vbuterin 2019-08-05 14:37:38 -04:00 committed by GitHub
parent ddd43ad99d
commit cb92aa91dd
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
specs/core/1_shard-data-chains.md
View File

@ -181,6 +181,7 @@ class ShardState(Container):
shard: Shard shard: Shard
most_recent_block_core: ShardBlockCore most_recent_block_core: ShardBlockCore
receipt_root: Hash receipt_root: Hash
total_bytes: uint64
``` ```
### `ShardReceiptDelta` ### `ShardReceiptDelta`
@ -531,7 +532,9 @@ def shard_block_transition(state: ShardState,
)) ))
# Check total bytes # Check total bytes
assert block.core.total_bytes == state.most_recent_block_core.total_bytes + len(block.core.data) state.total_bytes += len(block.core.data)
assert block.core.total_bytes == state.total_bytes
# Update in-state block header # Update in-state block header
state.most_recent_block_core = ShardBlockCore( state.most_recent_block_core = ShardBlockCore(
@ -554,14 +557,16 @@ def shard_block_transition(state: ShardState,
Let: Let:
- `shard` be a valid `Shard` - `shard` be a valid `Shard`
- `shard_blocks` be the `ShardBlock` list such that `shard_blocks[slot]` is the canonical `ShardBlock` for shard `shard` at slot `slot` - `pre_state` is the `ShardState` before processing any blocks
- `shard_blocks_or_state_roots` be the `Union[ShardBlock, Hash]` list such that `shard_blocks[slot]` is the canonical `ShardBlock` for shard `shard` at slot `slot` if a block exists, or the post-state-root of processing state up to and including that slot if a block does not exist.
- `beacon_state` be the canonical `BeaconState` - `beacon_state` be the canonical `BeaconState`
- `valid_attestations` be the set of valid `Attestation` objects, recursively defined - `valid_attestations` be the set of valid `Attestation` objects, recursively defined
- `candidate` be a candidate `Attestation` which is valid under Phase 0 rules, and for which validity is to be determined under Phase 1 rules by running `is_valid_beacon_attestation` - `candidate` be a candidate `Attestation` which is valid under Phase 0 rules, and for which validity is to be determined under Phase 1 rules by running `is_valid_beacon_attestation`
```python ```python
def is_valid_beacon_attestation(shard: Shard, def is_valid_beacon_attestation(shard: Shard,
shard_blocks: Sequence[ShardBlock], pre_state: ShardState,
shard_blocks_or_state_roots: Sequence[Union[ShardBlock, Hash]],
beacon_state: BeaconState, beacon_state: BeaconState,
valid_attestations: Set[Attestation], valid_attestations: Set[Attestation],
candidate: Attestation) -> bool: candidate: Attestation) -> bool:
@ -588,7 +593,14 @@ def is_valid_beacon_attestation(shard: Shard,
start_epoch + MAX_EPOCHS_PER_CROSSLINK) start_epoch + MAX_EPOCHS_PER_CROSSLINK)
blocks = [] blocks = []
for slot in range(start_epoch * SLOTS_PER_EPOCH, end_epoch * SLOTS_PER_EPOCH): for slot in range(start_epoch * SLOTS_PER_EPOCH, end_epoch * SLOTS_PER_EPOCH):
blocks.append(shard_blocks[slot]) if isinstance(shard_blocks_or_state_roots[slot], ShardBlock):
blocks.append(shard_blocks_or_state_roots[slot])
else:
blocks.append(ShardBlockHeader(ShardBlockCore(
slot=slot,
state_root=shard_blocks_or_state_roots[slot],
total_bytes=state.total_bytes
), ShardBlockSignatures()))
assert candidate.data.crosslink.data_root == compute_crosslink_data_root(blocks) assert candidate.data.crosslink.data_root == compute_crosslink_data_root(blocks)
return True return True