2019-07-08 15:53:47 +00:00
// Copyright 2019 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
package forkid
import (
"bytes"
"math"
"testing"
"github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/params"
"github.com/ethereum/go-ethereum/rlp"
)
// TestCreation tests that different genesis and fork rule combinations result in
// the correct fork ID.
func TestCreation ( t * testing . T ) {
type testcase struct {
head uint64
want ID
}
tests := [ ] struct {
config * params . ChainConfig
genesis common . Hash
cases [ ] testcase
} {
// Mainnet test cases
{
params . MainnetChainConfig ,
params . MainnetGenesisHash ,
[ ] testcase {
{ 0 , ID { Hash : checksumToBytes ( 0xfc64ec04 ) , Next : 1150000 } } , // Unsynced
{ 1149999 , ID { Hash : checksumToBytes ( 0xfc64ec04 ) , Next : 1150000 } } , // Last Frontier block
{ 1150000 , ID { Hash : checksumToBytes ( 0x97c2c34c ) , Next : 1920000 } } , // First Homestead block
{ 1919999 , ID { Hash : checksumToBytes ( 0x97c2c34c ) , Next : 1920000 } } , // Last Homestead block
{ 1920000 , ID { Hash : checksumToBytes ( 0x91d1f948 ) , Next : 2463000 } } , // First DAO block
{ 2462999 , ID { Hash : checksumToBytes ( 0x91d1f948 ) , Next : 2463000 } } , // Last DAO block
{ 2463000 , ID { Hash : checksumToBytes ( 0x7a64da13 ) , Next : 2675000 } } , // First Tangerine block
{ 2674999 , ID { Hash : checksumToBytes ( 0x7a64da13 ) , Next : 2675000 } } , // Last Tangerine block
{ 2675000 , ID { Hash : checksumToBytes ( 0x3edd5b10 ) , Next : 4370000 } } , // First Spurious block
{ 4369999 , ID { Hash : checksumToBytes ( 0x3edd5b10 ) , Next : 4370000 } } , // Last Spurious block
{ 4370000 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 7280000 } } , // First Byzantium block
{ 7279999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 7280000 } } , // Last Byzantium block
2019-10-31 09:04:26 +00:00
{ 7280000 , ID { Hash : checksumToBytes ( 0x668db0af ) , Next : 9069000 } } , // First and last Constantinople, first Petersburg block
{ 9068999 , ID { Hash : checksumToBytes ( 0x668db0af ) , Next : 9069000 } } , // Last Petersburg block
2019-12-06 09:36:40 +00:00
{ 9069000 , ID { Hash : checksumToBytes ( 0x879d6e30 ) , Next : 9200000 } } , // First Istanbul and first Muir Glacier block
{ 9199999 , ID { Hash : checksumToBytes ( 0x879d6e30 ) , Next : 9200000 } } , // Last Istanbul and first Muir Glacier block
{ 9200000 , ID { Hash : checksumToBytes ( 0xe029e991 ) , Next : 0 } } , // First Muir Glacier block
{ 10000000 , ID { Hash : checksumToBytes ( 0xe029e991 ) , Next : 0 } } , // Future Muir Glacier block
2019-07-08 15:53:47 +00:00
} ,
} ,
// Ropsten test cases
{
2020-04-09 09:09:58 +00:00
params . RopstenChainConfig ,
params . RopstenGenesisHash ,
2019-07-08 15:53:47 +00:00
[ ] testcase {
{ 0 , ID { Hash : checksumToBytes ( 0x30c7ddbc ) , Next : 10 } } , // Unsynced, last Frontier, Homestead and first Tangerine block
{ 9 , ID { Hash : checksumToBytes ( 0x30c7ddbc ) , Next : 10 } } , // Last Tangerine block
{ 10 , ID { Hash : checksumToBytes ( 0x63760190 ) , Next : 1700000 } } , // First Spurious block
{ 1699999 , ID { Hash : checksumToBytes ( 0x63760190 ) , Next : 1700000 } } , // Last Spurious block
{ 1700000 , ID { Hash : checksumToBytes ( 0x3ea159c7 ) , Next : 4230000 } } , // First Byzantium block
{ 4229999 , ID { Hash : checksumToBytes ( 0x3ea159c7 ) , Next : 4230000 } } , // Last Byzantium block
{ 4230000 , ID { Hash : checksumToBytes ( 0x97b544f3 ) , Next : 4939394 } } , // First Constantinople block
{ 4939393 , ID { Hash : checksumToBytes ( 0x97b544f3 ) , Next : 4939394 } } , // Last Constantinople block
2019-09-19 07:13:11 +00:00
{ 4939394 , ID { Hash : checksumToBytes ( 0xd6e2149b ) , Next : 6485846 } } , // First Petersburg block
{ 6485845 , ID { Hash : checksumToBytes ( 0xd6e2149b ) , Next : 6485846 } } , // Last Petersburg block
2019-12-06 09:36:40 +00:00
{ 6485846 , ID { Hash : checksumToBytes ( 0x4bc66396 ) , Next : 7117117 } } , // First Istanbul block
{ 7117116 , ID { Hash : checksumToBytes ( 0x4bc66396 ) , Next : 7117117 } } , // Last Istanbul block
{ 7117117 , ID { Hash : checksumToBytes ( 0x6727ef90 ) , Next : 0 } } , // First Muir Glacier block
{ 7500000 , ID { Hash : checksumToBytes ( 0x6727ef90 ) , Next : 0 } } , // Future
2019-07-08 15:53:47 +00:00
} ,
} ,
// Rinkeby test cases
{
params . RinkebyChainConfig ,
params . RinkebyGenesisHash ,
[ ] testcase {
{ 0 , ID { Hash : checksumToBytes ( 0x3b8e0691 ) , Next : 1 } } , // Unsynced, last Frontier block
{ 1 , ID { Hash : checksumToBytes ( 0x60949295 ) , Next : 2 } } , // First and last Homestead block
{ 2 , ID { Hash : checksumToBytes ( 0x8bde40dd ) , Next : 3 } } , // First and last Tangerine block
{ 3 , ID { Hash : checksumToBytes ( 0xcb3a64bb ) , Next : 1035301 } } , // First Spurious block
{ 1035300 , ID { Hash : checksumToBytes ( 0xcb3a64bb ) , Next : 1035301 } } , // Last Spurious block
{ 1035301 , ID { Hash : checksumToBytes ( 0x8d748b57 ) , Next : 3660663 } } , // First Byzantium block
{ 3660662 , ID { Hash : checksumToBytes ( 0x8d748b57 ) , Next : 3660663 } } , // Last Byzantium block
{ 3660663 , ID { Hash : checksumToBytes ( 0xe49cab14 ) , Next : 4321234 } } , // First Constantinople block
{ 4321233 , ID { Hash : checksumToBytes ( 0xe49cab14 ) , Next : 4321234 } } , // Last Constantinople block
2019-09-19 07:13:11 +00:00
{ 4321234 , ID { Hash : checksumToBytes ( 0xafec6b27 ) , Next : 5435345 } } , // First Petersburg block
{ 5435344 , ID { Hash : checksumToBytes ( 0xafec6b27 ) , Next : 5435345 } } , // Last Petersburg block
{ 5435345 , ID { Hash : checksumToBytes ( 0xcbdb8838 ) , Next : 0 } } , // First Istanbul block
{ 6000000 , ID { Hash : checksumToBytes ( 0xcbdb8838 ) , Next : 0 } } , // Future Istanbul block
2019-07-08 15:53:47 +00:00
} ,
} ,
// Goerli test cases
{
params . GoerliChainConfig ,
params . GoerliGenesisHash ,
[ ] testcase {
2019-09-19 07:13:11 +00:00
{ 0 , ID { Hash : checksumToBytes ( 0xa3f5ab08 ) , Next : 1561651 } } , // Unsynced, last Frontier, Homestead, Tangerine, Spurious, Byzantium, Constantinople and first Petersburg block
{ 1561650 , ID { Hash : checksumToBytes ( 0xa3f5ab08 ) , Next : 1561651 } } , // Last Petersburg block
{ 1561651 , ID { Hash : checksumToBytes ( 0xc25efa5c ) , Next : 0 } } , // First Istanbul block
{ 2000000 , ID { Hash : checksumToBytes ( 0xc25efa5c ) , Next : 0 } } , // Future Istanbul block
2019-07-08 15:53:47 +00:00
} ,
} ,
}
for i , tt := range tests {
for j , ttt := range tt . cases {
if have := newID ( tt . config , tt . genesis , ttt . head ) ; have != ttt . want {
t . Errorf ( "test %d, case %d: fork ID mismatch: have %x, want %x" , i , j , have , ttt . want )
}
}
}
}
// TestValidation tests that a local peer correctly validates and accepts a remote
// fork ID.
func TestValidation ( t * testing . T ) {
tests := [ ] struct {
head uint64
id ID
err error
} {
// Local is mainnet Petersburg, remote announces the same. No future fork is announced.
{ 7987396 , ID { Hash : checksumToBytes ( 0x668db0af ) , Next : 0 } , nil } ,
// Local is mainnet Petersburg, remote announces the same. Remote also announces a next fork
// at block 0xffffffff, but that is uncertain.
{ 7987396 , ID { Hash : checksumToBytes ( 0x668db0af ) , Next : math . MaxUint64 } , nil } ,
// Local is mainnet currently in Byzantium only (so it's aware of Petersburg), remote announces
// also Byzantium, but it's not yet aware of Petersburg (e.g. non updated node before the fork).
// In this case we don't know if Petersburg passed yet or not.
{ 7279999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 0 } , nil } ,
// Local is mainnet currently in Byzantium only (so it's aware of Petersburg), remote announces
// also Byzantium, and it's also aware of Petersburg (e.g. updated node before the fork). We
// don't know if Petersburg passed yet (will pass) or not.
{ 7279999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 7280000 } , nil } ,
// Local is mainnet currently in Byzantium only (so it's aware of Petersburg), remote announces
// also Byzantium, and it's also aware of some random fork (e.g. misconfigured Petersburg). As
// neither forks passed at neither nodes, they may mismatch, but we still connect for now.
{ 7279999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : math . MaxUint64 } , nil } ,
// Local is mainnet Petersburg, remote announces Byzantium + knowledge about Petersburg. Remote
// is simply out of sync, accept.
2019-10-30 11:05:31 +00:00
{ 7987396 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 7280000 } , nil } ,
2019-07-08 15:53:47 +00:00
// Local is mainnet Petersburg, remote announces Spurious + knowledge about Byzantium. Remote
// is definitely out of sync. It may or may not need the Petersburg update, we don't know yet.
{ 7987396 , ID { Hash : checksumToBytes ( 0x3edd5b10 ) , Next : 4370000 } , nil } ,
// Local is mainnet Byzantium, remote announces Petersburg. Local is out of sync, accept.
{ 7279999 , ID { Hash : checksumToBytes ( 0x668db0af ) , Next : 0 } , nil } ,
// Local is mainnet Spurious, remote announces Byzantium, but is not aware of Petersburg. Local
// out of sync. Local also knows about a future fork, but that is uncertain yet.
{ 4369999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 0 } , nil } ,
// Local is mainnet Petersburg. remote announces Byzantium but is not aware of further forks.
// Remote needs software update.
{ 7987396 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 0 } , ErrRemoteStale } ,
// Local is mainnet Petersburg, and isn't aware of more forks. Remote announces Petersburg +
// 0xffffffff. Local needs software update, reject.
{ 7987396 , ID { Hash : checksumToBytes ( 0x5cddc0e1 ) , Next : 0 } , ErrLocalIncompatibleOrStale } ,
// Local is mainnet Byzantium, and is aware of Petersburg. Remote announces Petersburg +
// 0xffffffff. Local needs software update, reject.
{ 7279999 , ID { Hash : checksumToBytes ( 0x5cddc0e1 ) , Next : 0 } , ErrLocalIncompatibleOrStale } ,
// Local is mainnet Petersburg, remote is Rinkeby Petersburg.
{ 7987396 , ID { Hash : checksumToBytes ( 0xafec6b27 ) , Next : 0 } , ErrLocalIncompatibleOrStale } ,
2019-10-30 11:05:31 +00:00
2019-12-06 09:36:40 +00:00
// Local is mainnet Muir Glacier, far in the future. Remote announces Gopherium (non existing fork)
2019-10-30 11:05:31 +00:00
// at some future block 88888888, for itself, but past block for local. Local is incompatible.
//
// This case detects non-upgraded nodes with majority hash power (typical Ropsten mess).
2019-12-06 09:36:40 +00:00
{ 88888888 , ID { Hash : checksumToBytes ( 0xe029e991 ) , Next : 88888888 } , ErrLocalIncompatibleOrStale } ,
2019-10-30 11:05:31 +00:00
// Local is mainnet Byzantium. Remote is also in Byzantium, but announces Gopherium (non existing
// fork) at block 7279999, before Petersburg. Local is incompatible.
{ 7279999 , ID { Hash : checksumToBytes ( 0xa00bc324 ) , Next : 7279999 } , ErrLocalIncompatibleOrStale } ,
2019-07-08 15:53:47 +00:00
}
for i , tt := range tests {
filter := newFilter ( params . MainnetChainConfig , params . MainnetGenesisHash , func ( ) uint64 { return tt . head } )
if err := filter ( tt . id ) ; err != tt . err {
t . Errorf ( "test %d: validation error mismatch: have %v, want %v" , i , err , tt . err )
}
}
}
// Tests that IDs are properly RLP encoded (specifically important because we
// use uint32 to store the hash, but we need to encode it as [4]byte).
func TestEncoding ( t * testing . T ) {
tests := [ ] struct {
id ID
want [ ] byte
} {
{ ID { Hash : checksumToBytes ( 0 ) , Next : 0 } , common . Hex2Bytes ( "c6840000000080" ) } ,
{ ID { Hash : checksumToBytes ( 0xdeadbeef ) , Next : 0xBADDCAFE } , common . Hex2Bytes ( "ca84deadbeef84baddcafe," ) } ,
{ ID { Hash : checksumToBytes ( math . MaxUint32 ) , Next : math . MaxUint64 } , common . Hex2Bytes ( "ce84ffffffff88ffffffffffffffff" ) } ,
}
for i , tt := range tests {
have , err := rlp . EncodeToBytes ( tt . id )
if err != nil {
t . Errorf ( "test %d: failed to encode forkid: %v" , i , err )
continue
}
if ! bytes . Equal ( have , tt . want ) {
t . Errorf ( "test %d: RLP mismatch: have %x, want %x" , i , have , tt . want )
}
}
}