cerc-io/lotus
16
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 27 Wiki Activity

use faster lookup for base fee

Browse Source
This commit is contained in:
vyzo 2020-09-05 21:03:22 +03:00
parent f9492691a6
commit ffb2640736
1 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
chain/messagepool/messagepool.go
View File

@ -370,12 +370,8 @@ func (mp *MessagePool) verifyMsgBeforeAdd(m *types.SignedMessage, curTs *types.T
// queues.
// Note that we don't do that for local messages, so that they can be accepted and republished
// automatically
if !local {
baseFee, err := mp.api.ChainComputeBaseFee(context.TODO(), curTs)
if err != nil {
return xerrors.Errorf("error computing base fee: %w", err)
}
if !local && len(curTs.Blocks()) > 0 {
baseFee := curTs.Blocks()[0].ParentBaseFee
baseFeeLowerBound := types.BigDiv(baseFee, baseFeeLowerBoundFactor)
if m.Message.GasFeeCap.LessThan(baseFeeLowerBound) {
return xerrors.Errorf("GasFeeCap doesn't meet base fee lower bound for inclusion in the next 20 blocks (GasFeeCap: %s, baseFeeLowerBound: %s): %w",