forked from digibyte/digibyte
-
Notifications
You must be signed in to change notification settings - Fork 91
Expand file tree
/
Copy pathminer.cpp
More file actions
903 lines (782 loc) · 35.6 KB
/
Copy pathminer.cpp
File metadata and controls
903 lines (782 loc) · 35.6 KB
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
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2022 The Bitcoin Core developers
// Copyright (c) 2014-2026 The DigiByte Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <node/miner.h>
#include <chain.h>
#include <chainparams.h>
#include <coins.h>
#include <common/args.h>
#include <consensus/amount.h>
#include <consensus/consensus.h>
#include <consensus/merkle.h>
#include <consensus/tx_verify.h>
#include <consensus/validation.h>
#include <deploymentstatus.h>
#include <logging.h>
#include <policy/feerate.h>
#include <policy/policy.h>
#include <pow.h>
#include <primitives/transaction.h>
#include <timedata.h>
#include <txmempool.h>
#include <util/moneystr.h>
#include <validation.h>
#include <oracle/bundle_manager.h>
#include <oracle/signing_orchestrator.h>
#include <primitives/oracle.h>
#include <util/time.h>
#include <consensus/digidollar.h>
#include <digidollar/digidollar.h>
#include <digidollar/validation.h>
#include <algorithm>
#include <set>
#include <string_view>
#include <utility>
namespace node {
namespace {
bool TransactionTouchesDigiDollarForMiner(const CTransaction& tx)
{
// Keep marker-only parity with consensus and OracleDataValidator block
// detection. Collateral-vault spends need UTXO context and are caught by
// RequiresDigiDollarValidation() inside ValidateDDForBlockInclusion().
return DigiDollar::HasDigiDollarMarker(tx);
}
bool TransactionNeedsOraclePriceForMiner(const CTransaction& tx)
{
if (!DigiDollar::HasDigiDollarMarker(tx)) return false;
const DigiDollar::DigiDollarTxType tx_type = DigiDollar::GetDigiDollarTxType(tx);
return tx_type == DigiDollar::DD_TX_MINT || tx_type == DigiDollar::DD_TX_REDEEM;
}
bool BlockNeedsOraclePriceForMiner(const CBlock& block)
{
for (size_t i{1}; i < block.vtx.size(); ++i) {
if (TransactionNeedsOraclePriceForMiner(*block.vtx[i])) {
return true;
}
}
return false;
}
} // namespace
int64_t UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev, int algo)
{
int64_t nOldTime = pblock->nTime;
int64_t nNewTime{std::max<int64_t>(pindexPrev->GetMedianTimePast() + 1, TicksSinceEpoch<std::chrono::seconds>(GetAdjustedTime()))};
if (nOldTime < nNewTime) {
pblock->nTime = nNewTime;
}
// Updating time can change work required on testnet:
if (consensusParams.fPowAllowMinDifficultyBlocks) {
pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams, algo);
}
return nNewTime - nOldTime;
}
void RegenerateCommitments(CBlock& block, ChainstateManager& chainman)
{
CMutableTransaction tx{*block.vtx.at(0)};
tx.vout.erase(
std::remove_if(tx.vout.begin(), tx.vout.end(),
[](const CTxOut& txout) { return txout.scriptPubKey.IsUnspendable(); }),
tx.vout.end());
block.vtx.at(0) = MakeTransactionRef(tx);
const CBlockIndex* prev_block = WITH_LOCK(::cs_main, return chainman.m_blockman.LookupBlockIndex(block.hashPrevBlock));
chainman.GenerateCoinbaseCommitment(block, prev_block);
// Re-add oracle bundle (was stripped with other OP_RETURN outputs above)
// when the regenerated block needs one for price-dependent DD activity.
if (prev_block && BlockNeedsOraclePriceForMiner(block)) {
if (DigiDollar::IsDigiDollarEnabled(prev_block, chainman)) {
OracleBundleManager& oracle_manager = OracleBundleManager::GetInstance();
int32_t nHeight = prev_block->nHeight + 1;
oracle_manager.AddOracleBundleToBlock(block, nHeight);
}
}
block.hashMerkleRoot = BlockMerkleRoot(block);
}
static BlockAssembler::Options ClampOptions(BlockAssembler::Options options)
{
// Limit weight to between 4K and DEFAULT_BLOCK_MAX_WEIGHT for sanity:
options.nBlockMaxWeight = std::clamp<size_t>(options.nBlockMaxWeight, 4000, DEFAULT_BLOCK_MAX_WEIGHT);
return options;
}
BlockAssembler::BlockAssembler(Chainstate& chainstate, const CTxMemPool* mempool, const Options& options)
: chainparams{chainstate.m_chainman.GetParams()},
m_mempool{mempool},
m_chainstate{chainstate},
m_options{ClampOptions(options)}
{
}
void ApplyArgsManOptions(const ArgsManager& args, BlockAssembler::Options& options)
{
// Block resource limits
options.nBlockMaxWeight = args.GetIntArg("-blockmaxweight", options.nBlockMaxWeight);
if (const auto blockmintxfee{args.GetArg("-blockmintxfee")}) {
if (const auto parsed{ParseMoney(*blockmintxfee)}) options.blockMinFeeRate = CFeeRate{*parsed};
}
}
BlockAssembler::Options BlockAssembler::DefaultOptions()
{
BlockAssembler::Options options;
ApplyArgsManOptions(gArgs, options);
return options;
}
BlockAssembler::BlockAssembler(Chainstate& chainstate, const CTxMemPool* mempool)
: BlockAssembler(chainstate, mempool, DefaultOptions()) {}
void BlockAssembler::resetBlock()
{
inBlock.clear();
m_dd_tx_lookup_cache.clear();
m_dd_tx_lookup_loaded_heights.clear();
// Reserve space for coinbase tx
nBlockWeight = 4000;
nBlockSigOpsCost = 400;
// These counters do not include coinbase tx
nBlockTx = 0;
nFees = 0;
}
static bool IsRetryableDigiDollarBlockFailure(const BlockValidationState& state, std::string_view what = {})
{
const std::string& reject_reason = state.GetRejectReason();
// DD-FA-FUNC-016: include bad-oracle-timestamp so a miner that assembled a
// DD-touching block under a bundle that has just aged out of the
// wall-clock freshness window can gracefully degrade to a non-DD block
// (after RemoveDDTransactionsFromBlock + retry) instead of throwing.
if (reject_reason == "insufficient-collateral" ||
reject_reason == "bad-oracle-price" ||
reject_reason == "invalid-oracle-price" ||
reject_reason == "bad-oracle-missing" ||
reject_reason == "bad-oracle-malformed" ||
reject_reason == "bad-oracle-musig2" ||
reject_reason == "bad-oracle-legacy" ||
reject_reason == "bad-oracle-bundle" ||
reject_reason == "bad-oracle-timestamp") {
return true;
}
if (what.empty()) {
return false;
}
return what.find("insufficient-collateral") != std::string_view::npos ||
what.find("bad-oracle-price") != std::string_view::npos ||
what.find("invalid-oracle-price") != std::string_view::npos ||
what.find("bad-oracle-") != std::string_view::npos;
}
bool BlockAssembler::IsDDTransactionForMiner(const CTransaction& tx) const
{
return TransactionTouchesDigiDollarForMiner(tx);
}
bool BlockAssembler::LookupPreviousTxForDDValidation(const uint256& txid, uint32_t coinHeight, CTransactionRef& tx_out)
{
AssertLockHeld(::cs_main);
const auto cache_key = std::make_pair(coinHeight, txid);
auto tx_it = m_dd_tx_lookup_cache.find(cache_key);
if (tx_it != m_dd_tx_lookup_cache.end()) {
tx_out = tx_it->second;
return true;
}
if (coinHeight == MEMPOOL_HEIGHT || m_dd_tx_lookup_loaded_heights.count(coinHeight)) {
return false;
}
const CBlockIndex* pblockindex = m_chainstate.m_chain[coinHeight];
if (!pblockindex) return false;
CBlock block;
if (!m_chainstate.m_blockman.ReadBlockFromDisk(block, *pblockindex)) return false;
for (const auto& btx : block.vtx) {
m_dd_tx_lookup_cache.emplace(std::make_pair(coinHeight, btx->GetHash()), btx);
}
m_dd_tx_lookup_loaded_heights.insert(coinHeight);
tx_it = m_dd_tx_lookup_cache.find(cache_key);
if (tx_it == m_dd_tx_lookup_cache.end()) {
return false;
}
tx_out = tx_it->second;
return true;
}
bool BlockAssembler::ValidateDDForBlockInclusion(const CTransaction& tx, const CBlockIndex* pindexPrev)
{
AssertLockHeld(::cs_main);
const int block_height = pindexPrev->nHeight + 1;
assert(m_mempool);
auto txLookup = [this](const uint256& txid, uint32_t coinHeight, CTransactionRef& tx_out) -> bool {
return LookupPreviousTxForDDValidation(txid, coinHeight, tx_out);
};
CCoinsViewMemPool mempool_view(&m_chainstate.CoinsTip(), *m_mempool);
CCoinsViewCache coins_view(&mempool_view);
DigiDollar::ValidationContext dd_probe(
block_height,
0,
DigiDollar::GetSystemCollateralRatio(),
chainparams,
&coins_view,
true,
txLookup,
m_mempool
);
if (!IsDDTransactionForMiner(tx) &&
!DigiDollar::RequiresDigiDollarValidation(tx, dd_probe)) {
return true;
}
// If the tx has DD-looking metadata or spends DD collateral but lacks the marker bits,
// keep miner behavior conservative and skip it.
if (!DigiDollar::HasDigiDollarMarker(tx)) {
return false;
}
if (!DigiDollar::IsDigiDollarEnabled(pindexPrev, m_chainstate.m_chainman)) {
return false;
}
const bool needs_oracle_price = TransactionNeedsOraclePriceForMiner(tx);
if (needs_oracle_price && !m_options.include_oracle_priced_digidollar_txs) {
LogPrint(BCLog::DIGIDOLLAR,
"CreateNewBlock(): skipping oracle-priced DD tx %s because the mining policy did not opt into DigiDollar oracle commitments\n",
tx.GetHash().ToString());
return false;
}
if (!needs_oracle_price) {
DigiDollar::ValidationContext dd_context(
block_height,
0,
DigiDollar::GetSystemCollateralRatio(),
chainparams,
&coins_view,
true,
txLookup,
m_mempool
);
TxValidationState tx_state;
if (!DigiDollar::ValidateDigiDollarTransaction(tx, dd_context, tx_state)) {
LogPrint(BCLog::DIGIDOLLAR,
"CreateNewBlock(): skipping DD transfer %s during package selection: %s\n",
tx.GetHash().ToString(), tx_state.GetRejectReason());
return false;
}
return true;
}
const int32_t epoch = GetCurrentEpoch(block_height);
OracleBundleManager& oracle_manager = OracleBundleManager::GetInstance();
COracleBundle block_bundle = oracle_manager.GetCurrentBundle(epoch);
std::string oracle_error;
bool have_valid_bundle = oracle_manager.IsEnabled() &&
OracleBundleManager::ValidateMuSig2Bundle(block_bundle, block_height,
chainparams.GetConsensus(), oracle_error);
// The miner must use the same live MuSig2 readiness source as
// AddOracleBundleToBlock(). GetCurrentBundle(epoch) only reflects bundles
// already materialized in the manager; a freshly-completed signing session
// is enough to build a valid DD block and will be embedded in the coinbase
// later in CreateNewBlock(). Without this, DD mempool txs are skipped even
// while AddOracleBundleToBlock() can stamp a valid v0x03 bundle.
if (!have_valid_bundle && oracle_manager.IsEnabled() && g_signing_orchestrator) {
COracleBundle session_bundle(epoch);
session_bundle.version = 3;
uint64_t signed_price = 0;
int64_t signed_timestamp = 0;
if (g_signing_orchestrator->GetCompletedSession(
epoch, session_bundle.aggregate_sig,
session_bundle.participation_bitmap,
signed_price, signed_timestamp)) {
session_bundle.median_price_micro_usd = signed_price;
session_bundle.timestamp = signed_timestamp;
std::string session_error;
if (OracleBundleManager::ValidateMuSig2Bundle(session_bundle, block_height,
chainparams.GetConsensus(), session_error)) {
block_bundle = std::move(session_bundle);
have_valid_bundle = true;
oracle_error.clear();
} else {
oracle_error = session_error;
}
}
}
if (!have_valid_bundle) {
LogPrint(BCLog::DIGIDOLLAR,
"CreateNewBlock(): skipping DD tx %s because no valid MuSig2 oracle bundle is ready for height %d: %s\n",
tx.GetHash().ToString(), block_height, oracle_error);
return false;
}
// DD-FA-FUNC-016 (Wave 13): mirror the wall-clock freshness check
// performed by HasRecentValidMuSig2OracleQuote in mempool acceptance
// (validation.cpp:154-217). ValidateMuSig2Bundle above only checks
// signature/epoch/roster/range; it does not enforce age-vs-now.
// Without this guard the miner would pick DD txs into a template using
// a stale bundle that mempool already refused, then ConnectBlock would
// reject the assembled block via OracleDataValidator::ValidateBlockOracleData
// (block.nTime - bundle.timestamp > ORACLE_MAX_AGE_SECONDS). Pin parity
// with the mempool gate so all three contexts agree on the same fixture.
const int64_t now = GetTime();
if (block_bundle.timestamp <= 0 || block_bundle.timestamp > now + 60 ||
now - block_bundle.timestamp > ORACLE_MAX_AGE_SECONDS) {
LogPrint(BCLog::DIGIDOLLAR,
"CreateNewBlock(): skipping DD tx %s: bundle age %lld s outside wall-clock freshness window (max %d s)\n",
tx.GetHash().ToString(),
static_cast<long long>(now - block_bundle.timestamp),
ORACLE_MAX_AGE_SECONDS);
return false;
}
DigiDollar::ValidationContext dd_context(
block_height,
GetOraclePriceForTransaction(tx, block_height, static_cast<CAmount>(block_bundle.median_price_micro_usd)),
DigiDollar::GetSystemCollateralRatio(),
chainparams,
&coins_view,
false,
txLookup,
m_mempool
);
TxValidationState tx_state;
if (!DigiDollar::ValidateDigiDollarTransaction(tx, dd_context, tx_state)) {
LogPrint(BCLog::DIGIDOLLAR,
"CreateNewBlock(): skipping DD tx %s during package selection: %s\n",
tx.GetHash().ToString(), tx_state.GetRejectReason());
return false;
}
return true;
}
bool BlockAssembler::RemoveDDTransactionsFromBlock(const CBlockIndex* pindexPrev)
{
CBlock& block = pblocktemplate->block;
if (block.vtx.size() <= 1) {
return false;
}
std::vector<CTransactionRef> kept_vtx;
std::vector<CAmount> kept_fees;
std::vector<int64_t> kept_sigops;
kept_vtx.reserve(block.vtx.size());
kept_fees.reserve(pblocktemplate->vTxFees.size());
kept_sigops.reserve(pblocktemplate->vTxSigOpsCost.size());
kept_vtx.push_back(block.vtx[0]);
kept_fees.push_back(pblocktemplate->vTxFees[0]);
kept_sigops.push_back(pblocktemplate->vTxSigOpsCost[0]);
CAmount kept_fee_total{0};
size_t removed{0};
for (size_t i{1}; i < block.vtx.size(); ++i) {
if (TransactionNeedsOraclePriceForMiner(*block.vtx[i])) {
++removed;
continue;
}
kept_vtx.push_back(block.vtx[i]);
kept_fees.push_back(pblocktemplate->vTxFees[i]);
kept_sigops.push_back(pblocktemplate->vTxSigOpsCost[i]);
kept_fee_total += pblocktemplate->vTxFees[i];
}
if (removed == 0) {
return false;
}
block.vtx = std::move(kept_vtx);
pblocktemplate->vTxFees = std::move(kept_fees);
pblocktemplate->vTxSigOpsCost = std::move(kept_sigops);
nBlockTx = block.vtx.size() - 1;
nFees = kept_fee_total;
CMutableTransaction coinbase_tx{*block.vtx[0]};
if (coinbase_tx.vout.empty()) {
return false;
}
coinbase_tx.vout[0].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
block.vtx[0] = MakeTransactionRef(std::move(coinbase_tx));
// Rebuild witness commitment/oracle bundle and merkle root after removing txs.
CMutableTransaction stripped_coinbase{*block.vtx[0]};
stripped_coinbase.vout.erase(
std::remove_if(stripped_coinbase.vout.begin(), stripped_coinbase.vout.end(),
[](const CTxOut& txout) { return txout.scriptPubKey.IsUnspendable(); }),
stripped_coinbase.vout.end());
block.vtx[0] = MakeTransactionRef(std::move(stripped_coinbase));
pblocktemplate->vchCoinbaseCommitment = m_chainstate.m_chainman.GenerateCoinbaseCommitment(block, pindexPrev);
if (DigiDollar::IsDigiDollarEnabled(pindexPrev, m_chainstate.m_chainman) &&
BlockNeedsOraclePriceForMiner(block)) {
OracleBundleManager& oracle_manager = OracleBundleManager::GetInstance();
if (!oracle_manager.AddOracleBundleToBlock(block, nHeight)) {
LogPrintf("CreateNewBlock(): Warning - Failed to add oracle bundle during DD retry for block %d\n", nHeight);
}
}
block.hashMerkleRoot = BlockMerkleRoot(block);
pblocktemplate->vTxFees[0] = -nFees;
pblocktemplate->vTxSigOpsCost[0] = WITNESS_SCALE_FACTOR * GetLegacySigOpCount(*block.vtx[0]);
nBlockWeight = GetBlockWeight(block);
nBlockSigOpsCost = 0;
for (int64_t sigops : pblocktemplate->vTxSigOpsCost) {
if (sigops > 0) {
nBlockSigOpsCost += sigops;
}
}
m_last_block_num_txs = nBlockTx;
m_last_block_weight = nBlockWeight;
return true;
}
std::unique_ptr<CBlockTemplate> BlockAssembler::CreateNewBlock(const CScript& scriptPubKeyIn, int algo)
{
const auto time_start{SteadyClock::now()};
resetBlock();
pblocktemplate.reset(new CBlockTemplate());
if (!pblocktemplate.get()) {
return nullptr;
}
CBlock* const pblock = &pblocktemplate->block; // pointer for convenience
// Add dummy coinbase tx as first transaction
pblock->vtx.emplace_back();
pblocktemplate->vTxFees.push_back(-1); // updated at end
pblocktemplate->vTxSigOpsCost.push_back(-1); // updated at end
LOCK(::cs_main);
CBlockIndex* pindexPrev = m_chainstate.m_chain.Tip();
assert(pindexPrev != nullptr);
nHeight = pindexPrev->nHeight + 1;
// DigiByte: Check if algorithm is active before creating block
if (!IsAlgoActive(pindexPrev, chainparams.GetConsensus(), algo))
throw std::runtime_error(strprintf("Algorithm '%s' is not currently active.", GetAlgoName(algo).c_str()));
pblock->nVersion = m_chainstate.m_chainman.m_versionbitscache.ComputeBlockVersion(pindexPrev, chainparams.GetConsensus(), algo);
// -regtest only: allow overriding block.nVersion with
// -blockversion=N to test forking scenarios
if (chainparams.MineBlocksOnDemand()) {
pblock->nVersion = gArgs.GetIntArg("-blockversion", pblock->nVersion);
}
pblock->nTime = TicksSinceEpoch<std::chrono::seconds>(GetAdjustedTime());
m_lock_time_cutoff = pindexPrev->GetMedianTimePast();
int nPackagesSelected = 0;
int nDescendantsUpdated = 0;
if (m_mempool) {
LOCK(m_mempool->cs);
addPackageTxs(*m_mempool, nPackagesSelected, nDescendantsUpdated);
}
const auto time_1{SteadyClock::now()};
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);
coinbaseTx.vout[0].scriptPubKey = scriptPubKeyIn;
coinbaseTx.vout[0].nValue = nFees + GetBlockSubsidy(nHeight, chainparams.GetConsensus());
coinbaseTx.vin[0].scriptSig = CScript() << nHeight << OP_0;
pblock->vtx[0] = MakeTransactionRef(std::move(coinbaseTx));
pblocktemplate->vchCoinbaseCommitment = m_chainstate.m_chainman.GenerateCoinbaseCommitment(*pblock, pindexPrev);
pblocktemplate->vTxFees[0] = -nFees;
// Stamp a fresh MuSig2 oracle bundle when available after DigiDollar activation.
// Price-dependent DD operations (mint/redeem) require it. Price-independent
// DD transfers do not; they must keep flowing during oracle outages.
if (m_options.include_oracle_bundle &&
DigiDollar::IsDigiDollarEnabled(pindexPrev, m_chainstate.m_chainman)) {
OracleBundleManager& oracle_manager = OracleBundleManager::GetInstance();
const bool block_needs_oracle_price = BlockNeedsOraclePriceForMiner(*pblock);
if (oracle_manager.AddOracleBundleToBlock(*pblock, nHeight)) {
// AddOracleBundleToBlock() mutates the coinbase after GenerateCoinbaseCommitment().
// Keep the template header internally consistent for GBT/miner consumers that use
// the returned block directly instead of first calling IncrementExtraNonce().
pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
} else if (block_needs_oracle_price) {
LogPrintf("CreateNewBlock(): removing oracle-priced DD transactions because no valid MuSig2 oracle bundle is ready for block %d\n",
nHeight);
RemoveDDTransactionsFromBlock(pindexPrev);
}
}
LogPrintf("CreateNewBlock(): block weight: %u txs: %u fees: %ld sigops %d\n", GetBlockWeight(*pblock), nBlockTx, nFees, nBlockSigOpsCost);
// Fill in header
pblock->hashPrevBlock = pindexPrev->GetBlockHash();
UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev, algo);
pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, chainparams.GetConsensus(), algo);
pblock->nNonce = 0;
pblocktemplate->vTxSigOpsCost[0] = WITNESS_SCALE_FACTOR * GetLegacySigOpCount(*pblock->vtx[0]);
BlockValidationState state;
if (m_options.test_block_validity) {
if (m_options.on_before_test_block_validity) {
m_options.on_before_test_block_validity();
}
auto run_block_validity = [&](BlockValidationState& check_state) {
return TestBlockValidity(check_state, chainparams, m_chainstate, *pblock, pindexPrev,
GetAdjustedTime, /*fCheckPOW=*/false, /*fCheckMerkleRoot=*/false);
};
bool needs_dd_retry{false};
try {
if (!run_block_validity(state)) {
needs_dd_retry = IsRetryableDigiDollarBlockFailure(state);
if (!needs_dd_retry) {
throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, state.ToString()));
}
}
} catch (const std::exception& e) {
needs_dd_retry = IsRetryableDigiDollarBlockFailure(state, e.what());
if (!needs_dd_retry) {
throw;
}
}
if (needs_dd_retry) {
LogPrintf("CreateNewBlock(): DD collateral failure detected, retrying block assembly without DD transactions at height %d\n", nHeight);
if (!RemoveDDTransactionsFromBlock(pindexPrev)) {
throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, state.ToString()));
}
BlockValidationState retry_state;
if (!run_block_validity(retry_state)) {
throw std::runtime_error(strprintf("%s: TestBlockValidity failed after DD retry: %s", __func__, retry_state.ToString()));
}
}
}
const auto time_2{SteadyClock::now()};
LogPrint(BCLog::BENCH, "CreateNewBlock() packages: %.2fms (%d packages, %d updated descendants), validity: %.2fms (total %.2fms)\n",
Ticks<MillisecondsDouble>(time_1 - time_start), nPackagesSelected, nDescendantsUpdated,
Ticks<MillisecondsDouble>(time_2 - time_1),
Ticks<MillisecondsDouble>(time_2 - time_start));
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 >= m_options.nBlockMaxWeight) {
return false;
}
if (nBlockSigOpsCost + packageSigOpsCost >= MAX_BLOCK_SIGOPS_COST) {
return false;
}
return true;
}
// Perform transaction-level checks before adding to block:
// - transaction finality (locktime)
bool BlockAssembler::TestPackageTransactions(const CTxMemPool::setEntries& package) const
{
for (CTxMemPool::txiter it : package) {
if (!IsFinalTx(it->GetTx(), nHeight, m_lock_time_cutoff)) {
return false;
}
}
return true;
}
void BlockAssembler::AddToBlock(CTxMemPool::txiter iter)
{
pblocktemplate->block.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 rate %s txid %s\n",
CFeeRate(iter->GetModifiedFee(), iter->GetTxSize()).ToString(),
iter->GetTx().GetHash().ToString());
}
}
/** Add descendants of given transactions to mapModifiedTx with ancestor
* state updated assuming given transactions are inBlock. Returns number
* of updated descendants. */
static int UpdatePackagesForAdded(const CTxMemPool& mempool,
const CTxMemPool::setEntries& alreadyAdded,
indexed_modified_transaction_set& mapModifiedTx) EXCLUSIVE_LOCKS_REQUIRED(mempool.cs)
{
AssertLockHeld(mempool.cs);
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);
mit = mapModifiedTx.insert(modEntry).first;
}
mapModifiedTx.modify(mit, update_for_parent_inclusion(it));
}
}
return nDescendantsUpdated;
}
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(const CTxMemPool& mempool, int& nPackagesSelected, int& nDescendantsUpdated)
{
AssertLockHeld(mempool.cs);
// 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;
CTxMemPool::indexed_transaction_set::index<ancestor_score>::type::iterator mi = mempool.mapTx.get<ancestor_score>().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>().end() || !mapModifiedTx.empty()) {
// First try to find a new transaction in mapTx to evaluate.
//
// 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.
/** Return true if given transaction from mapTx has already been evaluated,
* or if the transaction's cached data in mapTx is incorrect. */
if (mi != mempool.mapTx.get<ancestor_score>().end()) {
auto it = mempool.mapTx.project<0>(mi);
assert(it != mempool.mapTx.end());
if (mapModifiedTx.count(it) || inBlock.count(it) || failedTx.count(it)) {
++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>().begin();
if (mi == m_mempool->mapTx.get<ancestor_score>().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 = m_mempool->mapTx.project<0>(mi);
if (modit != mapModifiedTx.get<ancestor_score>().end() &&
CompareTxMemPoolEntryByAncestorFee()(*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 < m_options.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>().erase(modit);
failedTx.insert(iter);
}
++nConsecutiveFailed;
if (nConsecutiveFailed > MAX_CONSECUTIVE_FAILURES && nBlockWeight >
m_options.nBlockMaxWeight - 4000) {
// Give up if we're close to full and haven't succeeded in a while
break;
}
continue;
}
auto ancestors{mempool.AssumeCalculateMemPoolAncestors(__func__, *iter, CTxMemPool::Limits::NoLimits(), /*fSearchForParents=*/false)};
onlyUnconfirmed(ancestors);
ancestors.insert(iter);
// Test if all tx's are Final
if (!TestPackageTransactions(ancestors)) {
if (fUsingModified) {
mapModifiedTx.get<ancestor_score>().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);
const CBlockIndex* const pindexPrev = m_chainstate.m_chain.Tip();
assert(pindexPrev != nullptr);
CTxMemPool::setEntries added_ancestors;
std::set<uint256> skipped_package_txids;
for (size_t i = 0; i < sortedEntries.size(); ++i) {
const CTransaction& tx = sortedEntries[i]->GetTx();
const uint256 txid = tx.GetHash();
bool depends_on_skipped_package_tx = false;
for (const CTxIn& input : tx.vin) {
if (skipped_package_txids.count(input.prevout.hash)) {
depends_on_skipped_package_tx = true;
break;
}
}
if (failedTx.count(sortedEntries[i]) || depends_on_skipped_package_tx) {
failedTx.insert(sortedEntries[i]);
skipped_package_txids.insert(txid);
continue;
}
if (!ValidateDDForBlockInclusion(tx, pindexPrev)) {
failedTx.insert(sortedEntries[i]);
skipped_package_txids.insert(txid);
continue;
}
AddToBlock(sortedEntries[i]);
added_ancestors.insert(sortedEntries[i]);
// Erase from the modified set, if present
mapModifiedTx.erase(sortedEntries[i]);
}
// If the trigger tx came from mapModifiedTx but was not added (DD
// validation failure), erase modit so the outer loop progresses.
// Without this, the same mapModifiedTx entry is reselected forever.
if (fUsingModified && !added_ancestors.count(iter)) {
mapModifiedTx.get<ancestor_score>().erase(modit);
}
if (added_ancestors.empty()) {
continue;
}
++nPackagesSelected;
// Update transactions that depend on each of these
nDescendantsUpdated += UpdatePackagesForAdded(mempool, added_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));
assert(txCoinbase.vin[0].scriptSig.size() <= 100);
pblock->vtx[0] = MakeTransactionRef(std::move(txCoinbase));
pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
}
} // namespace node