1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
12 #include "checkqueue.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
40 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
42 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
44 unsigned int nStakeMinAge = 30 * nOneDay; // 30 days as zero time weight
45 unsigned int nStakeMaxAge = 90 * nOneDay; // 90 days as full weight
46 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
47 unsigned int nModifierInterval = 6 * nOneHour; // time to elapse before new modifier is computed
49 int nCoinbaseMaturity = 500;
51 CBlockIndex* pindexGenesisBlock = NULL;
54 uint256 nBestChainTrust = 0;
55 uint256 nBestInvalidTrust = 0;
57 uint256 hashBestChain = 0;
58 CBlockIndex* pindexBest = NULL;
59 int64_t nTimeBestReceived = 0;
60 int nScriptCheckThreads = 0;
62 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
64 map<uint256, CBlock*> mapOrphanBlocks;
65 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
66 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
67 map<uint256, uint256> mapProofOfStake;
69 map<uint256, CTransaction> mapOrphanTransactions;
70 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
72 // Constant stuff for coinbase transactions we create:
73 CScript COINBASE_FLAGS;
75 const string strMessageMagic = "NovaCoin Signed Message:\n";
78 int64_t nTransactionFee = MIN_TX_FEE;
79 int64_t nMinimumInputValue = MIN_TXOUT_AMOUNT;
81 // Ping and address broadcast intervals
82 int64_t nPingInterval = 30 * 60;
84 extern enum Checkpoints::CPMode CheckpointsMode;
86 //////////////////////////////////////////////////////////////////////////////
88 // dispatching functions
91 // These functions dispatch to one or all registered wallets
94 void RegisterWallet(CWallet* pwalletIn)
97 LOCK(cs_setpwalletRegistered);
98 setpwalletRegistered.insert(pwalletIn);
102 void UnregisterWallet(CWallet* pwalletIn)
105 LOCK(cs_setpwalletRegistered);
106 setpwalletRegistered.erase(pwalletIn);
110 // check whether the passed transaction is from us
111 bool static IsFromMe(CTransaction& tx)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 if (pwallet->IsFromMe(tx))
119 // get the wallet transaction with the given hash (if it exists)
120 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
122 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
123 if (pwallet->GetTransaction(hashTx,wtx))
128 // erases transaction with the given hash from all wallets
129 void static EraseFromWallets(uint256 hash)
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->EraseFromWallet(hash);
135 // make sure all wallets know about the given transaction, in the given block
136 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
140 // wallets need to refund inputs when disconnecting coinstake
141 if (tx.IsCoinStake())
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 if (pwallet->IsFromMe(tx))
145 pwallet->DisableTransaction(tx);
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
154 // notify wallets about a new best chain
155 void static SetBestChain(const CBlockLocator& loc)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->SetBestChain(loc);
161 // notify wallets about an updated transaction
162 void static UpdatedTransaction(const uint256& hashTx)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->UpdatedTransaction(hashTx);
169 void static PrintWallets(const CBlock& block)
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->PrintWallet(block);
175 // notify wallets about an incoming inventory (for request counts)
176 void static Inventory(const uint256& hash)
178 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
179 pwallet->Inventory(hash);
182 // ask wallets to resend their transactions
183 void ResendWalletTransactions(bool fForceResend)
185 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
186 pwallet->ResendWalletTransactions(fForceResend);
195 //////////////////////////////////////////////////////////////////////////////
197 // mapOrphanTransactions
200 bool AddOrphanTx(const CTransaction& tx)
202 uint256 hash = tx.GetHash();
203 if (mapOrphanTransactions.count(hash))
206 // Ignore big transactions, to avoid a
207 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
208 // large transaction with a missing parent then we assume
209 // it will rebroadcast it later, after the parent transaction(s)
210 // have been mined or received.
211 // 10,000 orphans, each of which is at most 5,000 bytes big is
212 // at most 500 megabytes of orphans:
214 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
218 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
222 mapOrphanTransactions[hash] = tx;
223 BOOST_FOREACH(const CTxIn& txin, tx.vin)
224 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
226 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
227 mapOrphanTransactions.size());
231 void static EraseOrphanTx(uint256 hash)
233 if (!mapOrphanTransactions.count(hash))
235 const CTransaction& tx = mapOrphanTransactions[hash];
236 BOOST_FOREACH(const CTxIn& txin, tx.vin)
238 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
239 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
240 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
242 mapOrphanTransactions.erase(hash);
245 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
247 unsigned int nEvicted = 0;
248 while (mapOrphanTransactions.size() > nMaxOrphans)
250 // Evict a random orphan:
251 uint256 randomhash = GetRandHash();
252 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
253 if (it == mapOrphanTransactions.end())
254 it = mapOrphanTransactions.begin();
255 EraseOrphanTx(it->first);
267 //////////////////////////////////////////////////////////////////////////////
269 // CTransaction and CTxIndex
272 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
275 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
277 if (!ReadFromDisk(txindexRet.pos))
279 if (prevout.n >= vout.size())
287 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
290 return ReadFromDisk(txdb, prevout, txindex);
293 bool CTransaction::ReadFromDisk(COutPoint prevout)
297 return ReadFromDisk(txdb, prevout, txindex);
300 bool CTransaction::IsStandard(string& strReason) const
302 if (nVersion > CTransaction::CURRENT_VERSION)
304 strReason = "version";
308 unsigned int nDataOut = 0;
309 txnouttype whichType;
310 BOOST_FOREACH(const CTxIn& txin, vin)
312 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
313 // keys. (remember the 520 byte limit on redeemScript size) That works
314 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
315 // bytes of scriptSig, which we round off to 1650 bytes for some minor
316 // future-proofing. That's also enough to spend a 20-of-20
317 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
318 // considered standard)
319 if (txin.scriptSig.size() > 1650)
321 strReason = "scriptsig-size";
324 if (!txin.scriptSig.IsPushOnly())
326 strReason = "scriptsig-not-pushonly";
329 if (!txin.scriptSig.HasCanonicalPushes()) {
330 strReason = "txin-scriptsig-not-canonicalpushes";
334 BOOST_FOREACH(const CTxOut& txout, vout) {
335 if (!::IsStandard(txout.scriptPubKey, whichType)) {
336 strReason = "scriptpubkey";
339 if (whichType == TX_NULL_DATA)
342 if (txout.nValue == 0) {
343 strReason = "txout-value=0";
346 if (!txout.scriptPubKey.HasCanonicalPushes()) {
347 strReason = "txout-scriptsig-not-canonicalpushes";
353 // only one OP_RETURN txout is permitted
355 strReason = "multi-op-return";
363 // Check transaction inputs, and make sure any
364 // pay-to-script-hash transactions are evaluating IsStandard scripts
366 // Why bother? To avoid denial-of-service attacks; an attacker
367 // can submit a standard HASH... OP_EQUAL transaction,
368 // which will get accepted into blocks. The redemption
369 // script can be anything; an attacker could use a very
370 // expensive-to-check-upon-redemption script like:
371 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
373 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
376 return true; // Coinbases don't use vin normally
378 for (unsigned int i = 0; i < vin.size(); i++)
380 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
382 vector<vector<unsigned char> > vSolutions;
383 txnouttype whichType;
384 // get the scriptPubKey corresponding to this input:
385 const CScript& prevScript = prev.scriptPubKey;
386 if (!Solver(prevScript, whichType, vSolutions))
388 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
389 if (nArgsExpected < 0)
392 // Transactions with extra stuff in their scriptSigs are
393 // non-standard. Note that this EvalScript() call will
394 // be quick, because if there are any operations
395 // beside "push data" in the scriptSig the
396 // IsStandard() call returns false
397 vector<vector<unsigned char> > stack;
398 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
401 if (whichType == TX_SCRIPTHASH)
405 CScript subscript(stack.back().begin(), stack.back().end());
406 vector<vector<unsigned char> > vSolutions2;
407 txnouttype whichType2;
408 if (!Solver(subscript, whichType2, vSolutions2))
410 if (whichType2 == TX_SCRIPTHASH)
414 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
417 nArgsExpected += tmpExpected;
420 if (stack.size() != (unsigned int)nArgsExpected)
428 CTransaction::GetLegacySigOpCount() const
430 unsigned int nSigOps = 0;
433 // Coinbase scriptsigs are never executed, so there is
434 // no sense in calculation of sigops.
435 BOOST_FOREACH(const CTxIn& txin, vin)
437 nSigOps += txin.scriptSig.GetSigOpCount(false);
440 BOOST_FOREACH(const CTxOut& txout, vout)
442 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
448 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
460 // Load the block this tx is in
462 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
464 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
469 // Update the tx's hashBlock
470 hashBlock = pblock->GetHash();
472 // Locate the transaction
473 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
474 if (pblock->vtx[nIndex] == *(CTransaction*)this)
476 if (nIndex == (int)pblock->vtx.size())
478 vMerkleBranch.clear();
480 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
484 // Fill in merkle branch
485 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
488 // Is the tx in a block that's in the main chain
489 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
490 if (mi == mapBlockIndex.end())
492 CBlockIndex* pindex = (*mi).second;
493 if (!pindex || !pindex->IsInMainChain())
496 return pindexBest->nHeight - pindex->nHeight + 1;
505 bool CTransaction::CheckTransaction() const
507 // Basic checks that don't depend on any context
509 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
511 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
513 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
514 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
516 // Check for negative or overflow output values
517 int64_t nValueOut = 0;
518 for (unsigned int i = 0; i < vout.size(); i++)
520 const CTxOut& txout = vout[i];
521 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
522 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
524 if (txout.nValue < 0)
525 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
526 if (txout.nValue > MAX_MONEY)
527 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
528 nValueOut += txout.nValue;
529 if (!MoneyRange(nValueOut))
530 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
533 // Check for duplicate inputs
534 set<COutPoint> vInOutPoints;
535 BOOST_FOREACH(const CTxIn& txin, vin)
537 if (vInOutPoints.count(txin.prevout))
539 vInOutPoints.insert(txin.prevout);
544 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
545 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
549 BOOST_FOREACH(const CTxIn& txin, vin)
550 if (txin.prevout.IsNull())
551 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
557 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
559 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
563 // Enforce 0.01 as minimum fee for coinstake
565 nMinRelayTxFee = CENT;
568 // Base fee is either nMinTxFee or nMinRelayTxFee
569 int64_t nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
571 unsigned int nNewBlockSize = nBlockSize + nBytes;
572 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
578 // Transactions under 1K are free
584 // Free transaction area
585 if (nNewBlockSize < 27000)
590 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
591 // each non empty output which is less than 0.01
593 // It's safe to ignore empty outputs here, because these inputs are allowed
594 // only for coinbase and coinstake transactions.
595 BOOST_FOREACH(const CTxOut& txout, vout)
596 if (txout.nValue < CENT && !txout.IsEmpty())
599 // Raise the price as the block approaches full
600 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
602 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
604 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
607 if (!MoneyRange(nMinFee))
614 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
615 bool* pfMissingInputs)
618 *pfMissingInputs = false;
620 // Time (prevent mempool memory exhaustion attack)
621 if (tx.nTime > FutureDrift(GetAdjustedTime()))
622 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
624 if (!tx.CheckTransaction())
625 return error("CTxMemPool::accept() : CheckTransaction failed");
627 // Coinbase is only valid in a block, not as a loose transaction
629 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
631 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
632 if (tx.IsCoinStake())
633 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
635 // To help v0.1.5 clients who would see it as a negative number
636 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
637 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
639 // Rather not work on nonstandard transactions (unless -testnet)
641 if (!fTestNet && !tx.IsStandard(strNonStd))
642 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
644 // Do we already have it?
645 uint256 hash = tx.GetHash();
648 if (mapTx.count(hash))
652 if (txdb.ContainsTx(hash))
655 // Check for conflicts with in-memory transactions
656 CTransaction* ptxOld = NULL;
657 for (unsigned int i = 0; i < tx.vin.size(); i++)
659 COutPoint outpoint = tx.vin[i].prevout;
660 if (mapNextTx.count(outpoint))
662 // Disable replacement feature for now
665 // Allow replacing with a newer version of the same transaction
668 ptxOld = mapNextTx[outpoint].ptx;
669 if (ptxOld->IsFinal())
671 if (!tx.IsNewerThan(*ptxOld))
673 for (unsigned int i = 0; i < tx.vin.size(); i++)
675 COutPoint outpoint = tx.vin[i].prevout;
676 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
686 map<uint256, CTxIndex> mapUnused;
687 bool fInvalid = false;
688 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
691 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
693 *pfMissingInputs = true;
697 // Check for non-standard pay-to-script-hash in inputs
698 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
699 return error("CTxMemPool::accept() : nonstandard transaction input");
701 // Note: if you modify this code to accept non-standard transactions, then
702 // you should add code here to check that the transaction does a
703 // reasonable number of ECDSA signature verifications.
705 int64_t nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
706 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
708 // Don't accept it if it can't get into a block
709 int64_t txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
710 if (nFees < txMinFee)
711 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
712 hash.ToString().c_str(),
715 // Continuously rate-limit free transactions
716 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
717 // be annoying or make others' transactions take longer to confirm.
718 if (nFees < MIN_RELAY_TX_FEE)
720 static CCriticalSection cs;
721 static double dFreeCount;
722 static int64_t nLastTime;
723 int64_t nNow = GetTime();
727 // Use an exponentially decaying ~10-minute window:
728 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
730 // -limitfreerelay unit is thousand-bytes-per-minute
731 // At default rate it would take over a month to fill 1GB
732 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
733 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
735 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
740 // Check against previous transactions
741 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
742 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
744 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
748 // Store transaction in memory
753 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
756 addUnchecked(hash, tx);
759 ///// are we sure this is ok when loading transactions or restoring block txes
760 // If updated, erase old tx from wallet
762 EraseFromWallets(ptxOld->GetHash());
764 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
765 hash.ToString().substr(0,10).c_str(),
770 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
772 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
775 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
777 // Add to memory pool without checking anything. Don't call this directly,
778 // call CTxMemPool::accept to properly check the transaction first.
781 for (unsigned int i = 0; i < tx.vin.size(); i++)
782 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
783 nTransactionsUpdated++;
789 bool CTxMemPool::remove(CTransaction &tx)
791 // Remove transaction from memory pool
794 uint256 hash = tx.GetHash();
795 if (mapTx.count(hash))
797 BOOST_FOREACH(const CTxIn& txin, tx.vin)
798 mapNextTx.erase(txin.prevout);
800 nTransactionsUpdated++;
806 void CTxMemPool::clear()
811 ++nTransactionsUpdated;
814 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
819 vtxid.reserve(mapTx.size());
820 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
821 vtxid.push_back((*mi).first);
827 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
829 if (hashBlock == 0 || nIndex == -1)
832 // Find the block it claims to be in
833 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
834 if (mi == mapBlockIndex.end())
836 CBlockIndex* pindex = (*mi).second;
837 if (!pindex || !pindex->IsInMainChain())
840 // Make sure the merkle branch connects to this block
841 if (!fMerkleVerified)
843 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
845 fMerkleVerified = true;
849 return pindexBest->nHeight - pindex->nHeight + 1;
853 int CMerkleTx::GetBlocksToMaturity() const
855 if (!(IsCoinBase() || IsCoinStake()))
857 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
861 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
865 if (!IsInMainChain() && !ClientConnectInputs())
867 return CTransaction::AcceptToMemoryPool(txdb, false);
871 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
875 bool CMerkleTx::AcceptToMemoryPool()
878 return AcceptToMemoryPool(txdb);
883 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
888 // Add previous supporting transactions first
889 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
891 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
893 uint256 hash = tx.GetHash();
894 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
895 tx.AcceptToMemoryPool(txdb, fCheckInputs);
898 return AcceptToMemoryPool(txdb, fCheckInputs);
903 bool CWalletTx::AcceptWalletTransaction()
906 return AcceptWalletTransaction(txdb);
909 int CTxIndex::GetDepthInMainChain() const
913 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
915 // Find the block in the index
916 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
917 if (mi == mapBlockIndex.end())
919 CBlockIndex* pindex = (*mi).second;
920 if (!pindex || !pindex->IsInMainChain())
922 return 1 + nBestHeight - pindex->nHeight;
925 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
926 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
932 if (mempool.exists(hash))
934 tx = mempool.lookup(hash);
940 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
943 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
944 hashBlock = block.GetHash();
958 //////////////////////////////////////////////////////////////////////////////
960 // CBlock and CBlockIndex
963 static CBlockIndex* pblockindexFBBHLast;
964 CBlockIndex* FindBlockByHeight(int nHeight)
966 CBlockIndex *pblockindex;
967 if (nHeight < nBestHeight / 2)
968 pblockindex = pindexGenesisBlock;
970 pblockindex = pindexBest;
971 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
972 pblockindex = pblockindexFBBHLast;
973 while (pblockindex->nHeight > nHeight)
974 pblockindex = pblockindex->pprev;
975 while (pblockindex->nHeight < nHeight)
976 pblockindex = pblockindex->pnext;
977 pblockindexFBBHLast = pblockindex;
981 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
983 if (!fReadTransactions)
985 *this = pindex->GetBlockHeader();
988 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
990 if (GetHash() != pindex->GetBlockHash())
991 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
995 uint256 static GetOrphanRoot(const CBlock* pblock)
997 // Work back to the first block in the orphan chain
998 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
999 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1000 return pblock->GetHash();
1003 // ppcoin: find block wanted by given orphan block
1004 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1006 // Work back to the first block in the orphan chain
1007 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1008 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1009 return pblockOrphan->hashPrevBlock;
1012 // select stake target limit according to hard-coded conditions
1013 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1015 if(fTestNet) // separate proof of stake target limit for testnet
1016 return bnProofOfStakeLimit;
1017 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1018 return bnProofOfStakeLimit;
1019 if(nHeight + 1 > 15000) // 24 bits since block 15000
1020 return bnProofOfStakeLegacyLimit;
1021 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1022 return bnProofOfStakeHardLimit;
1024 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1027 // miner's coin base reward based on nBits
1028 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
1030 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1033 bnTarget.SetCompact(nBits);
1034 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1035 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1037 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1038 // A reasonably continuous curve is used to avoid shock to market
1039 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1041 // Human readable form:
1043 // nSubsidy = 100 / (diff ^ 1/6)
1045 // Please note that we're using bisection to find an approximate solutuion
1046 CBigNum bnLowerBound = CENT;
1047 CBigNum bnUpperBound = bnSubsidyLimit;
1048 while (bnLowerBound + CENT <= bnUpperBound)
1050 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1051 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1052 bnUpperBound = bnMidValue;
1054 bnLowerBound = bnMidValue;
1057 int64_t nSubsidy = bnUpperBound.getuint64();
1059 nSubsidy = (nSubsidy / CENT) * CENT;
1060 if (fDebug && GetBoolArg("-printcreation"))
1061 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1063 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1066 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1067 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1069 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1071 // Stage 2 of emission process is mostly PoS-based.
1073 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1075 bnTarget.SetCompact(nBits);
1076 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1077 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1079 // A reasonably continuous curve is used to avoid shock to market
1081 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1082 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1083 bnMidPart, bnRewardPart;
1085 while (bnLowerBound + CENT <= bnUpperBound)
1087 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1090 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1092 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1094 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1097 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1098 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1100 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1101 bnUpperBound = bnMidValue;
1103 bnLowerBound = bnMidValue;
1106 nRewardCoinYear = bnUpperBound.getuint64();
1107 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1110 return nRewardCoinYear;
1112 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1114 // Set reasonable reward limit for large inputs
1116 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1118 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1119 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1121 nSubsidy = min(nSubsidy, nSubsidyLimit);
1123 if (fDebug && GetBoolArg("-printcreation"))
1124 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1129 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1131 // get proof of work blocks max spacing according to hard-coded conditions
1132 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1134 if(nTime > TARGETS_SWITCH_TIME)
1135 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1138 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1140 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1144 // maximum nBits value could possible be required nTime after
1146 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1149 bnResult.SetCompact(nBase);
1151 while (nTime > 0 && bnResult < bnTargetLimit)
1153 // Maximum 200% adjustment per day...
1157 if (bnResult > bnTargetLimit)
1158 bnResult = bnTargetLimit;
1159 return bnResult.GetCompact();
1163 // minimum amount of work that could possibly be required nTime after
1164 // minimum proof-of-work required was nBase
1166 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1168 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1172 // minimum amount of stake that could possibly be required nTime after
1173 // minimum proof-of-stake required was nBase
1175 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1177 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1181 // ppcoin: find last block index up to pindex
1182 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1184 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1185 pindex = pindex->pprev;
1189 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1191 if (pindexLast == NULL)
1192 return bnProofOfWorkLimit.GetCompact(); // genesis block
1194 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1196 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1197 if (pindexPrev->pprev == NULL)
1198 return bnTargetLimit.GetCompact(); // first block
1199 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1200 if (pindexPrevPrev->pprev == NULL)
1201 return bnTargetLimit.GetCompact(); // second block
1203 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1205 // ppcoin: target change every block
1206 // ppcoin: retarget with exponential moving toward target spacing
1208 bnNew.SetCompact(pindexPrev->nBits);
1209 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1210 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1211 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1212 bnNew /= ((nInterval + 1) * nTargetSpacing);
1214 if (bnNew > bnTargetLimit)
1215 bnNew = bnTargetLimit;
1217 return bnNew.GetCompact();
1220 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1223 bnTarget.SetCompact(nBits);
1226 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1227 return error("CheckProofOfWork() : nBits below minimum work");
1229 // Check proof of work matches claimed amount
1230 if (hash > bnTarget.getuint256())
1231 return error("CheckProofOfWork() : hash doesn't match nBits");
1236 // Return maximum amount of blocks that other nodes claim to have
1237 int GetNumBlocksOfPeers()
1239 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1242 bool IsInitialBlockDownload()
1244 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1246 static int64_t nLastUpdate;
1247 static CBlockIndex* pindexLastBest;
1248 int64_t nCurrentTime = GetTime();
1249 if (pindexBest != pindexLastBest)
1251 pindexLastBest = pindexBest;
1252 nLastUpdate = nCurrentTime;
1254 return (nCurrentTime - nLastUpdate < 10 &&
1255 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1258 void static InvalidChainFound(CBlockIndex* pindexNew)
1260 if (pindexNew->nChainTrust > nBestInvalidTrust)
1262 nBestInvalidTrust = pindexNew->nChainTrust;
1263 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1264 uiInterface.NotifyBlocksChanged();
1267 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1268 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1270 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1271 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1272 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1273 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1274 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1275 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1276 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1277 nBestBlockTrust.Get64(),
1278 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1282 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1284 nTime = max(GetBlockTime(), GetAdjustedTime());
1297 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1299 // Relinquish previous transactions' spent pointers
1302 BOOST_FOREACH(const CTxIn& txin, vin)
1304 COutPoint prevout = txin.prevout;
1306 // Get prev txindex from disk
1308 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1309 return error("DisconnectInputs() : ReadTxIndex failed");
1311 if (prevout.n >= txindex.vSpent.size())
1312 return error("DisconnectInputs() : prevout.n out of range");
1314 // Mark outpoint as not spent
1315 txindex.vSpent[prevout.n].SetNull();
1318 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1319 return error("DisconnectInputs() : UpdateTxIndex failed");
1323 // Remove transaction from index
1324 // This can fail if a duplicate of this transaction was in a chain that got
1325 // reorganized away. This is only possible if this transaction was completely
1326 // spent, so erasing it would be a no-op anyway.
1327 txdb.EraseTxIndex(*this);
1333 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1334 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1336 // FetchInputs can return false either because we just haven't seen some inputs
1337 // (in which case the transaction should be stored as an orphan)
1338 // or because the transaction is malformed (in which case the transaction should
1339 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1343 return true; // Coinbase transactions have no inputs to fetch.
1345 for (unsigned int i = 0; i < vin.size(); i++)
1347 COutPoint prevout = vin[i].prevout;
1348 if (inputsRet.count(prevout.hash))
1349 continue; // Got it already
1352 CTxIndex& txindex = inputsRet[prevout.hash].first;
1354 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1356 // Get txindex from current proposed changes
1357 txindex = mapTestPool.find(prevout.hash)->second;
1361 // Read txindex from txdb
1362 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1364 if (!fFound && (fBlock || fMiner))
1365 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());
1368 CTransaction& txPrev = inputsRet[prevout.hash].second;
1369 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1371 // Get prev tx from single transactions in memory
1374 if (!mempool.exists(prevout.hash))
1375 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());
1376 txPrev = mempool.lookup(prevout.hash);
1379 txindex.vSpent.resize(txPrev.vout.size());
1383 // Get prev tx from disk
1384 if (!txPrev.ReadFromDisk(txindex.pos))
1385 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1389 // Make sure all prevout.n indexes are valid:
1390 for (unsigned int i = 0; i < vin.size(); i++)
1392 const COutPoint prevout = vin[i].prevout;
1393 assert(inputsRet.count(prevout.hash) != 0);
1394 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1395 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1396 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1398 // Revisit this if/when transaction replacement is implemented and allows
1401 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()));
1408 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1410 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1411 if (mi == inputs.end())
1412 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1414 const CTransaction& txPrev = (mi->second).second;
1415 if (input.prevout.n >= txPrev.vout.size())
1416 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1418 return txPrev.vout[input.prevout.n];
1421 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1426 int64_t nResult = 0;
1427 for (unsigned int i = 0; i < vin.size(); i++)
1429 nResult += GetOutputFor(vin[i], inputs).nValue;
1435 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1440 unsigned int nSigOps = 0;
1441 for (unsigned int i = 0; i < vin.size(); i++)
1443 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1444 if (prevout.scriptPubKey.IsPayToScriptHash())
1445 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1450 bool CScriptCheck::operator()() const {
1451 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1452 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1453 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1457 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1459 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1462 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1463 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1465 // Take over previous transactions' spent pointers
1466 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1467 // fMiner is true when called from the internal bitcoin miner
1468 // ... both are false when called from CTransaction::AcceptToMemoryPool
1472 int64_t nValueIn = 0;
1474 for (unsigned int i = 0; i < vin.size(); i++)
1476 COutPoint prevout = vin[i].prevout;
1477 assert(inputs.count(prevout.hash) > 0);
1478 CTxIndex& txindex = inputs[prevout.hash].first;
1479 CTransaction& txPrev = inputs[prevout.hash].second;
1481 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1482 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()));
1484 // If prev is coinbase or coinstake, check that it's matured
1485 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1486 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1487 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1488 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1490 // ppcoin: check transaction timestamp
1491 if (txPrev.nTime > nTime)
1492 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1494 // Check for negative or overflow input values
1495 nValueIn += txPrev.vout[prevout.n].nValue;
1496 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1497 return DoS(100, error("ConnectInputs() : txin values out of range"));
1502 pvChecks->reserve(vin.size());
1504 // The first loop above does all the inexpensive checks.
1505 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1506 // Helps prevent CPU exhaustion attacks.
1507 for (unsigned int i = 0; i < vin.size(); i++)
1509 COutPoint prevout = vin[i].prevout;
1510 assert(inputs.count(prevout.hash) > 0);
1511 CTxIndex& txindex = inputs[prevout.hash].first;
1512 CTransaction& txPrev = inputs[prevout.hash].second;
1514 // Check for conflicts (double-spend)
1515 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1516 // for an attacker to attempt to split the network.
1517 if (!txindex.vSpent[prevout.n].IsNull())
1518 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());
1520 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1521 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1522 // still computed and checked, and any change will be caught at the next checkpoint.
1526 CScriptCheck check(txPrev, *this, i, flags, 0);
1529 pvChecks->push_back(CScriptCheck());
1530 check.swap(pvChecks->back());
1534 if (flags & STRICT_FLAGS)
1536 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1537 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1539 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1541 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1545 // Mark outpoints as spent
1546 txindex.vSpent[prevout.n] = posThisTx;
1549 if (fBlock || fMiner)
1551 mapTestPool[prevout.hash] = txindex;
1557 if (nTime > Checkpoints::GetLastCheckpointTime())
1559 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1561 // coin stake tx earns reward instead of paying fee
1563 if (!GetCoinAge(txdb, nCoinAge))
1564 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1566 int64_t nReward = GetValueOut() - nValueIn;
1567 int64_t nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1569 if (nReward > nCalculatedReward)
1570 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1575 if (nValueIn < GetValueOut())
1576 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1578 // Tally transaction fees
1579 int64_t nTxFee = nValueIn - GetValueOut();
1581 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1584 if (!MoneyRange(nFees))
1585 return DoS(100, error("ConnectInputs() : nFees out of range"));
1593 bool CTransaction::ClientConnectInputs()
1598 // Take over previous transactions' spent pointers
1601 int64_t nValueIn = 0;
1602 for (unsigned int i = 0; i < vin.size(); i++)
1604 // Get prev tx from single transactions in memory
1605 COutPoint prevout = vin[i].prevout;
1606 if (!mempool.exists(prevout.hash))
1608 CTransaction& txPrev = mempool.lookup(prevout.hash);
1610 if (prevout.n >= txPrev.vout.size())
1614 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1615 return error("ClientConnectInputs() : VerifySignature failed");
1617 ///// this is redundant with the mempool.mapNextTx stuff,
1618 ///// not sure which I want to get rid of
1619 ///// this has to go away now that posNext is gone
1620 // // Check for conflicts
1621 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1622 // return error("ConnectInputs() : prev tx already used");
1624 // // Flag outpoints as used
1625 // txPrev.vout[prevout.n].posNext = posThisTx;
1627 nValueIn += txPrev.vout[prevout.n].nValue;
1629 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1630 return error("ClientConnectInputs() : txin values out of range");
1632 if (GetValueOut() > nValueIn)
1642 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1644 // Disconnect in reverse order
1645 for (int i = vtx.size()-1; i >= 0; i--)
1646 if (!vtx[i].DisconnectInputs(txdb))
1649 // Update block index on disk without changing it in memory.
1650 // The memory index structure will be changed after the db commits.
1653 CDiskBlockIndex blockindexPrev(pindex->pprev);
1654 blockindexPrev.hashNext = 0;
1655 if (!txdb.WriteBlockIndex(blockindexPrev))
1656 return error("DisconnectBlock() : WriteBlockIndex failed");
1659 // ppcoin: clean up wallet after disconnecting coinstake
1660 BOOST_FOREACH(CTransaction& tx, vtx)
1661 SyncWithWallets(tx, this, false, false);
1666 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1668 void ThreadScriptCheck(void*) {
1669 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1670 RenameThread("novacoin-scriptch");
1671 scriptcheckqueue.Thread();
1672 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1675 void ThreadScriptCheckQuit() {
1676 scriptcheckqueue.Quit();
1679 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1681 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1682 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1685 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1686 // unless those are already completely spent.
1687 // If such overwrites are allowed, coinbases and transactions depending upon those
1688 // can be duplicated to remove the ability to spend the first instance -- even after
1689 // being sent to another address.
1690 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1691 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1692 // already refuses previously-known transaction ids entirely.
1693 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1694 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1695 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1696 // initial block download.
1697 bool fEnforceBIP30 = true; // Always active in NovaCoin
1698 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1700 //// issue here: it doesn't know the version
1701 unsigned int nTxPos;
1703 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1704 // 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
1707 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1709 map<uint256, CTxIndex> mapQueuedChanges;
1710 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1713 int64_t nValueIn = 0;
1714 int64_t nValueOut = 0;
1715 unsigned int nSigOps = 0;
1716 BOOST_FOREACH(CTransaction& tx, vtx)
1718 uint256 hashTx = tx.GetHash();
1720 if (fEnforceBIP30) {
1721 CTxIndex txindexOld;
1722 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1723 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1729 nSigOps += tx.GetLegacySigOpCount();
1730 if (nSigOps > MAX_BLOCK_SIGOPS)
1731 return DoS(100, error("ConnectBlock() : too many sigops"));
1733 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1735 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1737 MapPrevTx mapInputs;
1738 if (tx.IsCoinBase())
1739 nValueOut += tx.GetValueOut();
1743 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1746 // Add in sigops done by pay-to-script-hash inputs;
1747 // this is to prevent a "rogue miner" from creating
1748 // an incredibly-expensive-to-validate block.
1749 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1750 if (nSigOps > MAX_BLOCK_SIGOPS)
1751 return DoS(100, error("ConnectBlock() : too many sigops"));
1753 int64_t nTxValueIn = tx.GetValueIn(mapInputs);
1754 int64_t nTxValueOut = tx.GetValueOut();
1755 nValueIn += nTxValueIn;
1756 nValueOut += nTxValueOut;
1757 if (!tx.IsCoinStake())
1758 nFees += nTxValueIn - nTxValueOut;
1760 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1762 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1763 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1764 // OP_CHECKSEQUENCEVERIFY is senseless without BIP68, so we're going disable it for now.
1765 // nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
1768 std::vector<CScriptCheck> vChecks;
1769 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
1771 control.Add(vChecks);
1774 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1777 if (!control.Wait())
1778 return DoS(100, false);
1780 if (IsProofOfWork())
1782 int64_t nBlockReward = GetProofOfWorkReward(nBits, nFees);
1784 // Check coinbase reward
1785 if (vtx[0].GetValueOut() > nBlockReward)
1786 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1787 vtx[0].GetValueOut(),
1791 // track money supply and mint amount info
1792 pindex->nMint = nValueOut - nValueIn + nFees;
1793 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1794 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1795 return error("Connect() : WriteBlockIndex for pindex failed");
1797 // fees are not collected by proof-of-stake miners
1798 // fees are destroyed to compensate the entire network
1799 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1800 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1805 // Write queued txindex changes
1806 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1808 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1809 return error("ConnectBlock() : UpdateTxIndex failed");
1812 // Update block index on disk without changing it in memory.
1813 // The memory index structure will be changed after the db commits.
1816 CDiskBlockIndex blockindexPrev(pindex->pprev);
1817 blockindexPrev.hashNext = pindex->GetBlockHash();
1818 if (!txdb.WriteBlockIndex(blockindexPrev))
1819 return error("ConnectBlock() : WriteBlockIndex failed");
1822 // Watch for transactions paying to me
1823 BOOST_FOREACH(CTransaction& tx, vtx)
1824 SyncWithWallets(tx, this, true);
1830 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1832 printf("REORGANIZE\n");
1835 CBlockIndex* pfork = pindexBest;
1836 CBlockIndex* plonger = pindexNew;
1837 while (pfork != plonger)
1839 while (plonger->nHeight > pfork->nHeight)
1840 if ((plonger = plonger->pprev) == NULL)
1841 return error("Reorganize() : plonger->pprev is null");
1842 if (pfork == plonger)
1844 if ((pfork = pfork->pprev) == NULL)
1845 return error("Reorganize() : pfork->pprev is null");
1848 // List of what to disconnect
1849 vector<CBlockIndex*> vDisconnect;
1850 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1851 vDisconnect.push_back(pindex);
1853 // List of what to connect
1854 vector<CBlockIndex*> vConnect;
1855 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1856 vConnect.push_back(pindex);
1857 reverse(vConnect.begin(), vConnect.end());
1859 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());
1860 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());
1862 // Disconnect shorter branch
1863 vector<CTransaction> vResurrect;
1864 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1867 if (!block.ReadFromDisk(pindex))
1868 return error("Reorganize() : ReadFromDisk for disconnect failed");
1869 if (!block.DisconnectBlock(txdb, pindex))
1870 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1872 // Queue memory transactions to resurrect
1873 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1874 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1875 vResurrect.push_back(tx);
1878 // Connect longer branch
1879 vector<CTransaction> vDelete;
1880 for (unsigned int i = 0; i < vConnect.size(); i++)
1882 CBlockIndex* pindex = vConnect[i];
1884 if (!block.ReadFromDisk(pindex))
1885 return error("Reorganize() : ReadFromDisk for connect failed");
1886 if (!block.ConnectBlock(txdb, pindex))
1889 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1892 // Queue memory transactions to delete
1893 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1894 vDelete.push_back(tx);
1896 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1897 return error("Reorganize() : WriteHashBestChain failed");
1899 // Make sure it's successfully written to disk before changing memory structure
1900 if (!txdb.TxnCommit())
1901 return error("Reorganize() : TxnCommit failed");
1903 // Disconnect shorter branch
1904 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1906 pindex->pprev->pnext = NULL;
1908 // Connect longer branch
1909 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1911 pindex->pprev->pnext = pindex;
1913 // Resurrect memory transactions that were in the disconnected branch
1914 BOOST_FOREACH(CTransaction& tx, vResurrect)
1915 tx.AcceptToMemoryPool(txdb, false);
1917 // Delete redundant memory transactions that are in the connected branch
1918 BOOST_FOREACH(CTransaction& tx, vDelete)
1921 printf("REORGANIZE: done\n");
1927 // Called from inside SetBestChain: attaches a block to the new best chain being built
1928 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1930 uint256 hash = GetHash();
1932 // Adding to current best branch
1933 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1936 InvalidChainFound(pindexNew);
1939 if (!txdb.TxnCommit())
1940 return error("SetBestChain() : TxnCommit failed");
1942 // Add to current best branch
1943 pindexNew->pprev->pnext = pindexNew;
1945 // Delete redundant memory transactions
1946 BOOST_FOREACH(CTransaction& tx, vtx)
1952 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1954 uint256 hash = GetHash();
1956 if (!txdb.TxnBegin())
1957 return error("SetBestChain() : TxnBegin failed");
1959 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1961 txdb.WriteHashBestChain(hash);
1962 if (!txdb.TxnCommit())
1963 return error("SetBestChain() : TxnCommit failed");
1964 pindexGenesisBlock = pindexNew;
1966 else if (hashPrevBlock == hashBestChain)
1968 if (!SetBestChainInner(txdb, pindexNew))
1969 return error("SetBestChain() : SetBestChainInner failed");
1973 // the first block in the new chain that will cause it to become the new best chain
1974 CBlockIndex *pindexIntermediate = pindexNew;
1976 // list of blocks that need to be connected afterwards
1977 std::vector<CBlockIndex*> vpindexSecondary;
1979 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1980 // Try to limit how much needs to be done inside
1981 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1983 vpindexSecondary.push_back(pindexIntermediate);
1984 pindexIntermediate = pindexIntermediate->pprev;
1987 if (!vpindexSecondary.empty())
1988 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
1990 // Switch to new best branch
1991 if (!Reorganize(txdb, pindexIntermediate))
1994 InvalidChainFound(pindexNew);
1995 return error("SetBestChain() : Reorganize failed");
1998 // Connect further blocks
1999 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
2002 if (!block.ReadFromDisk(pindex))
2004 printf("SetBestChain() : ReadFromDisk failed\n");
2007 if (!txdb.TxnBegin()) {
2008 printf("SetBestChain() : TxnBegin 2 failed\n");
2011 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
2012 if (!block.SetBestChainInner(txdb, pindex))
2017 // Update best block in wallet (so we can detect restored wallets)
2018 bool fIsInitialDownload = IsInitialBlockDownload();
2019 if (!fIsInitialDownload)
2021 const CBlockLocator locator(pindexNew);
2022 ::SetBestChain(locator);
2026 hashBestChain = hash;
2027 pindexBest = pindexNew;
2028 pblockindexFBBHLast = NULL;
2029 nBestHeight = pindexBest->nHeight;
2030 nBestChainTrust = pindexNew->nChainTrust;
2031 nTimeBestReceived = GetTime();
2032 nTransactionsUpdated++;
2034 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2036 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
2037 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2038 CBigNum(nBestChainTrust).ToString().c_str(),
2039 nBestBlockTrust.Get64(),
2040 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2042 // Check the version of the last 100 blocks to see if we need to upgrade:
2043 if (!fIsInitialDownload)
2046 const CBlockIndex* pindex = pindexBest;
2047 for (int i = 0; i < 100 && pindex != NULL; i++)
2049 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2051 pindex = pindex->pprev;
2054 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2055 if (nUpgraded > 100/2)
2056 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2057 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2060 std::string strCmd = GetArg("-blocknotify", "");
2062 if (!fIsInitialDownload && !strCmd.empty())
2064 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2065 boost::thread t(runCommand, strCmd); // thread runs free
2071 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2072 // Only those coins meeting minimum age requirement counts. As those
2073 // transactions not in main chain are not currently indexed so we
2074 // might not find out about their coin age. Older transactions are
2075 // guaranteed to be in main chain by sync-checkpoint. This rule is
2076 // introduced to help nodes establish a consistent view of the coin
2077 // age (trust score) of competing branches.
2078 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2080 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2086 BOOST_FOREACH(const CTxIn& txin, vin)
2088 // First try finding the previous transaction in database
2089 CTransaction txPrev;
2091 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2092 continue; // previous transaction not in main chain
2093 if (nTime < txPrev.nTime)
2094 return false; // Transaction timestamp violation
2096 // Read block header
2098 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2099 return false; // unable to read block of previous transaction
2100 if (block.GetBlockTime() + nStakeMinAge > nTime)
2101 continue; // only count coins meeting min age requirement
2103 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
2104 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2106 if (fDebug && GetBoolArg("-printcoinage"))
2107 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2110 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2111 if (fDebug && GetBoolArg("-printcoinage"))
2112 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2113 nCoinAge = bnCoinDay.getuint64();
2117 // ppcoin: total coin age spent in block, in the unit of coin-days.
2118 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2123 BOOST_FOREACH(const CTransaction& tx, vtx)
2125 uint64_t nTxCoinAge;
2126 if (tx.GetCoinAge(txdb, nTxCoinAge))
2127 nCoinAge += nTxCoinAge;
2132 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2134 if (fDebug && GetBoolArg("-printcoinage"))
2135 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2139 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2141 // Check for duplicate
2142 uint256 hash = GetHash();
2143 if (mapBlockIndex.count(hash))
2144 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2146 // Construct new block index object
2147 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2149 return error("AddToBlockIndex() : new CBlockIndex failed");
2150 pindexNew->phashBlock = &hash;
2151 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2152 if (miPrev != mapBlockIndex.end())
2154 pindexNew->pprev = (*miPrev).second;
2155 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2158 // ppcoin: compute chain trust score
2159 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2161 // ppcoin: compute stake entropy bit for stake modifier
2162 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2163 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2165 // ppcoin: record proof-of-stake hash value
2166 if (pindexNew->IsProofOfStake())
2168 if (!mapProofOfStake.count(hash))
2169 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2170 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2173 // ppcoin: compute stake modifier
2174 uint64_t nStakeModifier = 0;
2175 bool fGeneratedStakeModifier = false;
2176 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2177 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2178 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2179 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2180 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2181 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2183 // Add to mapBlockIndex
2184 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2185 if (pindexNew->IsProofOfStake())
2186 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2187 pindexNew->phashBlock = &((*mi).first);
2189 // Write to disk block index
2191 if (!txdb.TxnBegin())
2193 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2194 if (!txdb.TxnCommit())
2198 if (pindexNew->nChainTrust > nBestChainTrust)
2199 if (!SetBestChain(txdb, pindexNew))
2202 if (pindexNew == pindexBest)
2204 // Notify UI to display prev block's coinbase if it was ours
2205 static uint256 hashPrevBestCoinBase;
2206 UpdatedTransaction(hashPrevBestCoinBase);
2207 hashPrevBestCoinBase = vtx[0].GetHash();
2210 static int8_t counter = 0;
2211 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2212 uiInterface.NotifyBlocksChanged();
2219 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2221 // These are checks that are independent of context
2222 // that can be verified before saving an orphan block.
2224 set<uint256> uniqueTx; // tx hashes
2225 unsigned int nSigOps = 0; // total sigops
2228 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2229 return DoS(100, error("CheckBlock() : size limits failed"));
2231 bool fProofOfStake = IsProofOfStake();
2233 // First transaction must be coinbase, the rest must not be
2234 if (!vtx[0].IsCoinBase())
2235 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2237 if (!vtx[0].CheckTransaction())
2238 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2240 uniqueTx.insert(vtx[0].GetHash());
2241 nSigOps += vtx[0].GetLegacySigOpCount();
2245 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2246 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2248 // nNonce must be zero for proof-of-stake blocks
2250 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2252 // Coinbase output should be empty if proof-of-stake block
2253 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2254 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2256 // Check coinstake timestamp
2257 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2258 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2260 // NovaCoin: check proof-of-stake block signature
2261 if (fCheckSig && !CheckBlockSignature())
2262 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2264 if (!vtx[1].CheckTransaction())
2265 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2267 uniqueTx.insert(vtx[1].GetHash());
2268 nSigOps += vtx[1].GetLegacySigOpCount();
2272 // Check proof of work matches claimed amount
2273 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2274 return DoS(50, error("CheckBlock() : proof of work failed"));
2277 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2278 return error("CheckBlock() : block timestamp too far in the future");
2280 // Check coinbase timestamp
2281 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2282 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2285 // Iterate all transactions starting from second for proof-of-stake block
2286 // or first for proof-of-work block
2287 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2289 const CTransaction& tx = vtx[i];
2291 // Reject coinbase transactions at non-zero index
2292 if (tx.IsCoinBase())
2293 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2295 // Reject coinstake transactions at index != 1
2296 if (tx.IsCoinStake())
2297 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2299 // Check transaction timestamp
2300 if (GetBlockTime() < (int64_t)tx.nTime)
2301 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2303 // Check transaction consistency
2304 if (!tx.CheckTransaction())
2305 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2307 // Add transaction hash into list of unique transaction IDs
2308 uniqueTx.insert(tx.GetHash());
2310 // Calculate sigops count
2311 nSigOps += tx.GetLegacySigOpCount();
2314 // Check for duplicate txids. This is caught by ConnectInputs(),
2315 // but catching it earlier avoids a potential DoS attack:
2316 if (uniqueTx.size() != vtx.size())
2317 return DoS(100, error("CheckBlock() : duplicate transaction"));
2319 // Reject block if validation would consume too much resources.
2320 if (nSigOps > MAX_BLOCK_SIGOPS)
2321 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2323 // Check merkle root
2324 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2325 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2330 bool CBlock::AcceptBlock()
2332 // Check for duplicate
2333 uint256 hash = GetHash();
2334 if (mapBlockIndex.count(hash))
2335 return error("AcceptBlock() : block already in mapBlockIndex");
2337 // Get prev block index
2338 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2339 if (mi == mapBlockIndex.end())
2340 return DoS(10, error("AcceptBlock() : prev block not found"));
2341 CBlockIndex* pindexPrev = (*mi).second;
2342 int nHeight = pindexPrev->nHeight+1;
2344 // Check proof-of-work or proof-of-stake
2345 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2346 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2348 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2349 int nMaxOffset = 12 * nOneHour; // 12 hours
2350 if (fTestNet || pindexPrev->nTime < 1450569600)
2351 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2353 // Check timestamp against prev
2354 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2355 return error("AcceptBlock() : block's timestamp is too early");
2357 // Don't accept blocks with future timestamps
2358 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2359 return error("AcceptBlock() : block's timestamp is too far in the future");
2361 // Check that all transactions are finalized
2362 BOOST_FOREACH(const CTransaction& tx, vtx)
2363 if (!tx.IsFinal(nHeight, GetBlockTime()))
2364 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2366 // Check that the block chain matches the known block chain up to a checkpoint
2367 if (!Checkpoints::CheckHardened(nHeight, hash))
2368 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2370 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2372 // Check that the block satisfies synchronized checkpoint
2373 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2374 return error("AcceptBlock() : rejected by synchronized checkpoint");
2376 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2377 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2379 // Enforce rule that the coinbase starts with serialized block height
2380 CScript expect = CScript() << nHeight;
2381 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2382 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2383 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2385 // Write block to history file
2386 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2387 return error("AcceptBlock() : out of disk space");
2388 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2389 unsigned int nBlockPos = 0;
2390 if (!WriteToDisk(nFile, nBlockPos))
2391 return error("AcceptBlock() : WriteToDisk failed");
2392 if (!AddToBlockIndex(nFile, nBlockPos))
2393 return error("AcceptBlock() : AddToBlockIndex failed");
2395 // Relay inventory, but don't relay old inventory during initial block download
2396 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2397 if (hashBestChain == hash)
2400 BOOST_FOREACH(CNode* pnode, vNodes)
2401 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2402 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2405 // ppcoin: check pending sync-checkpoint
2406 Checkpoints::AcceptPendingSyncCheckpoint();
2411 uint256 CBlockIndex::GetBlockTrust() const
2414 bnTarget.SetCompact(nBits);
2419 // Return 1 for the first 12 blocks
2420 if (pprev == NULL || pprev->nHeight < 12)
2423 const CBlockIndex* currentIndex = pprev;
2425 if(IsProofOfStake())
2427 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2429 // Return 1/3 of score if parent block is not the PoW block
2430 if (!pprev->IsProofOfWork())
2431 return (bnNewTrust / 3).getuint256();
2435 // Check last 12 blocks type
2436 while (pprev->nHeight - currentIndex->nHeight < 12)
2438 if (currentIndex->IsProofOfWork())
2440 currentIndex = currentIndex->pprev;
2443 // Return 1/3 of score if less than 3 PoW blocks found
2445 return (bnNewTrust / 3).getuint256();
2447 return bnNewTrust.getuint256();
2451 // Calculate work amount for block
2452 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2454 // Set nPowTrust to 1 if PoW difficulty is too low
2458 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2460 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2461 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2462 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2466 // Check last 12 blocks type
2467 while (pprev->nHeight - currentIndex->nHeight < 12)
2469 if (currentIndex->IsProofOfStake())
2471 currentIndex = currentIndex->pprev;
2474 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2476 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2478 bnTarget.SetCompact(pprev->nBits);
2483 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2485 // Return nPoWTrust + full trust score for previous block nBits
2486 return (bnPoWTrust + bnNewTrust).getuint256();
2490 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2492 unsigned int nFound = 0;
2493 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2495 if (pstart->nVersion >= minVersion)
2497 pstart = pstart->pprev;
2499 return (nFound >= nRequired);
2502 bool static ReserealizeBlockSignature(CBlock* pblock)
2504 if (pblock->IsProofOfWork())
2506 pblock->vchBlockSig.clear();
2510 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2513 bool static IsCanonicalBlockSignature(CBlock* pblock)
2515 if (pblock->IsProofOfWork())
2516 return pblock->vchBlockSig.empty();
2518 return IsDERSignature(pblock->vchBlockSig);
2521 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2523 // Check for duplicate
2524 uint256 hash = pblock->GetHash();
2525 if (mapBlockIndex.count(hash))
2526 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2527 if (mapOrphanBlocks.count(hash))
2528 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2530 // Check that block isn't listed as unconditionally banned.
2531 if (!Checkpoints::CheckBanned(hash)) {
2533 pfrom->Misbehaving(100);
2534 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2537 // Check proof-of-stake
2538 // Limited duplicity on stake: prevents block flood attack
2539 // Duplicate stake allowed only when there is orphan child block
2540 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2541 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());
2543 // Strip the garbage from newly received blocks, if we found some
2544 if (!IsCanonicalBlockSignature(pblock)) {
2545 if (!ReserealizeBlockSignature(pblock))
2546 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2549 // Preliminary checks
2550 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2551 return error("ProcessBlock() : CheckBlock FAILED");
2553 // ppcoin: verify hash target and signature of coinstake tx
2554 if (pblock->IsProofOfStake())
2556 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2557 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2559 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2560 return false; // do not error here as we expect this during initial block download
2562 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2563 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2566 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2567 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2569 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2570 int64_t deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2572 bnNewBlock.SetCompact(pblock->nBits);
2575 if (pblock->IsProofOfStake())
2576 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2578 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2580 if (bnNewBlock > bnRequired)
2583 pfrom->Misbehaving(100);
2584 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2588 // ppcoin: ask for pending sync-checkpoint if any
2589 if (!IsInitialBlockDownload())
2590 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2592 // If don't already have its previous block, shunt it off to holding area until we get it
2593 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2595 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2596 // ppcoin: check proof-of-stake
2597 if (pblock->IsProofOfStake())
2599 // Limited duplicity on stake: prevents block flood attack
2600 // Duplicate stake allowed only when there is orphan child block
2601 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2602 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());
2604 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2606 CBlock* pblock2 = new CBlock(*pblock);
2607 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2608 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2610 // Ask this guy to fill in what we're missing
2613 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2614 // ppcoin: getblocks may not obtain the ancestor block rejected
2615 // earlier by duplicate-stake check so we ask for it again directly
2616 if (!IsInitialBlockDownload())
2617 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2623 if (!pblock->AcceptBlock())
2624 return error("ProcessBlock() : AcceptBlock FAILED");
2626 // Recursively process any orphan blocks that depended on this one
2627 vector<uint256> vWorkQueue;
2628 vWorkQueue.push_back(hash);
2629 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2631 uint256 hashPrev = vWorkQueue[i];
2632 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2633 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2636 CBlock* pblockOrphan = (*mi).second;
2637 if (pblockOrphan->AcceptBlock())
2638 vWorkQueue.push_back(pblockOrphan->GetHash());
2639 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2640 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2641 delete pblockOrphan;
2643 mapOrphanBlocksByPrev.erase(hashPrev);
2646 printf("ProcessBlock: ACCEPTED\n");
2648 // ppcoin: if responsible for sync-checkpoint send it
2649 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2650 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2655 // ppcoin: check block signature
2656 bool CBlock::CheckBlockSignature() const
2658 if (vchBlockSig.empty())
2661 txnouttype whichType;
2662 vector<valtype> vSolutions;
2663 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2666 if (whichType == TX_PUBKEY)
2668 valtype& vchPubKey = vSolutions[0];
2669 CPubKey key(vchPubKey);
2672 return key.Verify(GetHash(), vchBlockSig);
2678 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2680 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2682 // Check for nMinDiskSpace bytes (currently 50MB)
2683 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2686 string strMessage = _("Warning: Disk space is low!");
2687 strMiscWarning = strMessage;
2688 printf("*** %s\n", strMessage.c_str());
2689 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2696 static filesystem::path BlockFilePath(unsigned int nFile)
2698 string strBlockFn = strprintf("blk%04u.dat", nFile);
2699 return GetDataDir() / strBlockFn;
2702 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2704 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
2706 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2709 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2711 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2720 static unsigned int nCurrentBlockFile = 1;
2722 FILE* AppendBlockFile(unsigned int& nFileRet)
2727 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2730 if (fseek(file, 0, SEEK_END) != 0)
2732 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2733 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2735 nFileRet = nCurrentBlockFile;
2739 nCurrentBlockFile++;
2743 void UnloadBlockIndex()
2745 mapBlockIndex.clear();
2746 setStakeSeen.clear();
2747 pindexGenesisBlock = NULL;
2749 nBestChainTrust = 0;
2750 nBestInvalidTrust = 0;
2755 bool LoadBlockIndex(bool fAllowNew)
2759 pchMessageStart[0] = 0xcd;
2760 pchMessageStart[1] = 0xf2;
2761 pchMessageStart[2] = 0xc0;
2762 pchMessageStart[3] = 0xef;
2764 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2765 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
2766 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2767 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2768 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2775 if (!txdb.LoadBlockIndex())
2779 // Init with genesis block
2781 if (mapBlockIndex.empty())
2790 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2791 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2792 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2794 // vMerkleTree: 4cb33b3b6a
2798 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2799 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2800 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2802 // vMerkleTree: 4cb33b3b6a
2804 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2806 txNew.nTime = 1360105017;
2807 txNew.vin.resize(1);
2808 txNew.vout.resize(1);
2809 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2810 txNew.vout[0].SetEmpty();
2812 block.vtx.push_back(txNew);
2813 block.hashPrevBlock = 0;
2814 block.hashMerkleRoot = block.BuildMerkleTree();
2816 block.nTime = 1360105017;
2817 block.nBits = bnProofOfWorkLimit.GetCompact();
2818 block.nNonce = !fTestNet ? 1575379 : 46534;
2821 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2823 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2824 assert(block.CheckBlock());
2826 // Start new block file
2828 unsigned int nBlockPos;
2829 if (!block.WriteToDisk(nFile, nBlockPos))
2830 return error("LoadBlockIndex() : writing genesis block to disk failed");
2831 if (!block.AddToBlockIndex(nFile, nBlockPos))
2832 return error("LoadBlockIndex() : genesis block not accepted");
2834 // initialize synchronized checkpoint
2835 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2836 return error("LoadBlockIndex() : failed to init sync checkpoint");
2838 // upgrade time set to zero if txdb initialized
2840 if (!txdb.WriteModifierUpgradeTime(0))
2841 return error("LoadBlockIndex() : failed to init upgrade info");
2842 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2848 string strPubKey = "";
2849 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2851 // write checkpoint master key to db
2853 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2854 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2855 if (!txdb.TxnCommit())
2856 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2857 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2858 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2861 // upgrade time set to zero if blocktreedb initialized
2862 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2864 if (nModifierUpgradeTime)
2865 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2867 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2871 nModifierUpgradeTime = GetTime();
2872 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2873 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2874 return error("LoadBlockIndex() : failed to write upgrade info");
2887 void PrintBlockTree()
2889 // pre-compute tree structure
2890 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2891 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2893 CBlockIndex* pindex = (*mi).second;
2894 mapNext[pindex->pprev].push_back(pindex);
2896 //while (rand() % 3 == 0)
2897 // mapNext[pindex->pprev].push_back(pindex);
2900 vector<pair<int, CBlockIndex*> > vStack;
2901 vStack.push_back(make_pair(0, pindexGenesisBlock));
2904 while (!vStack.empty())
2906 int nCol = vStack.back().first;
2907 CBlockIndex* pindex = vStack.back().second;
2910 // print split or gap
2911 if (nCol > nPrevCol)
2913 for (int i = 0; i < nCol-1; i++)
2917 else if (nCol < nPrevCol)
2919 for (int i = 0; i < nCol; i++)
2926 for (int i = 0; i < nCol; i++)
2931 block.ReadFromDisk(pindex);
2932 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2936 block.GetHash().ToString().c_str(),
2938 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2939 FormatMoney(pindex->nMint).c_str(),
2942 PrintWallets(block);
2944 // put the main time-chain first
2945 vector<CBlockIndex*>& vNext = mapNext[pindex];
2946 for (unsigned int i = 0; i < vNext.size(); i++)
2948 if (vNext[i]->pnext)
2950 swap(vNext[0], vNext[i]);
2956 for (unsigned int i = 0; i < vNext.size(); i++)
2957 vStack.push_back(make_pair(nCol+i, vNext[i]));
2961 bool LoadExternalBlockFile(FILE* fileIn)
2963 int64_t nStart = GetTimeMillis();
2969 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2970 unsigned int nPos = 0;
2971 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
2973 unsigned char pchData[65536];
2975 fseek(blkdat, nPos, SEEK_SET);
2976 size_t nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2979 nPos = std::numeric_limits<uint32_t>::max();
2982 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2985 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2987 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2990 nPos += ((unsigned char*)nFind - pchData) + 1;
2993 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2994 } while(!fRequestShutdown);
2995 if (nPos == std::numeric_limits<uint32_t>::max())
2997 fseek(blkdat, nPos, SEEK_SET);
3000 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3004 if (ProcessBlock(NULL,&block))
3012 catch (const std::exception&) {
3013 printf("%s() : Deserialize or I/O error caught during load\n",
3014 BOOST_CURRENT_FUNCTION);
3017 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
3021 //////////////////////////////////////////////////////////////////////////////
3026 extern map<uint256, CAlert> mapAlerts;
3027 extern CCriticalSection cs_mapAlerts;
3029 string GetWarnings(string strFor)
3032 string strStatusBar;
3035 if (GetBoolArg("-testsafemode"))
3038 // Misc warnings like out of disk space and clock is wrong
3039 if (!strMiscWarning.empty())
3042 strStatusBar = strMiscWarning;
3045 // if detected unmet upgrade requirement enter safe mode
3046 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3047 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3050 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3053 // if detected invalid checkpoint enter safe mode
3054 if (Checkpoints::hashInvalidCheckpoint != 0)
3057 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3063 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3065 const CAlert& alert = item.second;
3066 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3068 nPriority = alert.nPriority;
3069 strStatusBar = alert.strStatusBar;
3070 if (nPriority > 1000)
3071 strRPC = strStatusBar;
3076 if (strFor == "statusbar")
3077 return strStatusBar;
3078 else if (strFor == "rpc")
3080 assert(!"GetWarnings() : invalid parameter");
3091 //////////////////////////////////////////////////////////////////////////////
3097 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3103 bool txInMap = false;
3106 txInMap = (mempool.exists(inv.hash));
3109 mapOrphanTransactions.count(inv.hash) ||
3110 txdb.ContainsTx(inv.hash);
3114 return mapBlockIndex.count(inv.hash) ||
3115 mapOrphanBlocks.count(inv.hash);
3117 // Don't know what it is, just say we already got one
3124 // The message start string is designed to be unlikely to occur in normal data.
3125 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3126 // a large 4-byte int at any alignment.
3127 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3129 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3131 static map<CService, CPubKey> mapReuseKey;
3132 RandAddSeedPerfmon();
3134 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3135 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3137 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3141 if (strCommand == "version")
3143 // Each connection can only send one version message
3144 if (pfrom->nVersion != 0)
3146 pfrom->Misbehaving(1);
3153 uint64_t nNonce = 1;
3154 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3155 if (pfrom->nVersion < MIN_PROTO_VERSION)
3157 // Since February 20, 2012, the protocol is initiated at version 209,
3158 // and earlier versions are no longer supported
3159 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3160 pfrom->fDisconnect = true;
3164 if (pfrom->nVersion == 10300)
3165 pfrom->nVersion = 300;
3167 vRecv >> addrFrom >> nNonce;
3169 vRecv >> pfrom->strSubVer;
3171 vRecv >> pfrom->nStartingHeight;
3173 if (pfrom->fInbound && addrMe.IsRoutable())
3175 pfrom->addrLocal = addrMe;
3179 // Disconnect if we connected to ourself
3180 if (nNonce == nLocalHostNonce && nNonce > 1)
3182 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3183 pfrom->fDisconnect = true;
3187 if (pfrom->nVersion < 60010)
3189 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3190 pfrom->fDisconnect = true;
3194 // record my external IP reported by peer
3195 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3196 addrSeenByPeer = addrMe;
3198 // Be shy and don't send version until we hear
3199 if (pfrom->fInbound)
3200 pfrom->PushVersion();
3202 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3204 AddTimeData(pfrom->addr, nTime);
3207 pfrom->PushMessage("verack");
3208 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3210 if (!pfrom->fInbound)
3212 // Advertise our address
3213 if (!fNoListen && !IsInitialBlockDownload())
3215 CAddress addr = GetLocalAddress(&pfrom->addr);
3216 if (addr.IsRoutable())
3217 pfrom->PushAddress(addr);
3220 // Get recent addresses
3221 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3223 pfrom->PushMessage("getaddr");
3224 pfrom->fGetAddr = true;
3226 addrman.Good(pfrom->addr);
3228 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3230 addrman.Add(addrFrom, addrFrom);
3231 addrman.Good(addrFrom);
3235 // Ask the first connected node for block updates
3236 static int nAskedForBlocks = 0;
3237 if (!pfrom->fClient && !pfrom->fOneShot &&
3238 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3239 (pfrom->nVersion < NOBLKS_VERSION_START ||
3240 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3241 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3244 pfrom->PushGetBlocks(pindexBest, uint256(0));
3250 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3251 item.second.RelayTo(pfrom);
3254 // Relay sync-checkpoint
3256 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3257 if (!Checkpoints::checkpointMessage.IsNull())
3258 Checkpoints::checkpointMessage.RelayTo(pfrom);
3261 pfrom->fSuccessfullyConnected = true;
3263 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());
3265 cPeerBlockCounts.input(pfrom->nStartingHeight);
3267 // ppcoin: ask for pending sync-checkpoint if any
3268 if (!IsInitialBlockDownload())
3269 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3273 else if (pfrom->nVersion == 0)
3275 // Must have a version message before anything else
3276 pfrom->Misbehaving(1);
3281 else if (strCommand == "verack")
3283 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3287 else if (strCommand == "addr")
3289 vector<CAddress> vAddr;
3292 // Don't want addr from older versions unless seeding
3293 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3295 if (vAddr.size() > 1000)
3297 pfrom->Misbehaving(20);
3298 return error("message addr size() = %" PRIszu "", vAddr.size());
3301 // Store the new addresses
3302 vector<CAddress> vAddrOk;
3303 int64_t nNow = GetAdjustedTime();
3304 int64_t nSince = nNow - 10 * 60;
3305 BOOST_FOREACH(CAddress& addr, vAddr)
3309 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3310 addr.nTime = nNow - 5 * nOneDay;
3311 pfrom->AddAddressKnown(addr);
3312 bool fReachable = IsReachable(addr);
3313 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3315 // Relay to a limited number of other nodes
3318 // Use deterministic randomness to send to the same nodes for 24 hours
3319 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3320 static uint256 hashSalt;
3322 hashSalt = GetRandHash();
3323 uint64_t hashAddr = addr.GetHash();
3324 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3325 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3326 multimap<uint256, CNode*> mapMix;
3327 BOOST_FOREACH(CNode* pnode, vNodes)
3329 if (pnode->nVersion < CADDR_TIME_VERSION)
3331 unsigned int nPointer;
3332 memcpy(&nPointer, &pnode, sizeof(nPointer));
3333 uint256 hashKey = hashRand ^ nPointer;
3334 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3335 mapMix.insert(make_pair(hashKey, pnode));
3337 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3338 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3339 ((*mi).second)->PushAddress(addr);
3342 // Do not store addresses outside our network
3344 vAddrOk.push_back(addr);
3346 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3347 if (vAddr.size() < 1000)
3348 pfrom->fGetAddr = false;
3349 if (pfrom->fOneShot)
3350 pfrom->fDisconnect = true;
3353 else if (strCommand == "inv")
3357 if (vInv.size() > MAX_INV_SZ)
3359 pfrom->Misbehaving(20);
3360 return error("message inv size() = %" PRIszu "", vInv.size());
3363 // find last block in inv vector
3364 size_t nLastBlock = std::numeric_limits<size_t>::max();
3365 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3366 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3367 nLastBlock = vInv.size() - 1 - nInv;
3372 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3374 const CInv &inv = vInv[nInv];
3378 pfrom->AddInventoryKnown(inv);
3380 bool fAlreadyHave = AlreadyHave(txdb, inv);
3382 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3386 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3387 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3388 } else if (nInv == nLastBlock) {
3389 // In case we are on a very long side-chain, it is possible that we already have
3390 // the last block in an inv bundle sent in response to getblocks. Try to detect
3391 // this situation and push another getblocks to continue.
3392 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3394 printf("force request: %s\n", inv.ToString().c_str());
3397 // Track requests for our stuff
3398 Inventory(inv.hash);
3403 else if (strCommand == "getdata")
3407 if (vInv.size() > MAX_INV_SZ)
3409 pfrom->Misbehaving(20);
3410 return error("message getdata size() = %" PRIszu "", vInv.size());
3413 if (fDebugNet || (vInv.size() != 1))
3414 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3416 BOOST_FOREACH(const CInv& inv, vInv)
3420 if (fDebugNet || (vInv.size() == 1))
3421 printf("received getdata for: %s\n", inv.ToString().c_str());
3423 if (inv.type == MSG_BLOCK)
3425 // Send block from disk
3426 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3427 if (mi != mapBlockIndex.end())
3430 block.ReadFromDisk((*mi).second);
3431 pfrom->PushMessage("block", block);
3433 // Trigger them to send a getblocks request for the next batch of inventory
3434 if (inv.hash == pfrom->hashContinue)
3436 // ppcoin: send latest proof-of-work block to allow the
3437 // download node to accept as orphan (proof-of-stake
3438 // block might be rejected by stake connection check)
3440 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3441 pfrom->PushMessage("inv", vInv);
3442 pfrom->hashContinue = 0;
3446 else if (inv.IsKnownType())
3448 // Send stream from relay memory
3449 bool pushed = false;
3452 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3453 if (mi != mapRelay.end()) {
3454 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3458 if (!pushed && inv.type == MSG_TX) {
3460 if (mempool.exists(inv.hash)) {
3461 CTransaction tx = mempool.lookup(inv.hash);
3462 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3465 pfrom->PushMessage("tx", ss);
3470 // Track requests for our stuff
3471 Inventory(inv.hash);
3476 else if (strCommand == "getblocks")
3478 CBlockLocator locator;
3480 vRecv >> locator >> hashStop;
3482 // Find the last block the caller has in the main chain
3483 CBlockIndex* pindex = locator.GetBlockIndex();
3485 // Send the rest of the chain
3487 pindex = pindex->pnext;
3489 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3490 for (; pindex; pindex = pindex->pnext)
3492 if (pindex->GetBlockHash() == hashStop)
3494 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3495 // ppcoin: tell downloading node about the latest block if it's
3496 // without risk being rejected due to stake connection check
3497 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3498 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3501 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3504 // When this block is requested, we'll send an inv that'll make them
3505 // getblocks the next batch of inventory.
3506 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3507 pfrom->hashContinue = pindex->GetBlockHash();
3512 else if (strCommand == "checkpoint")
3514 CSyncCheckpoint checkpoint;
3515 vRecv >> checkpoint;
3517 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3520 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3522 BOOST_FOREACH(CNode* pnode, vNodes)
3523 checkpoint.RelayTo(pnode);
3527 else if (strCommand == "getheaders")
3529 CBlockLocator locator;
3531 vRecv >> locator >> hashStop;
3533 CBlockIndex* pindex = NULL;
3534 if (locator.IsNull())
3536 // If locator is null, return the hashStop block
3537 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3538 if (mi == mapBlockIndex.end())
3540 pindex = (*mi).second;
3544 // Find the last block the caller has in the main chain
3545 pindex = locator.GetBlockIndex();
3547 pindex = pindex->pnext;
3550 vector<CBlock> vHeaders;
3552 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3553 for (; pindex; pindex = pindex->pnext)
3555 vHeaders.push_back(pindex->GetBlockHeader());
3556 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3559 pfrom->PushMessage("headers", vHeaders);
3563 else if (strCommand == "tx")
3565 vector<uint256> vWorkQueue;
3566 vector<uint256> vEraseQueue;
3567 CDataStream vMsg(vRecv);
3572 CInv inv(MSG_TX, tx.GetHash());
3573 pfrom->AddInventoryKnown(inv);
3575 bool fMissingInputs = false;
3576 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3578 SyncWithWallets(tx, NULL, true);
3579 RelayTransaction(tx, inv.hash);
3580 mapAlreadyAskedFor.erase(inv);
3581 vWorkQueue.push_back(inv.hash);
3582 vEraseQueue.push_back(inv.hash);
3584 // Recursively process any orphan transactions that depended on this one
3585 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3587 uint256 hashPrev = vWorkQueue[i];
3588 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3589 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3592 const uint256& orphanTxHash = *mi;
3593 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3594 bool fMissingInputs2 = false;
3596 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3598 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3599 SyncWithWallets(tx, NULL, true);
3600 RelayTransaction(orphanTx, orphanTxHash);
3601 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3602 vWorkQueue.push_back(orphanTxHash);
3603 vEraseQueue.push_back(orphanTxHash);
3605 else if (!fMissingInputs2)
3608 vEraseQueue.push_back(orphanTxHash);
3609 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3614 BOOST_FOREACH(uint256 hash, vEraseQueue)
3615 EraseOrphanTx(hash);
3617 else if (fMissingInputs)
3621 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3622 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3624 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3626 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3630 else if (strCommand == "block")
3634 uint256 hashBlock = block.GetHash();
3636 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3639 CInv inv(MSG_BLOCK, hashBlock);
3640 pfrom->AddInventoryKnown(inv);
3642 if (ProcessBlock(pfrom, &block))
3643 mapAlreadyAskedFor.erase(inv);
3644 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3648 // This asymmetric behavior for inbound and outbound connections was introduced
3649 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
3650 // to users' AddrMan and later request them by sending getaddr messages.
3651 // Making users (which are behind NAT and can only make outgoing connections) ignore
3652 // getaddr message mitigates the attack.
3653 else if ((strCommand == "getaddr") && (pfrom->fInbound))
3655 // Don't return addresses older than nCutOff timestamp
3656 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
3657 pfrom->vAddrToSend.clear();
3658 vector<CAddress> vAddr = addrman.GetAddr();
3659 BOOST_FOREACH(const CAddress &addr, vAddr)
3660 if(addr.nTime > nCutOff)
3661 pfrom->PushAddress(addr);
3665 else if (strCommand == "mempool")
3667 std::vector<uint256> vtxid;
3668 mempool.queryHashes(vtxid);
3670 for (unsigned int i = 0; i < vtxid.size(); i++) {
3671 CInv inv(MSG_TX, vtxid[i]);
3672 vInv.push_back(inv);
3673 if (i == (MAX_INV_SZ - 1))
3676 if (vInv.size() > 0)
3677 pfrom->PushMessage("inv", vInv);
3681 else if (strCommand == "checkorder")
3686 if (!GetBoolArg("-allowreceivebyip"))
3688 pfrom->PushMessage("reply", hashReply, 2, string(""));
3695 /// we have a chance to check the order here
3697 // Keep giving the same key to the same ip until they use it
3698 if (!mapReuseKey.count(pfrom->addr))
3699 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3701 // Send back approval of order and pubkey to use
3702 CScript scriptPubKey;
3703 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3704 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
3708 else if (strCommand == "reply")
3713 CRequestTracker tracker;
3715 LOCK(pfrom->cs_mapRequests);
3716 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3717 if (mi != pfrom->mapRequests.end())
3719 tracker = (*mi).second;
3720 pfrom->mapRequests.erase(mi);
3723 if (!tracker.IsNull())
3724 tracker.fn(tracker.param1, vRecv);
3728 else if (strCommand == "ping")
3732 // Echo the message back with the nonce. This allows for two useful features:
3734 // 1) A remote node can quickly check if the connection is operational
3735 // 2) Remote nodes can measure the latency of the network thread. If this node
3736 // is overloaded it won't respond to pings quickly and the remote node can
3737 // avoid sending us more work, like chain download requests.
3739 // The nonce stops the remote getting confused between different pings: without
3740 // it, if the remote node sends a ping once per second and this node takes 5
3741 // seconds to respond to each, the 5th ping the remote sends would appear to
3742 // return very quickly.
3743 pfrom->PushMessage("pong", nonce);
3747 else if (strCommand == "alert")
3752 uint256 alertHash = alert.GetHash();
3753 if (pfrom->setKnown.count(alertHash) == 0)
3755 if (alert.ProcessAlert())
3758 pfrom->setKnown.insert(alertHash);
3761 BOOST_FOREACH(CNode* pnode, vNodes)
3762 alert.RelayTo(pnode);
3766 // Small DoS penalty so peers that send us lots of
3767 // duplicate/expired/invalid-signature/whatever alerts
3768 // eventually get banned.
3769 // This isn't a Misbehaving(100) (immediate ban) because the
3770 // peer might be an older or different implementation with
3771 // a different signature key, etc.
3772 pfrom->Misbehaving(10);
3780 // Ignore unknown commands for extensibility
3784 // Update the last seen time for this node's address
3785 if (pfrom->fNetworkNode)
3786 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3787 AddressCurrentlyConnected(pfrom->addr);
3793 bool ProcessMessages(CNode* pfrom)
3795 CDataStream& vRecv = pfrom->vRecv;
3799 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3803 // (4) message start
3812 // Don't bother if send buffer is too full to respond anyway
3813 if (pfrom->vSend.size() >= SendBufferSize())
3816 // Scan for message start
3817 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3818 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3819 if (vRecv.end() - pstart < nHeaderSize)
3821 if ((int)vRecv.size() > nHeaderSize)
3823 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3824 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3828 if (pstart - vRecv.begin() > 0)
3829 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3830 vRecv.erase(vRecv.begin(), pstart);
3833 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3838 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3841 string strCommand = hdr.GetCommand();
3844 unsigned int nMessageSize = hdr.nMessageSize;
3845 if (nMessageSize > MAX_SIZE)
3847 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3850 if (nMessageSize > vRecv.size())
3852 // Rewind and wait for rest of message
3853 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3858 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3859 unsigned int nChecksum = 0;
3860 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3861 if (nChecksum != hdr.nChecksum)
3863 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3864 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3868 // Copy message to its own buffer
3869 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3870 vRecv.ignore(nMessageSize);
3878 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3883 catch (std::ios_base::failure& e)
3885 if (strstr(e.what(), "end of data"))
3887 // Allow exceptions from under-length message on vRecv
3888 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());
3890 else if (strstr(e.what(), "size too large"))
3892 // Allow exceptions from over-long size
3893 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3897 PrintExceptionContinue(&e, "ProcessMessages()");
3900 catch (std::exception& e) {
3901 PrintExceptionContinue(&e, "ProcessMessages()");
3903 PrintExceptionContinue(NULL, "ProcessMessages()");
3907 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3915 bool SendMessages(CNode* pto, bool fSendTrickle)
3917 TRY_LOCK(cs_main, lockMain);
3919 // Current time in microseconds
3920 int64_t nNow = GetTimeMicros();
3922 // Don't send anything until we get their version message
3923 if (pto->nVersion == 0)
3926 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3928 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
3930 pto->PushMessage("ping", nonce);
3934 if (pto->fStartSync) {
3935 pto->fStartSync = false;
3936 pto->PushGetBlocks(pindexBest, uint256(0));
3939 // Resend wallet transactions that haven't gotten in a block yet
3940 ResendWalletTransactions();
3942 // Address refresh broadcast
3943 if (!IsInitialBlockDownload() && pto->nNextLocalAddrSend < nNow) {
3944 AdvertiseLocal(pto);
3945 pto->nNextLocalAddrSend = PoissonNextSend(nNow, nOneDay);
3951 if (pto->nNextAddrSend < nNow) {
3952 pto->nNextAddrSend = PoissonNextSend(nNow, 30);
3953 vector<CAddress> vAddr;
3954 vAddr.reserve(pto->vAddrToSend.size());
3955 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3957 if (pto->setAddrKnown.insert(addr).second)
3959 vAddr.push_back(addr);
3960 // receiver rejects addr messages larger than 1000
3961 if (vAddr.size() >= 1000)
3963 pto->PushMessage("addr", vAddr);
3968 pto->vAddrToSend.clear();
3970 pto->PushMessage("addr", vAddr);
3974 // Message: inventory
3977 vector<CInv> vInvWait;
3979 bool fSendTrickle = false;
3980 if (pto->nNextInvSend < nNow) {
3981 fSendTrickle = true;
3982 pto->nNextInvSend = PoissonNextSend(nNow, 5);
3984 LOCK(pto->cs_inventory);
3985 vInv.reserve(pto->vInventoryToSend.size());
3986 vInvWait.reserve(pto->vInventoryToSend.size());
3987 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3989 if (pto->setInventoryKnown.count(inv))
3992 // trickle out tx inv to protect privacy
3993 if (inv.type == MSG_TX && !fSendTrickle)
3995 // 1/4 of tx invs blast to all immediately
3996 static uint256 hashSalt;
3998 hashSalt = GetRandHash();
3999 uint256 hashRand = inv.hash ^ hashSalt;
4000 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4001 bool fTrickleWait = ((hashRand & 3) != 0);
4005 vInvWait.push_back(inv);
4010 // returns true if wasn't already contained in the set
4011 if (pto->setInventoryKnown.insert(inv).second)
4013 vInv.push_back(inv);
4014 if (vInv.size() >= 1000)
4016 pto->PushMessage("inv", vInv);
4021 pto->vInventoryToSend = vInvWait;
4024 pto->PushMessage("inv", vInv);
4030 vector<CInv> vGetData;
4032 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4034 const CInv& inv = (*pto->mapAskFor.begin()).second;
4035 if (!AlreadyHave(txdb, inv))
4038 printf("sending getdata: %s\n", inv.ToString().c_str());
4039 vGetData.push_back(inv);
4040 if (vGetData.size() >= 1000)
4042 pto->PushMessage("getdata", vGetData);
4045 mapAlreadyAskedFor[inv] = nNow;
4047 pto->mapAskFor.erase(pto->mapAskFor.begin());
4049 if (!vGetData.empty())
4050 pto->PushMessage("getdata", vGetData);
4063 std::map<uint256, CBlockIndex*>::iterator it1 = mapBlockIndex.begin();
4064 for (; it1 != mapBlockIndex.end(); it1++)
4065 delete (*it1).second;
4066 mapBlockIndex.clear();
4069 std::map<uint256, CBlock*>::iterator it2 = mapOrphanBlocks.begin();
4070 for (; it2 != mapOrphanBlocks.end(); it2++)
4071 delete (*it2).second;
4072 mapOrphanBlocks.clear();
4074 // orphan transactions
4076 } instance_of_cmaincleanup;