-
Notifications
You must be signed in to change notification settings - Fork 5.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1 from ethereum/master
Update EIP
- Loading branch information
Showing
52 changed files
with
4,328 additions
and
696 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,39 @@ | ||
``` | ||
EIP: 100 | ||
Title: Change difficulty adjustment to target mean block time including uncles | ||
Author: Vitalik Buterin | ||
Type: Standard Track | ||
Category: Core | ||
Status: Final | ||
Created: 2016-04-28 | ||
``` | ||
|
||
### Specification | ||
|
||
Currently, the formula to compute the difficulty of a block includes the following logic: | ||
|
||
``` python | ||
adj_factor = max(1 - ((timestamp - parent.timestamp) // 10), -99) | ||
child_diff = int(max(parent.difficulty + (parent.difficulty // BLOCK_DIFF_FACTOR) * adj_factor, min(parent.difficulty, MIN_DIFF))) | ||
... | ||
``` | ||
|
||
If `block.number >= BYZANTIUM_FORK_BLKNUM`, we change the first line to the following: | ||
|
||
``` python | ||
adj_factor = max((2 if len(parent.uncles) else 1) - ((timestamp - parent.timestamp) // 9), -99) | ||
``` | ||
### Rationale | ||
|
||
This new formula ensures that the difficulty adjustment algorithm targets a constant average rate of blocks produced including uncles, and so ensures a highly predictable issuance rate that cannot be manipulated upward by manipulating the uncle rate. A formula that accounts for the exact number of included uncles: | ||
``` python | ||
adj_factor = max(1 + len(parent.uncles) - ((timestamp - parent.timestamp) // 9), -99) | ||
``` | ||
can be fairly easily seen to be (to within a tolerance of ~3/4194304) mathematically equivalent to assuming that a block with `k` uncles is equivalent to a sequence of `k+1` blocks that all appear with the exact same timestamp, and this is likely the simplest possible way to accomplish the desired effect. But since the exact formula depends on the full block and not just the header, we are instead using an approximate formula that accomplishes almost the same effect but has the benefit that it depends only on the block header (as you can check the uncle hash against the blank hash). | ||
|
||
Changing the denominator from 10 to 9 ensures that the block time remains roughly the same (in fact, it should decrease by ~3% given the current uncle rate of 7%). | ||
|
||
### References | ||
|
||
1. EIP 100 issue and discussion: https://github.com/ethereum/EIPs/issues/100 | ||
2. https://bitslog.wordpress.com/2016/04/28/uncle-mining-an-ethereum-consensus-protocol-flaw/ |
Oops, something went wrong.