/
slashing_plugin.go
721 lines (641 loc) · 30.9 KB
/
slashing_plugin.go
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
package plugin
import (
"bytes"
"crypto/ecdsa"
"encoding/hex"
"encoding/json"
"fmt"
"math/big"
"sync"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/rlp"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/pos/gov"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/pos/slashing"
"github.com/pkg/errors"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/common"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/common/consensus"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/common/vm"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/ethereum/core/db/snapshotdb"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/ethereum/core/types"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/crypto"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/libs/log"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/ethereum/p2p/discover"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/pos/staking"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/pos/xcom"
"github.com/PhoenixGlobal/Phoenix-Chain-SDK/pos/xutil"
)
const (
HundredDenominator = 100
TenThousandDenominator = 10000
)
var (
// The prefix key of the number of blocks packed in the recording node
packAmountPrefix = []byte("nodePackAmount")
// Nodes with zero block behavior are stored in this list; This value is the key of the list
waitSlashingNodeListKey = []byte("waitSlashingNodeList")
once sync.Once
slash *SlashingPlugin
)
// Nodes with zero blocks will construct this structure and store it in the queue waiting for punishment.
type WaitSlashingNode struct {
NodeId discover.NodeID
// The number of consensus rounds when the first zero block appeared
Round uint64
// Used to record the number of times the node has zero blocks.
// Each bit represents whether each consensus round is zero block.
CountBit uint64
}
func (w *WaitSlashingNode) String() string {
v, err := json.Marshal(w)
if err != nil {
panic(err)
}
return string(v)
}
type SlashingPlugin struct {
db snapshotdb.DB
decodeEvidence func(dupType consensus.EvidenceType, data string) (consensus.Evidence, error)
privateKey *ecdsa.PrivateKey
}
func SlashInstance() *SlashingPlugin {
once.Do(func() {
log.Info("Init Slashing plugin ...")
slash = &SlashingPlugin{
db: snapshotdb.Instance(),
}
})
return slash
}
func (sp *SlashingPlugin) SetPrivateKey(privateKey *ecdsa.PrivateKey) {
sp.privateKey = privateKey
}
func (sp *SlashingPlugin) SetDecodeEvidenceFun(f func(dupType consensus.EvidenceType, data string) (consensus.Evidence, error)) {
sp.decodeEvidence = f
}
func (sp *SlashingPlugin) BeginBlock(blockHash common.Hash, header *types.Header, state xcom.StateDB) error {
// If it is the first block in each round, Delete old pack amount record.
// Do this from the second consensus round
if xutil.IsBeginOfConsensus(header.Number.Uint64()) && header.Number.Uint64() > 1 {
if err := sp.switchEpoch(header.Number.Uint64(), blockHash); nil != err {
log.Error("Failed to BeginBlock, call switchEpoch is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "err", err)
return err
}
}
if err := sp.setPackAmount(blockHash, header); nil != err {
log.Error("Failed to BeginBlock, call setPackAmount is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "err", err)
return err
}
// If it is the 230th block of each round,
// it will punish the node with abnormal block rate.
// Do this from the second consensus round
if header.Number.Uint64() > xutil.ConsensusSize() && xutil.IsElection(header.Number.Uint64()) {
log.Debug("Call GetPrePackAmount", "blockNumber", header.Number.Uint64(), "blockHash",
blockHash.TerminalString(), "consensusSize", xutil.ConsensusSize(), "electionDistance", xcom.ElectionDistance())
if result, err := sp.GetPrePackAmount(header.Number.Uint64(), header.ParentHash); nil != err {
return err
} else {
if nil == result {
log.Error("Failed to BeginBlock, call GetPrePackAmount is failed, the result is nil", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString())
return errors.New("packAmount data not found")
}
preRoundVal, err := stk.getPreValList(blockHash, header.Number.Uint64(), QueryStartIrr)
if nil != err {
log.Error("Failed to BeginBlock, query previous round validators is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "err", err)
return err
}
var slashQueue staking.SlashQueue
currentVersion := gov.GetCurrentActiveVersion(state)
if currentVersion == 0 {
log.Error("Failed to BeginBlock, GetCurrentActiveVersion is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString())
return errors.New("Failed to get CurrentActiveVersion")
}
// Stores all consensus nodes in the previous round and records whether each node has a production block in the previous round
validatorMap := make(map[discover.NodeID]bool)
for _, validator := range preRoundVal.Arr {
nodeId := validator.NodeId
count := result[nodeId]
if count > 0 {
validatorMap[nodeId] = true
} else {
validatorMap[nodeId] = false
}
}
if slashQueue, err = sp.zeroProduceProcess(blockHash, header, validatorMap, preRoundVal.Arr); nil != err {
log.Error("Failed to BeginBlock, call zeroProduceProcess is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "err", err)
return err
}
// Real to slash the node
// If there is no record of the node,
// it means that there is no block,
// then the penalty is directly
if len(slashQueue) != 0 {
if err := stk.SlashCandidates(state, blockHash, header.Number.Uint64(), slashQueue...); nil != err {
log.Error("Failed to BeginBlock, call SlashCandidates is failed", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "err", err)
return err
}
}
}
}
return nil
}
func (sp *SlashingPlugin) EndBlock(blockHash common.Hash, header *types.Header, state xcom.StateDB) error {
return nil
}
func (sp *SlashingPlugin) Confirmed(nodeId discover.NodeID, block *types.Block) error {
return nil
}
func (sp *SlashingPlugin) zeroProduceProcess(blockHash common.Hash, header *types.Header, validatorMap map[discover.NodeID]bool, validatorQueue staking.ValidatorQueue) (staking.SlashQueue, error) {
blockNumber := header.Number.Uint64()
slashQueue := make(staking.SlashQueue, 0)
waitSlashingNodeList, err := sp.getWaitSlashingNodeList(header.Number.Uint64(), blockHash)
if nil != err {
return nil, err
}
zeroProduceNumberThreshold, err := gov.GovernZeroProduceNumberThreshold(blockNumber, blockHash)
if nil != err {
log.Error("Failed to zeroProduceProcess, call GovernZeroProduceNumberThreshold is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"err", err)
return nil, err
}
zeroProduceCumulativeTime, err := gov.GovernZeroProduceCumulativeTime(blockNumber, blockHash)
if nil != err {
log.Error("Failed to zeroProduceProcess, call GovernZeroProduceCumulativeTime is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"err", err)
return nil, err
}
preRound := xutil.CalculateRound(header.Number.Uint64()) - 1
log.Info("Call zeroProduceProcess start", "blockNumber", blockNumber, "blockHash", blockHash, "preRound", preRound, "zeroProduceNumberThreshold", zeroProduceNumberThreshold, "zeroProduceCumulativeTime", zeroProduceCumulativeTime, "waitSlashingNodeListSize", waitSlashingNodeList)
if len(waitSlashingNodeList) > 0 {
for index := 0; index < len(waitSlashingNodeList); index++ {
waitSlashingNode := waitSlashingNodeList[index]
// Check if a node has produced a block, including in the current round
var isDelete = false
nodeId := waitSlashingNode.NodeId
isProduced, ok := validatorMap[nodeId]
delete(validatorMap, nodeId)
delFunc := func(nodeList []*WaitSlashingNode, index *int) []*WaitSlashingNode {
if len(nodeList) == 1 {
return nil
}
if len(nodeList)-1 == *index {
return nodeList[:*index]
}
result := append(nodeList[:*index], nodeList[*index+1:]...)
*index--
return result
}
if ok && isProduced {
isDelete = true
} else {
if amount, err := sp.getPackAmount(blockNumber, blockHash, nodeId); nil != err {
return nil, err
} else if amount > 0 {
isDelete = true
log.Debug("Call zeroProduceProcess, The current round produced blocks", "blockNumber", blockNumber, "blockHash", blockHash, "nodeId", nodeId.TerminalString(), "packAmount", amount)
}
}
if isDelete {
waitSlashingNodeList = delFunc(waitSlashingNodeList, &index)
log.Debug("Call zeroProduceProcess, produced blocks", "blockNumber", blockNumber, "blockHash", blockHash, "nodeId", nodeId.TerminalString(),
"preRound", preRound, "firstRound", waitSlashingNode.Round, "countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit), "waitSlashingNodeListSize", len(waitSlashingNodeList))
continue
}
log.Debug("Call zeroProduceProcess, Judgment time threshold", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "zeroProduceNumberThreshold", zeroProduceNumberThreshold, "zeroProduceCumulativeTime", zeroProduceCumulativeTime,
"nodeId", nodeId.TerminalString(), "preRound", preRound, "firstRound", waitSlashingNode.Round, "countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit), "isProduced", isProduced, "isExistPreRound", ok)
// The time window is full and you need to move the bits to store the previous round of information
if diff := uint16(preRound - waitSlashingNode.Round); diff >= zeroProduceCumulativeTime {
// When the value of the time window becomes smaller after being governed, the extra value needs to be cleared
// Calculate the number of values outside the time window
// If the value of the time window is not governed, the calculated value is 1.
moveNumber := (diff + 1) - zeroProduceCumulativeTime
waitSlashingNode.CountBit = waitSlashingNode.CountBit >> moveNumber
if waitSlashingNode.CountBit > 0 {
waitSlashingNode.Round += uint64(moveNumber)
log.Debug("Call zeroProduceProcess, first move bit, countBit > 0", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(),
"moveBitNumber", moveNumber, "firstRound", waitSlashingNode.Round, "countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit))
for {
// If the first bit is a zero-out block, then exit the loop directly
// Otherwise, it will be shifted until it reaches the position where there is an identified zero block
// If all positions are 0, then delete it directly from the pending list
if waitSlashingNode.CountBit&1 != 0 {
break
}
waitSlashingNode.CountBit = waitSlashingNode.CountBit >> 1
if waitSlashingNode.CountBit == 0 {
log.Debug("Call zeroProduceProcess, for move 1bit, countBit equals 0", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString())
break
}
waitSlashingNode.Round++
log.Debug("Call zeroProduceProcess, for move 1bit, countBit > 0", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(),
"firstRound", waitSlashingNode.Round, "countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit))
}
}
}
if ok && !isProduced {
// Mark whether the previous round was a zero-out block
if waitSlashingNode.CountBit == 0 {
waitSlashingNode.Round = preRound
waitSlashingNode.CountBit = 1
} else {
diffRound := preRound - waitSlashingNode.Round
waitSlashingNode.CountBit = waitSlashingNode.CountBit | (1 << diffRound)
}
log.Debug("Call zeroProduceProcess, preRound zero produced, set bit", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(),
"preRound", preRound, "firstRound", waitSlashingNode.Round, "countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit))
}
if waitSlashingNode.CountBit == 0 {
waitSlashingNodeList = delFunc(waitSlashingNodeList, &index)
log.Debug("Call zeroProduceProcess, Move and set the bit successfully, countBit equals 0", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(), "waitSlashingNodeListSize", len(waitSlashingNodeList))
continue
}
slashItem, err := sp.checkSlashing(header.Number.Uint64(), blockHash, waitSlashingNode, preRound, zeroProduceCumulativeTime, zeroProduceNumberThreshold)
if nil != err {
return nil, err
}
if slashItem != nil {
waitSlashingNodeList = delFunc(waitSlashingNodeList, &index)
slashQueue = append(slashQueue, slashItem)
}
}
}
// The remaining zero-out blocks in the map belong to the first zero-out block,
// so they are directly added to the list.
for _, validator := range validatorQueue {
isProduced, ok := validatorMap[validator.NodeId]
if ok && !isProduced {
waitSlashingNode := &WaitSlashingNode{
NodeId: validator.NodeId,
Round: preRound,
CountBit: 1,
}
slashItem, err := sp.checkSlashing(header.Number.Uint64(), blockHash, waitSlashingNode, preRound, zeroProduceCumulativeTime, zeroProduceNumberThreshold)
if nil != err {
return nil, err
}
if slashItem != nil {
slashQueue = append(slashQueue, slashItem)
} else {
waitSlashingNodeList = append(waitSlashingNodeList, waitSlashingNode)
log.Debug("Call zeroProduceProcess, first zero produced", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", validator.NodeId.TerminalString(), "preRound", preRound, "waitSlashingNodeListSize", len(waitSlashingNodeList))
}
}
}
if err := sp.setWaitSlashingNodeList(header.Number.Uint64(), blockHash, waitSlashingNodeList); nil != err {
return nil, err
}
log.Info("Call zeroProduceProcess success", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "waitSlashingNodeList", waitSlashingNodeList)
return slashQueue, nil
}
func (sp *SlashingPlugin) checkSlashing(blockNumber uint64, blockHash common.Hash, waitSlashingNode *WaitSlashingNode, preRound uint64, zeroProduceCumulativeTime uint16, zeroProduceNumberThreshold uint16) (*staking.SlashNodeItem, error) {
nodeId := waitSlashingNode.NodeId
// If the range of the time window is satisfied, and the number of zero blocks is satisfied, a penalty is imposed.
if diff := uint16(preRound - waitSlashingNode.Round + 1); diff == zeroProduceCumulativeTime {
// Count the number of flags
calcBitFunc := func(countBit uint64, number int) uint16 {
var compareValue uint64 = 1
var count uint16
for i := 0; i < number; i++ {
if countBit&compareValue > 0 {
count++
}
compareValue = compareValue << 1
}
return count
}
if zeroProduceCount := calcBitFunc(waitSlashingNode.CountBit, int(zeroProduceCumulativeTime)); zeroProduceCount >= zeroProduceNumberThreshold {
log.Debug("Call zeroProduceProcess, Meet the conditions of punishment", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(),
"countBit", fmt.Sprintf("%b", waitSlashingNode.CountBit), "zeroProduceCount", zeroProduceCount, "zeroProduceNumberThreshold", zeroProduceNumberThreshold)
// Structure for constructing penalty information
nodeAddr, err := xutil.NodeId2Addr(nodeId)
if err != nil {
log.Error("Failed to convert nodeID to address", "nodeId", nodeId.TerminalString(), "error", err)
return nil, err
}
canMutable, err := stk.GetCanMutableByIrr(nodeAddr)
if nil != err {
log.Error("Failed to zeroProduceProcess, call candidate mutable info is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"nodeAddr", nodeAddr.Hex(), "err", err)
if err == snapshotdb.ErrNotFound {
return nil, nil
}
return nil, err
}
slashAmount := new(big.Int).SetUint64(0)
totalBalance := calcCanTotalBalance(blockNumber, canMutable)
blocksReward, err := gov.GovernSlashBlocksReward(blockNumber, blockHash)
if nil != err {
log.Error("Failed to zeroProduceProcess, query GovernSlashBlocksReward is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "err", err)
return nil, err
}
if blocksReward > 0 {
slashAmount, err = calcSlashBlockRewards(sp.db, blockHash, uint64(blocksReward))
if nil != err {
log.Error("Failed to zeroProduceProcess, call calcSlashBlockRewards fail", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "err", err)
return nil, err
}
if slashAmount.Cmp(totalBalance) > 0 {
slashAmount = totalBalance
}
}
slashItem := &staking.SlashNodeItem{
NodeId: nodeId,
Amount: slashAmount,
SlashType: staking.LowRatio,
BenefitAddr: vm.RewardManagerPoolAddr,
}
log.Info("Need to call SlashCandidates anomalous nodes", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(),
"zeroProduceCount", zeroProduceCount, "slashType", slashItem.SlashType, "totalBalance", totalBalance, "slashAmount", slashAmount, "SlashBlocksReward", blocksReward)
return slashItem, nil
}
}
return nil, nil
}
func (sp *SlashingPlugin) getWaitSlashingNodeList(blockNumber uint64, blockHash common.Hash) ([]*WaitSlashingNode, error) {
value, err := sp.db.Get(blockHash, waitSlashingNodeListKey)
if snapshotdb.NonDbNotFoundErr(err) {
return nil, err
}
var result []*WaitSlashingNode
if err != snapshotdb.ErrNotFound {
if err := rlp.DecodeBytes(value, &result); nil != err {
log.Error("rlpDecode WaitSlashingNodeList failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "key", string(waitSlashingNodeListKey), "err", err)
return nil, err
}
}
return result, nil
}
func (sp *SlashingPlugin) setWaitSlashingNodeList(blockNumber uint64, blockHash common.Hash, list []*WaitSlashingNode) error {
if enValue, err := rlp.EncodeToBytes(list); nil != err {
log.Error("rlpEncode WaitSlashingNodeList failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "listSize", len(list), "err", err)
return err
} else {
if err := sp.db.Put(blockHash, waitSlashingNodeListKey, enValue); nil != err {
log.Error("snapshotDB put WaitSlashingNodeList failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "key", string(waitSlashingNodeListKey), "err", err)
return err
}
}
return nil
}
func (sp *SlashingPlugin) getPackAmount(blockNumber uint64, blockHash common.Hash, nodeId discover.NodeID) (uint32, error) {
value, err := sp.db.Get(blockHash, buildKey(blockNumber, nodeId.Bytes()))
if snapshotdb.NonDbNotFoundErr(err) {
return 0, err
}
var amount uint32
if err == snapshotdb.ErrNotFound {
amount = 0
} else {
amount = common.BytesToUint32(value)
}
return amount, nil
}
func (sp *SlashingPlugin) setPackAmount(blockHash common.Hash, header *types.Header) error {
nodeId, err := parseNodeId(header)
if nil != err {
return err
}
if value, err := sp.getPackAmount(header.Number.Uint64(), blockHash, nodeId); nil != err {
return err
} else {
value++
if err := sp.db.Put(blockHash, buildKey(header.Number.Uint64(), nodeId.Bytes()), common.Uint32ToBytes(value)); nil != err {
return err
}
log.Debug("Call setPackAmount finished", "blockNumber", header.Number.Uint64(), "blockHash", blockHash.TerminalString(), "nodeId", nodeId.TerminalString(), "value", value)
}
return nil
}
func (sp *SlashingPlugin) switchEpoch(blockNumber uint64, blockHash common.Hash) error {
iter := sp.db.Ranking(blockHash, buildPrefixByRound(xutil.CalculateRound(blockNumber)-2), 0)
if err := iter.Error(); nil != err {
return err
}
defer iter.Release()
count := 0
for iter.Next() {
key := iter.Key()
value := iter.Value()
log.Debug("Call switchEpoch ranking old", "blockNumber", blockNumber, "key", hex.EncodeToString(key), "value", common.BytesToUint32(value))
if err := sp.db.Del(blockHash, key); nil != err {
return err
}
count++
}
log.Info("Call switchEpoch finished", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "count", count)
return nil
}
// Get the consensus rate of all nodes in the previous round
func (sp *SlashingPlugin) GetPrePackAmount(blockNumber uint64, parentHash common.Hash) (map[discover.NodeID]uint32, error) {
result := make(map[discover.NodeID]uint32)
prefixKey := buildPrefixByRound(xutil.CalculateRound(blockNumber) - 1)
iter := sp.db.Ranking(parentHash, prefixKey, 0)
if err := iter.Error(); nil != err {
return nil, err
}
defer iter.Release()
for iter.Next() {
key := iter.Key()
value := iter.Value()
amount := common.BytesToUint32(value)
nodeId, err := getNodeId(prefixKey, key)
if nil != err {
return nil, err
}
result[nodeId] = amount
}
return result, nil
}
func (sp *SlashingPlugin) DecodeEvidence(dupType consensus.EvidenceType, data string) (consensus.Evidence, error) {
if sp.decodeEvidence == nil {
return nil, common.InternalError.Wrap("decodeEvidence function is nil")
}
return sp.decodeEvidence(dupType, data)
}
func (sp *SlashingPlugin) Slash(evidence consensus.Evidence, blockHash common.Hash, blockNumber uint64, stateDB xcom.StateDB, caller common.Address) error {
if err := evidence.Validate(); nil != err {
log.Error("Failed to Slash, evidence validate is failed",
"blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "err", err)
return slashing.ErrDuplicateSignVerify
}
if evidence.BlockNumber() > blockNumber {
log.Error("Failed to Slash, Evidence is higher than the current block height",
"blockNumber", blockNumber, "blockHash", blockHash.TerminalString(), "evidenceBlockNumber", evidence.BlockNumber())
return slashing.ErrBlockNumberTooHigh
}
evidenceEpoch := xutil.CalculateEpoch(evidence.BlockNumber())
blocksOfEpoch := xutil.CalcBlocksEachEpoch()
invalidNum := evidenceEpoch * blocksOfEpoch
if invalidNum < blockNumber {
evidenceAge, err := gov.GovernMaxEvidenceAge(blockNumber, blockHash)
if nil != err {
log.Error("Failed to Slash, query Gov SlashFractionDuplicateSign is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"err", err)
return err
}
if validSize := blocksOfEpoch * uint64(evidenceAge); blockNumber-invalidNum > validSize {
log.Warn("Failed to Slash, Evidence time expired", "blockNumber", blockNumber,
"blockHash", blockHash.TerminalString(), "evidenceBlockNum", evidence.BlockNumber(),
"blocksOfEpoch", blocksOfEpoch, "the end blockNum of evidenceEpoch", invalidNum)
return slashing.ErrIntervalTooLong
}
}
if slashTxHash := sp.getSlashTxHash(evidence.NodeID(), evidence.BlockNumber(), evidence.Type(), stateDB); len(slashTxHash) > 0 {
log.Error("Failed to Slash, the evidence had slashed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNumber", evidence.BlockNumber(), "evidenceHash", hex.EncodeToString(evidence.Hash()),
"evidenceNodeId", evidence.NodeID().TerminalString(), "evidenceType", evidence.Type(), "err", slashing.ErrSlashingExist)
return slashing.ErrSlashingExist
}
evidencePubKey, err := evidence.NodeID().Pubkey()
if nil != err {
log.Error("Failed to Slash, parse pubKey failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNumber", evidence.BlockNumber(), "evidenceNodeId", evidence.NodeID().TerminalString(), "err", err)
return slashing.ErrDuplicateSignVerify
}
canAddr := crypto.PubkeyToNodeAddress(*evidencePubKey)
canBase, err := stk.GetCanBase(blockHash, canAddr)
if nil != err {
log.Error("Failed to Slash, query CandidateBase info is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNumber", evidence.BlockNumber(), "evidenceNodeId", evidence.NodeID().TerminalString(), "err", err)
return slashing.ErrGetCandidate
}
if canBase.IsEmpty() {
log.Error("Failed to Slash, the candidate info is nil", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceNodeId", evidence.NodeID().TerminalString(), "evidenceType", evidence.Type())
return slashing.ErrGetCandidate
}
if caller == canBase.StakingAddress {
log.Error("Failed to Slash, can't report self", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"nodeId", canBase.NodeId.TerminalString(), "stakingAddress", caller.String(), "evidenceType", evidence.Type())
return slashing.ErrSameAddr
}
if canBase.NodeId != evidence.NodeID() {
log.Error("Failed to Slash, Mismatch nodeId", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"can nodeId", canBase.NodeId.TerminalString(), "evidence nodeId", evidence.NodeID().TerminalString(), "evidenceType", evidence.Type())
return slashing.ErrNodeIdMismatch
}
blsKey, _ := canBase.BlsPubKey.ParseBlsPubKey()
if !bytes.Equal(blsKey.Serialize(), evidence.BlsPubKey().Serialize()) {
log.Error("Failed to Slash, Mismatch blsPubKey", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"nodeId", canBase.NodeId.TerminalString(), "can blsKey", hex.EncodeToString(blsKey.Serialize()),
"evidence blsKey", hex.EncodeToString(evidence.BlsPubKey().Serialize()), "evidenceType", evidence.Type())
return slashing.ErrBlsPubKeyMismatch
}
if has, err := stk.checkRoundValidatorAddr(blockHash, evidence.BlockNumber(), canAddr); nil != err {
log.Error("Failed to Slash, checkRoundValidatorAddr is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNum", evidence.BlockNumber(), "canAddr", canAddr.Hex(), "err", err)
return slashing.ErrDuplicateSignVerify
} else if !has {
log.Error("Failed to Slash, this node is not a validator, maybe!", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNum", evidence.BlockNumber(), "canAddr", canAddr.Hex())
return slashing.ErrNotValidator
}
canMutable, err := stk.GetCanMutable(blockHash, canAddr)
if nil != err {
log.Error("Failed to Slash, query CandidateMutable info is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNumber", evidence.BlockNumber(), "canAddr", canAddr.Hex(), "err", err)
return slashing.ErrGetCandidate
}
fraction, err := gov.GovernSlashFractionDuplicateSign(blockNumber, blockHash)
if nil != err {
log.Error("Failed to Slash, query Gov SlashFractionDuplicateSign is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"err", err)
return err
}
rewardFraction, err := gov.GovernDuplicateSignReportReward(blockNumber, blockHash)
if nil != err {
log.Error("Failed to Slash, query Gov DuplicateSignReportReward is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"err", err)
return err
}
totalBalance := calcCanTotalBalance(blockNumber, canMutable)
slashAmount := calcAmountByRate(totalBalance, uint64(fraction), TenThousandDenominator)
log.Info("Call SlashCandidates on executeSlash", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"nodeId", canBase.NodeId.TerminalString(), "totalBalance", totalBalance, "fraction", fraction, "rewardFraction", rewardFraction,
"slashAmount", slashAmount, "reporter", caller)
toCallerAmount := calcAmountByRate(slashAmount, uint64(rewardFraction), HundredDenominator)
toCallerItem := &staking.SlashNodeItem{
NodeId: canBase.NodeId,
Amount: toCallerAmount,
SlashType: staking.DuplicateSign,
BenefitAddr: caller,
}
toRewardPoolAmount := new(big.Int).Sub(slashAmount, toCallerAmount)
toRewardPoolItem := &staking.SlashNodeItem{
NodeId: canBase.NodeId,
Amount: toRewardPoolAmount,
SlashType: staking.DuplicateSign,
BenefitAddr: vm.RewardManagerPoolAddr,
}
if err := stk.SlashCandidates(stateDB, blockHash, blockNumber, toCallerItem, toRewardPoolItem); nil != err {
log.Error("Failed to Slash, call SlashCandidates is failed", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"nodeId", canBase.NodeId.TerminalString(), "err", err)
return slashing.ErrSlashingFail
}
sp.putSlashTxHash(evidence.NodeID(), evidence.BlockNumber(), evidence.Type(), stateDB)
log.Info("Call Slash finished", "blockNumber", blockNumber, "blockHash", blockHash.TerminalString(),
"evidenceBlockNum", evidence.BlockNumber(), "nodeId", canBase.NodeId.TerminalString(), "evidenceType", evidence.Type(),
"the txHash", stateDB.TxHash().TerminalString())
return nil
}
func (sp *SlashingPlugin) CheckDuplicateSign(nodeId discover.NodeID, blockNumber uint64, dupType consensus.EvidenceType, stateDB xcom.StateDB) ([]byte, error) {
if value := sp.getSlashTxHash(nodeId, blockNumber, dupType, stateDB); len(value) > 0 {
return value, nil
}
return nil, nil
}
func (sp *SlashingPlugin) putSlashTxHash(nodeId discover.NodeID, blockNumber uint64, dupType consensus.EvidenceType, stateDB xcom.StateDB) {
stateDB.SetState(vm.SlashingContractAddr, duplicateSignKey(nodeId, blockNumber, dupType), stateDB.TxHash().Bytes())
}
func (sp *SlashingPlugin) getSlashTxHash(nodeId discover.NodeID, blockNumber uint64, dupType consensus.EvidenceType, stateDB xcom.StateDB) []byte {
return stateDB.GetState(vm.SlashingContractAddr, duplicateSignKey(nodeId, blockNumber, dupType))
}
// duplicate signature result key format addr+blockNumber+_+type
func duplicateSignKey(nodeId discover.NodeID, blockNumber uint64, dupType consensus.EvidenceType) []byte {
return append(append(nodeId.Bytes(), common.Uint64ToBytes(blockNumber)...), common.Uint16ToBytes(uint16(dupType))...)
}
func buildKey(blockNumber uint64, key []byte) []byte {
return append(buildPrefix(blockNumber), key...)
}
func buildPrefix(blockNumber uint64) []byte {
return buildPrefixByRound(xutil.CalculateRound(blockNumber))
}
func buildPrefixByRound(round uint64) []byte {
return append(packAmountPrefix, common.Uint64ToBytes(round)...)
}
func getNodeId(prefix []byte, key []byte) (discover.NodeID, error) {
key = key[len(prefix):]
nodeId, err := discover.BytesID(key)
if nil != err {
return discover.NodeID{}, err
}
return nodeId, nil
}
func parseNodeId(header *types.Header) (discover.NodeID, error) {
if xutil.IsWorker(header.Extra) {
return discover.PubkeyID(&SlashInstance().privateKey.PublicKey), nil
} else {
pk := header.CachePublicKey()
if pk == nil {
return discover.NodeID{}, errors.New("failed to get the public key of the block producer")
}
return discover.PubkeyID(pk), nil
}
}
func calcCanTotalBalance(blockNumber uint64, candidate *staking.CandidateMutable) *big.Int {
// Recalculate the quality deposit
lazyCalcStakeAmount(xutil.CalculateEpoch(blockNumber), candidate)
return new(big.Int).Add(candidate.Released, candidate.RestrictingPlan)
}
func calcAmountByRate(balance *big.Int, numerator, denominator uint64) *big.Int {
if balance.Cmp(common.Big0) > 0 {
amount := new(big.Int).Mul(balance, new(big.Int).SetUint64(numerator))
return amount.Div(amount, new(big.Int).SetUint64(denominator))
}
return new(big.Int).SetInt64(0)
}
func calcSlashBlockRewards(db snapshotdb.DB, hash common.Hash, blockRewardAmount uint64) (*big.Int, error) {
newBlockReward, err := LoadNewBlockReward(hash, db)
if nil != err {
return nil, err
}
return new(big.Int).Mul(newBlockReward, new(big.Int).SetUint64(blockRewardAmount)), nil
}