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::IsFinal(int nBlockHeight, int64_t nBlockTime) const
258 // Time based nLockTime implemented in 0.1.6
261 if (nBlockHeight == 0)
262 nBlockHeight = nBestHeight;
264 nBlockTime = GetAdjustedTime();
265 if ((int64_t)nLockTime < ((int64_t)nLockTime < LOCKTIME_THRESHOLD ? (int64_t)nBlockHeight : nBlockTime))
267 for(const CTxIn& txin : vin)
273 bool CTransaction::IsNewerThan(const CTransaction& old) const
275 if (vin.size() != old.vin.size())
277 for (unsigned int i = 0; i < vin.size(); i++)
278 if (vin[i].prevout != old.vin[i].prevout)
281 unsigned int nLowest = numeric_limits<unsigned int>::max();
282 for (unsigned int i = 0; i < vin.size(); i++)
284 if (vin[i].nSequence != old.vin[i].nSequence)
286 if (vin[i].nSequence <= nLowest)
289 nLowest = vin[i].nSequence;
291 if (old.vin[i].nSequence < nLowest)
294 nLowest = old.vin[i].nSequence;
301 bool CTransaction::ReadFromDisk(CDiskTxPos pos, FILE** pfileRet)
303 auto filein = CAutoFile(OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb"), SER_DISK, CLIENT_VERSION);
305 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
308 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
309 return error("CTransaction::ReadFromDisk() : fseek failed");
314 catch (const std::exception&) {
315 return error("%s() : deserialize or I/O error", BOOST_CURRENT_FUNCTION);
318 // Return file pointer
321 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
322 return error("CTransaction::ReadFromDisk() : second fseek failed");
323 *pfileRet = filein.release();
328 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
331 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
333 if (!ReadFromDisk(txindexRet.pos))
335 if (prevout.n >= vout.size())
343 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
346 return ReadFromDisk(txdb, prevout, txindex);
349 bool CTransaction::ReadFromDisk(COutPoint prevout)
353 return ReadFromDisk(txdb, prevout, txindex);
356 bool CTransaction::IsStandard(string& strReason) const
358 if (nVersion > CTransaction::CURRENT_VERSION)
360 strReason = "version";
364 unsigned int nDataOut = 0;
365 txnouttype whichType;
366 for(const CTxIn& txin : vin)
368 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
369 // keys. (remember the 520 byte limit on redeemScript size) That works
370 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
371 // bytes of scriptSig, which we round off to 1650 bytes for some minor
372 // future-proofing. That's also enough to spend a 20-of-20
373 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
374 // considered standard)
375 if (txin.scriptSig.size() > 1650)
377 strReason = "scriptsig-size";
380 if (!txin.scriptSig.IsPushOnly())
382 strReason = "scriptsig-not-pushonly";
385 if (!txin.scriptSig.HasCanonicalPushes()) {
386 strReason = "txin-scriptsig-not-canonicalpushes";
390 for(const CTxOut& txout : vout) {
391 if (!::IsStandard(txout.scriptPubKey, whichType)) {
392 strReason = "scriptpubkey";
395 if (whichType == TX_NULL_DATA)
398 if (txout.nValue == 0) {
399 strReason = "txout-value=0";
402 if (!txout.scriptPubKey.HasCanonicalPushes()) {
403 strReason = "txout-scriptsig-not-canonicalpushes";
409 // only one OP_RETURN txout is permitted
411 strReason = "multi-op-return";
419 // Check transaction inputs, and make sure any
420 // pay-to-script-hash transactions are evaluating IsStandard scripts
422 // Why bother? To avoid denial-of-service attacks; an attacker
423 // can submit a standard HASH... OP_EQUAL transaction,
424 // which will get accepted into blocks. The redemption
425 // script can be anything; an attacker could use a very
426 // expensive-to-check-upon-redemption script like:
427 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
429 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
432 return true; // Coinbases don't use vin normally
434 for (uint32_t i = 0; i < vin.size(); i++)
436 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
438 vector<vector<unsigned char> > vSolutions;
439 txnouttype whichType;
440 // get the scriptPubKey corresponding to this input:
441 const CScript& prevScript = prev.scriptPubKey;
442 if (!Solver(prevScript, whichType, vSolutions))
444 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
445 if (nArgsExpected < 0)
448 // Transactions with extra stuff in their scriptSigs are
449 // non-standard. Note that this EvalScript() call will
450 // be quick, because if there are any operations
451 // beside "push data" in the scriptSig the
452 // IsStandard() call returns false
453 vector<vector<unsigned char> > stack;
454 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
457 if (whichType == TX_SCRIPTHASH)
461 CScript subscript(stack.back().begin(), stack.back().end());
462 vector<vector<unsigned char> > vSolutions2;
463 txnouttype whichType2;
464 if (!Solver(subscript, whichType2, vSolutions2))
466 if (whichType2 == TX_SCRIPTHASH)
470 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
473 nArgsExpected += tmpExpected;
476 if (stack.size() != (unsigned int)nArgsExpected)
483 unsigned int CTransaction::GetLegacySigOpCount() const
485 unsigned int nSigOps = 0;
488 // Coinbase scriptsigs are never executed, so there is
489 // no sense in calculation of sigops.
490 for(const CTxIn& txin : vin)
492 nSigOps += txin.scriptSig.GetSigOpCount(false);
495 for(const CTxOut& txout : vout)
497 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
502 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
515 // Load the block this tx is in
517 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
519 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
524 // Update the tx's hashBlock
525 hashBlock = pblock->GetHash();
527 // Locate the transaction
528 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
529 if (pblock->vtx[nIndex] == *(CTransaction*)this)
531 if (nIndex == (int)pblock->vtx.size())
533 vMerkleBranch.clear();
535 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
539 // Fill in merkle branch
540 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
543 // Is the tx in a block that's in the main chain
544 auto mi = mapBlockIndex.find(hashBlock);
545 if (mi == mapBlockIndex.end())
547 const CBlockIndex* pindex = (*mi).second;
548 if (!pindex || !pindex->IsInMainChain())
551 return pindexBest->nHeight - pindex->nHeight + 1;
554 bool CTransaction::CheckTransaction() const
556 // Basic checks that don't depend on any context
558 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
560 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
562 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
563 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
565 // Check for negative or overflow output values
566 CBigNum nValueOut = 0;
567 for (uint32_t i = 0; i < vout.size(); i++)
569 const auto& txout = vout[i];
570 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
571 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
572 if (!MoneyRange(txout.nValue))
573 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is out of range"));
574 nValueOut += txout.nValue;
575 if (!MoneyRange(nValueOut))
576 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
579 // Check for duplicate inputs
580 set<COutPoint> vInOutPoints;
581 for(const CTxIn& txin : vin)
583 if (vInOutPoints.count(txin.prevout))
585 vInOutPoints.insert(txin.prevout);
590 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
591 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
595 for(const CTxIn& txin : vin)
596 if (txin.prevout.IsNull())
597 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
603 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
605 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
609 // Enforce 0.01 as minimum fee for coinstake
611 nMinRelayTxFee = CENT;
614 // Base fee is either nMinTxFee or nMinRelayTxFee
615 auto nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
617 unsigned int nNewBlockSize = nBlockSize + nBytes;
618 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
624 // Transactions under 1K are free
630 // Free transaction area
631 if (nNewBlockSize < 27000)
636 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
637 // each non empty output which is less than 0.01
639 // It's safe to ignore empty outputs here, because these inputs are allowed
640 // only for coinbase and coinstake transactions.
641 for(const CTxOut& txout : vout)
642 if (txout.nValue < CENT && !txout.IsEmpty())
645 // Raise the price as the block approaches full
646 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
648 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
650 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
653 if (!MoneyRange(nMinFee))
659 string CTransaction::ToStringShort() const
662 str += strprintf("%s %s", GetHash().ToString().c_str(), IsCoinBase()? "base" : (IsCoinStake()? "stake" : "user"));
666 string CTransaction::ToString() const
669 str += IsCoinBase()? "Coinbase" : (IsCoinStake()? "Coinstake" : "CTransaction");
670 str += strprintf("(hash=%s, nTime=%d, ver=%d, vin.size=%" PRIszu ", vout.size=%" PRIszu ", nLockTime=%d)\n",
671 GetHash().ToString().substr(0,10).c_str(),
677 for (unsigned int i = 0; i < vin.size(); i++)
678 str += " " + vin[i].ToString() + "\n";
679 for (unsigned int i = 0; i < vout.size(); i++)
680 str += " " + vout[i].ToString() + "\n";
684 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
685 bool* pfMissingInputs)
688 *pfMissingInputs = false;
690 // Time (prevent mempool memory exhaustion attack)
691 if (tx.nTime > FutureDrift(GetAdjustedTime()))
692 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
694 if (!tx.CheckTransaction())
695 return error("CTxMemPool::accept() : CheckTransaction failed");
697 // Coinbase is only valid in a block, not as a loose transaction
699 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
701 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
702 if (tx.IsCoinStake())
703 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
705 // To help v0.1.5 clients who would see it as a negative number
706 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
707 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
709 // Rather not work on nonstandard transactions (unless -testnet)
711 if (!fTestNet && !tx.IsStandard(strNonStd))
712 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
714 // Do we already have it?
715 auto hash = tx.GetHash();
718 if (mapTx.count(hash))
722 if (txdb.ContainsTx(hash))
725 // Check for conflicts with in-memory transactions
726 for (unsigned int i = 0; i < tx.vin.size(); i++)
728 auto outpoint = tx.vin[i].prevout;
729 if (mapNextTx.count(outpoint))
731 // Replacement feature isn't supported by Novacoin.
739 map<uint256, CTxIndex> mapUnused;
740 bool fInvalid = false;
741 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
744 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
746 *pfMissingInputs = true;
750 // Check for non-standard pay-to-script-hash in inputs
751 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
752 return error("CTxMemPool::accept() : nonstandard transaction input");
754 // Note: if you modify this code to accept non-standard transactions, then
755 // you should add code here to check that the transaction does a
756 // reasonable number of ECDSA signature verifications.
758 auto nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
759 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
761 // Don't accept it if it can't get into a block
762 auto txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
763 if (nFees < txMinFee)
764 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
765 hash.ToString().c_str(),
768 // Continuously rate-limit free transactions
769 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
770 // be annoying or make others' transactions take longer to confirm.
771 if (nFees < MIN_RELAY_TX_FEE)
773 static CCriticalSection cs;
774 static double dFreeCount;
775 static int64_t nLastTime;
776 auto nNow = GetTime();
780 // Use an exponentially decaying ~10-minute window:
781 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
783 // -limitfreerelay unit is thousand-bytes-per-minute
784 // At default rate it would take over a month to fill 1GB
785 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
786 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
788 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
793 // Check against previous transactions
794 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
795 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
797 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
801 // Store transaction in memory
804 addUnchecked(hash, tx);
807 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
808 hash.ToString().substr(0,10).c_str(),
813 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
815 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
818 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
820 // Add to memory pool without checking anything. Don't call this directly,
821 // call CTxMemPool::accept to properly check the transaction first.
824 for (unsigned int i = 0; i < tx.vin.size(); i++)
825 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
826 nTransactionsUpdated++;
832 bool CTxMemPool::remove(CTransaction &tx)
834 // Remove transaction from memory pool
837 auto hash = tx.GetHash();
838 if (mapTx.count(hash))
840 for(const CTxIn& txin : tx.vin)
841 mapNextTx.erase(txin.prevout);
843 nTransactionsUpdated++;
849 void CTxMemPool::clear()
854 ++nTransactionsUpdated;
857 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
862 vtxid.reserve(mapTx.size());
863 for (auto mi = mapTx.begin(); mi != mapTx.end(); ++mi)
864 vtxid.push_back((*mi).first);
868 string CTxIn::ToString() const
872 str += CTxIn::prevout.ToString();
873 if (CTxIn::prevout.IsNull())
874 str += strprintf(", coinbase %s", HexStr(CTxIn::scriptSig).c_str());
876 str += strprintf(", scriptSig=%s", CTxIn::scriptSig.ToString().substr(0,24).c_str());
877 if (CTxIn::nSequence != numeric_limits<unsigned int>::max())
878 str += strprintf(", nSequence=%" PRIu32, CTxIn::nSequence);
884 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
886 if (hashBlock == 0 || nIndex == -1)
889 // Find the block it claims to be in
890 auto mi = mapBlockIndex.find(hashBlock);
891 if (mi == mapBlockIndex.end())
893 CBlockIndex* pindex = (*mi).second;
894 if (!pindex || !pindex->IsInMainChain())
897 // Make sure the merkle branch connects to this block
898 if (!fMerkleVerified)
900 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
902 fMerkleVerified = true;
906 return pindexBest->nHeight - pindex->nHeight + 1;
910 int CMerkleTx::GetBlocksToMaturity() const
912 if (!(IsCoinBase() || IsCoinStake()))
914 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
918 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
922 if (!IsInMainChain() && !ClientConnectInputs())
924 return CTransaction::AcceptToMemoryPool(txdb, false);
928 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
932 bool CMerkleTx::AcceptToMemoryPool()
935 return AcceptToMemoryPool(txdb);
940 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
945 // Add previous supporting transactions first
946 for(CMerkleTx& tx : vtxPrev)
948 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
950 auto hash = tx.GetHash();
951 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
952 tx.AcceptToMemoryPool(txdb, fCheckInputs);
955 return AcceptToMemoryPool(txdb, fCheckInputs);
960 bool CWalletTx::AcceptWalletTransaction()
963 return AcceptWalletTransaction(txdb);
966 int CTxIndex::GetDepthInMainChain() const
970 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
972 // Find the block in the index
973 auto mi = mapBlockIndex.find(block.GetHash());
974 if (mi == mapBlockIndex.end())
976 auto pindex = (*mi).second;
977 if (!pindex || !pindex->IsInMainChain())
979 return 1 + nBestHeight - pindex->nHeight;
982 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
983 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
989 if (mempool.exists(hash))
991 tx = mempool.lookup(hash);
997 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
1000 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1001 hashBlock = block.GetHash();
1009 // Closure representing one script verification
1010 // Note that this stores references to the spending transaction
1014 CScript scriptPubKey;
1015 const CTransaction *ptxTo = nullptr;
1017 unsigned int nFlags = 0;
1022 CScriptCheck(const CTransaction& txFromIn, const CTransaction& txToIn, uint32_t nInIn, unsigned int nFlagsIn, int nHashTypeIn) :
1023 scriptPubKey(txFromIn.vout[txToIn.vin[nInIn].prevout.n].scriptPubKey),
1024 ptxTo(&txToIn), nIn(nInIn), nFlags(nFlagsIn), nHashType(nHashTypeIn) { }
1026 bool operator()() const;
1028 void swap(CScriptCheck &check) {
1029 scriptPubKey.swap(check.scriptPubKey);
1030 std::swap(ptxTo, check.ptxTo);
1031 std::swap(nIn, check.nIn);
1032 std::swap(nFlags, check.nFlags);
1033 std::swap(nHashType, check.nHashType);
1040 //////////////////////////////////////////////////////////////////////////////
1042 // CBlock and CBlockIndex
1045 static CBlockIndex* pblockindexFBBHLast;
1046 CBlockIndex* FindBlockByHeight(int nHeight)
1048 CBlockIndex *pblockindex;
1049 if (nHeight < nBestHeight / 2)
1050 pblockindex = pindexGenesisBlock;
1052 pblockindex = pindexBest;
1053 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
1054 pblockindex = pblockindexFBBHLast;
1055 while (pblockindex->nHeight > nHeight)
1056 pblockindex = pblockindex->pprev;
1057 while (pblockindex->nHeight < nHeight)
1058 pblockindex = pblockindex->pnext;
1059 pblockindexFBBHLast = pblockindex;
1063 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1065 if (!fReadTransactions)
1067 *this = pindex->GetBlockHeader();
1070 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
1072 if (GetHash() != pindex->GetBlockHash())
1073 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1077 uint256 static GetOrphanRoot(const CBlock* pblock)
1079 // Work back to the first block in the orphan chain
1080 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1081 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1082 return pblock->GetHash();
1085 // ppcoin: find block wanted by given orphan block
1086 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1088 // Work back to the first block in the orphan chain
1089 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1090 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1091 return pblockOrphan->hashPrevBlock;
1094 // select stake target limit according to hard-coded conditions
1095 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1097 if(fTestNet) // separate proof of stake target limit for testnet
1098 return bnProofOfStakeLimit;
1099 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1100 return bnProofOfStakeLimit;
1101 if(nHeight + 1 > 15000) // 24 bits since block 15000
1102 return bnProofOfStakeLegacyLimit;
1103 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1104 return bnProofOfStakeHardLimit;
1106 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1109 // miner's coin base reward based on nBits
1110 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
1112 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1115 bnTarget.SetCompact(nBits);
1116 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1117 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1119 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1120 // A reasonably continuous curve is used to avoid shock to market
1121 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1123 // Human readable form:
1125 // nSubsidy = 100 / (diff ^ 1/6)
1127 // Please note that we're using bisection to find an approximate solutuion
1128 CBigNum bnLowerBound = CENT;
1129 CBigNum bnUpperBound = bnSubsidyLimit;
1130 while (bnLowerBound + CENT <= bnUpperBound)
1132 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1133 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1134 bnUpperBound = bnMidValue;
1136 bnLowerBound = bnMidValue;
1139 int64_t nSubsidy = bnUpperBound.getuint64();
1141 nSubsidy = (nSubsidy / CENT) * CENT;
1142 if (fDebug && GetBoolArg("-printcreation"))
1143 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1145 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1148 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1149 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1151 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1153 // Stage 2 of emission process is mostly PoS-based.
1155 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1157 bnTarget.SetCompact(nBits);
1158 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1159 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1161 // A reasonably continuous curve is used to avoid shock to market
1163 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1164 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1165 bnMidPart, bnRewardPart;
1167 while (bnLowerBound + CENT <= bnUpperBound)
1169 auto bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1172 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1174 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1176 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1179 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1180 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1182 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1183 bnUpperBound = bnMidValue;
1185 bnLowerBound = bnMidValue;
1188 nRewardCoinYear = bnUpperBound.getuint64();
1189 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1192 return nRewardCoinYear;
1194 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1196 // Set reasonable reward limit for large inputs
1198 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1200 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1201 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1203 nSubsidy = min(nSubsidy, nSubsidyLimit);
1205 if (fDebug && GetBoolArg("-printcreation"))
1206 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1211 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1213 // get proof of work blocks max spacing according to hard-coded conditions
1214 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1216 if(nTime > TARGETS_SWITCH_TIME)
1217 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1220 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1222 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1226 // maximum nBits value could possible be required nTime after
1228 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1231 bnResult.SetCompact(nBase);
1233 while (nTime > 0 && bnResult < bnTargetLimit)
1235 // Maximum 200% adjustment per day...
1239 if (bnResult > bnTargetLimit)
1240 bnResult = bnTargetLimit;
1241 return bnResult.GetCompact();
1245 // minimum amount of work that could possibly be required nTime after
1246 // minimum proof-of-work required was nBase
1248 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1250 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1254 // minimum amount of stake that could possibly be required nTime after
1255 // minimum proof-of-stake required was nBase
1257 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1259 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1263 // ppcoin: find last block index up to pindex
1264 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1266 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1267 pindex = pindex->pprev;
1271 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1273 if (pindexLast == NULL)
1274 return bnProofOfWorkLimit.GetCompact(); // genesis block
1276 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1278 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1279 if (pindexPrev->pprev == NULL)
1280 return bnTargetLimit.GetCompact(); // first block
1281 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1282 if (pindexPrevPrev->pprev == NULL)
1283 return bnTargetLimit.GetCompact(); // second block
1285 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1287 // ppcoin: target change every block
1288 // ppcoin: retarget with exponential moving toward target spacing
1290 bnNew.SetCompact(pindexPrev->nBits);
1291 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1292 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1293 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1294 bnNew /= ((nInterval + 1) * nTargetSpacing);
1296 if (bnNew > bnTargetLimit)
1297 bnNew = bnTargetLimit;
1299 return bnNew.GetCompact();
1302 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1305 bnTarget.SetCompact(nBits);
1308 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1309 return error("CheckProofOfWork() : nBits below minimum work");
1311 // Check proof of work matches claimed amount
1312 if (hash > bnTarget.getuint256())
1313 return error("CheckProofOfWork() : hash doesn't match nBits");
1318 // Return maximum amount of blocks that other nodes claim to have
1319 int GetNumBlocksOfPeers()
1321 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1324 bool IsInitialBlockDownload()
1326 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1328 static int64_t nLastUpdate;
1329 static CBlockIndex* pindexLastBest;
1330 auto nCurrentTime = GetTime();
1331 if (pindexBest != pindexLastBest)
1333 pindexLastBest = pindexBest;
1334 nLastUpdate = nCurrentTime;
1336 return (nCurrentTime - nLastUpdate < 10 &&
1337 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1340 void static InvalidChainFound(CBlockIndex* pindexNew)
1342 if (pindexNew->nChainTrust > nBestInvalidTrust)
1344 nBestInvalidTrust = pindexNew->nChainTrust;
1345 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1346 uiInterface.NotifyBlocksChanged();
1349 auto nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1350 auto nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1352 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1353 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1354 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1355 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1356 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1357 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1358 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1359 nBestBlockTrust.Get64(),
1360 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1363 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1365 nTime = max(GetBlockTime(), GetAdjustedTime());
1368 unsigned int CBlock::GetStakeEntropyBit(unsigned int nHeight) const
1370 // Protocol switch to support p2pool at novacoin block #9689
1371 if (nHeight >= 9689 || fTestNet)
1373 // Take last bit of block hash as entropy bit
1374 auto nEntropyBit = (GetHash().Get32()) & (uint32_t)1;
1375 if (fDebug && GetBoolArg("-printstakemodifier"))
1376 printf("GetStakeEntropyBit: nTime=%" PRIu32 " hashBlock=%s nEntropyBit=%" PRIu32 "\n", nTime, GetHash().ToString().c_str(), nEntropyBit);
1380 // Before novacoin block #9689 - get from pregenerated table
1381 int nBitNum = nHeight & 0xFF;
1382 int nItemNum = nHeight / 0xFF;
1384 auto nEntropyBit = ((entropyStore[nItemNum] & (uint256(1) << nBitNum)) >> nBitNum).Get32();
1385 if (fDebug && GetBoolArg("-printstakemodifier"))
1386 printf("GetStakeEntropyBit: from pregenerated table, nHeight=%" PRIu32 " nEntropyBit=%" PRIu32 "\n", nHeight, nEntropyBit);
1390 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1392 // Relinquish previous transactions' spent pointers
1395 for(const CTxIn& txin : vin)
1397 auto prevout = txin.prevout;
1399 // Get prev txindex from disk
1401 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1402 return error("DisconnectInputs() : ReadTxIndex failed");
1404 if (prevout.n >= txindex.vSpent.size())
1405 return error("DisconnectInputs() : prevout.n out of range");
1407 // Mark outpoint as not spent
1408 txindex.vSpent[prevout.n].SetNull();
1411 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1412 return error("DisconnectInputs() : UpdateTxIndex failed");
1416 // Remove transaction from index
1417 // This can fail if a duplicate of this transaction was in a chain that got
1418 // reorganized away. This is only possible if this transaction was completely
1419 // spent, so erasing it would be a no-op anyway.
1420 txdb.EraseTxIndex(*this);
1426 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1427 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1429 // FetchInputs can return false either because we just haven't seen some inputs
1430 // (in which case the transaction should be stored as an orphan)
1431 // or because the transaction is malformed (in which case the transaction should
1432 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1436 return true; // Coinbase transactions have no inputs to fetch.
1438 for (unsigned int i = 0; i < vin.size(); i++)
1440 auto prevout = vin[i].prevout;
1441 if (inputsRet.count(prevout.hash))
1442 continue; // Got it already
1445 CTxIndex& txindex = inputsRet[prevout.hash].first;
1447 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1449 // Get txindex from current proposed changes
1450 txindex = mapTestPool.find(prevout.hash)->second;
1454 // Read txindex from txdb
1455 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1457 if (!fFound && (fBlock || fMiner))
1458 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());
1461 CTransaction& txPrev = inputsRet[prevout.hash].second;
1462 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1464 // Get prev tx from single transactions in memory
1467 if (!mempool.exists(prevout.hash))
1468 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());
1469 txPrev = mempool.lookup(prevout.hash);
1472 txindex.vSpent.resize(txPrev.vout.size());
1476 // Get prev tx from disk
1477 if (!txPrev.ReadFromDisk(txindex.pos))
1478 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1482 // Make sure all prevout.n indexes are valid:
1483 for (unsigned int i = 0; i < vin.size(); i++)
1485 const COutPoint prevout = vin[i].prevout;
1486 assert(inputsRet.count(prevout.hash) != 0);
1487 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1488 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1489 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1491 // Revisit this if/when transaction replacement is implemented and allows
1494 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()));
1501 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1503 auto mi = inputs.find(input.prevout.hash);
1504 if (mi == inputs.end())
1505 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1507 const auto& txPrev = (mi->second).second;
1508 if (input.prevout.n >= txPrev.vout.size())
1509 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1511 return txPrev.vout[input.prevout.n];
1514 int64_t CTransaction::GetValueOut() const
1516 CBigNum nValueOut = 0;
1517 for(const auto& txout : vout)
1519 nValueOut += txout.nValue;
1520 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
1521 throw runtime_error("CTransaction::GetValueOut() : value out of range");
1523 return nValueOut.getint64();
1526 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1531 CBigNum nResult = 0;
1532 for (uint32_t i = 0; i < vin.size(); i++)
1534 const auto& txOut = GetOutputFor(vin[i], inputs);
1535 nResult += txOut.nValue;
1536 if (!MoneyRange(txOut.nValue) || !MoneyRange(nResult))
1537 throw runtime_error("CTransaction::GetValueIn() : value out of range");
1539 return nResult.getint64();
1543 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1548 unsigned int nSigOps = 0;
1549 for (unsigned int i = 0; i < vin.size(); i++)
1551 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1552 if (prevout.scriptPubKey.IsPayToScriptHash())
1553 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1558 bool CScriptCheck::operator()() const {
1559 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1560 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1561 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1565 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, uint32_t nIn, unsigned int flags, int nHashType)
1567 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1570 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1571 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1573 // Take over previous transactions' spent pointers
1574 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1575 // fMiner is true when called from the internal bitcoin miner
1576 // ... both are false when called from CTransaction::AcceptToMemoryPool
1580 int64_t nValueIn = 0;
1582 CBigNum bnValueIn = 0;
1583 for (uint32_t i = 0; i < vin.size(); i++)
1585 auto prevout = vin[i].prevout;
1586 assert(inputs.count(prevout.hash) > 0);
1587 CTxIndex& txindex = inputs[prevout.hash].first;
1588 CTransaction& txPrev = inputs[prevout.hash].second;
1590 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1591 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()));
1593 // If prev is coinbase or coinstake, check that it's matured
1594 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1595 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1596 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1597 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1599 // ppcoin: check transaction timestamp
1600 if (txPrev.nTime > nTime)
1601 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1603 // Check for negative or overflow input values
1604 bnValueIn += txPrev.vout[prevout.n].nValue;
1605 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(bnValueIn))
1606 return DoS(100, error("ConnectInputs() : txin values out of range"));
1608 nValueIn = bnValueIn.getint64();
1612 pvChecks->reserve(vin.size());
1614 // The first loop above does all the inexpensive checks.
1615 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1616 // Helps prevent CPU exhaustion attacks.
1617 for (unsigned int i = 0; i < vin.size(); i++)
1619 auto prevout = vin[i].prevout;
1620 assert(inputs.count(prevout.hash) > 0);
1621 CTxIndex& txindex = inputs[prevout.hash].first;
1622 CTransaction& txPrev = inputs[prevout.hash].second;
1624 // Check for conflicts (double-spend)
1625 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1626 // for an attacker to attempt to split the network.
1627 if (!txindex.vSpent[prevout.n].IsNull())
1628 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());
1630 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1631 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1632 // still computed and checked, and any change will be caught at the next checkpoint.
1636 CScriptCheck check(txPrev, *this, i, flags, 0);
1639 pvChecks->push_back(CScriptCheck());
1640 check.swap(pvChecks->back());
1644 if (flags & STRICT_FLAGS)
1646 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1647 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1649 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1651 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1655 // Mark outpoints as spent
1656 txindex.vSpent[prevout.n] = posThisTx;
1659 if (fBlock || fMiner)
1661 mapTestPool[prevout.hash] = txindex;
1667 if (nTime > Checkpoints::GetLastCheckpointTime())
1669 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1671 // coin stake tx earns reward instead of paying fee
1673 if (!GetCoinAge(txdb, nCoinAge))
1674 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1676 auto nReward = GetValueOut() - nValueIn;
1677 auto nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1679 if (nReward > nCalculatedReward)
1680 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1685 if (nValueIn < GetValueOut())
1686 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1688 // Tally transaction fees
1689 auto nTxFee = nValueIn - GetValueOut();
1690 if (!MoneyRange(nTxFee))
1691 return DoS(100, error("ConnectInputs() : nFees out of range"));
1699 bool CTransaction::ClientConnectInputs()
1704 // Take over previous transactions' spent pointers
1707 CBigNum bnValueIn = 0;
1708 for (uint32_t i = 0; i < vin.size(); i++)
1710 // Get prev tx from single transactions in memory
1711 auto prevout = vin[i].prevout;
1712 if (!mempool.exists(prevout.hash))
1714 CTransaction& txPrev = mempool.lookup(prevout.hash);
1716 if (prevout.n >= txPrev.vout.size())
1720 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1721 return error("ClientConnectInputs() : VerifySignature failed");
1723 ///// this is redundant with the mempool.mapNextTx stuff,
1724 ///// not sure which I want to get rid of
1725 ///// this has to go away now that posNext is gone
1726 // // Check for conflicts
1727 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1728 // return error("ConnectInputs() : prev tx already used");
1730 // // Flag outpoints as used
1731 // txPrev.vout[prevout.n].posNext = posThisTx;
1733 bnValueIn += txPrev.vout[prevout.n].nValue;
1735 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(bnValueIn))
1736 return error("ClientConnectInputs() : txin values out of range");
1738 if (GetValueOut() > bnValueIn.getint64())
1745 int64_t CBlock::GetMaxTransactionTime() const
1747 int64_t maxTransactionTime = 0;
1748 for(const auto& tx : vtx)
1749 maxTransactionTime = max(maxTransactionTime, (int64_t)tx.nTime);
1750 return maxTransactionTime;
1753 uint256 CBlock::BuildMerkleTree() const
1755 vMerkleTree.clear();
1756 for(const auto& tx : vtx)
1757 vMerkleTree.push_back(tx.GetHash());
1759 for (int nSize = (int)vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
1761 for (int i = 0; i < nSize; i += 2)
1763 int i2 = min(i+1, nSize-1);
1764 vMerkleTree.push_back(Hash(vMerkleTree[j+i].begin(), vMerkleTree[j+i].end(),
1765 vMerkleTree[j+i2].begin(), vMerkleTree[j+i2].end()));
1769 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
1772 vector<uint256> CBlock::GetMerkleBranch(int nIndex) const
1774 if (vMerkleTree.empty())
1776 vector<uint256> vMerkleBranch;
1778 for (int nSize = (int)vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
1780 int i = min(nIndex^1, nSize-1);
1781 vMerkleBranch.push_back(vMerkleTree[j+i]);
1785 return vMerkleBranch;
1788 uint256 CBlock::CheckMerkleBranch(uint256 hash, const vector<uint256>& vMerkleBranch, int nIndex)
1792 for(const uint256& otherside : vMerkleBranch)
1795 hash = Hash(otherside.begin(), otherside.end(), hash.begin(), hash.end());
1797 hash = Hash(hash.begin(), hash.end(), otherside.begin(), otherside.end());
1803 bool CBlock::WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
1805 // Open history file to append
1806 auto fileout = CAutoFile(AppendBlockFile(nFileRet), SER_DISK, CLIENT_VERSION);
1808 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
1810 // Write index header
1811 unsigned int nSize = fileout.GetSerializeSize(*this);
1812 fileout << nNetworkID << nSize;
1815 long fileOutPos = ftell(fileout);
1817 return error("CBlock::WriteToDisk() : ftell failed");
1818 nBlockPosRet = fileOutPos;
1821 // Flush stdio buffers and commit to disk before returning
1823 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
1824 FileCommit(fileout);
1829 bool CBlock::ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions)
1833 // Open history file to read
1834 auto filein = CAutoFile(OpenBlockFile(nFile, nBlockPos, "rb"), SER_DISK, CLIENT_VERSION);
1836 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
1837 if (!fReadTransactions)
1838 filein.nType |= SER_BLOCKHEADERONLY;
1844 catch (const std::exception&) {
1845 return error("%s() : deserialize or I/O error", BOOST_CURRENT_FUNCTION);
1849 if (fReadTransactions && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
1850 return error("CBlock::ReadFromDisk() : errors in block header");
1855 void CBlock::print() const
1857 printf("CBlock(hash=%s, ver=%" PRId32 ", hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%" PRIu32 ", nBits=%08x, nNonce=%" PRIu32 ", vtx=%" PRIszu ", vchBlockSig=%s)\n",
1858 GetHash().ToString().c_str(),
1860 hashPrevBlock.ToString().c_str(),
1861 hashMerkleRoot.ToString().c_str(),
1862 nTime, nBits, nNonce,
1864 HexStr(vchBlockSig.begin(), vchBlockSig.end()).c_str());
1865 for (unsigned int i = 0; i < vtx.size(); i++)
1870 printf(" vMerkleTree: ");
1871 for (unsigned int i = 0; i < vMerkleTree.size(); i++)
1872 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
1876 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1878 // Disconnect in reverse order
1879 for (int i = vtx.size()-1; i >= 0; i--)
1880 if (!vtx[i].DisconnectInputs(txdb))
1883 // Update block index on disk without changing it in memory.
1884 // The memory index structure will be changed after the db commits.
1887 CDiskBlockIndex blockindexPrev(pindex->pprev);
1888 blockindexPrev.hashNext = 0;
1889 if (!txdb.WriteBlockIndex(blockindexPrev))
1890 return error("DisconnectBlock() : WriteBlockIndex failed");
1893 // ppcoin: clean up wallet after disconnecting coinstake
1894 for(CTransaction& tx : vtx)
1895 SyncWithWallets(tx, this, false, false);
1900 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1902 void ThreadScriptCheck(void*) {
1903 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1904 RenameThread("novacoin-scriptch");
1905 scriptcheckqueue.Thread();
1906 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1909 void ThreadScriptCheckQuit() {
1910 scriptcheckqueue.Quit();
1913 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1915 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1916 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1919 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1920 // unless those are already completely spent.
1921 // If such overwrites are allowed, coinbases and transactions depending upon those
1922 // can be duplicated to remove the ability to spend the first instance -- even after
1923 // being sent to another address.
1924 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1925 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1926 // already refuses previously-known transaction ids entirely.
1927 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1928 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1929 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1930 // initial block download.
1931 bool fEnforceBIP30 = true; // Always active in NovaCoin
1932 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1934 //// issue here: it doesn't know the version
1935 unsigned int nTxPos;
1937 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1938 // 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
1941 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1943 map<uint256, CTxIndex> mapQueuedChanges;
1944 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1947 int64_t nValueIn = 0;
1948 int64_t nValueOut = 0;
1949 unsigned int nSigOps = 0;
1952 auto hashTx = tx.GetHash();
1954 if (fEnforceBIP30) {
1955 CTxIndex txindexOld;
1956 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1957 for(CDiskTxPos &pos : txindexOld.vSpent)
1963 nSigOps += tx.GetLegacySigOpCount();
1964 if (nSigOps > MAX_BLOCK_SIGOPS)
1965 return DoS(100, error("ConnectBlock() : too many sigops"));
1967 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1969 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1971 MapPrevTx mapInputs;
1972 if (tx.IsCoinBase())
1973 nValueOut += tx.GetValueOut();
1977 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1980 // Add in sigops done by pay-to-script-hash inputs;
1981 // this is to prevent a "rogue miner" from creating
1982 // an incredibly-expensive-to-validate block.
1983 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1984 if (nSigOps > MAX_BLOCK_SIGOPS)
1985 return DoS(100, error("ConnectBlock() : too many sigops"));
1987 auto nTxValueIn = tx.GetValueIn(mapInputs);
1988 auto nTxValueOut = tx.GetValueOut();
1989 nValueIn += nTxValueIn;
1990 nValueOut += nTxValueOut;
1991 if (!tx.IsCoinStake())
1992 nFees += nTxValueIn - nTxValueOut;
1994 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1996 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1997 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1998 // OP_CHECKSEQUENCEVERIFY is senseless without BIP68, so we're going disable it for now.
1999 // nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
2002 std::vector<CScriptCheck> vChecks;
2003 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
2005 control.Add(vChecks);
2008 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
2011 if (!control.Wait())
2012 return DoS(100, false);
2014 if (IsProofOfWork())
2016 auto nBlockReward = GetProofOfWorkReward(nBits, nFees);
2018 // Check coinbase reward
2019 if (vtx[0].GetValueOut() > nBlockReward)
2020 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
2021 vtx[0].GetValueOut(),
2025 // track money supply and mint amount info
2026 pindex->nMint = nValueOut - nValueIn + nFees;
2027 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
2028 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
2029 return error("Connect() : WriteBlockIndex for pindex failed");
2031 // fees are not collected by proof-of-stake miners
2032 // fees are destroyed to compensate the entire network
2033 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
2034 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
2039 // Write queued txindex changes
2040 for (auto mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
2042 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
2043 return error("ConnectBlock() : UpdateTxIndex failed");
2046 // Update block index on disk without changing it in memory.
2047 // The memory index structure will be changed after the db commits.
2050 CDiskBlockIndex blockindexPrev(pindex->pprev);
2051 blockindexPrev.hashNext = pindex->GetBlockHash();
2052 if (!txdb.WriteBlockIndex(blockindexPrev))
2053 return error("ConnectBlock() : WriteBlockIndex failed");
2056 // Watch for transactions paying to me
2057 for(CTransaction& tx : vtx)
2058 SyncWithWallets(tx, this, true);
2064 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
2066 printf("REORGANIZE\n");
2069 CBlockIndex* pfork = pindexBest;
2070 CBlockIndex* plonger = pindexNew;
2071 while (pfork != plonger)
2073 while (plonger->nHeight > pfork->nHeight)
2074 if ((plonger = plonger->pprev) == NULL)
2075 return error("Reorganize() : plonger->pprev is null");
2076 if (pfork == plonger)
2078 if ((pfork = pfork->pprev) == NULL)
2079 return error("Reorganize() : pfork->pprev is null");
2082 // List of what to disconnect
2083 vector<CBlockIndex*> vDisconnect;
2084 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
2085 vDisconnect.push_back(pindex);
2087 // List of what to connect
2088 vector<CBlockIndex*> vConnect;
2089 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
2090 vConnect.push_back(pindex);
2091 reverse(vConnect.begin(), vConnect.end());
2093 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());
2094 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());
2096 // Disconnect shorter branch
2097 vector<CTransaction> vResurrect;
2098 for(CBlockIndex* pindex : vDisconnect)
2101 if (!block.ReadFromDisk(pindex))
2102 return error("Reorganize() : ReadFromDisk for disconnect failed");
2103 if (!block.DisconnectBlock(txdb, pindex))
2104 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
2106 // Queue memory transactions to resurrect
2107 for(const CTransaction& tx : block.vtx)
2108 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
2109 vResurrect.push_back(tx);
2112 // Connect longer branch
2113 vector<CTransaction> vDelete;
2114 for (unsigned int i = 0; i < vConnect.size(); i++)
2116 CBlockIndex* pindex = vConnect[i];
2118 if (!block.ReadFromDisk(pindex))
2119 return error("Reorganize() : ReadFromDisk for connect failed");
2120 if (!block.ConnectBlock(txdb, pindex))
2123 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
2126 // Queue memory transactions to delete
2127 for(const CTransaction& tx : block.vtx)
2128 vDelete.push_back(tx);
2130 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
2131 return error("Reorganize() : WriteHashBestChain failed");
2133 // Make sure it's successfully written to disk before changing memory structure
2134 if (!txdb.TxnCommit())
2135 return error("Reorganize() : TxnCommit failed");
2137 // Disconnect shorter branch
2138 for(CBlockIndex* pindex : vDisconnect)
2140 pindex->pprev->pnext = NULL;
2142 // Connect longer branch
2143 for(CBlockIndex* pindex : vConnect)
2145 pindex->pprev->pnext = pindex;
2147 // Resurrect memory transactions that were in the disconnected branch
2148 for(CTransaction& tx : vResurrect)
2149 tx.AcceptToMemoryPool(txdb, false);
2151 // Delete redundant memory transactions that are in the connected branch
2152 for(CTransaction& tx : vDelete)
2155 printf("REORGANIZE: done\n");
2161 // Called from inside SetBestChain: attaches a block to the new best chain being built
2162 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
2164 auto hash = GetHash();
2166 // Adding to current best branch
2167 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
2170 InvalidChainFound(pindexNew);
2173 if (!txdb.TxnCommit())
2174 return error("SetBestChain() : TxnCommit failed");
2176 // Add to current best branch
2177 pindexNew->pprev->pnext = pindexNew;
2179 // Delete redundant memory transactions
2180 for(CTransaction& tx : vtx)
2186 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
2188 auto hash = GetHash();
2190 if (!txdb.TxnBegin())
2191 return error("SetBestChain() : TxnBegin failed");
2193 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2195 txdb.WriteHashBestChain(hash);
2196 if (!txdb.TxnCommit())
2197 return error("SetBestChain() : TxnCommit failed");
2198 pindexGenesisBlock = pindexNew;
2200 else if (hashPrevBlock == hashBestChain)
2202 if (!SetBestChainInner(txdb, pindexNew))
2203 return error("SetBestChain() : SetBestChainInner failed");
2207 // the first block in the new chain that will cause it to become the new best chain
2208 CBlockIndex *pindexIntermediate = pindexNew;
2210 // list of blocks that need to be connected afterwards
2211 std::vector<CBlockIndex*> vpindexSecondary;
2213 // Reorganize is costly in terms of db load, as it works in a single db transaction.
2214 // Try to limit how much needs to be done inside
2215 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
2217 vpindexSecondary.push_back(pindexIntermediate);
2218 pindexIntermediate = pindexIntermediate->pprev;
2221 if (!vpindexSecondary.empty())
2222 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
2224 // Switch to new best branch
2225 if (!Reorganize(txdb, pindexIntermediate))
2228 InvalidChainFound(pindexNew);
2229 return error("SetBestChain() : Reorganize failed");
2232 // Connect further blocks
2233 for (std::vector<CBlockIndex*>::reverse_iterator rit = vpindexSecondary.rbegin(); rit != vpindexSecondary.rend(); ++rit)
2236 if (!block.ReadFromDisk(*rit))
2238 printf("SetBestChain() : ReadFromDisk failed\n");
2241 if (!txdb.TxnBegin()) {
2242 printf("SetBestChain() : TxnBegin 2 failed\n");
2245 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
2246 if (!block.SetBestChainInner(txdb, *rit))
2251 // Update best block in wallet (so we can detect restored wallets)
2252 bool fIsInitialDownload = IsInitialBlockDownload();
2253 if (!fIsInitialDownload)
2255 const CBlockLocator locator(pindexNew);
2256 ::SetBestChain(locator);
2260 hashBestChain = hash;
2261 pindexBest = pindexNew;
2262 pblockindexFBBHLast = NULL;
2263 nBestHeight = pindexBest->nHeight;
2264 nBestChainTrust = pindexNew->nChainTrust;
2265 nTimeBestReceived = GetTime();
2266 nTransactionsUpdated++;
2268 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2270 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
2271 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2272 CBigNum(nBestChainTrust).ToString().c_str(),
2273 nBestBlockTrust.Get64(),
2274 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2276 // Check the version of the last 100 blocks to see if we need to upgrade:
2277 if (!fIsInitialDownload)
2280 const CBlockIndex* pindex = pindexBest;
2281 for (int i = 0; i < 100 && pindex != NULL; i++)
2283 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2285 pindex = pindex->pprev;
2288 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2289 if (nUpgraded > 100/2)
2290 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2291 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2294 auto strCmd = GetArg("-blocknotify", "");
2296 if (!fIsInitialDownload && !strCmd.empty())
2298 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2299 boost::thread t(runCommand, strCmd); // thread runs free
2305 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2306 // Only those coins meeting minimum age requirement counts. As those
2307 // transactions not in main chain are not currently indexed so we
2308 // might not find out about their coin age. Older transactions are
2309 // guaranteed to be in main chain by sync-checkpoint. This rule is
2310 // introduced to help nodes establish a consistent view of the coin
2311 // age (trust score) of competing branches.
2312 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2314 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2320 for(const CTxIn& txin : vin)
2322 // First try finding the previous transaction in database
2323 CTransaction txPrev;
2325 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2326 continue; // previous transaction not in main chain
2327 if (nTime < txPrev.nTime)
2328 return false; // Transaction timestamp violation
2330 // Read block header
2332 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2333 return false; // unable to read block of previous transaction
2334 if (block.GetBlockTime() + nStakeMinAge > nTime)
2335 continue; // only count coins meeting min age requirement
2337 auto nValueIn = txPrev.vout[txin.prevout.n].nValue;
2338 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2340 if (fDebug && GetBoolArg("-printcoinage"))
2341 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2344 auto bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2345 if (fDebug && GetBoolArg("-printcoinage"))
2346 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2347 nCoinAge = bnCoinDay.getuint64();
2351 // ppcoin: total coin age spent in block, in the unit of coin-days.
2352 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2357 for(const CTransaction& tx : vtx)
2359 uint64_t nTxCoinAge;
2360 if (tx.GetCoinAge(txdb, nTxCoinAge))
2361 nCoinAge += nTxCoinAge;
2366 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2368 if (fDebug && GetBoolArg("-printcoinage"))
2369 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2373 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2375 // Check for duplicate
2376 auto hash = GetHash();
2377 if (mapBlockIndex.count(hash))
2378 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2380 // Construct new block index object
2381 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2383 return error("AddToBlockIndex() : new CBlockIndex failed");
2384 pindexNew->phashBlock = &hash;
2385 auto miPrev = mapBlockIndex.find(hashPrevBlock);
2386 if (miPrev != mapBlockIndex.end())
2388 pindexNew->pprev = (*miPrev).second;
2389 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2392 // ppcoin: compute chain trust score
2393 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2395 // ppcoin: compute stake entropy bit for stake modifier
2396 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2397 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2399 // ppcoin: record proof-of-stake hash value
2400 if (pindexNew->IsProofOfStake())
2402 if (!mapProofOfStake.count(hash))
2403 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2404 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2407 // ppcoin: compute stake modifier
2408 uint64_t nStakeModifier = 0;
2409 bool fGeneratedStakeModifier = false;
2410 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2411 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2412 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2413 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2414 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2415 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2417 // Add to mapBlockIndex
2418 auto mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2419 if (pindexNew->IsProofOfStake())
2420 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2421 pindexNew->phashBlock = &((*mi).first);
2423 // Write to disk block index
2425 if (!txdb.TxnBegin())
2427 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2428 if (!txdb.TxnCommit())
2432 if (pindexNew->nChainTrust > nBestChainTrust)
2433 if (!SetBestChain(txdb, pindexNew))
2436 if (pindexNew == pindexBest)
2438 // Notify UI to display prev block's coinbase if it was ours
2439 static uint256 hashPrevBestCoinBase;
2440 UpdatedTransaction(hashPrevBestCoinBase);
2441 hashPrevBestCoinBase = vtx[0].GetHash();
2444 static int8_t counter = 0;
2445 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2446 uiInterface.NotifyBlocksChanged();
2453 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2455 // These are checks that are independent of context
2456 // that can be verified before saving an orphan block.
2458 set<uint256> uniqueTx; // tx hashes
2459 unsigned int nSigOps = 0; // total sigops
2462 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2463 return DoS(100, error("CheckBlock() : size limits failed"));
2465 bool fProofOfStake = IsProofOfStake();
2467 // First transaction must be coinbase, the rest must not be
2468 if (!vtx[0].IsCoinBase())
2469 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2471 if (!vtx[0].CheckTransaction())
2472 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2474 uniqueTx.insert(vtx[0].GetHash());
2475 nSigOps += vtx[0].GetLegacySigOpCount();
2479 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2480 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2482 // nNonce must be zero for proof-of-stake blocks
2484 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2486 // Coinbase output should be empty if proof-of-stake block
2487 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2488 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2490 // Check coinstake timestamp
2491 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2492 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2494 // NovaCoin: check proof-of-stake block signature
2495 if (fCheckSig && !CheckBlockSignature())
2496 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2498 if (!vtx[1].CheckTransaction())
2499 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2501 uniqueTx.insert(vtx[1].GetHash());
2502 nSigOps += vtx[1].GetLegacySigOpCount();
2506 // Check proof of work matches claimed amount
2507 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2508 return DoS(50, error("CheckBlock() : proof of work failed"));
2511 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2512 return error("CheckBlock() : block timestamp too far in the future");
2514 // Check coinbase timestamp
2515 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2516 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2519 // Iterate all transactions starting from second for proof-of-stake block
2520 // or first for proof-of-work block
2521 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2523 const CTransaction& tx = vtx[i];
2525 // Reject coinbase transactions at non-zero index
2526 if (tx.IsCoinBase())
2527 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2529 // Reject coinstake transactions at index != 1
2530 if (tx.IsCoinStake())
2531 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2533 // Check transaction timestamp
2534 if (GetBlockTime() < (int64_t)tx.nTime)
2535 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2537 // Check transaction consistency
2538 if (!tx.CheckTransaction())
2539 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2541 // Add transaction hash into list of unique transaction IDs
2542 uniqueTx.insert(tx.GetHash());
2544 // Calculate sigops count
2545 nSigOps += tx.GetLegacySigOpCount();
2548 // Check for duplicate txids. This is caught by ConnectInputs(),
2549 // but catching it earlier avoids a potential DoS attack:
2550 if (uniqueTx.size() != vtx.size())
2551 return DoS(100, error("CheckBlock() : duplicate transaction"));
2553 // Reject block if validation would consume too much resources.
2554 if (nSigOps > MAX_BLOCK_SIGOPS)
2555 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2557 // Check merkle root
2558 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2559 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2564 bool CBlock::AcceptBlock()
2566 // Check for duplicate
2567 auto hash = GetHash();
2568 if (mapBlockIndex.count(hash))
2569 return error("AcceptBlock() : block already in mapBlockIndex");
2571 // Get prev block index
2572 auto mi = mapBlockIndex.find(hashPrevBlock);
2573 if (mi == mapBlockIndex.end())
2574 return DoS(10, error("AcceptBlock() : prev block not found"));
2575 CBlockIndex* pindexPrev = (*mi).second;
2576 int nHeight = pindexPrev->nHeight+1;
2578 // Check proof-of-work or proof-of-stake
2579 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2580 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2582 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2583 int nMaxOffset = 12 * nOneHour; // 12 hours
2584 if (fTestNet || pindexPrev->nTime < 1450569600)
2585 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2587 // Check timestamp against prev
2588 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2589 return error("AcceptBlock() : block's timestamp is too early");
2591 // Don't accept blocks with future timestamps
2592 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2593 return error("AcceptBlock() : block's timestamp is too far in the future");
2595 // Check that all transactions are finalized
2596 for(const CTransaction& tx : vtx)
2597 if (!tx.IsFinal(nHeight, GetBlockTime()))
2598 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2600 // Check that the block chain matches the known block chain up to a checkpoint
2601 if (!Checkpoints::CheckHardened(nHeight, hash))
2602 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2604 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2606 // Check that the block satisfies synchronized checkpoint
2607 if (CheckpointsMode == Checkpoints::CP_STRICT && !cpSatisfies)
2608 return error("AcceptBlock() : rejected by synchronized checkpoint");
2610 if (CheckpointsMode == Checkpoints::CP_ADVISORY && !cpSatisfies)
2611 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2613 // Enforce rule that the coinbase starts with serialized block height
2614 auto expect = CScript() << nHeight;
2615 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2616 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2617 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2619 // Write block to history file
2620 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2621 return error("AcceptBlock() : out of disk space");
2622 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2623 unsigned int nBlockPos = 0;
2624 if (!WriteToDisk(nFile, nBlockPos))
2625 return error("AcceptBlock() : WriteToDisk failed");
2626 if (!AddToBlockIndex(nFile, nBlockPos))
2627 return error("AcceptBlock() : AddToBlockIndex failed");
2629 // Relay inventory, but don't relay old inventory during initial block download
2630 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2631 if (hashBestChain == hash)
2634 for(CNode* pnode : vNodes)
2635 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2636 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2639 // ppcoin: check pending sync-checkpoint
2640 Checkpoints::AcceptPendingSyncCheckpoint();
2645 uint256 CBlockIndex::GetBlockTrust() const
2648 bnTarget.SetCompact(nBits);
2653 // Return 1 for the first 12 blocks
2654 if (pprev == NULL || pprev->nHeight < 12)
2657 const CBlockIndex* currentIndex = pprev;
2659 if(IsProofOfStake())
2661 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2663 // Return 1/3 of score if parent block is not the PoW block
2664 if (!pprev->IsProofOfWork())
2665 return (bnNewTrust / 3).getuint256();
2669 // Check last 12 blocks type
2670 while (pprev->nHeight - currentIndex->nHeight < 12)
2672 if (currentIndex->IsProofOfWork())
2674 currentIndex = currentIndex->pprev;
2677 // Return 1/3 of score if less than 3 PoW blocks found
2679 return (bnNewTrust / 3).getuint256();
2681 return bnNewTrust.getuint256();
2685 // Calculate work amount for block
2686 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2688 // Set nPowTrust to 1 if PoW difficulty is too low
2692 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2694 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2695 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2696 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2700 // Check last 12 blocks type
2701 while (pprev->nHeight - currentIndex->nHeight < 12)
2703 if (currentIndex->IsProofOfStake())
2705 currentIndex = currentIndex->pprev;
2708 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2710 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2712 bnTarget.SetCompact(pprev->nBits);
2717 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2719 // Return nPoWTrust + full trust score for previous block nBits
2720 return (bnPoWTrust + bnNewTrust).getuint256();
2724 CBlock CBlockIndex::GetBlockHeader() const
2727 block.nVersion = nVersion;
2729 block.hashPrevBlock = pprev->GetBlockHash();
2730 block.hashMerkleRoot = hashMerkleRoot;
2731 block.nTime = nTime;
2732 block.nBits = nBits;
2733 block.nNonce = nNonce;
2737 enum { nMedianTimeSpan=11 };
2739 int64_t CBlockIndex::GetMedianTimePast() const
2741 int64_t pmedian[nMedianTimeSpan];
2742 int64_t* pbegin = &pmedian[nMedianTimeSpan];
2743 int64_t* pend = &pmedian[nMedianTimeSpan];
2744 const CBlockIndex* pindex = this;
2745 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
2746 *(--pbegin) = pindex->GetBlockTime();
2748 return pbegin[(pend - pbegin)/2];
2751 int64_t CBlockIndex::GetMedianTime() const
2753 const CBlockIndex* pindex = this;
2754 for (int i = 0; i < nMedianTimeSpan/2; i++)
2757 return GetBlockTime();
2758 pindex = pindex->pnext;
2760 return pindex->GetMedianTimePast();
2763 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2765 unsigned int nFound = 0;
2766 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2768 if (pstart->nVersion >= minVersion)
2770 pstart = pstart->pprev;
2772 return (nFound >= nRequired);
2775 bool CBlockIndex::SetStakeEntropyBit(unsigned int nEntropyBit)
2777 if (nEntropyBit > 1)
2779 nFlags |= (nEntropyBit? BLOCK_STAKE_ENTROPY : 0);
2783 void CBlockIndex::SetStakeModifier(uint64_t nModifier, bool fGeneratedStakeModifier)
2785 nStakeModifier = nModifier;
2786 if (fGeneratedStakeModifier)
2787 nFlags |= BLOCK_STAKE_MODIFIER;
2790 string CBlockIndex::ToString() const
2792 return strprintf("CBlockIndex(nprev=%p, pnext=%p, nFile=%u, nBlockPos=%-6d nHeight=%d, nMint=%s, nMoneySupply=%s, nFlags=(%s)(%d)(%s), nStakeModifier=%016" PRIx64 ", nStakeModifierChecksum=%08x, hashProofOfStake=%s, prevoutStake=(%s), nStakeTime=%d merkle=%s, hashBlock=%s)",
2793 (const void*)pprev, (const void*)pnext, nFile, nBlockPos, nHeight,
2794 FormatMoney(nMint).c_str(), FormatMoney(nMoneySupply).c_str(),
2795 GeneratedStakeModifier() ? "MOD" : "-", GetStakeEntropyBit(), IsProofOfStake()? "PoS" : "PoW",
2796 nStakeModifier, nStakeModifierChecksum,
2797 hashProofOfStake.ToString().c_str(),
2798 prevoutStake.ToString().c_str(), nStakeTime,
2799 hashMerkleRoot.ToString().c_str(),
2800 GetBlockHash().ToString().c_str());
2803 bool static ReserealizeBlockSignature(CBlock* pblock)
2805 if (pblock->IsProofOfWork())
2807 pblock->vchBlockSig.clear();
2811 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2814 bool static IsCanonicalBlockSignature(CBlock* pblock)
2816 if (pblock->IsProofOfWork())
2817 return pblock->vchBlockSig.empty();
2819 return IsDERSignature(pblock->vchBlockSig);
2822 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2824 // Check for duplicate
2825 auto hash = pblock->GetHash();
2826 if (mapBlockIndex.count(hash))
2827 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2828 if (mapOrphanBlocks.count(hash))
2829 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2831 // Check that block isn't listed as unconditionally banned.
2832 if (!Checkpoints::CheckBanned(hash)) {
2834 pfrom->Misbehaving(100);
2835 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2838 // Check proof-of-stake
2839 // Limited duplicity on stake: prevents block flood attack
2840 // Duplicate stake allowed only when there is orphan child block
2841 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2842 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());
2844 // Strip the garbage from newly received blocks, if we found some
2845 if (!IsCanonicalBlockSignature(pblock)) {
2846 if (!ReserealizeBlockSignature(pblock))
2847 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2850 // Preliminary checks
2851 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2852 return error("ProcessBlock() : CheckBlock FAILED");
2854 // ppcoin: verify hash target and signature of coinstake tx
2855 if (pblock->IsProofOfStake())
2857 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2858 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2860 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2861 return false; // do not error here as we expect this during initial block download
2863 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2864 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2867 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2868 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2870 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2871 auto deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2873 bnNewBlock.SetCompact(pblock->nBits);
2876 if (pblock->IsProofOfStake())
2877 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2879 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2881 if (bnNewBlock > bnRequired)
2884 pfrom->Misbehaving(100);
2885 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2889 // ppcoin: ask for pending sync-checkpoint if any
2890 if (!IsInitialBlockDownload())
2891 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2893 // If don't already have its previous block, shunt it off to holding area until we get it
2894 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2896 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2897 // ppcoin: check proof-of-stake
2898 if (pblock->IsProofOfStake())
2900 // Limited duplicity on stake: prevents block flood attack
2901 // Duplicate stake allowed only when there is orphan child block
2902 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2903 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());
2905 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2907 CBlock* pblock2 = new CBlock(*pblock);
2908 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2909 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2911 // Ask this guy to fill in what we're missing
2914 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2915 // ppcoin: getblocks may not obtain the ancestor block rejected
2916 // earlier by duplicate-stake check so we ask for it again directly
2917 if (!IsInitialBlockDownload())
2918 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2924 if (!pblock->AcceptBlock())
2925 return error("ProcessBlock() : AcceptBlock FAILED");
2927 // Recursively process any orphan blocks that depended on this one
2928 vector<uint256> vWorkQueue;
2929 vWorkQueue.push_back(hash);
2930 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2932 auto hashPrev = vWorkQueue[i];
2933 for (auto mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2934 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2937 CBlock* pblockOrphan = (*mi).second;
2938 if (pblockOrphan->AcceptBlock())
2939 vWorkQueue.push_back(pblockOrphan->GetHash());
2940 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2941 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2942 delete pblockOrphan;
2944 mapOrphanBlocksByPrev.erase(hashPrev);
2947 printf("ProcessBlock: ACCEPTED\n");
2949 // ppcoin: if responsible for sync-checkpoint send it
2950 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2951 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2956 // ppcoin: check block signature
2957 bool CBlock::CheckBlockSignature() const
2959 if (vchBlockSig.empty())
2962 txnouttype whichType;
2963 vector<valtype> vSolutions;
2964 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2967 if (whichType == TX_PUBKEY)
2969 auto& vchPubKey = vSolutions[0];
2970 CPubKey key(vchPubKey);
2973 return key.Verify(GetHash(), vchBlockSig);
2985 uint256 CDiskBlockIndex::GetBlockHash() const
2987 if (fUseFastIndex && blockHash != 0)
2991 block.nVersion = nVersion;
2992 block.hashPrevBlock = hashPrev;
2993 block.hashMerkleRoot = hashMerkleRoot;
2994 block.nTime = nTime;
2995 block.nBits = nBits;
2996 block.nNonce = nNonce;
2998 const_cast<CDiskBlockIndex*>(this)->blockHash = block.GetHash();
3003 string CDiskBlockIndex::ToString() const
3005 string str = "CDiskBlockIndex(";
3006 str += CBlockIndex::ToString();
3007 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
3008 GetBlockHash().ToString().c_str(),
3009 hashPrev.ToString().c_str(),
3010 hashNext.ToString().c_str());
3018 void CBlockLocator::Set(const CBlockIndex* pindex)
3024 vHave.push_back(pindex->GetBlockHash());
3025 // Exponentially larger steps back
3026 for (int i = 0; pindex && i < nStep; i++)
3027 pindex = pindex->pprev;
3028 if (vHave.size() > 10)
3031 vHave.push_back((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
3034 int CBlockLocator::GetDistanceBack()
3036 // Retrace how far back it was in the sender's branch
3039 for(const auto& hash : vHave)
3041 auto mi = mapBlockIndex.find(hash);
3042 if (mi != mapBlockIndex.end())
3044 auto pindex = (*mi).second;
3045 if (pindex->IsInMainChain())
3055 CBlockIndex* CBlockLocator::GetBlockIndex()
3057 // Find the first block the caller has in the main chain
3058 for(const auto& hash : vHave)
3060 auto mi = mapBlockIndex.find(hash);
3061 if (mi != mapBlockIndex.end())
3063 auto pindex = (*mi).second;
3064 if (pindex->IsInMainChain())
3068 return pindexGenesisBlock;
3071 uint256 CBlockLocator::GetBlockHash()
3073 // Find the first block the caller has in the main chain
3074 for(const uint256& hash : vHave)
3076 auto mi = mapBlockIndex.find(hash);
3077 if (mi != mapBlockIndex.end())
3079 auto pindex = (*mi).second;
3080 if (pindex->IsInMainChain())
3084 return (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet);
3087 int CBlockLocator::GetHeight()
3089 CBlockIndex* pindex = GetBlockIndex();
3092 return pindex->nHeight;
3095 bool CheckDiskSpace(uint64_t nAdditionalBytes)
3097 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
3099 // Check for nMinDiskSpace bytes (currently 50MB)
3100 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
3103 string strMessage = _("Warning: Disk space is low!");
3104 strMiscWarning = strMessage;
3105 printf("*** %s\n", strMessage.c_str());
3106 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
3113 static filesystem::path BlockFilePath(unsigned int nFile)
3115 string strBlockFn = strprintf("blk%04u.dat", nFile);
3116 return GetDataDir() / strBlockFn;
3119 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
3121 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
3123 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
3126 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
3128 if (fseek(file, nBlockPos, SEEK_SET) != 0)
3137 static unsigned int nCurrentBlockFile = 1;
3139 FILE* AppendBlockFile(unsigned int& nFileRet)
3144 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
3147 if (fseek(file, 0, SEEK_END) != 0)
3152 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
3153 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
3155 nFileRet = nCurrentBlockFile;
3159 nCurrentBlockFile++;
3163 void UnloadBlockIndex()
3165 mapBlockIndex.clear();
3166 setStakeSeen.clear();
3167 pindexGenesisBlock = NULL;
3169 nBestChainTrust = 0;
3170 nBestInvalidTrust = 0;
3175 bool LoadBlockIndex(bool fAllowNew)
3179 nNetworkID = 0xefc0f2cd;
3181 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
3182 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
3183 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
3184 nCoinbaseMaturity = 10; // test maturity is 10 blocks
3185 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
3192 if (!txdb.LoadBlockIndex())
3196 // Init with genesis block
3198 if (mapBlockIndex.empty())
3207 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
3208 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
3209 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
3211 // vMerkleTree: 4cb33b3b6a
3215 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
3216 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
3217 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
3219 // vMerkleTree: 4cb33b3b6a
3221 const string strTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
3223 txNew.nTime = 1360105017;
3224 txNew.vin.resize(1);
3225 txNew.vout.resize(1);
3226 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>(strTimestamp.begin(), strTimestamp.end());
3227 txNew.vout[0].SetEmpty();
3229 block.vtx.push_back(txNew);
3230 block.hashPrevBlock = 0;
3231 block.hashMerkleRoot = block.BuildMerkleTree();
3233 block.nTime = 1360105017;
3234 block.nBits = bnProofOfWorkLimit.GetCompact();
3235 block.nNonce = !fTestNet ? 1575379 : 46534;
3238 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
3240 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
3241 assert(block.CheckBlock());
3243 // Start new block file
3245 unsigned int nBlockPos;
3246 if (!block.WriteToDisk(nFile, nBlockPos))
3247 return error("LoadBlockIndex() : writing genesis block to disk failed");
3248 if (!block.AddToBlockIndex(nFile, nBlockPos))
3249 return error("LoadBlockIndex() : genesis block not accepted");
3251 // initialize synchronized checkpoint
3252 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
3253 return error("LoadBlockIndex() : failed to init sync checkpoint");
3255 // upgrade time set to zero if txdb initialized
3257 if (!txdb.WriteModifierUpgradeTime(0))
3258 return error("LoadBlockIndex() : failed to init upgrade info");
3259 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
3265 string strPubKey = "";
3266 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
3268 // write checkpoint master key to db
3270 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
3271 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
3272 if (!txdb.TxnCommit())
3273 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
3274 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
3275 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
3278 // upgrade time set to zero if blocktreedb initialized
3279 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
3281 if (nModifierUpgradeTime)
3282 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
3284 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
3288 nModifierUpgradeTime = GetTime();
3289 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
3290 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
3291 return error("LoadBlockIndex() : failed to write upgrade info");
3304 void PrintBlockTree()
3306 // pre-compute tree structure
3307 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
3308 for (auto mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
3310 CBlockIndex* pindex = (*mi).second;
3311 mapNext[pindex->pprev].push_back(pindex);
3313 //while (rand() % 3 == 0)
3314 // mapNext[pindex->pprev].push_back(pindex);
3317 vector<pair<int, CBlockIndex*> > vStack;
3318 vStack.push_back(make_pair(0, pindexGenesisBlock));
3321 while (!vStack.empty())
3323 int nCol = vStack.back().first;
3324 CBlockIndex* pindex = vStack.back().second;
3327 // print split or gap
3328 if (nCol > nPrevCol)
3330 for (int i = 0; i < nCol-1; i++)
3334 else if (nCol < nPrevCol)
3336 for (int i = 0; i < nCol; i++)
3343 for (int i = 0; i < nCol; i++)
3348 block.ReadFromDisk(pindex);
3349 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
3353 block.GetHash().ToString().c_str(),
3355 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
3356 FormatMoney(pindex->nMint).c_str(),
3359 PrintWallets(block);
3361 // put the main time-chain first
3362 vector<CBlockIndex*>& vNext = mapNext[pindex];
3363 for (unsigned int i = 0; i < vNext.size(); i++)
3365 if (vNext[i]->pnext)
3367 swap(vNext[0], vNext[i]);
3373 for (unsigned int i = 0; i < vNext.size(); i++)
3374 vStack.push_back(make_pair(nCol+i, vNext[i]));
3378 bool LoadExternalBlockFile(FILE* fileIn, CClientUIInterface& uiInterface)
3380 auto nStart = GetTimeMillis();
3381 vector<uint8_t> pchData(10 * (8+MAX_BLOCK_SIZE));
3382 int32_t nLoaded = 0;
3386 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
3388 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
3392 fseek(blkdat, nPos, SEEK_SET);
3393 auto nRead = fread(&pchData[0], 1, pchData.size(), blkdat);
3396 nPos = numeric_limits<uint32_t>::max();
3399 auto it = pchData.begin();
3400 while(it != pchData.end() && !fRequestShutdown)
3402 auto nBlockLength = *reinterpret_cast<const uint32_t*>(&(*(it+4)));
3403 auto SeekToNext = [&pchData, &it, &nPos, &nBlockLength]() {
3405 it = search(it+8, pchData.end(), BEGIN(nNetworkID), END(nNetworkID));
3406 if (it != pchData.end())
3407 nPos += (it - previt);
3409 if (nBlockLength > 0)
3411 if (nBlockLength > (uint32_t)distance(it, pchData.end()))
3414 break; // We've reached the end of buffer
3421 vector<unsigned char> vchBlockBytes(it+8, it+8+nBlockLength);
3422 CDataStream blockData(vchBlockBytes, SER_NETWORK, PROTOCOL_VERSION);
3425 catch (const std::exception&)
3427 printf("LoadExternalBlockFile() : Deserialize error caught at the position %" PRIu32 ", this block may be truncated.", nPos);
3431 if (ProcessBlock(NULL, &block))
3433 advance(it, 8 + nBlockLength);
3434 nPos += (8 + nBlockLength);
3436 static int64_t nLastUpdate = 0;
3437 if (GetTimeMillis() - nLastUpdate > 1000)
3439 uiInterface.InitMessage(strprintf(_("%" PRId32 " blocks were read."), nLoaded));
3440 nLastUpdate = GetTimeMillis();
3451 while(!fRequestShutdown);
3454 catch (const std::exception&) {
3455 printf("%s() : I/O error caught during load\n",
3456 BOOST_CURRENT_FUNCTION);
3459 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
3463 //////////////////////////////////////////////////////////////////////////////
3468 extern map<uint256, CAlert> mapAlerts;
3469 extern CCriticalSection cs_mapAlerts;
3471 string GetWarnings(string strFor)
3474 string strStatusBar;
3477 if (GetBoolArg("-testsafemode"))
3480 // Misc warnings like out of disk space and clock is wrong
3481 if (!strMiscWarning.empty())
3484 strStatusBar = strMiscWarning;
3487 // if detected unmet upgrade requirement enter safe mode
3488 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3489 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3492 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3495 // if detected invalid checkpoint enter safe mode
3496 if (Checkpoints::hashInvalidCheckpoint != 0)
3499 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3505 for(auto& item : mapAlerts)
3507 const CAlert& alert = item.second;
3508 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3510 nPriority = alert.nPriority;
3511 strStatusBar = alert.strStatusBar;
3512 if (nPriority > 1000)
3513 strRPC = strStatusBar;
3518 if (strFor == "statusbar")
3519 return strStatusBar;
3520 else if (strFor == "rpc")
3522 assert(!"GetWarnings() : invalid parameter");
3533 //////////////////////////////////////////////////////////////////////////////
3539 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3541 int nType = inv.GetType();
3542 auto nHash = inv.GetHash();
3548 bool txInMap = false;
3551 txInMap = (mempool.exists(nHash));
3554 mapOrphanTransactions.count(nHash) ||
3555 txdb.ContainsTx(nHash);
3559 return mapBlockIndex.count(nHash) ||
3560 mapOrphanBlocks.count(nHash);
3562 // Don't know what it is, just say we already got one
3566 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3568 static map<CService, CPubKey> mapReuseKey;
3569 RandAddSeedPerfmon();
3571 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3572 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3574 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3578 if (strCommand == "version")
3580 // Each connection can only send one version message
3581 if (pfrom->nVersion != 0)
3583 pfrom->Misbehaving(1);
3590 uint64_t nNonce = 1;
3591 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3592 if (pfrom->nVersion < MIN_PROTO_VERSION)
3594 // Since February 20, 2012, the protocol is initiated at version 209,
3595 // and earlier versions are no longer supported
3596 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3597 pfrom->fDisconnect = true;
3601 if (pfrom->nVersion == 10300)
3602 pfrom->nVersion = 300;
3604 vRecv >> addrFrom >> nNonce;
3606 vRecv >> pfrom->strSubVer;
3608 vRecv >> pfrom->nStartingHeight;
3610 if (pfrom->fInbound && addrMe.IsRoutable())
3612 pfrom->addrLocal = addrMe;
3616 // Disconnect if we connected to ourself
3617 if (nNonce == nLocalHostNonce && nNonce > 1)
3619 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3620 pfrom->fDisconnect = true;
3624 if (pfrom->nVersion < 60010)
3626 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3627 pfrom->fDisconnect = true;
3631 // record my external IP reported by peer
3632 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3633 addrSeenByPeer = addrMe;
3635 // Be shy and don't send version until we hear
3636 if (pfrom->fInbound)
3637 pfrom->PushVersion();
3639 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3641 AddTimeData(pfrom->addr, nTime);
3644 pfrom->PushMessage("verack");
3645 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3647 if (!pfrom->fInbound)
3649 // Advertise our address
3650 if (!fNoListen && !IsInitialBlockDownload())
3652 auto addr = GetLocalAddress(&pfrom->addr);
3653 if (addr.IsRoutable())
3654 pfrom->PushAddress(addr);
3657 // Get recent addresses
3658 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3660 pfrom->PushMessage("getaddr");
3661 pfrom->fGetAddr = true;
3663 addrman.Good(pfrom->addr);
3665 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3667 addrman.Add(addrFrom, addrFrom);
3668 addrman.Good(addrFrom);
3672 // Ask the first connected node for block updates
3673 static int nAskedForBlocks = 0;
3674 if (!pfrom->fClient && !pfrom->fOneShot &&
3675 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3676 (pfrom->nVersion < NOBLKS_VERSION_START ||
3677 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3678 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3681 pfrom->PushGetBlocks(pindexBest, uint256(0));
3687 for(auto& item : mapAlerts)
3688 item.second.RelayTo(pfrom);
3691 // Relay sync-checkpoint
3693 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3694 if (!Checkpoints::checkpointMessage.IsNull())
3695 Checkpoints::checkpointMessage.RelayTo(pfrom);
3698 pfrom->fSuccessfullyConnected = true;
3700 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());
3702 cPeerBlockCounts.input(pfrom->nStartingHeight);
3704 // ppcoin: ask for pending sync-checkpoint if any
3705 if (!IsInitialBlockDownload())
3706 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3710 else if (pfrom->nVersion == 0)
3712 // Must have a version message before anything else
3713 pfrom->Misbehaving(1);
3718 else if (strCommand == "verack")
3720 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3724 else if (strCommand == "addr")
3726 vector<CAddress> vAddr;
3729 // Don't want addr from older versions unless seeding
3730 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3732 if (vAddr.size() > 1000)
3734 pfrom->Misbehaving(20);
3735 return error("message addr size() = %" PRIszu "", vAddr.size());
3738 // Store the new addresses
3739 vector<CAddress> vAddrOk;
3740 auto nNow = GetAdjustedTime();
3741 auto nSince = nNow - 10 * 60;
3742 for(CAddress& addr : vAddr)
3746 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3747 addr.nTime = nNow - 5 * nOneDay;
3748 pfrom->AddAddressKnown(addr);
3749 bool fReachable = IsReachable(addr);
3750 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3752 // Relay to a limited number of other nodes
3755 // Use deterministic randomness to send to the same nodes for 24 hours
3756 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3757 static uint256 hashSalt;
3759 hashSalt = GetRandHash();
3760 uint64_t hashAddr = addr.GetHash();
3761 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3762 hashRand = Hash(hashRand.begin(), hashRand.end());
3763 multimap<uint256, CNode*> mapMix;
3764 for(CNode* pnode : vNodes)
3766 if (pnode->nVersion < CADDR_TIME_VERSION)
3768 unsigned int nPointer;
3769 memcpy(&nPointer, &pnode, sizeof(nPointer));
3770 uint256 hashKey = hashRand ^ nPointer;
3771 hashKey = Hash(hashKey.begin(), hashKey.end());
3772 mapMix.insert(make_pair(hashKey, pnode));
3774 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3775 for (auto mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3776 ((*mi).second)->PushAddress(addr);
3779 // Do not store addresses outside our network
3781 vAddrOk.push_back(addr);
3783 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3784 if (vAddr.size() < 1000)
3785 pfrom->fGetAddr = false;
3786 if (pfrom->fOneShot)
3787 pfrom->fDisconnect = true;
3790 else if (strCommand == "inv")
3794 if (vInv.size() > MAX_INV_SZ)
3796 pfrom->Misbehaving(20);
3797 return error("message inv size() = %" PRIszu "", vInv.size());
3800 // find last block in inv vector
3801 int nLastBlock = -1;
3802 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3803 if (vInv[vInv.size() - 1 - nInv].GetType() == MSG_BLOCK) {
3804 nLastBlock = (int) (vInv.size() - 1 - nInv);
3809 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3811 const CInv &inv = vInv[nInv];
3812 int nType = inv.GetType();
3813 auto nHash = inv.GetHash();
3817 pfrom->AddInventoryKnown(inv);
3819 bool fAlreadyHave = AlreadyHave(txdb, inv);
3821 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3825 else if (nType == MSG_BLOCK && mapOrphanBlocks.count(nHash)) {
3826 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[nHash]));
3827 } else if (nType == nLastBlock) {
3828 // In case we are on a very long side-chain, it is possible that we already have
3829 // the last block in an inv bundle sent in response to getblocks. Try to detect
3830 // this situation and push another getblocks to continue.
3831 pfrom->PushGetBlocks(mapBlockIndex[nHash], uint256(0));
3833 printf("force request: %s\n", inv.ToString().c_str());
3836 // Track requests for our stuff
3842 else if (strCommand == "getdata")
3846 if (vInv.size() > MAX_INV_SZ)
3848 pfrom->Misbehaving(20);
3849 return error("message getdata size() = %" PRIszu "", vInv.size());
3852 if (fDebugNet || (vInv.size() != 1))
3853 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3855 for(const CInv& inv : vInv)
3859 if (fDebugNet || (vInv.size() == 1))
3860 printf("received getdata for: %s\n", inv.ToString().c_str());
3862 int nType = inv.GetType();
3863 auto nHash = inv.GetHash();
3865 if (nType == MSG_BLOCK)
3867 // Send block from disk
3868 auto mi = mapBlockIndex.find(nHash);
3869 if (mi != mapBlockIndex.end())
3872 block.ReadFromDisk((*mi).second);
3873 pfrom->PushMessage("block", block);
3875 // Trigger them to send a getblocks request for the next batch of inventory
3876 if (nHash == pfrom->hashContinue)
3878 // ppcoin: send latest proof-of-work block to allow the
3879 // download node to accept as orphan (proof-of-stake
3880 // block might be rejected by stake connection check)
3882 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3883 pfrom->PushMessage("inv", vInv);
3884 pfrom->hashContinue = 0;
3888 else if (inv.IsKnownType())
3890 // Send stream from relay memory
3891 bool pushed = false;
3894 auto mi = mapRelay.find(inv);
3895 if (mi != mapRelay.end()) {
3896 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3900 if (!pushed && nType == MSG_TX) {
3902 if (mempool.exists(nHash)) {
3903 CTransaction tx = mempool.lookup(nHash);
3904 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3907 pfrom->PushMessage("tx", ss);
3912 // Track requests for our stuff
3918 else if (strCommand == "getblocks")
3920 CBlockLocator locator;
3922 vRecv >> locator >> hashStop;
3924 // Find the last block the caller has in the main chain
3925 CBlockIndex* pindex = locator.GetBlockIndex();
3927 // Send the rest of the chain
3929 pindex = pindex->pnext;
3931 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3932 for (; pindex; pindex = pindex->pnext)
3934 if (pindex->GetBlockHash() == hashStop)
3936 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3937 // ppcoin: tell downloading node about the latest block if it's
3938 // without risk being rejected due to stake connection check
3939 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3940 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3943 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3946 // When this block is requested, we'll send an inv that'll make them
3947 // getblocks the next batch of inventory.
3948 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3949 pfrom->hashContinue = pindex->GetBlockHash();
3954 else if (strCommand == "checkpoint")
3956 CSyncCheckpoint checkpoint;
3957 vRecv >> checkpoint;
3959 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3962 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3964 for(CNode* pnode : vNodes)
3965 checkpoint.RelayTo(pnode);
3969 else if (strCommand == "getheaders")
3971 CBlockLocator locator;
3973 vRecv >> locator >> hashStop;
3975 CBlockIndex* pindex = NULL;
3976 if (locator.IsNull())
3978 // If locator is null, return the hashStop block
3979 auto mi = mapBlockIndex.find(hashStop);
3980 if (mi == mapBlockIndex.end())
3982 pindex = (*mi).second;
3986 // Find the last block the caller has in the main chain
3987 pindex = locator.GetBlockIndex();
3989 pindex = pindex->pnext;
3992 vector<CBlock> vHeaders;
3994 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3995 for (; pindex; pindex = pindex->pnext)
3997 vHeaders.push_back(pindex->GetBlockHeader());
3998 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
4001 pfrom->PushMessage("headers", vHeaders);
4005 else if (strCommand == "tx")
4007 vector<uint256> vWorkQueue;
4008 vector<uint256> vEraseQueue;
4009 CDataStream vMsg(vRecv);
4014 CInv inv(MSG_TX, tx.GetHash());
4015 pfrom->AddInventoryKnown(inv);
4017 bool fMissingInputs = false;
4018 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
4020 auto nHash = inv.GetHash();
4022 SyncWithWallets(tx, NULL, true);
4023 RelayTransaction(tx, nHash);
4024 mapAlreadyAskedFor.erase(inv);
4025 vWorkQueue.push_back(nHash);
4026 vEraseQueue.push_back(nHash);
4028 // Recursively process any orphan transactions that depended on this one
4029 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
4031 auto hashPrev = vWorkQueue[i];
4032 for (auto mi = mapOrphanTransactionsByPrev[hashPrev].begin();
4033 mi != mapOrphanTransactionsByPrev[hashPrev].end();
4036 const uint256& orphanTxHash = *mi;
4037 auto& orphanTx = mapOrphanTransactions[orphanTxHash];
4038 bool fMissingInputs2 = false;
4040 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
4042 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
4043 SyncWithWallets(tx, NULL, true);
4044 RelayTransaction(orphanTx, orphanTxHash);
4045 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
4046 vWorkQueue.push_back(orphanTxHash);
4047 vEraseQueue.push_back(orphanTxHash);
4049 else if (!fMissingInputs2)
4052 vEraseQueue.push_back(orphanTxHash);
4053 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
4058 for(uint256 hash : vEraseQueue)
4059 EraseOrphanTx(hash);
4061 else if (fMissingInputs)
4065 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
4066 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
4068 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
4070 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
4074 else if (strCommand == "block")
4078 auto hashBlock = block.GetHash();
4080 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
4083 CInv inv(MSG_BLOCK, hashBlock);
4084 pfrom->AddInventoryKnown(inv);
4086 if (ProcessBlock(pfrom, &block))
4087 mapAlreadyAskedFor.erase(inv);
4088 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
4092 // This asymmetric behavior for inbound and outbound connections was introduced
4093 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
4094 // to users' AddrMan and later request them by sending getaddr messages.
4095 // Making users (which are behind NAT and can only make outgoing connections) ignore
4096 // getaddr message mitigates the attack.
4097 else if ((strCommand == "getaddr") && (pfrom->fInbound))
4099 // Don't return addresses older than nCutOff timestamp
4100 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
4101 pfrom->vAddrToSend.clear();
4102 vector<CAddress> vAddr = addrman.GetAddr();
4103 for(const CAddress &addr : vAddr)
4104 if(addr.nTime > nCutOff)
4105 pfrom->PushAddress(addr);
4109 else if (strCommand == "mempool")
4111 std::vector<uint256> vtxid;
4112 mempool.queryHashes(vtxid);
4114 for (unsigned int i = 0; i < vtxid.size(); i++) {
4115 CInv inv(MSG_TX, vtxid[i]);
4116 vInv.push_back(inv);
4117 if (i == (MAX_INV_SZ - 1))
4120 if (vInv.size() > 0)
4121 pfrom->PushMessage("inv", vInv);
4125 else if (strCommand == "checkorder")
4130 if (!GetBoolArg("-allowreceivebyip"))
4132 pfrom->PushMessage("reply", hashReply, 2, string(""));
4139 /// we have a chance to check the order here
4141 // Keep giving the same key to the same ip until they use it
4142 if (!mapReuseKey.count(pfrom->addr))
4143 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
4145 // Send back approval of order and pubkey to use
4146 CScript scriptPubKey;
4147 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
4148 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
4152 else if (strCommand == "reply")
4157 CRequestTracker tracker;
4159 LOCK(pfrom->cs_mapRequests);
4160 auto mi = pfrom->mapRequests.find(hashReply);
4161 if (mi != pfrom->mapRequests.end())
4163 tracker = (*mi).second;
4164 pfrom->mapRequests.erase(mi);
4167 if (!tracker.IsNull())
4168 tracker.fn(tracker.param1, vRecv);
4172 else if (strCommand == "ping")
4176 // Echo the message back with the nonce. This allows for two useful features:
4178 // 1) A remote node can quickly check if the connection is operational
4179 // 2) Remote nodes can measure the latency of the network thread. If this node
4180 // is overloaded it won't respond to pings quickly and the remote node can
4181 // avoid sending us more work, like chain download requests.
4183 // The nonce stops the remote getting confused between different pings: without
4184 // it, if the remote node sends a ping once per second and this node takes 5
4185 // seconds to respond to each, the 5th ping the remote sends would appear to
4186 // return very quickly.
4187 pfrom->PushMessage("pong", nonce);
4191 else if (strCommand == "alert")
4196 auto alertHash = alert.GetHash();
4197 if (pfrom->setKnown.count(alertHash) == 0)
4199 if (alert.ProcessAlert())
4202 pfrom->setKnown.insert(alertHash);
4205 for(CNode* pnode : vNodes)
4206 alert.RelayTo(pnode);
4210 // Small DoS penalty so peers that send us lots of
4211 // duplicate/expired/invalid-signature/whatever alerts
4212 // eventually get banned.
4213 // This isn't a Misbehaving(100) (immediate ban) because the
4214 // peer might be an older or different implementation with
4215 // a different signature key, etc.
4216 pfrom->Misbehaving(10);
4224 // Ignore unknown commands for extensibility
4228 // Update the last seen time for this node's address
4229 if (pfrom->fNetworkNode)
4230 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
4231 AddressCurrentlyConnected(pfrom->addr);
4237 bool ProcessMessages(CNode* pfrom)
4239 CDataStream& vRecv = pfrom->vRecv;
4243 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
4247 // (4) message start
4256 // Don't bother if send buffer is too full to respond anyway
4257 if (pfrom->vSend.size() >= SendBufferSize())
4260 // Scan for message start
4261 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(nNetworkID), END(nNetworkID));
4262 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
4263 if (vRecv.end() - pstart < nHeaderSize)
4265 if ((int)vRecv.size() > nHeaderSize)
4267 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
4268 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
4272 if (pstart - vRecv.begin() > 0)
4273 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
4274 vRecv.erase(vRecv.begin(), pstart);
4277 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
4282 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
4285 string strCommand = hdr.GetCommand();
4288 unsigned int nMessageSize = hdr.nMessageSize;
4289 if (nMessageSize > MAX_SIZE)
4291 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
4294 if (nMessageSize > vRecv.size())
4296 // Rewind and wait for rest of message
4297 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
4302 auto hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
4303 unsigned int nChecksum = 0;
4304 memcpy(&nChecksum, &hash, sizeof(nChecksum));
4305 if (nChecksum != hdr.nChecksum)
4307 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
4308 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
4312 // Copy message to its own buffer
4313 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
4314 vRecv.ignore(nMessageSize);
4322 fRet = ProcessMessage(pfrom, strCommand, vMsg);
4327 catch (std::ios_base::failure& e)
4329 if (strstr(e.what(), "end of data"))
4331 // Allow exceptions from under-length message on vRecv
4332 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());
4334 else if (strstr(e.what(), "size too large"))
4336 // Allow exceptions from over-long size
4337 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
4341 PrintExceptionContinue(&e, "ProcessMessages()");
4344 catch (std::exception& e) {
4345 PrintExceptionContinue(&e, "ProcessMessages()");
4347 PrintExceptionContinue(NULL, "ProcessMessages()");
4351 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
4359 bool SendMessages(CNode* pto)
4361 TRY_LOCK(cs_main, lockMain);
4363 // Current time in microseconds
4364 auto nNow = GetTimeMicros();
4366 // Don't send anything until we get their version message
4367 if (pto->nVersion == 0)
4370 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
4372 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
4374 pto->PushMessage("ping", nonce);
4378 if (pto->fStartSync) {
4379 pto->fStartSync = false;
4380 pto->PushGetBlocks(pindexBest, uint256(0));
4383 // Resend wallet transactions that haven't gotten in a block yet
4384 ResendWalletTransactions();
4386 // Address refresh broadcast
4387 if (!IsInitialBlockDownload() && pto->nNextLocalAddrSend < nNow) {
4388 AdvertiseLocal(pto);
4389 pto->nNextLocalAddrSend = PoissonNextSend(nNow, nOneDay);
4395 if (pto->nNextAddrSend < nNow) {
4396 pto->nNextAddrSend = PoissonNextSend(nNow, 30);
4397 vector<CAddress> vAddr;
4398 vAddr.reserve(pto->vAddrToSend.size());
4399 for(const CAddress& addr : pto->vAddrToSend)
4401 if (pto->setAddrKnown.insert(addr).second)
4403 vAddr.push_back(addr);
4404 // receiver rejects addr messages larger than 1000
4405 if (vAddr.size() >= 1000)
4407 pto->PushMessage("addr", vAddr);
4412 pto->vAddrToSend.clear();
4414 pto->PushMessage("addr", vAddr);
4418 // Message: inventory
4421 vector<CInv> vInvWait;
4423 bool fSendTrickle = false;
4424 if (pto->nNextInvSend < nNow) {
4425 fSendTrickle = true;
4426 pto->nNextInvSend = PoissonNextSend(nNow, 5);
4428 LOCK(pto->cs_inventory);
4429 vInv.reserve(pto->vInventoryToSend.size());
4430 vInvWait.reserve(pto->vInventoryToSend.size());
4431 for(const CInv& inv : pto->vInventoryToSend)
4433 if (pto->setInventoryKnown.count(inv))
4436 // trickle out tx inv to protect privacy
4437 if (inv.GetType() == MSG_TX && !fSendTrickle)
4439 // 1/4 of tx invs blast to all immediately
4440 static uint256 hashSalt;
4442 hashSalt = GetRandHash();
4443 uint256 hashRand = inv.GetHash() ^ hashSalt;
4444 hashRand = Hash(hashRand.begin(), hashRand.end());
4445 bool fTrickleWait = ((hashRand & 3) != 0);
4449 vInvWait.push_back(inv);
4454 // returns true if wasn't already contained in the set
4455 if (pto->setInventoryKnown.insert(inv).second)
4457 vInv.push_back(inv);
4458 if (vInv.size() >= 1000)
4460 pto->PushMessage("inv", vInv);
4465 pto->vInventoryToSend = vInvWait;
4468 pto->PushMessage("inv", vInv);
4474 vector<CInv> vGetData;
4476 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4478 const CInv& inv = (*pto->mapAskFor.begin()).second;
4479 if (!AlreadyHave(txdb, inv))
4482 printf("sending getdata: %s\n", inv.ToString().c_str());
4483 vGetData.push_back(inv);
4484 if (vGetData.size() >= 1000)
4486 pto->PushMessage("getdata", vGetData);
4489 mapAlreadyAskedFor[inv] = nNow;
4491 pto->mapAskFor.erase(pto->mapAskFor.begin());
4493 if (!vGetData.empty())
4494 pto->PushMessage("getdata", vGetData);
4507 auto it1 = mapBlockIndex.begin();
4508 for (; it1 != mapBlockIndex.end(); it1++)
4509 delete (*it1).second;
4510 mapBlockIndex.clear();
4513 auto it2 = mapOrphanBlocks.begin();
4514 for (; it2 != mapOrphanBlocks.end(); it2++)
4515 delete (*it2).second;
4516 mapOrphanBlocks.clear();
4518 // orphan transactions
4520 } instance_of_cmaincleanup;