mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2024-12-24 12:37:16 +00:00
35fcd3a829
* implemented bor consensus * add bor flags to default * change bucket into snapshot to clique * enable stateSync * bypass reciept checks * fix receipt calculation and bor logs * fix: contract call wrt bor * Update mumbai config * Add: bor-mainnet flag and config * Add bor consensus to integration * use header coinbase in block context * london fork mumbai changes * fix genesis error * Jaipur fork for mumbai * add sysCall to verifyHeader * added bor related rpc method implementation * added bor specific rpc extensions * fixes in snapshot implementation, major refactor for bor rpc * modify consensus specific db path for bor * fix: remove parallel compute for get root hash rpc method * Added bor-receipt flow * Use turbo-bor-lib and bor tables * Use bor table in RPC snapshot * Update README.md * Update README.md * Update README.md * Update README.md * update rpc readme * link rpc docs in readme * Update Readme * Update Readme * move erigon namespace rpc methods to eth * rm: erigon namespace * rm: erigon namespace, update list of available rpc methods, add example * fix: binary name in rpc readme * fix: max db size * Add london to bor-mainnet * updated node.go * add system req to readme * golang version fix readme * added networknames in correct place * nil * ran gofmt * erigon * fixed fake.go * dont need turbor-lib * old readme * fixing readme * half * other half * changed return * fixing return * fixed return * fixed flags * gofmt * merge with devel * latest erigon-lib * fixed context.coinbase * took out syscall * fixed params in hash * bor type now is consensus.Engine * parlia is consensus.Engine * missing arg and repeated importation * repeated importation * fixed eth_receipts.go * deleted duplicate issuance * part of consensus.Engine type * added eth_api issuance * networkname * added erigon_system file * fork struct taken out * added erigon block * getLogByHash for erigonImpl * gofmt * fixed lint * ops * gofmt * gofmt * added APIImple functions * fixed clique test * took out print * fixed state added balance * fixed README * fixed rpcDaemon README * fixed integration README * updated blockchain.go * lint * added bor back into blockchain.go * took out comment * lint * updated daemon * updated wtb * removed duplicate * removed VerifyHeaders * prevent use of wrong Transfer * fixed state_processor.go * fixed state_transition.go * fixed headers * returning err * error handling in bor read tx look up * put for txLookUp * dealing with error * lint * traces * more traces * fixed receipt in execution * getTrasanction receipt for bor or others * nil * lint * ops * deleted syscall * took out else * Merge branch 'devel * tests syscalls * changed borReceipt to receipt * reset header algos * arguments fix * took out prefixes * lint * erigon-named * borReceiptKey = blocknumber * reverts e3b60c2e159d03efcb855f7ab3da5a098dd60c33. * correct hashing tx * dont need it here * lint * added txlookup for bor * change to uint256 * outputs for isBor * wrapper * added isBor and isParlia * isBor * fixed BorTransfer * not readBody * correct prefix * added blockNum * added readStorageBody * readStorageBody * lint * got rid of unnecessary bor_receipt func * onlny if bor * use clone * append * writeToSlice * added isBor flag * fixed writeToSlice * normal sorting * lint * Reset erigon-snapshots * Move bor prefix into if Co-authored-by: Krishna Upadhyaya <krishnau1604@gmail.com> Co-authored-by: Manav Darji <manavdarji.india@gmail.com> Co-authored-by: Uttam Singh <uttamkhanduja@yahoo.in> Co-authored-by: Giulio Rebuffo <giulio.rebuffo@gmail.com> Co-authored-by: Alex Sharp <alexsharp@Alexs-MacBook-Pro.local>
124 lines
3.5 KiB
Go
124 lines
3.5 KiB
Go
package bor
|
|
|
|
import (
|
|
"math/rand"
|
|
"sort"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/ledgerwatch/erigon/common"
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
const (
|
|
numVals = 100
|
|
)
|
|
|
|
func TestGetSignerSuccessionNumber_ProposerIsSigner(t *testing.T) {
|
|
validators := buildRandomValidatorSet(numVals)
|
|
validatorSet := NewValidatorSet(validators)
|
|
snap := Snapshot{
|
|
ValidatorSet: validatorSet,
|
|
}
|
|
|
|
// proposer is signer
|
|
signer := validatorSet.Proposer.Address
|
|
successionNumber, err := snap.GetSignerSuccessionNumber(signer)
|
|
if err != nil {
|
|
t.Fatalf("%s", err)
|
|
}
|
|
assert.Equal(t, 0, successionNumber)
|
|
}
|
|
|
|
func TestGetSignerSuccessionNumber_SignerIndexIsLarger(t *testing.T) {
|
|
validators := buildRandomValidatorSet(numVals)
|
|
|
|
// sort validators by address, which is what NewValidatorSet also does
|
|
sort.Sort(ValidatorsByAddress(validators))
|
|
proposerIndex := 32
|
|
signerIndex := 56
|
|
// give highest ProposerPriority to a particular val, so that they become the proposer
|
|
validators[proposerIndex].VotingPower = 200
|
|
snap := Snapshot{
|
|
ValidatorSet: NewValidatorSet(validators),
|
|
}
|
|
|
|
// choose a signer at an index greater than proposer index
|
|
signer := snap.ValidatorSet.Validators[signerIndex].Address
|
|
successionNumber, err := snap.GetSignerSuccessionNumber(signer)
|
|
if err != nil {
|
|
t.Fatalf("%s", err)
|
|
}
|
|
assert.Equal(t, signerIndex-proposerIndex, successionNumber)
|
|
}
|
|
|
|
func TestGetSignerSuccessionNumber_SignerIndexIsSmaller(t *testing.T) {
|
|
validators := buildRandomValidatorSet(numVals)
|
|
proposerIndex := 98
|
|
signerIndex := 11
|
|
// give highest ProposerPriority to a particular val, so that they become the proposer
|
|
validators[proposerIndex].VotingPower = 200
|
|
snap := Snapshot{
|
|
ValidatorSet: NewValidatorSet(validators),
|
|
}
|
|
|
|
// choose a signer at an index greater than proposer index
|
|
signer := snap.ValidatorSet.Validators[signerIndex].Address
|
|
successionNumber, err := snap.GetSignerSuccessionNumber(signer)
|
|
if err != nil {
|
|
t.Fatalf("%s", err)
|
|
}
|
|
assert.Equal(t, signerIndex+numVals-proposerIndex, successionNumber)
|
|
}
|
|
|
|
func TestGetSignerSuccessionNumber_ProposerNotFound(t *testing.T) {
|
|
validators := buildRandomValidatorSet(numVals)
|
|
snap := Snapshot{
|
|
ValidatorSet: NewValidatorSet(validators),
|
|
}
|
|
dummyProposerAddress := randomAddress()
|
|
snap.ValidatorSet.Proposer = &Validator{Address: dummyProposerAddress}
|
|
// choose any signer
|
|
signer := snap.ValidatorSet.Validators[3].Address
|
|
_, err := snap.GetSignerSuccessionNumber(signer)
|
|
assert.NotNil(t, err)
|
|
e, ok := err.(*UnauthorizedProposerError)
|
|
assert.True(t, ok)
|
|
assert.Equal(t, dummyProposerAddress.Bytes(), e.Proposer)
|
|
}
|
|
|
|
func TestGetSignerSuccessionNumber_SignerNotFound(t *testing.T) {
|
|
validators := buildRandomValidatorSet(numVals)
|
|
snap := Snapshot{
|
|
ValidatorSet: NewValidatorSet(validators),
|
|
}
|
|
dummySignerAddress := randomAddress()
|
|
_, err := snap.GetSignerSuccessionNumber(dummySignerAddress)
|
|
assert.NotNil(t, err)
|
|
e, ok := err.(*UnauthorizedSignerError)
|
|
assert.True(t, ok)
|
|
assert.Equal(t, dummySignerAddress.Bytes(), e.Signer)
|
|
}
|
|
|
|
func buildRandomValidatorSet(numVals int) []*Validator {
|
|
rand.Seed(time.Now().Unix())
|
|
validators := make([]*Validator, numVals)
|
|
for i := 0; i < numVals; i++ {
|
|
validators[i] = &Validator{
|
|
Address: randomAddress(),
|
|
// cannot process validators with voting power 0, hence +1
|
|
VotingPower: int64(rand.Intn(99) + 1),
|
|
}
|
|
}
|
|
|
|
// sort validators by address, which is what NewValidatorSet also does
|
|
sort.Sort(ValidatorsByAddress(validators))
|
|
return validators
|
|
}
|
|
|
|
func randomAddress() common.Address {
|
|
bytes := make([]byte, 32)
|
|
rand.Read(bytes)
|
|
return common.BytesToAddress(bytes)
|
|
}
|