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"
12 #include "ui_interface.h"
13 #include "checkqueue.h"
15 #include <boost/algorithm/string/replace.hpp>
16 #include <boost/filesystem.hpp>
17 #include <boost/filesystem/fstream.hpp>
22 using namespace boost;
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
32 unsigned int nTransactionsUpdated = 0;
34 map<uint256, CBlockIndex*> mapBlockIndex;
35 set<pair<COutPoint, unsigned int> > setStakeSeen;
37 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
38 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
39 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
40 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
41 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
43 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
45 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
46 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
47 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
48 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
50 int nCoinbaseMaturity = 500;
52 CBlockIndex* pindexGenesisBlock = NULL;
55 uint256 nBestChainTrust = 0;
56 uint256 nBestInvalidTrust = 0;
58 uint256 hashBestChain = 0;
59 CBlockIndex* pindexBest = NULL;
60 int64_t nTimeBestReceived = 0;
61 int nScriptCheckThreads = 0;
63 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
65 map<uint256, CBlock*> mapOrphanBlocks;
66 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
67 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
68 map<uint256, uint256> mapProofOfStake;
70 map<uint256, CTransaction> mapOrphanTransactions;
71 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
73 // Constant stuff for coinbase transactions we create:
74 CScript COINBASE_FLAGS;
76 const string strMessageMagic = "NovaCoin Signed Message:\n";
79 int64_t nTransactionFee = MIN_TX_FEE;
80 int64_t nMinimumInputValue = MIN_TX_FEE;
82 extern enum Checkpoints::CPMode CheckpointsMode;
84 //////////////////////////////////////////////////////////////////////////////
86 // dispatching functions
89 // These functions dispatch to one or all registered wallets
92 void RegisterWallet(CWallet* pwalletIn)
95 LOCK(cs_setpwalletRegistered);
96 setpwalletRegistered.insert(pwalletIn);
100 void UnregisterWallet(CWallet* pwalletIn)
103 LOCK(cs_setpwalletRegistered);
104 setpwalletRegistered.erase(pwalletIn);
108 // check whether the passed transaction is from us
109 bool static IsFromMe(CTransaction& tx)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 if (pwallet->IsFromMe(tx))
117 // get the wallet transaction with the given hash (if it exists)
118 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 if (pwallet->GetTransaction(hashTx,wtx))
126 // erases transaction with the given hash from all wallets
127 void static EraseFromWallets(uint256 hash)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->EraseFromWallet(hash);
133 // make sure all wallets know about the given transaction, in the given block
134 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
138 // ppcoin: wallets need to refund inputs when disconnecting coinstake
139 if (tx.IsCoinStake())
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 if (pwallet->IsFromMe(tx))
143 pwallet->DisableTransaction(tx);
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
150 // Preloaded coins cache invalidation
151 fCoinsDataActual = false;
154 // notify wallets about a new best chain
155 void static SetBestChain(const CBlockLocator& loc)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->SetBestChain(loc);
161 // notify wallets about an updated transaction
162 void static UpdatedTransaction(const uint256& hashTx)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->UpdatedTransaction(hashTx);
169 void static PrintWallets(const CBlock& block)
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->PrintWallet(block);
175 // notify wallets about an incoming inventory (for request counts)
176 void static Inventory(const uint256& hash)
178 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
179 pwallet->Inventory(hash);
182 // ask wallets to resend their transactions
183 void ResendWalletTransactions()
185 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
186 pwallet->ResendWalletTransactions();
195 //////////////////////////////////////////////////////////////////////////////
197 // mapOrphanTransactions
200 bool AddOrphanTx(const CTransaction& tx)
202 uint256 hash = tx.GetHash();
203 if (mapOrphanTransactions.count(hash))
206 // Ignore big transactions, to avoid a
207 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
208 // large transaction with a missing parent then we assume
209 // it will rebroadcast it later, after the parent transaction(s)
210 // have been mined or received.
211 // 10,000 orphans, each of which is at most 5,000 bytes big is
212 // at most 500 megabytes of orphans:
214 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
218 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
222 mapOrphanTransactions[hash] = tx;
223 BOOST_FOREACH(const CTxIn& txin, tx.vin)
224 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
226 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
227 mapOrphanTransactions.size());
231 void static EraseOrphanTx(uint256 hash)
233 if (!mapOrphanTransactions.count(hash))
235 const CTransaction& tx = mapOrphanTransactions[hash];
236 BOOST_FOREACH(const CTxIn& txin, tx.vin)
238 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
239 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
240 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
242 mapOrphanTransactions.erase(hash);
245 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
247 unsigned int nEvicted = 0;
248 while (mapOrphanTransactions.size() > nMaxOrphans)
250 // Evict a random orphan:
251 uint256 randomhash = GetRandHash();
252 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
253 if (it == mapOrphanTransactions.end())
254 it = mapOrphanTransactions.begin();
255 EraseOrphanTx(it->first);
267 //////////////////////////////////////////////////////////////////////////////
269 // CTransaction and CTxIndex
272 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
275 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
277 if (!ReadFromDisk(txindexRet.pos))
279 if (prevout.n >= vout.size())
287 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
290 return ReadFromDisk(txdb, prevout, txindex);
293 bool CTransaction::ReadFromDisk(COutPoint prevout)
297 return ReadFromDisk(txdb, prevout, txindex);
300 bool CTransaction::IsStandard(string& strReason) const
302 if (nVersion > CTransaction::CURRENT_VERSION)
304 strReason = "version";
308 unsigned int nDataOut = 0;
309 txnouttype whichType;
310 BOOST_FOREACH(const CTxIn& txin, vin)
312 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
313 // keys. (remember the 520 byte limit on redeemScript size) That works
314 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
315 // bytes of scriptSig, which we round off to 1650 bytes for some minor
316 // future-proofing. That's also enough to spend a 20-of-20
317 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
318 // considered standard)
319 if (txin.scriptSig.size() > 1650)
321 strReason = "scriptsig-size";
324 if (!txin.scriptSig.IsPushOnly())
326 strReason = "scriptsig-not-pushonly";
329 if (!txin.scriptSig.HasCanonicalPushes()) {
330 strReason = "txin-scriptsig-not-canonicalpushes";
334 BOOST_FOREACH(const CTxOut& txout, vout) {
335 if (!::IsStandard(txout.scriptPubKey, whichType)) {
336 strReason = "scriptpubkey";
339 if (whichType == TX_NULL_DATA)
342 if (txout.nValue == 0) {
343 strReason = "txout-value=0";
346 if (!txout.scriptPubKey.HasCanonicalPushes()) {
347 strReason = "txout-scriptsig-not-canonicalpushes";
353 // only one OP_RETURN txout is permitted
355 strReason = "multi-op-return";
363 // Check transaction inputs, and make sure any
364 // pay-to-script-hash transactions are evaluating IsStandard scripts
366 // Why bother? To avoid denial-of-service attacks; an attacker
367 // can submit a standard HASH... OP_EQUAL transaction,
368 // which will get accepted into blocks. The redemption
369 // script can be anything; an attacker could use a very
370 // expensive-to-check-upon-redemption script like:
371 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
373 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
376 return true; // Coinbases don't use vin normally
378 for (unsigned int i = 0; i < vin.size(); i++)
380 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
382 vector<vector<unsigned char> > vSolutions;
383 txnouttype whichType;
384 // get the scriptPubKey corresponding to this input:
385 const CScript& prevScript = prev.scriptPubKey;
386 if (!Solver(prevScript, whichType, vSolutions))
388 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
389 if (nArgsExpected < 0)
392 // Transactions with extra stuff in their scriptSigs are
393 // non-standard. Note that this EvalScript() call will
394 // be quick, because if there are any operations
395 // beside "push data" in the scriptSig the
396 // IsStandard() call returns false
397 vector<vector<unsigned char> > stack;
398 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
401 if (whichType == TX_SCRIPTHASH)
405 CScript subscript(stack.back().begin(), stack.back().end());
406 vector<vector<unsigned char> > vSolutions2;
407 txnouttype whichType2;
408 if (!Solver(subscript, whichType2, vSolutions2))
410 if (whichType2 == TX_SCRIPTHASH)
414 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
417 nArgsExpected += tmpExpected;
420 if (stack.size() != (unsigned int)nArgsExpected)
428 CTransaction::GetLegacySigOpCount() const
430 unsigned int nSigOps = 0;
431 BOOST_FOREACH(const CTxIn& txin, vin)
433 nSigOps += txin.scriptSig.GetSigOpCount(false);
435 BOOST_FOREACH(const CTxOut& txout, vout)
437 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
443 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
455 // Load the block this tx is in
457 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
459 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
464 // Update the tx's hashBlock
465 hashBlock = pblock->GetHash();
467 // Locate the transaction
468 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
469 if (pblock->vtx[nIndex] == *(CTransaction*)this)
471 if (nIndex == (int)pblock->vtx.size())
473 vMerkleBranch.clear();
475 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
479 // Fill in merkle branch
480 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
483 // Is the tx in a block that's in the main chain
484 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
485 if (mi == mapBlockIndex.end())
487 CBlockIndex* pindex = (*mi).second;
488 if (!pindex || !pindex->IsInMainChain())
491 return pindexBest->nHeight - pindex->nHeight + 1;
500 bool CTransaction::CheckTransaction() const
502 // Basic checks that don't depend on any context
504 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
506 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
508 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
509 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
511 // Check for negative or overflow output values
512 int64_t nValueOut = 0;
513 for (unsigned int i = 0; i < vout.size(); i++)
515 const CTxOut& txout = vout[i];
516 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
517 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
519 if (txout.nValue < 0)
520 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
521 if (txout.nValue > MAX_MONEY)
522 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
523 nValueOut += txout.nValue;
524 if (!MoneyRange(nValueOut))
525 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
528 // Check for duplicate inputs
529 set<COutPoint> vInOutPoints;
530 BOOST_FOREACH(const CTxIn& txin, vin)
532 if (vInOutPoints.count(txin.prevout))
534 vInOutPoints.insert(txin.prevout);
539 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
540 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
544 BOOST_FOREACH(const CTxIn& txin, vin)
545 if (txin.prevout.IsNull())
546 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
552 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
554 // Use new fees approach if we are on test network or
555 // switch date has been reached
556 bool fNewApproach = fTestNet || nTime > FEE_SWITCH_TIME;
558 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
560 if(!fNewApproach || IsCoinStake())
562 // Enforce 0.01 as minimum fee for old approach or coinstake
564 nMinRelayTxFee = CENT;
567 // Base fee is either nMinTxFee or nMinRelayTxFee
568 int64_t nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
570 unsigned int nNewBlockSize = nBlockSize + nBytes;
571 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
579 // Transactions under 1K are free
585 // Free transaction area
586 if (nNewBlockSize < 27000)
591 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
592 // each non empty output which is less than 0.01
594 // It's safe to ignore empty outputs here, because these inputs are allowed
595 // only for coinbase and coinstake transactions.
596 BOOST_FOREACH(const CTxOut& txout, vout)
597 if (txout.nValue < CENT && !txout.IsEmpty())
600 else if (nMinFee < nBaseFee)
602 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if
603 // any output is less than 0.01
604 BOOST_FOREACH(const CTxOut& txout, vout)
605 if (txout.nValue < CENT)
609 // Raise the price as the block approaches full
610 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
612 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
614 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
617 if (!MoneyRange(nMinFee))
624 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
625 bool* pfMissingInputs)
628 *pfMissingInputs = false;
630 if (!tx.CheckTransaction())
631 return error("CTxMemPool::accept() : CheckTransaction failed");
633 // Coinbase is only valid in a block, not as a loose transaction
635 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
637 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
638 if (tx.IsCoinStake())
639 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
641 // To help v0.1.5 clients who would see it as a negative number
642 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
643 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
645 // Rather not work on nonstandard transactions (unless -testnet)
647 if (!fTestNet && !tx.IsStandard(strNonStd))
648 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
650 // Do we already have it?
651 uint256 hash = tx.GetHash();
654 if (mapTx.count(hash))
658 if (txdb.ContainsTx(hash))
661 // Check for conflicts with in-memory transactions
662 CTransaction* ptxOld = NULL;
663 for (unsigned int i = 0; i < tx.vin.size(); i++)
665 COutPoint outpoint = tx.vin[i].prevout;
666 if (mapNextTx.count(outpoint))
668 // Disable replacement feature for now
671 // Allow replacing with a newer version of the same transaction
674 ptxOld = mapNextTx[outpoint].ptx;
675 if (ptxOld->IsFinal())
677 if (!tx.IsNewerThan(*ptxOld))
679 for (unsigned int i = 0; i < tx.vin.size(); i++)
681 COutPoint outpoint = tx.vin[i].prevout;
682 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
692 map<uint256, CTxIndex> mapUnused;
693 bool fInvalid = false;
694 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
697 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
699 *pfMissingInputs = true;
703 // Check for non-standard pay-to-script-hash in inputs
704 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
705 return error("CTxMemPool::accept() : nonstandard transaction input");
707 // Note: if you modify this code to accept non-standard transactions, then
708 // you should add code here to check that the transaction does a
709 // reasonable number of ECDSA signature verifications.
711 int64_t nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
712 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
714 // Don't accept it if it can't get into a block
715 int64_t txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
716 if (nFees < txMinFee)
717 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
718 hash.ToString().c_str(),
721 // Continuously rate-limit free transactions
722 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
723 // be annoying or make others' transactions take longer to confirm.
724 if (nFees < MIN_RELAY_TX_FEE)
726 static CCriticalSection cs;
727 static double dFreeCount;
728 static int64_t nLastTime;
729 int64_t nNow = GetTime();
733 // Use an exponentially decaying ~10-minute window:
734 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
736 // -limitfreerelay unit is thousand-bytes-per-minute
737 // At default rate it would take over a month to fill 1GB
738 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
739 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
741 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
746 // Check against previous transactions
747 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
748 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, SIG_SWITCH_TIME < tx.nTime ? STRICT_FLAGS : SOFT_FLAGS))
750 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
754 // Store transaction in memory
759 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
762 addUnchecked(hash, tx);
765 ///// are we sure this is ok when loading transactions or restoring block txes
766 // If updated, erase old tx from wallet
768 EraseFromWallets(ptxOld->GetHash());
770 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
771 hash.ToString().substr(0,10).c_str(),
776 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
778 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
781 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
783 // Add to memory pool without checking anything. Don't call this directly,
784 // call CTxMemPool::accept to properly check the transaction first.
787 for (unsigned int i = 0; i < tx.vin.size(); i++)
788 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
789 nTransactionsUpdated++;
795 bool CTxMemPool::remove(CTransaction &tx)
797 // Remove transaction from memory pool
800 uint256 hash = tx.GetHash();
801 if (mapTx.count(hash))
803 BOOST_FOREACH(const CTxIn& txin, tx.vin)
804 mapNextTx.erase(txin.prevout);
806 nTransactionsUpdated++;
812 void CTxMemPool::clear()
817 ++nTransactionsUpdated;
820 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
825 vtxid.reserve(mapTx.size());
826 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
827 vtxid.push_back((*mi).first);
833 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
835 if (hashBlock == 0 || nIndex == -1)
838 // Find the block it claims to be in
839 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
840 if (mi == mapBlockIndex.end())
842 CBlockIndex* pindex = (*mi).second;
843 if (!pindex || !pindex->IsInMainChain())
846 // Make sure the merkle branch connects to this block
847 if (!fMerkleVerified)
849 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
851 fMerkleVerified = true;
855 return pindexBest->nHeight - pindex->nHeight + 1;
859 int CMerkleTx::GetBlocksToMaturity() const
861 if (!(IsCoinBase() || IsCoinStake()))
863 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
867 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
871 if (!IsInMainChain() && !ClientConnectInputs())
873 return CTransaction::AcceptToMemoryPool(txdb, false);
877 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
881 bool CMerkleTx::AcceptToMemoryPool()
884 return AcceptToMemoryPool(txdb);
889 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
894 // Add previous supporting transactions first
895 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
897 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
899 uint256 hash = tx.GetHash();
900 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
901 tx.AcceptToMemoryPool(txdb, fCheckInputs);
904 return AcceptToMemoryPool(txdb, fCheckInputs);
909 bool CWalletTx::AcceptWalletTransaction()
912 return AcceptWalletTransaction(txdb);
915 int CTxIndex::GetDepthInMainChain() const
919 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
921 // Find the block in the index
922 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
923 if (mi == mapBlockIndex.end())
925 CBlockIndex* pindex = (*mi).second;
926 if (!pindex || !pindex->IsInMainChain())
928 return 1 + nBestHeight - pindex->nHeight;
931 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
932 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
938 if (mempool.exists(hash))
940 tx = mempool.lookup(hash);
946 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
949 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
950 hashBlock = block.GetHash();
964 //////////////////////////////////////////////////////////////////////////////
966 // CBlock and CBlockIndex
969 static CBlockIndex* pblockindexFBBHLast;
970 CBlockIndex* FindBlockByHeight(int nHeight)
972 CBlockIndex *pblockindex;
973 if (nHeight < nBestHeight / 2)
974 pblockindex = pindexGenesisBlock;
976 pblockindex = pindexBest;
977 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
978 pblockindex = pblockindexFBBHLast;
979 while (pblockindex->nHeight > nHeight)
980 pblockindex = pblockindex->pprev;
981 while (pblockindex->nHeight < nHeight)
982 pblockindex = pblockindex->pnext;
983 pblockindexFBBHLast = pblockindex;
987 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
989 if (!fReadTransactions)
991 *this = pindex->GetBlockHeader();
994 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
996 if (GetHash() != pindex->GetBlockHash())
997 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1001 uint256 static GetOrphanRoot(const CBlock* pblock)
1003 // Work back to the first block in the orphan chain
1004 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1005 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1006 return pblock->GetHash();
1009 // ppcoin: find block wanted by given orphan block
1010 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1012 // Work back to the first block in the orphan chain
1013 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1014 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1015 return pblockOrphan->hashPrevBlock;
1018 // select stake target limit according to hard-coded conditions
1019 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1021 if(fTestNet) // separate proof of stake target limit for testnet
1022 return bnProofOfStakeLimit;
1023 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1024 return bnProofOfStakeLimit;
1025 if(nHeight + 1 > 15000) // 24 bits since block 15000
1026 return bnProofOfStakeLegacyLimit;
1027 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1028 return bnProofOfStakeHardLimit;
1030 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1033 // miner's coin base reward based on nBits
1034 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
1036 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1039 bnTarget.SetCompact(nBits);
1040 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1041 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1043 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1044 // A reasonably continuous curve is used to avoid shock to market
1045 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1047 // Human readable form:
1049 // nSubsidy = 100 / (diff ^ 1/6)
1050 CBigNum bnLowerBound = CENT;
1051 CBigNum bnUpperBound = bnSubsidyLimit;
1052 while (bnLowerBound + CENT <= bnUpperBound)
1054 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1055 if (fDebug && GetBoolArg("-printcreation"))
1056 printf("GetProofOfWorkReward() : lower=%" PRId64 " upper=%" PRId64 " mid=%" PRId64 "\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1057 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1058 bnUpperBound = bnMidValue;
1060 bnLowerBound = bnMidValue;
1063 int64_t nSubsidy = bnUpperBound.getuint64();
1065 nSubsidy = (nSubsidy / CENT) * CENT;
1066 if (fDebug && GetBoolArg("-printcreation"))
1067 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1069 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1072 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1073 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1075 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1077 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1079 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1081 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1083 bnTarget.SetCompact(nBits);
1084 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1085 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1087 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1089 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1090 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1091 bnMidPart, bnRewardPart;
1093 while (bnLowerBound + CENT <= bnUpperBound)
1095 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1096 if (fDebug && GetBoolArg("-printcreation"))
1097 printf("GetProofOfStakeReward() : lower=%" PRId64 " upper=%" PRId64 " mid=%" PRId64 "\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1099 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1102 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1104 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1106 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1109 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1110 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1115 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1117 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1119 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1122 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1123 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1126 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1127 bnUpperBound = bnMidValue;
1129 bnLowerBound = bnMidValue;
1132 nRewardCoinYear = bnUpperBound.getuint64();
1133 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1137 // Old creation amount per coin-year, 5% fixed stake mint rate
1138 nRewardCoinYear = 5 * CENT;
1142 return nRewardCoinYear;
1144 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1146 // Set reasonable reward limit for large inputs since 20 Oct 2013
1148 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1149 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1151 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1152 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1154 nSubsidy = min(nSubsidy, nSubsidyLimit);
1157 if (fDebug && GetBoolArg("-printcreation"))
1158 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1162 static const int64_t nTargetTimespan = 7 * 24 * 60 * 60; // one week
1164 // get proof of work blocks max spacing according to hard-coded conditions
1165 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1167 if(nTime > TARGETS_SWITCH_TIME)
1168 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1171 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1173 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1177 // maximum nBits value could possible be required nTime after
1179 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1182 bnResult.SetCompact(nBase);
1184 while (nTime > 0 && bnResult < bnTargetLimit)
1186 // Maximum 200% adjustment per day...
1188 nTime -= 24 * 60 * 60;
1190 if (bnResult > bnTargetLimit)
1191 bnResult = bnTargetLimit;
1192 return bnResult.GetCompact();
1196 // minimum amount of work that could possibly be required nTime after
1197 // minimum proof-of-work required was nBase
1199 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1201 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1205 // minimum amount of stake that could possibly be required nTime after
1206 // minimum proof-of-stake required was nBase
1208 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1210 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1214 // ppcoin: find last block index up to pindex
1215 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1217 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1218 pindex = pindex->pprev;
1222 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1224 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1226 if (pindexLast == NULL)
1227 return bnTargetLimit.GetCompact(); // genesis block
1229 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1230 if (pindexPrev->pprev == NULL)
1231 return bnTargetLimit.GetCompact(); // first block
1232 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1233 if (pindexPrevPrev->pprev == NULL)
1234 return bnTargetLimit.GetCompact(); // second block
1236 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1238 // ppcoin: target change every block
1239 // ppcoin: retarget with exponential moving toward target spacing
1241 bnNew.SetCompact(pindexPrev->nBits);
1242 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1243 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1244 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1245 bnNew /= ((nInterval + 1) * nTargetSpacing);
1247 if (bnNew > bnTargetLimit)
1248 bnNew = bnTargetLimit;
1250 return bnNew.GetCompact();
1253 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1256 bnTarget.SetCompact(nBits);
1259 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1260 return error("CheckProofOfWork() : nBits below minimum work");
1262 // Check proof of work matches claimed amount
1263 if (hash > bnTarget.getuint256())
1264 return error("CheckProofOfWork() : hash doesn't match nBits");
1269 // Return maximum amount of blocks that other nodes claim to have
1270 int GetNumBlocksOfPeers()
1272 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1275 bool IsInitialBlockDownload()
1277 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1279 static int64_t nLastUpdate;
1280 static CBlockIndex* pindexLastBest;
1281 if (pindexBest != pindexLastBest)
1283 pindexLastBest = pindexBest;
1284 nLastUpdate = GetTime();
1286 return (GetTime() - nLastUpdate < 10 &&
1287 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1290 void static InvalidChainFound(CBlockIndex* pindexNew)
1292 if (pindexNew->nChainTrust > nBestInvalidTrust)
1294 nBestInvalidTrust = pindexNew->nChainTrust;
1295 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1296 uiInterface.NotifyBlocksChanged();
1299 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1300 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1302 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1303 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1304 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1305 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1306 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1307 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1308 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1309 nBestBlockTrust.Get64(),
1310 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1314 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1316 nTime = max(GetBlockTime(), GetAdjustedTime());
1329 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1331 // Relinquish previous transactions' spent pointers
1334 BOOST_FOREACH(const CTxIn& txin, vin)
1336 COutPoint prevout = txin.prevout;
1338 // Get prev txindex from disk
1340 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1341 return error("DisconnectInputs() : ReadTxIndex failed");
1343 if (prevout.n >= txindex.vSpent.size())
1344 return error("DisconnectInputs() : prevout.n out of range");
1346 // Mark outpoint as not spent
1347 txindex.vSpent[prevout.n].SetNull();
1350 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1351 return error("DisconnectInputs() : UpdateTxIndex failed");
1355 // Remove transaction from index
1356 // This can fail if a duplicate of this transaction was in a chain that got
1357 // reorganized away. This is only possible if this transaction was completely
1358 // spent, so erasing it would be a no-op anyway.
1359 txdb.EraseTxIndex(*this);
1365 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1366 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1368 // FetchInputs can return false either because we just haven't seen some inputs
1369 // (in which case the transaction should be stored as an orphan)
1370 // or because the transaction is malformed (in which case the transaction should
1371 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1375 return true; // Coinbase transactions have no inputs to fetch.
1377 for (unsigned int i = 0; i < vin.size(); i++)
1379 COutPoint prevout = vin[i].prevout;
1380 if (inputsRet.count(prevout.hash))
1381 continue; // Got it already
1384 CTxIndex& txindex = inputsRet[prevout.hash].first;
1386 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1388 // Get txindex from current proposed changes
1389 txindex = mapTestPool.find(prevout.hash)->second;
1393 // Read txindex from txdb
1394 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1396 if (!fFound && (fBlock || fMiner))
1397 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());
1400 CTransaction& txPrev = inputsRet[prevout.hash].second;
1401 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1403 // Get prev tx from single transactions in memory
1406 if (!mempool.exists(prevout.hash))
1407 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());
1408 txPrev = mempool.lookup(prevout.hash);
1411 txindex.vSpent.resize(txPrev.vout.size());
1415 // Get prev tx from disk
1416 if (!txPrev.ReadFromDisk(txindex.pos))
1417 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1421 // Make sure all prevout.n indexes are valid:
1422 for (unsigned int i = 0; i < vin.size(); i++)
1424 const COutPoint prevout = vin[i].prevout;
1425 assert(inputsRet.count(prevout.hash) != 0);
1426 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1427 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1428 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1430 // Revisit this if/when transaction replacement is implemented and allows
1433 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()));
1440 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1442 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1443 if (mi == inputs.end())
1444 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1446 const CTransaction& txPrev = (mi->second).second;
1447 if (input.prevout.n >= txPrev.vout.size())
1448 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1450 return txPrev.vout[input.prevout.n];
1453 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1458 int64_t nResult = 0;
1459 for (unsigned int i = 0; i < vin.size(); i++)
1461 nResult += GetOutputFor(vin[i], inputs).nValue;
1467 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1472 unsigned int nSigOps = 0;
1473 for (unsigned int i = 0; i < vin.size(); i++)
1475 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1476 if (prevout.scriptPubKey.IsPayToScriptHash())
1477 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1482 bool CScriptCheck::operator()() const {
1483 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1484 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1485 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1489 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1491 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1494 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1495 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1497 // Take over previous transactions' spent pointers
1498 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1499 // fMiner is true when called from the internal bitcoin miner
1500 // ... both are false when called from CTransaction::AcceptToMemoryPool
1504 int64_t nValueIn = 0;
1506 for (unsigned int i = 0; i < vin.size(); i++)
1508 COutPoint prevout = vin[i].prevout;
1509 assert(inputs.count(prevout.hash) > 0);
1510 CTxIndex& txindex = inputs[prevout.hash].first;
1511 CTransaction& txPrev = inputs[prevout.hash].second;
1513 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1514 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()));
1516 // If prev is coinbase or coinstake, check that it's matured
1517 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1518 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1519 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1520 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1522 // ppcoin: check transaction timestamp
1523 if (txPrev.nTime > nTime)
1524 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1526 // Check for negative or overflow input values
1527 nValueIn += txPrev.vout[prevout.n].nValue;
1528 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1529 return DoS(100, error("ConnectInputs() : txin values out of range"));
1534 pvChecks->reserve(vin.size());
1536 // The first loop above does all the inexpensive checks.
1537 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1538 // Helps prevent CPU exhaustion attacks.
1539 for (unsigned int i = 0; i < vin.size(); i++)
1541 COutPoint prevout = vin[i].prevout;
1542 assert(inputs.count(prevout.hash) > 0);
1543 CTxIndex& txindex = inputs[prevout.hash].first;
1544 CTransaction& txPrev = inputs[prevout.hash].second;
1546 // Check for conflicts (double-spend)
1547 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1548 // for an attacker to attempt to split the network.
1549 if (!txindex.vSpent[prevout.n].IsNull())
1550 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());
1552 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1553 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1554 // still computed and checked, and any change will be caught at the next checkpoint.
1558 CScriptCheck check(txPrev, *this, i, flags, 0);
1561 pvChecks->push_back(CScriptCheck());
1562 check.swap(pvChecks->back());
1566 if (flags & STRICT_FLAGS)
1568 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1569 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1571 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1573 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1577 // Mark outpoints as spent
1578 txindex.vSpent[prevout.n] = posThisTx;
1581 if (fBlock || fMiner)
1583 mapTestPool[prevout.hash] = txindex;
1589 // ppcoin: coin stake tx earns reward instead of paying fee
1591 if (!GetCoinAge(txdb, nCoinAge))
1592 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1594 unsigned int nTxSize = (nTime > VALIDATION_SWITCH_TIME || fTestNet) ? GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION) : 0;
1596 int64_t nReward = GetValueOut() - nValueIn;
1597 int64_t nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1599 if (nReward > nCalculatedReward)
1600 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1604 if (nValueIn < GetValueOut())
1605 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1607 // Tally transaction fees
1608 int64_t nTxFee = nValueIn - GetValueOut();
1610 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1613 if (!MoneyRange(nFees))
1614 return DoS(100, error("ConnectInputs() : nFees out of range"));
1622 bool CTransaction::ClientConnectInputs()
1627 // Take over previous transactions' spent pointers
1630 int64_t nValueIn = 0;
1631 for (unsigned int i = 0; i < vin.size(); i++)
1633 // Get prev tx from single transactions in memory
1634 COutPoint prevout = vin[i].prevout;
1635 if (!mempool.exists(prevout.hash))
1637 CTransaction& txPrev = mempool.lookup(prevout.hash);
1639 if (prevout.n >= txPrev.vout.size())
1643 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1644 return error("ClientConnectInputs() : VerifySignature failed");
1646 ///// this is redundant with the mempool.mapNextTx stuff,
1647 ///// not sure which I want to get rid of
1648 ///// this has to go away now that posNext is gone
1649 // // Check for conflicts
1650 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1651 // return error("ConnectInputs() : prev tx already used");
1653 // // Flag outpoints as used
1654 // txPrev.vout[prevout.n].posNext = posThisTx;
1656 nValueIn += txPrev.vout[prevout.n].nValue;
1658 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1659 return error("ClientConnectInputs() : txin values out of range");
1661 if (GetValueOut() > nValueIn)
1671 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1673 // Disconnect in reverse order
1674 for (int i = vtx.size()-1; i >= 0; i--)
1675 if (!vtx[i].DisconnectInputs(txdb))
1678 // Update block index on disk without changing it in memory.
1679 // The memory index structure will be changed after the db commits.
1682 CDiskBlockIndex blockindexPrev(pindex->pprev);
1683 blockindexPrev.hashNext = 0;
1684 if (!txdb.WriteBlockIndex(blockindexPrev))
1685 return error("DisconnectBlock() : WriteBlockIndex failed");
1688 // ppcoin: clean up wallet after disconnecting coinstake
1689 BOOST_FOREACH(CTransaction& tx, vtx)
1690 SyncWithWallets(tx, this, false, false);
1695 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1697 void ThreadScriptCheck(void*) {
1698 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1699 RenameThread("novacoin-scriptch");
1700 scriptcheckqueue.Thread();
1701 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1704 void ThreadScriptCheckQuit() {
1705 scriptcheckqueue.Quit();
1708 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1710 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1711 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1714 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1715 // unless those are already completely spent.
1716 // If such overwrites are allowed, coinbases and transactions depending upon those
1717 // can be duplicated to remove the ability to spend the first instance -- even after
1718 // being sent to another address.
1719 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1720 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1721 // already refuses previously-known transaction ids entirely.
1722 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1723 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1724 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1725 // initial block download.
1726 bool fEnforceBIP30 = true; // Always active in NovaCoin
1727 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1729 //// issue here: it doesn't know the version
1730 unsigned int nTxPos;
1732 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1733 // 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
1736 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1738 map<uint256, CTxIndex> mapQueuedChanges;
1739 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1742 int64_t nValueIn = 0;
1743 int64_t nValueOut = 0;
1744 unsigned int nSigOps = 0;
1745 BOOST_FOREACH(CTransaction& tx, vtx)
1747 uint256 hashTx = tx.GetHash();
1749 if (fEnforceBIP30) {
1750 CTxIndex txindexOld;
1751 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1752 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1758 nSigOps += tx.GetLegacySigOpCount();
1759 if (nSigOps > MAX_BLOCK_SIGOPS)
1760 return DoS(100, error("ConnectBlock() : too many sigops"));
1762 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1764 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1766 MapPrevTx mapInputs;
1767 if (tx.IsCoinBase())
1768 nValueOut += tx.GetValueOut();
1772 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1775 // Add in sigops done by pay-to-script-hash inputs;
1776 // this is to prevent a "rogue miner" from creating
1777 // an incredibly-expensive-to-validate block.
1778 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1779 if (nSigOps > MAX_BLOCK_SIGOPS)
1780 return DoS(100, error("ConnectBlock() : too many sigops"));
1782 int64_t nTxValueIn = tx.GetValueIn(mapInputs);
1783 int64_t nTxValueOut = tx.GetValueOut();
1784 nValueIn += nTxValueIn;
1785 nValueOut += nTxValueOut;
1786 if (!tx.IsCoinStake())
1787 nFees += nTxValueIn - nTxValueOut;
1789 std::vector<CScriptCheck> vChecks;
1790 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, nScriptCheckThreads ? &vChecks : NULL))
1792 control.Add(vChecks);
1795 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1798 if (!control.Wait())
1799 return DoS(100, false);
1801 if (IsProofOfWork())
1803 int64_t nBlockReward = GetProofOfWorkReward(nBits, nFees);
1805 // Check coinbase reward
1806 if (vtx[0].GetValueOut() > nBlockReward)
1807 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1808 vtx[0].GetValueOut(),
1812 // track money supply and mint amount info
1813 pindex->nMint = nValueOut - nValueIn + nFees;
1814 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1815 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1816 return error("Connect() : WriteBlockIndex for pindex failed");
1818 // fees are not collected by proof-of-stake miners
1819 // fees are destroyed to compensate the entire network
1820 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1821 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1826 // Write queued txindex changes
1827 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1829 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1830 return error("ConnectBlock() : UpdateTxIndex failed");
1833 // Update block index on disk without changing it in memory.
1834 // The memory index structure will be changed after the db commits.
1837 CDiskBlockIndex blockindexPrev(pindex->pprev);
1838 blockindexPrev.hashNext = pindex->GetBlockHash();
1839 if (!txdb.WriteBlockIndex(blockindexPrev))
1840 return error("ConnectBlock() : WriteBlockIndex failed");
1843 // Watch for transactions paying to me
1844 BOOST_FOREACH(CTransaction& tx, vtx)
1845 SyncWithWallets(tx, this, true);
1851 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1853 printf("REORGANIZE\n");
1856 CBlockIndex* pfork = pindexBest;
1857 CBlockIndex* plonger = pindexNew;
1858 while (pfork != plonger)
1860 while (plonger->nHeight > pfork->nHeight)
1861 if (!(plonger = plonger->pprev))
1862 return error("Reorganize() : plonger->pprev is null");
1863 if (pfork == plonger)
1865 if (!(pfork = pfork->pprev))
1866 return error("Reorganize() : pfork->pprev is null");
1869 // List of what to disconnect
1870 vector<CBlockIndex*> vDisconnect;
1871 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1872 vDisconnect.push_back(pindex);
1874 // List of what to connect
1875 vector<CBlockIndex*> vConnect;
1876 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1877 vConnect.push_back(pindex);
1878 reverse(vConnect.begin(), vConnect.end());
1880 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());
1881 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());
1883 // Disconnect shorter branch
1884 vector<CTransaction> vResurrect;
1885 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1888 if (!block.ReadFromDisk(pindex))
1889 return error("Reorganize() : ReadFromDisk for disconnect failed");
1890 if (!block.DisconnectBlock(txdb, pindex))
1891 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1893 // Queue memory transactions to resurrect
1894 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1895 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1896 vResurrect.push_back(tx);
1899 // Connect longer branch
1900 vector<CTransaction> vDelete;
1901 for (unsigned int i = 0; i < vConnect.size(); i++)
1903 CBlockIndex* pindex = vConnect[i];
1905 if (!block.ReadFromDisk(pindex))
1906 return error("Reorganize() : ReadFromDisk for connect failed");
1907 if (!block.ConnectBlock(txdb, pindex))
1910 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1913 // Queue memory transactions to delete
1914 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1915 vDelete.push_back(tx);
1917 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1918 return error("Reorganize() : WriteHashBestChain failed");
1920 // Make sure it's successfully written to disk before changing memory structure
1921 if (!txdb.TxnCommit())
1922 return error("Reorganize() : TxnCommit failed");
1924 // Disconnect shorter branch
1925 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1927 pindex->pprev->pnext = NULL;
1929 // Connect longer branch
1930 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1932 pindex->pprev->pnext = pindex;
1934 // Resurrect memory transactions that were in the disconnected branch
1935 BOOST_FOREACH(CTransaction& tx, vResurrect)
1936 tx.AcceptToMemoryPool(txdb, false);
1938 // Delete redundant memory transactions that are in the connected branch
1939 BOOST_FOREACH(CTransaction& tx, vDelete)
1942 printf("REORGANIZE: done\n");
1948 // Called from inside SetBestChain: attaches a block to the new best chain being built
1949 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1951 uint256 hash = GetHash();
1953 // Adding to current best branch
1954 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1957 InvalidChainFound(pindexNew);
1960 if (!txdb.TxnCommit())
1961 return error("SetBestChain() : TxnCommit failed");
1963 // Add to current best branch
1964 pindexNew->pprev->pnext = pindexNew;
1966 // Delete redundant memory transactions
1967 BOOST_FOREACH(CTransaction& tx, vtx)
1973 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1975 uint256 hash = GetHash();
1977 if (!txdb.TxnBegin())
1978 return error("SetBestChain() : TxnBegin failed");
1980 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1982 txdb.WriteHashBestChain(hash);
1983 if (!txdb.TxnCommit())
1984 return error("SetBestChain() : TxnCommit failed");
1985 pindexGenesisBlock = pindexNew;
1987 else if (hashPrevBlock == hashBestChain)
1989 if (!SetBestChainInner(txdb, pindexNew))
1990 return error("SetBestChain() : SetBestChainInner failed");
1994 // the first block in the new chain that will cause it to become the new best chain
1995 CBlockIndex *pindexIntermediate = pindexNew;
1997 // list of blocks that need to be connected afterwards
1998 std::vector<CBlockIndex*> vpindexSecondary;
2000 // Reorganize is costly in terms of db load, as it works in a single db transaction.
2001 // Try to limit how much needs to be done inside
2002 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
2004 vpindexSecondary.push_back(pindexIntermediate);
2005 pindexIntermediate = pindexIntermediate->pprev;
2008 if (!vpindexSecondary.empty())
2009 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
2011 // Switch to new best branch
2012 if (!Reorganize(txdb, pindexIntermediate))
2015 InvalidChainFound(pindexNew);
2016 return error("SetBestChain() : Reorganize failed");
2019 // Connect further blocks
2020 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
2023 if (!block.ReadFromDisk(pindex))
2025 printf("SetBestChain() : ReadFromDisk failed\n");
2028 if (!txdb.TxnBegin()) {
2029 printf("SetBestChain() : TxnBegin 2 failed\n");
2032 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
2033 if (!block.SetBestChainInner(txdb, pindex))
2038 // Update best block in wallet (so we can detect restored wallets)
2039 bool fIsInitialDownload = IsInitialBlockDownload();
2040 if (!fIsInitialDownload)
2042 const CBlockLocator locator(pindexNew);
2043 ::SetBestChain(locator);
2047 hashBestChain = hash;
2048 pindexBest = pindexNew;
2049 pblockindexFBBHLast = NULL;
2050 nBestHeight = pindexBest->nHeight;
2051 nBestChainTrust = pindexNew->nChainTrust;
2052 nTimeBestReceived = GetTime();
2053 nTransactionsUpdated++;
2055 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2057 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
2058 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2059 CBigNum(nBestChainTrust).ToString().c_str(),
2060 nBestBlockTrust.Get64(),
2061 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2063 // Check the version of the last 100 blocks to see if we need to upgrade:
2064 if (!fIsInitialDownload)
2067 const CBlockIndex* pindex = pindexBest;
2068 for (int i = 0; i < 100 && pindex != NULL; i++)
2070 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2072 pindex = pindex->pprev;
2075 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2076 if (nUpgraded > 100/2)
2077 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2078 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2081 std::string strCmd = GetArg("-blocknotify", "");
2083 if (!fIsInitialDownload && !strCmd.empty())
2085 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2086 boost::thread t(runCommand, strCmd); // thread runs free
2092 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2093 // Only those coins meeting minimum age requirement counts. As those
2094 // transactions not in main chain are not currently indexed so we
2095 // might not find out about their coin age. Older transactions are
2096 // guaranteed to be in main chain by sync-checkpoint. This rule is
2097 // introduced to help nodes establish a consistent view of the coin
2098 // age (trust score) of competing branches.
2099 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2101 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2107 BOOST_FOREACH(const CTxIn& txin, vin)
2109 // First try finding the previous transaction in database
2110 CTransaction txPrev;
2112 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2113 continue; // previous transaction not in main chain
2114 if (nTime < txPrev.nTime)
2115 return false; // Transaction timestamp violation
2117 // Read block header
2119 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2120 return false; // unable to read block of previous transaction
2121 if (block.GetBlockTime() + nStakeMinAge > nTime)
2122 continue; // only count coins meeting min age requirement
2124 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
2125 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2127 if (fDebug && GetBoolArg("-printcoinage"))
2128 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2131 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2132 if (fDebug && GetBoolArg("-printcoinage"))
2133 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2134 nCoinAge = bnCoinDay.getuint64();
2138 // ppcoin: total coin age spent in block, in the unit of coin-days.
2139 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2144 BOOST_FOREACH(const CTransaction& tx, vtx)
2146 uint64_t nTxCoinAge;
2147 if (tx.GetCoinAge(txdb, nTxCoinAge))
2148 nCoinAge += nTxCoinAge;
2153 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2155 if (fDebug && GetBoolArg("-printcoinage"))
2156 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2160 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2162 // Check for duplicate
2163 uint256 hash = GetHash();
2164 if (mapBlockIndex.count(hash))
2165 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2167 // Construct new block index object
2168 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2170 return error("AddToBlockIndex() : new CBlockIndex failed");
2171 pindexNew->phashBlock = &hash;
2172 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2173 if (miPrev != mapBlockIndex.end())
2175 pindexNew->pprev = (*miPrev).second;
2176 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2179 // ppcoin: compute chain trust score
2180 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2182 // ppcoin: compute stake entropy bit for stake modifier
2183 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2184 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2186 // ppcoin: record proof-of-stake hash value
2187 if (pindexNew->IsProofOfStake())
2189 if (!mapProofOfStake.count(hash))
2190 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2191 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2194 // ppcoin: compute stake modifier
2195 uint64_t nStakeModifier = 0;
2196 bool fGeneratedStakeModifier = false;
2197 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2198 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2199 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2200 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2201 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2202 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2204 // Add to mapBlockIndex
2205 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2206 if (pindexNew->IsProofOfStake())
2207 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2208 pindexNew->phashBlock = &((*mi).first);
2210 // Write to disk block index
2212 if (!txdb.TxnBegin())
2214 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2215 if (!txdb.TxnCommit())
2219 if (pindexNew->nChainTrust > nBestChainTrust)
2220 if (!SetBestChain(txdb, pindexNew))
2223 if (pindexNew == pindexBest)
2225 // Notify UI to display prev block's coinbase if it was ours
2226 static uint256 hashPrevBestCoinBase;
2227 UpdatedTransaction(hashPrevBestCoinBase);
2228 hashPrevBestCoinBase = vtx[0].GetHash();
2231 uiInterface.NotifyBlocksChanged();
2238 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2240 // These are checks that are independent of context
2241 // that can be verified before saving an orphan block.
2244 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2245 return DoS(100, error("CheckBlock() : size limits failed"));
2247 // Check proof of work matches claimed amount
2248 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2249 return DoS(50, error("CheckBlock() : proof of work failed"));
2252 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2253 return error("CheckBlock() : block timestamp too far in the future");
2255 // First transaction must be coinbase, the rest must not be
2256 if (vtx.empty() || !vtx[0].IsCoinBase())
2257 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2259 // Check coinbase timestamp
2260 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2261 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2263 for (unsigned int i = 1; i < vtx.size(); i++)
2265 if (vtx[i].IsCoinBase())
2266 return DoS(100, error("CheckBlock() : more than one coinbase"));
2268 // Check transaction timestamp
2269 if (GetBlockTime() < (int64_t)vtx[i].nTime)
2270 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2273 if (IsProofOfStake())
2276 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2278 // Coinbase output should be empty if proof-of-stake block
2279 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2280 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2282 // Second transaction must be coinstake, the rest must not be
2283 if (vtx.empty() || !vtx[1].IsCoinStake())
2284 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2285 for (unsigned int i = 2; i < vtx.size(); i++)
2286 if (vtx[i].IsCoinStake())
2287 return DoS(100, error("CheckBlock() : more than one coinstake"));
2289 // Check coinstake timestamp
2290 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2291 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2293 // NovaCoin: check proof-of-stake block signature
2294 if (fCheckSig && !CheckBlockSignature())
2295 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2298 // Check transactions
2299 BOOST_FOREACH(const CTransaction& tx, vtx)
2301 if (!tx.CheckTransaction())
2302 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2305 // Check for duplicate txids. This is caught by ConnectInputs(),
2306 // but catching it earlier avoids a potential DoS attack:
2307 set<uint256> uniqueTx;
2308 BOOST_FOREACH(const CTransaction& tx, vtx)
2310 uniqueTx.insert(tx.GetHash());
2312 if (uniqueTx.size() != vtx.size())
2313 return DoS(100, error("CheckBlock() : duplicate transaction"));
2315 unsigned int nSigOps = 0;
2316 BOOST_FOREACH(const CTransaction& tx, vtx)
2318 nSigOps += tx.GetLegacySigOpCount();
2320 if (nSigOps > MAX_BLOCK_SIGOPS)
2321 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2323 // Check merkle root
2324 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2325 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2331 bool CBlock::AcceptBlock()
2333 // Check for duplicate
2334 uint256 hash = GetHash();
2335 if (mapBlockIndex.count(hash))
2336 return error("AcceptBlock() : block already in mapBlockIndex");
2338 // Get prev block index
2339 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2340 if (mi == mapBlockIndex.end())
2341 return DoS(10, error("AcceptBlock() : prev block not found"));
2342 CBlockIndex* pindexPrev = (*mi).second;
2343 int nHeight = pindexPrev->nHeight+1;
2345 // Check proof-of-work or proof-of-stake
2346 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2347 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2349 // Check timestamp against prev
2350 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2351 return error("AcceptBlock() : block's timestamp is too early");
2353 // Check that all transactions are finalized
2354 BOOST_FOREACH(const CTransaction& tx, vtx)
2355 if (!tx.IsFinal(nHeight, GetBlockTime()))
2356 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2358 // Check that the block chain matches the known block chain up to a checkpoint
2359 if (!Checkpoints::CheckHardened(nHeight, hash))
2360 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2362 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2364 // Check that the block satisfies synchronized checkpoint
2365 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2366 return error("AcceptBlock() : rejected by synchronized checkpoint");
2368 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2369 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2371 // Enforce rule that the coinbase starts with serialized block height
2372 CScript expect = CScript() << nHeight;
2373 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2374 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2375 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2377 // Write block to history file
2378 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2379 return error("AcceptBlock() : out of disk space");
2380 unsigned int nFile = -1;
2381 unsigned int nBlockPos = 0;
2382 if (!WriteToDisk(nFile, nBlockPos))
2383 return error("AcceptBlock() : WriteToDisk failed");
2384 if (!AddToBlockIndex(nFile, nBlockPos))
2385 return error("AcceptBlock() : AddToBlockIndex failed");
2387 // Relay inventory, but don't relay old inventory during initial block download
2388 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2389 if (hashBestChain == hash)
2392 BOOST_FOREACH(CNode* pnode, vNodes)
2393 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2394 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2397 // ppcoin: check pending sync-checkpoint
2398 Checkpoints::AcceptPendingSyncCheckpoint();
2403 uint256 CBlockIndex::GetBlockTrust() const
2406 bnTarget.SetCompact(nBits);
2412 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2413 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2417 // Calculate work amount for block
2418 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2420 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2421 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2423 // Return nPoWTrust for the first 12 blocks
2424 if (pprev == NULL || pprev->nHeight < 12)
2427 const CBlockIndex* currentIndex = pprev;
2429 if(IsProofOfStake())
2431 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2433 // Return 1/3 of score if parent block is not the PoW block
2434 if (!pprev->IsProofOfWork())
2435 return (bnNewTrust / 3).getuint256();
2439 // Check last 12 blocks type
2440 while (pprev->nHeight - currentIndex->nHeight < 12)
2442 if (currentIndex->IsProofOfWork())
2444 currentIndex = currentIndex->pprev;
2447 // Return 1/3 of score if less than 3 PoW blocks found
2449 return (bnNewTrust / 3).getuint256();
2451 return bnNewTrust.getuint256();
2455 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2457 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2458 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2459 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2463 // Check last 12 blocks type
2464 while (pprev->nHeight - currentIndex->nHeight < 12)
2466 if (currentIndex->IsProofOfStake())
2468 currentIndex = currentIndex->pprev;
2471 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2473 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2475 bnTarget.SetCompact(pprev->nBits);
2480 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2482 // Return nPoWTrust + full trust score for previous block nBits
2483 return nPoWTrust + bnNewTrust.getuint256();
2487 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2489 unsigned int nFound = 0;
2490 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2492 if (pstart->nVersion >= minVersion)
2494 pstart = pstart->pprev;
2496 return (nFound >= nRequired);
2499 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2501 // Check for duplicate
2502 uint256 hash = pblock->GetHash();
2503 if (mapBlockIndex.count(hash))
2504 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2505 if (mapOrphanBlocks.count(hash))
2506 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2508 // ppcoin: check proof-of-stake
2509 // Limited duplicity on stake: prevents block flood attack
2510 // Duplicate stake allowed only when there is orphan child block
2511 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2512 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());
2514 // Preliminary checks
2515 if (!pblock->CheckBlock())
2516 return error("ProcessBlock() : CheckBlock FAILED");
2518 // ppcoin: verify hash target and signature of coinstake tx
2519 if (pblock->IsProofOfStake())
2521 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2522 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2524 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2525 return false; // do not error here as we expect this during initial block download
2527 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2528 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2531 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2532 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2534 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2535 int64_t deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2537 bnNewBlock.SetCompact(pblock->nBits);
2540 if (pblock->IsProofOfStake())
2541 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2543 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2545 if (bnNewBlock > bnRequired)
2548 pfrom->Misbehaving(100);
2549 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2553 // ppcoin: ask for pending sync-checkpoint if any
2554 if (!IsInitialBlockDownload())
2555 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2557 // If don't already have its previous block, shunt it off to holding area until we get it
2558 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2560 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2561 CBlock* pblock2 = new CBlock(*pblock);
2562 // ppcoin: check proof-of-stake
2563 if (pblock2->IsProofOfStake())
2565 // Limited duplicity on stake: prevents block flood attack
2566 // Duplicate stake allowed only when there is orphan child block
2567 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2568 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock2->GetProofOfStake().first.ToString().c_str(), pblock2->GetProofOfStake().second, hash.ToString().c_str());
2570 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2572 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2573 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2575 // Ask this guy to fill in what we're missing
2578 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2579 // ppcoin: getblocks may not obtain the ancestor block rejected
2580 // earlier by duplicate-stake check so we ask for it again directly
2581 if (!IsInitialBlockDownload())
2582 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2588 if (!pblock->AcceptBlock())
2589 return error("ProcessBlock() : AcceptBlock FAILED");
2591 // Recursively process any orphan blocks that depended on this one
2592 vector<uint256> vWorkQueue;
2593 vWorkQueue.push_back(hash);
2594 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2596 uint256 hashPrev = vWorkQueue[i];
2597 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2598 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2601 CBlock* pblockOrphan = (*mi).second;
2602 if (pblockOrphan->AcceptBlock())
2603 vWorkQueue.push_back(pblockOrphan->GetHash());
2604 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2605 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2606 delete pblockOrphan;
2608 mapOrphanBlocksByPrev.erase(hashPrev);
2611 printf("ProcessBlock: ACCEPTED\n");
2613 // ppcoin: if responsible for sync-checkpoint send it
2614 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2615 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2620 // novacoin: attempt to generate suitable proof-of-stake
2621 bool CBlock::SignBlock(CWallet& wallet)
2623 // if we are trying to sign
2624 // something except proof-of-stake block template
2625 if (!vtx[0].vout[0].IsEmpty())
2628 // if we are trying to sign
2629 // a complete proof-of-stake block
2630 if (IsProofOfStake())
2633 static int64_t nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2636 CTransaction txCoinStake;
2637 int64_t nSearchTime = txCoinStake.nTime; // search to current time
2639 if (nSearchTime > nLastCoinStakeSearchTime)
2641 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2643 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2645 // make sure coinstake would meet timestamp protocol
2646 // as it would be the same as the block timestamp
2647 vtx[0].nTime = nTime = txCoinStake.nTime;
2648 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2649 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2651 // we have to make sure that we have no future timestamps in
2652 // our transactions set
2653 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2654 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2656 vtx.insert(vtx.begin() + 1, txCoinStake);
2657 hashMerkleRoot = BuildMerkleTree();
2659 // append a signature to our block
2660 return key.Sign(GetHash(), vchBlockSig);
2663 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2664 nLastCoinStakeSearchTime = nSearchTime;
2670 // ppcoin: check block signature
2671 bool CBlock::CheckBlockSignature() const
2673 if (IsProofOfWork())
2676 vector<valtype> vSolutions;
2677 txnouttype whichType;
2679 const CTxOut& txout = vtx[1].vout[1];
2681 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2683 if (whichType == TX_PUBKEY)
2685 valtype& vchPubKey = vSolutions[0];
2687 if (!key.SetPubKey(vchPubKey))
2689 if (vchBlockSig.empty())
2691 return key.Verify(GetHash(), vchBlockSig);
2696 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2698 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2700 // Check for nMinDiskSpace bytes (currently 50MB)
2701 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2704 string strMessage = _("Warning: Disk space is low!");
2705 strMiscWarning = strMessage;
2706 printf("*** %s\n", strMessage.c_str());
2707 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2714 static filesystem::path BlockFilePath(unsigned int nFile)
2716 string strBlockFn = strprintf("blk%04u.dat", nFile);
2717 return GetDataDir() / strBlockFn;
2720 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2722 if ((nFile < 1) || (nFile == (unsigned int) -1))
2724 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2727 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2729 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2738 static unsigned int nCurrentBlockFile = 1;
2740 FILE* AppendBlockFile(unsigned int& nFileRet)
2745 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2748 if (fseek(file, 0, SEEK_END) != 0)
2750 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2751 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2753 nFileRet = nCurrentBlockFile;
2757 nCurrentBlockFile++;
2761 bool LoadBlockIndex(bool fAllowNew)
2765 pchMessageStart[0] = 0xcd;
2766 pchMessageStart[1] = 0xf2;
2767 pchMessageStart[2] = 0xc0;
2768 pchMessageStart[3] = 0xef;
2770 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2771 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2772 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2773 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2774 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2781 if (!txdb.LoadBlockIndex())
2785 // Init with genesis block
2787 if (mapBlockIndex.empty())
2796 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2797 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2798 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2800 // vMerkleTree: 4cb33b3b6a
2804 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2805 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2806 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2808 // vMerkleTree: 4cb33b3b6a
2810 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2812 txNew.nTime = 1360105017;
2813 txNew.vin.resize(1);
2814 txNew.vout.resize(1);
2815 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2816 txNew.vout[0].SetEmpty();
2818 block.vtx.push_back(txNew);
2819 block.hashPrevBlock = 0;
2820 block.hashMerkleRoot = block.BuildMerkleTree();
2822 block.nTime = 1360105017;
2823 block.nBits = bnProofOfWorkLimit.GetCompact();
2824 block.nNonce = !fTestNet ? 1575379 : 46534;
2827 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2829 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2830 assert(block.CheckBlock());
2832 // Start new block file
2834 unsigned int nBlockPos;
2835 if (!block.WriteToDisk(nFile, nBlockPos))
2836 return error("LoadBlockIndex() : writing genesis block to disk failed");
2837 if (!block.AddToBlockIndex(nFile, nBlockPos))
2838 return error("LoadBlockIndex() : genesis block not accepted");
2840 // initialize synchronized checkpoint
2841 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2842 return error("LoadBlockIndex() : failed to init sync checkpoint");
2844 // upgrade time set to zero if txdb initialized
2846 if (!txdb.WriteModifierUpgradeTime(0))
2847 return error("LoadBlockIndex() : failed to init upgrade info");
2848 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2854 string strPubKey = "";
2855 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2857 // write checkpoint master key to db
2859 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2860 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2861 if (!txdb.TxnCommit())
2862 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2863 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2864 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2867 // upgrade time set to zero if blocktreedb initialized
2868 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2870 if (nModifierUpgradeTime)
2871 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2873 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2877 nModifierUpgradeTime = GetTime();
2878 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2879 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2880 return error("LoadBlockIndex() : failed to write upgrade info");
2893 void PrintBlockTree()
2895 // pre-compute tree structure
2896 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2897 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2899 CBlockIndex* pindex = (*mi).second;
2900 mapNext[pindex->pprev].push_back(pindex);
2902 //while (rand() % 3 == 0)
2903 // mapNext[pindex->pprev].push_back(pindex);
2906 vector<pair<int, CBlockIndex*> > vStack;
2907 vStack.push_back(make_pair(0, pindexGenesisBlock));
2910 while (!vStack.empty())
2912 int nCol = vStack.back().first;
2913 CBlockIndex* pindex = vStack.back().second;
2916 // print split or gap
2917 if (nCol > nPrevCol)
2919 for (int i = 0; i < nCol-1; i++)
2923 else if (nCol < nPrevCol)
2925 for (int i = 0; i < nCol; i++)
2932 for (int i = 0; i < nCol; i++)
2937 block.ReadFromDisk(pindex);
2938 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2942 block.GetHash().ToString().c_str(),
2944 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2945 FormatMoney(pindex->nMint).c_str(),
2948 PrintWallets(block);
2950 // put the main time-chain first
2951 vector<CBlockIndex*>& vNext = mapNext[pindex];
2952 for (unsigned int i = 0; i < vNext.size(); i++)
2954 if (vNext[i]->pnext)
2956 swap(vNext[0], vNext[i]);
2962 for (unsigned int i = 0; i < vNext.size(); i++)
2963 vStack.push_back(make_pair(nCol+i, vNext[i]));
2967 bool LoadExternalBlockFile(FILE* fileIn)
2969 int64_t nStart = GetTimeMillis();
2975 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2976 unsigned int nPos = 0;
2977 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2979 unsigned char pchData[65536];
2981 fseek(blkdat, nPos, SEEK_SET);
2982 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2985 nPos = (unsigned int)-1;
2988 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2991 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2993 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2996 nPos += ((unsigned char*)nFind - pchData) + 1;
2999 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
3000 } while(!fRequestShutdown);
3001 if (nPos == (unsigned int)-1)
3003 fseek(blkdat, nPos, SEEK_SET);
3006 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3010 if (ProcessBlock(NULL,&block))
3018 catch (std::exception &e) {
3019 printf("%s() : Deserialize or I/O error caught during load\n",
3020 BOOST_CURRENT_FUNCTION);
3023 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
3027 //////////////////////////////////////////////////////////////////////////////
3032 extern map<uint256, CAlert> mapAlerts;
3033 extern CCriticalSection cs_mapAlerts;
3035 string GetWarnings(string strFor)
3038 string strStatusBar;
3041 if (GetBoolArg("-testsafemode"))
3044 // Misc warnings like out of disk space and clock is wrong
3045 if (strMiscWarning != "")
3048 strStatusBar = strMiscWarning;
3051 // if detected unmet upgrade requirement enter safe mode
3052 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3053 if (IsFixedModifierInterval(nModifierUpgradeTime + 60*60*24)) // 1 day margin
3056 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3059 // if detected invalid checkpoint enter safe mode
3060 if (Checkpoints::hashInvalidCheckpoint != 0)
3063 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3069 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3071 const CAlert& alert = item.second;
3072 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3074 nPriority = alert.nPriority;
3075 strStatusBar = alert.strStatusBar;
3076 if (nPriority > 1000)
3077 strRPC = strStatusBar;
3082 if (strFor == "statusbar")
3083 return strStatusBar;
3084 else if (strFor == "rpc")
3086 assert(!"GetWarnings() : invalid parameter");
3097 //////////////////////////////////////////////////////////////////////////////
3103 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3109 bool txInMap = false;
3112 txInMap = (mempool.exists(inv.hash));
3115 mapOrphanTransactions.count(inv.hash) ||
3116 txdb.ContainsTx(inv.hash);
3120 return mapBlockIndex.count(inv.hash) ||
3121 mapOrphanBlocks.count(inv.hash);
3123 // Don't know what it is, just say we already got one
3130 // The message start string is designed to be unlikely to occur in normal data.
3131 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3132 // a large 4-byte int at any alignment.
3133 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3135 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3137 static map<CService, CPubKey> mapReuseKey;
3138 RandAddSeedPerfmon();
3140 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3141 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3143 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3147 if (strCommand == "version")
3149 // Each connection can only send one version message
3150 if (pfrom->nVersion != 0)
3152 pfrom->Misbehaving(1);
3159 uint64_t nNonce = 1;
3160 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3161 if (pfrom->nVersion < MIN_PROTO_VERSION)
3163 // Since February 20, 2012, the protocol is initiated at version 209,
3164 // and earlier versions are no longer supported
3165 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3166 pfrom->fDisconnect = true;
3170 if (pfrom->nVersion == 10300)
3171 pfrom->nVersion = 300;
3173 vRecv >> addrFrom >> nNonce;
3175 vRecv >> pfrom->strSubVer;
3177 vRecv >> pfrom->nStartingHeight;
3179 if (pfrom->fInbound && addrMe.IsRoutable())
3181 pfrom->addrLocal = addrMe;
3185 // Disconnect if we connected to ourself
3186 if (nNonce == nLocalHostNonce && nNonce > 1)
3188 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3189 pfrom->fDisconnect = true;
3193 if (pfrom->nVersion < 60010)
3195 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3196 pfrom->fDisconnect = true;
3200 // record my external IP reported by peer
3201 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3202 addrSeenByPeer = addrMe;
3204 // Be shy and don't send version until we hear
3205 if (pfrom->fInbound)
3206 pfrom->PushVersion();
3208 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3210 AddTimeData(pfrom->addr, nTime);
3213 pfrom->PushMessage("verack");
3214 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3216 if (!pfrom->fInbound)
3218 // Advertise our address
3219 if (!fNoListen && !IsInitialBlockDownload())
3221 CAddress addr = GetLocalAddress(&pfrom->addr);
3222 if (addr.IsRoutable())
3223 pfrom->PushAddress(addr);
3226 // Get recent addresses
3227 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3229 pfrom->PushMessage("getaddr");
3230 pfrom->fGetAddr = true;
3232 addrman.Good(pfrom->addr);
3234 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3236 addrman.Add(addrFrom, addrFrom);
3237 addrman.Good(addrFrom);
3241 // Ask the first connected node for block updates
3242 static int nAskedForBlocks = 0;
3243 if (!pfrom->fClient && !pfrom->fOneShot &&
3244 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3245 (pfrom->nVersion < NOBLKS_VERSION_START ||
3246 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3247 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3250 pfrom->PushGetBlocks(pindexBest, uint256(0));
3256 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3257 item.second.RelayTo(pfrom);
3260 // Relay sync-checkpoint
3262 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3263 if (!Checkpoints::checkpointMessage.IsNull())
3264 Checkpoints::checkpointMessage.RelayTo(pfrom);
3267 pfrom->fSuccessfullyConnected = true;
3269 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());
3271 cPeerBlockCounts.input(pfrom->nStartingHeight);
3273 // ppcoin: ask for pending sync-checkpoint if any
3274 if (!IsInitialBlockDownload())
3275 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3279 else if (pfrom->nVersion == 0)
3281 // Must have a version message before anything else
3282 pfrom->Misbehaving(1);
3287 else if (strCommand == "verack")
3289 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3293 else if (strCommand == "addr")
3295 vector<CAddress> vAddr;
3298 // Don't want addr from older versions unless seeding
3299 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3301 if (vAddr.size() > 1000)
3303 pfrom->Misbehaving(20);
3304 return error("message addr size() = %" PRIszu "", vAddr.size());
3307 // Store the new addresses
3308 vector<CAddress> vAddrOk;
3309 int64_t nNow = GetAdjustedTime();
3310 int64_t nSince = nNow - 10 * 60;
3311 BOOST_FOREACH(CAddress& addr, vAddr)
3315 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3316 addr.nTime = nNow - 5 * 24 * 60 * 60;
3317 pfrom->AddAddressKnown(addr);
3318 bool fReachable = IsReachable(addr);
3319 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3321 // Relay to a limited number of other nodes
3324 // Use deterministic randomness to send to the same nodes for 24 hours
3325 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3326 static uint256 hashSalt;
3328 hashSalt = GetRandHash();
3329 uint64_t hashAddr = addr.GetHash();
3330 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3331 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3332 multimap<uint256, CNode*> mapMix;
3333 BOOST_FOREACH(CNode* pnode, vNodes)
3335 if (pnode->nVersion < CADDR_TIME_VERSION)
3337 unsigned int nPointer;
3338 memcpy(&nPointer, &pnode, sizeof(nPointer));
3339 uint256 hashKey = hashRand ^ nPointer;
3340 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3341 mapMix.insert(make_pair(hashKey, pnode));
3343 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3344 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3345 ((*mi).second)->PushAddress(addr);
3348 // Do not store addresses outside our network
3350 vAddrOk.push_back(addr);
3352 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3353 if (vAddr.size() < 1000)
3354 pfrom->fGetAddr = false;
3355 if (pfrom->fOneShot)
3356 pfrom->fDisconnect = true;
3359 else if (strCommand == "inv")
3363 if (vInv.size() > MAX_INV_SZ)
3365 pfrom->Misbehaving(20);
3366 return error("message inv size() = %" PRIszu "", vInv.size());
3369 // find last block in inv vector
3370 unsigned int nLastBlock = (unsigned int)(-1);
3371 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3372 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3373 nLastBlock = vInv.size() - 1 - nInv;
3378 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3380 const CInv &inv = vInv[nInv];
3384 pfrom->AddInventoryKnown(inv);
3386 bool fAlreadyHave = AlreadyHave(txdb, inv);
3388 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3392 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3393 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3394 } else if (nInv == nLastBlock) {
3395 // In case we are on a very long side-chain, it is possible that we already have
3396 // the last block in an inv bundle sent in response to getblocks. Try to detect
3397 // this situation and push another getblocks to continue.
3398 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3400 printf("force request: %s\n", inv.ToString().c_str());
3403 // Track requests for our stuff
3404 Inventory(inv.hash);
3409 else if (strCommand == "getdata")
3413 if (vInv.size() > MAX_INV_SZ)
3415 pfrom->Misbehaving(20);
3416 return error("message getdata size() = %" PRIszu "", vInv.size());
3419 if (fDebugNet || (vInv.size() != 1))
3420 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3422 BOOST_FOREACH(const CInv& inv, vInv)
3426 if (fDebugNet || (vInv.size() == 1))
3427 printf("received getdata for: %s\n", inv.ToString().c_str());
3429 if (inv.type == MSG_BLOCK)
3431 // Send block from disk
3432 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3433 if (mi != mapBlockIndex.end())
3436 block.ReadFromDisk((*mi).second);
3437 pfrom->PushMessage("block", block);
3439 // Trigger them to send a getblocks request for the next batch of inventory
3440 if (inv.hash == pfrom->hashContinue)
3442 // ppcoin: send latest proof-of-work block to allow the
3443 // download node to accept as orphan (proof-of-stake
3444 // block might be rejected by stake connection check)
3446 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3447 pfrom->PushMessage("inv", vInv);
3448 pfrom->hashContinue = 0;
3452 else if (inv.IsKnownType())
3454 // Send stream from relay memory
3455 bool pushed = false;
3458 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3459 if (mi != mapRelay.end()) {
3460 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3464 if (!pushed && inv.type == MSG_TX) {
3466 if (mempool.exists(inv.hash)) {
3467 CTransaction tx = mempool.lookup(inv.hash);
3468 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3471 pfrom->PushMessage("tx", ss);
3476 // Track requests for our stuff
3477 Inventory(inv.hash);
3482 else if (strCommand == "getblocks")
3484 CBlockLocator locator;
3486 vRecv >> locator >> hashStop;
3488 // Find the last block the caller has in the main chain
3489 CBlockIndex* pindex = locator.GetBlockIndex();
3491 // Send the rest of the chain
3493 pindex = pindex->pnext;
3495 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3496 for (; pindex; pindex = pindex->pnext)
3498 if (pindex->GetBlockHash() == hashStop)
3500 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3501 // ppcoin: tell downloading node about the latest block if it's
3502 // without risk being rejected due to stake connection check
3503 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3504 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3507 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3510 // When this block is requested, we'll send an inv that'll make them
3511 // getblocks the next batch of inventory.
3512 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3513 pfrom->hashContinue = pindex->GetBlockHash();
3518 else if (strCommand == "checkpoint")
3520 CSyncCheckpoint checkpoint;
3521 vRecv >> checkpoint;
3523 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3526 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3528 BOOST_FOREACH(CNode* pnode, vNodes)
3529 checkpoint.RelayTo(pnode);
3533 else if (strCommand == "getheaders")
3535 CBlockLocator locator;
3537 vRecv >> locator >> hashStop;
3539 CBlockIndex* pindex = NULL;
3540 if (locator.IsNull())
3542 // If locator is null, return the hashStop block
3543 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3544 if (mi == mapBlockIndex.end())
3546 pindex = (*mi).second;
3550 // Find the last block the caller has in the main chain
3551 pindex = locator.GetBlockIndex();
3553 pindex = pindex->pnext;
3556 vector<CBlock> vHeaders;
3558 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3559 for (; pindex; pindex = pindex->pnext)
3561 vHeaders.push_back(pindex->GetBlockHeader());
3562 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3565 pfrom->PushMessage("headers", vHeaders);
3569 else if (strCommand == "tx")
3571 vector<uint256> vWorkQueue;
3572 vector<uint256> vEraseQueue;
3573 CDataStream vMsg(vRecv);
3578 CInv inv(MSG_TX, tx.GetHash());
3579 pfrom->AddInventoryKnown(inv);
3581 bool fMissingInputs = false;
3582 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3584 SyncWithWallets(tx, NULL, true);
3585 RelayTransaction(tx, inv.hash);
3586 mapAlreadyAskedFor.erase(inv);
3587 vWorkQueue.push_back(inv.hash);
3588 vEraseQueue.push_back(inv.hash);
3590 // Recursively process any orphan transactions that depended on this one
3591 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3593 uint256 hashPrev = vWorkQueue[i];
3594 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3595 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3598 const uint256& orphanTxHash = *mi;
3599 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3600 bool fMissingInputs2 = false;
3602 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3604 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3605 SyncWithWallets(tx, NULL, true);
3606 RelayTransaction(orphanTx, orphanTxHash);
3607 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3608 vWorkQueue.push_back(orphanTxHash);
3609 vEraseQueue.push_back(orphanTxHash);
3611 else if (!fMissingInputs2)
3614 vEraseQueue.push_back(orphanTxHash);
3615 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3620 BOOST_FOREACH(uint256 hash, vEraseQueue)
3621 EraseOrphanTx(hash);
3623 else if (fMissingInputs)
3627 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3628 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3630 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3632 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3636 else if (strCommand == "block")
3640 uint256 hashBlock = block.GetHash();
3642 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3645 CInv inv(MSG_BLOCK, hashBlock);
3646 pfrom->AddInventoryKnown(inv);
3648 if (ProcessBlock(pfrom, &block))
3649 mapAlreadyAskedFor.erase(inv);
3650 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3654 else if (strCommand == "getaddr")
3656 // Don't return addresses older than nCutOff timestamp
3657 int64_t nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3658 pfrom->vAddrToSend.clear();
3659 vector<CAddress> vAddr = addrman.GetAddr();
3660 BOOST_FOREACH(const CAddress &addr, vAddr)
3661 if(addr.nTime > nCutOff)
3662 pfrom->PushAddress(addr);
3666 else if (strCommand == "mempool")
3668 std::vector<uint256> vtxid;
3669 mempool.queryHashes(vtxid);
3671 for (unsigned int i = 0; i < vtxid.size(); i++) {
3672 CInv inv(MSG_TX, vtxid[i]);
3673 vInv.push_back(inv);
3674 if (i == (MAX_INV_SZ - 1))
3677 if (vInv.size() > 0)
3678 pfrom->PushMessage("inv", vInv);
3682 else if (strCommand == "checkorder")
3687 if (!GetBoolArg("-allowreceivebyip"))
3689 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3696 /// we have a chance to check the order here
3698 // Keep giving the same key to the same ip until they use it
3699 if (!mapReuseKey.count(pfrom->addr))
3700 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3702 // Send back approval of order and pubkey to use
3703 CScript scriptPubKey;
3704 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3705 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3709 else if (strCommand == "reply")
3714 CRequestTracker tracker;
3716 LOCK(pfrom->cs_mapRequests);
3717 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3718 if (mi != pfrom->mapRequests.end())
3720 tracker = (*mi).second;
3721 pfrom->mapRequests.erase(mi);
3724 if (!tracker.IsNull())
3725 tracker.fn(tracker.param1, vRecv);
3729 else if (strCommand == "ping")
3731 if (pfrom->nVersion > BIP0031_VERSION)
3735 // Echo the message back with the nonce. This allows for two useful features:
3737 // 1) A remote node can quickly check if the connection is operational
3738 // 2) Remote nodes can measure the latency of the network thread. If this node
3739 // is overloaded it won't respond to pings quickly and the remote node can
3740 // avoid sending us more work, like chain download requests.
3742 // The nonce stops the remote getting confused between different pings: without
3743 // it, if the remote node sends a ping once per second and this node takes 5
3744 // seconds to respond to each, the 5th ping the remote sends would appear to
3745 // return very quickly.
3746 pfrom->PushMessage("pong", nonce);
3751 else if (strCommand == "alert")
3756 uint256 alertHash = alert.GetHash();
3757 if (pfrom->setKnown.count(alertHash) == 0)
3759 if (alert.ProcessAlert())
3762 pfrom->setKnown.insert(alertHash);
3765 BOOST_FOREACH(CNode* pnode, vNodes)
3766 alert.RelayTo(pnode);
3770 // Small DoS penalty so peers that send us lots of
3771 // duplicate/expired/invalid-signature/whatever alerts
3772 // eventually get banned.
3773 // This isn't a Misbehaving(100) (immediate ban) because the
3774 // peer might be an older or different implementation with
3775 // a different signature key, etc.
3776 pfrom->Misbehaving(10);
3784 // Ignore unknown commands for extensibility
3788 // Update the last seen time for this node's address
3789 if (pfrom->fNetworkNode)
3790 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3791 AddressCurrentlyConnected(pfrom->addr);
3797 bool ProcessMessages(CNode* pfrom)
3799 CDataStream& vRecv = pfrom->vRecv;
3803 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3807 // (4) message start
3816 // Don't bother if send buffer is too full to respond anyway
3817 if (pfrom->vSend.size() >= SendBufferSize())
3820 // Scan for message start
3821 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3822 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3823 if (vRecv.end() - pstart < nHeaderSize)
3825 if ((int)vRecv.size() > nHeaderSize)
3827 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3828 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3832 if (pstart - vRecv.begin() > 0)
3833 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3834 vRecv.erase(vRecv.begin(), pstart);
3837 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3842 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3845 string strCommand = hdr.GetCommand();
3848 unsigned int nMessageSize = hdr.nMessageSize;
3849 if (nMessageSize > MAX_SIZE)
3851 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3854 if (nMessageSize > vRecv.size())
3856 // Rewind and wait for rest of message
3857 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3862 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3863 unsigned int nChecksum = 0;
3864 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3865 if (nChecksum != hdr.nChecksum)
3867 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3868 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3872 // Copy message to its own buffer
3873 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3874 vRecv.ignore(nMessageSize);
3882 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3887 catch (std::ios_base::failure& e)
3889 if (strstr(e.what(), "end of data"))
3891 // Allow exceptions from under-length message on vRecv
3892 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());
3894 else if (strstr(e.what(), "size too large"))
3896 // Allow exceptions from over-long size
3897 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3901 PrintExceptionContinue(&e, "ProcessMessages()");
3904 catch (std::exception& e) {
3905 PrintExceptionContinue(&e, "ProcessMessages()");
3907 PrintExceptionContinue(NULL, "ProcessMessages()");
3911 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3919 bool SendMessages(CNode* pto, bool fSendTrickle)
3921 TRY_LOCK(cs_main, lockMain);
3923 // Don't send anything until we get their version message
3924 if (pto->nVersion == 0)
3927 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3929 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3931 if (pto->nVersion > BIP0031_VERSION)
3932 pto->PushMessage("ping", nonce);
3934 pto->PushMessage("ping");
3938 if (pto->fStartSync) {
3939 pto->fStartSync = false;
3940 pto->PushGetBlocks(pindexBest, uint256(0));
3943 // Resend wallet transactions that haven't gotten in a block yet
3944 ResendWalletTransactions();
3946 // Address refresh broadcast
3947 static int64_t nLastRebroadcast;
3948 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3952 BOOST_FOREACH(CNode* pnode, vNodes)
3954 // Periodically clear setAddrKnown to allow refresh broadcasts
3955 if (nLastRebroadcast)
3956 pnode->setAddrKnown.clear();
3958 // Rebroadcast our address
3961 CAddress addr = GetLocalAddress(&pnode->addr);
3962 if (addr.IsRoutable())
3963 pnode->PushAddress(addr);
3967 nLastRebroadcast = GetTime();
3975 vector<CAddress> vAddr;
3976 vAddr.reserve(pto->vAddrToSend.size());
3977 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3979 // returns true if wasn't already contained in the set
3980 if (pto->setAddrKnown.insert(addr).second)
3982 vAddr.push_back(addr);
3983 // receiver rejects addr messages larger than 1000
3984 if (vAddr.size() >= 1000)
3986 pto->PushMessage("addr", vAddr);
3991 pto->vAddrToSend.clear();
3993 pto->PushMessage("addr", vAddr);
3998 // Message: inventory
4001 vector<CInv> vInvWait;
4003 LOCK(pto->cs_inventory);
4004 vInv.reserve(pto->vInventoryToSend.size());
4005 vInvWait.reserve(pto->vInventoryToSend.size());
4006 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4008 if (pto->setInventoryKnown.count(inv))
4011 // trickle out tx inv to protect privacy
4012 if (inv.type == MSG_TX && !fSendTrickle)
4014 // 1/4 of tx invs blast to all immediately
4015 static uint256 hashSalt;
4017 hashSalt = GetRandHash();
4018 uint256 hashRand = inv.hash ^ hashSalt;
4019 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4020 bool fTrickleWait = ((hashRand & 3) != 0);
4022 // always trickle our own transactions
4026 if (GetTransaction(inv.hash, wtx))
4028 fTrickleWait = true;
4033 vInvWait.push_back(inv);
4038 // returns true if wasn't already contained in the set
4039 if (pto->setInventoryKnown.insert(inv).second)
4041 vInv.push_back(inv);
4042 if (vInv.size() >= 1000)
4044 pto->PushMessage("inv", vInv);
4049 pto->vInventoryToSend = vInvWait;
4052 pto->PushMessage("inv", vInv);
4058 vector<CInv> vGetData;
4059 int64_t nNow = GetTime() * 1000000;
4061 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4063 const CInv& inv = (*pto->mapAskFor.begin()).second;
4064 if (!AlreadyHave(txdb, inv))
4067 printf("sending getdata: %s\n", inv.ToString().c_str());
4068 vGetData.push_back(inv);
4069 if (vGetData.size() >= 1000)
4071 pto->PushMessage("getdata", vGetData);
4074 mapAlreadyAskedFor[inv] = nNow;
4076 pto->mapAskFor.erase(pto->mapAskFor.begin());
4078 if (!vGetData.empty())
4079 pto->PushMessage("getdata", vGetData);