1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "interface.h"
12 #include "checkqueue.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
40 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
42 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
44 unsigned int nStakeMinAge = 30 * nOneDay; // 30 days as zero time weight
45 unsigned int nStakeMaxAge = 90 * nOneDay; // 90 days as full weight
46 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
47 unsigned int nModifierInterval = 6 * nOneHour; // time to elapse before new modifier is computed
49 int nCoinbaseMaturity = 500;
51 CBlockIndex* pindexGenesisBlock = NULL;
54 uint256 nBestChainTrust = 0;
55 uint256 nBestInvalidTrust = 0;
57 uint256 hashBestChain = 0;
58 CBlockIndex* pindexBest = NULL;
59 int64_t nTimeBestReceived = 0;
60 int nScriptCheckThreads = 0;
62 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
64 map<uint256, CBlock*> mapOrphanBlocks;
65 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
66 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
67 map<uint256, uint256> mapProofOfStake;
69 map<uint256, CTransaction> mapOrphanTransactions;
70 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
72 // Constant stuff for coinbase transactions we create:
73 CScript COINBASE_FLAGS;
75 const string strMessageMagic = "NovaCoin Signed Message:\n";
78 int64_t nTransactionFee = MIN_TX_FEE;
79 int64_t nMinimumInputValue = MIN_TXOUT_AMOUNT;
81 // Ping and address broadcast intervals
82 int64_t nPingInterval = 30 * 60;
84 extern enum Checkpoints::CPMode CheckpointsMode;
86 //////////////////////////////////////////////////////////////////////////////
88 // dispatching functions
91 // These functions dispatch to one or all registered wallets
94 void RegisterWallet(CWallet* pwalletIn)
97 LOCK(cs_setpwalletRegistered);
98 setpwalletRegistered.insert(pwalletIn);
102 void UnregisterWallet(CWallet* pwalletIn)
105 LOCK(cs_setpwalletRegistered);
106 setpwalletRegistered.erase(pwalletIn);
110 // check whether the passed transaction is from us
111 bool static IsFromMe(CTransaction& tx)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 if (pwallet->IsFromMe(tx))
119 // erases transaction with the given hash from all wallets
120 void static EraseFromWallets(uint256 hash)
122 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
123 pwallet->EraseFromWallet(hash);
126 // make sure all wallets know about the given transaction, in the given block
127 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
131 // wallets need to refund inputs when disconnecting coinstake
132 if (tx.IsCoinStake())
134 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
135 if (pwallet->IsFromMe(tx))
136 pwallet->DisableTransaction(tx);
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
145 // notify wallets about a new best chain
146 void static SetBestChain(const CBlockLocator& loc)
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->SetBestChain(loc);
152 // notify wallets about an updated transaction
153 void static UpdatedTransaction(const uint256& hashTx)
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->UpdatedTransaction(hashTx);
160 void static PrintWallets(const CBlock& block)
162 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
163 pwallet->PrintWallet(block);
166 // notify wallets about an incoming inventory (for request counts)
167 void static Inventory(const uint256& hash)
169 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
170 pwallet->Inventory(hash);
173 // ask wallets to resend their transactions
174 void ResendWalletTransactions(bool fForceResend)
176 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
177 pwallet->ResendWalletTransactions(fForceResend);
186 //////////////////////////////////////////////////////////////////////////////
188 // mapOrphanTransactions
191 bool AddOrphanTx(const CTransaction& tx)
193 uint256 hash = tx.GetHash();
194 if (mapOrphanTransactions.count(hash))
197 // Ignore big transactions, to avoid a
198 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
199 // large transaction with a missing parent then we assume
200 // it will rebroadcast it later, after the parent transaction(s)
201 // have been mined or received.
202 // 10,000 orphans, each of which is at most 5,000 bytes big is
203 // at most 500 megabytes of orphans:
205 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
209 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
213 mapOrphanTransactions[hash] = tx;
214 BOOST_FOREACH(const CTxIn& txin, tx.vin)
215 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
217 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
218 mapOrphanTransactions.size());
222 void static EraseOrphanTx(uint256 hash)
224 if (!mapOrphanTransactions.count(hash))
226 const CTransaction& tx = mapOrphanTransactions[hash];
227 BOOST_FOREACH(const CTxIn& txin, tx.vin)
229 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
230 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
231 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
233 mapOrphanTransactions.erase(hash);
236 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
238 unsigned int nEvicted = 0;
239 while (mapOrphanTransactions.size() > nMaxOrphans)
241 // Evict a random orphan:
242 uint256 randomhash = GetRandHash();
243 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
244 if (it == mapOrphanTransactions.end())
245 it = mapOrphanTransactions.begin();
246 EraseOrphanTx(it->first);
258 //////////////////////////////////////////////////////////////////////////////
260 // CTransaction and CTxIndex
263 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
266 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
268 if (!ReadFromDisk(txindexRet.pos))
270 if (prevout.n >= vout.size())
278 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
281 return ReadFromDisk(txdb, prevout, txindex);
284 bool CTransaction::ReadFromDisk(COutPoint prevout)
288 return ReadFromDisk(txdb, prevout, txindex);
291 bool CTransaction::IsStandard(string& strReason) const
293 if (nVersion > CTransaction::CURRENT_VERSION)
295 strReason = "version";
299 unsigned int nDataOut = 0;
300 txnouttype whichType;
301 BOOST_FOREACH(const CTxIn& txin, vin)
303 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
304 // keys. (remember the 520 byte limit on redeemScript size) That works
305 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
306 // bytes of scriptSig, which we round off to 1650 bytes for some minor
307 // future-proofing. That's also enough to spend a 20-of-20
308 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
309 // considered standard)
310 if (txin.scriptSig.size() > 1650)
312 strReason = "scriptsig-size";
315 if (!txin.scriptSig.IsPushOnly())
317 strReason = "scriptsig-not-pushonly";
320 if (!txin.scriptSig.HasCanonicalPushes()) {
321 strReason = "txin-scriptsig-not-canonicalpushes";
325 BOOST_FOREACH(const CTxOut& txout, vout) {
326 if (!::IsStandard(txout.scriptPubKey, whichType)) {
327 strReason = "scriptpubkey";
330 if (whichType == TX_NULL_DATA)
333 if (txout.nValue == 0) {
334 strReason = "txout-value=0";
337 if (!txout.scriptPubKey.HasCanonicalPushes()) {
338 strReason = "txout-scriptsig-not-canonicalpushes";
344 // only one OP_RETURN txout is permitted
346 strReason = "multi-op-return";
354 // Check transaction inputs, and make sure any
355 // pay-to-script-hash transactions are evaluating IsStandard scripts
357 // Why bother? To avoid denial-of-service attacks; an attacker
358 // can submit a standard HASH... OP_EQUAL transaction,
359 // which will get accepted into blocks. The redemption
360 // script can be anything; an attacker could use a very
361 // expensive-to-check-upon-redemption script like:
362 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
364 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
367 return true; // Coinbases don't use vin normally
369 for (unsigned int i = 0; i < vin.size(); i++)
371 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
373 vector<vector<unsigned char> > vSolutions;
374 txnouttype whichType;
375 // get the scriptPubKey corresponding to this input:
376 const CScript& prevScript = prev.scriptPubKey;
377 if (!Solver(prevScript, whichType, vSolutions))
379 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
380 if (nArgsExpected < 0)
383 // Transactions with extra stuff in their scriptSigs are
384 // non-standard. Note that this EvalScript() call will
385 // be quick, because if there are any operations
386 // beside "push data" in the scriptSig the
387 // IsStandard() call returns false
388 vector<vector<unsigned char> > stack;
389 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
392 if (whichType == TX_SCRIPTHASH)
396 CScript subscript(stack.back().begin(), stack.back().end());
397 vector<vector<unsigned char> > vSolutions2;
398 txnouttype whichType2;
399 if (!Solver(subscript, whichType2, vSolutions2))
401 if (whichType2 == TX_SCRIPTHASH)
405 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
408 nArgsExpected += tmpExpected;
411 if (stack.size() != (unsigned int)nArgsExpected)
419 CTransaction::GetLegacySigOpCount() const
421 unsigned int nSigOps = 0;
424 // Coinbase scriptsigs are never executed, so there is
425 // no sense in calculation of sigops.
426 BOOST_FOREACH(const CTxIn& txin, vin)
428 nSigOps += txin.scriptSig.GetSigOpCount(false);
431 BOOST_FOREACH(const CTxOut& txout, vout)
433 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
438 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
451 // Load the block this tx is in
453 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
455 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
460 // Update the tx's hashBlock
461 hashBlock = pblock->GetHash();
463 // Locate the transaction
464 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
465 if (pblock->vtx[nIndex] == *(CTransaction*)this)
467 if (nIndex == (int)pblock->vtx.size())
469 vMerkleBranch.clear();
471 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
475 // Fill in merkle branch
476 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
479 // Is the tx in a block that's in the main chain
480 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
481 if (mi == mapBlockIndex.end())
483 const CBlockIndex* pindex = (*mi).second;
484 if (!pindex || !pindex->IsInMainChain())
487 return pindexBest->nHeight - pindex->nHeight + 1;
490 bool CTransaction::CheckTransaction() const
492 // Basic checks that don't depend on any context
494 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
496 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
498 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
499 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
501 // Check for negative or overflow output values
502 int64_t nValueOut = 0;
503 for (unsigned int i = 0; i < vout.size(); i++)
505 const CTxOut& txout = vout[i];
506 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
507 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
509 if (txout.nValue < 0)
510 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
511 if (txout.nValue > MAX_MONEY)
512 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
513 nValueOut += txout.nValue;
514 if (!MoneyRange(nValueOut))
515 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
518 // Check for duplicate inputs
519 set<COutPoint> vInOutPoints;
520 BOOST_FOREACH(const CTxIn& txin, vin)
522 if (vInOutPoints.count(txin.prevout))
524 vInOutPoints.insert(txin.prevout);
529 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
530 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
534 BOOST_FOREACH(const CTxIn& txin, vin)
535 if (txin.prevout.IsNull())
536 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
542 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
544 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
548 // Enforce 0.01 as minimum fee for coinstake
550 nMinRelayTxFee = CENT;
553 // Base fee is either nMinTxFee or nMinRelayTxFee
554 int64_t nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
556 unsigned int nNewBlockSize = nBlockSize + nBytes;
557 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
563 // Transactions under 1K are free
569 // Free transaction area
570 if (nNewBlockSize < 27000)
575 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
576 // each non empty output which is less than 0.01
578 // It's safe to ignore empty outputs here, because these inputs are allowed
579 // only for coinbase and coinstake transactions.
580 BOOST_FOREACH(const CTxOut& txout, vout)
581 if (txout.nValue < CENT && !txout.IsEmpty())
584 // Raise the price as the block approaches full
585 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
587 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
589 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
592 if (!MoneyRange(nMinFee))
599 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
600 bool* pfMissingInputs)
603 *pfMissingInputs = false;
605 // Time (prevent mempool memory exhaustion attack)
606 if (tx.nTime > FutureDrift(GetAdjustedTime()))
607 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
609 if (!tx.CheckTransaction())
610 return error("CTxMemPool::accept() : CheckTransaction failed");
612 // Coinbase is only valid in a block, not as a loose transaction
614 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
616 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
617 if (tx.IsCoinStake())
618 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
620 // To help v0.1.5 clients who would see it as a negative number
621 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
622 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
624 // Rather not work on nonstandard transactions (unless -testnet)
626 if (!fTestNet && !tx.IsStandard(strNonStd))
627 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
629 // Do we already have it?
630 uint256 hash = tx.GetHash();
633 if (mapTx.count(hash))
637 if (txdb.ContainsTx(hash))
640 // Check for conflicts with in-memory transactions
641 CTransaction* ptxOld = NULL;
642 for (unsigned int i = 0; i < tx.vin.size(); i++)
644 COutPoint outpoint = tx.vin[i].prevout;
645 if (mapNextTx.count(outpoint))
647 // Disable replacement feature for now
650 // Allow replacing with a newer version of the same transaction
653 ptxOld = mapNextTx[outpoint].ptx;
654 if (ptxOld->IsFinal())
656 if (!tx.IsNewerThan(*ptxOld))
658 for (unsigned int i = 0; i < tx.vin.size(); i++)
660 COutPoint outpoint = tx.vin[i].prevout;
661 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
671 map<uint256, CTxIndex> mapUnused;
672 bool fInvalid = false;
673 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
676 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
678 *pfMissingInputs = true;
682 // Check for non-standard pay-to-script-hash in inputs
683 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
684 return error("CTxMemPool::accept() : nonstandard transaction input");
686 // Note: if you modify this code to accept non-standard transactions, then
687 // you should add code here to check that the transaction does a
688 // reasonable number of ECDSA signature verifications.
690 int64_t nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
691 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
693 // Don't accept it if it can't get into a block
694 int64_t txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
695 if (nFees < txMinFee)
696 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
697 hash.ToString().c_str(),
700 // Continuously rate-limit free transactions
701 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
702 // be annoying or make others' transactions take longer to confirm.
703 if (nFees < MIN_RELAY_TX_FEE)
705 static CCriticalSection cs;
706 static double dFreeCount;
707 static int64_t nLastTime;
708 int64_t nNow = GetTime();
712 // Use an exponentially decaying ~10-minute window:
713 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
715 // -limitfreerelay unit is thousand-bytes-per-minute
716 // At default rate it would take over a month to fill 1GB
717 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
718 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
720 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
725 // Check against previous transactions
726 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
727 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
729 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
733 // Store transaction in memory
738 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
741 addUnchecked(hash, tx);
744 ///// are we sure this is ok when loading transactions or restoring block txes
745 // If updated, erase old tx from wallet
747 EraseFromWallets(ptxOld->GetHash());
749 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
750 hash.ToString().substr(0,10).c_str(),
755 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
757 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
760 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
762 // Add to memory pool without checking anything. Don't call this directly,
763 // call CTxMemPool::accept to properly check the transaction first.
766 for (unsigned int i = 0; i < tx.vin.size(); i++)
767 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
768 nTransactionsUpdated++;
774 bool CTxMemPool::remove(CTransaction &tx)
776 // Remove transaction from memory pool
779 uint256 hash = tx.GetHash();
780 if (mapTx.count(hash))
782 BOOST_FOREACH(const CTxIn& txin, tx.vin)
783 mapNextTx.erase(txin.prevout);
785 nTransactionsUpdated++;
791 void CTxMemPool::clear()
796 ++nTransactionsUpdated;
799 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
804 vtxid.reserve(mapTx.size());
805 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
806 vtxid.push_back((*mi).first);
812 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
814 if (hashBlock == 0 || nIndex == -1)
817 // Find the block it claims to be in
818 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
819 if (mi == mapBlockIndex.end())
821 CBlockIndex* pindex = (*mi).second;
822 if (!pindex || !pindex->IsInMainChain())
825 // Make sure the merkle branch connects to this block
826 if (!fMerkleVerified)
828 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
830 fMerkleVerified = true;
834 return pindexBest->nHeight - pindex->nHeight + 1;
838 int CMerkleTx::GetBlocksToMaturity() const
840 if (!(IsCoinBase() || IsCoinStake()))
842 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
846 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
850 if (!IsInMainChain() && !ClientConnectInputs())
852 return CTransaction::AcceptToMemoryPool(txdb, false);
856 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
860 bool CMerkleTx::AcceptToMemoryPool()
863 return AcceptToMemoryPool(txdb);
868 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
873 // Add previous supporting transactions first
874 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
876 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
878 uint256 hash = tx.GetHash();
879 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
880 tx.AcceptToMemoryPool(txdb, fCheckInputs);
883 return AcceptToMemoryPool(txdb, fCheckInputs);
888 bool CWalletTx::AcceptWalletTransaction()
891 return AcceptWalletTransaction(txdb);
894 int CTxIndex::GetDepthInMainChain() const
898 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
900 // Find the block in the index
901 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
902 if (mi == mapBlockIndex.end())
904 CBlockIndex* pindex = (*mi).second;
905 if (!pindex || !pindex->IsInMainChain())
907 return 1 + nBestHeight - pindex->nHeight;
910 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
911 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
917 if (mempool.exists(hash))
919 tx = mempool.lookup(hash);
925 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
928 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
929 hashBlock = block.GetHash();
943 //////////////////////////////////////////////////////////////////////////////
945 // CBlock and CBlockIndex
948 static CBlockIndex* pblockindexFBBHLast;
949 CBlockIndex* FindBlockByHeight(int nHeight)
951 CBlockIndex *pblockindex;
952 if (nHeight < nBestHeight / 2)
953 pblockindex = pindexGenesisBlock;
955 pblockindex = pindexBest;
956 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
957 pblockindex = pblockindexFBBHLast;
958 while (pblockindex->nHeight > nHeight)
959 pblockindex = pblockindex->pprev;
960 while (pblockindex->nHeight < nHeight)
961 pblockindex = pblockindex->pnext;
962 pblockindexFBBHLast = pblockindex;
966 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
968 if (!fReadTransactions)
970 *this = pindex->GetBlockHeader();
973 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
975 if (GetHash() != pindex->GetBlockHash())
976 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
980 uint256 static GetOrphanRoot(const CBlock* pblock)
982 // Work back to the first block in the orphan chain
983 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
984 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
985 return pblock->GetHash();
988 // ppcoin: find block wanted by given orphan block
989 uint256 WantedByOrphan(const CBlock* pblockOrphan)
991 // Work back to the first block in the orphan chain
992 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
993 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
994 return pblockOrphan->hashPrevBlock;
997 // select stake target limit according to hard-coded conditions
998 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1000 if(fTestNet) // separate proof of stake target limit for testnet
1001 return bnProofOfStakeLimit;
1002 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1003 return bnProofOfStakeLimit;
1004 if(nHeight + 1 > 15000) // 24 bits since block 15000
1005 return bnProofOfStakeLegacyLimit;
1006 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1007 return bnProofOfStakeHardLimit;
1009 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1012 // miner's coin base reward based on nBits
1013 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
1015 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1018 bnTarget.SetCompact(nBits);
1019 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1020 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1022 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1023 // A reasonably continuous curve is used to avoid shock to market
1024 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1026 // Human readable form:
1028 // nSubsidy = 100 / (diff ^ 1/6)
1030 // Please note that we're using bisection to find an approximate solutuion
1031 CBigNum bnLowerBound = CENT;
1032 CBigNum bnUpperBound = bnSubsidyLimit;
1033 while (bnLowerBound + CENT <= bnUpperBound)
1035 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1036 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1037 bnUpperBound = bnMidValue;
1039 bnLowerBound = bnMidValue;
1042 int64_t nSubsidy = bnUpperBound.getuint64();
1044 nSubsidy = (nSubsidy / CENT) * CENT;
1045 if (fDebug && GetBoolArg("-printcreation"))
1046 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1048 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1051 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1052 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1054 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1056 // Stage 2 of emission process is mostly PoS-based.
1058 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1060 bnTarget.SetCompact(nBits);
1061 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1062 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1064 // A reasonably continuous curve is used to avoid shock to market
1066 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1067 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1068 bnMidPart, bnRewardPart;
1070 while (bnLowerBound + CENT <= bnUpperBound)
1072 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1075 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1077 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1079 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1082 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1083 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1085 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1086 bnUpperBound = bnMidValue;
1088 bnLowerBound = bnMidValue;
1091 nRewardCoinYear = bnUpperBound.getuint64();
1092 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1095 return nRewardCoinYear;
1097 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1099 // Set reasonable reward limit for large inputs
1101 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1103 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1104 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1106 nSubsidy = min(nSubsidy, nSubsidyLimit);
1108 if (fDebug && GetBoolArg("-printcreation"))
1109 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1114 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1116 // get proof of work blocks max spacing according to hard-coded conditions
1117 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1119 if(nTime > TARGETS_SWITCH_TIME)
1120 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1123 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1125 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1129 // maximum nBits value could possible be required nTime after
1131 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1134 bnResult.SetCompact(nBase);
1136 while (nTime > 0 && bnResult < bnTargetLimit)
1138 // Maximum 200% adjustment per day...
1142 if (bnResult > bnTargetLimit)
1143 bnResult = bnTargetLimit;
1144 return bnResult.GetCompact();
1148 // minimum amount of work that could possibly be required nTime after
1149 // minimum proof-of-work required was nBase
1151 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1153 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1157 // minimum amount of stake that could possibly be required nTime after
1158 // minimum proof-of-stake required was nBase
1160 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1162 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1166 // ppcoin: find last block index up to pindex
1167 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1169 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1170 pindex = pindex->pprev;
1174 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1176 if (pindexLast == NULL)
1177 return bnProofOfWorkLimit.GetCompact(); // genesis block
1179 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1181 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1182 if (pindexPrev->pprev == NULL)
1183 return bnTargetLimit.GetCompact(); // first block
1184 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1185 if (pindexPrevPrev->pprev == NULL)
1186 return bnTargetLimit.GetCompact(); // second block
1188 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1190 // ppcoin: target change every block
1191 // ppcoin: retarget with exponential moving toward target spacing
1193 bnNew.SetCompact(pindexPrev->nBits);
1194 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1195 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1196 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1197 bnNew /= ((nInterval + 1) * nTargetSpacing);
1199 if (bnNew > bnTargetLimit)
1200 bnNew = bnTargetLimit;
1202 return bnNew.GetCompact();
1205 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1208 bnTarget.SetCompact(nBits);
1211 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1212 return error("CheckProofOfWork() : nBits below minimum work");
1214 // Check proof of work matches claimed amount
1215 if (hash > bnTarget.getuint256())
1216 return error("CheckProofOfWork() : hash doesn't match nBits");
1221 // Return maximum amount of blocks that other nodes claim to have
1222 int GetNumBlocksOfPeers()
1224 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1227 bool IsInitialBlockDownload()
1229 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1231 static int64_t nLastUpdate;
1232 static CBlockIndex* pindexLastBest;
1233 int64_t nCurrentTime = GetTime();
1234 if (pindexBest != pindexLastBest)
1236 pindexLastBest = pindexBest;
1237 nLastUpdate = nCurrentTime;
1239 return (nCurrentTime - nLastUpdate < 10 &&
1240 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1243 void static InvalidChainFound(CBlockIndex* pindexNew)
1245 if (pindexNew->nChainTrust > nBestInvalidTrust)
1247 nBestInvalidTrust = pindexNew->nChainTrust;
1248 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1249 uiInterface.NotifyBlocksChanged();
1252 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1253 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1255 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1256 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1257 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1258 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1259 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1260 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1261 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1262 nBestBlockTrust.Get64(),
1263 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1267 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1269 nTime = max(GetBlockTime(), GetAdjustedTime());
1282 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1284 // Relinquish previous transactions' spent pointers
1287 BOOST_FOREACH(const CTxIn& txin, vin)
1289 COutPoint prevout = txin.prevout;
1291 // Get prev txindex from disk
1293 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1294 return error("DisconnectInputs() : ReadTxIndex failed");
1296 if (prevout.n >= txindex.vSpent.size())
1297 return error("DisconnectInputs() : prevout.n out of range");
1299 // Mark outpoint as not spent
1300 txindex.vSpent[prevout.n].SetNull();
1303 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1304 return error("DisconnectInputs() : UpdateTxIndex failed");
1308 // Remove transaction from index
1309 // This can fail if a duplicate of this transaction was in a chain that got
1310 // reorganized away. This is only possible if this transaction was completely
1311 // spent, so erasing it would be a no-op anyway.
1312 txdb.EraseTxIndex(*this);
1318 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1319 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1321 // FetchInputs can return false either because we just haven't seen some inputs
1322 // (in which case the transaction should be stored as an orphan)
1323 // or because the transaction is malformed (in which case the transaction should
1324 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1328 return true; // Coinbase transactions have no inputs to fetch.
1330 for (unsigned int i = 0; i < vin.size(); i++)
1332 COutPoint prevout = vin[i].prevout;
1333 if (inputsRet.count(prevout.hash))
1334 continue; // Got it already
1337 CTxIndex& txindex = inputsRet[prevout.hash].first;
1339 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1341 // Get txindex from current proposed changes
1342 txindex = mapTestPool.find(prevout.hash)->second;
1346 // Read txindex from txdb
1347 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1349 if (!fFound && (fBlock || fMiner))
1350 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());
1353 CTransaction& txPrev = inputsRet[prevout.hash].second;
1354 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1356 // Get prev tx from single transactions in memory
1359 if (!mempool.exists(prevout.hash))
1360 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());
1361 txPrev = mempool.lookup(prevout.hash);
1364 txindex.vSpent.resize(txPrev.vout.size());
1368 // Get prev tx from disk
1369 if (!txPrev.ReadFromDisk(txindex.pos))
1370 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1374 // Make sure all prevout.n indexes are valid:
1375 for (unsigned int i = 0; i < vin.size(); i++)
1377 const COutPoint prevout = vin[i].prevout;
1378 assert(inputsRet.count(prevout.hash) != 0);
1379 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1380 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1381 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1383 // Revisit this if/when transaction replacement is implemented and allows
1386 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()));
1393 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1395 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1396 if (mi == inputs.end())
1397 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1399 const CTransaction& txPrev = (mi->second).second;
1400 if (input.prevout.n >= txPrev.vout.size())
1401 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1403 return txPrev.vout[input.prevout.n];
1406 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1411 int64_t nResult = 0;
1412 for (unsigned int i = 0; i < vin.size(); i++)
1414 nResult += GetOutputFor(vin[i], inputs).nValue;
1420 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1425 unsigned int nSigOps = 0;
1426 for (unsigned int i = 0; i < vin.size(); i++)
1428 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1429 if (prevout.scriptPubKey.IsPayToScriptHash())
1430 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1435 bool CScriptCheck::operator()() const {
1436 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1437 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1438 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1442 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1444 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1447 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1448 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1450 // Take over previous transactions' spent pointers
1451 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1452 // fMiner is true when called from the internal bitcoin miner
1453 // ... both are false when called from CTransaction::AcceptToMemoryPool
1457 int64_t nValueIn = 0;
1459 for (unsigned int i = 0; i < vin.size(); i++)
1461 COutPoint prevout = vin[i].prevout;
1462 assert(inputs.count(prevout.hash) > 0);
1463 CTxIndex& txindex = inputs[prevout.hash].first;
1464 CTransaction& txPrev = inputs[prevout.hash].second;
1466 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1467 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()));
1469 // If prev is coinbase or coinstake, check that it's matured
1470 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1471 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1472 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1473 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1475 // ppcoin: check transaction timestamp
1476 if (txPrev.nTime > nTime)
1477 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1479 // Check for negative or overflow input values
1480 nValueIn += txPrev.vout[prevout.n].nValue;
1481 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1482 return DoS(100, error("ConnectInputs() : txin values out of range"));
1487 pvChecks->reserve(vin.size());
1489 // The first loop above does all the inexpensive checks.
1490 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1491 // Helps prevent CPU exhaustion attacks.
1492 for (unsigned int i = 0; i < vin.size(); i++)
1494 COutPoint prevout = vin[i].prevout;
1495 assert(inputs.count(prevout.hash) > 0);
1496 CTxIndex& txindex = inputs[prevout.hash].first;
1497 CTransaction& txPrev = inputs[prevout.hash].second;
1499 // Check for conflicts (double-spend)
1500 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1501 // for an attacker to attempt to split the network.
1502 if (!txindex.vSpent[prevout.n].IsNull())
1503 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());
1505 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1506 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1507 // still computed and checked, and any change will be caught at the next checkpoint.
1511 CScriptCheck check(txPrev, *this, i, flags, 0);
1514 pvChecks->push_back(CScriptCheck());
1515 check.swap(pvChecks->back());
1519 if (flags & STRICT_FLAGS)
1521 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1522 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1524 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1526 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1530 // Mark outpoints as spent
1531 txindex.vSpent[prevout.n] = posThisTx;
1534 if (fBlock || fMiner)
1536 mapTestPool[prevout.hash] = txindex;
1542 if (nTime > Checkpoints::GetLastCheckpointTime())
1544 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1546 // coin stake tx earns reward instead of paying fee
1548 if (!GetCoinAge(txdb, nCoinAge))
1549 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1551 int64_t nReward = GetValueOut() - nValueIn;
1552 int64_t nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1554 if (nReward > nCalculatedReward)
1555 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1560 if (nValueIn < GetValueOut())
1561 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1563 // Tally transaction fees
1564 int64_t nTxFee = nValueIn - GetValueOut();
1566 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1569 if (!MoneyRange(nFees))
1570 return DoS(100, error("ConnectInputs() : nFees out of range"));
1578 bool CTransaction::ClientConnectInputs()
1583 // Take over previous transactions' spent pointers
1586 int64_t nValueIn = 0;
1587 for (unsigned int i = 0; i < vin.size(); i++)
1589 // Get prev tx from single transactions in memory
1590 COutPoint prevout = vin[i].prevout;
1591 if (!mempool.exists(prevout.hash))
1593 CTransaction& txPrev = mempool.lookup(prevout.hash);
1595 if (prevout.n >= txPrev.vout.size())
1599 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1600 return error("ClientConnectInputs() : VerifySignature failed");
1602 ///// this is redundant with the mempool.mapNextTx stuff,
1603 ///// not sure which I want to get rid of
1604 ///// this has to go away now that posNext is gone
1605 // // Check for conflicts
1606 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1607 // return error("ConnectInputs() : prev tx already used");
1609 // // Flag outpoints as used
1610 // txPrev.vout[prevout.n].posNext = posThisTx;
1612 nValueIn += txPrev.vout[prevout.n].nValue;
1614 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1615 return error("ClientConnectInputs() : txin values out of range");
1617 if (GetValueOut() > nValueIn)
1627 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1629 // Disconnect in reverse order
1630 for (int i = vtx.size()-1; i >= 0; i--)
1631 if (!vtx[i].DisconnectInputs(txdb))
1634 // Update block index on disk without changing it in memory.
1635 // The memory index structure will be changed after the db commits.
1638 CDiskBlockIndex blockindexPrev(pindex->pprev);
1639 blockindexPrev.hashNext = 0;
1640 if (!txdb.WriteBlockIndex(blockindexPrev))
1641 return error("DisconnectBlock() : WriteBlockIndex failed");
1644 // ppcoin: clean up wallet after disconnecting coinstake
1645 BOOST_FOREACH(CTransaction& tx, vtx)
1646 SyncWithWallets(tx, this, false, false);
1651 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1653 void ThreadScriptCheck(void*) {
1654 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1655 RenameThread("novacoin-scriptch");
1656 scriptcheckqueue.Thread();
1657 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1660 void ThreadScriptCheckQuit() {
1661 scriptcheckqueue.Quit();
1664 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1666 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1667 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1670 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1671 // unless those are already completely spent.
1672 // If such overwrites are allowed, coinbases and transactions depending upon those
1673 // can be duplicated to remove the ability to spend the first instance -- even after
1674 // being sent to another address.
1675 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1676 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1677 // already refuses previously-known transaction ids entirely.
1678 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1679 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1680 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1681 // initial block download.
1682 bool fEnforceBIP30 = true; // Always active in NovaCoin
1683 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1685 //// issue here: it doesn't know the version
1686 unsigned int nTxPos;
1688 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1689 // 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
1692 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1694 map<uint256, CTxIndex> mapQueuedChanges;
1695 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1698 int64_t nValueIn = 0;
1699 int64_t nValueOut = 0;
1700 unsigned int nSigOps = 0;
1701 BOOST_FOREACH(CTransaction& tx, vtx)
1703 uint256 hashTx = tx.GetHash();
1705 if (fEnforceBIP30) {
1706 CTxIndex txindexOld;
1707 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1708 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1714 nSigOps += tx.GetLegacySigOpCount();
1715 if (nSigOps > MAX_BLOCK_SIGOPS)
1716 return DoS(100, error("ConnectBlock() : too many sigops"));
1718 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1720 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1722 MapPrevTx mapInputs;
1723 if (tx.IsCoinBase())
1724 nValueOut += tx.GetValueOut();
1728 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1731 // Add in sigops done by pay-to-script-hash inputs;
1732 // this is to prevent a "rogue miner" from creating
1733 // an incredibly-expensive-to-validate block.
1734 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1735 if (nSigOps > MAX_BLOCK_SIGOPS)
1736 return DoS(100, error("ConnectBlock() : too many sigops"));
1738 int64_t nTxValueIn = tx.GetValueIn(mapInputs);
1739 int64_t nTxValueOut = tx.GetValueOut();
1740 nValueIn += nTxValueIn;
1741 nValueOut += nTxValueOut;
1742 if (!tx.IsCoinStake())
1743 nFees += nTxValueIn - nTxValueOut;
1745 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1747 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1748 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1751 if (tx.nTime >= CHECKSEQUENCEVERIFY_SWITCH_TIME) {
1752 nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
1755 std::vector<CScriptCheck> vChecks;
1756 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
1758 control.Add(vChecks);
1761 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1764 if (!control.Wait())
1765 return DoS(100, false);
1767 if (IsProofOfWork())
1769 int64_t nBlockReward = GetProofOfWorkReward(nBits, nFees);
1771 // Check coinbase reward
1772 if (vtx[0].GetValueOut() > nBlockReward)
1773 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1774 vtx[0].GetValueOut(),
1778 // track money supply and mint amount info
1779 pindex->nMint = nValueOut - nValueIn + nFees;
1780 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1781 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1782 return error("Connect() : WriteBlockIndex for pindex failed");
1784 // fees are not collected by proof-of-stake miners
1785 // fees are destroyed to compensate the entire network
1786 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1787 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1792 // Write queued txindex changes
1793 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1795 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1796 return error("ConnectBlock() : UpdateTxIndex failed");
1799 // Update block index on disk without changing it in memory.
1800 // The memory index structure will be changed after the db commits.
1803 CDiskBlockIndex blockindexPrev(pindex->pprev);
1804 blockindexPrev.hashNext = pindex->GetBlockHash();
1805 if (!txdb.WriteBlockIndex(blockindexPrev))
1806 return error("ConnectBlock() : WriteBlockIndex failed");
1809 // Watch for transactions paying to me
1810 BOOST_FOREACH(CTransaction& tx, vtx)
1811 SyncWithWallets(tx, this, true);
1817 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1819 printf("REORGANIZE\n");
1822 CBlockIndex* pfork = pindexBest;
1823 CBlockIndex* plonger = pindexNew;
1824 while (pfork != plonger)
1826 while (plonger->nHeight > pfork->nHeight)
1827 if ((plonger = plonger->pprev) == NULL)
1828 return error("Reorganize() : plonger->pprev is null");
1829 if (pfork == plonger)
1831 if ((pfork = pfork->pprev) == NULL)
1832 return error("Reorganize() : pfork->pprev is null");
1835 // List of what to disconnect
1836 vector<CBlockIndex*> vDisconnect;
1837 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1838 vDisconnect.push_back(pindex);
1840 // List of what to connect
1841 vector<CBlockIndex*> vConnect;
1842 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1843 vConnect.push_back(pindex);
1844 reverse(vConnect.begin(), vConnect.end());
1846 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());
1847 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());
1849 // Disconnect shorter branch
1850 vector<CTransaction> vResurrect;
1851 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1854 if (!block.ReadFromDisk(pindex))
1855 return error("Reorganize() : ReadFromDisk for disconnect failed");
1856 if (!block.DisconnectBlock(txdb, pindex))
1857 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1859 // Queue memory transactions to resurrect
1860 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1861 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1862 vResurrect.push_back(tx);
1865 // Connect longer branch
1866 vector<CTransaction> vDelete;
1867 for (unsigned int i = 0; i < vConnect.size(); i++)
1869 CBlockIndex* pindex = vConnect[i];
1871 if (!block.ReadFromDisk(pindex))
1872 return error("Reorganize() : ReadFromDisk for connect failed");
1873 if (!block.ConnectBlock(txdb, pindex))
1876 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1879 // Queue memory transactions to delete
1880 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1881 vDelete.push_back(tx);
1883 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1884 return error("Reorganize() : WriteHashBestChain failed");
1886 // Make sure it's successfully written to disk before changing memory structure
1887 if (!txdb.TxnCommit())
1888 return error("Reorganize() : TxnCommit failed");
1890 // Disconnect shorter branch
1891 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1893 pindex->pprev->pnext = NULL;
1895 // Connect longer branch
1896 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1898 pindex->pprev->pnext = pindex;
1900 // Resurrect memory transactions that were in the disconnected branch
1901 BOOST_FOREACH(CTransaction& tx, vResurrect)
1902 tx.AcceptToMemoryPool(txdb, false);
1904 // Delete redundant memory transactions that are in the connected branch
1905 BOOST_FOREACH(CTransaction& tx, vDelete)
1908 printf("REORGANIZE: done\n");
1914 // Called from inside SetBestChain: attaches a block to the new best chain being built
1915 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1917 uint256 hash = GetHash();
1919 // Adding to current best branch
1920 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1923 InvalidChainFound(pindexNew);
1926 if (!txdb.TxnCommit())
1927 return error("SetBestChain() : TxnCommit failed");
1929 // Add to current best branch
1930 pindexNew->pprev->pnext = pindexNew;
1932 // Delete redundant memory transactions
1933 BOOST_FOREACH(CTransaction& tx, vtx)
1939 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1941 uint256 hash = GetHash();
1943 if (!txdb.TxnBegin())
1944 return error("SetBestChain() : TxnBegin failed");
1946 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1948 txdb.WriteHashBestChain(hash);
1949 if (!txdb.TxnCommit())
1950 return error("SetBestChain() : TxnCommit failed");
1951 pindexGenesisBlock = pindexNew;
1953 else if (hashPrevBlock == hashBestChain)
1955 if (!SetBestChainInner(txdb, pindexNew))
1956 return error("SetBestChain() : SetBestChainInner failed");
1960 // the first block in the new chain that will cause it to become the new best chain
1961 CBlockIndex *pindexIntermediate = pindexNew;
1963 // list of blocks that need to be connected afterwards
1964 std::vector<CBlockIndex*> vpindexSecondary;
1966 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1967 // Try to limit how much needs to be done inside
1968 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1970 vpindexSecondary.push_back(pindexIntermediate);
1971 pindexIntermediate = pindexIntermediate->pprev;
1974 if (!vpindexSecondary.empty())
1975 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
1977 // Switch to new best branch
1978 if (!Reorganize(txdb, pindexIntermediate))
1981 InvalidChainFound(pindexNew);
1982 return error("SetBestChain() : Reorganize failed");
1985 // Connect further blocks
1986 for (std::vector<CBlockIndex*>::reverse_iterator rit = vpindexSecondary.rbegin(); rit != vpindexSecondary.rend(); ++rit)
1989 if (!block.ReadFromDisk(*rit))
1991 printf("SetBestChain() : ReadFromDisk failed\n");
1994 if (!txdb.TxnBegin()) {
1995 printf("SetBestChain() : TxnBegin 2 failed\n");
1998 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1999 if (!block.SetBestChainInner(txdb, *rit))
2004 // Update best block in wallet (so we can detect restored wallets)
2005 bool fIsInitialDownload = IsInitialBlockDownload();
2006 if (!fIsInitialDownload)
2008 const CBlockLocator locator(pindexNew);
2009 ::SetBestChain(locator);
2013 hashBestChain = hash;
2014 pindexBest = pindexNew;
2015 pblockindexFBBHLast = NULL;
2016 nBestHeight = pindexBest->nHeight;
2017 nBestChainTrust = pindexNew->nChainTrust;
2018 nTimeBestReceived = GetTime();
2019 nTransactionsUpdated++;
2021 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2023 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
2024 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2025 CBigNum(nBestChainTrust).ToString().c_str(),
2026 nBestBlockTrust.Get64(),
2027 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2029 // Check the version of the last 100 blocks to see if we need to upgrade:
2030 if (!fIsInitialDownload)
2033 const CBlockIndex* pindex = pindexBest;
2034 for (int i = 0; i < 100 && pindex != NULL; i++)
2036 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2038 pindex = pindex->pprev;
2041 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2042 if (nUpgraded > 100/2)
2043 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2044 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2047 std::string strCmd = GetArg("-blocknotify", "");
2049 if (!fIsInitialDownload && !strCmd.empty())
2051 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2052 boost::thread t(runCommand, strCmd); // thread runs free
2058 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2059 // Only those coins meeting minimum age requirement counts. As those
2060 // transactions not in main chain are not currently indexed so we
2061 // might not find out about their coin age. Older transactions are
2062 // guaranteed to be in main chain by sync-checkpoint. This rule is
2063 // introduced to help nodes establish a consistent view of the coin
2064 // age (trust score) of competing branches.
2065 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2067 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2073 BOOST_FOREACH(const CTxIn& txin, vin)
2075 // First try finding the previous transaction in database
2076 CTransaction txPrev;
2078 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2079 continue; // previous transaction not in main chain
2080 if (nTime < txPrev.nTime)
2081 return false; // Transaction timestamp violation
2083 // Read block header
2085 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2086 return false; // unable to read block of previous transaction
2087 if (block.GetBlockTime() + nStakeMinAge > nTime)
2088 continue; // only count coins meeting min age requirement
2090 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
2091 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2093 if (fDebug && GetBoolArg("-printcoinage"))
2094 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2097 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2098 if (fDebug && GetBoolArg("-printcoinage"))
2099 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2100 nCoinAge = bnCoinDay.getuint64();
2104 // ppcoin: total coin age spent in block, in the unit of coin-days.
2105 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2110 BOOST_FOREACH(const CTransaction& tx, vtx)
2112 uint64_t nTxCoinAge;
2113 if (tx.GetCoinAge(txdb, nTxCoinAge))
2114 nCoinAge += nTxCoinAge;
2119 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2121 if (fDebug && GetBoolArg("-printcoinage"))
2122 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2126 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2128 // Check for duplicate
2129 uint256 hash = GetHash();
2130 if (mapBlockIndex.count(hash))
2131 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2133 // Construct new block index object
2134 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2136 return error("AddToBlockIndex() : new CBlockIndex failed");
2137 pindexNew->phashBlock = &hash;
2138 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2139 if (miPrev != mapBlockIndex.end())
2141 pindexNew->pprev = (*miPrev).second;
2142 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2145 // ppcoin: compute chain trust score
2146 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2148 // ppcoin: compute stake entropy bit for stake modifier
2149 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2150 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2152 // ppcoin: record proof-of-stake hash value
2153 if (pindexNew->IsProofOfStake())
2155 if (!mapProofOfStake.count(hash))
2156 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2157 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2160 // ppcoin: compute stake modifier
2161 uint64_t nStakeModifier = 0;
2162 bool fGeneratedStakeModifier = false;
2163 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2164 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2165 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2166 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2167 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2168 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2170 // Add to mapBlockIndex
2171 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2172 if (pindexNew->IsProofOfStake())
2173 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2174 pindexNew->phashBlock = &((*mi).first);
2176 // Write to disk block index
2178 if (!txdb.TxnBegin())
2180 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2181 if (!txdb.TxnCommit())
2185 if (pindexNew->nChainTrust > nBestChainTrust)
2186 if (!SetBestChain(txdb, pindexNew))
2189 if (pindexNew == pindexBest)
2191 // Notify UI to display prev block's coinbase if it was ours
2192 static uint256 hashPrevBestCoinBase;
2193 UpdatedTransaction(hashPrevBestCoinBase);
2194 hashPrevBestCoinBase = vtx[0].GetHash();
2197 static int8_t counter = 0;
2198 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2199 uiInterface.NotifyBlocksChanged();
2206 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2208 // These are checks that are independent of context
2209 // that can be verified before saving an orphan block.
2211 set<uint256> uniqueTx; // tx hashes
2212 unsigned int nSigOps = 0; // total sigops
2215 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2216 return DoS(100, error("CheckBlock() : size limits failed"));
2218 bool fProofOfStake = IsProofOfStake();
2220 // First transaction must be coinbase, the rest must not be
2221 if (!vtx[0].IsCoinBase())
2222 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2224 if (!vtx[0].CheckTransaction())
2225 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2227 uniqueTx.insert(vtx[0].GetHash());
2228 nSigOps += vtx[0].GetLegacySigOpCount();
2232 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2233 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2235 // nNonce must be zero for proof-of-stake blocks
2237 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2239 // Coinbase output should be empty if proof-of-stake block
2240 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2241 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2243 // Check coinstake timestamp
2244 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2245 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2247 // NovaCoin: check proof-of-stake block signature
2248 if (fCheckSig && !CheckBlockSignature())
2249 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2251 if (!vtx[1].CheckTransaction())
2252 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2254 uniqueTx.insert(vtx[1].GetHash());
2255 nSigOps += vtx[1].GetLegacySigOpCount();
2259 // Check proof of work matches claimed amount
2260 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2261 return DoS(50, error("CheckBlock() : proof of work failed"));
2264 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2265 return error("CheckBlock() : block timestamp too far in the future");
2267 // Check coinbase timestamp
2268 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2269 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2272 // Iterate all transactions starting from second for proof-of-stake block
2273 // or first for proof-of-work block
2274 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2276 const CTransaction& tx = vtx[i];
2278 // Reject coinbase transactions at non-zero index
2279 if (tx.IsCoinBase())
2280 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2282 // Reject coinstake transactions at index != 1
2283 if (tx.IsCoinStake())
2284 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2286 // Check transaction timestamp
2287 if (GetBlockTime() < (int64_t)tx.nTime)
2288 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2290 // Check transaction consistency
2291 if (!tx.CheckTransaction())
2292 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2294 // Add transaction hash into list of unique transaction IDs
2295 uniqueTx.insert(tx.GetHash());
2297 // Calculate sigops count
2298 nSigOps += tx.GetLegacySigOpCount();
2301 // Check for duplicate txids. This is caught by ConnectInputs(),
2302 // but catching it earlier avoids a potential DoS attack:
2303 if (uniqueTx.size() != vtx.size())
2304 return DoS(100, error("CheckBlock() : duplicate transaction"));
2306 // Reject block if validation would consume too much resources.
2307 if (nSigOps > MAX_BLOCK_SIGOPS)
2308 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2310 // Check merkle root
2311 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2312 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2317 bool CBlock::AcceptBlock()
2319 // Check for duplicate
2320 uint256 hash = GetHash();
2321 if (mapBlockIndex.count(hash))
2322 return error("AcceptBlock() : block already in mapBlockIndex");
2324 // Get prev block index
2325 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2326 if (mi == mapBlockIndex.end())
2327 return DoS(10, error("AcceptBlock() : prev block not found"));
2328 CBlockIndex* pindexPrev = (*mi).second;
2329 int nHeight = pindexPrev->nHeight+1;
2331 // Check proof-of-work or proof-of-stake
2332 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2333 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2335 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2336 int nMaxOffset = 12 * nOneHour; // 12 hours
2337 if (fTestNet || pindexPrev->nTime < 1450569600)
2338 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2340 // Check timestamp against prev
2341 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2342 return error("AcceptBlock() : block's timestamp is too early");
2344 // Don't accept blocks with future timestamps
2345 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2346 return error("AcceptBlock() : block's timestamp is too far in the future");
2348 // Check that all transactions are finalized
2349 BOOST_FOREACH(const CTransaction& tx, vtx)
2350 if (!tx.IsFinal(nHeight, GetBlockTime()))
2351 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2353 // Check that the block chain matches the known block chain up to a checkpoint
2354 if (!Checkpoints::CheckHardened(nHeight, hash))
2355 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2357 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2359 // Check that the block satisfies synchronized checkpoint
2360 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2361 return error("AcceptBlock() : rejected by synchronized checkpoint");
2363 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2364 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2366 // Enforce rule that the coinbase starts with serialized block height
2367 CScript expect = CScript() << nHeight;
2368 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2369 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2370 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2372 // Write block to history file
2373 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2374 return error("AcceptBlock() : out of disk space");
2375 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2376 unsigned int nBlockPos = 0;
2377 if (!WriteToDisk(nFile, nBlockPos))
2378 return error("AcceptBlock() : WriteToDisk failed");
2379 if (!AddToBlockIndex(nFile, nBlockPos))
2380 return error("AcceptBlock() : AddToBlockIndex failed");
2382 // Relay inventory, but don't relay old inventory during initial block download
2383 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2384 if (hashBestChain == hash)
2387 BOOST_FOREACH(CNode* pnode, vNodes)
2388 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2389 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2392 // ppcoin: check pending sync-checkpoint
2393 Checkpoints::AcceptPendingSyncCheckpoint();
2398 uint256 CBlockIndex::GetBlockTrust() const
2401 bnTarget.SetCompact(nBits);
2406 // Return 1 for the first 12 blocks
2407 if (pprev == NULL || pprev->nHeight < 12)
2410 const CBlockIndex* currentIndex = pprev;
2412 if(IsProofOfStake())
2414 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2416 // Return 1/3 of score if parent block is not the PoW block
2417 if (!pprev->IsProofOfWork())
2418 return (bnNewTrust / 3).getuint256();
2422 // Check last 12 blocks type
2423 while (pprev->nHeight - currentIndex->nHeight < 12)
2425 if (currentIndex->IsProofOfWork())
2427 currentIndex = currentIndex->pprev;
2430 // Return 1/3 of score if less than 3 PoW blocks found
2432 return (bnNewTrust / 3).getuint256();
2434 return bnNewTrust.getuint256();
2438 // Calculate work amount for block
2439 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2441 // Set nPowTrust to 1 if PoW difficulty is too low
2445 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2447 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2448 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2449 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2453 // Check last 12 blocks type
2454 while (pprev->nHeight - currentIndex->nHeight < 12)
2456 if (currentIndex->IsProofOfStake())
2458 currentIndex = currentIndex->pprev;
2461 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2463 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2465 bnTarget.SetCompact(pprev->nBits);
2470 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2472 // Return nPoWTrust + full trust score for previous block nBits
2473 return (bnPoWTrust + bnNewTrust).getuint256();
2477 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2479 unsigned int nFound = 0;
2480 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2482 if (pstart->nVersion >= minVersion)
2484 pstart = pstart->pprev;
2486 return (nFound >= nRequired);
2489 bool static ReserealizeBlockSignature(CBlock* pblock)
2491 if (pblock->IsProofOfWork())
2493 pblock->vchBlockSig.clear();
2497 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2500 bool static IsCanonicalBlockSignature(CBlock* pblock)
2502 if (pblock->IsProofOfWork())
2503 return pblock->vchBlockSig.empty();
2505 return IsDERSignature(pblock->vchBlockSig);
2508 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2510 // Check for duplicate
2511 uint256 hash = pblock->GetHash();
2512 if (mapBlockIndex.count(hash))
2513 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2514 if (mapOrphanBlocks.count(hash))
2515 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2517 // Check that block isn't listed as unconditionally banned.
2518 if (!Checkpoints::CheckBanned(hash)) {
2520 pfrom->Misbehaving(100);
2521 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2524 // Check proof-of-stake
2525 // Limited duplicity on stake: prevents block flood attack
2526 // Duplicate stake allowed only when there is orphan child block
2527 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2528 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());
2530 // Strip the garbage from newly received blocks, if we found some
2531 if (!IsCanonicalBlockSignature(pblock)) {
2532 if (!ReserealizeBlockSignature(pblock))
2533 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2536 // Preliminary checks
2537 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2538 return error("ProcessBlock() : CheckBlock FAILED");
2540 // ppcoin: verify hash target and signature of coinstake tx
2541 if (pblock->IsProofOfStake())
2543 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2544 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2546 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2547 return false; // do not error here as we expect this during initial block download
2549 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2550 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2553 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2554 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2556 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2557 int64_t deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2559 bnNewBlock.SetCompact(pblock->nBits);
2562 if (pblock->IsProofOfStake())
2563 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2565 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2567 if (bnNewBlock > bnRequired)
2570 pfrom->Misbehaving(100);
2571 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2575 // ppcoin: ask for pending sync-checkpoint if any
2576 if (!IsInitialBlockDownload())
2577 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2579 // If don't already have its previous block, shunt it off to holding area until we get it
2580 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2582 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2583 // ppcoin: check proof-of-stake
2584 if (pblock->IsProofOfStake())
2586 // Limited duplicity on stake: prevents block flood attack
2587 // Duplicate stake allowed only when there is orphan child block
2588 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2589 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2591 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2593 CBlock* pblock2 = new CBlock(*pblock);
2594 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2595 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2597 // Ask this guy to fill in what we're missing
2600 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2601 // ppcoin: getblocks may not obtain the ancestor block rejected
2602 // earlier by duplicate-stake check so we ask for it again directly
2603 if (!IsInitialBlockDownload())
2604 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2610 if (!pblock->AcceptBlock())
2611 return error("ProcessBlock() : AcceptBlock FAILED");
2613 // Recursively process any orphan blocks that depended on this one
2614 vector<uint256> vWorkQueue;
2615 vWorkQueue.push_back(hash);
2616 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2618 uint256 hashPrev = vWorkQueue[i];
2619 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2620 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2623 CBlock* pblockOrphan = (*mi).second;
2624 if (pblockOrphan->AcceptBlock())
2625 vWorkQueue.push_back(pblockOrphan->GetHash());
2626 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2627 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2628 delete pblockOrphan;
2630 mapOrphanBlocksByPrev.erase(hashPrev);
2633 printf("ProcessBlock: ACCEPTED\n");
2635 // ppcoin: if responsible for sync-checkpoint send it
2636 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2637 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2642 // ppcoin: check block signature
2643 bool CBlock::CheckBlockSignature() const
2645 if (vchBlockSig.empty())
2648 txnouttype whichType;
2649 vector<valtype> vSolutions;
2650 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2653 if (whichType == TX_PUBKEY)
2655 valtype& vchPubKey = vSolutions[0];
2656 CPubKey key(vchPubKey);
2659 return key.Verify(GetHash(), vchBlockSig);
2665 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2667 uint64_t nFreeBytesAvailable = boost::filesystem::space(GetDataDir()).available;
2669 // Check for nMinDiskSpace bytes (currently 50MB)
2670 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2673 string strMessage = _("Warning: Disk space is low!");
2674 strMiscWarning = strMessage;
2675 printf("*** %s\n", strMessage.c_str());
2676 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2683 static boost::filesystem::path BlockFilePath(unsigned int nFile)
2685 string strBlockFn = strprintf("blk%04u.dat", nFile);
2686 return GetDataDir() / strBlockFn;
2689 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2691 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
2693 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2696 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2698 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2707 static unsigned int nCurrentBlockFile = 1;
2709 FILE* AppendBlockFile(unsigned int& nFileRet)
2714 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2717 if (fseek(file, 0, SEEK_END) != 0)
2719 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2720 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2722 nFileRet = nCurrentBlockFile;
2726 nCurrentBlockFile++;
2730 void UnloadBlockIndex()
2732 mapBlockIndex.clear();
2733 setStakeSeen.clear();
2734 pindexGenesisBlock = NULL;
2736 nBestChainTrust = 0;
2737 nBestInvalidTrust = 0;
2742 bool LoadBlockIndex(bool fAllowNew)
2746 pchMessageStart[0] = 0xcd;
2747 pchMessageStart[1] = 0xf2;
2748 pchMessageStart[2] = 0xc0;
2749 pchMessageStart[3] = 0xef;
2751 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2752 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
2753 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2754 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2755 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2762 if (!txdb.LoadBlockIndex())
2766 // Init with genesis block
2768 if (mapBlockIndex.empty())
2777 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2778 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2779 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2781 // vMerkleTree: 4cb33b3b6a
2785 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2786 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2787 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2789 // vMerkleTree: 4cb33b3b6a
2791 const string strTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2793 txNew.nTime = 1360105017;
2794 txNew.vin.resize(1);
2795 txNew.vout.resize(1);
2796 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>(strTimestamp.begin(), strTimestamp.end());
2797 txNew.vout[0].SetEmpty();
2799 block.vtx.push_back(txNew);
2800 block.hashPrevBlock = 0;
2801 block.hashMerkleRoot = block.BuildMerkleTree();
2803 block.nTime = 1360105017;
2804 block.nBits = bnProofOfWorkLimit.GetCompact();
2805 block.nNonce = !fTestNet ? 1575379 : 46534;
2808 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2810 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2811 assert(block.CheckBlock());
2813 // Start new block file
2815 unsigned int nBlockPos;
2816 if (!block.WriteToDisk(nFile, nBlockPos))
2817 return error("LoadBlockIndex() : writing genesis block to disk failed");
2818 if (!block.AddToBlockIndex(nFile, nBlockPos))
2819 return error("LoadBlockIndex() : genesis block not accepted");
2821 // initialize synchronized checkpoint
2822 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2823 return error("LoadBlockIndex() : failed to init sync checkpoint");
2825 // upgrade time set to zero if txdb initialized
2827 if (!txdb.WriteModifierUpgradeTime(0))
2828 return error("LoadBlockIndex() : failed to init upgrade info");
2829 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2835 string strPubKey = "";
2836 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2838 // write checkpoint master key to db
2840 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2841 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2842 if (!txdb.TxnCommit())
2843 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2844 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2845 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2848 // upgrade time set to zero if blocktreedb initialized
2849 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2851 if (nModifierUpgradeTime)
2852 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2854 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2858 nModifierUpgradeTime = GetTime();
2859 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2860 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2861 return error("LoadBlockIndex() : failed to write upgrade info");
2874 void PrintBlockTree()
2876 // pre-compute tree structure
2877 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2878 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2880 CBlockIndex* pindex = (*mi).second;
2881 mapNext[pindex->pprev].push_back(pindex);
2883 //while (rand() % 3 == 0)
2884 // mapNext[pindex->pprev].push_back(pindex);
2887 vector<pair<int, CBlockIndex*> > vStack;
2888 vStack.push_back(make_pair(0, pindexGenesisBlock));
2891 while (!vStack.empty())
2893 int nCol = vStack.back().first;
2894 CBlockIndex* pindex = vStack.back().second;
2897 // print split or gap
2898 if (nCol > nPrevCol)
2900 for (int i = 0; i < nCol-1; i++)
2904 else if (nCol < nPrevCol)
2906 for (int i = 0; i < nCol; i++)
2913 for (int i = 0; i < nCol; i++)
2918 block.ReadFromDisk(pindex);
2919 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2923 block.GetHash().ToString().c_str(),
2925 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2926 FormatMoney(pindex->nMint).c_str(),
2929 PrintWallets(block);
2931 // put the main time-chain first
2932 vector<CBlockIndex*>& vNext = mapNext[pindex];
2933 for (unsigned int i = 0; i < vNext.size(); i++)
2935 if (vNext[i]->pnext)
2937 swap(vNext[0], vNext[i]);
2943 for (unsigned int i = 0; i < vNext.size(); i++)
2944 vStack.push_back(make_pair(nCol+i, vNext[i]));
2948 bool LoadExternalBlockFile(FILE* fileIn)
2950 int64_t nStart = GetTimeMillis();
2956 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2957 unsigned int nPos = 0;
2958 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
2960 unsigned char pchData[65536];
2962 fseek(blkdat, nPos, SEEK_SET);
2963 size_t nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2966 nPos = std::numeric_limits<uint32_t>::max();
2969 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2972 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2974 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2977 nPos += ((unsigned char*)nFind - pchData) + 1;
2980 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2981 } while(!fRequestShutdown);
2982 if (nPos == std::numeric_limits<uint32_t>::max())
2984 fseek(blkdat, nPos, SEEK_SET);
2987 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2991 if (ProcessBlock(NULL,&block))
2999 catch (const std::exception&) {
3000 printf("%s() : Deserialize or I/O error caught during load\n",
3001 BOOST_CURRENT_FUNCTION);
3004 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
3008 //////////////////////////////////////////////////////////////////////////////
3013 extern map<uint256, CAlert> mapAlerts;
3014 extern CCriticalSection cs_mapAlerts;
3016 string GetWarnings(string strFor)
3019 string strStatusBar;
3022 if (GetBoolArg("-testsafemode"))
3025 // Misc warnings like out of disk space and clock is wrong
3026 if (!strMiscWarning.empty())
3029 strStatusBar = strMiscWarning;
3032 // if detected unmet upgrade requirement enter safe mode
3033 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3034 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3037 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3040 // if detected invalid checkpoint enter safe mode
3041 if (Checkpoints::hashInvalidCheckpoint != 0)
3044 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3050 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3052 const CAlert& alert = item.second;
3053 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3055 nPriority = alert.nPriority;
3056 strStatusBar = alert.strStatusBar;
3057 if (nPriority > 1000)
3058 strRPC = strStatusBar;
3063 if (strFor == "statusbar")
3064 return strStatusBar;
3065 else if (strFor == "rpc")
3067 assert(!"GetWarnings() : invalid parameter");
3078 //////////////////////////////////////////////////////////////////////////////
3084 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3090 bool txInMap = false;
3093 txInMap = (mempool.exists(inv.hash));
3096 mapOrphanTransactions.count(inv.hash) ||
3097 txdb.ContainsTx(inv.hash);
3101 return mapBlockIndex.count(inv.hash) ||
3102 mapOrphanBlocks.count(inv.hash);
3104 // Don't know what it is, just say we already got one
3111 // The message start string is designed to be unlikely to occur in normal data.
3112 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3113 // a large 4-byte int at any alignment.
3114 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3116 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3118 static map<CService, CPubKey> mapReuseKey;
3119 RandAddSeedPerfmon();
3121 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3122 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3124 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3128 if (strCommand == "version")
3130 // Each connection can only send one version message
3131 if (pfrom->nVersion != 0)
3133 pfrom->Misbehaving(1);
3140 uint64_t nNonce = 1;
3141 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3142 if (pfrom->nVersion < MIN_PROTO_VERSION)
3144 // Since February 20, 2012, the protocol is initiated at version 209,
3145 // and earlier versions are no longer supported
3146 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3147 pfrom->fDisconnect = true;
3151 if (pfrom->nVersion == 10300)
3152 pfrom->nVersion = 300;
3154 vRecv >> addrFrom >> nNonce;
3156 vRecv >> pfrom->strSubVer;
3158 vRecv >> pfrom->nStartingHeight;
3160 if (pfrom->fInbound && addrMe.IsRoutable())
3162 pfrom->addrLocal = addrMe;
3166 // Disconnect if we connected to ourself
3167 if (nNonce == nLocalHostNonce && nNonce > 1)
3169 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3170 pfrom->fDisconnect = true;
3174 if (pfrom->nVersion < 60010)
3176 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3177 pfrom->fDisconnect = true;
3181 // record my external IP reported by peer
3182 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3183 addrSeenByPeer = addrMe;
3185 // Be shy and don't send version until we hear
3186 if (pfrom->fInbound)
3187 pfrom->PushVersion();
3189 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3191 AddTimeData(pfrom->addr, nTime);
3194 pfrom->PushMessage("verack");
3195 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3197 if (!pfrom->fInbound)
3199 // Advertise our address
3200 if (!fNoListen && !IsInitialBlockDownload())
3202 CAddress addr = GetLocalAddress(&pfrom->addr);
3203 if (addr.IsRoutable())
3204 pfrom->PushAddress(addr);
3207 // Get recent addresses
3208 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3210 pfrom->PushMessage("getaddr");
3211 pfrom->fGetAddr = true;
3213 addrman.Good(pfrom->addr);
3215 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3217 addrman.Add(addrFrom, addrFrom);
3218 addrman.Good(addrFrom);
3222 // Ask the first connected node for block updates
3223 static int nAskedForBlocks = 0;
3224 if (!pfrom->fClient && !pfrom->fOneShot &&
3225 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3226 (pfrom->nVersion < NOBLKS_VERSION_START ||
3227 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3228 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3231 pfrom->PushGetBlocks(pindexBest, uint256(0));
3237 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3238 item.second.RelayTo(pfrom);
3241 // Relay sync-checkpoint
3243 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3244 if (!Checkpoints::checkpointMessage.IsNull())
3245 Checkpoints::checkpointMessage.RelayTo(pfrom);
3248 pfrom->fSuccessfullyConnected = true;
3250 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());
3252 cPeerBlockCounts.input(pfrom->nStartingHeight);
3254 // ppcoin: ask for pending sync-checkpoint if any
3255 if (!IsInitialBlockDownload())
3256 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3260 else if (pfrom->nVersion == 0)
3262 // Must have a version message before anything else
3263 pfrom->Misbehaving(1);
3268 else if (strCommand == "verack")
3270 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3274 else if (strCommand == "addr")
3276 vector<CAddress> vAddr;
3279 // Don't want addr from older versions unless seeding
3280 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3282 if (vAddr.size() > 1000)
3284 pfrom->Misbehaving(20);
3285 return error("message addr size() = %" PRIszu "", vAddr.size());
3288 // Store the new addresses
3289 vector<CAddress> vAddrOk;
3290 int64_t nNow = GetAdjustedTime();
3291 int64_t nSince = nNow - 10 * 60;
3292 BOOST_FOREACH(CAddress& addr, vAddr)
3296 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3297 addr.nTime = nNow - 5 * nOneDay;
3298 pfrom->AddAddressKnown(addr);
3299 bool fReachable = IsReachable(addr);
3300 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3302 // Relay to a limited number of other nodes
3305 // Use deterministic randomness to send to the same nodes for 24 hours
3306 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3307 static uint256 hashSalt;
3309 hashSalt = GetRandHash();
3310 uint64_t hashAddr = addr.GetHash();
3311 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3312 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3313 multimap<uint256, CNode*> mapMix;
3314 BOOST_FOREACH(CNode* pnode, vNodes)
3316 if (pnode->nVersion < CADDR_TIME_VERSION)
3318 unsigned int nPointer;
3319 memcpy(&nPointer, &pnode, sizeof(nPointer));
3320 uint256 hashKey = hashRand ^ nPointer;
3321 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3322 mapMix.insert(make_pair(hashKey, pnode));
3324 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3325 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3326 ((*mi).second)->PushAddress(addr);
3329 // Do not store addresses outside our network
3331 vAddrOk.push_back(addr);
3333 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3334 if (vAddr.size() < 1000)
3335 pfrom->fGetAddr = false;
3336 if (pfrom->fOneShot)
3337 pfrom->fDisconnect = true;
3340 else if (strCommand == "inv")
3344 if (vInv.size() > MAX_INV_SZ)
3346 pfrom->Misbehaving(20);
3347 return error("message inv size() = %" PRIszu "", vInv.size());
3350 // find last block in inv vector
3351 size_t nLastBlock = std::numeric_limits<size_t>::max();
3352 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3353 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3354 nLastBlock = vInv.size() - 1 - nInv;
3359 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3361 const CInv &inv = vInv[nInv];
3365 pfrom->AddInventoryKnown(inv);
3367 bool fAlreadyHave = AlreadyHave(txdb, inv);
3369 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3373 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3374 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3375 } else if (nInv == nLastBlock) {
3376 // In case we are on a very long side-chain, it is possible that we already have
3377 // the last block in an inv bundle sent in response to getblocks. Try to detect
3378 // this situation and push another getblocks to continue.
3379 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3381 printf("force request: %s\n", inv.ToString().c_str());
3384 // Track requests for our stuff
3385 Inventory(inv.hash);
3390 else if (strCommand == "getdata")
3394 if (vInv.size() > MAX_INV_SZ)
3396 pfrom->Misbehaving(20);
3397 return error("message getdata size() = %" PRIszu "", vInv.size());
3400 if (fDebugNet || (vInv.size() != 1))
3401 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3403 BOOST_FOREACH(const CInv& inv, vInv)
3407 if (fDebugNet || (vInv.size() == 1))
3408 printf("received getdata for: %s\n", inv.ToString().c_str());
3410 if (inv.type == MSG_BLOCK)
3412 // Send block from disk
3413 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3414 if (mi != mapBlockIndex.end())
3417 block.ReadFromDisk((*mi).second);
3418 pfrom->PushMessage("block", block);
3420 // Trigger them to send a getblocks request for the next batch of inventory
3421 if (inv.hash == pfrom->hashContinue)
3423 // ppcoin: send latest proof-of-work block to allow the
3424 // download node to accept as orphan (proof-of-stake
3425 // block might be rejected by stake connection check)
3427 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3428 pfrom->PushMessage("inv", vInv);
3429 pfrom->hashContinue = 0;
3433 else if (inv.IsKnownType())
3435 // Send stream from relay memory
3436 bool pushed = false;
3439 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3440 if (mi != mapRelay.end()) {
3441 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3445 if (!pushed && inv.type == MSG_TX) {
3447 if (mempool.exists(inv.hash)) {
3448 CTransaction tx = mempool.lookup(inv.hash);
3449 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3452 pfrom->PushMessage("tx", ss);
3457 // Track requests for our stuff
3458 Inventory(inv.hash);
3463 else if (strCommand == "getblocks")
3465 CBlockLocator locator;
3467 vRecv >> locator >> hashStop;
3469 // Find the last block the caller has in the main chain
3470 CBlockIndex* pindex = locator.GetBlockIndex();
3472 // Send the rest of the chain
3474 pindex = pindex->pnext;
3476 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3477 for (; pindex; pindex = pindex->pnext)
3479 if (pindex->GetBlockHash() == hashStop)
3481 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3482 // ppcoin: tell downloading node about the latest block if it's
3483 // without risk being rejected due to stake connection check
3484 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3485 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3488 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3491 // When this block is requested, we'll send an inv that'll make them
3492 // getblocks the next batch of inventory.
3493 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3494 pfrom->hashContinue = pindex->GetBlockHash();
3499 else if (strCommand == "checkpoint")
3501 CSyncCheckpoint checkpoint;
3502 vRecv >> checkpoint;
3504 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3507 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3509 BOOST_FOREACH(CNode* pnode, vNodes)
3510 checkpoint.RelayTo(pnode);
3514 else if (strCommand == "getheaders")
3516 CBlockLocator locator;
3518 vRecv >> locator >> hashStop;
3520 CBlockIndex* pindex = NULL;
3521 if (locator.IsNull())
3523 // If locator is null, return the hashStop block
3524 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3525 if (mi == mapBlockIndex.end())
3527 pindex = (*mi).second;
3531 // Find the last block the caller has in the main chain
3532 pindex = locator.GetBlockIndex();
3534 pindex = pindex->pnext;
3537 vector<CBlock> vHeaders;
3539 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3540 for (; pindex; pindex = pindex->pnext)
3542 vHeaders.push_back(pindex->GetBlockHeader());
3543 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3546 pfrom->PushMessage("headers", vHeaders);
3550 else if (strCommand == "tx")
3552 vector<uint256> vWorkQueue;
3553 vector<uint256> vEraseQueue;
3554 CDataStream vMsg(vRecv);
3559 CInv inv(MSG_TX, tx.GetHash());
3560 pfrom->AddInventoryKnown(inv);
3562 bool fMissingInputs = false;
3563 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3565 SyncWithWallets(tx, NULL, true);
3566 RelayTransaction(tx, inv.hash);
3567 mapAlreadyAskedFor.erase(inv);
3568 vWorkQueue.push_back(inv.hash);
3569 vEraseQueue.push_back(inv.hash);
3571 // Recursively process any orphan transactions that depended on this one
3572 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3574 uint256 hashPrev = vWorkQueue[i];
3575 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3576 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3579 const uint256& orphanTxHash = *mi;
3580 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3581 bool fMissingInputs2 = false;
3583 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3585 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3586 SyncWithWallets(tx, NULL, true);
3587 RelayTransaction(orphanTx, orphanTxHash);
3588 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3589 vWorkQueue.push_back(orphanTxHash);
3590 vEraseQueue.push_back(orphanTxHash);
3592 else if (!fMissingInputs2)
3595 vEraseQueue.push_back(orphanTxHash);
3596 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3601 BOOST_FOREACH(uint256 hash, vEraseQueue)
3602 EraseOrphanTx(hash);
3604 else if (fMissingInputs)
3608 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3609 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3611 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3613 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3617 else if (strCommand == "block")
3621 uint256 hashBlock = block.GetHash();
3623 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3626 CInv inv(MSG_BLOCK, hashBlock);
3627 pfrom->AddInventoryKnown(inv);
3629 if (ProcessBlock(pfrom, &block))
3630 mapAlreadyAskedFor.erase(inv);
3631 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3635 // This asymmetric behavior for inbound and outbound connections was introduced
3636 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
3637 // to users' AddrMan and later request them by sending getaddr messages.
3638 // Making users (which are behind NAT and can only make outgoing connections) ignore
3639 // getaddr message mitigates the attack.
3640 else if ((strCommand == "getaddr") && (pfrom->fInbound))
3642 // Don't return addresses older than nCutOff timestamp
3643 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
3644 pfrom->vAddrToSend.clear();
3645 vector<CAddress> vAddr = addrman.GetAddr();
3646 BOOST_FOREACH(const CAddress &addr, vAddr)
3647 if(addr.nTime > nCutOff)
3648 pfrom->PushAddress(addr);
3652 else if (strCommand == "mempool")
3654 std::vector<uint256> vtxid;
3655 mempool.queryHashes(vtxid);
3657 for (unsigned int i = 0; i < vtxid.size(); i++) {
3658 CInv inv(MSG_TX, vtxid[i]);
3659 vInv.push_back(inv);
3660 if (i == (MAX_INV_SZ - 1))
3663 if (vInv.size() > 0)
3664 pfrom->PushMessage("inv", vInv);
3668 else if (strCommand == "checkorder")
3673 if (!GetBoolArg("-allowreceivebyip"))
3675 pfrom->PushMessage("reply", hashReply, 2, string(""));
3682 /// we have a chance to check the order here
3684 // Keep giving the same key to the same ip until they use it
3685 if (!mapReuseKey.count(pfrom->addr))
3686 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3688 // Send back approval of order and pubkey to use
3689 CScript scriptPubKey;
3690 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3691 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
3695 else if (strCommand == "reply")
3700 CRequestTracker tracker;
3702 LOCK(pfrom->cs_mapRequests);
3703 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3704 if (mi != pfrom->mapRequests.end())
3706 tracker = (*mi).second;
3707 pfrom->mapRequests.erase(mi);
3710 if (!tracker.IsNull())
3711 tracker.fn(tracker.param1, vRecv);
3715 else if (strCommand == "ping")
3719 // Echo the message back with the nonce. This allows for two useful features:
3721 // 1) A remote node can quickly check if the connection is operational
3722 // 2) Remote nodes can measure the latency of the network thread. If this node
3723 // is overloaded it won't respond to pings quickly and the remote node can
3724 // avoid sending us more work, like chain download requests.
3726 // The nonce stops the remote getting confused between different pings: without
3727 // it, if the remote node sends a ping once per second and this node takes 5
3728 // seconds to respond to each, the 5th ping the remote sends would appear to
3729 // return very quickly.
3730 pfrom->PushMessage("pong", nonce);
3734 else if (strCommand == "alert")
3739 uint256 alertHash = alert.GetHash();
3740 if (pfrom->setKnown.count(alertHash) == 0)
3742 if (alert.ProcessAlert())
3745 pfrom->setKnown.insert(alertHash);
3748 BOOST_FOREACH(CNode* pnode, vNodes)
3749 alert.RelayTo(pnode);
3753 // Small DoS penalty so peers that send us lots of
3754 // duplicate/expired/invalid-signature/whatever alerts
3755 // eventually get banned.
3756 // This isn't a Misbehaving(100) (immediate ban) because the
3757 // peer might be an older or different implementation with
3758 // a different signature key, etc.
3759 pfrom->Misbehaving(10);
3767 // Ignore unknown commands for extensibility
3771 // Update the last seen time for this node's address
3772 if (pfrom->fNetworkNode)
3773 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3774 AddressCurrentlyConnected(pfrom->addr);
3780 bool ProcessMessages(CNode* pfrom)
3782 CDataStream& vRecv = pfrom->vRecv;
3786 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3790 // (4) message start
3799 // Don't bother if send buffer is too full to respond anyway
3800 if (pfrom->vSend.size() >= SendBufferSize())
3803 // Scan for message start
3804 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3805 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3806 if (vRecv.end() - pstart < nHeaderSize)
3808 if ((int)vRecv.size() > nHeaderSize)
3810 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3811 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3815 if (pstart - vRecv.begin() > 0)
3816 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3817 vRecv.erase(vRecv.begin(), pstart);
3820 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3825 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3828 string strCommand = hdr.GetCommand();
3831 unsigned int nMessageSize = hdr.nMessageSize;
3832 if (nMessageSize > MAX_SIZE)
3834 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3837 if (nMessageSize > vRecv.size())
3839 // Rewind and wait for rest of message
3840 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3845 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3846 unsigned int nChecksum = 0;
3847 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3848 if (nChecksum != hdr.nChecksum)
3850 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3851 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3855 // Copy message to its own buffer
3856 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3857 vRecv.ignore(nMessageSize);
3865 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3870 catch (std::ios_base::failure& e)
3872 if (strstr(e.what(), "end of data"))
3874 // Allow exceptions from under-length message on vRecv
3875 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());
3877 else if (strstr(e.what(), "size too large"))
3879 // Allow exceptions from over-long size
3880 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3884 PrintExceptionContinue(&e, "ProcessMessages()");
3887 catch (std::exception& e) {
3888 PrintExceptionContinue(&e, "ProcessMessages()");
3890 PrintExceptionContinue(NULL, "ProcessMessages()");
3894 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3902 bool SendMessages(CNode* pto)
3904 TRY_LOCK(cs_main, lockMain);
3906 // Current time in microseconds
3907 int64_t nNow = GetTimeMicros();
3909 // Don't send anything until we get their version message
3910 if (pto->nVersion == 0)
3913 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3915 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
3917 pto->PushMessage("ping", nonce);
3921 if (pto->fStartSync) {
3922 pto->fStartSync = false;
3923 pto->PushGetBlocks(pindexBest, uint256(0));
3926 // Resend wallet transactions that haven't gotten in a block yet
3927 ResendWalletTransactions();
3929 // Address refresh broadcast
3930 if (!IsInitialBlockDownload() && pto->nNextLocalAddrSend < nNow) {
3931 AdvertiseLocal(pto);
3932 pto->nNextLocalAddrSend = PoissonNextSend(nNow, nOneDay);
3938 if (pto->nNextAddrSend < nNow) {
3939 pto->nNextAddrSend = PoissonNextSend(nNow, 30);
3940 vector<CAddress> vAddr;
3941 vAddr.reserve(pto->vAddrToSend.size());
3942 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3944 if (pto->setAddrKnown.insert(addr).second)
3946 vAddr.push_back(addr);
3947 // receiver rejects addr messages larger than 1000
3948 if (vAddr.size() >= 1000)
3950 pto->PushMessage("addr", vAddr);
3955 pto->vAddrToSend.clear();
3957 pto->PushMessage("addr", vAddr);
3961 // Message: inventory
3964 vector<CInv> vInvWait;
3966 bool fSendTrickle = false;
3967 if (pto->nNextInvSend < nNow) {
3968 fSendTrickle = true;
3969 pto->nNextInvSend = PoissonNextSend(nNow, 5);
3971 LOCK(pto->cs_inventory);
3972 vInv.reserve(pto->vInventoryToSend.size());
3973 vInvWait.reserve(pto->vInventoryToSend.size());
3974 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3976 if (pto->setInventoryKnown.count(inv))
3979 // trickle out tx inv to protect privacy
3980 if (inv.type == MSG_TX && !fSendTrickle)
3982 // 1/4 of tx invs blast to all immediately
3983 static uint256 hashSalt;
3985 hashSalt = GetRandHash();
3986 uint256 hashRand = inv.hash ^ hashSalt;
3987 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3988 bool fTrickleWait = ((hashRand & 3) != 0);
3992 vInvWait.push_back(inv);
3997 // returns true if wasn't already contained in the set
3998 if (pto->setInventoryKnown.insert(inv).second)
4000 vInv.push_back(inv);
4001 if (vInv.size() >= 1000)
4003 pto->PushMessage("inv", vInv);
4008 pto->vInventoryToSend = vInvWait;
4011 pto->PushMessage("inv", vInv);
4017 vector<CInv> vGetData;
4019 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4021 const CInv& inv = (*pto->mapAskFor.begin()).second;
4022 if (!AlreadyHave(txdb, inv))
4025 printf("sending getdata: %s\n", inv.ToString().c_str());
4026 vGetData.push_back(inv);
4027 if (vGetData.size() >= 1000)
4029 pto->PushMessage("getdata", vGetData);
4032 mapAlreadyAskedFor[inv] = nNow;
4034 pto->mapAskFor.erase(pto->mapAskFor.begin());
4036 if (!vGetData.empty())
4037 pto->PushMessage("getdata", vGetData);
4050 std::map<uint256, CBlockIndex*>::iterator it1 = mapBlockIndex.begin();
4051 for (; it1 != mapBlockIndex.end(); it1++)
4052 delete (*it1).second;
4053 mapBlockIndex.clear();
4056 std::map<uint256, CBlock*>::iterator it2 = mapOrphanBlocks.begin();
4057 for (; it2 != mapOrphanBlocks.end(); it2++)
4058 delete (*it2).second;
4059 mapOrphanBlocks.clear();
4061 // orphan transactions
4063 } instance_of_cmaincleanup;