1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
12 #include "checkqueue.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
40 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
42 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
44 unsigned int nStakeMinAge = 30 * nOneDay; // 30 days as zero time weight
45 unsigned int nStakeMaxAge = 90 * nOneDay; // 90 days as full weight
46 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
47 unsigned int nModifierInterval = 6 * nOneHour; // time to elapse before new modifier is computed
49 int nCoinbaseMaturity = 500;
51 CBlockIndex* pindexGenesisBlock = NULL;
54 uint256 nBestChainTrust = 0;
55 uint256 nBestInvalidTrust = 0;
57 uint256 hashBestChain = 0;
58 CBlockIndex* pindexBest = NULL;
59 int64_t nTimeBestReceived = 0;
60 int nScriptCheckThreads = 0;
62 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
64 map<uint256, CBlock*> mapOrphanBlocks;
65 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
66 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
67 map<uint256, uint256> mapProofOfStake;
69 map<uint256, CTransaction> mapOrphanTransactions;
70 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
72 // Constant stuff for coinbase transactions we create:
73 CScript COINBASE_FLAGS;
75 const string strMessageMagic = "NovaCoin Signed Message:\n";
78 int64_t nTransactionFee = MIN_TX_FEE;
79 int64_t nMinimumInputValue = MIN_TXOUT_AMOUNT;
81 // Ping and address broadcast intervals
82 int64_t nPingInterval = 30 * 60;
84 extern enum Checkpoints::CPMode CheckpointsMode;
86 //////////////////////////////////////////////////////////////////////////////
88 // dispatching functions
91 // These functions dispatch to one or all registered wallets
94 void RegisterWallet(CWallet* pwalletIn)
97 LOCK(cs_setpwalletRegistered);
98 setpwalletRegistered.insert(pwalletIn);
102 void UnregisterWallet(CWallet* pwalletIn)
105 LOCK(cs_setpwalletRegistered);
106 setpwalletRegistered.erase(pwalletIn);
110 // check whether the passed transaction is from us
111 bool static IsFromMe(CTransaction& tx)
113 for(CWallet* pwallet : setpwalletRegistered)
114 if (pwallet->IsFromMe(tx))
119 // make sure all wallets know about the given transaction, in the given block
120 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
124 // wallets need to refund inputs when disconnecting coinstake
125 if (tx.IsCoinStake())
127 for(CWallet* pwallet : setpwalletRegistered)
128 if (pwallet->IsFromMe(tx))
129 pwallet->DisableTransaction(tx);
134 for(CWallet* pwallet : setpwalletRegistered)
135 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
138 // notify wallets about a new best chain
139 void static SetBestChain(const CBlockLocator& loc)
141 for(CWallet* pwallet : setpwalletRegistered)
142 pwallet->SetBestChain(loc);
145 // notify wallets about an updated transaction
146 void static UpdatedTransaction(const uint256& hashTx)
148 for(CWallet* pwallet : setpwalletRegistered)
149 pwallet->UpdatedTransaction(hashTx);
153 void static PrintWallets(const CBlock& block)
155 for(CWallet* pwallet : setpwalletRegistered)
156 pwallet->PrintWallet(block);
159 // notify wallets about an incoming inventory (for request counts)
160 void static Inventory(const uint256& hash)
162 for(CWallet* pwallet : setpwalletRegistered)
163 pwallet->Inventory(hash);
166 // ask wallets to resend their transactions
167 void ResendWalletTransactions(bool fForceResend)
169 for(CWallet* pwallet : setpwalletRegistered)
170 pwallet->ResendWalletTransactions(fForceResend);
179 //////////////////////////////////////////////////////////////////////////////
181 // mapOrphanTransactions
184 bool AddOrphanTx(const CTransaction& tx)
186 auto hash = tx.GetHash();
187 if (mapOrphanTransactions.count(hash))
190 // Ignore big transactions, to avoid a
191 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
192 // large transaction with a missing parent then we assume
193 // it will rebroadcast it later, after the parent transaction(s)
194 // have been mined or received.
195 // 10,000 orphans, each of which is at most 5,000 bytes big is
196 // at most 500 megabytes of orphans:
198 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
202 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
206 mapOrphanTransactions[hash] = tx;
207 for(const CTxIn& txin : tx.vin)
208 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
210 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
211 mapOrphanTransactions.size());
215 void static EraseOrphanTx(uint256 hash)
217 if (!mapOrphanTransactions.count(hash))
219 const auto& tx = mapOrphanTransactions[hash];
220 for(const auto& txin : tx.vin)
222 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
223 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
224 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
226 mapOrphanTransactions.erase(hash);
229 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
231 unsigned int nEvicted = 0;
232 while (mapOrphanTransactions.size() > nMaxOrphans)
234 // Evict a random orphan:
235 auto randomhash = GetRandHash();
236 auto it = mapOrphanTransactions.lower_bound(randomhash);
237 if (it == mapOrphanTransactions.end())
238 it = mapOrphanTransactions.begin();
239 EraseOrphanTx(it->first);
251 //////////////////////////////////////////////////////////////////////////////
253 // CTransaction and CTxIndex
256 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
259 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
261 if (!ReadFromDisk(txindexRet.pos))
263 if (prevout.n >= vout.size())
271 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
274 return ReadFromDisk(txdb, prevout, txindex);
277 bool CTransaction::ReadFromDisk(COutPoint prevout)
281 return ReadFromDisk(txdb, prevout, txindex);
284 bool CTransaction::IsStandard(string& strReason) const
286 if (nVersion > CTransaction::CURRENT_VERSION)
288 strReason = "version";
292 unsigned int nDataOut = 0;
293 txnouttype whichType;
294 for(const CTxIn& txin : vin)
296 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
297 // keys. (remember the 520 byte limit on redeemScript size) That works
298 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
299 // bytes of scriptSig, which we round off to 1650 bytes for some minor
300 // future-proofing. That's also enough to spend a 20-of-20
301 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
302 // considered standard)
303 if (txin.scriptSig.size() > 1650)
305 strReason = "scriptsig-size";
308 if (!txin.scriptSig.IsPushOnly())
310 strReason = "scriptsig-not-pushonly";
313 if (!txin.scriptSig.HasCanonicalPushes()) {
314 strReason = "txin-scriptsig-not-canonicalpushes";
318 for(const CTxOut& txout : vout) {
319 if (!::IsStandard(txout.scriptPubKey, whichType)) {
320 strReason = "scriptpubkey";
323 if (whichType == TX_NULL_DATA)
326 if (txout.nValue == 0) {
327 strReason = "txout-value=0";
330 if (!txout.scriptPubKey.HasCanonicalPushes()) {
331 strReason = "txout-scriptsig-not-canonicalpushes";
337 // only one OP_RETURN txout is permitted
339 strReason = "multi-op-return";
347 // Check transaction inputs, and make sure any
348 // pay-to-script-hash transactions are evaluating IsStandard scripts
350 // Why bother? To avoid denial-of-service attacks; an attacker
351 // can submit a standard HASH... OP_EQUAL transaction,
352 // which will get accepted into blocks. The redemption
353 // script can be anything; an attacker could use a very
354 // expensive-to-check-upon-redemption script like:
355 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
357 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
360 return true; // Coinbases don't use vin normally
362 for (uint32_t i = 0; i < vin.size(); i++)
364 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
366 vector<vector<unsigned char> > vSolutions;
367 txnouttype whichType;
368 // get the scriptPubKey corresponding to this input:
369 const CScript& prevScript = prev.scriptPubKey;
370 if (!Solver(prevScript, whichType, vSolutions))
372 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
373 if (nArgsExpected < 0)
376 // Transactions with extra stuff in their scriptSigs are
377 // non-standard. Note that this EvalScript() call will
378 // be quick, because if there are any operations
379 // beside "push data" in the scriptSig the
380 // IsStandard() call returns false
381 vector<vector<unsigned char> > stack;
382 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
385 if (whichType == TX_SCRIPTHASH)
389 CScript subscript(stack.back().begin(), stack.back().end());
390 vector<vector<unsigned char> > vSolutions2;
391 txnouttype whichType2;
392 if (!Solver(subscript, whichType2, vSolutions2))
394 if (whichType2 == TX_SCRIPTHASH)
398 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
401 nArgsExpected += tmpExpected;
404 if (stack.size() != (unsigned int)nArgsExpected)
412 CTransaction::GetLegacySigOpCount() const
414 unsigned int nSigOps = 0;
417 // Coinbase scriptsigs are never executed, so there is
418 // no sense in calculation of sigops.
419 for(const CTxIn& txin : vin)
421 nSigOps += txin.scriptSig.GetSigOpCount(false);
424 for(const CTxOut& txout : vout)
426 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
431 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
444 // Load the block this tx is in
446 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
448 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
453 // Update the tx's hashBlock
454 hashBlock = pblock->GetHash();
456 // Locate the transaction
457 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
458 if (pblock->vtx[nIndex] == *(CTransaction*)this)
460 if (nIndex == (int)pblock->vtx.size())
462 vMerkleBranch.clear();
464 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
468 // Fill in merkle branch
469 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
472 // Is the tx in a block that's in the main chain
473 auto mi = mapBlockIndex.find(hashBlock);
474 if (mi == mapBlockIndex.end())
476 const CBlockIndex* pindex = (*mi).second;
477 if (!pindex || !pindex->IsInMainChain())
480 return pindexBest->nHeight - pindex->nHeight + 1;
483 bool CTransaction::CheckTransaction() const
485 // Basic checks that don't depend on any context
487 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
489 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
491 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
492 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
494 // Check for negative or overflow output values
495 CBigNum nValueOut = 0;
496 for (uint32_t i = 0; i < vout.size(); i++)
498 const auto& txout = vout[i];
499 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
500 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
501 if (!MoneyRange(txout.nValue))
502 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is out of range"));
503 nValueOut += txout.nValue;
504 if (!MoneyRange(nValueOut))
505 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
508 // Check for duplicate inputs
509 set<COutPoint> vInOutPoints;
510 for(const CTxIn& txin : vin)
512 if (vInOutPoints.count(txin.prevout))
514 vInOutPoints.insert(txin.prevout);
519 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
520 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
524 for(const CTxIn& txin : vin)
525 if (txin.prevout.IsNull())
526 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
532 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
534 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
538 // Enforce 0.01 as minimum fee for coinstake
540 nMinRelayTxFee = CENT;
543 // Base fee is either nMinTxFee or nMinRelayTxFee
544 auto nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
546 unsigned int nNewBlockSize = nBlockSize + nBytes;
547 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
553 // Transactions under 1K are free
559 // Free transaction area
560 if (nNewBlockSize < 27000)
565 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
566 // each non empty output which is less than 0.01
568 // It's safe to ignore empty outputs here, because these inputs are allowed
569 // only for coinbase and coinstake transactions.
570 for(const CTxOut& txout : vout)
571 if (txout.nValue < CENT && !txout.IsEmpty())
574 // Raise the price as the block approaches full
575 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
577 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
579 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
582 if (!MoneyRange(nMinFee))
589 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
590 bool* pfMissingInputs)
593 *pfMissingInputs = false;
595 // Time (prevent mempool memory exhaustion attack)
596 if (tx.nTime > FutureDrift(GetAdjustedTime()))
597 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
599 if (!tx.CheckTransaction())
600 return error("CTxMemPool::accept() : CheckTransaction failed");
602 // Coinbase is only valid in a block, not as a loose transaction
604 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
606 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
607 if (tx.IsCoinStake())
608 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
610 // To help v0.1.5 clients who would see it as a negative number
611 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
612 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
614 // Rather not work on nonstandard transactions (unless -testnet)
616 if (!fTestNet && !tx.IsStandard(strNonStd))
617 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
619 // Do we already have it?
620 auto hash = tx.GetHash();
623 if (mapTx.count(hash))
627 if (txdb.ContainsTx(hash))
630 // Check for conflicts with in-memory transactions
631 for (unsigned int i = 0; i < tx.vin.size(); i++)
633 auto outpoint = tx.vin[i].prevout;
634 if (mapNextTx.count(outpoint))
636 // Replacement feature isn't supported by Novacoin.
644 map<uint256, CTxIndex> mapUnused;
645 bool fInvalid = false;
646 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
649 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
651 *pfMissingInputs = true;
655 // Check for non-standard pay-to-script-hash in inputs
656 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
657 return error("CTxMemPool::accept() : nonstandard transaction input");
659 // Note: if you modify this code to accept non-standard transactions, then
660 // you should add code here to check that the transaction does a
661 // reasonable number of ECDSA signature verifications.
663 auto nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
664 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
666 // Don't accept it if it can't get into a block
667 auto txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
668 if (nFees < txMinFee)
669 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
670 hash.ToString().c_str(),
673 // Continuously rate-limit free transactions
674 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
675 // be annoying or make others' transactions take longer to confirm.
676 if (nFees < MIN_RELAY_TX_FEE)
678 static CCriticalSection cs;
679 static double dFreeCount;
680 static int64_t nLastTime;
681 auto nNow = GetTime();
685 // Use an exponentially decaying ~10-minute window:
686 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
688 // -limitfreerelay unit is thousand-bytes-per-minute
689 // At default rate it would take over a month to fill 1GB
690 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
691 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
693 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
698 // Check against previous transactions
699 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
700 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
702 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
706 // Store transaction in memory
709 addUnchecked(hash, tx);
712 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
713 hash.ToString().substr(0,10).c_str(),
718 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
720 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
723 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
725 // Add to memory pool without checking anything. Don't call this directly,
726 // call CTxMemPool::accept to properly check the transaction first.
729 for (unsigned int i = 0; i < tx.vin.size(); i++)
730 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
731 nTransactionsUpdated++;
737 bool CTxMemPool::remove(CTransaction &tx)
739 // Remove transaction from memory pool
742 auto hash = tx.GetHash();
743 if (mapTx.count(hash))
745 for(const CTxIn& txin : tx.vin)
746 mapNextTx.erase(txin.prevout);
748 nTransactionsUpdated++;
754 void CTxMemPool::clear()
759 ++nTransactionsUpdated;
762 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
767 vtxid.reserve(mapTx.size());
768 for (auto mi = mapTx.begin(); mi != mapTx.end(); ++mi)
769 vtxid.push_back((*mi).first);
775 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
777 if (hashBlock == 0 || nIndex == -1)
780 // Find the block it claims to be in
781 auto mi = mapBlockIndex.find(hashBlock);
782 if (mi == mapBlockIndex.end())
784 CBlockIndex* pindex = (*mi).second;
785 if (!pindex || !pindex->IsInMainChain())
788 // Make sure the merkle branch connects to this block
789 if (!fMerkleVerified)
791 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
793 fMerkleVerified = true;
797 return pindexBest->nHeight - pindex->nHeight + 1;
801 int CMerkleTx::GetBlocksToMaturity() const
803 if (!(IsCoinBase() || IsCoinStake()))
805 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
809 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
813 if (!IsInMainChain() && !ClientConnectInputs())
815 return CTransaction::AcceptToMemoryPool(txdb, false);
819 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
823 bool CMerkleTx::AcceptToMemoryPool()
826 return AcceptToMemoryPool(txdb);
831 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
836 // Add previous supporting transactions first
837 for(CMerkleTx& tx : vtxPrev)
839 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
841 auto hash = tx.GetHash();
842 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
843 tx.AcceptToMemoryPool(txdb, fCheckInputs);
846 return AcceptToMemoryPool(txdb, fCheckInputs);
851 bool CWalletTx::AcceptWalletTransaction()
854 return AcceptWalletTransaction(txdb);
857 int CTxIndex::GetDepthInMainChain() const
861 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
863 // Find the block in the index
864 auto mi = mapBlockIndex.find(block.GetHash());
865 if (mi == mapBlockIndex.end())
867 auto pindex = (*mi).second;
868 if (!pindex || !pindex->IsInMainChain())
870 return 1 + nBestHeight - pindex->nHeight;
873 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
874 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
880 if (mempool.exists(hash))
882 tx = mempool.lookup(hash);
888 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
891 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
892 hashBlock = block.GetHash();
906 //////////////////////////////////////////////////////////////////////////////
908 // CBlock and CBlockIndex
911 static CBlockIndex* pblockindexFBBHLast;
912 CBlockIndex* FindBlockByHeight(int nHeight)
914 CBlockIndex *pblockindex;
915 if (nHeight < nBestHeight / 2)
916 pblockindex = pindexGenesisBlock;
918 pblockindex = pindexBest;
919 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
920 pblockindex = pblockindexFBBHLast;
921 while (pblockindex->nHeight > nHeight)
922 pblockindex = pblockindex->pprev;
923 while (pblockindex->nHeight < nHeight)
924 pblockindex = pblockindex->pnext;
925 pblockindexFBBHLast = pblockindex;
929 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
931 if (!fReadTransactions)
933 *this = pindex->GetBlockHeader();
936 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
938 if (GetHash() != pindex->GetBlockHash())
939 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
943 uint256 static GetOrphanRoot(const CBlock* pblock)
945 // Work back to the first block in the orphan chain
946 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
947 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
948 return pblock->GetHash();
951 // ppcoin: find block wanted by given orphan block
952 uint256 WantedByOrphan(const CBlock* pblockOrphan)
954 // Work back to the first block in the orphan chain
955 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
956 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
957 return pblockOrphan->hashPrevBlock;
960 // select stake target limit according to hard-coded conditions
961 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
963 if(fTestNet) // separate proof of stake target limit for testnet
964 return bnProofOfStakeLimit;
965 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
966 return bnProofOfStakeLimit;
967 if(nHeight + 1 > 15000) // 24 bits since block 15000
968 return bnProofOfStakeLegacyLimit;
969 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
970 return bnProofOfStakeHardLimit;
972 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
975 // miner's coin base reward based on nBits
976 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
978 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
981 bnTarget.SetCompact(nBits);
982 CBigNum bnTargetLimit = bnProofOfWorkLimit;
983 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
985 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
986 // A reasonably continuous curve is used to avoid shock to market
987 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
989 // Human readable form:
991 // nSubsidy = 100 / (diff ^ 1/6)
993 // Please note that we're using bisection to find an approximate solutuion
994 CBigNum bnLowerBound = CENT;
995 CBigNum bnUpperBound = bnSubsidyLimit;
996 while (bnLowerBound + CENT <= bnUpperBound)
998 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
999 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1000 bnUpperBound = bnMidValue;
1002 bnLowerBound = bnMidValue;
1005 int64_t nSubsidy = bnUpperBound.getuint64();
1007 nSubsidy = (nSubsidy / CENT) * CENT;
1008 if (fDebug && GetBoolArg("-printcreation"))
1009 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1011 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1014 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1015 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1017 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1019 // Stage 2 of emission process is mostly PoS-based.
1021 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1023 bnTarget.SetCompact(nBits);
1024 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1025 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1027 // A reasonably continuous curve is used to avoid shock to market
1029 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1030 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1031 bnMidPart, bnRewardPart;
1033 while (bnLowerBound + CENT <= bnUpperBound)
1035 auto bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1038 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1040 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1042 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1045 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1046 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1048 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1049 bnUpperBound = bnMidValue;
1051 bnLowerBound = bnMidValue;
1054 nRewardCoinYear = bnUpperBound.getuint64();
1055 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1058 return nRewardCoinYear;
1060 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1062 // Set reasonable reward limit for large inputs
1064 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1066 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1067 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1069 nSubsidy = min(nSubsidy, nSubsidyLimit);
1071 if (fDebug && GetBoolArg("-printcreation"))
1072 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1077 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1079 // get proof of work blocks max spacing according to hard-coded conditions
1080 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1082 if(nTime > TARGETS_SWITCH_TIME)
1083 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1086 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1088 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1092 // maximum nBits value could possible be required nTime after
1094 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1097 bnResult.SetCompact(nBase);
1099 while (nTime > 0 && bnResult < bnTargetLimit)
1101 // Maximum 200% adjustment per day...
1105 if (bnResult > bnTargetLimit)
1106 bnResult = bnTargetLimit;
1107 return bnResult.GetCompact();
1111 // minimum amount of work that could possibly be required nTime after
1112 // minimum proof-of-work required was nBase
1114 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1116 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1120 // minimum amount of stake that could possibly be required nTime after
1121 // minimum proof-of-stake required was nBase
1123 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1125 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1129 // ppcoin: find last block index up to pindex
1130 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1132 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1133 pindex = pindex->pprev;
1137 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1139 if (pindexLast == NULL)
1140 return bnProofOfWorkLimit.GetCompact(); // genesis block
1142 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1144 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1145 if (pindexPrev->pprev == NULL)
1146 return bnTargetLimit.GetCompact(); // first block
1147 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1148 if (pindexPrevPrev->pprev == NULL)
1149 return bnTargetLimit.GetCompact(); // second block
1151 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1153 // ppcoin: target change every block
1154 // ppcoin: retarget with exponential moving toward target spacing
1156 bnNew.SetCompact(pindexPrev->nBits);
1157 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1158 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1159 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1160 bnNew /= ((nInterval + 1) * nTargetSpacing);
1162 if (bnNew > bnTargetLimit)
1163 bnNew = bnTargetLimit;
1165 return bnNew.GetCompact();
1168 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1171 bnTarget.SetCompact(nBits);
1174 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1175 return error("CheckProofOfWork() : nBits below minimum work");
1177 // Check proof of work matches claimed amount
1178 if (hash > bnTarget.getuint256())
1179 return error("CheckProofOfWork() : hash doesn't match nBits");
1184 // Return maximum amount of blocks that other nodes claim to have
1185 int GetNumBlocksOfPeers()
1187 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1190 bool IsInitialBlockDownload()
1192 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1194 static int64_t nLastUpdate;
1195 static CBlockIndex* pindexLastBest;
1196 auto nCurrentTime = GetTime();
1197 if (pindexBest != pindexLastBest)
1199 pindexLastBest = pindexBest;
1200 nLastUpdate = nCurrentTime;
1202 return (nCurrentTime - nLastUpdate < 10 &&
1203 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1206 void static InvalidChainFound(CBlockIndex* pindexNew)
1208 if (pindexNew->nChainTrust > nBestInvalidTrust)
1210 nBestInvalidTrust = pindexNew->nChainTrust;
1211 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1212 uiInterface.NotifyBlocksChanged();
1215 auto nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1216 auto nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1218 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1219 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1220 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1221 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1222 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1223 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1224 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1225 nBestBlockTrust.Get64(),
1226 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1230 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1232 nTime = max(GetBlockTime(), GetAdjustedTime());
1245 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1247 // Relinquish previous transactions' spent pointers
1250 for(const CTxIn& txin : vin)
1252 auto prevout = txin.prevout;
1254 // Get prev txindex from disk
1256 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1257 return error("DisconnectInputs() : ReadTxIndex failed");
1259 if (prevout.n >= txindex.vSpent.size())
1260 return error("DisconnectInputs() : prevout.n out of range");
1262 // Mark outpoint as not spent
1263 txindex.vSpent[prevout.n].SetNull();
1266 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1267 return error("DisconnectInputs() : UpdateTxIndex failed");
1271 // Remove transaction from index
1272 // This can fail if a duplicate of this transaction was in a chain that got
1273 // reorganized away. This is only possible if this transaction was completely
1274 // spent, so erasing it would be a no-op anyway.
1275 txdb.EraseTxIndex(*this);
1281 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1282 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1284 // FetchInputs can return false either because we just haven't seen some inputs
1285 // (in which case the transaction should be stored as an orphan)
1286 // or because the transaction is malformed (in which case the transaction should
1287 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1291 return true; // Coinbase transactions have no inputs to fetch.
1293 for (unsigned int i = 0; i < vin.size(); i++)
1295 auto prevout = vin[i].prevout;
1296 if (inputsRet.count(prevout.hash))
1297 continue; // Got it already
1300 CTxIndex& txindex = inputsRet[prevout.hash].first;
1302 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1304 // Get txindex from current proposed changes
1305 txindex = mapTestPool.find(prevout.hash)->second;
1309 // Read txindex from txdb
1310 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1312 if (!fFound && (fBlock || fMiner))
1313 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1316 CTransaction& txPrev = inputsRet[prevout.hash].second;
1317 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1319 // Get prev tx from single transactions in memory
1322 if (!mempool.exists(prevout.hash))
1323 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1324 txPrev = mempool.lookup(prevout.hash);
1327 txindex.vSpent.resize(txPrev.vout.size());
1331 // Get prev tx from disk
1332 if (!txPrev.ReadFromDisk(txindex.pos))
1333 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1337 // Make sure all prevout.n indexes are valid:
1338 for (unsigned int i = 0; i < vin.size(); i++)
1340 const COutPoint prevout = vin[i].prevout;
1341 assert(inputsRet.count(prevout.hash) != 0);
1342 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1343 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1344 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1346 // Revisit this if/when transaction replacement is implemented and allows
1349 return DoS(100, error("FetchInputs() : %s prevout.n out of range %d %" PRIszu " %" PRIszu " prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1356 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1358 auto mi = inputs.find(input.prevout.hash);
1359 if (mi == inputs.end())
1360 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1362 const auto& txPrev = (mi->second).second;
1363 if (input.prevout.n >= txPrev.vout.size())
1364 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1366 return txPrev.vout[input.prevout.n];
1369 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1374 CBigNum nResult = 0;
1375 for (uint32_t i = 0; i < vin.size(); i++)
1377 const auto& txOut = GetOutputFor(vin[i], inputs);
1378 nResult += txOut.nValue;
1379 if (!MoneyRange(txOut.nValue) || !MoneyRange(nResult))
1380 throw runtime_error("CTransaction::GetValueIn() : value out of range");
1382 return nResult.getint64();
1386 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1391 unsigned int nSigOps = 0;
1392 for (unsigned int i = 0; i < vin.size(); i++)
1394 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1395 if (prevout.scriptPubKey.IsPayToScriptHash())
1396 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1401 bool CScriptCheck::operator()() const {
1402 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1403 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1404 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1408 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1410 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1413 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1414 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1416 // Take over previous transactions' spent pointers
1417 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1418 // fMiner is true when called from the internal bitcoin miner
1419 // ... both are false when called from CTransaction::AcceptToMemoryPool
1423 int64_t nValueIn = 0;
1425 CBigNum bnValueIn = 0;
1426 for (uint32_t i = 0; i < vin.size(); i++)
1428 auto prevout = vin[i].prevout;
1429 assert(inputs.count(prevout.hash) > 0);
1430 CTxIndex& txindex = inputs[prevout.hash].first;
1431 CTransaction& txPrev = inputs[prevout.hash].second;
1433 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1434 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %" PRIszu " %" PRIszu " prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1436 // If prev is coinbase or coinstake, check that it's matured
1437 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1438 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1439 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1440 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1442 // ppcoin: check transaction timestamp
1443 if (txPrev.nTime > nTime)
1444 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1446 // Check for negative or overflow input values
1447 bnValueIn += txPrev.vout[prevout.n].nValue;
1448 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(bnValueIn))
1449 return DoS(100, error("ConnectInputs() : txin values out of range"));
1451 nValueIn = bnValueIn.getint64();
1455 pvChecks->reserve(vin.size());
1457 // The first loop above does all the inexpensive checks.
1458 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1459 // Helps prevent CPU exhaustion attacks.
1460 for (unsigned int i = 0; i < vin.size(); i++)
1462 auto prevout = vin[i].prevout;
1463 assert(inputs.count(prevout.hash) > 0);
1464 CTxIndex& txindex = inputs[prevout.hash].first;
1465 CTransaction& txPrev = inputs[prevout.hash].second;
1467 // Check for conflicts (double-spend)
1468 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1469 // for an attacker to attempt to split the network.
1470 if (!txindex.vSpent[prevout.n].IsNull())
1471 return fMiner ? false : error("ConnectInputs() : %s prev tx already used at %s", GetHash().ToString().substr(0,10).c_str(), txindex.vSpent[prevout.n].ToString().c_str());
1473 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1474 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1475 // still computed and checked, and any change will be caught at the next checkpoint.
1479 CScriptCheck check(txPrev, *this, i, flags, 0);
1482 pvChecks->push_back(CScriptCheck());
1483 check.swap(pvChecks->back());
1487 if (flags & STRICT_FLAGS)
1489 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1490 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1492 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1494 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1498 // Mark outpoints as spent
1499 txindex.vSpent[prevout.n] = posThisTx;
1502 if (fBlock || fMiner)
1504 mapTestPool[prevout.hash] = txindex;
1510 if (nTime > Checkpoints::GetLastCheckpointTime())
1512 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1514 // coin stake tx earns reward instead of paying fee
1516 if (!GetCoinAge(txdb, nCoinAge))
1517 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1519 auto nReward = GetValueOut() - nValueIn;
1520 auto nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1522 if (nReward > nCalculatedReward)
1523 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1528 if (nValueIn < GetValueOut())
1529 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1531 // Tally transaction fees
1532 auto nTxFee = nValueIn - GetValueOut();
1533 if (!MoneyRange(nTxFee))
1534 return DoS(100, error("ConnectInputs() : nFees out of range"));
1542 bool CTransaction::ClientConnectInputs()
1547 // Take over previous transactions' spent pointers
1550 CBigNum bnValueIn = 0;
1551 for (uint32_t i = 0; i < vin.size(); i++)
1553 // Get prev tx from single transactions in memory
1554 auto prevout = vin[i].prevout;
1555 if (!mempool.exists(prevout.hash))
1557 CTransaction& txPrev = mempool.lookup(prevout.hash);
1559 if (prevout.n >= txPrev.vout.size())
1563 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1564 return error("ClientConnectInputs() : VerifySignature failed");
1566 ///// this is redundant with the mempool.mapNextTx stuff,
1567 ///// not sure which I want to get rid of
1568 ///// this has to go away now that posNext is gone
1569 // // Check for conflicts
1570 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1571 // return error("ConnectInputs() : prev tx already used");
1573 // // Flag outpoints as used
1574 // txPrev.vout[prevout.n].posNext = posThisTx;
1576 bnValueIn += txPrev.vout[prevout.n].nValue;
1578 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(bnValueIn))
1579 return error("ClientConnectInputs() : txin values out of range");
1581 if (GetValueOut() > bnValueIn.getint64())
1591 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1593 // Disconnect in reverse order
1594 for (int i = vtx.size()-1; i >= 0; i--)
1595 if (!vtx[i].DisconnectInputs(txdb))
1598 // Update block index on disk without changing it in memory.
1599 // The memory index structure will be changed after the db commits.
1602 CDiskBlockIndex blockindexPrev(pindex->pprev);
1603 blockindexPrev.hashNext = 0;
1604 if (!txdb.WriteBlockIndex(blockindexPrev))
1605 return error("DisconnectBlock() : WriteBlockIndex failed");
1608 // ppcoin: clean up wallet after disconnecting coinstake
1609 for(CTransaction& tx : vtx)
1610 SyncWithWallets(tx, this, false, false);
1615 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1617 void ThreadScriptCheck(void*) {
1618 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1619 RenameThread("novacoin-scriptch");
1620 scriptcheckqueue.Thread();
1621 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1624 void ThreadScriptCheckQuit() {
1625 scriptcheckqueue.Quit();
1628 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1630 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1631 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1634 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1635 // unless those are already completely spent.
1636 // If such overwrites are allowed, coinbases and transactions depending upon those
1637 // can be duplicated to remove the ability to spend the first instance -- even after
1638 // being sent to another address.
1639 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1640 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1641 // already refuses previously-known transaction ids entirely.
1642 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1643 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1644 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1645 // initial block download.
1646 bool fEnforceBIP30 = true; // Always active in NovaCoin
1647 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1649 //// issue here: it doesn't know the version
1650 unsigned int nTxPos;
1652 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1653 // Since we're just checking the block and not actually connecting it, it might not (and probably shouldn't) be on the disk to get the transaction from
1656 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1658 map<uint256, CTxIndex> mapQueuedChanges;
1659 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1662 int64_t nValueIn = 0;
1663 int64_t nValueOut = 0;
1664 unsigned int nSigOps = 0;
1667 auto hashTx = tx.GetHash();
1669 if (fEnforceBIP30) {
1670 CTxIndex txindexOld;
1671 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1672 for(CDiskTxPos &pos : txindexOld.vSpent)
1678 nSigOps += tx.GetLegacySigOpCount();
1679 if (nSigOps > MAX_BLOCK_SIGOPS)
1680 return DoS(100, error("ConnectBlock() : too many sigops"));
1682 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1684 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1686 MapPrevTx mapInputs;
1687 if (tx.IsCoinBase())
1688 nValueOut += tx.GetValueOut();
1692 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1695 // Add in sigops done by pay-to-script-hash inputs;
1696 // this is to prevent a "rogue miner" from creating
1697 // an incredibly-expensive-to-validate block.
1698 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1699 if (nSigOps > MAX_BLOCK_SIGOPS)
1700 return DoS(100, error("ConnectBlock() : too many sigops"));
1702 auto nTxValueIn = tx.GetValueIn(mapInputs);
1703 auto nTxValueOut = tx.GetValueOut();
1704 nValueIn += nTxValueIn;
1705 nValueOut += nTxValueOut;
1706 if (!tx.IsCoinStake())
1707 nFees += nTxValueIn - nTxValueOut;
1709 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1711 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1712 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1713 // OP_CHECKSEQUENCEVERIFY is senseless without BIP68, so we're going disable it for now.
1714 // nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
1717 std::vector<CScriptCheck> vChecks;
1718 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
1720 control.Add(vChecks);
1723 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1726 if (!control.Wait())
1727 return DoS(100, false);
1729 if (IsProofOfWork())
1731 auto nBlockReward = GetProofOfWorkReward(nBits, nFees);
1733 // Check coinbase reward
1734 if (vtx[0].GetValueOut() > nBlockReward)
1735 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1736 vtx[0].GetValueOut(),
1740 // track money supply and mint amount info
1741 pindex->nMint = nValueOut - nValueIn + nFees;
1742 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1743 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1744 return error("Connect() : WriteBlockIndex for pindex failed");
1746 // fees are not collected by proof-of-stake miners
1747 // fees are destroyed to compensate the entire network
1748 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1749 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1754 // Write queued txindex changes
1755 for (auto mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1757 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1758 return error("ConnectBlock() : UpdateTxIndex failed");
1761 // Update block index on disk without changing it in memory.
1762 // The memory index structure will be changed after the db commits.
1765 CDiskBlockIndex blockindexPrev(pindex->pprev);
1766 blockindexPrev.hashNext = pindex->GetBlockHash();
1767 if (!txdb.WriteBlockIndex(blockindexPrev))
1768 return error("ConnectBlock() : WriteBlockIndex failed");
1771 // Watch for transactions paying to me
1772 for(CTransaction& tx : vtx)
1773 SyncWithWallets(tx, this, true);
1779 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1781 printf("REORGANIZE\n");
1784 CBlockIndex* pfork = pindexBest;
1785 CBlockIndex* plonger = pindexNew;
1786 while (pfork != plonger)
1788 while (plonger->nHeight > pfork->nHeight)
1789 if ((plonger = plonger->pprev) == NULL)
1790 return error("Reorganize() : plonger->pprev is null");
1791 if (pfork == plonger)
1793 if ((pfork = pfork->pprev) == NULL)
1794 return error("Reorganize() : pfork->pprev is null");
1797 // List of what to disconnect
1798 vector<CBlockIndex*> vDisconnect;
1799 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1800 vDisconnect.push_back(pindex);
1802 // List of what to connect
1803 vector<CBlockIndex*> vConnect;
1804 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1805 vConnect.push_back(pindex);
1806 reverse(vConnect.begin(), vConnect.end());
1808 printf("REORGANIZE: Disconnect %" PRIszu " blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1809 printf("REORGANIZE: Connect %" PRIszu " blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1811 // Disconnect shorter branch
1812 vector<CTransaction> vResurrect;
1813 for(CBlockIndex* pindex : vDisconnect)
1816 if (!block.ReadFromDisk(pindex))
1817 return error("Reorganize() : ReadFromDisk for disconnect failed");
1818 if (!block.DisconnectBlock(txdb, pindex))
1819 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1821 // Queue memory transactions to resurrect
1822 for(const CTransaction& tx : block.vtx)
1823 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1824 vResurrect.push_back(tx);
1827 // Connect longer branch
1828 vector<CTransaction> vDelete;
1829 for (unsigned int i = 0; i < vConnect.size(); i++)
1831 CBlockIndex* pindex = vConnect[i];
1833 if (!block.ReadFromDisk(pindex))
1834 return error("Reorganize() : ReadFromDisk for connect failed");
1835 if (!block.ConnectBlock(txdb, pindex))
1838 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1841 // Queue memory transactions to delete
1842 for(const CTransaction& tx : block.vtx)
1843 vDelete.push_back(tx);
1845 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1846 return error("Reorganize() : WriteHashBestChain failed");
1848 // Make sure it's successfully written to disk before changing memory structure
1849 if (!txdb.TxnCommit())
1850 return error("Reorganize() : TxnCommit failed");
1852 // Disconnect shorter branch
1853 for(CBlockIndex* pindex : vDisconnect)
1855 pindex->pprev->pnext = NULL;
1857 // Connect longer branch
1858 for(CBlockIndex* pindex : vConnect)
1860 pindex->pprev->pnext = pindex;
1862 // Resurrect memory transactions that were in the disconnected branch
1863 for(CTransaction& tx : vResurrect)
1864 tx.AcceptToMemoryPool(txdb, false);
1866 // Delete redundant memory transactions that are in the connected branch
1867 for(CTransaction& tx : vDelete)
1870 printf("REORGANIZE: done\n");
1876 // Called from inside SetBestChain: attaches a block to the new best chain being built
1877 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1879 auto hash = GetHash();
1881 // Adding to current best branch
1882 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1885 InvalidChainFound(pindexNew);
1888 if (!txdb.TxnCommit())
1889 return error("SetBestChain() : TxnCommit failed");
1891 // Add to current best branch
1892 pindexNew->pprev->pnext = pindexNew;
1894 // Delete redundant memory transactions
1895 for(CTransaction& tx : vtx)
1901 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1903 auto hash = GetHash();
1905 if (!txdb.TxnBegin())
1906 return error("SetBestChain() : TxnBegin failed");
1908 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1910 txdb.WriteHashBestChain(hash);
1911 if (!txdb.TxnCommit())
1912 return error("SetBestChain() : TxnCommit failed");
1913 pindexGenesisBlock = pindexNew;
1915 else if (hashPrevBlock == hashBestChain)
1917 if (!SetBestChainInner(txdb, pindexNew))
1918 return error("SetBestChain() : SetBestChainInner failed");
1922 // the first block in the new chain that will cause it to become the new best chain
1923 CBlockIndex *pindexIntermediate = pindexNew;
1925 // list of blocks that need to be connected afterwards
1926 std::vector<CBlockIndex*> vpindexSecondary;
1928 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1929 // Try to limit how much needs to be done inside
1930 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1932 vpindexSecondary.push_back(pindexIntermediate);
1933 pindexIntermediate = pindexIntermediate->pprev;
1936 if (!vpindexSecondary.empty())
1937 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
1939 // Switch to new best branch
1940 if (!Reorganize(txdb, pindexIntermediate))
1943 InvalidChainFound(pindexNew);
1944 return error("SetBestChain() : Reorganize failed");
1947 // Connect further blocks
1948 for (std::vector<CBlockIndex*>::reverse_iterator rit = vpindexSecondary.rbegin(); rit != vpindexSecondary.rend(); ++rit)
1951 if (!block.ReadFromDisk(*rit))
1953 printf("SetBestChain() : ReadFromDisk failed\n");
1956 if (!txdb.TxnBegin()) {
1957 printf("SetBestChain() : TxnBegin 2 failed\n");
1960 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1961 if (!block.SetBestChainInner(txdb, *rit))
1966 // Update best block in wallet (so we can detect restored wallets)
1967 bool fIsInitialDownload = IsInitialBlockDownload();
1968 if (!fIsInitialDownload)
1970 const CBlockLocator locator(pindexNew);
1971 ::SetBestChain(locator);
1975 hashBestChain = hash;
1976 pindexBest = pindexNew;
1977 pblockindexFBBHLast = NULL;
1978 nBestHeight = pindexBest->nHeight;
1979 nBestChainTrust = pindexNew->nChainTrust;
1980 nTimeBestReceived = GetTime();
1981 nTransactionsUpdated++;
1983 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1985 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1986 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1987 CBigNum(nBestChainTrust).ToString().c_str(),
1988 nBestBlockTrust.Get64(),
1989 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1991 // Check the version of the last 100 blocks to see if we need to upgrade:
1992 if (!fIsInitialDownload)
1995 const CBlockIndex* pindex = pindexBest;
1996 for (int i = 0; i < 100 && pindex != NULL; i++)
1998 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2000 pindex = pindex->pprev;
2003 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2004 if (nUpgraded > 100/2)
2005 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2006 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2009 auto strCmd = GetArg("-blocknotify", "");
2011 if (!fIsInitialDownload && !strCmd.empty())
2013 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2014 boost::thread t(runCommand, strCmd); // thread runs free
2020 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2021 // Only those coins meeting minimum age requirement counts. As those
2022 // transactions not in main chain are not currently indexed so we
2023 // might not find out about their coin age. Older transactions are
2024 // guaranteed to be in main chain by sync-checkpoint. This rule is
2025 // introduced to help nodes establish a consistent view of the coin
2026 // age (trust score) of competing branches.
2027 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2029 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2035 for(const CTxIn& txin : vin)
2037 // First try finding the previous transaction in database
2038 CTransaction txPrev;
2040 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2041 continue; // previous transaction not in main chain
2042 if (nTime < txPrev.nTime)
2043 return false; // Transaction timestamp violation
2045 // Read block header
2047 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2048 return false; // unable to read block of previous transaction
2049 if (block.GetBlockTime() + nStakeMinAge > nTime)
2050 continue; // only count coins meeting min age requirement
2052 auto nValueIn = txPrev.vout[txin.prevout.n].nValue;
2053 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2055 if (fDebug && GetBoolArg("-printcoinage"))
2056 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2059 auto bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2060 if (fDebug && GetBoolArg("-printcoinage"))
2061 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2062 nCoinAge = bnCoinDay.getuint64();
2066 // ppcoin: total coin age spent in block, in the unit of coin-days.
2067 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2072 for(const CTransaction& tx : vtx)
2074 uint64_t nTxCoinAge;
2075 if (tx.GetCoinAge(txdb, nTxCoinAge))
2076 nCoinAge += nTxCoinAge;
2081 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2083 if (fDebug && GetBoolArg("-printcoinage"))
2084 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2088 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2090 // Check for duplicate
2091 auto hash = GetHash();
2092 if (mapBlockIndex.count(hash))
2093 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2095 // Construct new block index object
2096 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2098 return error("AddToBlockIndex() : new CBlockIndex failed");
2099 pindexNew->phashBlock = &hash;
2100 auto miPrev = mapBlockIndex.find(hashPrevBlock);
2101 if (miPrev != mapBlockIndex.end())
2103 pindexNew->pprev = (*miPrev).second;
2104 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2107 // ppcoin: compute chain trust score
2108 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2110 // ppcoin: compute stake entropy bit for stake modifier
2111 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2112 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2114 // ppcoin: record proof-of-stake hash value
2115 if (pindexNew->IsProofOfStake())
2117 if (!mapProofOfStake.count(hash))
2118 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2119 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2122 // ppcoin: compute stake modifier
2123 uint64_t nStakeModifier = 0;
2124 bool fGeneratedStakeModifier = false;
2125 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2126 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2127 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2128 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2129 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2130 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2132 // Add to mapBlockIndex
2133 auto mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2134 if (pindexNew->IsProofOfStake())
2135 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2136 pindexNew->phashBlock = &((*mi).first);
2138 // Write to disk block index
2140 if (!txdb.TxnBegin())
2142 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2143 if (!txdb.TxnCommit())
2147 if (pindexNew->nChainTrust > nBestChainTrust)
2148 if (!SetBestChain(txdb, pindexNew))
2151 if (pindexNew == pindexBest)
2153 // Notify UI to display prev block's coinbase if it was ours
2154 static uint256 hashPrevBestCoinBase;
2155 UpdatedTransaction(hashPrevBestCoinBase);
2156 hashPrevBestCoinBase = vtx[0].GetHash();
2159 static int8_t counter = 0;
2160 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2161 uiInterface.NotifyBlocksChanged();
2168 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2170 // These are checks that are independent of context
2171 // that can be verified before saving an orphan block.
2173 set<uint256> uniqueTx; // tx hashes
2174 unsigned int nSigOps = 0; // total sigops
2177 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2178 return DoS(100, error("CheckBlock() : size limits failed"));
2180 bool fProofOfStake = IsProofOfStake();
2182 // First transaction must be coinbase, the rest must not be
2183 if (!vtx[0].IsCoinBase())
2184 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2186 if (!vtx[0].CheckTransaction())
2187 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2189 uniqueTx.insert(vtx[0].GetHash());
2190 nSigOps += vtx[0].GetLegacySigOpCount();
2194 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2195 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2197 // nNonce must be zero for proof-of-stake blocks
2199 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2201 // Coinbase output should be empty if proof-of-stake block
2202 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2203 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2205 // Check coinstake timestamp
2206 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2207 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2209 // NovaCoin: check proof-of-stake block signature
2210 if (fCheckSig && !CheckBlockSignature())
2211 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2213 if (!vtx[1].CheckTransaction())
2214 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2216 uniqueTx.insert(vtx[1].GetHash());
2217 nSigOps += vtx[1].GetLegacySigOpCount();
2221 // Check proof of work matches claimed amount
2222 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2223 return DoS(50, error("CheckBlock() : proof of work failed"));
2226 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2227 return error("CheckBlock() : block timestamp too far in the future");
2229 // Check coinbase timestamp
2230 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2231 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2234 // Iterate all transactions starting from second for proof-of-stake block
2235 // or first for proof-of-work block
2236 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2238 const CTransaction& tx = vtx[i];
2240 // Reject coinbase transactions at non-zero index
2241 if (tx.IsCoinBase())
2242 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2244 // Reject coinstake transactions at index != 1
2245 if (tx.IsCoinStake())
2246 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2248 // Check transaction timestamp
2249 if (GetBlockTime() < (int64_t)tx.nTime)
2250 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2252 // Check transaction consistency
2253 if (!tx.CheckTransaction())
2254 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2256 // Add transaction hash into list of unique transaction IDs
2257 uniqueTx.insert(tx.GetHash());
2259 // Calculate sigops count
2260 nSigOps += tx.GetLegacySigOpCount();
2263 // Check for duplicate txids. This is caught by ConnectInputs(),
2264 // but catching it earlier avoids a potential DoS attack:
2265 if (uniqueTx.size() != vtx.size())
2266 return DoS(100, error("CheckBlock() : duplicate transaction"));
2268 // Reject block if validation would consume too much resources.
2269 if (nSigOps > MAX_BLOCK_SIGOPS)
2270 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2272 // Check merkle root
2273 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2274 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2279 bool CBlock::AcceptBlock()
2281 // Check for duplicate
2282 auto hash = GetHash();
2283 if (mapBlockIndex.count(hash))
2284 return error("AcceptBlock() : block already in mapBlockIndex");
2286 // Get prev block index
2287 auto mi = mapBlockIndex.find(hashPrevBlock);
2288 if (mi == mapBlockIndex.end())
2289 return DoS(10, error("AcceptBlock() : prev block not found"));
2290 CBlockIndex* pindexPrev = (*mi).second;
2291 int nHeight = pindexPrev->nHeight+1;
2293 // Check proof-of-work or proof-of-stake
2294 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2295 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2297 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2298 int nMaxOffset = 12 * nOneHour; // 12 hours
2299 if (fTestNet || pindexPrev->nTime < 1450569600)
2300 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2302 // Check timestamp against prev
2303 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2304 return error("AcceptBlock() : block's timestamp is too early");
2306 // Don't accept blocks with future timestamps
2307 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2308 return error("AcceptBlock() : block's timestamp is too far in the future");
2310 // Check that all transactions are finalized
2311 for(const CTransaction& tx : vtx)
2312 if (!tx.IsFinal(nHeight, GetBlockTime()))
2313 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2315 // Check that the block chain matches the known block chain up to a checkpoint
2316 if (!Checkpoints::CheckHardened(nHeight, hash))
2317 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2319 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2321 // Check that the block satisfies synchronized checkpoint
2322 if (CheckpointsMode == Checkpoints::CP_STRICT && !cpSatisfies)
2323 return error("AcceptBlock() : rejected by synchronized checkpoint");
2325 if (CheckpointsMode == Checkpoints::CP_ADVISORY && !cpSatisfies)
2326 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2328 // Enforce rule that the coinbase starts with serialized block height
2329 auto expect = CScript() << nHeight;
2330 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2331 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2332 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2334 // Write block to history file
2335 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2336 return error("AcceptBlock() : out of disk space");
2337 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2338 unsigned int nBlockPos = 0;
2339 if (!WriteToDisk(nFile, nBlockPos))
2340 return error("AcceptBlock() : WriteToDisk failed");
2341 if (!AddToBlockIndex(nFile, nBlockPos))
2342 return error("AcceptBlock() : AddToBlockIndex failed");
2344 // Relay inventory, but don't relay old inventory during initial block download
2345 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2346 if (hashBestChain == hash)
2349 for(CNode* pnode : vNodes)
2350 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2351 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2354 // ppcoin: check pending sync-checkpoint
2355 Checkpoints::AcceptPendingSyncCheckpoint();
2360 uint256 CBlockIndex::GetBlockTrust() const
2363 bnTarget.SetCompact(nBits);
2368 // Return 1 for the first 12 blocks
2369 if (pprev == NULL || pprev->nHeight < 12)
2372 const CBlockIndex* currentIndex = pprev;
2374 if(IsProofOfStake())
2376 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2378 // Return 1/3 of score if parent block is not the PoW block
2379 if (!pprev->IsProofOfWork())
2380 return (bnNewTrust / 3).getuint256();
2384 // Check last 12 blocks type
2385 while (pprev->nHeight - currentIndex->nHeight < 12)
2387 if (currentIndex->IsProofOfWork())
2389 currentIndex = currentIndex->pprev;
2392 // Return 1/3 of score if less than 3 PoW blocks found
2394 return (bnNewTrust / 3).getuint256();
2396 return bnNewTrust.getuint256();
2400 // Calculate work amount for block
2401 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2403 // Set nPowTrust to 1 if PoW difficulty is too low
2407 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2409 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2410 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2411 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2415 // Check last 12 blocks type
2416 while (pprev->nHeight - currentIndex->nHeight < 12)
2418 if (currentIndex->IsProofOfStake())
2420 currentIndex = currentIndex->pprev;
2423 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2425 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2427 bnTarget.SetCompact(pprev->nBits);
2432 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2434 // Return nPoWTrust + full trust score for previous block nBits
2435 return (bnPoWTrust + bnNewTrust).getuint256();
2439 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2441 unsigned int nFound = 0;
2442 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2444 if (pstart->nVersion >= minVersion)
2446 pstart = pstart->pprev;
2448 return (nFound >= nRequired);
2451 bool static ReserealizeBlockSignature(CBlock* pblock)
2453 if (pblock->IsProofOfWork())
2455 pblock->vchBlockSig.clear();
2459 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2462 bool static IsCanonicalBlockSignature(CBlock* pblock)
2464 if (pblock->IsProofOfWork())
2465 return pblock->vchBlockSig.empty();
2467 return IsDERSignature(pblock->vchBlockSig);
2470 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2472 // Check for duplicate
2473 auto hash = pblock->GetHash();
2474 if (mapBlockIndex.count(hash))
2475 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2476 if (mapOrphanBlocks.count(hash))
2477 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2479 // Check that block isn't listed as unconditionally banned.
2480 if (!Checkpoints::CheckBanned(hash)) {
2482 pfrom->Misbehaving(100);
2483 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2486 // Check proof-of-stake
2487 // Limited duplicity on stake: prevents block flood attack
2488 // Duplicate stake allowed only when there is orphan child block
2489 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2490 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2492 // Strip the garbage from newly received blocks, if we found some
2493 if (!IsCanonicalBlockSignature(pblock)) {
2494 if (!ReserealizeBlockSignature(pblock))
2495 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2498 // Preliminary checks
2499 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2500 return error("ProcessBlock() : CheckBlock FAILED");
2502 // ppcoin: verify hash target and signature of coinstake tx
2503 if (pblock->IsProofOfStake())
2505 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2506 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2508 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2509 return false; // do not error here as we expect this during initial block download
2511 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2512 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2515 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2516 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2518 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2519 auto deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2521 bnNewBlock.SetCompact(pblock->nBits);
2524 if (pblock->IsProofOfStake())
2525 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2527 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2529 if (bnNewBlock > bnRequired)
2532 pfrom->Misbehaving(100);
2533 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2537 // ppcoin: ask for pending sync-checkpoint if any
2538 if (!IsInitialBlockDownload())
2539 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2541 // If don't already have its previous block, shunt it off to holding area until we get it
2542 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2544 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2545 // ppcoin: check proof-of-stake
2546 if (pblock->IsProofOfStake())
2548 // Limited duplicity on stake: prevents block flood attack
2549 // Duplicate stake allowed only when there is orphan child block
2550 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2551 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2553 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2555 CBlock* pblock2 = new CBlock(*pblock);
2556 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2557 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2559 // Ask this guy to fill in what we're missing
2562 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2563 // ppcoin: getblocks may not obtain the ancestor block rejected
2564 // earlier by duplicate-stake check so we ask for it again directly
2565 if (!IsInitialBlockDownload())
2566 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2572 if (!pblock->AcceptBlock())
2573 return error("ProcessBlock() : AcceptBlock FAILED");
2575 // Recursively process any orphan blocks that depended on this one
2576 vector<uint256> vWorkQueue;
2577 vWorkQueue.push_back(hash);
2578 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2580 auto hashPrev = vWorkQueue[i];
2581 for (auto mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2582 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2585 CBlock* pblockOrphan = (*mi).second;
2586 if (pblockOrphan->AcceptBlock())
2587 vWorkQueue.push_back(pblockOrphan->GetHash());
2588 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2589 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2590 delete pblockOrphan;
2592 mapOrphanBlocksByPrev.erase(hashPrev);
2595 printf("ProcessBlock: ACCEPTED\n");
2597 // ppcoin: if responsible for sync-checkpoint send it
2598 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2599 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2604 // ppcoin: check block signature
2605 bool CBlock::CheckBlockSignature() const
2607 if (vchBlockSig.empty())
2610 txnouttype whichType;
2611 vector<valtype> vSolutions;
2612 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2615 if (whichType == TX_PUBKEY)
2617 auto& vchPubKey = vSolutions[0];
2618 CPubKey key(vchPubKey);
2621 return key.Verify(GetHash(), vchBlockSig);
2627 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2629 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2631 // Check for nMinDiskSpace bytes (currently 50MB)
2632 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2635 string strMessage = _("Warning: Disk space is low!");
2636 strMiscWarning = strMessage;
2637 printf("*** %s\n", strMessage.c_str());
2638 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2645 static filesystem::path BlockFilePath(unsigned int nFile)
2647 string strBlockFn = strprintf("blk%04u.dat", nFile);
2648 return GetDataDir() / strBlockFn;
2651 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2653 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
2655 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2658 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2660 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2669 static unsigned int nCurrentBlockFile = 1;
2671 FILE* AppendBlockFile(unsigned int& nFileRet)
2676 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2679 if (fseek(file, 0, SEEK_END) != 0)
2684 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2685 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2687 nFileRet = nCurrentBlockFile;
2691 nCurrentBlockFile++;
2695 void UnloadBlockIndex()
2697 mapBlockIndex.clear();
2698 setStakeSeen.clear();
2699 pindexGenesisBlock = NULL;
2701 nBestChainTrust = 0;
2702 nBestInvalidTrust = 0;
2707 bool LoadBlockIndex(bool fAllowNew)
2711 nNetworkID = 0xefc0f2cd;
2713 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2714 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
2715 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2716 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2717 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2724 if (!txdb.LoadBlockIndex())
2728 // Init with genesis block
2730 if (mapBlockIndex.empty())
2739 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2740 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2741 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2743 // vMerkleTree: 4cb33b3b6a
2747 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2748 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2749 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2751 // vMerkleTree: 4cb33b3b6a
2753 const string strTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2755 txNew.nTime = 1360105017;
2756 txNew.vin.resize(1);
2757 txNew.vout.resize(1);
2758 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>(strTimestamp.begin(), strTimestamp.end());
2759 txNew.vout[0].SetEmpty();
2761 block.vtx.push_back(txNew);
2762 block.hashPrevBlock = 0;
2763 block.hashMerkleRoot = block.BuildMerkleTree();
2765 block.nTime = 1360105017;
2766 block.nBits = bnProofOfWorkLimit.GetCompact();
2767 block.nNonce = !fTestNet ? 1575379 : 46534;
2770 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2772 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2773 assert(block.CheckBlock());
2775 // Start new block file
2777 unsigned int nBlockPos;
2778 if (!block.WriteToDisk(nFile, nBlockPos))
2779 return error("LoadBlockIndex() : writing genesis block to disk failed");
2780 if (!block.AddToBlockIndex(nFile, nBlockPos))
2781 return error("LoadBlockIndex() : genesis block not accepted");
2783 // initialize synchronized checkpoint
2784 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2785 return error("LoadBlockIndex() : failed to init sync checkpoint");
2787 // upgrade time set to zero if txdb initialized
2789 if (!txdb.WriteModifierUpgradeTime(0))
2790 return error("LoadBlockIndex() : failed to init upgrade info");
2791 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2797 string strPubKey = "";
2798 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2800 // write checkpoint master key to db
2802 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2803 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2804 if (!txdb.TxnCommit())
2805 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2806 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2807 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2810 // upgrade time set to zero if blocktreedb initialized
2811 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2813 if (nModifierUpgradeTime)
2814 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2816 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2820 nModifierUpgradeTime = GetTime();
2821 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2822 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2823 return error("LoadBlockIndex() : failed to write upgrade info");
2836 void PrintBlockTree()
2838 // pre-compute tree structure
2839 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2840 for (auto mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2842 CBlockIndex* pindex = (*mi).second;
2843 mapNext[pindex->pprev].push_back(pindex);
2845 //while (rand() % 3 == 0)
2846 // mapNext[pindex->pprev].push_back(pindex);
2849 vector<pair<int, CBlockIndex*> > vStack;
2850 vStack.push_back(make_pair(0, pindexGenesisBlock));
2853 while (!vStack.empty())
2855 int nCol = vStack.back().first;
2856 CBlockIndex* pindex = vStack.back().second;
2859 // print split or gap
2860 if (nCol > nPrevCol)
2862 for (int i = 0; i < nCol-1; i++)
2866 else if (nCol < nPrevCol)
2868 for (int i = 0; i < nCol; i++)
2875 for (int i = 0; i < nCol; i++)
2880 block.ReadFromDisk(pindex);
2881 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2885 block.GetHash().ToString().c_str(),
2887 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2888 FormatMoney(pindex->nMint).c_str(),
2891 PrintWallets(block);
2893 // put the main time-chain first
2894 vector<CBlockIndex*>& vNext = mapNext[pindex];
2895 for (unsigned int i = 0; i < vNext.size(); i++)
2897 if (vNext[i]->pnext)
2899 swap(vNext[0], vNext[i]);
2905 for (unsigned int i = 0; i < vNext.size(); i++)
2906 vStack.push_back(make_pair(nCol+i, vNext[i]));
2910 bool LoadExternalBlockFile(FILE* fileIn, CClientUIInterface& uiInterface)
2912 auto nStart = GetTimeMillis();
2913 vector<uint8_t> pchData(10 * (8+MAX_BLOCK_SIZE));
2914 int32_t nLoaded = 0;
2918 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2920 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
2924 fseek(blkdat, nPos, SEEK_SET);
2925 auto nRead = fread(&pchData[0], 1, pchData.size(), blkdat);
2928 nPos = numeric_limits<uint32_t>::max();
2931 auto it = pchData.begin();
2932 while(it != pchData.end() && !fRequestShutdown)
2934 auto nBlockLength = *reinterpret_cast<const uint32_t*>(&(*(it+4)));
2935 auto SeekToNext = [&pchData, &it, &nPos, &nBlockLength]() {
2937 it = search(it+8, pchData.end(), BEGIN(nNetworkID), END(nNetworkID));
2938 if (it != pchData.end())
2939 nPos += (it - previt);
2941 if (nBlockLength > 0)
2943 if (nBlockLength > (uint32_t)distance(it, pchData.end()))
2946 break; // We've reached the end of buffer
2953 vector<unsigned char> vchBlockBytes(it+8, it+8+nBlockLength);
2954 CDataStream blockData(vchBlockBytes, SER_NETWORK, PROTOCOL_VERSION);
2957 catch (const std::exception&)
2959 printf("LoadExternalBlockFile() : Deserialize error caught at the position %" PRIu32 ", this block may be truncated.", nPos);
2963 if (ProcessBlock(NULL, &block))
2965 advance(it, 8 + nBlockLength);
2966 nPos += (8 + nBlockLength);
2968 static int64_t nLastUpdate = 0;
2969 if (GetTimeMillis() - nLastUpdate > 1000)
2971 uiInterface.InitMessage(strprintf(_("%" PRId32 " blocks were read."), nLoaded));
2972 nLastUpdate = GetTimeMillis();
2983 while(!fRequestShutdown);
2986 catch (const std::exception&) {
2987 printf("%s() : I/O error caught during load\n",
2988 BOOST_CURRENT_FUNCTION);
2991 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
2995 //////////////////////////////////////////////////////////////////////////////
3000 extern map<uint256, CAlert> mapAlerts;
3001 extern CCriticalSection cs_mapAlerts;
3003 string GetWarnings(string strFor)
3006 string strStatusBar;
3009 if (GetBoolArg("-testsafemode"))
3012 // Misc warnings like out of disk space and clock is wrong
3013 if (!strMiscWarning.empty())
3016 strStatusBar = strMiscWarning;
3019 // if detected unmet upgrade requirement enter safe mode
3020 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3021 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3024 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3027 // if detected invalid checkpoint enter safe mode
3028 if (Checkpoints::hashInvalidCheckpoint != 0)
3031 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3037 for(auto& item : mapAlerts)
3039 const CAlert& alert = item.second;
3040 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3042 nPriority = alert.nPriority;
3043 strStatusBar = alert.strStatusBar;
3044 if (nPriority > 1000)
3045 strRPC = strStatusBar;
3050 if (strFor == "statusbar")
3051 return strStatusBar;
3052 else if (strFor == "rpc")
3054 assert(!"GetWarnings() : invalid parameter");
3065 //////////////////////////////////////////////////////////////////////////////
3071 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3073 int nType = inv.GetType();
3074 auto nHash = inv.GetHash();
3080 bool txInMap = false;
3083 txInMap = (mempool.exists(nHash));
3086 mapOrphanTransactions.count(nHash) ||
3087 txdb.ContainsTx(nHash);
3091 return mapBlockIndex.count(nHash) ||
3092 mapOrphanBlocks.count(nHash);
3094 // Don't know what it is, just say we already got one
3098 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3100 static map<CService, CPubKey> mapReuseKey;
3101 RandAddSeedPerfmon();
3103 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3104 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3106 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3110 if (strCommand == "version")
3112 // Each connection can only send one version message
3113 if (pfrom->nVersion != 0)
3115 pfrom->Misbehaving(1);
3122 uint64_t nNonce = 1;
3123 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3124 if (pfrom->nVersion < MIN_PROTO_VERSION)
3126 // Since February 20, 2012, the protocol is initiated at version 209,
3127 // and earlier versions are no longer supported
3128 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3129 pfrom->fDisconnect = true;
3133 if (pfrom->nVersion == 10300)
3134 pfrom->nVersion = 300;
3136 vRecv >> addrFrom >> nNonce;
3138 vRecv >> pfrom->strSubVer;
3140 vRecv >> pfrom->nStartingHeight;
3142 if (pfrom->fInbound && addrMe.IsRoutable())
3144 pfrom->addrLocal = addrMe;
3148 // Disconnect if we connected to ourself
3149 if (nNonce == nLocalHostNonce && nNonce > 1)
3151 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3152 pfrom->fDisconnect = true;
3156 if (pfrom->nVersion < 60010)
3158 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3159 pfrom->fDisconnect = true;
3163 // record my external IP reported by peer
3164 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3165 addrSeenByPeer = addrMe;
3167 // Be shy and don't send version until we hear
3168 if (pfrom->fInbound)
3169 pfrom->PushVersion();
3171 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3173 AddTimeData(pfrom->addr, nTime);
3176 pfrom->PushMessage("verack");
3177 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3179 if (!pfrom->fInbound)
3181 // Advertise our address
3182 if (!fNoListen && !IsInitialBlockDownload())
3184 auto addr = GetLocalAddress(&pfrom->addr);
3185 if (addr.IsRoutable())
3186 pfrom->PushAddress(addr);
3189 // Get recent addresses
3190 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3192 pfrom->PushMessage("getaddr");
3193 pfrom->fGetAddr = true;
3195 addrman.Good(pfrom->addr);
3197 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3199 addrman.Add(addrFrom, addrFrom);
3200 addrman.Good(addrFrom);
3204 // Ask the first connected node for block updates
3205 static int nAskedForBlocks = 0;
3206 if (!pfrom->fClient && !pfrom->fOneShot &&
3207 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3208 (pfrom->nVersion < NOBLKS_VERSION_START ||
3209 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3210 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3213 pfrom->PushGetBlocks(pindexBest, uint256(0));
3219 for(auto& item : mapAlerts)
3220 item.second.RelayTo(pfrom);
3223 // Relay sync-checkpoint
3225 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3226 if (!Checkpoints::checkpointMessage.IsNull())
3227 Checkpoints::checkpointMessage.RelayTo(pfrom);
3230 pfrom->fSuccessfullyConnected = true;
3232 printf("receive version message: version %d, blocks=%d, us=%s, them=%s, peer=%s\n", pfrom->nVersion, pfrom->nStartingHeight, addrMe.ToString().c_str(), addrFrom.ToString().c_str(), pfrom->addr.ToString().c_str());
3234 cPeerBlockCounts.input(pfrom->nStartingHeight);
3236 // ppcoin: ask for pending sync-checkpoint if any
3237 if (!IsInitialBlockDownload())
3238 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3242 else if (pfrom->nVersion == 0)
3244 // Must have a version message before anything else
3245 pfrom->Misbehaving(1);
3250 else if (strCommand == "verack")
3252 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3256 else if (strCommand == "addr")
3258 vector<CAddress> vAddr;
3261 // Don't want addr from older versions unless seeding
3262 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3264 if (vAddr.size() > 1000)
3266 pfrom->Misbehaving(20);
3267 return error("message addr size() = %" PRIszu "", vAddr.size());
3270 // Store the new addresses
3271 vector<CAddress> vAddrOk;
3272 auto nNow = GetAdjustedTime();
3273 auto nSince = nNow - 10 * 60;
3274 for(CAddress& addr : vAddr)
3278 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3279 addr.nTime = nNow - 5 * nOneDay;
3280 pfrom->AddAddressKnown(addr);
3281 bool fReachable = IsReachable(addr);
3282 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3284 // Relay to a limited number of other nodes
3287 // Use deterministic randomness to send to the same nodes for 24 hours
3288 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3289 static uint256 hashSalt;
3291 hashSalt = GetRandHash();
3292 uint64_t hashAddr = addr.GetHash();
3293 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3294 hashRand = Hash(hashRand.begin(), hashRand.end());
3295 multimap<uint256, CNode*> mapMix;
3296 for(CNode* pnode : vNodes)
3298 if (pnode->nVersion < CADDR_TIME_VERSION)
3300 unsigned int nPointer;
3301 memcpy(&nPointer, &pnode, sizeof(nPointer));
3302 uint256 hashKey = hashRand ^ nPointer;
3303 hashKey = Hash(hashKey.begin(), hashKey.end());
3304 mapMix.insert(make_pair(hashKey, pnode));
3306 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3307 for (auto mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3308 ((*mi).second)->PushAddress(addr);
3311 // Do not store addresses outside our network
3313 vAddrOk.push_back(addr);
3315 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3316 if (vAddr.size() < 1000)
3317 pfrom->fGetAddr = false;
3318 if (pfrom->fOneShot)
3319 pfrom->fDisconnect = true;
3322 else if (strCommand == "inv")
3326 if (vInv.size() > MAX_INV_SZ)
3328 pfrom->Misbehaving(20);
3329 return error("message inv size() = %" PRIszu "", vInv.size());
3332 // find last block in inv vector
3333 int nLastBlock = -1;
3334 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3335 if (vInv[vInv.size() - 1 - nInv].GetType() == MSG_BLOCK) {
3336 nLastBlock = (int) (vInv.size() - 1 - nInv);
3341 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3343 const CInv &inv = vInv[nInv];
3344 int nType = inv.GetType();
3345 auto nHash = inv.GetHash();
3349 pfrom->AddInventoryKnown(inv);
3351 bool fAlreadyHave = AlreadyHave(txdb, inv);
3353 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3357 else if (nType == MSG_BLOCK && mapOrphanBlocks.count(nHash)) {
3358 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[nHash]));
3359 } else if (nType == nLastBlock) {
3360 // In case we are on a very long side-chain, it is possible that we already have
3361 // the last block in an inv bundle sent in response to getblocks. Try to detect
3362 // this situation and push another getblocks to continue.
3363 pfrom->PushGetBlocks(mapBlockIndex[nHash], uint256(0));
3365 printf("force request: %s\n", inv.ToString().c_str());
3368 // Track requests for our stuff
3374 else if (strCommand == "getdata")
3378 if (vInv.size() > MAX_INV_SZ)
3380 pfrom->Misbehaving(20);
3381 return error("message getdata size() = %" PRIszu "", vInv.size());
3384 if (fDebugNet || (vInv.size() != 1))
3385 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3387 for(const CInv& inv : vInv)
3391 if (fDebugNet || (vInv.size() == 1))
3392 printf("received getdata for: %s\n", inv.ToString().c_str());
3394 int nType = inv.GetType();
3395 auto nHash = inv.GetHash();
3397 if (nType == MSG_BLOCK)
3399 // Send block from disk
3400 auto mi = mapBlockIndex.find(nHash);
3401 if (mi != mapBlockIndex.end())
3404 block.ReadFromDisk((*mi).second);
3405 pfrom->PushMessage("block", block);
3407 // Trigger them to send a getblocks request for the next batch of inventory
3408 if (nHash == pfrom->hashContinue)
3410 // ppcoin: send latest proof-of-work block to allow the
3411 // download node to accept as orphan (proof-of-stake
3412 // block might be rejected by stake connection check)
3414 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3415 pfrom->PushMessage("inv", vInv);
3416 pfrom->hashContinue = 0;
3420 else if (inv.IsKnownType())
3422 // Send stream from relay memory
3423 bool pushed = false;
3426 auto mi = mapRelay.find(inv);
3427 if (mi != mapRelay.end()) {
3428 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3432 if (!pushed && nType == MSG_TX) {
3434 if (mempool.exists(nHash)) {
3435 CTransaction tx = mempool.lookup(nHash);
3436 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3439 pfrom->PushMessage("tx", ss);
3444 // Track requests for our stuff
3450 else if (strCommand == "getblocks")
3452 CBlockLocator locator;
3454 vRecv >> locator >> hashStop;
3456 // Find the last block the caller has in the main chain
3457 CBlockIndex* pindex = locator.GetBlockIndex();
3459 // Send the rest of the chain
3461 pindex = pindex->pnext;
3463 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3464 for (; pindex; pindex = pindex->pnext)
3466 if (pindex->GetBlockHash() == hashStop)
3468 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3469 // ppcoin: tell downloading node about the latest block if it's
3470 // without risk being rejected due to stake connection check
3471 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3472 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3475 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3478 // When this block is requested, we'll send an inv that'll make them
3479 // getblocks the next batch of inventory.
3480 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3481 pfrom->hashContinue = pindex->GetBlockHash();
3486 else if (strCommand == "checkpoint")
3488 CSyncCheckpoint checkpoint;
3489 vRecv >> checkpoint;
3491 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3494 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3496 for(CNode* pnode : vNodes)
3497 checkpoint.RelayTo(pnode);
3501 else if (strCommand == "getheaders")
3503 CBlockLocator locator;
3505 vRecv >> locator >> hashStop;
3507 CBlockIndex* pindex = NULL;
3508 if (locator.IsNull())
3510 // If locator is null, return the hashStop block
3511 auto mi = mapBlockIndex.find(hashStop);
3512 if (mi == mapBlockIndex.end())
3514 pindex = (*mi).second;
3518 // Find the last block the caller has in the main chain
3519 pindex = locator.GetBlockIndex();
3521 pindex = pindex->pnext;
3524 vector<CBlock> vHeaders;
3526 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3527 for (; pindex; pindex = pindex->pnext)
3529 vHeaders.push_back(pindex->GetBlockHeader());
3530 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3533 pfrom->PushMessage("headers", vHeaders);
3537 else if (strCommand == "tx")
3539 vector<uint256> vWorkQueue;
3540 vector<uint256> vEraseQueue;
3541 CDataStream vMsg(vRecv);
3546 CInv inv(MSG_TX, tx.GetHash());
3547 pfrom->AddInventoryKnown(inv);
3549 bool fMissingInputs = false;
3550 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3552 auto nHash = inv.GetHash();
3554 SyncWithWallets(tx, NULL, true);
3555 RelayTransaction(tx, nHash);
3556 mapAlreadyAskedFor.erase(inv);
3557 vWorkQueue.push_back(nHash);
3558 vEraseQueue.push_back(nHash);
3560 // Recursively process any orphan transactions that depended on this one
3561 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3563 auto hashPrev = vWorkQueue[i];
3564 for (auto mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3565 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3568 const uint256& orphanTxHash = *mi;
3569 auto& orphanTx = mapOrphanTransactions[orphanTxHash];
3570 bool fMissingInputs2 = false;
3572 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3574 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3575 SyncWithWallets(tx, NULL, true);
3576 RelayTransaction(orphanTx, orphanTxHash);
3577 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3578 vWorkQueue.push_back(orphanTxHash);
3579 vEraseQueue.push_back(orphanTxHash);
3581 else if (!fMissingInputs2)
3584 vEraseQueue.push_back(orphanTxHash);
3585 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3590 for(uint256 hash : vEraseQueue)
3591 EraseOrphanTx(hash);
3593 else if (fMissingInputs)
3597 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3598 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3600 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3602 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3606 else if (strCommand == "block")
3610 auto hashBlock = block.GetHash();
3612 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3615 CInv inv(MSG_BLOCK, hashBlock);
3616 pfrom->AddInventoryKnown(inv);
3618 if (ProcessBlock(pfrom, &block))
3619 mapAlreadyAskedFor.erase(inv);
3620 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3624 // This asymmetric behavior for inbound and outbound connections was introduced
3625 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
3626 // to users' AddrMan and later request them by sending getaddr messages.
3627 // Making users (which are behind NAT and can only make outgoing connections) ignore
3628 // getaddr message mitigates the attack.
3629 else if ((strCommand == "getaddr") && (pfrom->fInbound))
3631 // Don't return addresses older than nCutOff timestamp
3632 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
3633 pfrom->vAddrToSend.clear();
3634 vector<CAddress> vAddr = addrman.GetAddr();
3635 for(const CAddress &addr : vAddr)
3636 if(addr.nTime > nCutOff)
3637 pfrom->PushAddress(addr);
3641 else if (strCommand == "mempool")
3643 std::vector<uint256> vtxid;
3644 mempool.queryHashes(vtxid);
3646 for (unsigned int i = 0; i < vtxid.size(); i++) {
3647 CInv inv(MSG_TX, vtxid[i]);
3648 vInv.push_back(inv);
3649 if (i == (MAX_INV_SZ - 1))
3652 if (vInv.size() > 0)
3653 pfrom->PushMessage("inv", vInv);
3657 else if (strCommand == "checkorder")
3662 if (!GetBoolArg("-allowreceivebyip"))
3664 pfrom->PushMessage("reply", hashReply, 2, string(""));
3671 /// we have a chance to check the order here
3673 // Keep giving the same key to the same ip until they use it
3674 if (!mapReuseKey.count(pfrom->addr))
3675 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3677 // Send back approval of order and pubkey to use
3678 CScript scriptPubKey;
3679 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3680 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
3684 else if (strCommand == "reply")
3689 CRequestTracker tracker;
3691 LOCK(pfrom->cs_mapRequests);
3692 auto mi = pfrom->mapRequests.find(hashReply);
3693 if (mi != pfrom->mapRequests.end())
3695 tracker = (*mi).second;
3696 pfrom->mapRequests.erase(mi);
3699 if (!tracker.IsNull())
3700 tracker.fn(tracker.param1, vRecv);
3704 else if (strCommand == "ping")
3708 // Echo the message back with the nonce. This allows for two useful features:
3710 // 1) A remote node can quickly check if the connection is operational
3711 // 2) Remote nodes can measure the latency of the network thread. If this node
3712 // is overloaded it won't respond to pings quickly and the remote node can
3713 // avoid sending us more work, like chain download requests.
3715 // The nonce stops the remote getting confused between different pings: without
3716 // it, if the remote node sends a ping once per second and this node takes 5
3717 // seconds to respond to each, the 5th ping the remote sends would appear to
3718 // return very quickly.
3719 pfrom->PushMessage("pong", nonce);
3723 else if (strCommand == "alert")
3728 auto alertHash = alert.GetHash();
3729 if (pfrom->setKnown.count(alertHash) == 0)
3731 if (alert.ProcessAlert())
3734 pfrom->setKnown.insert(alertHash);
3737 for(CNode* pnode : vNodes)
3738 alert.RelayTo(pnode);
3742 // Small DoS penalty so peers that send us lots of
3743 // duplicate/expired/invalid-signature/whatever alerts
3744 // eventually get banned.
3745 // This isn't a Misbehaving(100) (immediate ban) because the
3746 // peer might be an older or different implementation with
3747 // a different signature key, etc.
3748 pfrom->Misbehaving(10);
3756 // Ignore unknown commands for extensibility
3760 // Update the last seen time for this node's address
3761 if (pfrom->fNetworkNode)
3762 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3763 AddressCurrentlyConnected(pfrom->addr);
3769 bool ProcessMessages(CNode* pfrom)
3771 CDataStream& vRecv = pfrom->vRecv;
3775 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3779 // (4) message start
3788 // Don't bother if send buffer is too full to respond anyway
3789 if (pfrom->vSend.size() >= SendBufferSize())
3792 // Scan for message start
3793 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(nNetworkID), END(nNetworkID));
3794 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3795 if (vRecv.end() - pstart < nHeaderSize)
3797 if ((int)vRecv.size() > nHeaderSize)
3799 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3800 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3804 if (pstart - vRecv.begin() > 0)
3805 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3806 vRecv.erase(vRecv.begin(), pstart);
3809 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3814 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3817 string strCommand = hdr.GetCommand();
3820 unsigned int nMessageSize = hdr.nMessageSize;
3821 if (nMessageSize > MAX_SIZE)
3823 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3826 if (nMessageSize > vRecv.size())
3828 // Rewind and wait for rest of message
3829 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3834 auto hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3835 unsigned int nChecksum = 0;
3836 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3837 if (nChecksum != hdr.nChecksum)
3839 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3840 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3844 // Copy message to its own buffer
3845 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3846 vRecv.ignore(nMessageSize);
3854 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3859 catch (std::ios_base::failure& e)
3861 if (strstr(e.what(), "end of data"))
3863 // Allow exceptions from under-length message on vRecv
3864 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
3866 else if (strstr(e.what(), "size too large"))
3868 // Allow exceptions from over-long size
3869 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3873 PrintExceptionContinue(&e, "ProcessMessages()");
3876 catch (std::exception& e) {
3877 PrintExceptionContinue(&e, "ProcessMessages()");
3879 PrintExceptionContinue(NULL, "ProcessMessages()");
3883 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3891 bool SendMessages(CNode* pto)
3893 TRY_LOCK(cs_main, lockMain);
3895 // Current time in microseconds
3896 auto nNow = GetTimeMicros();
3898 // Don't send anything until we get their version message
3899 if (pto->nVersion == 0)
3902 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3904 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
3906 pto->PushMessage("ping", nonce);
3910 if (pto->fStartSync) {
3911 pto->fStartSync = false;
3912 pto->PushGetBlocks(pindexBest, uint256(0));
3915 // Resend wallet transactions that haven't gotten in a block yet
3916 ResendWalletTransactions();
3918 // Address refresh broadcast
3919 if (!IsInitialBlockDownload() && pto->nNextLocalAddrSend < nNow) {
3920 AdvertiseLocal(pto);
3921 pto->nNextLocalAddrSend = PoissonNextSend(nNow, nOneDay);
3927 if (pto->nNextAddrSend < nNow) {
3928 pto->nNextAddrSend = PoissonNextSend(nNow, 30);
3929 vector<CAddress> vAddr;
3930 vAddr.reserve(pto->vAddrToSend.size());
3931 for(const CAddress& addr : pto->vAddrToSend)
3933 if (pto->setAddrKnown.insert(addr).second)
3935 vAddr.push_back(addr);
3936 // receiver rejects addr messages larger than 1000
3937 if (vAddr.size() >= 1000)
3939 pto->PushMessage("addr", vAddr);
3944 pto->vAddrToSend.clear();
3946 pto->PushMessage("addr", vAddr);
3950 // Message: inventory
3953 vector<CInv> vInvWait;
3955 bool fSendTrickle = false;
3956 if (pto->nNextInvSend < nNow) {
3957 fSendTrickle = true;
3958 pto->nNextInvSend = PoissonNextSend(nNow, 5);
3960 LOCK(pto->cs_inventory);
3961 vInv.reserve(pto->vInventoryToSend.size());
3962 vInvWait.reserve(pto->vInventoryToSend.size());
3963 for(const CInv& inv : pto->vInventoryToSend)
3965 if (pto->setInventoryKnown.count(inv))
3968 // trickle out tx inv to protect privacy
3969 if (inv.GetType() == MSG_TX && !fSendTrickle)
3971 // 1/4 of tx invs blast to all immediately
3972 static uint256 hashSalt;
3974 hashSalt = GetRandHash();
3975 uint256 hashRand = inv.GetHash() ^ hashSalt;
3976 hashRand = Hash(hashRand.begin(), hashRand.end());
3977 bool fTrickleWait = ((hashRand & 3) != 0);
3981 vInvWait.push_back(inv);
3986 // returns true if wasn't already contained in the set
3987 if (pto->setInventoryKnown.insert(inv).second)
3989 vInv.push_back(inv);
3990 if (vInv.size() >= 1000)
3992 pto->PushMessage("inv", vInv);
3997 pto->vInventoryToSend = vInvWait;
4000 pto->PushMessage("inv", vInv);
4006 vector<CInv> vGetData;
4008 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4010 const CInv& inv = (*pto->mapAskFor.begin()).second;
4011 if (!AlreadyHave(txdb, inv))
4014 printf("sending getdata: %s\n", inv.ToString().c_str());
4015 vGetData.push_back(inv);
4016 if (vGetData.size() >= 1000)
4018 pto->PushMessage("getdata", vGetData);
4021 mapAlreadyAskedFor[inv] = nNow;
4023 pto->mapAskFor.erase(pto->mapAskFor.begin());
4025 if (!vGetData.empty())
4026 pto->PushMessage("getdata", vGetData);
4039 auto it1 = mapBlockIndex.begin();
4040 for (; it1 != mapBlockIndex.end(); it1++)
4041 delete (*it1).second;
4042 mapBlockIndex.clear();
4045 auto it2 = mapOrphanBlocks.begin();
4046 for (; it2 != mapOrphanBlocks.end(); it2++)
4047 delete (*it2).second;
4048 mapOrphanBlocks.clear();
4050 // orphan transactions
4052 } instance_of_cmaincleanup;