Fix some typos (#2195)
* Fix typo for P2P Networking document * Fix link typo of P2P networking document * fix typo for light clients beacon chain document
This commit is contained in:
parent
6f2c69e79f
commit
0fd0db1ffc
|
@ -314,7 +314,7 @@ def get_flag_deltas(state: BeaconState,
|
||||||
base_reward = get_base_reward(state, index)
|
base_reward = get_base_reward(state, index)
|
||||||
if index in unslashed_participating_indices:
|
if index in unslashed_participating_indices:
|
||||||
if is_in_inactivity_leak(state):
|
if is_in_inactivity_leak(state):
|
||||||
# Optimal participatition is fully rewarded to cancel the inactivity penalty
|
# Optimal participation is fully rewarded to cancel the inactivity penalty
|
||||||
rewards[index] = base_reward * numerator // REWARD_DENOMINATOR
|
rewards[index] = base_reward * numerator // REWARD_DENOMINATOR
|
||||||
else:
|
else:
|
||||||
rewards[index] = (
|
rewards[index] = (
|
||||||
|
|
|
@ -101,7 +101,7 @@ It consists of four main sections:
|
||||||
- [Compression/Encoding](#compressionencoding)
|
- [Compression/Encoding](#compressionencoding)
|
||||||
- [Why are we using SSZ for encoding?](#why-are-we-using-ssz-for-encoding)
|
- [Why are we using SSZ for encoding?](#why-are-we-using-ssz-for-encoding)
|
||||||
- [Why are we compressing, and at which layers?](#why-are-we-compressing-and-at-which-layers)
|
- [Why are we compressing, and at which layers?](#why-are-we-compressing-and-at-which-layers)
|
||||||
- [Why are using Snappy for compression?](#why-are-using-snappy-for-compression)
|
- [Why are we using Snappy for compression?](#why-are-we-using-snappy-for-compression)
|
||||||
- [Can I get access to unencrypted bytes on the wire for debugging purposes?](#can-i-get-access-to-unencrypted-bytes-on-the-wire-for-debugging-purposes)
|
- [Can I get access to unencrypted bytes on the wire for debugging purposes?](#can-i-get-access-to-unencrypted-bytes-on-the-wire-for-debugging-purposes)
|
||||||
- [What are SSZ type size bounds?](#what-are-ssz-type-size-bounds)
|
- [What are SSZ type size bounds?](#what-are-ssz-type-size-bounds)
|
||||||
- [libp2p implementations matrix](#libp2p-implementations-matrix)
|
- [libp2p implementations matrix](#libp2p-implementations-matrix)
|
||||||
|
@ -937,7 +937,7 @@ where the fields of `ENRForkID` are defined as
|
||||||
* `next_fork_epoch` is the epoch at which the next fork is planned and the `current_fork_version` will be updated.
|
* `next_fork_epoch` is the epoch at which the next fork is planned and the `current_fork_version` will be updated.
|
||||||
If no future fork is planned, set `next_fork_epoch = FAR_FUTURE_EPOCH` to signal this fact
|
If no future fork is planned, set `next_fork_epoch = FAR_FUTURE_EPOCH` to signal this fact
|
||||||
|
|
||||||
*Note*: `fork_digest` is composed of values that are not not known until the genesis block/state are available.
|
*Note*: `fork_digest` is composed of values that are not known until the genesis block/state are available.
|
||||||
Due to this, clients SHOULD NOT form ENRs and begin peer discovery until genesis values are known.
|
Due to this, clients SHOULD NOT form ENRs and begin peer discovery until genesis values are known.
|
||||||
One notable exception to this rule is the distribution of bootnode ENRs prior to genesis.
|
One notable exception to this rule is the distribution of bootnode ENRs prior to genesis.
|
||||||
In this case, bootnode ENRs SHOULD be initially distributed with `eth2` field set as
|
In this case, bootnode ENRs SHOULD be initially distributed with `eth2` field set as
|
||||||
|
@ -1223,7 +1223,7 @@ the node's fork choice prevents integration of these messages into the actual co
|
||||||
Depending on the number of validators, it may be more efficient to group shard subnets and might provide better stability for the gossipsub channel.
|
Depending on the number of validators, it may be more efficient to group shard subnets and might provide better stability for the gossipsub channel.
|
||||||
The exact grouping will be dependent on more involved network tests.
|
The exact grouping will be dependent on more involved network tests.
|
||||||
This constant allows for more flexibility in setting up the network topology for attestation aggregation (as aggregation should happen on each subnet).
|
This constant allows for more flexibility in setting up the network topology for attestation aggregation (as aggregation should happen on each subnet).
|
||||||
The value is currently set to to be equal `MAX_COMMITTEES_PER_SLOT` if/until network tests indicate otherwise.
|
The value is currently set to be equal to `MAX_COMMITTEES_PER_SLOT` if/until network tests indicate otherwise.
|
||||||
|
|
||||||
### Why are attestations limited to be broadcast on gossip channels within `SLOTS_PER_EPOCH` slots?
|
### Why are attestations limited to be broadcast on gossip channels within `SLOTS_PER_EPOCH` slots?
|
||||||
|
|
||||||
|
@ -1369,7 +1369,7 @@ Thus, it may happen that we need to transmit an empty list - there are several w
|
||||||
|
|
||||||
Semantically, it is not an error that a block is missing during a slot making option 2 unnatural.
|
Semantically, it is not an error that a block is missing during a slot making option 2 unnatural.
|
||||||
|
|
||||||
Option 1 allows allows the responder to signal "no block", but this information may be wrong - for example in the case of a malicious node.
|
Option 1 allows the responder to signal "no block", but this information may be wrong - for example in the case of a malicious node.
|
||||||
|
|
||||||
Under option 0, there is no way for a client to distinguish between a slot without a block and an incomplete response,
|
Under option 0, there is no way for a client to distinguish between a slot without a block and an incomplete response,
|
||||||
but given that it already must contain logic to handle the uncertainty of a malicious peer, option 0 was chosen.
|
but given that it already must contain logic to handle the uncertainty of a malicious peer, option 0 was chosen.
|
||||||
|
@ -1495,7 +1495,7 @@ This looks different depending on the interaction layer:
|
||||||
implementers are encouraged to encapsulate the encoding and compression logic behind
|
implementers are encouraged to encapsulate the encoding and compression logic behind
|
||||||
MessageReader and MessageWriter components/strategies that can be layered on top of the raw byte streams.
|
MessageReader and MessageWriter components/strategies that can be layered on top of the raw byte streams.
|
||||||
|
|
||||||
### Why are using Snappy for compression?
|
### Why are we using Snappy for compression?
|
||||||
|
|
||||||
Snappy is used in Ethereum 1.0. It is well maintained by Google, has good benchmarks,
|
Snappy is used in Ethereum 1.0. It is well maintained by Google, has good benchmarks,
|
||||||
and can calculate the size of the uncompressed object without inflating it in memory.
|
and can calculate the size of the uncompressed object without inflating it in memory.
|
||||||
|
|
Loading…
Reference in New Issue