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;
83 int64_t nBroadcastInterval = nOneDay;
85 extern enum Checkpoints::CPMode CheckpointsMode;
87 //////////////////////////////////////////////////////////////////////////////
89 // dispatching functions
92 // These functions dispatch to one or all registered wallets
95 void RegisterWallet(CWallet* pwalletIn)
98 LOCK(cs_setpwalletRegistered);
99 setpwalletRegistered.insert(pwalletIn);
103 void UnregisterWallet(CWallet* pwalletIn)
106 LOCK(cs_setpwalletRegistered);
107 setpwalletRegistered.erase(pwalletIn);
111 // check whether the passed transaction is from us
112 bool static IsFromMe(CTransaction& tx)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 if (pwallet->IsFromMe(tx))
120 // get the wallet transaction with the given hash (if it exists)
121 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 if (pwallet->GetTransaction(hashTx,wtx))
129 // erases transaction with the given hash from all wallets
130 void static EraseFromWallets(uint256 hash)
132 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
133 pwallet->EraseFromWallet(hash);
136 // make sure all wallets know about the given transaction, in the given block
137 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
141 // wallets need to refund inputs when disconnecting coinstake
142 if (tx.IsCoinStake())
144 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
145 if (pwallet->IsFromMe(tx))
146 pwallet->DisableTransaction(tx);
151 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
152 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
155 // notify wallets about a new best chain
156 void static SetBestChain(const CBlockLocator& loc)
158 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
159 pwallet->SetBestChain(loc);
162 // notify wallets about an updated transaction
163 void static UpdatedTransaction(const uint256& hashTx)
165 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
166 pwallet->UpdatedTransaction(hashTx);
170 void static PrintWallets(const CBlock& block)
172 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
173 pwallet->PrintWallet(block);
176 // notify wallets about an incoming inventory (for request counts)
177 void static Inventory(const uint256& hash)
179 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
180 pwallet->Inventory(hash);
183 // ask wallets to resend their transactions
184 void ResendWalletTransactions(bool fForceResend)
186 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
187 pwallet->ResendWalletTransactions(fForceResend);
196 //////////////////////////////////////////////////////////////////////////////
198 // mapOrphanTransactions
201 bool AddOrphanTx(const CTransaction& tx)
203 uint256 hash = tx.GetHash();
204 if (mapOrphanTransactions.count(hash))
207 // Ignore big transactions, to avoid a
208 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
209 // large transaction with a missing parent then we assume
210 // it will rebroadcast it later, after the parent transaction(s)
211 // have been mined or received.
212 // 10,000 orphans, each of which is at most 5,000 bytes big is
213 // at most 500 megabytes of orphans:
215 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
219 printf("ignoring large orphan tx (size: %" PRIszu ", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
223 mapOrphanTransactions[hash] = tx;
224 BOOST_FOREACH(const CTxIn& txin, tx.vin)
225 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
227 printf("stored orphan tx %s (mapsz %" PRIszu ")\n", hash.ToString().substr(0,10).c_str(),
228 mapOrphanTransactions.size());
232 void static EraseOrphanTx(uint256 hash)
234 if (!mapOrphanTransactions.count(hash))
236 const CTransaction& tx = mapOrphanTransactions[hash];
237 BOOST_FOREACH(const CTxIn& txin, tx.vin)
239 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
240 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
241 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
243 mapOrphanTransactions.erase(hash);
246 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
248 unsigned int nEvicted = 0;
249 while (mapOrphanTransactions.size() > nMaxOrphans)
251 // Evict a random orphan:
252 uint256 randomhash = GetRandHash();
253 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
254 if (it == mapOrphanTransactions.end())
255 it = mapOrphanTransactions.begin();
256 EraseOrphanTx(it->first);
268 //////////////////////////////////////////////////////////////////////////////
270 // CTransaction and CTxIndex
273 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
276 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
278 if (!ReadFromDisk(txindexRet.pos))
280 if (prevout.n >= vout.size())
288 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
291 return ReadFromDisk(txdb, prevout, txindex);
294 bool CTransaction::ReadFromDisk(COutPoint prevout)
298 return ReadFromDisk(txdb, prevout, txindex);
301 bool CTransaction::IsStandard(string& strReason) const
303 if (nVersion > CTransaction::CURRENT_VERSION)
305 strReason = "version";
309 unsigned int nDataOut = 0;
310 txnouttype whichType;
311 BOOST_FOREACH(const CTxIn& txin, vin)
313 // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
314 // keys. (remember the 520 byte limit on redeemScript size) That works
315 // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)=1624
316 // bytes of scriptSig, which we round off to 1650 bytes for some minor
317 // future-proofing. That's also enough to spend a 20-of-20
318 // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
319 // considered standard)
320 if (txin.scriptSig.size() > 1650)
322 strReason = "scriptsig-size";
325 if (!txin.scriptSig.IsPushOnly())
327 strReason = "scriptsig-not-pushonly";
330 if (!txin.scriptSig.HasCanonicalPushes()) {
331 strReason = "txin-scriptsig-not-canonicalpushes";
335 BOOST_FOREACH(const CTxOut& txout, vout) {
336 if (!::IsStandard(txout.scriptPubKey, whichType)) {
337 strReason = "scriptpubkey";
340 if (whichType == TX_NULL_DATA)
343 if (txout.nValue == 0) {
344 strReason = "txout-value=0";
347 if (!txout.scriptPubKey.HasCanonicalPushes()) {
348 strReason = "txout-scriptsig-not-canonicalpushes";
354 // only one OP_RETURN txout is permitted
356 strReason = "multi-op-return";
364 // Check transaction inputs, and make sure any
365 // pay-to-script-hash transactions are evaluating IsStandard scripts
367 // Why bother? To avoid denial-of-service attacks; an attacker
368 // can submit a standard HASH... OP_EQUAL transaction,
369 // which will get accepted into blocks. The redemption
370 // script can be anything; an attacker could use a very
371 // expensive-to-check-upon-redemption script like:
372 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
374 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
377 return true; // Coinbases don't use vin normally
379 for (unsigned int i = 0; i < vin.size(); i++)
381 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
383 vector<vector<unsigned char> > vSolutions;
384 txnouttype whichType;
385 // get the scriptPubKey corresponding to this input:
386 const CScript& prevScript = prev.scriptPubKey;
387 if (!Solver(prevScript, whichType, vSolutions))
389 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
390 if (nArgsExpected < 0)
393 // Transactions with extra stuff in their scriptSigs are
394 // non-standard. Note that this EvalScript() call will
395 // be quick, because if there are any operations
396 // beside "push data" in the scriptSig the
397 // IsStandard() call returns false
398 vector<vector<unsigned char> > stack;
399 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
402 if (whichType == TX_SCRIPTHASH)
406 CScript subscript(stack.back().begin(), stack.back().end());
407 vector<vector<unsigned char> > vSolutions2;
408 txnouttype whichType2;
409 if (!Solver(subscript, whichType2, vSolutions2))
411 if (whichType2 == TX_SCRIPTHASH)
415 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
418 nArgsExpected += tmpExpected;
421 if (stack.size() != (unsigned int)nArgsExpected)
429 CTransaction::GetLegacySigOpCount() const
431 unsigned int nSigOps = 0;
434 // Coinbase scriptsigs are never executed, so there is
435 // no sense in calculation of sigops.
436 BOOST_FOREACH(const CTxIn& txin, vin)
438 nSigOps += txin.scriptSig.GetSigOpCount(false);
441 BOOST_FOREACH(const CTxOut& txout, vout)
443 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
449 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
461 // Load the block this tx is in
463 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
465 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
470 // Update the tx's hashBlock
471 hashBlock = pblock->GetHash();
473 // Locate the transaction
474 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
475 if (pblock->vtx[nIndex] == *(CTransaction*)this)
477 if (nIndex == (int)pblock->vtx.size())
479 vMerkleBranch.clear();
481 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
485 // Fill in merkle branch
486 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
489 // Is the tx in a block that's in the main chain
490 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
491 if (mi == mapBlockIndex.end())
493 CBlockIndex* pindex = (*mi).second;
494 if (!pindex || !pindex->IsInMainChain())
497 return pindexBest->nHeight - pindex->nHeight + 1;
506 bool CTransaction::CheckTransaction() const
508 // Basic checks that don't depend on any context
510 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
512 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
514 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
515 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
517 // Check for negative or overflow output values
518 int64_t nValueOut = 0;
519 for (unsigned int i = 0; i < vout.size(); i++)
521 const CTxOut& txout = vout[i];
522 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
523 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
525 if (txout.nValue < 0)
526 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
527 if (txout.nValue > MAX_MONEY)
528 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
529 nValueOut += txout.nValue;
530 if (!MoneyRange(nValueOut))
531 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
534 // Check for duplicate inputs
535 set<COutPoint> vInOutPoints;
536 BOOST_FOREACH(const CTxIn& txin, vin)
538 if (vInOutPoints.count(txin.prevout))
540 vInOutPoints.insert(txin.prevout);
545 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
546 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
550 BOOST_FOREACH(const CTxIn& txin, vin)
551 if (txin.prevout.IsNull())
552 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
558 int64_t CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
560 int64_t nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
564 // Enforce 0.01 as minimum fee for coinstake
566 nMinRelayTxFee = CENT;
569 // Base fee is either nMinTxFee or nMinRelayTxFee
570 int64_t nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
572 unsigned int nNewBlockSize = nBlockSize + nBytes;
573 int64_t nMinFee = (1 + (int64_t)nBytes / 1000) * nBaseFee;
579 // Transactions under 1K are free
585 // Free transaction area
586 if (nNewBlockSize < 27000)
591 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
592 // each non empty output which is less than 0.01
594 // It's safe to ignore empty outputs here, because these inputs are allowed
595 // only for coinbase and coinstake transactions.
596 BOOST_FOREACH(const CTxOut& txout, vout)
597 if (txout.nValue < CENT && !txout.IsEmpty())
600 // Raise the price as the block approaches full
601 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
603 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
605 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
608 if (!MoneyRange(nMinFee))
615 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
616 bool* pfMissingInputs)
619 *pfMissingInputs = false;
621 // Time (prevent mempool memory exhaustion attack)
622 if (tx.nTime > FutureDrift(GetAdjustedTime()))
623 return tx.DoS(10, error("CTxMemPool::accept() : transaction timestamp is too far in the future"));
625 if (!tx.CheckTransaction())
626 return error("CTxMemPool::accept() : CheckTransaction failed");
628 // Coinbase is only valid in a block, not as a loose transaction
630 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
632 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
633 if (tx.IsCoinStake())
634 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
636 // To help v0.1.5 clients who would see it as a negative number
637 if ((int64_t)tx.nLockTime > std::numeric_limits<int>::max())
638 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
640 // Rather not work on nonstandard transactions (unless -testnet)
642 if (!fTestNet && !tx.IsStandard(strNonStd))
643 return error("CTxMemPool::accept() : nonstandard transaction (%s)", strNonStd.c_str());
645 // Do we already have it?
646 uint256 hash = tx.GetHash();
649 if (mapTx.count(hash))
653 if (txdb.ContainsTx(hash))
656 // Check for conflicts with in-memory transactions
657 CTransaction* ptxOld = NULL;
658 for (unsigned int i = 0; i < tx.vin.size(); i++)
660 COutPoint outpoint = tx.vin[i].prevout;
661 if (mapNextTx.count(outpoint))
663 // Disable replacement feature for now
666 // Allow replacing with a newer version of the same transaction
669 ptxOld = mapNextTx[outpoint].ptx;
670 if (ptxOld->IsFinal())
672 if (!tx.IsNewerThan(*ptxOld))
674 for (unsigned int i = 0; i < tx.vin.size(); i++)
676 COutPoint outpoint = tx.vin[i].prevout;
677 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
687 map<uint256, CTxIndex> mapUnused;
688 bool fInvalid = false;
689 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
692 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
694 *pfMissingInputs = true;
698 // Check for non-standard pay-to-script-hash in inputs
699 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
700 return error("CTxMemPool::accept() : nonstandard transaction input");
702 // Note: if you modify this code to accept non-standard transactions, then
703 // you should add code here to check that the transaction does a
704 // reasonable number of ECDSA signature verifications.
706 int64_t nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
707 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
709 // Don't accept it if it can't get into a block
710 int64_t txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
711 if (nFees < txMinFee)
712 return error("CTxMemPool::accept() : not enough fees %s, %" PRId64 " < %" PRId64,
713 hash.ToString().c_str(),
716 // Continuously rate-limit free transactions
717 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
718 // be annoying or make others' transactions take longer to confirm.
719 if (nFees < MIN_RELAY_TX_FEE)
721 static CCriticalSection cs;
722 static double dFreeCount;
723 static int64_t nLastTime;
724 int64_t nNow = GetTime();
728 // Use an exponentially decaying ~10-minute window:
729 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
731 // -limitfreerelay unit is thousand-bytes-per-minute
732 // At default rate it would take over a month to fill 1GB
733 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
734 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
736 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
741 // Check against previous transactions
742 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
743 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, STRICT_FLAGS))
745 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
749 // Store transaction in memory
754 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
757 addUnchecked(hash, tx);
760 ///// are we sure this is ok when loading transactions or restoring block txes
761 // If updated, erase old tx from wallet
763 EraseFromWallets(ptxOld->GetHash());
765 printf("CTxMemPool::accept() : accepted %s (poolsz %" PRIszu ")\n",
766 hash.ToString().substr(0,10).c_str(),
771 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
773 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
776 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
778 // Add to memory pool without checking anything. Don't call this directly,
779 // call CTxMemPool::accept to properly check the transaction first.
782 for (unsigned int i = 0; i < tx.vin.size(); i++)
783 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
784 nTransactionsUpdated++;
790 bool CTxMemPool::remove(CTransaction &tx)
792 // Remove transaction from memory pool
795 uint256 hash = tx.GetHash();
796 if (mapTx.count(hash))
798 BOOST_FOREACH(const CTxIn& txin, tx.vin)
799 mapNextTx.erase(txin.prevout);
801 nTransactionsUpdated++;
807 void CTxMemPool::clear()
812 ++nTransactionsUpdated;
815 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
820 vtxid.reserve(mapTx.size());
821 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
822 vtxid.push_back((*mi).first);
828 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
830 if (hashBlock == 0 || nIndex == -1)
833 // Find the block it claims to be in
834 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
835 if (mi == mapBlockIndex.end())
837 CBlockIndex* pindex = (*mi).second;
838 if (!pindex || !pindex->IsInMainChain())
841 // Make sure the merkle branch connects to this block
842 if (!fMerkleVerified)
844 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
846 fMerkleVerified = true;
850 return pindexBest->nHeight - pindex->nHeight + 1;
854 int CMerkleTx::GetBlocksToMaturity() const
856 if (!(IsCoinBase() || IsCoinStake()))
858 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
862 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
866 if (!IsInMainChain() && !ClientConnectInputs())
868 return CTransaction::AcceptToMemoryPool(txdb, false);
872 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
876 bool CMerkleTx::AcceptToMemoryPool()
879 return AcceptToMemoryPool(txdb);
884 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
889 // Add previous supporting transactions first
890 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
892 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
894 uint256 hash = tx.GetHash();
895 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
896 tx.AcceptToMemoryPool(txdb, fCheckInputs);
899 return AcceptToMemoryPool(txdb, fCheckInputs);
904 bool CWalletTx::AcceptWalletTransaction()
907 return AcceptWalletTransaction(txdb);
910 int CTxIndex::GetDepthInMainChain() const
914 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
916 // Find the block in the index
917 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
918 if (mi == mapBlockIndex.end())
920 CBlockIndex* pindex = (*mi).second;
921 if (!pindex || !pindex->IsInMainChain())
923 return 1 + nBestHeight - pindex->nHeight;
926 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
927 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
933 if (mempool.exists(hash))
935 tx = mempool.lookup(hash);
941 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
944 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
945 hashBlock = block.GetHash();
959 //////////////////////////////////////////////////////////////////////////////
961 // CBlock and CBlockIndex
964 static CBlockIndex* pblockindexFBBHLast;
965 CBlockIndex* FindBlockByHeight(int nHeight)
967 CBlockIndex *pblockindex;
968 if (nHeight < nBestHeight / 2)
969 pblockindex = pindexGenesisBlock;
971 pblockindex = pindexBest;
972 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
973 pblockindex = pblockindexFBBHLast;
974 while (pblockindex->nHeight > nHeight)
975 pblockindex = pblockindex->pprev;
976 while (pblockindex->nHeight < nHeight)
977 pblockindex = pblockindex->pnext;
978 pblockindexFBBHLast = pblockindex;
982 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
984 if (!fReadTransactions)
986 *this = pindex->GetBlockHeader();
989 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
991 if (GetHash() != pindex->GetBlockHash())
992 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
996 uint256 static GetOrphanRoot(const CBlock* pblock)
998 // Work back to the first block in the orphan chain
999 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1000 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1001 return pblock->GetHash();
1004 // ppcoin: find block wanted by given orphan block
1005 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1007 // Work back to the first block in the orphan chain
1008 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1009 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1010 return pblockOrphan->hashPrevBlock;
1013 // select stake target limit according to hard-coded conditions
1014 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1016 if(fTestNet) // separate proof of stake target limit for testnet
1017 return bnProofOfStakeLimit;
1018 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1019 return bnProofOfStakeLimit;
1020 if(nHeight + 1 > 15000) // 24 bits since block 15000
1021 return bnProofOfStakeLegacyLimit;
1022 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1023 return bnProofOfStakeHardLimit;
1025 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1028 // miner's coin base reward based on nBits
1029 int64_t GetProofOfWorkReward(unsigned int nBits, int64_t nFees)
1031 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1034 bnTarget.SetCompact(nBits);
1035 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1036 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1038 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1039 // A reasonably continuous curve is used to avoid shock to market
1040 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1042 // Human readable form:
1044 // nSubsidy = 100 / (diff ^ 1/6)
1046 // Please note that we're using bisection to find an approximate solutuion
1047 CBigNum bnLowerBound = CENT;
1048 CBigNum bnUpperBound = bnSubsidyLimit;
1049 while (bnLowerBound + CENT <= bnUpperBound)
1051 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1052 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1053 bnUpperBound = bnMidValue;
1055 bnLowerBound = bnMidValue;
1058 int64_t nSubsidy = bnUpperBound.getuint64();
1060 nSubsidy = (nSubsidy / CENT) * CENT;
1061 if (fDebug && GetBoolArg("-printcreation"))
1062 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%" PRId64 "\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1064 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1067 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1068 int64_t GetProofOfStakeReward(int64_t nCoinAge, unsigned int nBits, int64_t nTime, bool bCoinYearOnly)
1070 int64_t nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1072 // Stage 2 of emission process is mostly PoS-based.
1074 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1076 bnTarget.SetCompact(nBits);
1077 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1078 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1080 // A reasonably continuous curve is used to avoid shock to market
1082 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1083 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1084 bnMidPart, bnRewardPart;
1086 while (bnLowerBound + CENT <= bnUpperBound)
1088 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1091 // Reward for coin-year is cut in half every 8x multiply of PoS difficulty
1093 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1095 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1098 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1099 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1101 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1102 bnUpperBound = bnMidValue;
1104 bnLowerBound = bnMidValue;
1107 nRewardCoinYear = bnUpperBound.getuint64();
1108 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1111 return nRewardCoinYear;
1113 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1115 // Set reasonable reward limit for large inputs
1117 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1119 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1120 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1122 nSubsidy = min(nSubsidy, nSubsidyLimit);
1124 if (fDebug && GetBoolArg("-printcreation"))
1125 printf("GetProofOfStakeReward(): create=%s nCoinAge=%" PRId64 " nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1130 static const int64_t nTargetTimespan = 7 * nOneDay; // one week
1132 // get proof of work blocks max spacing according to hard-coded conditions
1133 int64_t inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1135 if(nTime > TARGETS_SWITCH_TIME)
1136 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1139 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1141 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1145 // maximum nBits value could possible be required nTime after
1147 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64_t nTime)
1150 bnResult.SetCompact(nBase);
1152 while (nTime > 0 && bnResult < bnTargetLimit)
1154 // Maximum 200% adjustment per day...
1158 if (bnResult > bnTargetLimit)
1159 bnResult = bnTargetLimit;
1160 return bnResult.GetCompact();
1164 // minimum amount of work that could possibly be required nTime after
1165 // minimum proof-of-work required was nBase
1167 unsigned int ComputeMinWork(unsigned int nBase, int64_t nTime)
1169 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1173 // minimum amount of stake that could possibly be required nTime after
1174 // minimum proof-of-stake required was nBase
1176 unsigned int ComputeMinStake(unsigned int nBase, int64_t nTime, unsigned int nBlockTime)
1178 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1182 // ppcoin: find last block index up to pindex
1183 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1185 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1186 pindex = pindex->pprev;
1190 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1192 if (pindexLast == NULL)
1193 return bnProofOfWorkLimit.GetCompact(); // genesis block
1195 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1197 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1198 if (pindexPrev->pprev == NULL)
1199 return bnTargetLimit.GetCompact(); // first block
1200 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1201 if (pindexPrevPrev->pprev == NULL)
1202 return bnTargetLimit.GetCompact(); // second block
1204 int64_t nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1206 // ppcoin: target change every block
1207 // ppcoin: retarget with exponential moving toward target spacing
1209 bnNew.SetCompact(pindexPrev->nBits);
1210 int64_t nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64_t) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1211 int64_t nInterval = nTargetTimespan / nTargetSpacing;
1212 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1213 bnNew /= ((nInterval + 1) * nTargetSpacing);
1215 if (bnNew > bnTargetLimit)
1216 bnNew = bnTargetLimit;
1218 return bnNew.GetCompact();
1221 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1224 bnTarget.SetCompact(nBits);
1227 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1228 return error("CheckProofOfWork() : nBits below minimum work");
1230 // Check proof of work matches claimed amount
1231 if (hash > bnTarget.getuint256())
1232 return error("CheckProofOfWork() : hash doesn't match nBits");
1237 // Return maximum amount of blocks that other nodes claim to have
1238 int GetNumBlocksOfPeers()
1240 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1243 bool IsInitialBlockDownload()
1245 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1247 static int64_t nLastUpdate;
1248 static CBlockIndex* pindexLastBest;
1249 int64_t nCurrentTime = GetTime();
1250 if (pindexBest != pindexLastBest)
1252 pindexLastBest = pindexBest;
1253 nLastUpdate = nCurrentTime;
1255 return (nCurrentTime - nLastUpdate < 10 &&
1256 pindexBest->GetBlockTime() < nCurrentTime - nOneDay);
1259 void static InvalidChainFound(CBlockIndex* pindexNew)
1261 if (pindexNew->nChainTrust > nBestInvalidTrust)
1263 nBestInvalidTrust = pindexNew->nChainTrust;
1264 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1265 uiInterface.NotifyBlocksChanged();
1268 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1269 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1271 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1272 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1273 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1274 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1275 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
1276 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1277 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1278 nBestBlockTrust.Get64(),
1279 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1283 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1285 nTime = max(GetBlockTime(), GetAdjustedTime());
1298 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1300 // Relinquish previous transactions' spent pointers
1303 BOOST_FOREACH(const CTxIn& txin, vin)
1305 COutPoint prevout = txin.prevout;
1307 // Get prev txindex from disk
1309 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1310 return error("DisconnectInputs() : ReadTxIndex failed");
1312 if (prevout.n >= txindex.vSpent.size())
1313 return error("DisconnectInputs() : prevout.n out of range");
1315 // Mark outpoint as not spent
1316 txindex.vSpent[prevout.n].SetNull();
1319 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1320 return error("DisconnectInputs() : UpdateTxIndex failed");
1324 // Remove transaction from index
1325 // This can fail if a duplicate of this transaction was in a chain that got
1326 // reorganized away. This is only possible if this transaction was completely
1327 // spent, so erasing it would be a no-op anyway.
1328 txdb.EraseTxIndex(*this);
1334 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1335 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1337 // FetchInputs can return false either because we just haven't seen some inputs
1338 // (in which case the transaction should be stored as an orphan)
1339 // or because the transaction is malformed (in which case the transaction should
1340 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1344 return true; // Coinbase transactions have no inputs to fetch.
1346 for (unsigned int i = 0; i < vin.size(); i++)
1348 COutPoint prevout = vin[i].prevout;
1349 if (inputsRet.count(prevout.hash))
1350 continue; // Got it already
1353 CTxIndex& txindex = inputsRet[prevout.hash].first;
1355 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1357 // Get txindex from current proposed changes
1358 txindex = mapTestPool.find(prevout.hash)->second;
1362 // Read txindex from txdb
1363 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1365 if (!fFound && (fBlock || fMiner))
1366 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());
1369 CTransaction& txPrev = inputsRet[prevout.hash].second;
1370 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1372 // Get prev tx from single transactions in memory
1375 if (!mempool.exists(prevout.hash))
1376 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());
1377 txPrev = mempool.lookup(prevout.hash);
1380 txindex.vSpent.resize(txPrev.vout.size());
1384 // Get prev tx from disk
1385 if (!txPrev.ReadFromDisk(txindex.pos))
1386 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1390 // Make sure all prevout.n indexes are valid:
1391 for (unsigned int i = 0; i < vin.size(); i++)
1393 const COutPoint prevout = vin[i].prevout;
1394 assert(inputsRet.count(prevout.hash) != 0);
1395 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1396 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1397 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1399 // Revisit this if/when transaction replacement is implemented and allows
1402 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()));
1409 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1411 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1412 if (mi == inputs.end())
1413 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1415 const CTransaction& txPrev = (mi->second).second;
1416 if (input.prevout.n >= txPrev.vout.size())
1417 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1419 return txPrev.vout[input.prevout.n];
1422 int64_t CTransaction::GetValueIn(const MapPrevTx& inputs) const
1427 int64_t nResult = 0;
1428 for (unsigned int i = 0; i < vin.size(); i++)
1430 nResult += GetOutputFor(vin[i], inputs).nValue;
1436 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1441 unsigned int nSigOps = 0;
1442 for (unsigned int i = 0; i < vin.size(); i++)
1444 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1445 if (prevout.scriptPubKey.IsPayToScriptHash())
1446 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1451 bool CScriptCheck::operator()() const {
1452 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1453 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1454 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1458 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1460 return CScriptCheck(txFrom, txTo, nIn, flags, nHashType)();
1463 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1464 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
1466 // Take over previous transactions' spent pointers
1467 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1468 // fMiner is true when called from the internal bitcoin miner
1469 // ... both are false when called from CTransaction::AcceptToMemoryPool
1473 int64_t nValueIn = 0;
1475 for (unsigned int i = 0; i < vin.size(); i++)
1477 COutPoint prevout = vin[i].prevout;
1478 assert(inputs.count(prevout.hash) > 0);
1479 CTxIndex& txindex = inputs[prevout.hash].first;
1480 CTransaction& txPrev = inputs[prevout.hash].second;
1482 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1483 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()));
1485 // If prev is coinbase or coinstake, check that it's matured
1486 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1487 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1488 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1489 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1491 // ppcoin: check transaction timestamp
1492 if (txPrev.nTime > nTime)
1493 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1495 // Check for negative or overflow input values
1496 nValueIn += txPrev.vout[prevout.n].nValue;
1497 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1498 return DoS(100, error("ConnectInputs() : txin values out of range"));
1503 pvChecks->reserve(vin.size());
1505 // The first loop above does all the inexpensive checks.
1506 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1507 // Helps prevent CPU exhaustion attacks.
1508 for (unsigned int i = 0; i < vin.size(); i++)
1510 COutPoint prevout = vin[i].prevout;
1511 assert(inputs.count(prevout.hash) > 0);
1512 CTxIndex& txindex = inputs[prevout.hash].first;
1513 CTransaction& txPrev = inputs[prevout.hash].second;
1515 // Check for conflicts (double-spend)
1516 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1517 // for an attacker to attempt to split the network.
1518 if (!txindex.vSpent[prevout.n].IsNull())
1519 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());
1521 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1522 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1523 // still computed and checked, and any change will be caught at the next checkpoint.
1527 CScriptCheck check(txPrev, *this, i, flags, 0);
1530 pvChecks->push_back(CScriptCheck());
1531 check.swap(pvChecks->back());
1535 if (flags & STRICT_FLAGS)
1537 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1538 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1540 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1542 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1546 // Mark outpoints as spent
1547 txindex.vSpent[prevout.n] = posThisTx;
1550 if (fBlock || fMiner)
1552 mapTestPool[prevout.hash] = txindex;
1558 if (nTime > Checkpoints::GetLastCheckpointTime())
1560 unsigned int nTxSize = GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
1562 // coin stake tx earns reward instead of paying fee
1564 if (!GetCoinAge(txdb, nCoinAge))
1565 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1567 int64_t nReward = GetValueOut() - nValueIn;
1568 int64_t nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1570 if (nReward > nCalculatedReward)
1571 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%" PRId64 " vs calculated=%" PRId64 ")", nReward, nCalculatedReward));
1576 if (nValueIn < GetValueOut())
1577 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1579 // Tally transaction fees
1580 int64_t nTxFee = nValueIn - GetValueOut();
1582 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1585 if (!MoneyRange(nFees))
1586 return DoS(100, error("ConnectInputs() : nFees out of range"));
1594 bool CTransaction::ClientConnectInputs()
1599 // Take over previous transactions' spent pointers
1602 int64_t nValueIn = 0;
1603 for (unsigned int i = 0; i < vin.size(); i++)
1605 // Get prev tx from single transactions in memory
1606 COutPoint prevout = vin[i].prevout;
1607 if (!mempool.exists(prevout.hash))
1609 CTransaction& txPrev = mempool.lookup(prevout.hash);
1611 if (prevout.n >= txPrev.vout.size())
1615 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1616 return error("ClientConnectInputs() : VerifySignature failed");
1618 ///// this is redundant with the mempool.mapNextTx stuff,
1619 ///// not sure which I want to get rid of
1620 ///// this has to go away now that posNext is gone
1621 // // Check for conflicts
1622 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1623 // return error("ConnectInputs() : prev tx already used");
1625 // // Flag outpoints as used
1626 // txPrev.vout[prevout.n].posNext = posThisTx;
1628 nValueIn += txPrev.vout[prevout.n].nValue;
1630 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1631 return error("ClientConnectInputs() : txin values out of range");
1633 if (GetValueOut() > nValueIn)
1643 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1645 // Disconnect in reverse order
1646 for (int i = vtx.size()-1; i >= 0; i--)
1647 if (!vtx[i].DisconnectInputs(txdb))
1650 // Update block index on disk without changing it in memory.
1651 // The memory index structure will be changed after the db commits.
1654 CDiskBlockIndex blockindexPrev(pindex->pprev);
1655 blockindexPrev.hashNext = 0;
1656 if (!txdb.WriteBlockIndex(blockindexPrev))
1657 return error("DisconnectBlock() : WriteBlockIndex failed");
1660 // ppcoin: clean up wallet after disconnecting coinstake
1661 BOOST_FOREACH(CTransaction& tx, vtx)
1662 SyncWithWallets(tx, this, false, false);
1667 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1669 void ThreadScriptCheck(void*) {
1670 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1671 RenameThread("novacoin-scriptch");
1672 scriptcheckqueue.Thread();
1673 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1676 void ThreadScriptCheckQuit() {
1677 scriptcheckqueue.Quit();
1680 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1682 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1683 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1686 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1687 // unless those are already completely spent.
1688 // If such overwrites are allowed, coinbases and transactions depending upon those
1689 // can be duplicated to remove the ability to spend the first instance -- even after
1690 // being sent to another address.
1691 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1692 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1693 // already refuses previously-known transaction ids entirely.
1694 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1695 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1696 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1697 // initial block download.
1698 bool fEnforceBIP30 = true; // Always active in NovaCoin
1699 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1701 //// issue here: it doesn't know the version
1702 unsigned int nTxPos;
1704 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1705 // 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
1708 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1710 map<uint256, CTxIndex> mapQueuedChanges;
1711 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1714 int64_t nValueIn = 0;
1715 int64_t nValueOut = 0;
1716 unsigned int nSigOps = 0;
1717 BOOST_FOREACH(CTransaction& tx, vtx)
1719 uint256 hashTx = tx.GetHash();
1721 if (fEnforceBIP30) {
1722 CTxIndex txindexOld;
1723 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1724 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1730 nSigOps += tx.GetLegacySigOpCount();
1731 if (nSigOps > MAX_BLOCK_SIGOPS)
1732 return DoS(100, error("ConnectBlock() : too many sigops"));
1734 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1736 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1738 MapPrevTx mapInputs;
1739 if (tx.IsCoinBase())
1740 nValueOut += tx.GetValueOut();
1744 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1747 // Add in sigops done by pay-to-script-hash inputs;
1748 // this is to prevent a "rogue miner" from creating
1749 // an incredibly-expensive-to-validate block.
1750 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1751 if (nSigOps > MAX_BLOCK_SIGOPS)
1752 return DoS(100, error("ConnectBlock() : too many sigops"));
1754 int64_t nTxValueIn = tx.GetValueIn(mapInputs);
1755 int64_t nTxValueOut = tx.GetValueOut();
1756 nValueIn += nTxValueIn;
1757 nValueOut += nTxValueOut;
1758 if (!tx.IsCoinStake())
1759 nFees += nTxValueIn - nTxValueOut;
1761 unsigned int nFlags = SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH;
1763 if (tx.nTime >= CHECKLOCKTIMEVERIFY_SWITCH_TIME) {
1764 nFlags |= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
1765 // OP_CHECKSEQUENCEVERIFY is senseless without BIP68, so we're going disable it for now.
1766 // nFlags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
1769 std::vector<CScriptCheck> vChecks;
1770 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, nFlags, nScriptCheckThreads ? &vChecks : NULL))
1772 control.Add(vChecks);
1775 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1778 if (!control.Wait())
1779 return DoS(100, false);
1781 if (IsProofOfWork())
1783 int64_t nBlockReward = GetProofOfWorkReward(nBits, nFees);
1785 // Check coinbase reward
1786 if (vtx[0].GetValueOut() > nBlockReward)
1787 return error("CheckBlock() : coinbase reward exceeded (actual=%" PRId64 " vs calculated=%" PRId64 ")",
1788 vtx[0].GetValueOut(),
1792 // track money supply and mint amount info
1793 pindex->nMint = nValueOut - nValueIn + nFees;
1794 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1795 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1796 return error("Connect() : WriteBlockIndex for pindex failed");
1798 // fees are not collected by proof-of-stake miners
1799 // fees are destroyed to compensate the entire network
1800 if (fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1801 printf("ConnectBlock() : destroy=%s nFees=%" PRId64 "\n", FormatMoney(nFees).c_str(), nFees);
1806 // Write queued txindex changes
1807 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1809 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1810 return error("ConnectBlock() : UpdateTxIndex failed");
1813 // Update block index on disk without changing it in memory.
1814 // The memory index structure will be changed after the db commits.
1817 CDiskBlockIndex blockindexPrev(pindex->pprev);
1818 blockindexPrev.hashNext = pindex->GetBlockHash();
1819 if (!txdb.WriteBlockIndex(blockindexPrev))
1820 return error("ConnectBlock() : WriteBlockIndex failed");
1823 // Watch for transactions paying to me
1824 BOOST_FOREACH(CTransaction& tx, vtx)
1825 SyncWithWallets(tx, this, true);
1831 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1833 printf("REORGANIZE\n");
1836 CBlockIndex* pfork = pindexBest;
1837 CBlockIndex* plonger = pindexNew;
1838 while (pfork != plonger)
1840 while (plonger->nHeight > pfork->nHeight)
1841 if ((plonger = plonger->pprev) == NULL)
1842 return error("Reorganize() : plonger->pprev is null");
1843 if (pfork == plonger)
1845 if ((pfork = pfork->pprev) == NULL)
1846 return error("Reorganize() : pfork->pprev is null");
1849 // List of what to disconnect
1850 vector<CBlockIndex*> vDisconnect;
1851 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1852 vDisconnect.push_back(pindex);
1854 // List of what to connect
1855 vector<CBlockIndex*> vConnect;
1856 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1857 vConnect.push_back(pindex);
1858 reverse(vConnect.begin(), vConnect.end());
1860 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());
1861 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());
1863 // Disconnect shorter branch
1864 vector<CTransaction> vResurrect;
1865 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1868 if (!block.ReadFromDisk(pindex))
1869 return error("Reorganize() : ReadFromDisk for disconnect failed");
1870 if (!block.DisconnectBlock(txdb, pindex))
1871 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1873 // Queue memory transactions to resurrect
1874 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1875 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1876 vResurrect.push_back(tx);
1879 // Connect longer branch
1880 vector<CTransaction> vDelete;
1881 for (unsigned int i = 0; i < vConnect.size(); i++)
1883 CBlockIndex* pindex = vConnect[i];
1885 if (!block.ReadFromDisk(pindex))
1886 return error("Reorganize() : ReadFromDisk for connect failed");
1887 if (!block.ConnectBlock(txdb, pindex))
1890 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1893 // Queue memory transactions to delete
1894 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1895 vDelete.push_back(tx);
1897 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1898 return error("Reorganize() : WriteHashBestChain failed");
1900 // Make sure it's successfully written to disk before changing memory structure
1901 if (!txdb.TxnCommit())
1902 return error("Reorganize() : TxnCommit failed");
1904 // Disconnect shorter branch
1905 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1907 pindex->pprev->pnext = NULL;
1909 // Connect longer branch
1910 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1912 pindex->pprev->pnext = pindex;
1914 // Resurrect memory transactions that were in the disconnected branch
1915 BOOST_FOREACH(CTransaction& tx, vResurrect)
1916 tx.AcceptToMemoryPool(txdb, false);
1918 // Delete redundant memory transactions that are in the connected branch
1919 BOOST_FOREACH(CTransaction& tx, vDelete)
1922 printf("REORGANIZE: done\n");
1928 // Called from inside SetBestChain: attaches a block to the new best chain being built
1929 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1931 uint256 hash = GetHash();
1933 // Adding to current best branch
1934 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1937 InvalidChainFound(pindexNew);
1940 if (!txdb.TxnCommit())
1941 return error("SetBestChain() : TxnCommit failed");
1943 // Add to current best branch
1944 pindexNew->pprev->pnext = pindexNew;
1946 // Delete redundant memory transactions
1947 BOOST_FOREACH(CTransaction& tx, vtx)
1953 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1955 uint256 hash = GetHash();
1957 if (!txdb.TxnBegin())
1958 return error("SetBestChain() : TxnBegin failed");
1960 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1962 txdb.WriteHashBestChain(hash);
1963 if (!txdb.TxnCommit())
1964 return error("SetBestChain() : TxnCommit failed");
1965 pindexGenesisBlock = pindexNew;
1967 else if (hashPrevBlock == hashBestChain)
1969 if (!SetBestChainInner(txdb, pindexNew))
1970 return error("SetBestChain() : SetBestChainInner failed");
1974 // the first block in the new chain that will cause it to become the new best chain
1975 CBlockIndex *pindexIntermediate = pindexNew;
1977 // list of blocks that need to be connected afterwards
1978 std::vector<CBlockIndex*> vpindexSecondary;
1980 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1981 // Try to limit how much needs to be done inside
1982 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1984 vpindexSecondary.push_back(pindexIntermediate);
1985 pindexIntermediate = pindexIntermediate->pprev;
1988 if (!vpindexSecondary.empty())
1989 printf("Postponing %" PRIszu " reconnects\n", vpindexSecondary.size());
1991 // Switch to new best branch
1992 if (!Reorganize(txdb, pindexIntermediate))
1995 InvalidChainFound(pindexNew);
1996 return error("SetBestChain() : Reorganize failed");
1999 // Connect further blocks
2000 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
2003 if (!block.ReadFromDisk(pindex))
2005 printf("SetBestChain() : ReadFromDisk failed\n");
2008 if (!txdb.TxnBegin()) {
2009 printf("SetBestChain() : TxnBegin 2 failed\n");
2012 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
2013 if (!block.SetBestChainInner(txdb, pindex))
2018 // Update best block in wallet (so we can detect restored wallets)
2019 bool fIsInitialDownload = IsInitialBlockDownload();
2020 if (!fIsInitialDownload)
2022 const CBlockLocator locator(pindexNew);
2023 ::SetBestChain(locator);
2027 hashBestChain = hash;
2028 pindexBest = pindexNew;
2029 pblockindexFBBHLast = NULL;
2030 nBestHeight = pindexBest->nHeight;
2031 nBestChainTrust = pindexNew->nChainTrust;
2032 nTimeBestReceived = GetTime();
2033 nTransactionsUpdated++;
2035 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2037 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%" PRId64 " date=%s\n",
2038 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2039 CBigNum(nBestChainTrust).ToString().c_str(),
2040 nBestBlockTrust.Get64(),
2041 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2043 // Check the version of the last 100 blocks to see if we need to upgrade:
2044 if (!fIsInitialDownload)
2047 const CBlockIndex* pindex = pindexBest;
2048 for (int i = 0; i < 100 && pindex != NULL; i++)
2050 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2052 pindex = pindex->pprev;
2055 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2056 if (nUpgraded > 100/2)
2057 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2058 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2061 std::string strCmd = GetArg("-blocknotify", "");
2063 if (!fIsInitialDownload && !strCmd.empty())
2065 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2066 boost::thread t(runCommand, strCmd); // thread runs free
2072 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2073 // Only those coins meeting minimum age requirement counts. As those
2074 // transactions not in main chain are not currently indexed so we
2075 // might not find out about their coin age. Older transactions are
2076 // guaranteed to be in main chain by sync-checkpoint. This rule is
2077 // introduced to help nodes establish a consistent view of the coin
2078 // age (trust score) of competing branches.
2079 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64_t& nCoinAge) const
2081 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2087 BOOST_FOREACH(const CTxIn& txin, vin)
2089 // First try finding the previous transaction in database
2090 CTransaction txPrev;
2092 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2093 continue; // previous transaction not in main chain
2094 if (nTime < txPrev.nTime)
2095 return false; // Transaction timestamp violation
2097 // Read block header
2099 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2100 return false; // unable to read block of previous transaction
2101 if (block.GetBlockTime() + nStakeMinAge > nTime)
2102 continue; // only count coins meeting min age requirement
2104 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
2105 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2107 if (fDebug && GetBoolArg("-printcoinage"))
2108 printf("coin age nValueIn=%" PRId64 " nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2111 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / nOneDay;
2112 if (fDebug && GetBoolArg("-printcoinage"))
2113 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2114 nCoinAge = bnCoinDay.getuint64();
2118 // ppcoin: total coin age spent in block, in the unit of coin-days.
2119 bool CBlock::GetCoinAge(uint64_t& nCoinAge) const
2124 BOOST_FOREACH(const CTransaction& tx, vtx)
2126 uint64_t nTxCoinAge;
2127 if (tx.GetCoinAge(txdb, nTxCoinAge))
2128 nCoinAge += nTxCoinAge;
2133 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2135 if (fDebug && GetBoolArg("-printcoinage"))
2136 printf("block coin age total nCoinDays=%" PRId64 "\n", nCoinAge);
2140 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2142 // Check for duplicate
2143 uint256 hash = GetHash();
2144 if (mapBlockIndex.count(hash))
2145 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2147 // Construct new block index object
2148 CBlockIndex* pindexNew = new(nothrow) CBlockIndex(nFile, nBlockPos, *this);
2150 return error("AddToBlockIndex() : new CBlockIndex failed");
2151 pindexNew->phashBlock = &hash;
2152 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2153 if (miPrev != mapBlockIndex.end())
2155 pindexNew->pprev = (*miPrev).second;
2156 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2159 // ppcoin: compute chain trust score
2160 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2162 // ppcoin: compute stake entropy bit for stake modifier
2163 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
2164 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2166 // ppcoin: record proof-of-stake hash value
2167 if (pindexNew->IsProofOfStake())
2169 if (!mapProofOfStake.count(hash))
2170 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2171 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2174 // ppcoin: compute stake modifier
2175 uint64_t nStakeModifier = 0;
2176 bool fGeneratedStakeModifier = false;
2177 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2178 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2179 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2180 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2181 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2182 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016" PRIx64, pindexNew->nHeight, nStakeModifier);
2184 // Add to mapBlockIndex
2185 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2186 if (pindexNew->IsProofOfStake())
2187 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2188 pindexNew->phashBlock = &((*mi).first);
2190 // Write to disk block index
2192 if (!txdb.TxnBegin())
2194 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2195 if (!txdb.TxnCommit())
2199 if (pindexNew->nChainTrust > nBestChainTrust)
2200 if (!SetBestChain(txdb, pindexNew))
2203 if (pindexNew == pindexBest)
2205 // Notify UI to display prev block's coinbase if it was ours
2206 static uint256 hashPrevBestCoinBase;
2207 UpdatedTransaction(hashPrevBestCoinBase);
2208 hashPrevBestCoinBase = vtx[0].GetHash();
2211 static int8_t counter = 0;
2212 if( (++counter & 0x0F) == 0 || !IsInitialBlockDownload()) // repaint every 16 blocks if not in initial block download
2213 uiInterface.NotifyBlocksChanged();
2220 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2222 // These are checks that are independent of context
2223 // that can be verified before saving an orphan block.
2225 set<uint256> uniqueTx; // tx hashes
2226 unsigned int nSigOps = 0; // total sigops
2229 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2230 return DoS(100, error("CheckBlock() : size limits failed"));
2232 bool fProofOfStake = IsProofOfStake();
2234 // First transaction must be coinbase, the rest must not be
2235 if (!vtx[0].IsCoinBase())
2236 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2238 if (!vtx[0].CheckTransaction())
2239 return DoS(vtx[0].nDoS, error("CheckBlock() : CheckTransaction failed on coinbase"));
2241 uniqueTx.insert(vtx[0].GetHash());
2242 nSigOps += vtx[0].GetLegacySigOpCount();
2246 // Proof-of-STake related checkings. Note that we know here that 1st transactions is coinstake. We don't need
2247 // check the type of 1st transaction because it's performed earlier by IsProofOfStake()
2249 // nNonce must be zero for proof-of-stake blocks
2251 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2253 // Coinbase output should be empty if proof-of-stake block
2254 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2255 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2257 // Check coinstake timestamp
2258 if (GetBlockTime() != (int64_t)vtx[1].nTime)
2259 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%" PRId64 " nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2261 // NovaCoin: check proof-of-stake block signature
2262 if (fCheckSig && !CheckBlockSignature())
2263 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2265 if (!vtx[1].CheckTransaction())
2266 return DoS(vtx[1].nDoS, error("CheckBlock() : CheckTransaction failed on coinstake"));
2268 uniqueTx.insert(vtx[1].GetHash());
2269 nSigOps += vtx[1].GetLegacySigOpCount();
2273 // Check proof of work matches claimed amount
2274 if (fCheckPOW && !CheckProofOfWork(GetHash(), nBits))
2275 return DoS(50, error("CheckBlock() : proof of work failed"));
2278 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2279 return error("CheckBlock() : block timestamp too far in the future");
2281 // Check coinbase timestamp
2282 if (GetBlockTime() < PastDrift((int64_t)vtx[0].nTime))
2283 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2286 // Iterate all transactions starting from second for proof-of-stake block
2287 // or first for proof-of-work block
2288 for (unsigned int i = fProofOfStake ? 2 : 1; i < vtx.size(); i++)
2290 const CTransaction& tx = vtx[i];
2292 // Reject coinbase transactions at non-zero index
2293 if (tx.IsCoinBase())
2294 return DoS(100, error("CheckBlock() : coinbase at wrong index"));
2296 // Reject coinstake transactions at index != 1
2297 if (tx.IsCoinStake())
2298 return DoS(100, error("CheckBlock() : coinstake at wrong index"));
2300 // Check transaction timestamp
2301 if (GetBlockTime() < (int64_t)tx.nTime)
2302 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2304 // Check transaction consistency
2305 if (!tx.CheckTransaction())
2306 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2308 // Add transaction hash into list of unique transaction IDs
2309 uniqueTx.insert(tx.GetHash());
2311 // Calculate sigops count
2312 nSigOps += tx.GetLegacySigOpCount();
2315 // Check for duplicate txids. This is caught by ConnectInputs(),
2316 // but catching it earlier avoids a potential DoS attack:
2317 if (uniqueTx.size() != vtx.size())
2318 return DoS(100, error("CheckBlock() : duplicate transaction"));
2320 // Reject block if validation would consume too much resources.
2321 if (nSigOps > MAX_BLOCK_SIGOPS)
2322 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2324 // Check merkle root
2325 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2326 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2331 bool CBlock::AcceptBlock()
2333 // Check for duplicate
2334 uint256 hash = GetHash();
2335 if (mapBlockIndex.count(hash))
2336 return error("AcceptBlock() : block already in mapBlockIndex");
2338 // Get prev block index
2339 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2340 if (mi == mapBlockIndex.end())
2341 return DoS(10, error("AcceptBlock() : prev block not found"));
2342 CBlockIndex* pindexPrev = (*mi).second;
2343 int nHeight = pindexPrev->nHeight+1;
2345 // Check proof-of-work or proof-of-stake
2346 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2347 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2349 int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
2350 int nMaxOffset = 12 * nOneHour; // 12 hours
2351 if (fTestNet || pindexPrev->nTime < 1450569600)
2352 nMaxOffset = 7 * nOneWeek; // One week (permanently on testNet or until 20 Dec, 2015 on mainNet)
2354 // Check timestamp against prev
2355 if (GetBlockTime() <= nMedianTimePast || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2356 return error("AcceptBlock() : block's timestamp is too early");
2358 // Don't accept blocks with future timestamps
2359 if (pindexPrev->nHeight > 1 && nMedianTimePast + nMaxOffset < GetBlockTime())
2360 return error("AcceptBlock() : block's timestamp is too far in the future");
2362 // Check that all transactions are finalized
2363 BOOST_FOREACH(const CTransaction& tx, vtx)
2364 if (!tx.IsFinal(nHeight, GetBlockTime()))
2365 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2367 // Check that the block chain matches the known block chain up to a checkpoint
2368 if (!Checkpoints::CheckHardened(nHeight, hash))
2369 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2371 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2373 // Check that the block satisfies synchronized checkpoint
2374 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2375 return error("AcceptBlock() : rejected by synchronized checkpoint");
2377 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2378 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2380 // Enforce rule that the coinbase starts with serialized block height
2381 CScript expect = CScript() << nHeight;
2382 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2383 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2384 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2386 // Write block to history file
2387 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2388 return error("AcceptBlock() : out of disk space");
2389 unsigned int nFile = std::numeric_limits<unsigned int>::max();
2390 unsigned int nBlockPos = 0;
2391 if (!WriteToDisk(nFile, nBlockPos))
2392 return error("AcceptBlock() : WriteToDisk failed");
2393 if (!AddToBlockIndex(nFile, nBlockPos))
2394 return error("AcceptBlock() : AddToBlockIndex failed");
2396 // Relay inventory, but don't relay old inventory during initial block download
2397 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2398 if (hashBestChain == hash)
2401 BOOST_FOREACH(CNode* pnode, vNodes)
2402 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2403 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2406 // ppcoin: check pending sync-checkpoint
2407 Checkpoints::AcceptPendingSyncCheckpoint();
2412 uint256 CBlockIndex::GetBlockTrust() const
2415 bnTarget.SetCompact(nBits);
2420 // Return 1 for the first 12 blocks
2421 if (pprev == NULL || pprev->nHeight < 12)
2424 const CBlockIndex* currentIndex = pprev;
2426 if(IsProofOfStake())
2428 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2430 // Return 1/3 of score if parent block is not the PoW block
2431 if (!pprev->IsProofOfWork())
2432 return (bnNewTrust / 3).getuint256();
2436 // Check last 12 blocks type
2437 while (pprev->nHeight - currentIndex->nHeight < 12)
2439 if (currentIndex->IsProofOfWork())
2441 currentIndex = currentIndex->pprev;
2444 // Return 1/3 of score if less than 3 PoW blocks found
2446 return (bnNewTrust / 3).getuint256();
2448 return bnNewTrust.getuint256();
2452 // Calculate work amount for block
2453 CBigNum bnPoWTrust = CBigNum(nPoWBase) / (bnTarget+1);
2455 // Set nPowTrust to 1 if PoW difficulty is too low
2459 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2461 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2462 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2463 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2467 // Check last 12 blocks type
2468 while (pprev->nHeight - currentIndex->nHeight < 12)
2470 if (currentIndex->IsProofOfStake())
2472 currentIndex = currentIndex->pprev;
2475 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2477 return (bnPoWTrust + 2 * bnLastBlockTrust / 3).getuint256();
2479 bnTarget.SetCompact(pprev->nBits);
2484 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2486 // Return nPoWTrust + full trust score for previous block nBits
2487 return (bnPoWTrust + bnNewTrust).getuint256();
2491 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2493 unsigned int nFound = 0;
2494 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2496 if (pstart->nVersion >= minVersion)
2498 pstart = pstart->pprev;
2500 return (nFound >= nRequired);
2503 bool static ReserealizeBlockSignature(CBlock* pblock)
2505 if (pblock->IsProofOfWork())
2507 pblock->vchBlockSig.clear();
2511 return CPubKey::ReserealizeSignature(pblock->vchBlockSig);
2514 bool static IsCanonicalBlockSignature(CBlock* pblock)
2516 if (pblock->IsProofOfWork())
2517 return pblock->vchBlockSig.empty();
2519 return IsDERSignature(pblock->vchBlockSig);
2522 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2524 // Check for duplicate
2525 uint256 hash = pblock->GetHash();
2526 if (mapBlockIndex.count(hash))
2527 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2528 if (mapOrphanBlocks.count(hash))
2529 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2531 // Check that block isn't listed as unconditionally banned.
2532 if (!Checkpoints::CheckBanned(hash)) {
2534 pfrom->Misbehaving(100);
2535 return error("ProcessBlock() : block %s is rejected by hard-coded banlist", hash.GetHex().substr(0,20).c_str());
2538 // Check proof-of-stake
2539 // Limited duplicity on stake: prevents block flood attack
2540 // Duplicate stake allowed only when there is orphan child block
2541 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2542 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());
2544 // Strip the garbage from newly received blocks, if we found some
2545 if (!IsCanonicalBlockSignature(pblock)) {
2546 if (!ReserealizeBlockSignature(pblock))
2547 printf("WARNING: ProcessBlock() : ReserealizeBlockSignature FAILED\n");
2550 // Preliminary checks
2551 if (!pblock->CheckBlock(true, true, (pblock->nTime > Checkpoints::GetLastCheckpointTime())))
2552 return error("ProcessBlock() : CheckBlock FAILED");
2554 // ppcoin: verify hash target and signature of coinstake tx
2555 if (pblock->IsProofOfStake())
2557 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2558 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2560 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2561 return false; // do not error here as we expect this during initial block download
2563 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2564 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2567 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2568 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2570 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2571 int64_t deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2573 bnNewBlock.SetCompact(pblock->nBits);
2576 if (pblock->IsProofOfStake())
2577 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2579 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2581 if (bnNewBlock > bnRequired)
2584 pfrom->Misbehaving(100);
2585 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2589 // ppcoin: ask for pending sync-checkpoint if any
2590 if (!IsInitialBlockDownload())
2591 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2593 // If don't already have its previous block, shunt it off to holding area until we get it
2594 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2596 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2597 // ppcoin: check proof-of-stake
2598 if (pblock->IsProofOfStake())
2600 // Limited duplicity on stake: prevents block flood attack
2601 // Duplicate stake allowed only when there is orphan child block
2602 if (setStakeSeenOrphan.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2603 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());
2605 setStakeSeenOrphan.insert(pblock->GetProofOfStake());
2607 CBlock* pblock2 = new CBlock(*pblock);
2608 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2609 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2611 // Ask this guy to fill in what we're missing
2614 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2615 // ppcoin: getblocks may not obtain the ancestor block rejected
2616 // earlier by duplicate-stake check so we ask for it again directly
2617 if (!IsInitialBlockDownload())
2618 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2624 if (!pblock->AcceptBlock())
2625 return error("ProcessBlock() : AcceptBlock FAILED");
2627 // Recursively process any orphan blocks that depended on this one
2628 vector<uint256> vWorkQueue;
2629 vWorkQueue.push_back(hash);
2630 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2632 uint256 hashPrev = vWorkQueue[i];
2633 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2634 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2637 CBlock* pblockOrphan = (*mi).second;
2638 if (pblockOrphan->AcceptBlock())
2639 vWorkQueue.push_back(pblockOrphan->GetHash());
2640 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2641 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2642 delete pblockOrphan;
2644 mapOrphanBlocksByPrev.erase(hashPrev);
2647 printf("ProcessBlock: ACCEPTED\n");
2649 // ppcoin: if responsible for sync-checkpoint send it
2650 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2651 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2656 // ppcoin: check block signature
2657 bool CBlock::CheckBlockSignature() const
2659 if (vchBlockSig.empty())
2662 txnouttype whichType;
2663 vector<valtype> vSolutions;
2664 if (!Solver(vtx[1].vout[1].scriptPubKey, whichType, vSolutions))
2667 if (whichType == TX_PUBKEY)
2669 valtype& vchPubKey = vSolutions[0];
2670 CPubKey key(vchPubKey);
2673 return key.Verify(GetHash(), vchBlockSig);
2679 bool CheckDiskSpace(uint64_t nAdditionalBytes)
2681 uint64_t nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2683 // Check for nMinDiskSpace bytes (currently 50MB)
2684 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2687 string strMessage = _("Warning: Disk space is low!");
2688 strMiscWarning = strMessage;
2689 printf("*** %s\n", strMessage.c_str());
2690 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2697 static filesystem::path BlockFilePath(unsigned int nFile)
2699 string strBlockFn = strprintf("blk%04u.dat", nFile);
2700 return GetDataDir() / strBlockFn;
2703 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2705 if ((nFile < 1) || (nFile == std::numeric_limits<uint32_t>::max()))
2707 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2710 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2712 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2721 static unsigned int nCurrentBlockFile = 1;
2723 FILE* AppendBlockFile(unsigned int& nFileRet)
2728 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2731 if (fseek(file, 0, SEEK_END) != 0)
2733 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2734 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2736 nFileRet = nCurrentBlockFile;
2740 nCurrentBlockFile++;
2744 void UnloadBlockIndex()
2746 mapBlockIndex.clear();
2747 setStakeSeen.clear();
2748 pindexGenesisBlock = NULL;
2750 nBestChainTrust = 0;
2751 nBestInvalidTrust = 0;
2756 bool LoadBlockIndex(bool fAllowNew)
2760 pchMessageStart[0] = 0xcd;
2761 pchMessageStart[1] = 0xf2;
2762 pchMessageStart[2] = 0xc0;
2763 pchMessageStart[3] = 0xef;
2765 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2766 nStakeMinAge = 2 * nOneHour; // test net min age is 2 hours
2767 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2768 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2769 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2776 if (!txdb.LoadBlockIndex())
2780 // Init with genesis block
2782 if (mapBlockIndex.empty())
2791 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2792 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2793 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2795 // vMerkleTree: 4cb33b3b6a
2799 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2800 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2801 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2803 // vMerkleTree: 4cb33b3b6a
2805 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2807 txNew.nTime = 1360105017;
2808 txNew.vin.resize(1);
2809 txNew.vout.resize(1);
2810 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2811 txNew.vout[0].SetEmpty();
2813 block.vtx.push_back(txNew);
2814 block.hashPrevBlock = 0;
2815 block.hashMerkleRoot = block.BuildMerkleTree();
2817 block.nTime = 1360105017;
2818 block.nBits = bnProofOfWorkLimit.GetCompact();
2819 block.nNonce = !fTestNet ? 1575379 : 46534;
2822 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2824 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2825 assert(block.CheckBlock());
2827 // Start new block file
2829 unsigned int nBlockPos;
2830 if (!block.WriteToDisk(nFile, nBlockPos))
2831 return error("LoadBlockIndex() : writing genesis block to disk failed");
2832 if (!block.AddToBlockIndex(nFile, nBlockPos))
2833 return error("LoadBlockIndex() : genesis block not accepted");
2835 // initialize synchronized checkpoint
2836 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2837 return error("LoadBlockIndex() : failed to init sync checkpoint");
2839 // upgrade time set to zero if txdb initialized
2841 if (!txdb.WriteModifierUpgradeTime(0))
2842 return error("LoadBlockIndex() : failed to init upgrade info");
2843 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2849 string strPubKey = "";
2850 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2852 // write checkpoint master key to db
2854 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2855 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2856 if (!txdb.TxnCommit())
2857 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2858 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2859 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2862 // upgrade time set to zero if blocktreedb initialized
2863 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2865 if (nModifierUpgradeTime)
2866 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2868 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2872 nModifierUpgradeTime = GetTime();
2873 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2874 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2875 return error("LoadBlockIndex() : failed to write upgrade info");
2888 void PrintBlockTree()
2890 // pre-compute tree structure
2891 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2892 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2894 CBlockIndex* pindex = (*mi).second;
2895 mapNext[pindex->pprev].push_back(pindex);
2897 //while (rand() % 3 == 0)
2898 // mapNext[pindex->pprev].push_back(pindex);
2901 vector<pair<int, CBlockIndex*> > vStack;
2902 vStack.push_back(make_pair(0, pindexGenesisBlock));
2905 while (!vStack.empty())
2907 int nCol = vStack.back().first;
2908 CBlockIndex* pindex = vStack.back().second;
2911 // print split or gap
2912 if (nCol > nPrevCol)
2914 for (int i = 0; i < nCol-1; i++)
2918 else if (nCol < nPrevCol)
2920 for (int i = 0; i < nCol; i++)
2927 for (int i = 0; i < nCol; i++)
2932 block.ReadFromDisk(pindex);
2933 printf("%d (%u,%u) %s %08x %s mint %7s tx %" PRIszu "",
2937 block.GetHash().ToString().c_str(),
2939 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2940 FormatMoney(pindex->nMint).c_str(),
2943 PrintWallets(block);
2945 // put the main time-chain first
2946 vector<CBlockIndex*>& vNext = mapNext[pindex];
2947 for (unsigned int i = 0; i < vNext.size(); i++)
2949 if (vNext[i]->pnext)
2951 swap(vNext[0], vNext[i]);
2957 for (unsigned int i = 0; i < vNext.size(); i++)
2958 vStack.push_back(make_pair(nCol+i, vNext[i]));
2962 bool LoadExternalBlockFile(FILE* fileIn)
2964 int64_t nStart = GetTimeMillis();
2970 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2971 unsigned int nPos = 0;
2972 while (nPos != std::numeric_limits<uint32_t>::max() && blkdat.good() && !fRequestShutdown)
2974 unsigned char pchData[65536];
2976 fseek(blkdat, nPos, SEEK_SET);
2977 size_t nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2980 nPos = std::numeric_limits<uint32_t>::max();
2983 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2986 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2988 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2991 nPos += ((unsigned char*)nFind - pchData) + 1;
2994 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2995 } while(!fRequestShutdown);
2996 if (nPos == std::numeric_limits<uint32_t>::max())
2998 fseek(blkdat, nPos, SEEK_SET);
3001 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3005 if (ProcessBlock(NULL,&block))
3013 catch (const std::exception&) {
3014 printf("%s() : Deserialize or I/O error caught during load\n",
3015 BOOST_CURRENT_FUNCTION);
3018 printf("Loaded %i blocks from external file in %" PRId64 "ms\n", nLoaded, GetTimeMillis() - nStart);
3022 //////////////////////////////////////////////////////////////////////////////
3027 extern map<uint256, CAlert> mapAlerts;
3028 extern CCriticalSection cs_mapAlerts;
3030 string GetWarnings(string strFor)
3033 string strStatusBar;
3036 if (GetBoolArg("-testsafemode"))
3039 // Misc warnings like out of disk space and clock is wrong
3040 if (strMiscWarning != "")
3043 strStatusBar = strMiscWarning;
3046 // if detected unmet upgrade requirement enter safe mode
3047 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3048 if (IsFixedModifierInterval(nModifierUpgradeTime + nOneDay)) // 1 day margin
3051 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3054 // if detected invalid checkpoint enter safe mode
3055 if (Checkpoints::hashInvalidCheckpoint != 0)
3058 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3064 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3066 const CAlert& alert = item.second;
3067 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3069 nPriority = alert.nPriority;
3070 strStatusBar = alert.strStatusBar;
3071 if (nPriority > 1000)
3072 strRPC = strStatusBar;
3077 if (strFor == "statusbar")
3078 return strStatusBar;
3079 else if (strFor == "rpc")
3081 assert(!"GetWarnings() : invalid parameter");
3092 //////////////////////////////////////////////////////////////////////////////
3098 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3104 bool txInMap = false;
3107 txInMap = (mempool.exists(inv.hash));
3110 mapOrphanTransactions.count(inv.hash) ||
3111 txdb.ContainsTx(inv.hash);
3115 return mapBlockIndex.count(inv.hash) ||
3116 mapOrphanBlocks.count(inv.hash);
3118 // Don't know what it is, just say we already got one
3125 // The message start string is designed to be unlikely to occur in normal data.
3126 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3127 // a large 4-byte int at any alignment.
3128 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3130 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3132 static map<CService, CPubKey> mapReuseKey;
3133 RandAddSeedPerfmon();
3135 printf("received: %s (%" PRIszu " bytes)\n", strCommand.c_str(), vRecv.size());
3136 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3138 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3142 if (strCommand == "version")
3144 // Each connection can only send one version message
3145 if (pfrom->nVersion != 0)
3147 pfrom->Misbehaving(1);
3154 uint64_t nNonce = 1;
3155 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3156 if (pfrom->nVersion < MIN_PROTO_VERSION)
3158 // Since February 20, 2012, the protocol is initiated at version 209,
3159 // and earlier versions are no longer supported
3160 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3161 pfrom->fDisconnect = true;
3165 if (pfrom->nVersion == 10300)
3166 pfrom->nVersion = 300;
3168 vRecv >> addrFrom >> nNonce;
3170 vRecv >> pfrom->strSubVer;
3172 vRecv >> pfrom->nStartingHeight;
3174 if (pfrom->fInbound && addrMe.IsRoutable())
3176 pfrom->addrLocal = addrMe;
3180 // Disconnect if we connected to ourself
3181 if (nNonce == nLocalHostNonce && nNonce > 1)
3183 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3184 pfrom->fDisconnect = true;
3188 if (pfrom->nVersion < 60010)
3190 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3191 pfrom->fDisconnect = true;
3195 // record my external IP reported by peer
3196 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3197 addrSeenByPeer = addrMe;
3199 // Be shy and don't send version until we hear
3200 if (pfrom->fInbound)
3201 pfrom->PushVersion();
3203 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3205 AddTimeData(pfrom->addr, nTime);
3208 pfrom->PushMessage("verack");
3209 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3211 if (!pfrom->fInbound)
3213 // Advertise our address
3214 if (!fNoListen && !IsInitialBlockDownload())
3216 CAddress addr = GetLocalAddress(&pfrom->addr);
3217 if (addr.IsRoutable())
3218 pfrom->PushAddress(addr);
3221 // Get recent addresses
3222 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3224 pfrom->PushMessage("getaddr");
3225 pfrom->fGetAddr = true;
3227 addrman.Good(pfrom->addr);
3229 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3231 addrman.Add(addrFrom, addrFrom);
3232 addrman.Good(addrFrom);
3236 // Ask the first connected node for block updates
3237 static int nAskedForBlocks = 0;
3238 if (!pfrom->fClient && !pfrom->fOneShot &&
3239 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3240 (pfrom->nVersion < NOBLKS_VERSION_START ||
3241 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3242 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3245 pfrom->PushGetBlocks(pindexBest, uint256(0));
3251 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3252 item.second.RelayTo(pfrom);
3255 // Relay sync-checkpoint
3257 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3258 if (!Checkpoints::checkpointMessage.IsNull())
3259 Checkpoints::checkpointMessage.RelayTo(pfrom);
3262 pfrom->fSuccessfullyConnected = true;
3264 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());
3266 cPeerBlockCounts.input(pfrom->nStartingHeight);
3268 // ppcoin: ask for pending sync-checkpoint if any
3269 if (!IsInitialBlockDownload())
3270 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3274 else if (pfrom->nVersion == 0)
3276 // Must have a version message before anything else
3277 pfrom->Misbehaving(1);
3282 else if (strCommand == "verack")
3284 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3288 else if (strCommand == "addr")
3290 vector<CAddress> vAddr;
3293 // Don't want addr from older versions unless seeding
3294 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3296 if (vAddr.size() > 1000)
3298 pfrom->Misbehaving(20);
3299 return error("message addr size() = %" PRIszu "", vAddr.size());
3302 // Store the new addresses
3303 vector<CAddress> vAddrOk;
3304 int64_t nNow = GetAdjustedTime();
3305 int64_t nSince = nNow - 10 * 60;
3306 BOOST_FOREACH(CAddress& addr, vAddr)
3310 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3311 addr.nTime = nNow - 5 * nOneDay;
3312 pfrom->AddAddressKnown(addr);
3313 bool fReachable = IsReachable(addr);
3314 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3316 // Relay to a limited number of other nodes
3319 // Use deterministic randomness to send to the same nodes for 24 hours
3320 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3321 static uint256 hashSalt;
3323 hashSalt = GetRandHash();
3324 uint64_t hashAddr = addr.GetHash();
3325 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/nOneDay);
3326 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3327 multimap<uint256, CNode*> mapMix;
3328 BOOST_FOREACH(CNode* pnode, vNodes)
3330 if (pnode->nVersion < CADDR_TIME_VERSION)
3332 unsigned int nPointer;
3333 memcpy(&nPointer, &pnode, sizeof(nPointer));
3334 uint256 hashKey = hashRand ^ nPointer;
3335 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3336 mapMix.insert(make_pair(hashKey, pnode));
3338 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3339 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3340 ((*mi).second)->PushAddress(addr);
3343 // Do not store addresses outside our network
3345 vAddrOk.push_back(addr);
3347 addrman.Add(vAddrOk, pfrom->addr, 2 * nOneHour);
3348 if (vAddr.size() < 1000)
3349 pfrom->fGetAddr = false;
3350 if (pfrom->fOneShot)
3351 pfrom->fDisconnect = true;
3354 else if (strCommand == "inv")
3358 if (vInv.size() > MAX_INV_SZ)
3360 pfrom->Misbehaving(20);
3361 return error("message inv size() = %" PRIszu "", vInv.size());
3364 // find last block in inv vector
3365 size_t nLastBlock = std::numeric_limits<size_t>::max();
3366 for (size_t nInv = 0; nInv < vInv.size(); nInv++) {
3367 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3368 nLastBlock = vInv.size() - 1 - nInv;
3373 for (size_t nInv = 0; nInv < vInv.size(); nInv++)
3375 const CInv &inv = vInv[nInv];
3379 pfrom->AddInventoryKnown(inv);
3381 bool fAlreadyHave = AlreadyHave(txdb, inv);
3383 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3387 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3388 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3389 } else if (nInv == nLastBlock) {
3390 // In case we are on a very long side-chain, it is possible that we already have
3391 // the last block in an inv bundle sent in response to getblocks. Try to detect
3392 // this situation and push another getblocks to continue.
3393 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3395 printf("force request: %s\n", inv.ToString().c_str());
3398 // Track requests for our stuff
3399 Inventory(inv.hash);
3404 else if (strCommand == "getdata")
3408 if (vInv.size() > MAX_INV_SZ)
3410 pfrom->Misbehaving(20);
3411 return error("message getdata size() = %" PRIszu "", vInv.size());
3414 if (fDebugNet || (vInv.size() != 1))
3415 printf("received getdata (%" PRIszu " invsz)\n", vInv.size());
3417 BOOST_FOREACH(const CInv& inv, vInv)
3421 if (fDebugNet || (vInv.size() == 1))
3422 printf("received getdata for: %s\n", inv.ToString().c_str());
3424 if (inv.type == MSG_BLOCK)
3426 // Send block from disk
3427 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3428 if (mi != mapBlockIndex.end())
3431 block.ReadFromDisk((*mi).second);
3432 pfrom->PushMessage("block", block);
3434 // Trigger them to send a getblocks request for the next batch of inventory
3435 if (inv.hash == pfrom->hashContinue)
3437 // ppcoin: send latest proof-of-work block to allow the
3438 // download node to accept as orphan (proof-of-stake
3439 // block might be rejected by stake connection check)
3441 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3442 pfrom->PushMessage("inv", vInv);
3443 pfrom->hashContinue = 0;
3447 else if (inv.IsKnownType())
3449 // Send stream from relay memory
3450 bool pushed = false;
3453 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3454 if (mi != mapRelay.end()) {
3455 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3459 if (!pushed && inv.type == MSG_TX) {
3461 if (mempool.exists(inv.hash)) {
3462 CTransaction tx = mempool.lookup(inv.hash);
3463 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3466 pfrom->PushMessage("tx", ss);
3471 // Track requests for our stuff
3472 Inventory(inv.hash);
3477 else if (strCommand == "getblocks")
3479 CBlockLocator locator;
3481 vRecv >> locator >> hashStop;
3483 // Find the last block the caller has in the main chain
3484 CBlockIndex* pindex = locator.GetBlockIndex();
3486 // Send the rest of the chain
3488 pindex = pindex->pnext;
3490 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3491 for (; pindex; pindex = pindex->pnext)
3493 if (pindex->GetBlockHash() == hashStop)
3495 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3496 // ppcoin: tell downloading node about the latest block if it's
3497 // without risk being rejected due to stake connection check
3498 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3499 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3502 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3505 // When this block is requested, we'll send an inv that'll make them
3506 // getblocks the next batch of inventory.
3507 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3508 pfrom->hashContinue = pindex->GetBlockHash();
3513 else if (strCommand == "checkpoint")
3515 CSyncCheckpoint checkpoint;
3516 vRecv >> checkpoint;
3518 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3521 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3523 BOOST_FOREACH(CNode* pnode, vNodes)
3524 checkpoint.RelayTo(pnode);
3528 else if (strCommand == "getheaders")
3530 CBlockLocator locator;
3532 vRecv >> locator >> hashStop;
3534 CBlockIndex* pindex = NULL;
3535 if (locator.IsNull())
3537 // If locator is null, return the hashStop block
3538 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3539 if (mi == mapBlockIndex.end())
3541 pindex = (*mi).second;
3545 // Find the last block the caller has in the main chain
3546 pindex = locator.GetBlockIndex();
3548 pindex = pindex->pnext;
3551 vector<CBlock> vHeaders;
3553 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3554 for (; pindex; pindex = pindex->pnext)
3556 vHeaders.push_back(pindex->GetBlockHeader());
3557 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3560 pfrom->PushMessage("headers", vHeaders);
3564 else if (strCommand == "tx")
3566 vector<uint256> vWorkQueue;
3567 vector<uint256> vEraseQueue;
3568 CDataStream vMsg(vRecv);
3573 CInv inv(MSG_TX, tx.GetHash());
3574 pfrom->AddInventoryKnown(inv);
3576 bool fMissingInputs = false;
3577 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3579 SyncWithWallets(tx, NULL, true);
3580 RelayTransaction(tx, inv.hash);
3581 mapAlreadyAskedFor.erase(inv);
3582 vWorkQueue.push_back(inv.hash);
3583 vEraseQueue.push_back(inv.hash);
3585 // Recursively process any orphan transactions that depended on this one
3586 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3588 uint256 hashPrev = vWorkQueue[i];
3589 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3590 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3593 const uint256& orphanTxHash = *mi;
3594 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3595 bool fMissingInputs2 = false;
3597 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3599 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3600 SyncWithWallets(tx, NULL, true);
3601 RelayTransaction(orphanTx, orphanTxHash);
3602 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3603 vWorkQueue.push_back(orphanTxHash);
3604 vEraseQueue.push_back(orphanTxHash);
3606 else if (!fMissingInputs2)
3609 vEraseQueue.push_back(orphanTxHash);
3610 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3615 BOOST_FOREACH(uint256 hash, vEraseQueue)
3616 EraseOrphanTx(hash);
3618 else if (fMissingInputs)
3622 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3623 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3625 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3627 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3631 else if (strCommand == "block")
3635 uint256 hashBlock = block.GetHash();
3637 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3640 CInv inv(MSG_BLOCK, hashBlock);
3641 pfrom->AddInventoryKnown(inv);
3643 if (ProcessBlock(pfrom, &block))
3644 mapAlreadyAskedFor.erase(inv);
3645 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3649 // This asymmetric behavior for inbound and outbound connections was introduced
3650 // to prevent a fingerprinting attack: an attacker can send specific fake addresses
3651 // to users' AddrMan and later request them by sending getaddr messages.
3652 // Making users (which are behind NAT and can only make outgoing connections) ignore
3653 // getaddr message mitigates the attack.
3654 else if ((strCommand == "getaddr") && (pfrom->fInbound))
3656 // Don't return addresses older than nCutOff timestamp
3657 int64_t nCutOff = GetTime() - (nNodeLifespan * nOneDay);
3658 pfrom->vAddrToSend.clear();
3659 vector<CAddress> vAddr = addrman.GetAddr();
3660 BOOST_FOREACH(const CAddress &addr, vAddr)
3661 if(addr.nTime > nCutOff)
3662 pfrom->PushAddress(addr);
3666 else if (strCommand == "mempool")
3668 std::vector<uint256> vtxid;
3669 mempool.queryHashes(vtxid);
3671 for (unsigned int i = 0; i < vtxid.size(); i++) {
3672 CInv inv(MSG_TX, vtxid[i]);
3673 vInv.push_back(inv);
3674 if (i == (MAX_INV_SZ - 1))
3677 if (vInv.size() > 0)
3678 pfrom->PushMessage("inv", vInv);
3682 else if (strCommand == "checkorder")
3687 if (!GetBoolArg("-allowreceivebyip"))
3689 pfrom->PushMessage("reply", hashReply, 2, string(""));
3696 /// we have a chance to check the order here
3698 // Keep giving the same key to the same ip until they use it
3699 if (!mapReuseKey.count(pfrom->addr))
3700 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3702 // Send back approval of order and pubkey to use
3703 CScript scriptPubKey;
3704 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3705 pfrom->PushMessage("reply", hashReply, 0, scriptPubKey);
3709 else if (strCommand == "reply")
3714 CRequestTracker tracker;
3716 LOCK(pfrom->cs_mapRequests);
3717 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3718 if (mi != pfrom->mapRequests.end())
3720 tracker = (*mi).second;
3721 pfrom->mapRequests.erase(mi);
3724 if (!tracker.IsNull())
3725 tracker.fn(tracker.param1, vRecv);
3729 else if (strCommand == "ping")
3733 // Echo the message back with the nonce. This allows for two useful features:
3735 // 1) A remote node can quickly check if the connection is operational
3736 // 2) Remote nodes can measure the latency of the network thread. If this node
3737 // is overloaded it won't respond to pings quickly and the remote node can
3738 // avoid sending us more work, like chain download requests.
3740 // The nonce stops the remote getting confused between different pings: without
3741 // it, if the remote node sends a ping once per second and this node takes 5
3742 // seconds to respond to each, the 5th ping the remote sends would appear to
3743 // return very quickly.
3744 pfrom->PushMessage("pong", nonce);
3748 else if (strCommand == "alert")
3753 uint256 alertHash = alert.GetHash();
3754 if (pfrom->setKnown.count(alertHash) == 0)
3756 if (alert.ProcessAlert())
3759 pfrom->setKnown.insert(alertHash);
3762 BOOST_FOREACH(CNode* pnode, vNodes)
3763 alert.RelayTo(pnode);
3767 // Small DoS penalty so peers that send us lots of
3768 // duplicate/expired/invalid-signature/whatever alerts
3769 // eventually get banned.
3770 // This isn't a Misbehaving(100) (immediate ban) because the
3771 // peer might be an older or different implementation with
3772 // a different signature key, etc.
3773 pfrom->Misbehaving(10);
3781 // Ignore unknown commands for extensibility
3785 // Update the last seen time for this node's address
3786 if (pfrom->fNetworkNode)
3787 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3788 AddressCurrentlyConnected(pfrom->addr);
3794 bool ProcessMessages(CNode* pfrom)
3796 CDataStream& vRecv = pfrom->vRecv;
3800 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3804 // (4) message start
3813 // Don't bother if send buffer is too full to respond anyway
3814 if (pfrom->vSend.size() >= SendBufferSize())
3817 // Scan for message start
3818 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3819 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3820 if (vRecv.end() - pstart < nHeaderSize)
3822 if ((int)vRecv.size() > nHeaderSize)
3824 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3825 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3829 if (pstart - vRecv.begin() > 0)
3830 printf("\n\nPROCESSMESSAGE SKIPPED %" PRIpdd " BYTES\n\n", pstart - vRecv.begin());
3831 vRecv.erase(vRecv.begin(), pstart);
3834 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3839 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3842 string strCommand = hdr.GetCommand();
3845 unsigned int nMessageSize = hdr.nMessageSize;
3846 if (nMessageSize > MAX_SIZE)
3848 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3851 if (nMessageSize > vRecv.size())
3853 // Rewind and wait for rest of message
3854 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3859 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3860 unsigned int nChecksum = 0;
3861 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3862 if (nChecksum != hdr.nChecksum)
3864 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3865 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3869 // Copy message to its own buffer
3870 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3871 vRecv.ignore(nMessageSize);
3879 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3884 catch (std::ios_base::failure& e)
3886 if (strstr(e.what(), "end of data"))
3888 // Allow exceptions from under-length message on vRecv
3889 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());
3891 else if (strstr(e.what(), "size too large"))
3893 // Allow exceptions from over-long size
3894 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3898 PrintExceptionContinue(&e, "ProcessMessages()");
3901 catch (std::exception& e) {
3902 PrintExceptionContinue(&e, "ProcessMessages()");
3904 PrintExceptionContinue(NULL, "ProcessMessages()");
3908 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3916 bool SendMessages(CNode* pto, bool fSendTrickle)
3918 TRY_LOCK(cs_main, lockMain);
3920 // Don't send anything until we get their version message
3921 if (pto->nVersion == 0)
3924 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3926 if (pto->nLastSend && GetTime() - pto->nLastSend > nPingInterval && pto->vSend.empty()) {
3928 pto->PushMessage("ping", nonce);
3932 if (pto->fStartSync) {
3933 pto->fStartSync = false;
3934 pto->PushGetBlocks(pindexBest, uint256(0));
3937 // Resend wallet transactions that haven't gotten in a block yet
3938 ResendWalletTransactions();
3940 // Address refresh broadcast
3941 static int64_t nLastRebroadcast;
3942 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > nBroadcastInterval))
3946 BOOST_FOREACH(CNode* pnode, vNodes)
3948 // Periodically clear setAddrKnown to allow refresh broadcasts
3949 if (nLastRebroadcast)
3950 pnode->setAddrKnown.clear();
3952 // Rebroadcast our address
3955 CAddress addr = GetLocalAddress(&pnode->addr);
3956 if (addr.IsRoutable())
3957 pnode->PushAddress(addr);
3961 nLastRebroadcast = GetTime();
3969 vector<CAddress> vAddr;
3970 vAddr.reserve(pto->vAddrToSend.size());
3971 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3973 // returns true if wasn't already contained in the set
3974 if (pto->setAddrKnown.insert(addr).second)
3976 vAddr.push_back(addr);
3977 // receiver rejects addr messages larger than 1000
3978 if (vAddr.size() >= 1000)
3980 pto->PushMessage("addr", vAddr);
3985 pto->vAddrToSend.clear();
3987 pto->PushMessage("addr", vAddr);
3992 // Message: inventory
3995 vector<CInv> vInvWait;
3997 LOCK(pto->cs_inventory);
3998 vInv.reserve(pto->vInventoryToSend.size());
3999 vInvWait.reserve(pto->vInventoryToSend.size());
4000 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4002 if (pto->setInventoryKnown.count(inv))
4005 // trickle out tx inv to protect privacy
4006 if (inv.type == MSG_TX && !fSendTrickle)
4008 // 1/4 of tx invs blast to all immediately
4009 static uint256 hashSalt;
4011 hashSalt = GetRandHash();
4012 uint256 hashRand = inv.hash ^ hashSalt;
4013 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4014 bool fTrickleWait = ((hashRand & 3) != 0);
4016 // always trickle our own transactions
4020 if (GetTransaction(inv.hash, wtx))
4022 fTrickleWait = true;
4027 vInvWait.push_back(inv);
4032 // returns true if wasn't already contained in the set
4033 if (pto->setInventoryKnown.insert(inv).second)
4035 vInv.push_back(inv);
4036 if (vInv.size() >= 1000)
4038 pto->PushMessage("inv", vInv);
4043 pto->vInventoryToSend = vInvWait;
4046 pto->PushMessage("inv", vInv);
4052 vector<CInv> vGetData;
4053 int64_t nNow = GetTime() * 1000000;
4055 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4057 const CInv& inv = (*pto->mapAskFor.begin()).second;
4058 if (!AlreadyHave(txdb, inv))
4061 printf("sending getdata: %s\n", inv.ToString().c_str());
4062 vGetData.push_back(inv);
4063 if (vGetData.size() >= 1000)
4065 pto->PushMessage("getdata", vGetData);
4068 mapAlreadyAskedFor[inv] = nNow;
4070 pto->mapAskFor.erase(pto->mapAskFor.begin());
4072 if (!vGetData.empty())
4073 pto->PushMessage("getdata", vGetData);
4086 std::map<uint256, CBlockIndex*>::iterator it1 = mapBlockIndex.begin();
4087 for (; it1 != mapBlockIndex.end(); it1++)
4088 delete (*it1).second;
4089 mapBlockIndex.clear();
4092 std::map<uint256, CBlock*>::iterator it2 = mapOrphanBlocks.begin();
4093 for (; it2 != mapOrphanBlocks.end(); it2++)
4094 delete (*it2).second;
4095 mapOrphanBlocks.clear();
4097 // orphan transactions
4099 } instance_of_cmaincleanup;