aboutsummaryrefslogtreecommitdiffstats
path: root/dex/handler.go
blob: 8e5898817c5ecea1598d6da1d2694206f4586355 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
// Copyright 2018 The dexon-consensus Authors
// This file is part of the dexon-consensus library.
//
// The dexon-consensus 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 dexon-consensus 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 dexon-consensus library. If not, see
// <http://www.gnu.org/licenses/>.

// Copyright 2015 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 dex

import (
    "bytes"
    "context"
    "encoding/json"
    "errors"
    "fmt"
    "math"
    "sync"
    "sync/atomic"
    "time"

    coreCommon "github.com/dexon-foundation/dexon-consensus/common"
    dexCore "github.com/dexon-foundation/dexon-consensus/core"
    coreCrypto "github.com/dexon-foundation/dexon-consensus/core/crypto"
    coreTypes "github.com/dexon-foundation/dexon-consensus/core/types"
    dkgTypes "github.com/dexon-foundation/dexon-consensus/core/types/dkg"

    "github.com/dexon-foundation/dexon/common"
    "github.com/dexon-foundation/dexon/consensus"
    "github.com/dexon-foundation/dexon/core"
    "github.com/dexon-foundation/dexon/core/types"
    "github.com/dexon-foundation/dexon/crypto"
    dexDB "github.com/dexon-foundation/dexon/dex/db"
    "github.com/dexon-foundation/dexon/dex/downloader"
    "github.com/dexon-foundation/dexon/dex/fetcher"
    "github.com/dexon-foundation/dexon/ethdb"
    "github.com/dexon-foundation/dexon/event"
    "github.com/dexon-foundation/dexon/log"
    "github.com/dexon-foundation/dexon/metrics"
    "github.com/dexon-foundation/dexon/p2p"
    "github.com/dexon-foundation/dexon/p2p/enode"
    "github.com/dexon-foundation/dexon/params"
    "github.com/dexon-foundation/dexon/rlp"
)

const (
    softResponseLimit = 2 * 1024 * 1024 // Target maximum size of returned blocks, headers or node data.
    estHeaderRlpSize  = 500             // Approximate size of an RLP encoded block header

    // txChanSize is the size of channel listening to NewTxsEvent.
    // The number is referenced from the size of tx pool.
    txChanSize = 4096

    minTxReceiver = 3

    finalizedBlockChanSize = 128

    maxPullPeers     = 3
    maxPullVotePeers = 1

    pullVoteRateLimit = 10 * time.Second

    maxAgreementResultBroadcast = 3
    maxFinalizedBlockBroadcast  = 3
)

// errIncompatibleConfig is returned if the requested protocols and configs are
// not compatible (low protocol version restrictions and high requirements).
var errIncompatibleConfig = errors.New("incompatible configuration")

func errResp(code errCode, format string, v ...interface{}) error {
    return fmt.Errorf("%v - %v", code, fmt.Sprintf(format, v...))
}

type ProtocolManager struct {
    networkID uint64

    fastSync  uint32 // Flag whether fast sync is enabled (gets disabled if we already have blocks)
    acceptTxs uint32 // Flag whether we're considered synchronised (enables transaction processing)

    txpool       txPool
    gov          governance
    blockchain   *core.BlockChain
    chainconfig  *params.ChainConfig
    cache        *cache
    nextPullVote *sync.Map
    maxPeers     int

    downloader *downloader.Downloader
    fetcher    *fetcher.Fetcher
    peers      *peerSet

    SubProtocols []p2p.Protocol

    eventMux *event.TypeMux
    txsCh    chan core.NewTxsEvent
    txsSub   event.Subscription

    whitelist map[uint64]common.Hash

    // channels for fetcher, syncer, txsyncLoop
    newPeerCh   chan *peer
    txsyncCh    chan *txsync
    quitSync    chan struct{}
    noMorePeers chan struct{}

    // channels for peerSetLoop
    chainHeadCh  chan core.ChainHeadEvent
    chainHeadSub event.Subscription

    // channels for dexon consensus core
    receiveCh          chan coreTypes.Msg
    reportBadPeerChan  chan interface{}
    receiveCoreMessage int32

    srvr p2pServer

    // wait group is used for graceful shutdowns during downloading
    // and processing
    wg sync.WaitGroup

    // Dexcon
    isBlockProposer bool
    app             dexconApp

    finalizedBlockCh  chan core.NewFinalizedBlockEvent
    finalizedBlockSub event.Subscription

    // metrics
    blockNumberGauge metrics.Gauge
}

// NewProtocolManager returns a new Ethereum sub protocol manager. The Ethereum sub protocol manages peers capable
// with the Ethereum network.
func NewProtocolManager(
    config *params.ChainConfig, mode downloader.SyncMode, networkID uint64,
    mux *event.TypeMux, txpool txPool, engine consensus.Engine,
    blockchain *core.BlockChain, chaindb ethdb.Database, whitelist map[uint64]common.Hash,
    isBlockProposer bool, gov governance, app dexconApp) (*ProtocolManager, error) {
    // Create the protocol manager with the base fields
    manager := &ProtocolManager{
        networkID:          networkID,
        eventMux:           mux,
        txpool:             txpool,
        gov:                gov,
        blockchain:         blockchain,
        cache:              newCache(5120, dexDB.NewDatabase(chaindb)),
        nextPullVote:       &sync.Map{},
        chainconfig:        config,
        whitelist:          whitelist,
        newPeerCh:          make(chan *peer),
        noMorePeers:        make(chan struct{}),
        txsyncCh:           make(chan *txsync),
        quitSync:           make(chan struct{}),
        receiveCh:          make(chan coreTypes.Msg, 1024),
        reportBadPeerChan:  make(chan interface{}, 128),
        receiveCoreMessage: 0,
        isBlockProposer:    isBlockProposer,
        app:                app,
        blockNumberGauge:   metrics.GetOrRegisterGauge("dex/blocknumber", nil),
    }

    // Figure out whether to allow fast sync or not
    if mode == downloader.FastSync && blockchain.CurrentBlock().NumberU64() > 0 {
        log.Warn("Blockchain not empty, fast sync disabled")
        mode = downloader.FullSync
    }
    if mode == downloader.FastSync {
        manager.fastSync = uint32(1)
    }
    // Initiate a sub-protocol for every implemented version we can handle
    manager.SubProtocols = make([]p2p.Protocol, 0, len(ProtocolVersions))
    for i, version := range ProtocolVersions {
        version := version // Closure for the run
        manager.SubProtocols = append(manager.SubProtocols, p2p.Protocol{
            Name:    ProtocolName,
            Version: version,
            Length:  ProtocolLengths[i],
            Run: func(p *p2p.Peer, rw p2p.MsgReadWriter) error {
                peer := manager.newPeer(int(version), p, rw)
                select {
                case manager.newPeerCh <- peer:
                    manager.wg.Add(1)
                    defer manager.wg.Done()
                    return manager.handle(peer)
                case <-manager.quitSync:
                    return p2p.DiscQuitting
                }
            },
            NodeInfo: func() interface{} {
                return manager.NodeInfo()
            },
            PeerInfo: func(id enode.ID) interface{} {
                if p := manager.peers.Peer(id.String()); p != nil {
                    return p.Info()
                }
                return nil
            },
        })
    }
    if len(manager.SubProtocols) == 0 {
        return nil, errIncompatibleConfig
    }
    // Construct the different synchronisation mechanisms
    manager.downloader = downloader.New(mode, chaindb, manager.eventMux, blockchain, nil, manager.removePeer)

    validator := func(header *types.Header) error {
        return blockchain.VerifyDexonHeader(header)
    }
    heighter := func() uint64 {
        return blockchain.CurrentBlock().NumberU64()
    }
    inserter := func(blocks types.Blocks) (int, error) {
        // If fast sync is running, deny importing weird blocks
        if atomic.LoadUint32(&manager.fastSync) == 1 {
            log.Warn("Discarded bad propagated block", "number", blocks[0].Number(), "hash", blocks[0].Hash())
            return 0, nil
        }
        atomic.StoreUint32(&manager.acceptTxs, 1) // Mark initial sync done on any fetcher import
        return manager.blockchain.InsertDexonChain(blocks)
    }
    manager.fetcher = fetcher.New(blockchain.GetBlockByHash, validator, manager.BroadcastBlock, heighter, inserter, manager.removePeer)

    return manager, nil
}

func (pm *ProtocolManager) removePeer(id string) {
    // Short circuit if the peer was already removed
    peer := pm.peers.Peer(id)
    if peer == nil {
        return
    }
    log.Debug("Removing Ethereum peer", "peer", id)

    pm.nextPullVote.Delete(peer.ID())

    // Unregister the peer from the downloader and Ethereum peer set
    pm.downloader.UnregisterPeer(id)
    log.Debug("after downloader unregister peer", "id", id)
    if err := pm.peers.Unregister(id); err != nil {
        log.Error("Peer removal failed", "peer", id, "err", err)
    }
    log.Debug("after unregister peer", "id", id)
    // Hard disconnect at the networking layer
    if peer != nil {
        log.Debug("removePeer: peer disconnect")
        peer.Peer.Disconnect(p2p.DiscUselessPeer)
    }
    log.Debug("peer removed", "id", id)
}

func (pm *ProtocolManager) Start(srvr p2pServer, maxPeers int) {
    pm.maxPeers = maxPeers
    pm.srvr = srvr
    pm.peers = newPeerSet(pm.gov, pm.srvr)

    // broadcast transactions
    pm.txsCh = make(chan core.NewTxsEvent, txChanSize)
    pm.txsSub = pm.txpool.SubscribeNewTxsEvent(pm.txsCh)
    go pm.txBroadcastLoop()

    if pm.isBlockProposer {
        // broadcast finalized blocks
        pm.finalizedBlockCh = make(chan core.NewFinalizedBlockEvent,
            finalizedBlockChanSize)
        pm.finalizedBlockSub = pm.app.SubscribeNewFinalizedBlockEvent(
            pm.finalizedBlockCh)
        go pm.finalizedBlockBroadcastLoop()
    }

    // run the peer set loop
    pm.chainHeadCh = make(chan core.ChainHeadEvent)
    pm.chainHeadSub = pm.blockchain.SubscribeChainHeadEvent(pm.chainHeadCh)
    go pm.peerSetLoop()

    // start sync handlers
    go pm.syncer()
    go pm.txsyncLoop()

    // Listen to bad peer and disconnect it.
    go pm.badPeerWatchLoop()
}

func (pm *ProtocolManager) Stop() {
    log.Info("Stopping DEXON protocol")

    pm.txsSub.Unsubscribe() // quits txBroadcastLoop
    pm.chainHeadSub.Unsubscribe()

    if pm.isBlockProposer {
        pm.finalizedBlockSub.Unsubscribe()
    }

    // Quit the sync loop.
    // After this send has completed, no new peers will be accepted.
    pm.noMorePeers <- struct{}{}

    // Quit fetcher, txsyncLoop.
    close(pm.quitSync)

    // Disconnect existing sessions.
    // This also closes the gate for any new registrations on the peer set.
    // sessions which are already established but not added to pm.peers yet
    // will exit when they try to register.
    pm.peers.Close()

    // Wait for all peer handler goroutines and the loops to come down.
    pm.wg.Wait()

    log.Info("DEXON protocol stopped")
}

func (pm *ProtocolManager) ReceiveChan() <-chan coreTypes.Msg {
    return pm.receiveCh
}

func (pm *ProtocolManager) ReportBadPeerChan() chan<- interface{} {
    return pm.reportBadPeerChan
}

func (pm *ProtocolManager) badPeerWatchLoop() {
    for {
        select {
        case id := <-pm.reportBadPeerChan:
            log.Debug("Bad peer detected, removing", "id", id.(string))
            pm.removePeer(id.(string))
        case <-pm.quitSync:
            return
        }
    }
}

func (pm *ProtocolManager) newPeer(pv int, p *p2p.Peer, rw p2p.MsgReadWriter) *peer {
    return newPeer(pv, p, newMeteredMsgWriter(rw))
}

// handle is the callback invoked to manage the life cycle of an eth peer. When
// this function terminates, the peer is disconnected.
func (pm *ProtocolManager) handle(p *peer) error {
    // Ignore maxPeers if this is a trusted peer
    if pm.peers.Len() >= pm.maxPeers && !p.Peer.Info().Network.Trusted {
        return p2p.DiscTooManyPeers
    }
    p.Log().Debug("Ethereum peer connected", "name", p.Name())

    // Execute the Ethereum handshake
    var (
        genesis = pm.blockchain.Genesis()
        head    = pm.blockchain.CurrentBlock().Header()
        hash    = head.Hash()
        number  = head.Number.Uint64()
    )
    if err := p.Handshake(pm.networkID, number, hash, genesis.Hash()); err != nil {
        p.Log().Debug("Ethereum handshake failed", "err", err)
        return err
    }
    if rw, ok := p.rw.(*meteredMsgReadWriter); ok {
        rw.Init(p.version)
    }
    // Register the peer locally
    if err := pm.peers.Register(p); err != nil {
        p.Log().Error("Ethereum peer registration failed", "err", err)
        return err
    }
    defer pm.removePeer(p.id)

    // Register the peer in the downloader. If the downloader considers it banned, we disconnect
    if err := pm.downloader.RegisterPeer(p.id, p.version, p); err != nil {
        return err
    }
    // Propagate existing transactions. new transactions appearing
    // after this will be sent via broadcasts.
    pm.syncTransactions(p)

    // If we have any explicit whitelist block hashes, request them
    for number := range pm.whitelist {
        if err := p.RequestWhitelistHeader(number); err != nil {
            return err
        }
    }

    // Handle incoming messages until the connection is torn down
    for {
        if err := pm.handleMsg(p); err != nil {
            p.Log().Debug("Ethereum message handling failed", "err", err)
            return err
        }
    }
}

// handleMsg is invoked whenever an inbound message is received from a remote
// peer. The remote connection is torn down upon returning any error.
func (pm *ProtocolManager) handleMsg(p *peer) error {
    ch := make(chan struct{})
    defer close(ch)

    go func() {
        maxDelay := time.Minute
        delay := 1 * time.Second
        start := time.Now()
        for {
            select {
            case <-time.After(delay):
                delay *= 2
                if delay > maxDelay {
                    delay = maxDelay
                }
                p.Log().Debug("no msg for a while", "t", time.Since(start))
            case <-ch:
                return
            }
        }
    }()

    // Read the next message from the remote peer, and ensure it's fully consumed
    msg, err := p.rw.ReadMsg()
    if err != nil {
        return err
    }
    ch <- struct{}{}
    if msg.Size > ProtocolMaxMsgSize {
        return errResp(ErrMsgTooLarge, "%v > %v", msg.Size, ProtocolMaxMsgSize)
    }
    defer msg.Discard()

    go func() {
        start := time.Now()
        for {
            select {
            case <-time.After(100 * time.Millisecond):
                p.Log().Debug("handle msg too long", "code", msg.Code, "t", time.Since(start))
            case <-ch:
                return
            }
        }
    }()

    // Handle the message depending on its contents
    switch {
    case msg.Code == StatusMsg:
        // Status messages should never arrive after the handshake
        return errResp(ErrExtraStatusMsg, "uncontrolled status message")

    // Block header query, collect the requested headers and reply
    case msg.Code == GetBlockHeadersMsg:
        // Decode the complex header query
        var query getBlockHeadersData
        if err := msg.Decode(&query); err != nil {
            return errResp(ErrDecode, "%v: %v", msg, err)
        }
        hashMode := query.Origin.Hash != (common.Hash{})
        first := true
        maxNonCanonical := uint64(100)

        round := map[uint64]uint64{}
        // Gather headers until the fetch or network limits is reached
        var (
            bytes   common.StorageSize
            headers []*types.HeaderWithGovState
            unknown bool
        )
        for !unknown && len(headers) < int(query.Amount) && bytes < softResponseLimit && len(headers) < downloader.MaxHeaderFetch {
            // Retrieve the next header satisfying the query
            var origin *types.Header
            if hashMode {
                if first {
                    first = false
                    origin = pm.blockchain.GetHeaderByHash(query.Origin.Hash)
                    if origin != nil {
                        query.Origin.Number = origin.Number.Uint64()
                    }
                } else {
                    origin = pm.blockchain.GetHeader(query.Origin.Hash, query.Origin.Number)
                }
            } else {
                origin = pm.blockchain.GetHeaderByNumber(query.Origin.Number)
            }
            if origin == nil {
                break
            }
            headers = append(headers, &types.HeaderWithGovState{Header: origin})
            if round[origin.Round] == 0 {
                round[origin.Round] = origin.Number.Uint64()
            }
            bytes += estHeaderRlpSize

            // Advance to the next header of the query
            switch {
            case hashMode && query.Reverse:
                // Hash based traversal towards the genesis block
                ancestor := query.Skip + 1
                if ancestor == 0 {
                    unknown = true
                } else {
                    query.Origin.Hash, query.Origin.Number = pm.blockchain.GetAncestor(query.Origin.Hash, query.Origin.Number, ancestor, &maxNonCanonical)
                    unknown = (query.Origin.Hash == common.Hash{})
                }
            case hashMode && !query.Reverse:
                // Hash based traversal towards the leaf block
                var (
                    current = origin.Number.Uint64()
                    next    = current + query.Skip + 1
                )
                if next <= current {
                    infos, _ := json.MarshalIndent(p.Peer.Info(), "", "  ")
                    p.Log().Warn("GetBlockHeaders skip overflow attack", "current", current, "skip", query.Skip, "next", next, "attacker", infos)
                    unknown = true
                } else {
                    if header := pm.blockchain.GetHeaderByNumber(next); header != nil {
                        nextHash := header.Hash()
                        expOldHash, _ := pm.blockchain.GetAncestor(nextHash, next, query.Skip+1, &maxNonCanonical)
                        if expOldHash == query.Origin.Hash {
                            query.Origin.Hash, query.Origin.Number = nextHash, next
                        } else {
                            unknown = true
                        }
                    } else {
                        unknown = true
                    }
                }
            case query.Reverse:
                // Number based traversal towards the genesis block
                if query.Origin.Number >= query.Skip+1 {
                    query.Origin.Number -= query.Skip + 1
                } else {
                    unknown = true
                }

            case !query.Reverse:
                // Number based traversal towards the leaf block
                query.Origin.Number += query.Skip + 1
            }
        }

        if query.WithGov && len(headers) > 0 {
            last := headers[len(headers)-1]
            currentBlock := pm.blockchain.CurrentBlock()

            // Do not reply if we don't have current gov state
            if currentBlock.NumberU64() < last.Number.Uint64() {
                log.Debug("Current block < last request",
                    "current", currentBlock.NumberU64(), "last", last.Number.Uint64())
                return p.SendBlockHeaders(query.Flag, []*types.HeaderWithGovState{})
            }

            snapshotHeight := map[uint64]struct{}{}
            for r, height := range round {
                log.Trace("#Include round", "round", r)
                if r == 0 {
                    continue
                }
                h := pm.gov.GetRoundHeight(r)
                log.Trace("#Snapshot height", "height", h)
                if h == 0 {
                    h = height
                }
                snapshotHeight[h] = struct{}{}
            }

            for _, header := range headers {
                if _, exist := snapshotHeight[header.Number.Uint64()]; exist {
                    s, err := pm.blockchain.GetGovStateByHash(header.Hash())
                    if err != nil {
                        log.Warn("Get gov state by hash fail", "number", header.Number.Uint64(), "err", err)
                        return p.SendBlockHeaders(query.Flag, []*types.HeaderWithGovState{})
                    }
                    header.GovState = s
                }
                log.Trace("Send header", "round", header.Round, "number", header.Number.Uint64(), "gov state == nil", header.GovState == nil)
            }
        }
        return p.SendBlockHeaders(query.Flag, headers)

    case msg.Code == BlockHeadersMsg:
        // A batch of headers arrived to one of our previous requests
        var data headersData
        if err := msg.Decode(&data); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }

        switch data.Flag {
        case fetcherReq:
            if len(data.Headers) > 0 {
                pm.fetcher.FilterHeaders(p.id, []*types.Header{data.Headers[0].Header}, time.Now())
            }
        case downloaderReq:
            err := pm.downloader.DeliverHeaders(p.id, data.Headers)
            if err != nil {
                log.Debug("Failed to deliver headers", "err", err)
            }
        case whitelistReq:
            if want, ok := pm.whitelist[data.Headers[0].Number.Uint64()]; ok {
                if hash := data.Headers[0].Hash(); want != hash {
                    p.Log().Info("Whitelist mismatch, dropping peer", "number", data.Headers[0].Number.Uint64(), "hash", hash, "want", want)
                    return errors.New("whitelist block mismatch")
                }
                p.Log().Debug("Whitelist block verified", "number", data.Headers[0].Number.Uint64(), "hash", want)
            }
        default:
            log.Debug("Got headers with unexpected flag", "flag", data.Flag)
        }

    case msg.Code == GetBlockBodiesMsg:
        // Decode the retrieval message
        var query getBlockBodiesData
        if err := msg.Decode(&query); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }

        msgStream := rlp.NewStream(bytes.NewBuffer(query.Hashes), uint64(len(query.Hashes)))
        if _, err := msgStream.List(); err != nil {
            return err
        }
        // Gather blocks until the fetch or network limits is reached
        var (
            hash   common.Hash
            bytes  int
            bodies []rlp.RawValue
        )
        for bytes < softResponseLimit && len(bodies) < downloader.MaxBlockFetch {
            // Retrieve the hash of the next block
            if err := msgStream.Decode(&hash); err == rlp.EOL {
                break
            } else if err != nil {
                return errResp(ErrDecode, "msg %v: %v", msg, err)
            }
            // Retrieve the requested block body, stopping if enough was found
            if data := pm.blockchain.GetBodyRLP(hash); len(data) != 0 {
                bodies = append(bodies, data)
                bytes += len(data)
            }
        }
        return p.SendBlockBodiesRLP(query.Flag, bodies)

    case msg.Code == BlockBodiesMsg:
        // A batch of block bodies arrived to one of our previous requests
        var request blockBodiesData
        if err := msg.Decode(&request); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        // Deliver them all to the downloader for queuing
        transactions := make([][]*types.Transaction, len(request.Bodies))
        uncles := make([][]*types.Header, len(request.Bodies))

        for i, body := range request.Bodies {
            transactions[i] = body.Transactions
            uncles[i] = body.Uncles
        }

        switch request.Flag {
        case fetcherReq:
            if len(transactions) > 0 || len(uncles) > 0 {
                pm.fetcher.FilterBodies(p.id, transactions, uncles, time.Now())
            }
        case downloaderReq:
            err := pm.downloader.DeliverBodies(p.id, transactions, uncles)
            if err != nil {
                log.Debug("Failed to deliver bodies", "err", err)
            }
        default:
            log.Debug("Got bodies with unexpected flag", "flag", request.Flag)
        }

    case msg.Code == GetNodeDataMsg:
        // Decode the retrieval message
        msgStream := rlp.NewStream(msg.Payload, uint64(msg.Size))
        if _, err := msgStream.List(); err != nil {
            return err
        }
        // Gather state data until the fetch or network limits is reached
        var (
            hash  common.Hash
            bytes int
            data  [][]byte
        )
        for bytes < softResponseLimit && len(data) < downloader.MaxStateFetch {
            // Retrieve the hash of the next state entry
            if err := msgStream.Decode(&hash); err == rlp.EOL {
                break
            } else if err != nil {
                return errResp(ErrDecode, "msg %v: %v", msg, err)
            }
            // Retrieve the requested state entry, stopping if enough was found
            if entry, err := pm.blockchain.TrieNode(hash); err == nil {
                data = append(data, entry)
                bytes += len(entry)
            }
        }
        return p.SendNodeData(data)

    case msg.Code == NodeDataMsg:
        // A batch of node state data arrived to one of our previous requests
        var data [][]byte
        if err := msg.Decode(&data); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        // Deliver all to the downloader
        if err := pm.downloader.DeliverNodeData(p.id, data); err != nil {
            log.Debug("Failed to deliver node state data", "err", err)
        }

    case msg.Code == GetReceiptsMsg:
        // Decode the retrieval message
        msgStream := rlp.NewStream(msg.Payload, uint64(msg.Size))
        if _, err := msgStream.List(); err != nil {
            return err
        }
        // Gather state data until the fetch or network limits is reached
        var (
            hash     common.Hash
            bytes    int
            receipts []rlp.RawValue
        )
        for bytes < softResponseLimit && len(receipts) < downloader.MaxReceiptFetch {
            // Retrieve the hash of the next block
            if err := msgStream.Decode(&hash); err == rlp.EOL {
                break
            } else if err != nil {
                return errResp(ErrDecode, "msg %v: %v", msg, err)
            }
            // Retrieve the requested block's receipts, skipping if unknown to us
            results := pm.blockchain.GetReceiptsByHash(hash)
            if results == nil {
                if header := pm.blockchain.GetHeaderByHash(hash); header == nil || header.ReceiptHash != types.EmptyRootHash {
                    continue
                }
            }
            // If known, encode and queue for response packet
            if encoded, err := rlp.EncodeToBytes(results); err != nil {
                log.Error("Failed to encode receipt", "err", err)
            } else {
                receipts = append(receipts, encoded)
                bytes += len(encoded)
            }
        }
        return p.SendReceiptsRLP(receipts)

    case msg.Code == ReceiptsMsg:
        // A batch of receipts arrived to one of our previous requests
        var receipts [][]*types.Receipt
        if err := msg.Decode(&receipts); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        // Deliver all to the downloader
        if err := pm.downloader.DeliverReceipts(p.id, receipts); err != nil {
            log.Debug("Failed to deliver receipts", "err", err)
        }

    case msg.Code == NewBlockHashesMsg:
        var announces newBlockHashesData
        if err := msg.Decode(&announces); err != nil {
            return errResp(ErrDecode, "%v: %v", msg, err)
        }
        // Mark the hashes as present at the remote node
        for _, block := range announces {
            p.MarkBlock(block.Hash)
        }
        // Schedule all the unknown hashes for retrieval
        unknown := make(newBlockHashesData, 0, len(announces))
        for _, block := range announces {
            if !pm.blockchain.HasBlock(block.Hash, block.Number) {
                unknown = append(unknown, block)
            }
        }
        for _, block := range unknown {
            pm.fetcher.Notify(p.id, block.Hash, block.Number, time.Now(), p.RequestOneHeader, p.FetchBodies)
        }

    case msg.Code == NewBlockMsg:
        // Retrieve and decode the propagated block
        var block types.Block
        if err := msg.Decode(&block); err != nil {
            return errResp(ErrDecode, "%v: %v", msg, err)
        }
        block.ReceivedAt = msg.ReceivedAt
        block.ReceivedFrom = p

        // Mark the peer as owning the block and schedule it for import
        p.MarkBlock(block.Hash())
        pm.fetcher.Enqueue(p.id, &block)

        // Assuming the block is importable by the peer, but possibly not yet done so,
        // calculate the head hash and number that the peer truly must have.
        var (
            trueHead   = block.ParentHash()
            trueNumber = block.NumberU64() - 1
        )
        // Update the peers number if better than the previous
        if _, number := p.Head(); trueNumber > number {
            p.SetHead(trueHead, trueNumber)

            // Schedule a sync if above ours. Note, this will not fire a sync for a gap of
            // a single block (as the true number is below the propagated block), however this
            // scenario should easily be covered by the fetcher.
            currentBlock := pm.blockchain.CurrentBlock()
            if trueNumber > currentBlock.NumberU64() {
                go pm.synchronise(p, false)
            }
        }

    case msg.Code == TxMsg:
        // Transactions arrived, make sure we have a valid and fresh chain to handle them
        if atomic.LoadUint32(&pm.acceptTxs) == 0 {
            break
        }
        // Transactions can be processed, parse all of them and deliver to the pool
        var txs []*types.Transaction
        if err := msg.Decode(&txs); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        for i, tx := range txs {
            // Validate and mark the remote transaction
            if tx == nil {
                return errResp(ErrDecode, "transaction %d is nil", i)
            }
            p.MarkTransaction(tx.Hash())
        }
        types.GlobalSigCache.Add(types.NewEIP155Signer(pm.blockchain.Config().ChainID), txs)
        pm.txpool.AddRemotes(txs)

    // Block proposer-only messages.
    case msg.Code == CoreBlockMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        var blocks []*coreTypes.Block
        if err := msg.Decode(&blocks); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        pm.cache.addBlocks(blocks)
        for _, block := range blocks {
            pm.receiveCh <- coreTypes.Msg{
                PeerID:  p.ID().String(),
                Payload: block,
            }
        }
    case msg.Code == VoteMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        var votes []*coreTypes.Vote
        if err := msg.Decode(&votes); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        for _, vote := range votes {
            if vote.Type >= coreTypes.VotePreCom {
                pm.cache.addVote(vote)
            }
            pm.receiveCh <- coreTypes.Msg{
                PeerID:  p.ID().String(),
                Payload: vote,
            }
        }
    case msg.Code == AgreementMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        // DKG set is receiver
        var agreement coreTypes.AgreementResult
        if err := msg.Decode(&agreement); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        p.MarkAgreement(agreement.Position)
        // Update randomness field for blocks in cache.
        block := pm.cache.blocks(coreCommon.Hashes{agreement.BlockHash}, false)
        if len(block) != 0 {
            block[0].Randomness = agreement.Randomness
            pm.cache.addFinalizedBlock(block[0])
        }
        pm.receiveCh <- coreTypes.Msg{
            PeerID:  p.ID().String(),
            Payload: &agreement,
        }
    case msg.Code == DKGPrivateShareMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        // Do not relay this msg
        var ps dkgTypes.PrivateShare
        if err := msg.Decode(&ps); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        p.MarkDKGPrivateShares(rlpHash(ps))
        pm.receiveCh <- coreTypes.Msg{
            PeerID:  p.ID().String(),
            Payload: &ps,
        }
    case msg.Code == DKGPartialSignatureMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        // broadcast in DKG set
        var psig dkgTypes.PartialSignature
        if err := msg.Decode(&psig); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        pm.receiveCh <- coreTypes.Msg{
            PeerID:  p.ID().String(),
            Payload: &psig,
        }
    case msg.Code == PullBlocksMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        var hashes coreCommon.Hashes
        if err := msg.Decode(&hashes); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        blocks := pm.cache.blocks(hashes, true)
        log.Debug("Push blocks", "blocks", blocks)
        return p.SendCoreBlocks(blocks)
    case msg.Code == PullVotesMsg:
        if atomic.LoadInt32(&pm.receiveCoreMessage) == 0 {
            break
        }
        next, ok := pm.nextPullVote.Load(p.ID())
        if ok {
            nextTime := next.(time.Time)
            if nextTime.After(time.Now()) {
                break
            }
        }
        pm.nextPullVote.Store(p.ID(), time.Now().Add(pullVoteRateLimit))
        var pos coreTypes.Position
        if err := msg.Decode(&pos); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        if block := pm.cache.finalizedBlock(pos); block != nil {
            log.Debug("Push finalized block as votes", "block", block)
            return p.SendCoreBlocks([]*coreTypes.Block{block})
        }
        votes := pm.cache.votes(pos)
        log.Debug("Push votes", "votes", votes)
        return p.SendVotes(votes)
    case msg.Code == GetGovStateMsg:
        var hash common.Hash
        if err := msg.Decode(&hash); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        govState, err := pm.blockchain.GetGovStateByHash(hash)
        if err != nil {
            p.Log().Debug("Invalid gov state msg", "hash", hash.String(), "err", err)
            return errResp(ErrInvalidGovStateMsg, "hash=%v", hash.String())
        }
        return p.SendGovState(govState)
    case msg.Code == GovStateMsg:
        var govState types.GovState
        if err := msg.Decode(&govState); err != nil {
            return errResp(ErrDecode, "msg %v: %v", msg, err)
        }
        if err := pm.downloader.DeliverGovState(p.id, &govState); err != nil {
            log.Debug("Failed to deliver govstates", "err", err)
        }
    default:
        return errResp(ErrInvalidMsgCode, "%v", msg.Code)
    }
    return nil
}

// BroadcastBlock will either propagate a block to a subset of it's peers, or
// will only announce it's availability (depending what's requested).
func (pm *ProtocolManager) BroadcastBlock(block *types.Block, propagate bool) {
    hash := block.Hash()
    peers := pm.peers.PeersWithoutBlock(hash)

    // If propagation is requested, send to a subset of the peer
    if propagate {
        if parent := pm.blockchain.GetBlock(block.ParentHash(), block.NumberU64()-1); parent == nil {
            log.Error("Propagating dangling block", "number", block.Number(), "hash", hash)
            return
        }
        // Send the block to a subset of our peers
        transfer := peers[:int(math.Sqrt(float64(len(peers))))]
        for _, peer := range transfer {
            peer.AsyncSendNewBlock(block)
        }
        log.Trace("Propagated block", "hash", hash, "recipients", len(transfer), "duration", common.PrettyDuration(time.Since(block.ReceivedAt)))
        return
    }
    // Otherwise if the block is indeed in out own chain, announce it
    if pm.blockchain.HasBlock(hash, block.NumberU64()) {
        for _, peer := range peers {
            peer.AsyncSendNewBlockHash(block)
        }
        log.Trace("Announced block", "hash", hash, "recipients", len(peers), "duration", common.PrettyDuration(time.Since(block.ReceivedAt)))
    }
}

// BroadcastTxs will propagate a batch of transactions to all peers which are not known to
// already have the given transaction.
func (pm *ProtocolManager) BroadcastTxs(txs types.Transactions) {
    round := pm.blockchain.CurrentBlock().Round()
    label := peerLabel{
        set:   notaryset,
        round: round,
    }

    // Send to at most `notaryReceiverNum`.
    // If we don't have many notary peers,
    // send to at least `minTxReceiver` notary peers. (set notaryReceiverNum = minTxReceiver)
    notaryPeers := pm.peers.PeersWithLabel(label)
    notaryReceiverNum := int(math.Sqrt(float64(len(notaryPeers))))
    if notaryReceiverNum < minTxReceiver {
        notaryReceiverNum = minTxReceiver
    }

    // Send to at most `maxReceiver` peers (including notary peers).
    // If we don't have many peers,
    // send to a least `minTxReceiver` peers. (set maxReceiver = minTxReceiver)
    peers := pm.peers.Peers()
    maxReceiver := int(math.Sqrt(float64(len(peers))))
    if maxReceiver < minTxReceiver {
        maxReceiver = minTxReceiver
    }

    var txset = make(map[*peer]types.Transactions)
    // Broadcast transactions to a batch of peers not knowing about it
    for _, tx := range txs {
        receivers := make(map[*peer]struct{})

        // notary peers first
        for _, peer := range notaryPeers {
            if !peer.knownTxs.Contains(tx.Hash()) {
                receivers[peer] = struct{}{}
            }
            if len(receivers) >= notaryReceiverNum {
                break
            }
        }

        for _, peer := range peers {
            if len(receivers) >= maxReceiver {
                break
            }

            // not add to receivers yet and not known the tx
            if _, ok := receivers[peer]; !ok && !peer.knownTxs.Contains(tx.Hash()) {
                receivers[peer] = struct{}{}
            }
        }

        for peer := range receivers {
            txset[peer] = append(txset[peer], tx)
        }
        log.Trace("Broadcast transaction", "hash", tx.Hash(), "recipients", len(receivers))
    }

    for peer, txs := range txset {
        peer.AsyncSendTransactions(txs)
    }
}

// BroadcastFinalizedBlock broadcasts the finalized core block to some of its peers.
func (pm *ProtocolManager) BroadcastFinalizedBlock(block *coreTypes.Block) {
    if len(block.Randomness) == 0 {
        log.Warn("Ignore broadcast finalized block without randomness", "block", block)
        return
    }
    pm.cache.addFinalizedBlock(block)

    // send to notary nodes first (direct)
    label := peerLabel{
        set:   notaryset,
        round: block.Position.Round,
    }
    peers := pm.peers.PeersWithLabel(label)
    count := maxFinalizedBlockBroadcast
    for _, peer := range peers {
        if count <= 0 {
            break
        } else {
            count--
            peer.AsyncSendCoreBlocks([]*coreTypes.Block{block})
        }
    }
}

// BroadcastCoreBlock broadcasts the core block to all its peers.
func (pm *ProtocolManager) BroadcastCoreBlock(block *coreTypes.Block) {
    pm.cache.addBlock(block)
    // send to notary nodes only.
    label := peerLabel{
        set:   notaryset,
        round: block.Position.Round,
    }
    for _, peer := range pm.peers.PeersWithLabel(label) {
        peer.AsyncSendCoreBlocks([]*coreTypes.Block{block})
    }
}

// BroadcastVote broadcasts the given vote to all peers in same notary set
func (pm *ProtocolManager) BroadcastVote(vote *coreTypes.Vote) {
    if vote.Type >= coreTypes.VotePreCom {
        pm.cache.addVote(vote)
    }
    label := peerLabel{
        set:   notaryset,
        round: vote.Position.Round,
    }
    for _, peer := range pm.peers.PeersWithLabel(label) {
        peer.AsyncSendVotes([]*coreTypes.Vote{vote})
    }
}

func (pm *ProtocolManager) BroadcastAgreementResult(
    agreement *coreTypes.AgreementResult) {
    block := pm.cache.blocks(coreCommon.Hashes{agreement.BlockHash}, false)
    if len(block) != 0 {
        block[0].Randomness = agreement.Randomness
        pm.cache.addFinalizedBlock(block[0])
    }

    // send to notary nodes first (direct)
    label := peerLabel{
        set:   notaryset,
        round: agreement.Position.Round,
    }
    peers := pm.peers.PeersWithLabel(label)
    count := maxAgreementResultBroadcast
    for _, peer := range peers {
        if peer.MarkAgreement(agreement.Position) {
            if count <= 0 {
                continue
            }
            count--
            peer.AsyncSendAgreement(agreement)
        }
    }

    for _, peer := range pm.peers.PeersWithoutAgreement(agreement.Position) {
        peer.MarkAgreement(agreement.Position)
        peer.AsyncSendAgreement(agreement)
    }
}

func (pm *ProtocolManager) SendDKGPrivateShare(
    pub coreCrypto.PublicKey, privateShare *dkgTypes.PrivateShare) {

    pk, err := crypto.UnmarshalPubkey(pub.Bytes())
    if err != nil {
        panic(err)
    }

    id := enode.PubkeyToIDV4(pk)

    if p := pm.peers.Peer(id.String()); p != nil {
        p.AsyncSendDKGPrivateShare(privateShare)
    } else {
        log.Error("Failed to send DKG private share", "publicKey", id.String())
    }
}

func (pm *ProtocolManager) BroadcastDKGPrivateShare(
    privateShare *dkgTypes.PrivateShare) {
    label := peerLabel{set: notaryset, round: privateShare.Round}
    for _, peer := range pm.peers.PeersWithLabel(label) {
        if !peer.knownDKGPrivateShares.Contains(rlpHash(privateShare)) {
            peer.AsyncSendDKGPrivateShare(privateShare)
        }
    }
}

func (pm *ProtocolManager) BroadcastDKGPartialSignature(
    psig *dkgTypes.PartialSignature) {
    label := peerLabel{set: notaryset, round: psig.Round}
    for _, peer := range pm.peers.PeersWithLabel(label) {
        peer.AsyncSendDKGPartialSignature(psig)
    }
}

func (pm *ProtocolManager) BroadcastPullBlocks(
    hashes coreCommon.Hashes) {
    // TODO(jimmy-dexon): pull from notary set only.
    for idx, peer := range pm.peers.Peers() {
        if idx >= maxPullPeers {
            break
        }
        peer.AsyncSendPullBlocks(hashes)
    }
}

func (pm *ProtocolManager) BroadcastPullVotes(
    pos coreTypes.Position) {
    label := peerLabel{
        set:   notaryset,
        round: pos.Round,
    }
    for idx, peer := range pm.peers.PeersWithLabel(label) {
        if idx >= maxPullVotePeers {
            break
        }
        peer.AsyncSendPullVotes(pos)
    }
}

func (pm *ProtocolManager) txBroadcastLoop() {
    queueSizeMax := common.StorageSize(100 * 1024) // 100 KB
    currentSize := common.StorageSize(0)
    txs := make(types.Transactions, 0)
    for {
        select {
        case <-time.After(100 * time.Millisecond):
            pm.BroadcastTxs(txs)
            txs = txs[:0]
            currentSize = 0
        case event := <-pm.txsCh:
            txs = append(txs, event.Txs...)
            for _, tx := range event.Txs {
                currentSize += tx.Size()
            }
            if currentSize >= queueSizeMax {
                pm.BroadcastTxs(txs)
                txs = txs[:0]
                currentSize = 0
            }

        // Err() channel will be closed when unsubscribing.
        case <-pm.txsSub.Err():
            return
        }
    }
}

func (pm *ProtocolManager) finalizedBlockBroadcastLoop() {
    for {
        select {
        case event := <-pm.finalizedBlockCh:
            pm.BroadcastBlock(event.Block, true)
            pm.BroadcastBlock(event.Block, false)

        // Err() channel will be closed when unsubscribing.
        case <-pm.finalizedBlockSub.Err():
            return
        }
    }
}

func (pm *ProtocolManager) SetReceiveCoreMessage(enabled bool) {
    if enabled {
        atomic.StoreInt32(&pm.receiveCoreMessage, 1)
    } else {
        atomic.StoreInt32(&pm.receiveCoreMessage, 0)
    }
}

// a loop keep building and maintaining peers in notary set.
// TODO: finish this
func (pm *ProtocolManager) peerSetLoop() {
    round := pm.gov.Round()
    resetCount := pm.gov.DKGResetCount(round)
    log.Debug("ProtocolManager: startup round",
        "round", round,
        "reset", resetCount)

    if round < dexCore.DKGDelayRound {
        for i := round; i <= dexCore.DKGDelayRound; i++ {
            pm.peers.BuildConnection(i)
        }
        round = dexCore.DKGDelayRound
    } else {
        pm.peers.BuildConnection(round)
    }
    CRSRound := pm.gov.CRSRound()
    if CRSRound > round {
        pm.peers.BuildConnection(CRSRound)
        round = CRSRound
        resetCount = pm.gov.DKGResetCount(round)
    }

    ctx, cancel := context.WithCancel(context.Background())
    defer cancel()
    go func() {
        for ctx.Err() == nil {
            select {
            case <-time.After(time.Minute):
                pm.peers.Status()
            case <-ctx.Done():
                return
            }
        }
    }()

    for {
        select {
        case event := <-pm.chainHeadCh:
            pm.blockNumberGauge.Update(int64(event.Block.NumberU64()))

            if !pm.isBlockProposer {
                break
            }

            newRound := pm.gov.CRSRound()
            if newRound == 0 {
                break
            }
            reset := pm.gov.DKGResetCount(round)

            log.Debug("ProtocolManager: new round",
                "round", newRound,
                "reset", reset)
            if newRound <= round && resetCount == reset {
                break
            }

            if newRound == round+1 {
                pm.peers.BuildConnection(newRound)
                if round >= 1 {
                    pm.peers.ForgetConnection(round - 1)
                }
            } else if newRound == round && resetCount+1 == reset {
                pm.peers.ForgetLabelConnection(peerLabel{set: notaryset, round: newRound})
                pm.gov.PurgeNotarySet(newRound)
                pm.peers.BuildConnection(newRound)
            } else {
                // just forget all network connection and rebuild.
                pm.peers.ForgetConnection(round)

                if newRound >= 1 {
                    pm.peers.BuildConnection(newRound - 1)
                }
                pm.peers.BuildConnection(newRound)
            }
            round = newRound
            resetCount = reset
        case <-pm.chainHeadSub.Err():
            return
        }
    }
}

// NodeInfo represents a short summary of the Ethereum sub-protocol metadata
// known about the host peer.
type NodeInfo struct {
    Network uint64              `json:"network"` // DEXON network ID (237=Mainnet, 238=Taiwan, 239=Taipei, 240=Yilan)
    Number  uint64              `json:"number"`  // Total difficulty of the host's blockchain
    Genesis common.Hash         `json:"genesis"` // SHA3 hash of the host's genesis block
    Config  *params.ChainConfig `json:"config"`  // Chain configuration for the fork rules
    Head    common.Hash         `json:"head"`    // SHA3 hash of the host's best owned block
}

// NodeInfo retrieves some protocol metadata about the running host node.
func (pm *ProtocolManager) NodeInfo() *NodeInfo {
    currentBlock := pm.blockchain.CurrentBlock()
    return &NodeInfo{
        Network: pm.networkID,
        Number:  currentBlock.NumberU64(),
        Genesis: pm.blockchain.Genesis().Hash(),
        Config:  pm.blockchain.Config(),
        Head:    currentBlock.Hash(),
    }
}