-
Notifications
You must be signed in to change notification settings - Fork 58
/
miner.cpp
1125 lines (976 loc) · 46.3 KB
/
miner.cpp
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
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2019 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <miner.h>
#include <amount.h>
#include <base58.h>
#include <chain.h>
#include <chainparams.h>
#include <coins.h>
#include <consensus/consensus.h>
#include <consensus/merkle.h>
#include <consensus/tx_verify.h>
#include <consensus/validation.h>
#include <policy/feerate.h>
#include <policy/policy.h>
#include <pow.h>
#include <pos.h>
#include <primitives/transaction.h>
#include <script/standard.h>
#include <timedata.h>
#include <util/convert.h>
#include <util/moneystr.h>
#include <util/system.h>
#include <util/validation.h>
#include <net.h>
#ifdef ENABLE_WALLET
#include <wallet/wallet.h>
#endif
#include <openssl/sha.h>
#include <algorithm>
#include <queue>
#include <utility>
uint32_t ByteReverse(uint32_t value)
{
value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8);
return (value<<16) | (value>>16);
}
static const unsigned int pSHA256InitState[8] =
{0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
void SHA256Transform(void* pstate, void* pinput, const void* pinit)
{
SHA256_CTX ctx;
unsigned char data[64];
SHA256_Init(&ctx);
for (int i = 0; i < 16; i++)
((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
for (int i = 0; i < 8; i++)
ctx.h[i] = ((uint32_t*)pinit)[i];
SHA256_Update(&ctx, data, sizeof(data));
for (int i = 0; i < 8; i++)
((uint32_t*)pstate)[i] = ctx.h[i];
}
unsigned int nMinerSleep = STAKER_POLLING_PERIOD;
void FormatHashBuffers(CBlock* pblock, char* pdata)
{
unsigned char workpadding[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0xff, 0xff, 0xff, 0xff, 0x00};
struct
{
struct unnamed2
{
int nVersion;
uint256 hashPrevBlock;
uint256 hashMerkleRoot;
unsigned int nTime;
unsigned int nBits;
unsigned int nNonce;
uint256 hashStateRoot; // qtum
uint256 hashUTXORoot; // qtum
unsigned char workpadding[48];//37
}
block;
unsigned char pchPadding0[64];
}
tmp;
memset(&tmp, 0, sizeof(tmp));
tmp.block.nVersion = pblock->nVersion;
tmp.block.hashPrevBlock = pblock->hashPrevBlock;
tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
tmp.block.nTime = pblock->nTime;
tmp.block.nBits = pblock->nBits;
tmp.block.nNonce = pblock->nNonce;
tmp.block.hashStateRoot = pblock->hashStateRoot; // qtum
tmp.block.hashUTXORoot = pblock->hashUTXORoot; // qtum
memcpy((unsigned char *)(tmp.block.workpadding), workpadding, sizeof(workpadding));
// Byte swap all the input buffer
for (unsigned int i = 0; i < 180/4; i++) // sizeof(tmp)/4
((unsigned int*)&tmp.block)[i] = ByteReverse(((unsigned int*)&tmp.block)[i]);
memcpy(pdata, &tmp.block, 192); // 192 // 128
}
bool CheckWork(const CChainParams& chainparams, CBlock* pblock)
{
uint256 hash = pblock->GetHash();
arith_uint256 hashTarget = arith_uint256().SetCompact(pblock->nBits);
if (UintToArith256(hash) > hashTarget)
return false;
// Found a solution
{
LOCK(cs_main);
if (pblock->hashPrevBlock != ::ChainActive().Tip()->GetBlockHash())
return error("Generated block is stale!");
// Process this block the same as if we had received it from another node
std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(*pblock);
bool fNewBlock = false;
if (!ProcessNewBlock(chainparams, shared_pblock, true, &fNewBlock))
return error("CheckWork: block not accepted");
}
return true;
}
int64_t UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev)
{
int64_t nOldTime = pblock->nTime;
int64_t nNewTime = std::max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
if (nOldTime < nNewTime)
pblock->nTime = nNewTime;
// Updating time can change work required on testnet:
if (consensusParams.fPowAllowMinDifficultyBlocks)
pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams,pblock->IsProofOfStake());
return nNewTime - nOldTime;
}
BlockAssembler::Options::Options() {
blockMinFeeRate = CFeeRate(DEFAULT_BLOCK_MIN_TX_FEE);
nBlockMaxWeight = DEFAULT_BLOCK_MAX_WEIGHT;
}
BlockAssembler::BlockAssembler(const CChainParams& params, const Options& options) : chainparams(params)
{
blockMinFeeRate = options.blockMinFeeRate;
// Limit weight to between 4K and dgpMaxBlockWeight-4K for sanity:
nBlockMaxWeight = std::max<size_t>(4000, std::min<size_t>(dgpMaxBlockWeight - 4000, options.nBlockMaxWeight));
}
static BlockAssembler::Options DefaultOptions()
{
// Block resource limits
// If -blockmaxweight is not given, limit to DEFAULT_BLOCK_MAX_WEIGHT
BlockAssembler::Options options;
options.nBlockMaxWeight = gArgs.GetArg("-blockmaxweight", DEFAULT_BLOCK_MAX_WEIGHT);
CAmount n = 0;
if (gArgs.IsArgSet("-blockmintxfee") && ParseMoney(gArgs.GetArg("-blockmintxfee", ""), n)) {
options.blockMinFeeRate = CFeeRate(n);
} else {
options.blockMinFeeRate = CFeeRate(DEFAULT_BLOCK_MIN_TX_FEE);
}
return options;
}
BlockAssembler::BlockAssembler(const CChainParams& params) : BlockAssembler(params, DefaultOptions()) {}
void BlockAssembler::resetBlock()
{
inBlock.clear();
// Reserve space for coinbase tx
nBlockWeight = 4000;
nBlockSigOpsCost = 400;
fIncludeWitness = false;
// These counters do not include coinbase tx
nBlockTx = 0;
nFees = 0;
}
void BlockAssembler::RebuildRefundTransaction(){
int refundtx=0; //0 for coinbase in PoW
if(pblock->IsProofOfStake()){
refundtx=1; //1 for coinstake in PoS
}
CMutableTransaction contrTx(originalRewardTx);
contrTx.vout[refundtx].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
contrTx.vout[refundtx].nValue -= bceResult.refundSender;
//note, this will need changed for MPoS
int i=contrTx.vout.size();
contrTx.vout.resize(contrTx.vout.size()+bceResult.refundOutputs.size());
for(CTxOut& vout : bceResult.refundOutputs){
contrTx.vout[i]=vout;
i++;
}
pblock->vtx[refundtx] = MakeTransactionRef(std::move(contrTx));
}
Optional<int64_t> BlockAssembler::m_last_block_num_txs{nullopt};
Optional<int64_t> BlockAssembler::m_last_block_weight{nullopt};
std::unique_ptr<CBlockTemplate> BlockAssembler::CreateNewBlock(const CScript& scriptPubKeyIn, bool fMineWitnessTx, bool fProofOfStake, int64_t* pTotalFees, int32_t txProofTime, int32_t nTimeLimit, bool externalGBT)
{
int64_t nTimeStart = GetTimeMicros();
resetBlock();
pblocktemplate.reset(new CBlockTemplate());
if(!pblocktemplate.get())
return nullptr;
pblock = &pblocktemplate->block; // pointer for convenience
this->nTimeLimit = nTimeLimit;
// Add dummy coinbase tx as first transaction
pblock->vtx.emplace_back();
// Add dummy coinstake tx as second transaction
if(fProofOfStake)
pblock->vtx.emplace_back();
pblocktemplate->vTxFees.push_back(-1); // updated at end
pblocktemplate->vTxSigOpsCost.push_back(-1); // updated at end
LOCK2(cs_main, mempool.cs);
CBlockIndex* pindexPrev = ::ChainActive().Tip();
assert(pindexPrev != nullptr);
nHeight = pindexPrev->nHeight + 1;
pblock->nVersion = ComputeBlockVersion(pindexPrev, chainparams.GetConsensus());
// -regtest only: allow overriding block.nVersion with
// -blockversion=N to test forking scenarios
if (chainparams.MineBlocksOnDemand())
pblock->nVersion = gArgs.GetArg("-blockversion", pblock->nVersion);
if(txProofTime == 0) {
txProofTime = GetAdjustedTime();
}
if(fProofOfStake)
txProofTime &= ~STAKE_TIMESTAMP_MASK;
pblock->nTime = txProofTime;
if (!fProofOfStake)
UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev);
pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, chainparams.GetConsensus(),fProofOfStake);
const int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
nLockTimeCutoff = (STANDARD_LOCKTIME_VERIFY_FLAGS & LOCKTIME_MEDIAN_TIME_PAST)
? nMedianTimePast
: pblock->GetBlockTime();
// Decide whether to include witness transactions
// This is only needed in case the witness softfork activation is reverted
// (which would require a very deep reorganization).
// Note that the mempool would accept transactions with witness data before
// IsWitnessEnabled, but we would only ever mine blocks after IsWitnessEnabled
// unless there is a massive block reorganization with the witness softfork
// not activated.
// TODO: replace this with a call to main to assess validity of a mempool
// transaction (which in most cases can be a no-op).
fIncludeWitness = IsWitnessEnabled(pindexPrev, chainparams.GetConsensus()) && fMineWitnessTx;
int64_t nTime1 = GetTimeMicros();
m_last_block_num_txs = nBlockTx;
m_last_block_weight = nBlockWeight;
// Create coinbase transaction.
CMutableTransaction coinbaseTx;
coinbaseTx.vin.resize(1);
coinbaseTx.vin[0].prevout.SetNull();
coinbaseTx.vout.resize(1);
if (fProofOfStake)
{
// Make the coinbase tx empty in case of proof of stake
coinbaseTx.vout[0].SetEmpty();
}
else
{
coinbaseTx.vout[0].scriptPubKey = scriptPubKeyIn;
coinbaseTx.vout[0].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
}
coinbaseTx.vin[0].scriptSig = CScript() << nHeight << OP_0;
originalRewardTx = coinbaseTx;
pblock->vtx[0] = MakeTransactionRef(std::move(coinbaseTx));
// Create coinstake transaction.
if(fProofOfStake)
{
CMutableTransaction coinstakeTx;
coinstakeTx.vout.resize(2);
coinstakeTx.vout[0].SetEmpty();
coinstakeTx.vout[1].scriptPubKey = scriptPubKeyIn;
originalRewardTx = coinstakeTx;
pblock->vtx[1] = MakeTransactionRef(std::move(coinstakeTx));
//this just makes CBlock::IsProofOfStake to return true
//real prevoutstake info is filled in later in SignBlock
pblock->prevoutStake.n=0;
}
//////////////////////////////////////////////////////// qtum
QtumDGP qtumDGP(globalState.get(), fGettingValuesDGP);
globalSealEngine->setQtumSchedule(qtumDGP.getGasSchedule(nHeight));
uint32_t blockSizeDGP = qtumDGP.getBlockSize(nHeight);
minGasPrice = qtumDGP.getMinGasPrice(nHeight);
if(gArgs.IsArgSet("-staker-min-tx-gas-price")) {
CAmount stakerMinGasPrice;
if(ParseMoney(gArgs.GetArg("-staker-min-tx-gas-price", ""), stakerMinGasPrice)) {
minGasPrice = std::max(minGasPrice, (uint64_t)stakerMinGasPrice);
}
}
hardBlockGasLimit = qtumDGP.getBlockGasLimit(nHeight);
softBlockGasLimit = gArgs.GetArg("-staker-soft-block-gas-limit", hardBlockGasLimit);
softBlockGasLimit = std::min(softBlockGasLimit, hardBlockGasLimit);
txGasLimit = gArgs.GetArg("-staker-max-tx-gas-limit", softBlockGasLimit);
nBlockMaxWeight = blockSizeDGP ? blockSizeDGP * WITNESS_SCALE_FACTOR : nBlockMaxWeight;
dev::h256 oldHashStateRoot(globalState->rootHash());
dev::h256 oldHashUTXORoot(globalState->rootHashUTXO());
int nPackagesSelected = 0;
int nDescendantsUpdated = 0;
addPackageTxs(nPackagesSelected, nDescendantsUpdated, minGasPrice, externalGBT);
pblock->hashStateRoot = uint256(h256Touint(dev::h256(globalState->rootHash())));
pblock->hashUTXORoot = uint256(h256Touint(dev::h256(globalState->rootHashUTXO())));
globalState->setRoot(oldHashStateRoot);
globalState->setRootUTXO(oldHashUTXORoot);
//this should already be populated by AddBlock in case of contracts, but if no contracts
//then it won't get populated
RebuildRefundTransaction();
////////////////////////////////////////////////////////
pblocktemplate->vchCoinbaseCommitment = GenerateCoinbaseCommitment(*pblock, pindexPrev, chainparams.GetConsensus(), fProofOfStake);
pblocktemplate->vTxFees[0] = -nFees;
LogPrintf("CreateNewBlock(): block weight: %u txs: %u fees: %ld sigops %d\n", GetBlockWeight(*pblock), nBlockTx, nFees, nBlockSigOpsCost);
// The total fee is the Fees minus the Refund
if (pTotalFees)
*pTotalFees = nFees - bceResult.refundSender;
// Fill in header
pblock->hashPrevBlock = pindexPrev->GetBlockHash();
pblock->nNonce = 0;
pblocktemplate->vTxSigOpsCost[0] = WITNESS_SCALE_FACTOR * GetLegacySigOpCount(*pblock->vtx[0]);
CValidationState state;
if (!fProofOfStake && !TestBlockValidity(state, chainparams, *pblock, pindexPrev, false, false)) {
throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, FormatStateMessage(state)));
}
int64_t nTime2 = GetTimeMicros();
LogPrint(BCLog::BENCH, "CreateNewBlock() packages: %.2fms (%d packages, %d updated descendants), validity: %.2fms (total %.2fms)\n", 0.001 * (nTime1 - nTimeStart), nPackagesSelected, nDescendantsUpdated, 0.001 * (nTime2 - nTime1), 0.001 * (nTime2 - nTimeStart));
return std::move(pblocktemplate);
}
std::unique_ptr<CBlockTemplate> BlockAssembler::CreateEmptyBlock(const CScript& scriptPubKeyIn, bool fMineWitnessTx, bool fProofOfStake, int64_t* pTotalFees, int32_t nTime)
{
resetBlock();
pblocktemplate.reset(new CBlockTemplate());
if(!pblocktemplate.get())
return nullptr;
pblock = &pblocktemplate->block; // pointer for convenience
// Add dummy coinbase tx as first transaction
pblock->vtx.emplace_back();
// Add dummy coinstake tx as second transaction
if(fProofOfStake)
pblock->vtx.emplace_back();
pblocktemplate->vTxFees.push_back(-1); // updated at end
pblocktemplate->vTxSigOpsCost.push_back(-1); // updated at end
LOCK2(cs_main, mempool.cs);
CBlockIndex* pindexPrev = ::ChainActive().Tip();
assert(pindexPrev != nullptr);
nHeight = pindexPrev->nHeight + 1;
pblock->nVersion = ComputeBlockVersion(pindexPrev, chainparams.GetConsensus());
// -regtest only: allow overriding block.nVersion with
// -blockversion=N to test forking scenarios
if (chainparams.MineBlocksOnDemand())
pblock->nVersion = gArgs.GetArg("-blockversion", pblock->nVersion);
uint32_t txProofTime = nTime == 0 ? GetAdjustedTime() : nTime;
if(fProofOfStake)
txProofTime &= ~STAKE_TIMESTAMP_MASK;
pblock->nTime = txProofTime;
const int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
nLockTimeCutoff = (STANDARD_LOCKTIME_VERIFY_FLAGS & LOCKTIME_MEDIAN_TIME_PAST)
? nMedianTimePast
: pblock->GetBlockTime();
// Decide whether to include witness transactions
// This is only needed in case the witness softfork activation is reverted
// (which would require a very deep reorganization) or when
// -promiscuousmempoolflags is used.
// TODO: replace this with a call to main to assess validity of a mempool
// transaction (which in most cases can be a no-op).
fIncludeWitness = IsWitnessEnabled(pindexPrev, chainparams.GetConsensus()) && fMineWitnessTx;
m_last_block_num_txs = nBlockTx;
m_last_block_weight = nBlockWeight;
// Create coinbase transaction.
CMutableTransaction coinbaseTx;
coinbaseTx.vin.resize(1);
coinbaseTx.vin[0].prevout.SetNull();
coinbaseTx.vout.resize(1);
if (fProofOfStake)
{
// Make the coinbase tx empty in case of proof of stake
coinbaseTx.vout[0].SetEmpty();
}
else
{
coinbaseTx.vout[0].scriptPubKey = scriptPubKeyIn;
coinbaseTx.vout[0].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
}
coinbaseTx.vin[0].scriptSig = CScript() << nHeight << OP_0;
originalRewardTx = coinbaseTx;
pblock->vtx[0] = MakeTransactionRef(std::move(coinbaseTx));
// Create coinstake transaction.
if(fProofOfStake)
{
CMutableTransaction coinstakeTx;
coinstakeTx.vout.resize(2);
coinstakeTx.vout[0].SetEmpty();
coinstakeTx.vout[1].scriptPubKey = scriptPubKeyIn;
originalRewardTx = coinstakeTx;
pblock->vtx[1] = MakeTransactionRef(std::move(coinstakeTx));
//this just makes CBlock::IsProofOfStake to return true
//real prevoutstake info is filled in later in SignBlock
pblock->prevoutStake.n=0;
}
//////////////////////////////////////////////////////// qtum
//state shouldn't change here for an empty block, but if it's not valid it'll fail in CheckBlock later
pblock->hashStateRoot = uint256(h256Touint(dev::h256(globalState->rootHash())));
pblock->hashUTXORoot = uint256(h256Touint(dev::h256(globalState->rootHashUTXO())));
RebuildRefundTransaction();
////////////////////////////////////////////////////////
pblocktemplate->vchCoinbaseCommitment = GenerateCoinbaseCommitment(*pblock, pindexPrev, chainparams.GetConsensus(), fProofOfStake);
pblocktemplate->vTxFees[0] = -nFees;
// The total fee is the Fees minus the Refund
if (pTotalFees)
*pTotalFees = nFees - bceResult.refundSender;
// Fill in header
pblock->hashPrevBlock = pindexPrev->GetBlockHash();
if (!fProofOfStake)
UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev);
pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, chainparams.GetConsensus(),fProofOfStake);
pblock->nNonce = 0;
pblocktemplate->vTxSigOpsCost[0] = WITNESS_SCALE_FACTOR * GetLegacySigOpCount(*pblock->vtx[0]);
CValidationState state;
if (!fProofOfStake && !TestBlockValidity(state, chainparams, *pblock, pindexPrev, false, false)) {
throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, FormatStateMessage(state)));
}
return std::move(pblocktemplate);
}
void BlockAssembler::onlyUnconfirmed(CTxMemPool::setEntries& testSet)
{
for (CTxMemPool::setEntries::iterator iit = testSet.begin(); iit != testSet.end(); ) {
// Only test txs not already in the block
if (inBlock.count(*iit)) {
testSet.erase(iit++);
}
else {
iit++;
}
}
}
bool BlockAssembler::TestPackage(uint64_t packageSize, int64_t packageSigOpsCost) const
{
// TODO: switch to weight-based accounting for packages instead of vsize-based accounting.
if (nBlockWeight + WITNESS_SCALE_FACTOR * packageSize >= nBlockMaxWeight)
return false;
if (nBlockSigOpsCost + packageSigOpsCost >= (uint64_t)dgpMaxBlockSigOps)
return false;
return true;
}
// Perform transaction-level checks before adding to block:
// - transaction finality (locktime)
// - premature witness (in case segwit transactions are added to mempool before
// segwit activation)
bool BlockAssembler::TestPackageTransactions(const CTxMemPool::setEntries& package)
{
for (CTxMemPool::txiter it : package) {
if (!IsFinalTx(it->GetTx(), nHeight, nLockTimeCutoff))
return false;
if (!fIncludeWitness && it->GetTx().HasWitness())
return false;
}
return true;
}
bool BlockAssembler::AttemptToAddContractToBlock(CTxMemPool::txiter iter, uint64_t minGasPrice, bool externalGBT) {
if (nTimeLimit != 0 && GetAdjustedTime() >= nTimeLimit - BYTECODE_TIME_BUFFER) {
return false;
}
if (gArgs.GetBoolArg("-disablecontractstaking", false) || externalGBT)
{
return false;
}
dev::h256 oldHashStateRoot(globalState->rootHash());
dev::h256 oldHashUTXORoot(globalState->rootHashUTXO());
// operate on local vars first, then later apply to `this`
uint64_t nBlockWeight = this->nBlockWeight;
uint64_t nBlockSigOpsCost = this->nBlockSigOpsCost;
unsigned int contractflags = GetContractScriptFlags(nHeight, chainparams.GetConsensus());
QtumTxConverter convert(iter->GetTx(), NULL, &pblock->vtx, contractflags);
ExtractQtumTX resultConverter;
if(!convert.extractionQtumTransactions(resultConverter)){
//this check already happens when accepting txs into mempool
//therefore, this can only be triggered by using raw transactions on the staker itself
return false;
}
std::vector<QtumTransaction> qtumTransactions = resultConverter.first;
dev::u256 txGas = 0;
for(QtumTransaction qtumTransaction : qtumTransactions){
txGas += qtumTransaction.gas();
if(txGas > txGasLimit) {
// Limit the tx gas limit by the soft limit if such a limit has been specified.
return false;
}
if(bceResult.usedGas + qtumTransaction.gas() > softBlockGasLimit){
//if this transaction's gasLimit could cause block gas limit to be exceeded, then don't add it
return false;
}
if(qtumTransaction.gasPrice() < minGasPrice){
//if this transaction's gasPrice is less than the current DGP minGasPrice don't add it
return false;
}
}
// We need to pass the DGP's block gas limit (not the soft limit) since it is consensus critical.
ByteCodeExec exec(*pblock, qtumTransactions, hardBlockGasLimit, ::ChainActive().Tip());
if(!exec.performByteCode()){
//error, don't add contract
globalState->setRoot(oldHashStateRoot);
globalState->setRootUTXO(oldHashUTXORoot);
return false;
}
ByteCodeExecResult testExecResult;
if(!exec.processingResults(testExecResult)){
globalState->setRoot(oldHashStateRoot);
globalState->setRootUTXO(oldHashUTXORoot);
return false;
}
if(bceResult.usedGas + testExecResult.usedGas > softBlockGasLimit){
//if this transaction could cause block gas limit to be exceeded, then don't add it
globalState->setRoot(oldHashStateRoot);
globalState->setRootUTXO(oldHashUTXORoot);
return false;
}
//apply contractTx costs to local state
nBlockWeight += iter->GetTxWeight();
nBlockSigOpsCost += iter->GetSigOpCost();
//apply value-transfer txs to local state
for (CTransaction &t : testExecResult.valueTransfers) {
nBlockWeight += GetTransactionWeight(t);
nBlockSigOpsCost += GetLegacySigOpCount(t);
}
int proofTx = pblock->IsProofOfStake() ? 1 : 0;
//calculate sigops from new refund/proof tx
//first, subtract old proof tx
nBlockSigOpsCost -= GetLegacySigOpCount(*pblock->vtx[proofTx]);
// manually rebuild refundtx
CMutableTransaction contrTx(*pblock->vtx[proofTx]);
//note, this will need changed for MPoS
int i=contrTx.vout.size();
contrTx.vout.resize(contrTx.vout.size()+testExecResult.refundOutputs.size());
for(CTxOut& vout : testExecResult.refundOutputs){
contrTx.vout[i]=vout;
i++;
}
nBlockSigOpsCost += GetLegacySigOpCount(contrTx);
//all contract costs now applied to local state
//Check if block will be too big or too expensive with this contract execution
if (nBlockSigOpsCost * WITNESS_SCALE_FACTOR > (uint64_t)dgpMaxBlockSigOps ||
nBlockWeight > dgpMaxBlockWeight) {
//contract will not be added to block, so revert state to before we tried
globalState->setRoot(oldHashStateRoot);
globalState->setRootUTXO(oldHashUTXORoot);
return false;
}
//block is not too big, so apply the contract execution and it's results to the actual block
//apply local bytecode to global bytecode state
bceResult.usedGas += testExecResult.usedGas;
bceResult.refundSender += testExecResult.refundSender;
bceResult.refundOutputs.insert(bceResult.refundOutputs.end(), testExecResult.refundOutputs.begin(), testExecResult.refundOutputs.end());
bceResult.valueTransfers = std::move(testExecResult.valueTransfers);
pblock->vtx.emplace_back(iter->GetSharedTx());
pblocktemplate->vTxFees.push_back(iter->GetFee());
pblocktemplate->vTxSigOpsCost.push_back(iter->GetSigOpCost());
this->nBlockWeight += iter->GetTxWeight();
++nBlockTx;
this->nBlockSigOpsCost += iter->GetSigOpCost();
nFees += iter->GetFee();
inBlock.insert(iter);
for (CTransaction &t : bceResult.valueTransfers) {
pblock->vtx.emplace_back(MakeTransactionRef(std::move(t)));
this->nBlockWeight += GetTransactionWeight(t);
this->nBlockSigOpsCost += GetLegacySigOpCount(t);
++nBlockTx;
}
//calculate sigops from new refund/proof tx
this->nBlockSigOpsCost -= GetLegacySigOpCount(*pblock->vtx[proofTx]);
RebuildRefundTransaction();
this->nBlockSigOpsCost += GetLegacySigOpCount(*pblock->vtx[proofTx]);
bceResult.valueTransfers.clear();
return true;
}
void BlockAssembler::AddToBlock(CTxMemPool::txiter iter)
{
pblock->vtx.emplace_back(iter->GetSharedTx());
pblocktemplate->vTxFees.push_back(iter->GetFee());
pblocktemplate->vTxSigOpsCost.push_back(iter->GetSigOpCost());
nBlockWeight += iter->GetTxWeight();
++nBlockTx;
nBlockSigOpsCost += iter->GetSigOpCost();
nFees += iter->GetFee();
inBlock.insert(iter);
bool fPrintPriority = gArgs.GetBoolArg("-printpriority", DEFAULT_PRINTPRIORITY);
if (fPrintPriority) {
LogPrintf("fee %s txid %s\n",
CFeeRate(iter->GetModifiedFee(), iter->GetTxSize()).ToString(),
iter->GetTx().GetHash().ToString());
}
}
int BlockAssembler::UpdatePackagesForAdded(const CTxMemPool::setEntries& alreadyAdded,
indexed_modified_transaction_set &mapModifiedTx)
{
int nDescendantsUpdated = 0;
for (CTxMemPool::txiter it : alreadyAdded) {
CTxMemPool::setEntries descendants;
mempool.CalculateDescendants(it, descendants);
// Insert all descendants (not yet in block) into the modified set
for (CTxMemPool::txiter desc : descendants) {
if (alreadyAdded.count(desc))
continue;
++nDescendantsUpdated;
modtxiter mit = mapModifiedTx.find(desc);
if (mit == mapModifiedTx.end()) {
CTxMemPoolModifiedEntry modEntry(desc);
modEntry.nSizeWithAncestors -= it->GetTxSize();
modEntry.nModFeesWithAncestors -= it->GetModifiedFee();
modEntry.nSigOpCostWithAncestors -= it->GetSigOpCost();
mapModifiedTx.insert(modEntry);
} else {
mapModifiedTx.modify(mit, update_for_parent_inclusion(it));
}
}
}
return nDescendantsUpdated;
}
// Skip entries in mapTx that are already in a block or are present
// in mapModifiedTx (which implies that the mapTx ancestor state is
// stale due to ancestor inclusion in the block)
// Also skip transactions that we've already failed to add. This can happen if
// we consider a transaction in mapModifiedTx and it fails: we can then
// potentially consider it again while walking mapTx. It's currently
// guaranteed to fail again, but as a belt-and-suspenders check we put it in
// failedTx and avoid re-evaluation, since the re-evaluation would be using
// cached size/sigops/fee values that are not actually correct.
bool BlockAssembler::SkipMapTxEntry(CTxMemPool::txiter it, indexed_modified_transaction_set &mapModifiedTx, CTxMemPool::setEntries &failedTx)
{
assert (it != mempool.mapTx.end());
return mapModifiedTx.count(it) || inBlock.count(it) || failedTx.count(it);
}
void BlockAssembler::SortForBlock(const CTxMemPool::setEntries& package, std::vector<CTxMemPool::txiter>& sortedEntries)
{
// Sort package by ancestor count
// If a transaction A depends on transaction B, then A's ancestor count
// must be greater than B's. So this is sufficient to validly order the
// transactions for block inclusion.
sortedEntries.clear();
sortedEntries.insert(sortedEntries.begin(), package.begin(), package.end());
std::sort(sortedEntries.begin(), sortedEntries.end(), CompareTxIterByAncestorCount());
}
// This transaction selection algorithm orders the mempool based
// on feerate of a transaction including all unconfirmed ancestors.
// Since we don't remove transactions from the mempool as we select them
// for block inclusion, we need an alternate method of updating the feerate
// of a transaction with its not-yet-selected ancestors as we go.
// This is accomplished by walking the in-mempool descendants of selected
// transactions and storing a temporary modified state in mapModifiedTxs.
// Each time through the loop, we compare the best transaction in
// mapModifiedTxs with the next transaction in the mempool to decide what
// transaction package to work on next.
void BlockAssembler::addPackageTxs(int &nPackagesSelected, int &nDescendantsUpdated, uint64_t minGasPrice, bool externalGBT)
{
// mapModifiedTx will store sorted packages after they are modified
// because some of their txs are already in the block
indexed_modified_transaction_set mapModifiedTx;
// Keep track of entries that failed inclusion, to avoid duplicate work
CTxMemPool::setEntries failedTx;
// Start by adding all descendants of previously added txs to mapModifiedTx
// and modifying them for their already included ancestors
UpdatePackagesForAdded(inBlock, mapModifiedTx);
CTxMemPool::indexed_transaction_set::index<ancestor_score_or_gas_price>::type::iterator mi = mempool.mapTx.get<ancestor_score_or_gas_price>().begin();
CTxMemPool::txiter iter;
// Limit the number of attempts to add transactions to the block when it is
// close to full; this is just a simple heuristic to finish quickly if the
// mempool has a lot of entries.
const int64_t MAX_CONSECUTIVE_FAILURES = 1000;
int64_t nConsecutiveFailed = 0;
while (mi != mempool.mapTx.get<ancestor_score_or_gas_price>().end() || !mapModifiedTx.empty())
{
if(nTimeLimit != 0 && GetAdjustedTime() >= nTimeLimit){
//no more time to add transactions, just exit
return;
}
// First try to find a new transaction in mapTx to evaluate.
if (mi != mempool.mapTx.get<ancestor_score_or_gas_price>().end() &&
SkipMapTxEntry(mempool.mapTx.project<0>(mi), mapModifiedTx, failedTx)) {
++mi;
continue;
}
// Now that mi is not stale, determine which transaction to evaluate:
// the next entry from mapTx, or the best from mapModifiedTx?
bool fUsingModified = false;
modtxscoreiter modit = mapModifiedTx.get<ancestor_score_or_gas_price>().begin();
if (mi == mempool.mapTx.get<ancestor_score_or_gas_price>().end()) {
// We're out of entries in mapTx; use the entry from mapModifiedTx
iter = modit->iter;
fUsingModified = true;
} else {
// Try to compare the mapTx entry to the mapModifiedTx entry
iter = mempool.mapTx.project<0>(mi);
if (modit != mapModifiedTx.get<ancestor_score_or_gas_price>().end() &&
CompareModifiedEntry()(*modit, CTxMemPoolModifiedEntry(iter))) {
// The best entry in mapModifiedTx has higher score
// than the one from mapTx.
// Switch which transaction (package) to consider
iter = modit->iter;
fUsingModified = true;
} else {
// Either no entry in mapModifiedTx, or it's worse than mapTx.
// Increment mi for the next loop iteration.
++mi;
}
}
// We skip mapTx entries that are inBlock, and mapModifiedTx shouldn't
// contain anything that is inBlock.
assert(!inBlock.count(iter));
uint64_t packageSize = iter->GetSizeWithAncestors();
CAmount packageFees = iter->GetModFeesWithAncestors();
int64_t packageSigOpsCost = iter->GetSigOpCostWithAncestors();
if (fUsingModified) {
packageSize = modit->nSizeWithAncestors;
packageFees = modit->nModFeesWithAncestors;
packageSigOpsCost = modit->nSigOpCostWithAncestors;
}
if (packageFees < blockMinFeeRate.GetFee(packageSize)) {
// Everything else we might consider has a lower fee rate
return;
}
if (!TestPackage(packageSize, packageSigOpsCost)) {
if (fUsingModified) {
// Since we always look at the best entry in mapModifiedTx,
// we must erase failed entries so that we can consider the
// next best entry on the next loop iteration
mapModifiedTx.get<ancestor_score_or_gas_price>().erase(modit);
failedTx.insert(iter);
}
++nConsecutiveFailed;
if (nConsecutiveFailed > MAX_CONSECUTIVE_FAILURES && nBlockWeight >
nBlockMaxWeight - 4000) {
// Give up if we're close to full and haven't succeeded in a while
break;
}
continue;
}
CTxMemPool::setEntries ancestors;
uint64_t nNoLimit = std::numeric_limits<uint64_t>::max();
std::string dummy;
mempool.CalculateMemPoolAncestors(*iter, ancestors, nNoLimit, nNoLimit, nNoLimit, nNoLimit, dummy, false);
onlyUnconfirmed(ancestors);
ancestors.insert(iter);
// Test if all tx's are Final
if (!TestPackageTransactions(ancestors)) {
if (fUsingModified) {
mapModifiedTx.get<ancestor_score_or_gas_price>().erase(modit);
failedTx.insert(iter);
}
continue;
}
// This transaction will make it in; reset the failed counter.
nConsecutiveFailed = 0;
// Package can be added. Sort the entries in a valid order.
std::vector<CTxMemPool::txiter> sortedEntries;
SortForBlock(ancestors, sortedEntries);
bool wasAdded=true;
for (size_t i=0; i<sortedEntries.size(); ++i) {
if(!wasAdded || (nTimeLimit != 0 && GetAdjustedTime() >= nTimeLimit))
{
//if out of time, or earlier ancestor failed, then skip the rest of the transactions
mapModifiedTx.erase(sortedEntries[i]);
wasAdded=false;
continue;
}
const CTransaction& tx = sortedEntries[i]->GetTx();
if(wasAdded) {
if (tx.HasCreateOrCall()) {
wasAdded = AttemptToAddContractToBlock(sortedEntries[i], minGasPrice, externalGBT);
if(!wasAdded){
if(fUsingModified) {
//this only needs to be done once to mark the whole package (everything in sortedEntries) as failed
mapModifiedTx.get<ancestor_score_or_gas_price>().erase(modit);
failedTx.insert(iter);
}
}
} else {
AddToBlock(sortedEntries[i]);
}
}
// Erase from the modified set, if present
mapModifiedTx.erase(sortedEntries[i]);
}
if(!wasAdded){
//skip UpdatePackages if a transaction failed to be added (match TestPackage logic)
continue;
}
++nPackagesSelected;
// Update transactions that depend on each of these
nDescendantsUpdated += UpdatePackagesForAdded(ancestors, mapModifiedTx);
}
}
void IncrementExtraNonce(CBlock* pblock, const CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
{
// Update nExtraNonce
static uint256 hashPrevBlock;
if (hashPrevBlock != pblock->hashPrevBlock)
{
nExtraNonce = 0;
hashPrevBlock = pblock->hashPrevBlock;
}
++nExtraNonce;
unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
CMutableTransaction txCoinbase(*pblock->vtx[0]);
txCoinbase.vin[0].scriptSig = (CScript() << nHeight << CScriptNum(nExtraNonce)) + COINBASE_FLAGS;
assert(txCoinbase.vin[0].scriptSig.size() <= 100);
pblock->vtx[0] = MakeTransactionRef(std::move(txCoinbase));
pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
}
#ifdef ENABLE_WALLET
//////////////////////////////////////////////////////////////////////////////
//
// Proof of Stake miner
//
//
// Looking for suitable coins for creating new block.
//
bool CheckStake(const std::shared_ptr<const CBlock> pblock, CWallet& wallet)
{
uint256 proofHash, hashTarget;
uint256 hashBlock = pblock->GetHash();
if(!pblock->IsProofOfStake())
return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex());
// verify hash target and signature of coinstake tx
CValidationState state;
if (!CheckProofOfStake(::BlockIndex()[pblock->hashPrevBlock], state, *pblock->vtx[1], pblock->nBits, pblock->nTime, proofHash, hashTarget, ::ChainstateActive().CoinsTip()))
return error("CheckStake() : proof-of-stake checking failed");
//// debug print
LogPrint(BCLog::COINSTAKE, "CheckStake() : new proof-of-stake block found \n hash: %s \nproofhash: %s \ntarget: %s\n", hashBlock.GetHex(), proofHash.GetHex(), hashTarget.GetHex());
LogPrint(BCLog::COINSTAKE, "%s\n", pblock->ToString());
LogPrint(BCLog::COINSTAKE, "out %s\n", FormatMoney(pblock->vtx[1]->GetValueOut()));
// Found a solution
{
auto locked_chain = wallet.chain().lock();
if (pblock->hashPrevBlock != ::ChainActive().Tip()->GetBlockHash())
return error("CheckStake() : generated block is stale");
for(const CTxIn& vin : pblock->vtx[1]->vin) {
if (wallet.IsSpent(*locked_chain, vin.prevout.hash, vin.prevout.n)) {
return error("CheckStake() : generated block became invalid due to stake UTXO being spent");
}
}
}
// Process this block the same as if we had received it from another node
bool fNewBlock = false;
if (!ProcessNewBlock(Params(), pblock, true, &fNewBlock))
return error("CheckStake() : ProcessBlock, block not accepted");
return true;
}
void ThreadStakeMiner(CWallet *pwallet, CConnman* connman)
{
SetThreadPriority(THREAD_PRIORITY_LOWEST);
// Make this thread recognisable as the mining thread
std::string threadName = "qtumstake";
if(pwallet && pwallet->GetName() != "")
{
threadName = threadName + "-" + pwallet->GetName();
}
util::ThreadRename(threadName.c_str());
bool fTryToSync = true;
bool regtestMode = Params().MineBlocksOnDemand();
if(regtestMode){
nMinerSleep = 30000; //limit regtest to 30s, otherwise it'll create 2 blocks per second
}
while (true)
{
while (pwallet->IsLocked() || !pwallet->m_enabled_staking)
{
pwallet->m_last_coin_stake_search_interval = 0;
MilliSleep(10000);
}
//don't disable PoS mining for no connections if in regtest mode
if(!regtestMode && !gArgs.GetBoolArg("-emergencystaking", false)) {
while (connman->GetNodeCount(CConnman::CONNECTIONS_ALL) == 0 || ::ChainstateActive().IsInitialBlockDownload()) {
pwallet->m_last_coin_stake_search_interval = 0;
fTryToSync = true;
MilliSleep(1000);
}
if (fTryToSync) {
fTryToSync = false;