/
pos.cpp
628 lines (544 loc) · 28.3 KB
/
pos.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
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 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 <pos.h>
#include <arith_uint256.h>
#include <chain.h>
#include <primitives/block.h>
#include <uint256.h>
#include <utilmoneystr.h>
#include <policy/policy.h>
#include <addrman.h>
#include <util.h>
#include <streams.h>
#include <hash.h>
#include <miner.h>
#include <utiltime.h>
#include <chainparams.h>
#include <consensus/validation.h>
#include <script/interpreter.h>
#include <index/txindex.h>
#include <validation.h>
// wrapper class for block timestamp/hash pair to enable custom sorting that matches the legacy Cloak codebase
class TimeHash : public std::pair<int64_t, arith_uint256>
{
public:
TimeHash(int64_t time, arith_uint256 hash)
{
this->first = time;
this->second = hash;
}
friend inline bool operator<(const TimeHash& a, const TimeHash& b)
{
return a.first < b.first || (a.first == b.first && a.second < b.second);
}
};
// Hashed
typedef std::vector<TimeHash> TimestampedHashes;
std::set<std::pair<COutPoint, unsigned int> > setStakeSeen;
std::map<uint256, uint256> mapProofOfStake;
// Hard checkpoints of stake modifiers to ensure they are deterministic
static std::map<int, unsigned int> mapStakeModifierCheckpoints = {{0, 0xfd11f4e7u}};
// miner's coin stake reward based on nBits and coin age spent (coin-days)
// simple algorithm, not depend on the diff
int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, unsigned int nTime, int nHeight)
{
int64_t nRewardCoinYear;
nRewardCoinYear = MAX_MINT_PROOF_OF_STAKE;
int64_t nSubsidy = nCoinAge * nRewardCoinYear / 365;
//if (gArgs.GetBoolArg("-printcreation", false))
// LogPrint("GetProofOfStakeReward(): create=%s nCoinAge=%u nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
return nSubsidy;
}
// Get selection interval section (in seconds)
static int64_t GetStakeModifierSelectionIntervalSection(int nSection)
{
assert(nSection >= 0 && nSection < 64);
unsigned int nModifierInterval = Params().GetConsensus().nStakeModifierInterval;
int64_t a = nModifierInterval * 63 / (63 + ((63 - nSection) * (MODIFIER_INTERVAL_RATIO - 1)));
return a;
}
// Get stake modifier selection interval (in seconds)
static int64_t GetStakeModifierSelectionInterval()
{
int64_t nSelectionInterval = 0;
for (int nSection = 0; nSection < 64; nSection++)
{
nSelectionInterval += GetStakeModifierSelectionIntervalSection(nSection);
}
return nSelectionInterval;
}
// Get the last stake modifier and its generation time from a given block
static bool GetLastStakeModifier(const CBlockIndex* pindex, uint64_t& nStakeModifier, int64_t& nModifierTime)
{
if (!pindex)
return error("GetLastStakeModifier: null pindex");
while (pindex && pindex->pprev && !pindex->GeneratedStakeModifier())
pindex = pindex->pprev;
if (!pindex->GeneratedStakeModifier())
return error("GetLastStakeModifier: no generation at genesis block");
nStakeModifier = pindex->nStakeModifier;
nModifierTime = pindex->GetBlockTime();
return true;
}
// select a block from the candidate blocks in vSortedByTimestamp, excluding
// already selected blocks in vSelectedBlocks, and with timestamp up to
// nSelectionIntervalStop.
static bool SelectBlockFromCandidates(
TimestampedHashes& vSortedByTimestamp,
std::map<uint256, const CBlockIndex*>& mapSelectedBlocks,
int64_t nSelectionIntervalStop, uint64_t nStakeModifierPrev,
const CBlockIndex** pindexSelected)
{
bool fSelected = false;
arith_uint256 hashBest = arith_uint256();
*pindexSelected = (const CBlockIndex*)0;
std::vector<const CBlockIndex*> indexes;
for (const std::pair<int64_t, arith_uint256>& item : vSortedByTimestamp)
{
if (!mapBlockIndex.count(ArithToUint256(item.second)))
return error("SelectBlockFromCandidates: failed to find block index for candidate block %s", item.second.ToString().c_str());
const CBlockIndex* pindex = mapBlockIndex[ArithToUint256(item.second)];
indexes.push_back(pindex);
if (fSelected && pindex->GetBlockTime() > nSelectionIntervalStop)
break;
if (mapSelectedBlocks.count(pindex->GetBlockHash()) > 0)
continue;
// compute the selection hash by hashing its proof-hash and the
// previous proof-of-stake modifier
uint256 hashProof = pindex->IsProofOfStake() ? ArithToUint256(pindex->hashProofOfStake) : pindex->GetBlockHash();
std::string strHashProof = hashProof.GetHex();
CDataStream ss(SER_GETHASH, 0);
ss << hashProof << nStakeModifierPrev;
arith_uint256 hashChecksum = UintToArith256(Hash(ss.begin(), ss.end()));
arith_uint256 hashSelection = UintToArith256(Hash(ss.begin(), ss.end()));
std::string strHashSelection = hashSelection.GetHex();
// the selection hash is divided by 2**32 so that proof-of-stake block
// is always favored over proof-of-work block. this is to preserve
// the energy efficiency property
if (pindex->IsProofOfStake())
hashSelection >>= 32;
if (fSelected && hashSelection < hashBest)
{
hashBest = hashSelection;
*pindexSelected = (const CBlockIndex*)pindex;
}
else if (!fSelected)
{
fSelected = true;
hashBest = hashSelection;
*pindexSelected = (const CBlockIndex*)pindex;
}
}
if (gArgs.GetBoolArg("-printstakemodifier", false))
LogPrintf("SelectBlockFromCandidates: selection hash=%s\n", hashBest.ToString().c_str());
return fSelected;
}
// Stake Modifier (hash modifier of proof-of-stake):
// The purpose of stake modifier is to prevent a txout (coin) owner from
// computing future proof-of-stake generated by this txout at the time
// of transaction confirmation. To meet kernel protocol, the txout
// must hash with a future stake modifier to generate the proof.
// Stake modifier consists of bits each of which is contributed from a
// selected block of a given block group in the past.
// The selection of a block is based on a hash of the block's proof-hash and
// the previous stake modifier.
// Stake modifier is recomputed at a fixed time interval instead of every
// block. This is to make it difficult for an attacker to gain control of
// additional bits in the stake modifier, even after generating a chain of
// blocks.
bool ComputeNextStakeModifier(const CBlockIndex* pindexPrev, uint64_t& nStakeModifier, bool& fGeneratedStakeModifier)
{
nStakeModifier = 0;
fGeneratedStakeModifier = false;
if (!pindexPrev)
{
fGeneratedStakeModifier = true;
return true; // genesis block's modifier is 0
}
// First find current stake modifier and its generation block time
// if it's not old enough, return the same stake modifier
int64_t nModifierTime = 0;
if (!GetLastStakeModifier(pindexPrev, nStakeModifier, nModifierTime))
return error("ComputeNextStakeModifier: unable to get last modifier");
LogPrint(BCLog::SELECTCOINS, "ComputeNextStakeModifier: prev modifier=0x%016x time=%s\n", nStakeModifier, DateTimeStrFormat("%Y-%m-%d %H:%M:%S", nModifierTime).c_str());
unsigned int nModifierInterval = Params().GetConsensus().nStakeModifierInterval;
if (nModifierTime / nModifierInterval >= pindexPrev->GetBlockTime() / nModifierInterval)
return true;
// Sort candidate blocks by timestamp
TimestampedHashes vSortedByTimestamp;
vSortedByTimestamp.reserve(64 * nModifierInterval / Params().GetConsensus().nStakeTargetSpacing);
int64_t nSelectionInterval = GetStakeModifierSelectionInterval();
int64_t nSelectionIntervalStart = (pindexPrev->GetBlockTime() / nModifierInterval) * nModifierInterval - nSelectionInterval;
const CBlockIndex* pindex = pindexPrev;
int index = 0;
while (pindex && pindex->GetBlockTime() >= nSelectionIntervalStart)
{
//LogPrintf("Adding %d height = %d hash = %s\n", index, pindex->nHeight, pindex->GetBlockHash().GetHex().c_str());
uint256 hash = pindex->GetBlockHash();
vSortedByTimestamp.push_back(TimeHash(pindex->GetBlockTime(), UintToArith256(hash)));
pindex = pindex->pprev;
index++;
}
int nHeightFirstCandidate = pindex ? (pindex->nHeight + 1) : 0;
reverse(vSortedByTimestamp.begin(), vSortedByTimestamp.end());
// custom sort the hashed timestamps
sort(vSortedByTimestamp.begin(), vSortedByTimestamp.end());
// Select 64 blocks from candidate blocks to generate stake modifier
uint64_t nStakeModifierNew = 0;
int64_t nSelectionIntervalStop = nSelectionIntervalStart;
std::map<uint256, const CBlockIndex*> mapSelectedBlocks;
for (int nRound = 0; nRound < std::min(64, (int)vSortedByTimestamp.size()); nRound++)
{
// add an interval section to the current selection round
nSelectionIntervalStop += GetStakeModifierSelectionIntervalSection(nRound);
// select a block from the candidates of current round
if (!SelectBlockFromCandidates(vSortedByTimestamp, mapSelectedBlocks, nSelectionIntervalStop, nStakeModifier, &pindex))
return error("ComputeNextStakeModifier: unable to select block at round %d", nRound);
// write the entropy bit of the selected block
nStakeModifierNew |= (((uint64_t)pindex->GetStakeEntropyBit()) << nRound);
// add the selected block from candidates to selected list
mapSelectedBlocks.insert(std::make_pair(pindex->GetBlockHash(), pindex));
if (gArgs.GetBoolArg("-printstakemodifier", false))
LogPrintf("ComputeNextStakeModifier: selected round %d stop=%s height=%d bit=%d sm=%lu\n",
nRound, DateTimeStrFormat("%Y-%m-%d %H:%M:%S", nSelectionIntervalStop).c_str(), pindex->nHeight, pindex->GetStakeEntropyBit(), nStakeModifierNew);
}
// Print selection map for visualization of the selected blocks
if (gArgs.GetBoolArg("-printstakemodifier", false))
{
std::string strSelectionMap = "";
// '-' indicates proof-of-work blocks not selected
strSelectionMap.insert(0, pindexPrev->nHeight - nHeightFirstCandidate + 1, '-');
pindex = pindexPrev;
while (pindex && pindex->nHeight >= nHeightFirstCandidate)
{
// '=' indicates proof-of-stake blocks not selected
if (pindex->IsProofOfStake())
strSelectionMap.replace(pindex->nHeight - nHeightFirstCandidate, 1, "=");
pindex = pindex->pprev;
}
for(const std::pair<uint256, const CBlockIndex*>& item : mapSelectedBlocks)
{
// 'S' indicates selected proof-of-stake blocks
// 'W' indicates selected proof-of-work blocks
strSelectionMap.replace(item.second->nHeight - nHeightFirstCandidate, 1, item.second->IsProofOfStake() ? "S" : "W");
}
LogPrint(BCLog::SELECTCOINS, "ComputeNextStakeModifier: selection height [%d, %d] map %s\n", nHeightFirstCandidate, pindexPrev->nHeight, strSelectionMap.c_str());
}
if (gArgs.GetBoolArg("-printstakemodifier", false))
{
LogPrint(BCLog::SELECTCOINS, "ComputeNextStakeModifier: new modifier=0x%016x time=%s\n", nStakeModifierNew, DateTimeStrFormat("%Y-%m-%d %H:%M:%S", pindexPrev->GetBlockTime()).c_str());
}
nStakeModifier = nStakeModifierNew;
fGeneratedStakeModifier = true;
return true;
}
// Get stake modifier checksum
unsigned int GetStakeModifierChecksum(const CBlockIndex* pindex)
{
assert(pindex->pprev || pindex->GetBlockHash() == Params().GenesisBlock().GetHash());
// Hash previous checksum with flags, hashProofOfStake and nStakeModifier
CDataStream ss(SER_GETHASH, 0);
if (pindex->pprev)
ss << pindex->pprev->nStakeModifierChecksum;
ss << pindex->nFlags << pindex->hashProofOfStake << pindex->nStakeModifier;
arith_uint256 hashChecksum = UintToArith256(Hash(ss.begin(), ss.end()));
hashChecksum >>= (256 - 32);
if (gArgs.GetBoolArg("-printstakemodifier", false))
LogPrint(BCLog::SELECTCOINS, "stake checksum : 0x % 016x", ArithToUint256(hashChecksum).GetUint64(0));
return hashChecksum.GetLow64();
}
// The stake modifier used to hash for a stake kernel is chosen as the stake
// modifier about a selection interval later than the coin generating the kernel
static bool GetKernelStakeModifier(uint256 hashBlockFrom, uint64_t& nStakeModifier, int& nStakeModifierHeight, int64_t& nStakeModifierTime, bool fPrintProofOfStake)
{
nStakeModifier = 0;
if (!mapBlockIndex.count(hashBlockFrom))
return error("GetKernelStakeModifier() : block not indexed");
const CBlockIndex* pindexFrom = mapBlockIndex[hashBlockFrom];
nStakeModifierHeight = pindexFrom->nHeight;
nStakeModifierTime = pindexFrom->GetBlockTime();
int64_t nStakeModifierSelectionInterval = GetStakeModifierSelectionInterval();
const CBlockIndex* pindex = pindexFrom;
// loop to find the stake modifier later by a selection interval
while (nStakeModifierTime < pindexFrom->GetBlockTime() + nStakeModifierSelectionInterval)
{
if (!chainActive.Next(pindex))
{ // reached best block; may happen if node is behind on block chain
if (fPrintProofOfStake || (pindex->GetBlockTime() + Params().GetConsensus().nStakeMinAge - nStakeModifierSelectionInterval > GetAdjustedTime()))
return error("GetKernelStakeModifier() : reached best block %s at height %d from block %s",
pindex->GetBlockHash().ToString().c_str(), pindex->nHeight, hashBlockFrom.ToString().c_str());
else
{
LogPrint(BCLog::ALL, ">> nStakeModifierTime = %d, pindexFrom->GetBlockTime() = %d, nStakeModifierSelectionInterval = %d\n",
nStakeModifierTime, pindexFrom->GetBlockTime(), nStakeModifierSelectionInterval);
return false;
}
}
pindex = chainActive.Next(pindex);
if (pindex->GeneratedStakeModifier())
{
nStakeModifierHeight = pindex->nHeight;
nStakeModifierTime = pindex->GetBlockTime();
}
}
nStakeModifier = pindex->nStakeModifier;
return true;
}
// Check stake modifier hard checkpoints
bool CheckStakeModifierCheckpoints(int nHeight, unsigned int nStakeModifierChecksum)
{
if (Params().NetworkIDString() == "test") return true; // Testnet has no checkpoints
if (mapStakeModifierCheckpoints.count(nHeight))
{
return nStakeModifierChecksum == mapStakeModifierCheckpoints[nHeight];
}
return true;
}
// ppcoin kernel protocol
// coinstake must meet hash target according to the protocol:
// kernel (input 0) must meet the formula
// hash(nStakeModifier + txPrev.block.nTime + txPrev.offset + txPrev.nTime + txPrev.vout.n + nTime) < bnTarget * nCoinDayWeight
// this ensures that the chance of getting a coinstake is proportional to the
// amount of coin age one owns.
// The reason this hash is chosen is the following:
// nStakeModifier:
// (v0.3) scrambles computation to make it very difficult to precompute
// future proof-of-stake at the time of the coin's confirmation
// (v0.2) nBits (deprecated): encodes all past block timestamps
// txPrev.block.nTime: prevent nodes from guessing a good timestamp to
// generate transaction for future advantage
// txPrev.offset: offset of txPrev inside block, to reduce the chance of
// nodes generating coinstake at the same time
// txPrev.nTime: reduce the chance of nodes generating coinstake at the same
// time
// txPrev.vout.n: output number of txPrev, to reduce the chance of nodes
// generating coinstake at the same time
// block/tx hash should not be used here as they can be generated in vast
// quantities so as to generate blocks faster, degrading the system back into
// a proof-of-work situation.
//
bool CheckStakeKernelHash(unsigned int nBits, CBlockIndex* pindexPrev, unsigned int nTxPrevOffset, const CTransactionRef txPrev, const COutPoint& prevout, unsigned int nTimeTx, uint256& hashProofOfStake, bool fPrintProofOfStake)
{
if (nTimeTx < txPrev->nTime) // Transaction timestamp violation
return error("CheckStakeKernelHash() : nTime violation");
unsigned int nTimeBlockFrom = pindexPrev->GetBlockTime();
if (nTimeBlockFrom + Params().GetConsensus().nStakeMinAge > nTimeTx) // Min age requirement
return error("CheckStakeKernelHash() : min age violation");
arith_uint256 bnTargetPerCoinDay;
bnTargetPerCoinDay.SetCompact(nBits);
int64_t nValueIn = txPrev->vout[prevout.n].nValue;
// v0.3 protocol kernel hash weight starts from 0 at the min age
// this change increases active coins participating the hash and helps
// to secure the network when proof-of-stake difficulty is low
int64_t nTimeWeight = std::min((int64_t)nTimeTx - txPrev->nTime, (int64_t)Params().GetConsensus().nStakeMaxAge) - Params().GetConsensus().nStakeMinAge;
arith_uint512 bnCoinDayWeight = arith_uint512(nValueIn) * nTimeWeight / (COIN / 100) / (24 * 60 * 60);
// We need to convert to uint512 to prevent overflow when multiplying by 1st block coins
std::string bnTargetPerCoinDayHex = bnTargetPerCoinDay.GetHex();
arith_uint512 targetProofOfStake512(bnTargetPerCoinDayHex);
targetProofOfStake512 *= bnCoinDayWeight;
// Calculate hash
CDataStream ss(SER_GETHASH, 0);
uint64_t nStakeModifier = 0;
int nStakeModifierHeight = 0;
int64_t nStakeModifierTime = 0;
if (!GetKernelStakeModifier(pindexPrev->GetBlockHash(), nStakeModifier, nStakeModifierHeight, nStakeModifierTime, fPrintProofOfStake))
{
LogPrint(BCLog::ALL, ">>> CheckStakeKernelHash: GetKernelStakeModifier return false\n");
return false;
}
if (fPrintProofOfStake)
LogPrint(BCLog::ALL, ">>> CheckStakeKernelHash: passed GetKernelStakeModifier\n");
// create PoS hash
ss << nStakeModifier;
ss << nTimeBlockFrom << nTxPrevOffset << txPrev->nTime << prevout.n << nTimeTx;
hashProofOfStake = Hash(ss.begin(), ss.end());
if (fPrintProofOfStake)
{
LogPrint(BCLog::ALL, "CheckStakeKernelHash() : using modifier 0x%d at height=%d timestamp=%s for block from height=%d timestamp=%s\n",
nStakeModifier, nStakeModifierHeight,
DateTimeStrFormat("%Y-%m-%d %H:%M:%S", nStakeModifierTime).c_str(),
pindexPrev->nHeight,
DateTimeStrFormat("%Y-%m-%d %H:%M:%S", pindexPrev->GetBlockTime()).c_str());
LogPrint(BCLog::ALL, "CheckStakeKernelHash() : check protocol=%s modifier=0x%d nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashProof=%s\n",
"0.3",
nStakeModifier,
nTimeBlockFrom, nTxPrevOffset, txPrev->nTime, prevout.n, nTimeTx,
hashProofOfStake.ToString().c_str());
}
// We need to convert type so it can be compared to target
base_uint<512> hashProofOfStake512(hashProofOfStake.GetHex());
// Now check if proof-of-stake hash meets target protocol
if (hashProofOfStake512 > targetProofOfStake512)
{
LogPrint(BCLog::ALL, ">>> bnCoinDayWeight = %s, bnTargetPerCoinDay=%s\n", bnCoinDayWeight.ToString().c_str(), bnTargetPerCoinDay.ToString().c_str());
LogPrint(BCLog::ALL, ">>> CheckStakeKernelHash - hashProofOfStake too much\n");
return false;
}
if (fPrintProofOfStake)
{
LogPrint(BCLog::ALL, "CheckStakeKernelHash() : using modifier 0x%d at height=%d timestamp=%s for block from height=%d timestamp=%s\n",
nStakeModifier, nStakeModifierHeight,
DateTimeStrFormat("%Y-%m-%d %H:%M:%S", nStakeModifierTime).c_str(),
mapBlockIndex[pindexPrev->GetBlockHash()]->nHeight,
DateTimeStrFormat("%Y-%m-%d %H:%M:%S", pindexPrev->GetBlockTime()).c_str());
LogPrint(BCLog::ALL, "CheckStakeKernelHash() : pass protocol=%s modifier=0x%d nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashProof=%s\n",
"0.3",
nStakeModifier,
nTimeBlockFrom, nTxPrevOffset, txPrev->nTime, prevout.n, nTimeTx,
hashProofOfStake.ToString().c_str());
}
return true;
}
// ppcoin: total coin age spent in transaction, in the unit of coin-days.
// Only those coins meeting minimum age requirement counts. As those
// transactions not in main chain are not currently indexed so we
// might not find out about their coin age. Older transactions are
// guaranteed to be in main chain by sync-checkpoint. This rule is
// introduced to help nodes establish a consistent view of the coin
// age (trust score) of competing branches.
bool GetCoinAge(uint64_t& nCoinAge, CTransactionRef tx)
{
arith_uint512 bnCentSecond = 0; // coin age in the unit of cent-seconds
nCoinAge = 0;
if (tx->IsCoinBase())
return true;
//BOOST_FOREACH(const CTxIn& txin, vin)
for (const CTxIn& txin : tx->vin) {
// First try finding the previous transaction in database
CTransactionRef txPrev;
uint256 hashPrevBlock = uint256();
/*
if (!GetTransaction(txin.prevout.hash, txPrev, Params().GetConsensus(), hashPrevBlock, true))
return error("CheckProofOfStake() : INFO: read txPrev failed"); // previous transaction not in main chain, may occur during initial download
*/
// get input tx and block ref containing for block including input tx
if (!GetTransaction(txin.prevout.hash, txPrev, Params().GetConsensus(), hashPrevBlock, true))
continue; // previous transaction not in main chain
if (tx->nTime < txPrev->nTime)
return false; // Transaction timestamp violation
// Read block header
CBlockIndex* pblockindex = mapBlockIndex[hashPrevBlock];
CBlock blockPrev;
CDiskBlockPos blockPos = pblockindex->GetBlockPos();
if (!ReadBlockFromDisk(blockPrev, blockPos, Params().GetConsensus()))
return error("CheckProofOfStake() : read block failed");
if (blockPrev.GetBlockTime() + Params().GetConsensus().nStakeMinAge > tx->nTime)
continue; // only count coins meeting min age requirement
int64_t nValueIn = txPrev->vout[txin.prevout.n].nValue;
bnCentSecond += arith_uint512(nValueIn) * (tx->nTime - txPrev->nTime) / CENT;
//if (gArgs.GetArg("-printcoinage", false))
// printf("coin age nValueIn=%ld nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
}
arith_uint512 bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
if (gArgs.GetArg("-printcoinage", false))
printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
nCoinAge = bnCoinDay.GetLow64();
return true;
}
// ppcoin: total coin age spent in block, in the unit of coin-days.
bool GetCoinAgeBlock(const CBlock& block, uint64_t& nCoinAge)
{
nCoinAge = 0;
for (const CTransactionRef& tx : block.vtx) {
uint64_t nTxCoinAge;
if (::GetCoinAgeTX(tx, nTxCoinAge))
nCoinAge += nTxCoinAge;
else
return false;
}
if (nCoinAge == 0) // block coin age minimum 1 coin-day
nCoinAge = 1;
//if (fDebug && GetBoolArg("-printcoinage"))
// printf("block coin age total nCoinDays=%" PRI64d "\n", nCoinAge);
return true;
}
// ppcoin: total coin age spent in transaction, in the unit of coin-days.
// Only those coins meeting minimum age requirement counts. As those
// transactions not in main chain are not currently indexed so we
// might not find out about their coin age. Older transactions are
// guaranteed to be in main chain by sync-checkpoint. This rule is
// introduced to help nodes establish a consistent view of the coin
// age (trust score) of competing branches.
bool GetCoinAgeTX(const CTransactionRef& tx, uint64_t& nCoinAge)
{
arith_uint512 bnCentSecond = 0; // coin age in the unit of cent-seconds
nCoinAge = 0;
if (tx->IsCoinBase())
return true;
//BOOST_FOREACH(const CTxIn& txin, vin)
for (const CTxIn& txin : tx->vin) {
// First try finding the previous transaction in database
CTransactionRef txPrev;
uint256 hashPrevBlock = uint256();
// get input tx and block ref containing for block including input tx
if (!GetTransaction(txin.prevout.hash, txPrev, Params().GetConsensus(), hashPrevBlock, true))
continue; // previous transaction not in main chain
if (tx->nTime < txPrev->nTime)
return false; // Transaction timestamp violation
// Read block header
CBlockIndex* pblockindex = mapBlockIndex[hashPrevBlock];
CBlock blockPrev;
CDiskBlockPos blockPos = pblockindex->GetBlockPos();
if (!ReadBlockFromDisk(blockPrev, blockPos, Params().GetConsensus()))
return false; // unable to read block of previous transaction
if (blockPrev.GetBlockTime() + Params().GetConsensus().nStakeMinAge > tx->nTime)
continue; // only count coins meeting min age requirement
int64_t nValueIn = txPrev->vout[txin.prevout.n].nValue;
bnCentSecond += arith_uint512(nValueIn) * (tx->nTime - txPrev->nTime) / CENT;
//if (gArgs.GetArg("-printcoinage", false))
// printf("coin age nValueIn=%ld nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
}
arith_uint512 bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
if (gArgs.GetArg("-printcoinage", false))
printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
nCoinAge = bnCoinDay.GetLow64();
return true;
}
// Check kernel hash target and coinstake signature
bool CheckProofOfStake(const CTransactionRef tx, unsigned int nBits, uint256& hashProofOfStake, std::vector<CScriptCheck> *pvChecks, bool fCHeckSignature)
{
if (!tx->IsCoinStake())
return error("CheckProofOfStake() : called on non-coinstake %s", tx->GetHash().ToString().c_str());
// Kernel (input 0) must match the stake hash target per coin age (nBits)
const CTxIn& txin = tx->vin[0];
// First try finding the previous transaction in database
CTransactionRef txPrev;
uint256 hashPrevBlock = uint256();
// get input tx and block ref containing for block including input tx
if (!GetTransaction(txin.prevout.hash, txPrev, Params().GetConsensus(), hashPrevBlock, true))
return error("CheckProofOfStake() : INFO: read txPrev failed"); // previous transaction not in main chain, may occur during initial download
CCoinsViewCache inputs(pcoinsTip.get());
std::string hashBlockPrev = hashPrevBlock.GetHex();
std::string hashPrevTxIn = txin.prevout.hash.GetHex();
if (fCHeckSignature)
{
PrecomputedTransactionData txdata(*tx);
const COutPoint &prevout = tx->vin[0].prevout;
const CTxOut& coinsOutput = inputs.AccessCoin(prevout).out;
//assert(coins);
// Verify signature
CScriptCheck check(coinsOutput, *tx, 0, SCRIPT_VERIFY_NONE, false, &txdata);
if (pvChecks) {
pvChecks->push_back(CScriptCheck());
check.swap(pvChecks->back());
}
else if (!check())
return error("CheckProofOfStake() : script-verify-failed %s", ScriptErrorString(check.GetScriptError()));
}
CBlockIndex* pblockindex = mapBlockIndex[hashPrevBlock];
CBlock blockPrev;
CDiskBlockPos blockPos = pblockindex->GetBlockPos();
if (!ReadBlockFromDisk(blockPrev, blockPos, Params().GetConsensus()))
return error("CheckProofOfStake() : read block failed");
int prevTxOffsetInBlock = blockPos.nPos + GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(blockPrev.vtx.size());
for (auto& i : blockPrev.vtx) {
if (i->GetHash() == txPrev->GetHash())
break;
prevTxOffsetInBlock += GetSerializeSize(i, SER_DISK, CLIENT_VERSION);
}
if (!CheckStakeKernelHash(nBits, pblockindex, prevTxOffsetInBlock - blockPos.nPos, txPrev, txin.prevout, tx->nTime, hashProofOfStake))
return error("CheckProofOfStake() : INFO: check kernel failed on coinstake %s, hashProof=%s", tx->GetHash().ToString().c_str(), hashProofOfStake.ToString().c_str()); // may occur during initial download or if behind on block chain sync
return true;
}