1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
12 #include "checkqueue.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
40 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
42 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
44 unsigned int nStakeMinAge = 30 * nOneDay; // 30 days as zero time weight
45 unsigned int nStakeMaxAge = 90 * nOneDay; // 90 days as full weight
46 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
47 unsigned int nModifierInterval = 6 * nOneHour; // time to elapse before new modifier is computed
49 int nCoinbaseMaturity = 500;
51 CBlockIndex* pindexGenesisBlock = NULL;
54 uint256 nBestChainTrust = 0;
55 uint256 nBestInvalidTrust = 0;
57 uint256 hashBestChain = 0;
58 CBlockIndex* pindexBest = NULL;
59 int64_t nTimeBestReceived = 0;
60 int nScriptCheckThreads = 0;
62 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
64 map<uint256, CBlock*> mapOrphanBlocks;
65 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
66 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
67 map<uint256, uint256> mapProofOfStake;
69 map<uint256, CTransaction> mapOrphanTransactions;
70 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
72 // Constant stuff for coinbase transactions we create:
73 CScript COINBASE_FLAGS;
75 const string strMessageMagic = "NovaCoin Signed Message:\n";
78 int64_t nTransactionFee = MIN_TX_FEE;
79 int64_t nMinimumInputValue = MIN_TXOUT_AMOUNT;
81 // Ping and address broadcast intervals
82 int64_t nPingInterval = 30 * 60;
84 extern enum Checkpoints::CPMode CheckpointsMode;
86 //////////////////////////////////////////////////////////////////////////////
88 // dispatching functions
91 // These functions dispatch to one or all registered wallets
94 void RegisterWallet(CWallet* pwalletIn)
97 LOCK(cs_setpwalletRegistered);
98 setpwalletRegistered.insert(pwalletIn);
102 void UnregisterWallet(CWallet* pwalletIn)
105 LOCK(cs_setpwalletRegistered);
106 setpwalletRegistered.erase(pwalletIn);
110 // check whether the passed transaction is from us
111 bool static IsFromMe(CTransaction& tx)
113 for(CWallet* pwallet : setpwalletRegistered)
114 if (pwallet->IsFromMe(tx))
119 // make sure all wallets know about the given transaction, in the given block
120 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
124 // wallets need to refund inputs when disconnecting coinstake
125 if (tx.IsCoinStake())
127 for(CWallet* pwallet : setpwalletRegistered)
128 if (pwallet->IsFromMe(tx))
129 pwallet->DisableTransaction(tx);
134 for(CWallet* pwallet : setpwalletRegistered)
135 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
138 // notify wallets about a new best chain
139 void static SetBestChain(const CBlockLocator& loc)
141 for(CWallet* pwallet : setpwalletRegistered)
142 pwallet->SetBestChain(loc);
145 // notify wallets about an updated transaction
146 void static UpdatedTransaction(const uint256& hashTx)
148 for(CWallet* pwallet : setpwalletRegistered)
149 pwallet->UpdatedTransaction(hashTx);
153 void static PrintWallets(const CBlock& block)
155 for(CWallet* pwallet : setpwalletRegistered)
156 pwallet->PrintWallet(block);
159 // notify wallets about an incoming inventory (for request counts)
160 void static Inventory(const uint256& hash)
162 for(CWallet* pwallet : setpwalletRegistered)
163 pwallet->Inventory(hash);
166 // ask wallets to resend their transactions
167 void ResendWalletTransactions(bool fForceResend)
169 for(CWallet* pwallet : setpwalletRegistered)
170 pwallet->ResendWalletTransactions(fForceResend);
179 //////////////////////////////////////////////////////////////////////////////
181 // mapOrphanTransactions
184 bool AddOrphanTx(const CTransaction& tx)
186 auto hash = tx.GetHash();
187 if (mapOrphanTransactions.count(hash))
190 // Ignore big transactions, to avoid a
191 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
192 // large transaction with a missing parent then we assume
193 // it will rebroadcast it later, after the parent transaction(s)
194 // have been mined or received.
195 // 10,000 orphans, each of which is at most 5,000 bytes big is
196 // at most 500 megabytes of orphans:
198 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
202 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
206 mapOrphanTransactions[hash] = tx;
207 for(const CTxIn& txin : tx.vin)
208 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
210 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
211 mapOrphanTransactions.size());
215 void static EraseOrphanTx(uint256 hash)
217 if (!mapOrphanTransactions.count(hash))
219 const auto& tx = mapOrphanTransactions[hash];
220 for(const auto& txin : tx.vin)
222 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
223 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
224 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
226 mapOrphanTransactions.erase(hash);
229 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
231 unsigned int nEvicted = 0;
232 while (mapOrphanTransactions.size() > nMaxOrphans)
234 // Evict a random orphan:
235 auto randomhash = GetRandHash();
236 auto it = mapOrphanTransactions.lower_bound(randomhash);
237 if (it == mapOrphanTransactions.end())
238 it = mapOrphanTransactions.begin();
239 EraseOrphanTx(it->first);
251 //////////////////////////////////////////////////////////////////////////////
253 // CTransaction and CTxIndex
256 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
259 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
261 if (!ReadFromDisk(txindexRet.pos))
263 if (prevout.n >= vout.size())
271 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
274 return ReadFromDisk(txdb, prevout, txindex);
277 bool CTransaction::ReadFromDisk(COutPoint prevout)
281 return ReadFromDisk(txdb, prevout, txindex);
284 bool CTransaction::IsStandard(string& strReason) const
286 if (nVersion > CTransaction::CURRENT_VERSION)
288 strReason = "version";
292 unsigned int nDataOut = 0;
293 txnouttype whichType;
294 for(const CTxIn& txin : vin)
296 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
297 // keys. (remember the 520 byte limit on redeemScript size) That works
298 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
299 // bytes of scriptSig, which we round off to 1650 bytes for some minor
300 // future-proofing. That's also enough to spend a 20-of-20
301 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
302 // considered standard)
303 if (txin.scriptSig.size() > 1650)
305 strReason = "scriptsig-size";
308 if (!txin.scriptSig.IsPushOnly())
310 strReason = "scriptsig-not-pushonly";
313 if (!txin.scriptSig.HasCanonicalPushes()) {
314 strReason = "txin-scriptsig-not-canonicalpushes";
318 for(const CTxOut& txout : vout) {
319 if (!::IsStandard(txout.scriptPubKey, whichType)) {
320 strReason = "scriptpubkey";
323 if (whichType == TX_NULL_DATA)
326 if (txout.nValue == 0) {
327 strReason = "txout-value=0";
330 if (!txout.scriptPubKey.HasCanonicalPushes()) {
331 strReason = "txout-scriptsig-not-canonicalpushes";
337 // only one OP_RETURN txout is permitted
339 strReason = "multi-op-return";
347 // Check transaction inputs, and make sure any
348 // pay-to-script-hash transactions are evaluating IsStandard scripts
350 // Why bother? To avoid denial-of-service attacks; an attacker
351 // can submit a standard HASH... OP_EQUAL transaction,
352 // which will get accepted into blocks. The redemption
353 // script can be anything; an attacker could use a very
354 // expensive-to-check-upon-redemption script like:
355 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
357 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
360 return true; // Coinbases don't use vin normally
362 for (unsigned int i = 0; i < vin.size(); i++)
364 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
366 vector<vector<unsigned char> > vSolutions;
367 txnouttype whichType;
368 // get the scriptPubKey corresponding to this input:
369 const CScript& prevScript = prev.scriptPubKey;
370 if (!Solver(prevScript, whichType, vSolutions))
372 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
373 if (nArgsExpected < 0)
376 // Transactions with extra stuff in their scriptSigs are
377 // non-standard. Note that this EvalScript() call will
378 // be quick, because if there are any operations
379 // beside "push data" in the scriptSig the
380 // IsStandard() call returns false
381 vector<vector<unsigned char> > stack;
382 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
385 if (whichType == TX_SCRIPTHASH)
389 CScript subscript(stack.back().begin(), stack.back().end());
390 vector<vector<unsigned char> > vSolutions2;
391 txnouttype whichType2;
392 if (!Solver(subscript, whichType2, vSolutions2))
394 if (whichType2 == TX_SCRIPTHASH)
398 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
401 nArgsExpected += tmpExpected;
404 if (stack.size() != (unsigned int)nArgsExpected)
412 CTransaction::GetLegacySigOpCount() const
414 unsigned int nSigOps = 0;
417 // Coinbase scriptsigs are never executed, so there is
418 // no sense in calculation of sigops.
419 for(const CTxIn& txin : vin)
421 nSigOps += txin.scriptSig.GetSigOpCount(false);
424 for(const CTxOut& txout : vout)
426 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
431 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
444 // Load the block this tx is in
446 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
448 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
453 // Update the tx's hashBlock
454 hashBlock = pblock->GetHash();
456 // Locate the transaction
457 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
458 if (pblock->vtx[nIndex] == *(CTransaction*)this)
460 if (nIndex == (int)pblock->vtx.size())
462 vMerkleBranch.clear();
464 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
468 // Fill in merkle branch
469 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
472 // Is the tx in a block that's in the main chain
473 auto mi = mapBlockIndex.find(hashBlock);
474 if (mi == mapBlockIndex.end())
476 const CBlockIndex* pindex = (*mi).second;
477 if (!pindex || !pindex->IsInMainChain())
480 return pindexBest->nHeight - pindex->nHeight + 1;
483 bool CTransaction::CheckTransaction() const
485 // Basic checks that don't depend on any context
487 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
489 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
491 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
492 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
494 // Check for negative or overflow output values
495 int64_t nValueOut = 0;
496 for (unsigned int i = 0; i < vout.size(); i++)
498 const CTxOut& txout = vout[i];
499 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
500 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
502 if (txout.nValue < 0)
503 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
504 if (txout.nValue > MAX_MONEY)
505 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
506 nValueOut += txout.nValue;
507 if (!MoneyRange(nValueOut))
508 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
511 // Check for duplicate inputs
512 set<COutPoint> vInOutPoints;
513 for(const CTxIn& txin : vin)
515 if (vInOutPoints.count(txin.prevout))
517 vInOutPoints.insert(txin.prevout);
522 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
523 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
527 for(const CTxIn& txin : vin)
528 if (txin.prevout.IsNull())
529 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
535 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
537 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
541 // Enforce 0.01 as minimum fee for coinstake
543 nMinRelayTxFee = CENT;
546 // Base fee is either nMinTxFee or nMinRelayTxFee
547 auto nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
549 unsigned int nNewBlockSize = nBlockSize + nBytes;
550 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
556 // Transactions under 1K are free
562 // Free transaction area
563 if (nNewBlockSize < 27000)
568 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
569 // each non empty output which is less than 0.01
571 // It's safe to ignore empty outputs here, because these inputs are allowed
572 // only for coinbase and coinstake transactions.
573 for(const CTxOut& txout : vout)
574 if (txout.nValue < CENT && !txout.IsEmpty())
577 // Raise the price as the block approaches full
578 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
580 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
582 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
585 if (!MoneyRange(nMinFee))
592 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
593 bool* pfMissingInputs)
596 *pfMissingInputs = false;
598 // Time (prevent mempool memory exhaustion attack)
599 if (tx.nTime > FutureDrift(GetAdjustedTime()))
600 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
602 if (!tx.CheckTransaction())
603 return error("CTxMemPool::accept() : CheckTransaction failed");
605 // Coinbase is only valid in a block, not as a loose transaction
607 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
609 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
610 if (tx.IsCoinStake())
611 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
613 // To help v0.1.5 clients who would see it as a negative number
614 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
615 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
617 // Rather not work on nonstandard transactions (unless -testnet)
619 if (!fTestNet && !tx.IsStandard(strNonStd))
620 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
622 // Do we already have it?
623 auto hash = tx.GetHash();
626 if (mapTx.count(hash))
630 if (txdb.ContainsTx(hash))
633 // Check for conflicts with in-memory transactions
634 for (unsigned int i = 0; i < tx.vin.size(); i++)
636 auto outpoint = tx.vin[i].prevout;
637 if (mapNextTx.count(outpoint))
639 // Replacement feature isn't supported by Novacoin.
647 map<uint256, CTxIndex> mapUnused;
648 bool fInvalid = false;
649 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
652 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
654 *pfMissingInputs = true;
658 // Check for non-standard pay-to-script-hash in inputs
659 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
660 return error("CTxMemPool::accept() : nonstandard transaction input");
662 // Note: if you modify this code to accept non-standard transactions, then
663 // you should add code here to check that the transaction does a
664 // reasonable number of ECDSA signature verifications.
666 auto nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
667 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
669 // Don't accept it if it can't get into a block
670 auto txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
671 if (nFees < txMinFee)
672 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
673 hash.ToString().c_str(),
676 // Continuously rate-limit free transactions
677 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
678 // be annoying or make others' transactions take longer to confirm.
679 if (nFees < MIN_RELAY_TX_FEE)
681 static CCriticalSection cs;
682 static double dFreeCount;
683 static int64_t nLastTime;
684 auto nNow = GetTime();
688 // Use an exponentially decaying ~10-minute window:
689 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
691 // -limitfreerelay unit is thousand-bytes-per-minute
692 // At default rate it would take over a month to fill 1GB
693 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
694 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
696 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
701 // Check against previous transactions
702 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
703 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
705 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
709 // Store transaction in memory
712 addUnchecked(hash, tx);
715 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
716 hash.ToString().substr(0,10).c_str(),
721 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
723 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
726 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
728 // Add to memory pool without checking anything. Don't call this directly,
729 // call CTxMemPool::accept to properly check the transaction first.
732 for (unsigned int i = 0; i < tx.vin.size(); i++)
733 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
734 nTransactionsUpdated++;
740 bool CTxMemPool::remove(CTransaction &tx)
742 // Remove transaction from memory pool
745 auto hash = tx.GetHash();
746 if (mapTx.count(hash))
748 for(const CTxIn& txin : tx.vin)
749 mapNextTx.erase(txin.prevout);
751 nTransactionsUpdated++;
757 void CTxMemPool::clear()
762 ++nTransactionsUpdated;
765 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
770 vtxid.reserve(mapTx.size());
771 for (auto mi = mapTx.begin(); mi != mapTx.end(); ++mi)
772 vtxid.push_back((*mi).first);
778 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
780 if (hashBlock == 0 || nIndex == -1)
783 // Find the block it claims to be in
784 auto mi = mapBlockIndex.find(hashBlock);
785 if (mi == mapBlockIndex.end())
787 CBlockIndex* pindex = (*mi).second;
788 if (!pindex || !pindex->IsInMainChain())
791 // Make sure the merkle branch connects to this block
792 if (!fMerkleVerified)
794 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
796 fMerkleVerified = true;
800 return pindexBest->nHeight - pindex->nHeight + 1;
804 int CMerkleTx::GetBlocksToMaturity() const
806 if (!(IsCoinBase() || IsCoinStake()))
808 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
812 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
816 if (!IsInMainChain() && !ClientConnectInputs())
818 return CTransaction::AcceptToMemoryPool(txdb, false);
822 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
826 bool CMerkleTx::AcceptToMemoryPool()
829 return AcceptToMemoryPool(txdb);
834 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
839 // Add previous supporting transactions first
840 for(CMerkleTx& tx : vtxPrev)
842 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
844 auto hash = tx.GetHash();
845 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
846 tx.AcceptToMemoryPool(txdb, fCheckInputs);
849 return AcceptToMemoryPool(txdb, fCheckInputs);
854 bool CWalletTx::AcceptWalletTransaction()
857 return AcceptWalletTransaction(txdb);
860 int CTxIndex::GetDepthInMainChain() const
864 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
866 // Find the block in the index
867 auto mi = mapBlockIndex.find(block.GetHash());
868 if (mi == mapBlockIndex.end())
870 auto pindex = (*mi).second;
871 if (!pindex || !pindex->IsInMainChain())
873 return 1 + nBestHeight - pindex->nHeight;
876 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
877 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
883 if (mempool.exists(hash))
885 tx = mempool.lookup(hash);
891 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
894 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
895 hashBlock = block.GetHash();
909 //////////////////////////////////////////////////////////////////////////////
911 // CBlock and CBlockIndex
914 static CBlockIndex* pblockindexFBBHLast;
915 CBlockIndex* FindBlockByHeight(int nHeight)
917 CBlockIndex *pblockindex;
918 if (nHeight < nBestHeight / 2)
919 pblockindex = pindexGenesisBlock;
921 pblockindex = pindexBest;
922 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
923 pblockindex = pblockindexFBBHLast;
924 while (pblockindex->nHeight > nHeight)
925 pblockindex = pblockindex->pprev;
926 while (pblockindex->nHeight < nHeight)
927 pblockindex = pblockindex->pnext;
928 pblockindexFBBHLast = pblockindex;
932 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
934 if (!fReadTransactions)
936 *this = pindex->GetBlockHeader();
939 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
941 if (GetHash() != pindex->GetBlockHash())
942 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
946 uint256 static GetOrphanRoot(const CBlock* pblock)
948 // Work back to the first block in the orphan chain
949 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
950 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
951 return pblock->GetHash();
954 // ppcoin: find block wanted by given orphan block
955 uint256 WantedByOrphan(const CBlock* pblockOrphan)
957 // Work back to the first block in the orphan chain
958 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
959 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
960 return pblockOrphan->hashPrevBlock;
963 // select stake target limit according to hard-coded conditions
964 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
966 if(fTestNet) // separate proof of stake target limit for testnet
967 return bnProofOfStakeLimit;
968 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
969 return bnProofOfStakeLimit;
970 if(nHeight + 1 > 15000) // 24 bits since block 15000
971 return bnProofOfStakeLegacyLimit;
972 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
973 return bnProofOfStakeHardLimit;
975 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
978 // miner's coin base reward based on nBits
979 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
981 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
984 bnTarget.SetCompact(nBits);
985 CBigNum bnTargetLimit = bnProofOfWorkLimit;
986 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
988 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
989 // A reasonably continuous curve is used to avoid shock to market
990 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
992 // Human readable form:
994 // nSubsidy = 100 / (diff ^ 1/6)
996 // Please note that we're using bisection to find an approximate solutuion
997 CBigNum bnLowerBound = CENT;
998 CBigNum bnUpperBound = bnSubsidyLimit;
999 while (bnLowerBound + CENT <= bnUpperBound)
1001 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1002 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1003 bnUpperBound = bnMidValue;
1005 bnLowerBound = bnMidValue;
1008 int64_t nSubsidy = bnUpperBound.getuint64();
1010 nSubsidy = (nSubsidy / CENT) * CENT;
1011 if (fDebug && GetBoolArg("-printcreation"))
1012 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1014 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1017 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1018 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1020 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1022 // Stage 2 of emission process is mostly PoS-based.
1024 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1026 bnTarget.SetCompact(nBits);
1027 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1028 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1030 // A reasonably continuous curve is used to avoid shock to market
1032 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1033 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1034 bnMidPart, bnRewardPart;
1036 while (bnLowerBound + CENT <= bnUpperBound)
1038 auto bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1041 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1043 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1045 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1048 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1049 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1051 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1052 bnUpperBound = bnMidValue;
1054 bnLowerBound = bnMidValue;
1057 nRewardCoinYear = bnUpperBound.getuint64();
1058 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1061 return nRewardCoinYear;
1063 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1065 // Set reasonable reward limit for large inputs
1067 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1069 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1070 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1072 nSubsidy = min(nSubsidy, nSubsidyLimit);
1074 if (fDebug && GetBoolArg("-printcreation"))
1075 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1080 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1082 // get proof of work blocks max spacing according to hard-coded conditions
1083 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1085 if(nTime > TARGETS_SWITCH_TIME)
1086 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1089 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1091 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1095 // maximum nBits value could possible be required nTime after
1097 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1100 bnResult.SetCompact(nBase);
1102 while (nTime > 0 && bnResult < bnTargetLimit)
1104 // Maximum 200% adjustment per day...
1108 if (bnResult > bnTargetLimit)
1109 bnResult = bnTargetLimit;
1110 return bnResult.GetCompact();
1114 // minimum amount of work that could possibly be required nTime after
1115 // minimum proof-of-work required was nBase
1117 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1119 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1123 // minimum amount of stake that could possibly be required nTime after
1124 // minimum proof-of-stake required was nBase
1126 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1128 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1132 // ppcoin: find last block index up to pindex
1133 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1135 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1136 pindex = pindex->pprev;
1140 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1142 if (pindexLast == NULL)
1143 return bnProofOfWorkLimit.GetCompact(); // genesis block
1145 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1147 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1148 if (pindexPrev->pprev == NULL)
1149 return bnTargetLimit.GetCompact(); // first block
1150 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1151 if (pindexPrevPrev->pprev == NULL)
1152 return bnTargetLimit.GetCompact(); // second block
1154 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1156 // ppcoin: target change every block
1157 // ppcoin: retarget with exponential moving toward target spacing
1159 bnNew.SetCompact(pindexPrev->nBits);
1160 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1161 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1162 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1163 bnNew /= ((nInterval + 1) * nTargetSpacing);
1165 if (bnNew > bnTargetLimit)
1166 bnNew = bnTargetLimit;
1168 return bnNew.GetCompact();
1171 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1174 bnTarget.SetCompact(nBits);
1177 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1178 return error("CheckProofOfWork() : nBits below minimum work");
1180 // Check proof of work matches claimed amount
1181 if (hash > bnTarget.getuint256())
1182 return error("CheckProofOfWork() : hash doesn't match nBits");
1187 // Return maximum amount of blocks that other nodes claim to have
1188 int GetNumBlocksOfPeers()
1190 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1193 bool IsInitialBlockDownload()
1195 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1197 static int64_t nLastUpdate;
1198 static CBlockIndex* pindexLastBest;
1199 auto nCurrentTime = GetTime();
1200 if (pindexBest != pindexLastBest)
1202 pindexLastBest = pindexBest;
1203 nLastUpdate = nCurrentTime;
1205 return (nCurrentTime - nLastUpdate < 10 &&
1206 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1209 void static InvalidChainFound(CBlockIndex* pindexNew)
1211 if (pindexNew->nChainTrust > nBestInvalidTrust)
1213 nBestInvalidTrust = pindexNew->nChainTrust;
1214 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1215 uiInterface.NotifyBlocksChanged();
1218 auto nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1219 auto nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1221 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1222 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1223 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1224 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1225 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1226 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1227 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1228 nBestBlockTrust.Get64(),
1229 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1233 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1235 nTime = max(GetBlockTime(), GetAdjustedTime());
1248 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1250 // Relinquish previous transactions' spent pointers
1253 for(const CTxIn& txin : vin)
1255 auto prevout = txin.prevout;
1257 // Get prev txindex from disk
1259 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1260 return error("DisconnectInputs() : ReadTxIndex failed");
1262 if (prevout.n >= txindex.vSpent.size())
1263 return error("DisconnectInputs() : prevout.n out of range");
1265 // Mark outpoint as not spent
1266 txindex.vSpent[prevout.n].SetNull();
1269 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1270 return error("DisconnectInputs() : UpdateTxIndex failed");
1274 // Remove transaction from index
1275 // This can fail if a duplicate of this transaction was in a chain that got
1276 // reorganized away. This is only possible if this transaction was completely
1277 // spent, so erasing it would be a no-op anyway.
1278 txdb.EraseTxIndex(*this);
1284 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1285 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1287 // FetchInputs can return false either because we just haven't seen some inputs
1288 // (in which case the transaction should be stored as an orphan)
1289 // or because the transaction is malformed (in which case the transaction should
1290 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1294 return true; // Coinbase transactions have no inputs to fetch.
1296 for (unsigned int i = 0; i < vin.size(); i++)
1298 auto prevout = vin[i].prevout;
1299 if (inputsRet.count(prevout.hash))
1300 continue; // Got it already
1303 CTxIndex& txindex = inputsRet[prevout.hash].first;
1305 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1307 // Get txindex from current proposed changes
1308 txindex = mapTestPool.find(prevout.hash)->second;
1312 // Read txindex from txdb
1313 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1315 if (!fFound && (fBlock || fMiner))
1316 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());
1319 CTransaction& txPrev = inputsRet[prevout.hash].second;
1320 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1322 // Get prev tx from single transactions in memory
1325 if (!mempool.exists(prevout.hash))
1326 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());
1327 txPrev = mempool.lookup(prevout.hash);
1330 txindex.vSpent.resize(txPrev.vout.size());
1334 // Get prev tx from disk
1335 if (!txPrev.ReadFromDisk(txindex.pos))
1336 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1340 // Make sure all prevout.n indexes are valid:
1341 for (unsigned int i = 0; i < vin.size(); i++)
1343 const COutPoint prevout = vin[i].prevout;
1344 assert(inputsRet.count(prevout.hash) != 0);
1345 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1346 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1347 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1349 // Revisit this if/when transaction replacement is implemented and allows
1352 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()));
1359 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1361 auto mi = inputs.find(input.prevout.hash);
1362 if (mi == inputs.end())
1363 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1365 const auto& txPrev = (mi->second).second;
1366 if (input.prevout.n >= txPrev.vout.size())
1367 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1369 return txPrev.vout[input.prevout.n];
1372 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1377 int64_t nResult = 0;
1378 for (unsigned int i = 0; i < vin.size(); i++)
1380 nResult += GetOutputFor(vin[i], inputs).nValue;
1386 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1391 unsigned int nSigOps = 0;
1392 for (unsigned int i = 0; i < vin.size(); i++)
1394 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1395 if (prevout.scriptPubKey.IsPayToScriptHash())
1396 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1401 bool CScriptCheck::operator()() const {
1402 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1403 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1404 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1408 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1410 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1413 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1414 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1416 // Take over previous transactions' spent pointers
1417 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1418 // fMiner is true when called from the internal bitcoin miner
1419 // ... both are false when called from CTransaction::AcceptToMemoryPool
1423 int64_t nValueIn = 0;
1425 for (unsigned int i = 0; i < vin.size(); i++)
1427 auto prevout = vin[i].prevout;
1428 assert(inputs.count(prevout.hash) > 0);
1429 CTxIndex& txindex = inputs[prevout.hash].first;
1430 CTransaction& txPrev = inputs[prevout.hash].second;
1432 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1433 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()));
1435 // If prev is coinbase or coinstake, check that it's matured
1436 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1437 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1438 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1439 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1441 // ppcoin: check transaction timestamp
1442 if (txPrev.nTime > nTime)
1443 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1445 // Check for negative or overflow input values
1446 nValueIn += txPrev.vout[prevout.n].nValue;
1447 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1448 return DoS(100, error("ConnectInputs() : txin values out of range"));
1453 pvChecks->reserve(vin.size());
1455 // The first loop above does all the inexpensive checks.
1456 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1457 // Helps prevent CPU exhaustion attacks.
1458 for (unsigned int i = 0; i < vin.size(); i++)
1460 auto prevout = vin[i].prevout;
1461 assert(inputs.count(prevout.hash) > 0);
1462 CTxIndex& txindex = inputs[prevout.hash].first;
1463 CTransaction& txPrev = inputs[prevout.hash].second;
1465 // Check for conflicts (double-spend)
1466 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1467 // for an attacker to attempt to split the network.
1468 if (!txindex.vSpent[prevout.n].IsNull())
1469 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());
1471 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1472 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1473 // still computed and checked, and any change will be caught at the next checkpoint.
1477 CScriptCheck check(txPrev, *this, i, flags, 0);
1480 pvChecks->push_back(CScriptCheck());
1481 check.swap(pvChecks->back());
1485 if (flags & STRICT_FLAGS)
1487 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1488 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1490 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1492 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1496 // Mark outpoints as spent
1497 txindex.vSpent[prevout.n] = posThisTx;
1500 if (fBlock || fMiner)
1502 mapTestPool[prevout.hash] = txindex;
1508 if (nTime > Checkpoints::GetLastCheckpointTime())
1510 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1512 // coin stake tx earns reward instead of paying fee
1514 if (!GetCoinAge(txdb, nCoinAge))
1515 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1517 auto nReward = GetValueOut() - nValueIn;
1518 auto nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1520 if (nReward > nCalculatedReward)
1521 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1526 if (nValueIn < GetValueOut())
1527 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1529 // Tally transaction fees
1530 auto nTxFee = nValueIn - GetValueOut();
1532 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1535 if (!MoneyRange(nFees))
1536 return DoS(100, error("ConnectInputs() : nFees out of range"));
1544 bool CTransaction::ClientConnectInputs()
1549 // Take over previous transactions' spent pointers
1552 int64_t nValueIn = 0;
1553 for (unsigned int i = 0; i < vin.size(); i++)
1555 // Get prev tx from single transactions in memory
1556 auto prevout = vin[i].prevout;
1557 if (!mempool.exists(prevout.hash))
1559 CTransaction& txPrev = mempool.lookup(prevout.hash);
1561 if (prevout.n >= txPrev.vout.size())
1565 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1566 return error("ClientConnectInputs() : VerifySignature failed");
1568 ///// this is redundant with the mempool.mapNextTx stuff,
1569 ///// not sure which I want to get rid of
1570 ///// this has to go away now that posNext is gone
1571 // // Check for conflicts
1572 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1573 // return error("ConnectInputs() : prev tx already used");
1575 // // Flag outpoints as used
1576 // txPrev.vout[prevout.n].posNext = posThisTx;
1578 nValueIn += txPrev.vout[prevout.n].nValue;
1580 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1581 return error("ClientConnectInputs() : txin values out of range");
1583 if (GetValueOut() > nValueIn)
1593 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1595 // Disconnect in reverse order
1596 for (int i = vtx.size()-1; i >= 0; i--)
1597 if (!vtx[i].DisconnectInputs(txdb))
1600 // Update block index on disk without changing it in memory.
1601 // The memory index structure will be changed after the db commits.
1604 CDiskBlockIndex blockindexPrev(pindex->pprev);
1605 blockindexPrev.hashNext = 0;
1606 if (!txdb.WriteBlockIndex(blockindexPrev))
1607 return error("DisconnectBlock() : WriteBlockIndex failed");
1610 // ppcoin: clean up wallet after disconnecting coinstake
1611 for(CTransaction& tx : vtx)
1612 SyncWithWallets(tx, this, false, false);
1617 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1619 void ThreadScriptCheck(void*) {
1620 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1621 RenameThread("novacoin-scriptch");
1622 scriptcheckqueue.Thread();
1623 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1626 void ThreadScriptCheckQuit() {
1627 scriptcheckqueue.Quit();
1630 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1632 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1633 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1636 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1637 // unless those are already completely spent.
1638 // If such overwrites are allowed, coinbases and transactions depending upon those
1639 // can be duplicated to remove the ability to spend the first instance -- even after
1640 // being sent to another address.
1641 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1642 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1643 // already refuses previously-known transaction ids entirely.
1644 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1645 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1646 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1647 // initial block download.
1648 bool fEnforceBIP30 = true; // Always active in NovaCoin
1649 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1651 //// issue here: it doesn't know the version
1652 unsigned int nTxPos;
1654 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1655 // 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
1658 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1660 map<uint256, CTxIndex> mapQueuedChanges;
1661 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1664 int64_t nValueIn = 0;
1665 int64_t nValueOut = 0;
1666 unsigned int nSigOps = 0;
1669 auto hashTx = tx.GetHash();
1671 if (fEnforceBIP30) {
1672 CTxIndex txindexOld;
1673 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1674 for(CDiskTxPos &pos : txindexOld.vSpent)
1680 nSigOps += tx.GetLegacySigOpCount();
1681 if (nSigOps > MAX_BLOCK_SIGOPS)
1682 return DoS(100, error("ConnectBlock() : too many sigops"));
1684 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1686 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1688 MapPrevTx mapInputs;
1689 if (tx.IsCoinBase())
1690 nValueOut += tx.GetValueOut();
1694 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1697 // Add in sigops done by pay-to-script-hash inputs;
1698 // this is to prevent a "rogue miner" from creating
1699 // an incredibly-expensive-to-validate block.
1700 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1701 if (nSigOps > MAX_BLOCK_SIGOPS)
1702 return DoS(100, error("ConnectBlock() : too many sigops"));
1704 auto nTxValueIn = tx.GetValueIn(mapInputs);
1705 auto nTxValueOut = tx.GetValueOut();
1706 nValueIn += nTxValueIn;
1707 nValueOut += nTxValueOut;
1708 if (!tx.IsCoinStake())
1709 nFees += nTxValueIn - nTxValueOut;
1711 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1713 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1714 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1715 // OP_CHECKSEQUENCEVERIFY is senseless without BIP68, so we're going disable it for now.
1716 // nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
1719 std::vector<CScriptCheck> vChecks;
1720 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
1722 control.Add(vChecks);
1725 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1728 if (!control.Wait())
1729 return DoS(100, false);
1731 if (IsProofOfWork())
1733 auto nBlockReward = GetProofOfWorkReward(nBits, nFees);
1735 // Check coinbase reward
1736 if (vtx[0].GetValueOut() > nBlockReward)
1737 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1738 vtx[0].GetValueOut(),
1742 // track money supply and mint amount info
1743 pindex->nMint = nValueOut - nValueIn + nFees;
1744 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1745 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1746 return error("Connect() : WriteBlockIndex for pindex failed");
1748 // fees are not collected by proof-of-stake miners
1749 // fees are destroyed to compensate the entire network
1750 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1751 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1756 // Write queued txindex changes
1757 for (auto mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1759 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1760 return error("ConnectBlock() : UpdateTxIndex failed");
1763 // Update block index on disk without changing it in memory.
1764 // The memory index structure will be changed after the db commits.
1767 CDiskBlockIndex blockindexPrev(pindex->pprev);
1768 blockindexPrev.hashNext = pindex->GetBlockHash();
1769 if (!txdb.WriteBlockIndex(blockindexPrev))
1770 return error("ConnectBlock() : WriteBlockIndex failed");
1773 // Watch for transactions paying to me
1774 for(CTransaction& tx : vtx)
1775 SyncWithWallets(tx, this, true);
1781 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1783 printf("REORGANIZE\n");
1786 CBlockIndex* pfork = pindexBest;
1787 CBlockIndex* plonger = pindexNew;
1788 while (pfork != plonger)
1790 while (plonger->nHeight > pfork->nHeight)
1791 if ((plonger = plonger->pprev) == NULL)
1792 return error("Reorganize() : plonger->pprev is null");
1793 if (pfork == plonger)
1795 if ((pfork = pfork->pprev) == NULL)
1796 return error("Reorganize() : pfork->pprev is null");
1799 // List of what to disconnect
1800 vector<CBlockIndex*> vDisconnect;
1801 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1802 vDisconnect.push_back(pindex);
1804 // List of what to connect
1805 vector<CBlockIndex*> vConnect;
1806 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1807 vConnect.push_back(pindex);
1808 reverse(vConnect.begin(), vConnect.end());
1810 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());
1811 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());
1813 // Disconnect shorter branch
1814 vector<CTransaction> vResurrect;
1815 for(CBlockIndex* pindex : vDisconnect)
1818 if (!block.ReadFromDisk(pindex))
1819 return error("Reorganize() : ReadFromDisk for disconnect failed");
1820 if (!block.DisconnectBlock(txdb, pindex))
1821 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1823 // Queue memory transactions to resurrect
1824 for(const CTransaction& tx : block.vtx)
1825 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1826 vResurrect.push_back(tx);
1829 // Connect longer branch
1830 vector<CTransaction> vDelete;
1831 for (unsigned int i = 0; i < vConnect.size(); i++)
1833 CBlockIndex* pindex = vConnect[i];
1835 if (!block.ReadFromDisk(pindex))
1836 return error("Reorganize() : ReadFromDisk for connect failed");
1837 if (!block.ConnectBlock(txdb, pindex))
1840 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1843 // Queue memory transactions to delete
1844 for(const CTransaction& tx : block.vtx)
1845 vDelete.push_back(tx);
1847 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1848 return error("Reorganize() : WriteHashBestChain failed");
1850 // Make sure it's successfully written to disk before changing memory structure
1851 if (!txdb.TxnCommit())
1852 return error("Reorganize() : TxnCommit failed");
1854 // Disconnect shorter branch
1855 for(CBlockIndex* pindex : vDisconnect)
1857 pindex->pprev->pnext = NULL;
1859 // Connect longer branch
1860 for(CBlockIndex* pindex : vConnect)
1862 pindex->pprev->pnext = pindex;
1864 // Resurrect memory transactions that were in the disconnected branch
1865 for(CTransaction& tx : vResurrect)
1866 tx.AcceptToMemoryPool(txdb, false);
1868 // Delete redundant memory transactions that are in the connected branch
1869 for(CTransaction& tx : vDelete)
1872 printf("REORGANIZE: done\n");
1878 // Called from inside SetBestChain: attaches a block to the new best chain being built
1879 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1881 auto hash = GetHash();
1883 // Adding to current best branch
1884 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1887 InvalidChainFound(pindexNew);
1890 if (!txdb.TxnCommit())
1891 return error("SetBestChain() : TxnCommit failed");
1893 // Add to current best branch
1894 pindexNew->pprev->pnext = pindexNew;
1896 // Delete redundant memory transactions
1897 for(CTransaction& tx : vtx)
1903 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1905 auto hash = GetHash();
1907 if (!txdb.TxnBegin())
1908 return error("SetBestChain() : TxnBegin failed");
1910 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1912 txdb.WriteHashBestChain(hash);
1913 if (!txdb.TxnCommit())
1914 return error("SetBestChain() : TxnCommit failed");
1915 pindexGenesisBlock = pindexNew;
1917 else if (hashPrevBlock == hashBestChain)
1919 if (!SetBestChainInner(txdb, pindexNew))
1920 return error("SetBestChain() : SetBestChainInner failed");
1924 // the first block in the new chain that will cause it to become the new best chain
1925 CBlockIndex *pindexIntermediate = pindexNew;
1927 // list of blocks that need to be connected afterwards
1928 std::vector<CBlockIndex*> vpindexSecondary;
1930 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1931 // Try to limit how much needs to be done inside
1932 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1934 vpindexSecondary.push_back(pindexIntermediate);
1935 pindexIntermediate = pindexIntermediate->pprev;
1938 if (!vpindexSecondary.empty())
1939 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
1941 // Switch to new best branch
1942 if (!Reorganize(txdb, pindexIntermediate))
1945 InvalidChainFound(pindexNew);
1946 return error("SetBestChain() : Reorganize failed");
1949 // Connect further blocks
1950 for (std::vector<CBlockIndex*>::reverse_iterator rit = vpindexSecondary.rbegin(); rit != vpindexSecondary.rend(); ++rit)
1953 if (!block.ReadFromDisk(*rit))
1955 printf("SetBestChain() : ReadFromDisk failed\n");
1958 if (!txdb.TxnBegin()) {
1959 printf("SetBestChain() : TxnBegin 2 failed\n");
1962 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1963 if (!block.SetBestChainInner(txdb, *rit))
1968 // Update best block in wallet (so we can detect restored wallets)
1969 bool fIsInitialDownload = IsInitialBlockDownload();
1970 if (!fIsInitialDownload)
1972 const CBlockLocator locator(pindexNew);
1973 ::SetBestChain(locator);
1977 hashBestChain = hash;
1978 pindexBest = pindexNew;
1979 pblockindexFBBHLast = NULL;
1980 nBestHeight = pindexBest->nHeight;
1981 nBestChainTrust = pindexNew->nChainTrust;
1982 nTimeBestReceived = GetTime();
1983 nTransactionsUpdated++;
1985 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1987 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1988 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1989 CBigNum(nBestChainTrust).ToString().c_str(),
1990 nBestBlockTrust.Get64(),
1991 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1993 // Check the version of the last 100 blocks to see if we need to upgrade:
1994 if (!fIsInitialDownload)
1997 const CBlockIndex* pindex = pindexBest;
1998 for (int i = 0; i < 100 && pindex != NULL; i++)
2000 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2002 pindex = pindex->pprev;
2005 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2006 if (nUpgraded > 100/2)
2007 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2008 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2011 auto strCmd = GetArg("-blocknotify", "");
2013 if (!fIsInitialDownload && !strCmd.empty())
2015 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2016 boost::thread t(runCommand, strCmd); // thread runs free
2022 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2023 // Only those coins meeting minimum age requirement counts. As those
2024 // transactions not in main chain are not currently indexed so we
2025 // might not find out about their coin age. Older transactions are
2026 // guaranteed to be in main chain by sync-checkpoint. This rule is
2027 // introduced to help nodes establish a consistent view of the coin
2028 // age (trust score) of competing branches.
2029 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2031 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2037 for(const CTxIn& txin : vin)
2039 // First try finding the previous transaction in database
2040 CTransaction txPrev;
2042 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2043 continue; // previous transaction not in main chain
2044 if (nTime < txPrev.nTime)
2045 return false; // Transaction timestamp violation
2047 // Read block header
2049 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2050 return false; // unable to read block of previous transaction
2051 if (block.GetBlockTime() + nStakeMinAge > nTime)
2052 continue; // only count coins meeting min age requirement
2054 auto nValueIn = txPrev.vout[txin.prevout.n].nValue;
2055 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2057 if (fDebug && GetBoolArg("-printcoinage"))
2058 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2061 auto bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2062 if (fDebug && GetBoolArg("-printcoinage"))
2063 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2064 nCoinAge = bnCoinDay.getuint64();
2068 // ppcoin: total coin age spent in block, in the unit of coin-days.
2069 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2074 for(const CTransaction& tx : vtx)
2076 uint64_t nTxCoinAge;
2077 if (tx.GetCoinAge(txdb, nTxCoinAge))
2078 nCoinAge += nTxCoinAge;
2083 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2085 if (fDebug && GetBoolArg("-printcoinage"))
2086 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2090 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2092 // Check for duplicate
2093 auto hash = GetHash();
2094 if (mapBlockIndex.count(hash))
2095 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2097 // Construct new block index object
2098 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2100 return error("AddToBlockIndex() : new CBlockIndex failed");
2101 pindexNew->phashBlock = &hash;
2102 auto miPrev = mapBlockIndex.find(hashPrevBlock);
2103 if (miPrev != mapBlockIndex.end())
2105 pindexNew->pprev = (*miPrev).second;
2106 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2109 // ppcoin: compute chain trust score
2110 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2112 // ppcoin: compute stake entropy bit for stake modifier
2113 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2114 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2116 // ppcoin: record proof-of-stake hash value
2117 if (pindexNew->IsProofOfStake())
2119 if (!mapProofOfStake.count(hash))
2120 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2121 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2124 // ppcoin: compute stake modifier
2125 uint64_t nStakeModifier = 0;
2126 bool fGeneratedStakeModifier = false;
2127 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2128 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2129 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2130 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2131 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2132 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2134 // Add to mapBlockIndex
2135 auto mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2136 if (pindexNew->IsProofOfStake())
2137 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2138 pindexNew->phashBlock = &((*mi).first);
2140 // Write to disk block index
2142 if (!txdb.TxnBegin())
2144 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2145 if (!txdb.TxnCommit())
2149 if (pindexNew->nChainTrust > nBestChainTrust)
2150 if (!SetBestChain(txdb, pindexNew))
2153 if (pindexNew == pindexBest)
2155 // Notify UI to display prev block's coinbase if it was ours
2156 static uint256 hashPrevBestCoinBase;
2157 UpdatedTransaction(hashPrevBestCoinBase);
2158 hashPrevBestCoinBase = vtx[0].GetHash();
2161 static int8_t counter = 0;
2162 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2163 uiInterface.NotifyBlocksChanged();
2170 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2172 // These are checks that are independent of context
2173 // that can be verified before saving an orphan block.
2175 set<uint256> uniqueTx; // tx hashes
2176 unsigned int nSigOps = 0; // total sigops
2179 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2180 return DoS(100, error("CheckBlock() : size limits failed"));
2182 bool fProofOfStake = IsProofOfStake();
2184 // First transaction must be coinbase, the rest must not be
2185 if (!vtx[0].IsCoinBase())
2186 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2188 if (!vtx[0].CheckTransaction())
2189 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2191 uniqueTx.insert(vtx[0].GetHash());
2192 nSigOps += vtx[0].GetLegacySigOpCount();
2196 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2197 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2199 // nNonce must be zero for proof-of-stake blocks
2201 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2203 // Coinbase output should be empty if proof-of-stake block
2204 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2205 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2207 // Check coinstake timestamp
2208 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2209 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2211 // NovaCoin: check proof-of-stake block signature
2212 if (fCheckSig && !CheckBlockSignature())
2213 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2215 if (!vtx[1].CheckTransaction())
2216 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2218 uniqueTx.insert(vtx[1].GetHash());
2219 nSigOps += vtx[1].GetLegacySigOpCount();
2223 // Check proof of work matches claimed amount
2224 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2225 return DoS(50, error("CheckBlock() : proof of work failed"));
2228 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2229 return error("CheckBlock() : block timestamp too far in the future");
2231 // Check coinbase timestamp
2232 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2233 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2236 // Iterate all transactions starting from second for proof-of-stake block
2237 // or first for proof-of-work block
2238 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2240 const CTransaction& tx = vtx[i];
2242 // Reject coinbase transactions at non-zero index
2243 if (tx.IsCoinBase())
2244 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2246 // Reject coinstake transactions at index != 1
2247 if (tx.IsCoinStake())
2248 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2250 // Check transaction timestamp
2251 if (GetBlockTime() < (int64_t)tx.nTime)
2252 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2254 // Check transaction consistency
2255 if (!tx.CheckTransaction())
2256 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2258 // Add transaction hash into list of unique transaction IDs
2259 uniqueTx.insert(tx.GetHash());
2261 // Calculate sigops count
2262 nSigOps += tx.GetLegacySigOpCount();
2265 // Check for duplicate txids. This is caught by ConnectInputs(),
2266 // but catching it earlier avoids a potential DoS attack:
2267 if (uniqueTx.size() != vtx.size())
2268 return DoS(100, error("CheckBlock() : duplicate transaction"));
2270 // Reject block if validation would consume too much resources.
2271 if (nSigOps > MAX_BLOCK_SIGOPS)
2272 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2274 // Check merkle root
2275 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2276 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2281 bool CBlock::AcceptBlock()
2283 // Check for duplicate
2284 auto hash = GetHash();
2285 if (mapBlockIndex.count(hash))
2286 return error("AcceptBlock() : block already in mapBlockIndex");
2288 // Get prev block index
2289 auto mi = mapBlockIndex.find(hashPrevBlock);
2290 if (mi == mapBlockIndex.end())
2291 return DoS(10, error("AcceptBlock() : prev block not found"));
2292 CBlockIndex* pindexPrev = (*mi).second;
2293 int nHeight = pindexPrev->nHeight+1;
2295 // Check proof-of-work or proof-of-stake
2296 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2297 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2299 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2300 int nMaxOffset = 12 * nOneHour; // 12 hours
2301 if (fTestNet || pindexPrev->nTime < 1450569600)
2302 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2304 // Check timestamp against prev
2305 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2306 return error("AcceptBlock() : block's timestamp is too early");
2308 // Don't accept blocks with future timestamps
2309 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2310 return error("AcceptBlock() : block's timestamp is too far in the future");
2312 // Check that all transactions are finalized
2313 for(const CTransaction& tx : vtx)
2314 if (!tx.IsFinal(nHeight, GetBlockTime()))
2315 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2317 // Check that the block chain matches the known block chain up to a checkpoint
2318 if (!Checkpoints::CheckHardened(nHeight, hash))
2319 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2321 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2323 // Check that the block satisfies synchronized checkpoint
2324 if (CheckpointsMode == Checkpoints::CP_STRICT && !cpSatisfies)
2325 return error("AcceptBlock() : rejected by synchronized checkpoint");
2327 if (CheckpointsMode == Checkpoints::CP_ADVISORY && !cpSatisfies)
2328 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2330 // Enforce rule that the coinbase starts with serialized block height
2331 auto expect = CScript() << nHeight;
2332 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2333 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2334 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2336 // Write block to history file
2337 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2338 return error("AcceptBlock() : out of disk space");
2339 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2340 unsigned int nBlockPos = 0;
2341 if (!WriteToDisk(nFile, nBlockPos))
2342 return error("AcceptBlock() : WriteToDisk failed");
2343 if (!AddToBlockIndex(nFile, nBlockPos))
2344 return error("AcceptBlock() : AddToBlockIndex failed");
2346 // Relay inventory, but don't relay old inventory during initial block download
2347 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2348 if (hashBestChain == hash)
2351 for(CNode* pnode : vNodes)
2352 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2353 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2356 // ppcoin: check pending sync-checkpoint
2357 Checkpoints::AcceptPendingSyncCheckpoint();
2362 uint256 CBlockIndex::GetBlockTrust() const
2365 bnTarget.SetCompact(nBits);
2370 // Return 1 for the first 12 blocks
2371 if (pprev == NULL || pprev->nHeight < 12)
2374 const CBlockIndex* currentIndex = pprev;
2376 if(IsProofOfStake())
2378 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2380 // Return 1/3 of score if parent block is not the PoW block
2381 if (!pprev->IsProofOfWork())
2382 return (bnNewTrust / 3).getuint256();
2386 // Check last 12 blocks type
2387 while (pprev->nHeight - currentIndex->nHeight < 12)
2389 if (currentIndex->IsProofOfWork())
2391 currentIndex = currentIndex->pprev;
2394 // Return 1/3 of score if less than 3 PoW blocks found
2396 return (bnNewTrust / 3).getuint256();
2398 return bnNewTrust.getuint256();
2402 // Calculate work amount for block
2403 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2405 // Set nPowTrust to 1 if PoW difficulty is too low
2409 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2411 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2412 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2413 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2417 // Check last 12 blocks type
2418 while (pprev->nHeight - currentIndex->nHeight < 12)
2420 if (currentIndex->IsProofOfStake())
2422 currentIndex = currentIndex->pprev;
2425 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2427 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2429 bnTarget.SetCompact(pprev->nBits);
2434 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2436 // Return nPoWTrust + full trust score for previous block nBits
2437 return (bnPoWTrust + bnNewTrust).getuint256();
2441 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2443 unsigned int nFound = 0;
2444 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2446 if (pstart->nVersion >= minVersion)
2448 pstart = pstart->pprev;
2450 return (nFound >= nRequired);
2453 bool static ReserealizeBlockSignature(CBlock* pblock)
2455 if (pblock->IsProofOfWork())
2457 pblock->vchBlockSig.clear();
2461 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2464 bool static IsCanonicalBlockSignature(CBlock* pblock)
2466 if (pblock->IsProofOfWork())
2467 return pblock->vchBlockSig.empty();
2469 return IsDERSignature(pblock->vchBlockSig);
2472 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2474 // Check for duplicate
2475 auto hash = pblock->GetHash();
2476 if (mapBlockIndex.count(hash))
2477 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2478 if (mapOrphanBlocks.count(hash))
2479 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2481 // Check that block isn't listed as unconditionally banned.
2482 if (!Checkpoints::CheckBanned(hash)) {
2484 pfrom->Misbehaving(100);
2485 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2488 // Check proof-of-stake
2489 // Limited duplicity on stake: prevents block flood attack
2490 // Duplicate stake allowed only when there is orphan child block
2491 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2492 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());
2494 // Strip the garbage from newly received blocks, if we found some
2495 if (!IsCanonicalBlockSignature(pblock)) {
2496 if (!ReserealizeBlockSignature(pblock))
2497 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2500 // Preliminary checks
2501 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2502 return error("ProcessBlock() : CheckBlock FAILED");
2504 // ppcoin: verify hash target and signature of coinstake tx
2505 if (pblock->IsProofOfStake())
2507 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2508 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2510 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2511 return false; // do not error here as we expect this during initial block download
2513 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2514 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2517 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2518 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2520 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2521 auto deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2523 bnNewBlock.SetCompact(pblock->nBits);
2526 if (pblock->IsProofOfStake())
2527 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2529 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2531 if (bnNewBlock > bnRequired)
2534 pfrom->Misbehaving(100);
2535 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2539 // ppcoin: ask for pending sync-checkpoint if any
2540 if (!IsInitialBlockDownload())
2541 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2543 // If don't already have its previous block, shunt it off to holding area until we get it
2544 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2546 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2547 // ppcoin: check proof-of-stake
2548 if (pblock->IsProofOfStake())
2550 // Limited duplicity on stake: prevents block flood attack
2551 // Duplicate stake allowed only when there is orphan child block
2552 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2553 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());
2555 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2557 CBlock* pblock2 = new CBlock(*pblock);
2558 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2559 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2561 // Ask this guy to fill in what we're missing
2564 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2565 // ppcoin: getblocks may not obtain the ancestor block rejected
2566 // earlier by duplicate-stake check so we ask for it again directly
2567 if (!IsInitialBlockDownload())
2568 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2574 if (!pblock->AcceptBlock())
2575 return error("ProcessBlock() : AcceptBlock FAILED");
2577 // Recursively process any orphan blocks that depended on this one
2578 vector<uint256> vWorkQueue;
2579 vWorkQueue.push_back(hash);
2580 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2582 auto hashPrev = vWorkQueue[i];
2583 for (auto mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2584 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2587 CBlock* pblockOrphan = (*mi).second;
2588 if (pblockOrphan->AcceptBlock())
2589 vWorkQueue.push_back(pblockOrphan->GetHash());
2590 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2591 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2592 delete pblockOrphan;
2594 mapOrphanBlocksByPrev.erase(hashPrev);
2597 printf("ProcessBlock: ACCEPTED\n");
2599 // ppcoin: if responsible for sync-checkpoint send it
2600 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2601 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2606 // ppcoin: check block signature
2607 bool CBlock::CheckBlockSignature() const
2609 if (vchBlockSig.empty())
2612 txnouttype whichType;
2613 vector<valtype> vSolutions;
2614 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2617 if (whichType == TX_PUBKEY)
2619 auto& vchPubKey = vSolutions[0];
2620 CPubKey key(vchPubKey);
2623 return key.Verify(GetHash(), vchBlockSig);
2629 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2631 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2633 // Check for nMinDiskSpace bytes (currently 50MB)
2634 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2637 string strMessage = _("Warning: Disk space is low!");
2638 strMiscWarning = strMessage;
2639 printf("*** %s\n", strMessage.c_str());
2640 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2647 static filesystem::path BlockFilePath(unsigned int nFile)
2649 string strBlockFn = strprintf("blk%04u.dat", nFile);
2650 return GetDataDir() / strBlockFn;
2653 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2655 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
2657 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2660 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2662 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2671 static unsigned int nCurrentBlockFile = 1;
2673 FILE* AppendBlockFile(unsigned int& nFileRet)
2678 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2681 if (fseek(file, 0, SEEK_END) != 0)
2683 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2684 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2686 nFileRet = nCurrentBlockFile;
2690 nCurrentBlockFile++;
2694 void UnloadBlockIndex()
2696 mapBlockIndex.clear();
2697 setStakeSeen.clear();
2698 pindexGenesisBlock = NULL;
2700 nBestChainTrust = 0;
2701 nBestInvalidTrust = 0;
2706 bool LoadBlockIndex(bool fAllowNew)
2710 nNetworkID = 0xefc0f2cd;
2712 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2713 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
2714 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2715 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2716 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2723 if (!txdb.LoadBlockIndex())
2727 // Init with genesis block
2729 if (mapBlockIndex.empty())
2738 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2739 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2740 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2742 // vMerkleTree: 4cb33b3b6a
2746 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2747 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2748 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2750 // vMerkleTree: 4cb33b3b6a
2752 const string strTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2754 txNew.nTime = 1360105017;
2755 txNew.vin.resize(1);
2756 txNew.vout.resize(1);
2757 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>(strTimestamp.begin(), strTimestamp.end());
2758 txNew.vout[0].SetEmpty();
2760 block.vtx.push_back(txNew);
2761 block.hashPrevBlock = 0;
2762 block.hashMerkleRoot = block.BuildMerkleTree();
2764 block.nTime = 1360105017;
2765 block.nBits = bnProofOfWorkLimit.GetCompact();
2766 block.nNonce = !fTestNet ? 1575379 : 46534;
2769 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2771 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2772 assert(block.CheckBlock());
2774 // Start new block file
2776 unsigned int nBlockPos;
2777 if (!block.WriteToDisk(nFile, nBlockPos))
2778 return error("LoadBlockIndex() : writing genesis block to disk failed");
2779 if (!block.AddToBlockIndex(nFile, nBlockPos))
2780 return error("LoadBlockIndex() : genesis block not accepted");
2782 // initialize synchronized checkpoint
2783 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2784 return error("LoadBlockIndex() : failed to init sync checkpoint");
2786 // upgrade time set to zero if txdb initialized
2788 if (!txdb.WriteModifierUpgradeTime(0))
2789 return error("LoadBlockIndex() : failed to init upgrade info");
2790 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2796 string strPubKey = "";
2797 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2799 // write checkpoint master key to db
2801 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2802 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2803 if (!txdb.TxnCommit())
2804 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2805 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2806 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2809 // upgrade time set to zero if blocktreedb initialized
2810 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2812 if (nModifierUpgradeTime)
2813 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2815 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2819 nModifierUpgradeTime = GetTime();
2820 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2821 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2822 return error("LoadBlockIndex() : failed to write upgrade info");
2835 void PrintBlockTree()
2837 // pre-compute tree structure
2838 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2839 for (auto mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2841 CBlockIndex* pindex = (*mi).second;
2842 mapNext[pindex->pprev].push_back(pindex);
2844 //while (rand() % 3 == 0)
2845 // mapNext[pindex->pprev].push_back(pindex);
2848 vector<pair<int, CBlockIndex*> > vStack;
2849 vStack.push_back(make_pair(0, pindexGenesisBlock));
2852 while (!vStack.empty())
2854 int nCol = vStack.back().first;
2855 CBlockIndex* pindex = vStack.back().second;
2858 // print split or gap
2859 if (nCol > nPrevCol)
2861 for (int i = 0; i < nCol-1; i++)
2865 else if (nCol < nPrevCol)
2867 for (int i = 0; i < nCol; i++)
2874 for (int i = 0; i < nCol; i++)
2879 block.ReadFromDisk(pindex);
2880 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2884 block.GetHash().ToString().c_str(),
2886 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2887 FormatMoney(pindex->nMint).c_str(),
2890 PrintWallets(block);
2892 // put the main time-chain first
2893 vector<CBlockIndex*>& vNext = mapNext[pindex];
2894 for (unsigned int i = 0; i < vNext.size(); i++)
2896 if (vNext[i]->pnext)
2898 swap(vNext[0], vNext[i]);
2904 for (unsigned int i = 0; i < vNext.size(); i++)
2905 vStack.push_back(make_pair(nCol+i, vNext[i]));
2909 bool LoadExternalBlockFile(FILE* fileIn, CClientUIInterface& uiInterface)
2911 auto nStart = GetTimeMillis();
2912 vector<uint8_t> pchData(10 * (8+MAX_BLOCK_SIZE));
2913 int32_t nLoaded = 0;
2917 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2919 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
2923 fseek(blkdat, nPos, SEEK_SET);
2924 auto nRead = fread(&pchData[0], 1, pchData.size(), blkdat);
2927 nPos = numeric_limits<uint32_t>::max();
2930 auto it = pchData.begin();
2931 while(it != pchData.end() && !fRequestShutdown)
2933 auto nBlockLength = *reinterpret_cast<const uint32_t*>(&(*(it+4)));
2934 auto SeekToNext = [&pchData, &it, &nPos, &nBlockLength]() {
2936 it = search(it+8, pchData.end(), BEGIN(nNetworkID), END(nNetworkID));
2937 if (it != pchData.end())
2938 nPos += (it - previt);
2940 if (nBlockLength > 0)
2942 if (nBlockLength > (uint32_t)distance(it, pchData.end()))
2945 break; // We've reached the end of buffer
2952 vector<unsigned char> vchBlockBytes(it+8, it+8+nBlockLength);
2953 CDataStream blockData(vchBlockBytes, SER_NETWORK, PROTOCOL_VERSION);
2956 catch (const std::exception&)
2958 printf("LoadExternalBlockFile() : Deserialize error caught at the position %" PRIu32 ", this block may be truncated.", nPos);
2962 if (ProcessBlock(NULL, &block))
2964 advance(it, 8 + nBlockLength);
2965 nPos += (8 + nBlockLength);
2967 static int64_t nLastUpdate = 0;
2968 if (GetTimeMillis() - nLastUpdate > 1000)
2970 uiInterface.InitMessage(strprintf(_("%" PRId32 " blocks were read."), nLoaded));
2971 nLastUpdate = GetTimeMillis();
2982 while(!fRequestShutdown);
2985 catch (const std::exception&) {
2986 printf("%s() : I/O error caught during load\n",
2987 BOOST_CURRENT_FUNCTION);
2990 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
2994 //////////////////////////////////////////////////////////////////////////////
2999 extern map<uint256, CAlert> mapAlerts;
3000 extern CCriticalSection cs_mapAlerts;
3002 string GetWarnings(string strFor)
3005 string strStatusBar;
3008 if (GetBoolArg("-testsafemode"))
3011 // Misc warnings like out of disk space and clock is wrong
3012 if (!strMiscWarning.empty())
3015 strStatusBar = strMiscWarning;
3018 // if detected unmet upgrade requirement enter safe mode
3019 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3020 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3023 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3026 // if detected invalid checkpoint enter safe mode
3027 if (Checkpoints::hashInvalidCheckpoint != 0)
3030 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3036 for(auto& item : mapAlerts)
3038 const CAlert& alert = item.second;
3039 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3041 nPriority = alert.nPriority;
3042 strStatusBar = alert.strStatusBar;
3043 if (nPriority > 1000)
3044 strRPC = strStatusBar;
3049 if (strFor == "statusbar")
3050 return strStatusBar;
3051 else if (strFor == "rpc")
3053 assert(!"GetWarnings() : invalid parameter");
3064 //////////////////////////////////////////////////////////////////////////////
3070 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3072 int nType = inv.GetType();
3073 auto nHash = inv.GetHash();
3079 bool txInMap = false;
3082 txInMap = (mempool.exists(nHash));
3085 mapOrphanTransactions.count(nHash) ||
3086 txdb.ContainsTx(nHash);
3090 return mapBlockIndex.count(nHash) ||
3091 mapOrphanBlocks.count(nHash);
3093 // Don't know what it is, just say we already got one
3097 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3099 static map<CService, CPubKey> mapReuseKey;
3100 RandAddSeedPerfmon();
3102 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3103 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3105 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3109 if (strCommand == "version")
3111 // Each connection can only send one version message
3112 if (pfrom->nVersion != 0)
3114 pfrom->Misbehaving(1);
3121 uint64_t nNonce = 1;
3122 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3123 if (pfrom->nVersion < MIN_PROTO_VERSION)
3125 // Since February 20, 2012, the protocol is initiated at version 209,
3126 // and earlier versions are no longer supported
3127 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3128 pfrom->fDisconnect = true;
3132 if (pfrom->nVersion == 10300)
3133 pfrom->nVersion = 300;
3135 vRecv >> addrFrom >> nNonce;
3137 vRecv >> pfrom->strSubVer;
3139 vRecv >> pfrom->nStartingHeight;
3141 if (pfrom->fInbound && addrMe.IsRoutable())
3143 pfrom->addrLocal = addrMe;
3147 // Disconnect if we connected to ourself
3148 if (nNonce == nLocalHostNonce && nNonce > 1)
3150 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3151 pfrom->fDisconnect = true;
3155 if (pfrom->nVersion < 60010)
3157 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3158 pfrom->fDisconnect = true;
3162 // record my external IP reported by peer
3163 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3164 addrSeenByPeer = addrMe;
3166 // Be shy and don't send version until we hear
3167 if (pfrom->fInbound)
3168 pfrom->PushVersion();
3170 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3172 AddTimeData(pfrom->addr, nTime);
3175 pfrom->PushMessage("verack");
3176 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3178 if (!pfrom->fInbound)
3180 // Advertise our address
3181 if (!fNoListen && !IsInitialBlockDownload())
3183 auto addr = GetLocalAddress(&pfrom->addr);
3184 if (addr.IsRoutable())
3185 pfrom->PushAddress(addr);
3188 // Get recent addresses
3189 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3191 pfrom->PushMessage("getaddr");
3192 pfrom->fGetAddr = true;
3194 addrman.Good(pfrom->addr);
3196 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3198 addrman.Add(addrFrom, addrFrom);
3199 addrman.Good(addrFrom);
3203 // Ask the first connected node for block updates
3204 static int nAskedForBlocks = 0;
3205 if (!pfrom->fClient && !pfrom->fOneShot &&
3206 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3207 (pfrom->nVersion < NOBLKS_VERSION_START ||
3208 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3209 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3212 pfrom->PushGetBlocks(pindexBest, uint256(0));
3218 for(auto& item : mapAlerts)
3219 item.second.RelayTo(pfrom);
3222 // Relay sync-checkpoint
3224 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3225 if (!Checkpoints::checkpointMessage.IsNull())
3226 Checkpoints::checkpointMessage.RelayTo(pfrom);
3229 pfrom->fSuccessfullyConnected = true;
3231 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());
3233 cPeerBlockCounts.input(pfrom->nStartingHeight);
3235 // ppcoin: ask for pending sync-checkpoint if any
3236 if (!IsInitialBlockDownload())
3237 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3241 else if (pfrom->nVersion == 0)
3243 // Must have a version message before anything else
3244 pfrom->Misbehaving(1);
3249 else if (strCommand == "verack")
3251 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3255 else if (strCommand == "addr")
3257 vector<CAddress> vAddr;
3260 // Don't want addr from older versions unless seeding
3261 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3263 if (vAddr.size() > 1000)
3265 pfrom->Misbehaving(20);
3266 return error("message addr size() = %" PRIszu "", vAddr.size());
3269 // Store the new addresses
3270 vector<CAddress> vAddrOk;
3271 auto nNow = GetAdjustedTime();
3272 auto nSince = nNow - 10 * 60;
3273 for(CAddress& addr : vAddr)
3277 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3278 addr.nTime = nNow - 5 * nOneDay;
3279 pfrom->AddAddressKnown(addr);
3280 bool fReachable = IsReachable(addr);
3281 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3283 // Relay to a limited number of other nodes
3286 // Use deterministic randomness to send to the same nodes for 24 hours
3287 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3288 static uint256 hashSalt;
3290 hashSalt = GetRandHash();
3291 uint64_t hashAddr = addr.GetHash();
3292 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3293 hashRand = Hash(hashRand.begin(), hashRand.end());
3294 multimap<uint256, CNode*> mapMix;
3295 for(CNode* pnode : vNodes)
3297 if (pnode->nVersion < CADDR_TIME_VERSION)
3299 unsigned int nPointer;
3300 memcpy(&nPointer, &pnode, sizeof(nPointer));
3301 uint256 hashKey = hashRand ^ nPointer;
3302 hashKey = Hash(hashKey.begin(), hashKey.end());
3303 mapMix.insert(make_pair(hashKey, pnode));
3305 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3306 for (auto mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3307 ((*mi).second)->PushAddress(addr);
3310 // Do not store addresses outside our network
3312 vAddrOk.push_back(addr);
3314 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3315 if (vAddr.size() < 1000)
3316 pfrom->fGetAddr = false;
3317 if (pfrom->fOneShot)
3318 pfrom->fDisconnect = true;
3321 else if (strCommand == "inv")
3325 if (vInv.size() > MAX_INV_SZ)
3327 pfrom->Misbehaving(20);
3328 return error("message inv size() = %" PRIszu "", vInv.size());
3331 // find last block in inv vector
3332 int nLastBlock = -1;
3333 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3334 if (vInv[vInv.size() - 1 - nInv].GetType() == MSG_BLOCK) {
3335 nLastBlock = (int) (vInv.size() - 1 - nInv);
3340 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3342 const CInv &inv = vInv[nInv];
3343 int nType = inv.GetType();
3344 auto nHash = inv.GetHash();
3348 pfrom->AddInventoryKnown(inv);
3350 bool fAlreadyHave = AlreadyHave(txdb, inv);
3352 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3356 else if (nType == MSG_BLOCK && mapOrphanBlocks.count(nHash)) {
3357 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[nHash]));
3358 } else if (nType == nLastBlock) {
3359 // In case we are on a very long side-chain, it is possible that we already have
3360 // the last block in an inv bundle sent in response to getblocks. Try to detect
3361 // this situation and push another getblocks to continue.
3362 pfrom->PushGetBlocks(mapBlockIndex[nHash], uint256(0));
3364 printf("force request: %s\n", inv.ToString().c_str());
3367 // Track requests for our stuff
3373 else if (strCommand == "getdata")
3377 if (vInv.size() > MAX_INV_SZ)
3379 pfrom->Misbehaving(20);
3380 return error("message getdata size() = %" PRIszu "", vInv.size());
3383 if (fDebugNet || (vInv.size() != 1))
3384 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3386 for(const CInv& inv : vInv)
3390 if (fDebugNet || (vInv.size() == 1))
3391 printf("received getdata for: %s\n", inv.ToString().c_str());
3393 int nType = inv.GetType();
3394 auto nHash = inv.GetHash();
3396 if (nType == MSG_BLOCK)
3398 // Send block from disk
3399 auto mi = mapBlockIndex.find(nHash);
3400 if (mi != mapBlockIndex.end())
3403 block.ReadFromDisk((*mi).second);
3404 pfrom->PushMessage("block", block);
3406 // Trigger them to send a getblocks request for the next batch of inventory
3407 if (nHash == pfrom->hashContinue)
3409 // ppcoin: send latest proof-of-work block to allow the
3410 // download node to accept as orphan (proof-of-stake
3411 // block might be rejected by stake connection check)
3413 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3414 pfrom->PushMessage("inv", vInv);
3415 pfrom->hashContinue = 0;
3419 else if (inv.IsKnownType())
3421 // Send stream from relay memory
3422 bool pushed = false;
3425 auto mi = mapRelay.find(inv);
3426 if (mi != mapRelay.end()) {
3427 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3431 if (!pushed && nType == MSG_TX) {
3433 if (mempool.exists(nHash)) {
3434 CTransaction tx = mempool.lookup(nHash);
3435 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3438 pfrom->PushMessage("tx", ss);
3443 // Track requests for our stuff
3449 else if (strCommand == "getblocks")
3451 CBlockLocator locator;
3453 vRecv >> locator >> hashStop;
3455 // Find the last block the caller has in the main chain
3456 CBlockIndex* pindex = locator.GetBlockIndex();
3458 // Send the rest of the chain
3460 pindex = pindex->pnext;
3462 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3463 for (; pindex; pindex = pindex->pnext)
3465 if (pindex->GetBlockHash() == hashStop)
3467 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3468 // ppcoin: tell downloading node about the latest block if it's
3469 // without risk being rejected due to stake connection check
3470 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3471 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3474 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3477 // When this block is requested, we'll send an inv that'll make them
3478 // getblocks the next batch of inventory.
3479 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3480 pfrom->hashContinue = pindex->GetBlockHash();
3485 else if (strCommand == "checkpoint")
3487 CSyncCheckpoint checkpoint;
3488 vRecv >> checkpoint;
3490 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3493 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3495 for(CNode* pnode : vNodes)
3496 checkpoint.RelayTo(pnode);
3500 else if (strCommand == "getheaders")
3502 CBlockLocator locator;
3504 vRecv >> locator >> hashStop;
3506 CBlockIndex* pindex = NULL;
3507 if (locator.IsNull())
3509 // If locator is null, return the hashStop block
3510 auto mi = mapBlockIndex.find(hashStop);
3511 if (mi == mapBlockIndex.end())
3513 pindex = (*mi).second;
3517 // Find the last block the caller has in the main chain
3518 pindex = locator.GetBlockIndex();
3520 pindex = pindex->pnext;
3523 vector<CBlock> vHeaders;
3525 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3526 for (; pindex; pindex = pindex->pnext)
3528 vHeaders.push_back(pindex->GetBlockHeader());
3529 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3532 pfrom->PushMessage("headers", vHeaders);
3536 else if (strCommand == "tx")
3538 vector<uint256> vWorkQueue;
3539 vector<uint256> vEraseQueue;
3540 CDataStream vMsg(vRecv);
3545 CInv inv(MSG_TX, tx.GetHash());
3546 pfrom->AddInventoryKnown(inv);
3548 bool fMissingInputs = false;
3549 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3551 auto nHash = inv.GetHash();
3553 SyncWithWallets(tx, NULL, true);
3554 RelayTransaction(tx, nHash);
3555 mapAlreadyAskedFor.erase(inv);
3556 vWorkQueue.push_back(nHash);
3557 vEraseQueue.push_back(nHash);
3559 // Recursively process any orphan transactions that depended on this one
3560 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3562 auto hashPrev = vWorkQueue[i];
3563 for (auto mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3564 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3567 const uint256& orphanTxHash = *mi;
3568 auto& orphanTx = mapOrphanTransactions[orphanTxHash];
3569 bool fMissingInputs2 = false;
3571 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3573 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3574 SyncWithWallets(tx, NULL, true);
3575 RelayTransaction(orphanTx, orphanTxHash);
3576 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3577 vWorkQueue.push_back(orphanTxHash);
3578 vEraseQueue.push_back(orphanTxHash);
3580 else if (!fMissingInputs2)
3583 vEraseQueue.push_back(orphanTxHash);
3584 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3589 for(uint256 hash : vEraseQueue)
3590 EraseOrphanTx(hash);
3592 else if (fMissingInputs)
3596 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3597 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3599 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3601 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3605 else if (strCommand == "block")
3609 auto hashBlock = block.GetHash();
3611 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3614 CInv inv(MSG_BLOCK, hashBlock);
3615 pfrom->AddInventoryKnown(inv);
3617 if (ProcessBlock(pfrom, &block))
3618 mapAlreadyAskedFor.erase(inv);
3619 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3623 // This asymmetric behavior for inbound and outbound connections was introduced
3624 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
3625 // to users' AddrMan and later request them by sending getaddr messages.
3626 // Making users (which are behind NAT and can only make outgoing connections) ignore
3627 // getaddr message mitigates the attack.
3628 else if ((strCommand == "getaddr") && (pfrom->fInbound))
3630 // Don't return addresses older than nCutOff timestamp
3631 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
3632 pfrom->vAddrToSend.clear();
3633 vector<CAddress> vAddr = addrman.GetAddr();
3634 for(const CAddress &addr : vAddr)
3635 if(addr.nTime > nCutOff)
3636 pfrom->PushAddress(addr);
3640 else if (strCommand == "mempool")
3642 std::vector<uint256> vtxid;
3643 mempool.queryHashes(vtxid);
3645 for (unsigned int i = 0; i < vtxid.size(); i++) {
3646 CInv inv(MSG_TX, vtxid[i]);
3647 vInv.push_back(inv);
3648 if (i == (MAX_INV_SZ - 1))
3651 if (vInv.size() > 0)
3652 pfrom->PushMessage("inv", vInv);
3656 else if (strCommand == "checkorder")
3661 if (!GetBoolArg("-allowreceivebyip"))
3663 pfrom->PushMessage("reply", hashReply, 2, string(""));
3670 /// we have a chance to check the order here
3672 // Keep giving the same key to the same ip until they use it
3673 if (!mapReuseKey.count(pfrom->addr))
3674 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3676 // Send back approval of order and pubkey to use
3677 CScript scriptPubKey;
3678 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3679 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
3683 else if (strCommand == "reply")
3688 CRequestTracker tracker;
3690 LOCK(pfrom->cs_mapRequests);
3691 auto mi = pfrom->mapRequests.find(hashReply);
3692 if (mi != pfrom->mapRequests.end())
3694 tracker = (*mi).second;
3695 pfrom->mapRequests.erase(mi);
3698 if (!tracker.IsNull())
3699 tracker.fn(tracker.param1, vRecv);
3703 else if (strCommand == "ping")
3707 // Echo the message back with the nonce. This allows for two useful features:
3709 // 1) A remote node can quickly check if the connection is operational
3710 // 2) Remote nodes can measure the latency of the network thread. If this node
3711 // is overloaded it won't respond to pings quickly and the remote node can
3712 // avoid sending us more work, like chain download requests.
3714 // The nonce stops the remote getting confused between different pings: without
3715 // it, if the remote node sends a ping once per second and this node takes 5
3716 // seconds to respond to each, the 5th ping the remote sends would appear to
3717 // return very quickly.
3718 pfrom->PushMessage("pong", nonce);
3722 else if (strCommand == "alert")
3727 auto alertHash = alert.GetHash();
3728 if (pfrom->setKnown.count(alertHash) == 0)
3730 if (alert.ProcessAlert())
3733 pfrom->setKnown.insert(alertHash);
3736 for(CNode* pnode : vNodes)
3737 alert.RelayTo(pnode);
3741 // Small DoS penalty so peers that send us lots of
3742 // duplicate/expired/invalid-signature/whatever alerts
3743 // eventually get banned.
3744 // This isn't a Misbehaving(100) (immediate ban) because the
3745 // peer might be an older or different implementation with
3746 // a different signature key, etc.
3747 pfrom->Misbehaving(10);
3755 // Ignore unknown commands for extensibility
3759 // Update the last seen time for this node's address
3760 if (pfrom->fNetworkNode)
3761 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3762 AddressCurrentlyConnected(pfrom->addr);
3768 bool ProcessMessages(CNode* pfrom)
3770 CDataStream& vRecv = pfrom->vRecv;
3774 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3778 // (4) message start
3787 // Don't bother if send buffer is too full to respond anyway
3788 if (pfrom->vSend.size() >= SendBufferSize())
3791 // Scan for message start
3792 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(nNetworkID), END(nNetworkID));
3793 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3794 if (vRecv.end() - pstart < nHeaderSize)
3796 if ((int)vRecv.size() > nHeaderSize)
3798 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3799 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3803 if (pstart - vRecv.begin() > 0)
3804 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3805 vRecv.erase(vRecv.begin(), pstart);
3808 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3813 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3816 string strCommand = hdr.GetCommand();
3819 unsigned int nMessageSize = hdr.nMessageSize;
3820 if (nMessageSize > MAX_SIZE)
3822 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3825 if (nMessageSize > vRecv.size())
3827 // Rewind and wait for rest of message
3828 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3833 auto hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3834 unsigned int nChecksum = 0;
3835 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3836 if (nChecksum != hdr.nChecksum)
3838 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3839 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3843 // Copy message to its own buffer
3844 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3845 vRecv.ignore(nMessageSize);
3853 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3858 catch (std::ios_base::failure& e)
3860 if (strstr(e.what(), "end of data"))
3862 // Allow exceptions from under-length message on vRecv
3863 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());
3865 else if (strstr(e.what(), "size too large"))
3867 // Allow exceptions from over-long size
3868 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3872 PrintExceptionContinue(&e, "ProcessMessages()");
3875 catch (std::exception& e) {
3876 PrintExceptionContinue(&e, "ProcessMessages()");
3878 PrintExceptionContinue(NULL, "ProcessMessages()");
3882 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3890 bool SendMessages(CNode* pto)
3892 TRY_LOCK(cs_main, lockMain);
3894 // Current time in microseconds
3895 auto nNow = GetTimeMicros();
3897 // Don't send anything until we get their version message
3898 if (pto->nVersion == 0)
3901 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3903 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
3905 pto->PushMessage("ping", nonce);
3909 if (pto->fStartSync) {
3910 pto->fStartSync = false;
3911 pto->PushGetBlocks(pindexBest, uint256(0));
3914 // Resend wallet transactions that haven't gotten in a block yet
3915 ResendWalletTransactions();
3917 // Address refresh broadcast
3918 if (!IsInitialBlockDownload() && pto->nNextLocalAddrSend < nNow) {
3919 AdvertiseLocal(pto);
3920 pto->nNextLocalAddrSend = PoissonNextSend(nNow, nOneDay);
3926 if (pto->nNextAddrSend < nNow) {
3927 pto->nNextAddrSend = PoissonNextSend(nNow, 30);
3928 vector<CAddress> vAddr;
3929 vAddr.reserve(pto->vAddrToSend.size());
3930 for(const CAddress& addr : pto->vAddrToSend)
3932 if (pto->setAddrKnown.insert(addr).second)
3934 vAddr.push_back(addr);
3935 // receiver rejects addr messages larger than 1000
3936 if (vAddr.size() >= 1000)
3938 pto->PushMessage("addr", vAddr);
3943 pto->vAddrToSend.clear();
3945 pto->PushMessage("addr", vAddr);
3949 // Message: inventory
3952 vector<CInv> vInvWait;
3954 bool fSendTrickle = false;
3955 if (pto->nNextInvSend < nNow) {
3956 fSendTrickle = true;
3957 pto->nNextInvSend = PoissonNextSend(nNow, 5);
3959 LOCK(pto->cs_inventory);
3960 vInv.reserve(pto->vInventoryToSend.size());
3961 vInvWait.reserve(pto->vInventoryToSend.size());
3962 for(const CInv& inv : pto->vInventoryToSend)
3964 if (pto->setInventoryKnown.count(inv))
3967 // trickle out tx inv to protect privacy
3968 if (inv.GetType() == MSG_TX && !fSendTrickle)
3970 // 1/4 of tx invs blast to all immediately
3971 static uint256 hashSalt;
3973 hashSalt = GetRandHash();
3974 uint256 hashRand = inv.GetHash() ^ hashSalt;
3975 hashRand = Hash(hashRand.begin(), hashRand.end());
3976 bool fTrickleWait = ((hashRand & 3) != 0);
3980 vInvWait.push_back(inv);
3985 // returns true if wasn't already contained in the set
3986 if (pto->setInventoryKnown.insert(inv).second)
3988 vInv.push_back(inv);
3989 if (vInv.size() >= 1000)
3991 pto->PushMessage("inv", vInv);
3996 pto->vInventoryToSend = vInvWait;
3999 pto->PushMessage("inv", vInv);
4005 vector<CInv> vGetData;
4007 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4009 const CInv& inv = (*pto->mapAskFor.begin()).second;
4010 if (!AlreadyHave(txdb, inv))
4013 printf("sending getdata: %s\n", inv.ToString().c_str());
4014 vGetData.push_back(inv);
4015 if (vGetData.size() >= 1000)
4017 pto->PushMessage("getdata", vGetData);
4020 mapAlreadyAskedFor[inv] = nNow;
4022 pto->mapAskFor.erase(pto->mapAskFor.begin());
4024 if (!vGetData.empty())
4025 pto->PushMessage("getdata", vGetData);
4038 auto it1 = mapBlockIndex.begin();
4039 for (; it1 != mapBlockIndex.end(); it1++)
4040 delete (*it1).second;
4041 mapBlockIndex.clear();
4044 auto it2 = mapOrphanBlocks.begin();
4045 for (; it2 != mapOrphanBlocks.end(); it2++)
4046 delete (*it2).second;
4047 mapOrphanBlocks.clear();
4049 // orphan transactions
4051 } instance_of_cmaincleanup;