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"
13 #include "zerocoin/Zerocoin.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
20 using namespace boost;
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
32 unsigned int nTransactionsUpdated = 0;
34 map<uint256, CBlockIndex*> mapBlockIndex;
35 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 libzerocoin::Params* ZCParams;
38 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
39 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
40 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
41 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
42 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
44 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
46 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
47 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
48 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
49 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
51 int nCoinbaseMaturity = 500;
52 CBlockIndex* pindexGenesisBlock = NULL;
55 uint256 nBestChainTrust = 0;
56 uint256 nBestInvalidTrust = 0;
58 uint256 hashBestChain = 0;
59 CBlockIndex* pindexBest = NULL;
60 int64 nTimeBestReceived = 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 nTransactionFee = MIN_TX_FEE;
79 int64 nMinimumInputValue = MIN_TX_FEE;
81 extern enum Checkpoints::CPMode CheckpointsMode;
83 //////////////////////////////////////////////////////////////////////////////
85 // dispatching functions
88 // These functions dispatch to one or all registered wallets
91 void RegisterWallet(CWallet* pwalletIn)
94 LOCK(cs_setpwalletRegistered);
95 setpwalletRegistered.insert(pwalletIn);
99 void UnregisterWallet(CWallet* pwalletIn)
102 LOCK(cs_setpwalletRegistered);
103 setpwalletRegistered.erase(pwalletIn);
107 // check whether the passed transaction is from us
108 bool static IsFromMe(CTransaction& tx)
110 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
111 if (pwallet->IsFromMe(tx))
116 // get the wallet transaction with the given hash (if it exists)
117 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
119 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
120 if (pwallet->GetTransaction(hashTx,wtx))
125 // erases transaction with the given hash from all wallets
126 void static EraseFromWallets(uint256 hash)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->EraseFromWallet(hash);
132 // make sure all wallets know about the given transaction, in the given block
133 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
137 // ppcoin: wallets need to refund inputs when disconnecting coinstake
138 if (tx.IsCoinStake())
140 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
141 if (pwallet->IsFromMe(tx))
142 pwallet->DisableTransaction(tx);
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
151 // notify wallets about a new best chain
152 void static SetBestChain(const CBlockLocator& loc)
154 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
155 pwallet->SetBestChain(loc);
158 // notify wallets about an updated transaction
159 void static UpdatedTransaction(const uint256& hashTx)
161 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
162 pwallet->UpdatedTransaction(hashTx);
166 void static PrintWallets(const CBlock& block)
168 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
169 pwallet->PrintWallet(block);
172 // notify wallets about an incoming inventory (for request counts)
173 void static Inventory(const uint256& hash)
175 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
176 pwallet->Inventory(hash);
179 // ask wallets to resend their transactions
180 void ResendWalletTransactions()
182 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
183 pwallet->ResendWalletTransactions();
187 //////////////////////////////////////////////////////////////////////////////
189 // CCoinsView implementations
192 bool CCoinsView::GetCoins(uint256 txid, CCoins &coins) { return false; }
193 bool CCoinsView::SetCoins(uint256 txid, const CCoins &coins) { return false; }
194 bool CCoinsView::HaveCoins(uint256 txid) { return false; }
195 CBlockIndex *CCoinsView::GetBestBlock() { return NULL; }
196 bool CCoinsView::SetBestBlock(CBlockIndex *pindex) { return false; }
197 bool CCoinsView::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) { return false; }
199 CCoinsViewBacked::CCoinsViewBacked(CCoinsView &viewIn) : base(&viewIn) { }
200 bool CCoinsViewBacked::GetCoins(uint256 txid, CCoins &coins) { return base->GetCoins(txid, coins); }
201 bool CCoinsViewBacked::SetCoins(uint256 txid, const CCoins &coins) { return base->SetCoins(txid, coins); }
202 bool CCoinsViewBacked::HaveCoins(uint256 txid) { return base->HaveCoins(txid); }
203 CBlockIndex *CCoinsViewBacked::GetBestBlock() { return base->GetBestBlock(); }
204 bool CCoinsViewBacked::SetBestBlock(CBlockIndex *pindex) { return base->SetBestBlock(pindex); }
205 void CCoinsViewBacked::SetBackend(CCoinsView &viewIn) { base = &viewIn; }
207 bool CCoinsViewBacked::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) { return base->BatchWrite(mapCoins, pindex); }
209 CCoinsViewCache::CCoinsViewCache(CCoinsView &baseIn, bool fDummy) : CCoinsViewBacked(baseIn), pindexTip(NULL) { }
211 bool CCoinsViewCache::GetCoins(uint256 txid, CCoins &coins) {
212 if (cacheCoins.count(txid)) {
213 coins = cacheCoins[txid];
216 if (base->GetCoins(txid, coins)) {
217 cacheCoins[txid] = coins;
223 bool CCoinsViewCache::SetCoins(uint256 txid, const CCoins &coins) {
224 cacheCoins[txid] = coins;
228 bool CCoinsViewCache::HaveCoins(uint256 txid) {
229 return cacheCoins.count(txid) || base->HaveCoins(txid);
232 CBlockIndex *CCoinsViewCache::GetBestBlock() {
233 if (pindexTip == NULL)
234 pindexTip = base->GetBestBlock();
238 bool CCoinsViewCache::SetBestBlock(CBlockIndex *pindex) {
243 bool CCoinsViewCache::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) {
244 for (std::map<uint256, CCoins>::const_iterator it = mapCoins.begin(); it != mapCoins.end(); it++)
245 cacheCoins[it->first] = it->second;
250 bool CCoinsViewCache::Flush() {
251 bool fOk = base->BatchWrite(cacheCoins, pindexTip);
257 unsigned int CCoinsViewCache::GetCacheSize() {
258 return cacheCoins.size();
261 /** CCoinsView that brings transactions from a memorypool into view.
262 It does not check for spendings by memory pool transactions. */
263 CCoinsViewMemPool::CCoinsViewMemPool(CCoinsView &baseIn, CTxMemPool &mempoolIn) : CCoinsViewBacked(baseIn), mempool(mempoolIn) { }
265 bool CCoinsViewMemPool::GetCoins(uint256 txid, CCoins &coins) {
266 if (base->GetCoins(txid, coins))
268 if (mempool.exists(txid)) {
269 const CTransaction &tx = mempool.lookup(txid);
270 coins = CCoins(tx, MEMPOOL_HEIGHT, -1);
276 bool CCoinsViewMemPool::HaveCoins(uint256 txid) {
277 return mempool.exists(txid) || base->HaveCoins(txid);
280 CCoinsViewCache *pcoinsTip = NULL;
282 //////////////////////////////////////////////////////////////////////////////
284 // mapOrphanTransactions
287 bool AddOrphanTx(const CTransaction& tx)
289 uint256 hash = tx.GetHash();
290 if (mapOrphanTransactions.count(hash))
293 // Ignore big transactions, to avoid a
294 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
295 // large transaction with a missing parent then we assume
296 // it will rebroadcast it later, after the parent transaction(s)
297 // have been mined or received.
298 // 10,000 orphans, each of which is at most 5,000 bytes big is
299 // at most 500 megabytes of orphans:
301 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
305 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
309 mapOrphanTransactions[hash] = tx;
310 BOOST_FOREACH(const CTxIn& txin, tx.vin)
311 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
313 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
314 mapOrphanTransactions.size());
318 void static EraseOrphanTx(uint256 hash)
320 if (!mapOrphanTransactions.count(hash))
322 const CTransaction& tx = mapOrphanTransactions[hash];
323 BOOST_FOREACH(const CTxIn& txin, tx.vin)
325 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
326 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
327 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
329 mapOrphanTransactions.erase(hash);
332 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
334 unsigned int nEvicted = 0;
335 while (mapOrphanTransactions.size() > nMaxOrphans)
337 // Evict a random orphan:
338 uint256 randomhash = GetRandHash();
339 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
340 if (it == mapOrphanTransactions.end())
341 it = mapOrphanTransactions.begin();
342 EraseOrphanTx(it->first);
354 //////////////////////////////////////////////////////////////////////////////
359 bool CTransaction::IsStandard() const
361 if (nVersion > CTransaction::CURRENT_VERSION)
364 BOOST_FOREACH(const CTxIn& txin, vin)
366 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
367 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
368 // ~65-byte public keys, plus a few script ops.
369 if (txin.scriptSig.size() > 500)
371 if (!txin.scriptSig.IsPushOnly())
374 BOOST_FOREACH(const CTxOut& txout, vout) {
375 if (!::IsStandard(txout.scriptPubKey))
377 if (txout.nValue == 0)
384 // Check transaction inputs, and make sure any
385 // pay-to-script-hash transactions are evaluating IsStandard scripts
387 // Why bother? To avoid denial-of-service attacks; an attacker
388 // can submit a standard HASH... OP_EQUAL transaction,
389 // which will get accepted into blocks. The redemption
390 // script can be anything; an attacker could use a very
391 // expensive-to-check-upon-redemption script like:
392 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
394 bool CTransaction::AreInputsStandard(CCoinsView& mapInputs) const
397 return true; // Coinbases don't use vin normally
399 for (unsigned int i = 0; i < vin.size(); i++)
401 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
403 vector<vector<unsigned char> > vSolutions;
404 txnouttype whichType;
405 // get the scriptPubKey corresponding to this input:
406 const CScript& prevScript = prev.scriptPubKey;
407 if (!Solver(prevScript, whichType, vSolutions))
409 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
410 if (nArgsExpected < 0)
413 // Transactions with extra stuff in their scriptSigs are
414 // non-standard. Note that this EvalScript() call will
415 // be quick, because if there are any operations
416 // beside "push data" in the scriptSig the
417 // IsStandard() call returns false
418 vector<vector<unsigned char> > stack;
419 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
422 if (whichType == TX_SCRIPTHASH)
426 CScript subscript(stack.back().begin(), stack.back().end());
427 vector<vector<unsigned char> > vSolutions2;
428 txnouttype whichType2;
429 if (!Solver(subscript, whichType2, vSolutions2))
431 if (whichType2 == TX_SCRIPTHASH)
435 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
438 nArgsExpected += tmpExpected;
441 if (stack.size() != (unsigned int)nArgsExpected)
449 CTransaction::GetLegacySigOpCount() const
451 unsigned int nSigOps = 0;
452 BOOST_FOREACH(const CTxIn& txin, vin)
454 nSigOps += txin.scriptSig.GetSigOpCount(false);
456 BOOST_FOREACH(const CTxOut& txout, vout)
458 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
464 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
474 if (pblock == NULL) {
476 if (pcoinsTip->GetCoins(GetHash(), coins)) {
477 CBlockIndex *pindex = FindBlockByHeight(coins.nHeight);
479 if (!blockTmp.ReadFromDisk(pindex))
487 // Update the tx's hashBlock
488 hashBlock = pblock->GetHash();
490 // Locate the transaction
491 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
492 if (pblock->vtx[nIndex] == *(CTransaction*)this)
494 if (nIndex == (int)pblock->vtx.size())
496 vMerkleBranch.clear();
498 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
502 // Fill in merkle branch
503 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
507 // Is the tx in a block that's in the main chain
508 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
509 if (mi == mapBlockIndex.end())
511 CBlockIndex* pindex = (*mi).second;
512 if (!pindex || !pindex->IsInMainChain())
515 return pindexBest->nHeight - pindex->nHeight + 1;
518 bool CTransaction::CheckTransaction() const
520 // Basic checks that don't depend on any context
522 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
524 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
526 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
527 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
529 // Check for negative or overflow output values
531 for (unsigned int i = 0; i < vout.size(); i++)
533 const CTxOut& txout = vout[i];
534 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
535 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
537 // Enforce minimum output amount for user transactions until 1 May 2014 04:00:00 GMT
538 if (!fTestNet && !IsCoinBase() && !txout.IsEmpty() && nTime < OUTPUT_SWITCH_TIME && txout.nValue < MIN_TXOUT_AMOUNT)
539 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
541 if (txout.nValue > MAX_MONEY)
542 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
543 nValueOut += txout.nValue;
544 if (!MoneyRange(nValueOut))
545 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
548 // Check for duplicate inputs
549 set<COutPoint> vInOutPoints;
550 BOOST_FOREACH(const CTxIn& txin, vin)
552 if (vInOutPoints.count(txin.prevout))
554 vInOutPoints.insert(txin.prevout);
559 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
560 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
564 BOOST_FOREACH(const CTxIn& txin, vin)
565 if (txin.prevout.IsNull())
566 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
572 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
573 enum GetMinFee_mode mode, unsigned int nBytes) const
575 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
576 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
578 unsigned int nNewBlockSize = nBlockSize + nBytes;
579 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
581 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
582 if (nMinFee < nBaseFee)
584 BOOST_FOREACH(const CTxOut& txout, vout)
585 if (txout.nValue < CENT)
589 // Raise the price as the block approaches full
590 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
592 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
594 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
597 if (!MoneyRange(nMinFee))
602 void CTxMemPool::pruneSpent(const uint256 &hashTx, CCoins &coins)
606 std::map<COutPoint, CInPoint>::iterator it = mapNextTx.lower_bound(COutPoint(hashTx, 0));
608 // iterate over all COutPoints in mapNextTx whose hash equals the provided hashTx
609 while (it != mapNextTx.end() && it->first.hash == hashTx) {
610 coins.Spend(it->first.n); // and remove those outputs from coins
615 bool CTxMemPool::accept(CTransaction &tx, bool fCheckInputs, bool* pfMissingInputs)
618 *pfMissingInputs = false;
620 if (!tx.CheckTransaction())
621 return error("CTxMemPool::accept() : CheckTransaction failed");
623 // Coinbase is only valid in a block, not as a loose transaction
625 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
627 // Coinstake is also only valid in a block, not as a loose transaction
628 if (tx.IsCoinStake())
629 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
631 // To help v0.1.5 clients who would see it as a negative number
632 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
633 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
635 // Rather not work on nonstandard transactions (unless -testnet)
636 if (!fTestNet && !tx.IsStandard())
637 return error("CTxMemPool::accept() : nonstandard transaction type");
639 // is it already in the memory pool?
640 uint256 hash = tx.GetHash();
643 if (mapTx.count(hash))
647 // Check for conflicts with in-memory transactions
648 CTransaction* ptxOld = NULL;
649 for (unsigned int i = 0; i < tx.vin.size(); i++)
651 COutPoint outpoint = tx.vin[i].prevout;
652 if (mapNextTx.count(outpoint))
654 // Disable replacement feature for now
657 // Allow replacing with a newer version of the same transaction
660 ptxOld = mapNextTx[outpoint].ptx;
661 if (ptxOld->IsFinal())
663 if (!tx.IsNewerThan(*ptxOld))
665 for (unsigned int i = 0; i < tx.vin.size(); i++)
667 COutPoint outpoint = tx.vin[i].prevout;
668 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
677 CCoinsViewCache &view = *pcoinsTip;
679 // do we already have it?
680 if (view.HaveCoins(hash))
683 // do all inputs exist?
684 BOOST_FOREACH(const CTxIn txin, tx.vin) {
685 if (!view.HaveCoins(txin.prevout.hash)) {
687 *pfMissingInputs = true;
692 // Check for non-standard pay-to-script-hash in inputs
693 if (!tx.AreInputsStandard(view) && !fTestNet)
694 return error("CTxMemPool::accept() : nonstandard transaction input");
696 // Note: if you modify this code to accept non-standard transactions, then
697 // you should add code here to check that the transaction does a
698 // reasonable number of ECDSA signature verifications.
700 int64 nFees = tx.GetValueIn(view)-tx.GetValueOut();
701 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
703 // Don't accept it if it can't get into a block
704 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY, nSize);
705 if (nFees < txMinFee)
706 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
707 hash.ToString().c_str(),
711 // Continuously rate-limit free transactions
712 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
713 // be annoying or make others' transactions take longer to confirm.
714 if (nFees < MIN_RELAY_TX_FEE)
716 static CCriticalSection cs;
717 static double dFreeCount;
718 static int64 nLastTime;
719 int64 nNow = GetTime();
723 // Use an exponentially decaying ~10-minute window:
724 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
726 // -limitfreerelay unit is thousand-bytes-per-minute
727 // At default rate it would take over a month to fill 1GB
728 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
729 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
731 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
736 // Check against previous transactions
737 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
738 if (!tx.CheckInputs(view, CS_ALWAYS, true, false))
740 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
744 // Store transaction in memory
749 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
752 addUnchecked(hash, tx);
755 ///// are we sure this is ok when loading transactions or restoring block txes
756 // If updated, erase old tx from wallet
758 EraseFromWallets(ptxOld->GetHash());
760 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
761 hash.ToString().substr(0,10).c_str(),
766 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
768 return mempool.accept(*this, fCheckInputs, pfMissingInputs);
771 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
773 // Add to memory pool without checking anything. Don't call this directly,
774 // call CTxMemPool::accept to properly check the transaction first.
777 for (unsigned int i = 0; i < tx.vin.size(); i++)
778 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
779 nTransactionsUpdated++;
785 bool CTxMemPool::remove(CTransaction &tx)
787 // Remove transaction from memory pool
790 uint256 hash = tx.GetHash();
791 if (mapTx.count(hash))
793 BOOST_FOREACH(const CTxIn& txin, tx.vin)
794 mapNextTx.erase(txin.prevout);
796 nTransactionsUpdated++;
802 void CTxMemPool::clear()
807 ++nTransactionsUpdated;
810 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
815 vtxid.reserve(mapTx.size());
816 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
817 vtxid.push_back((*mi).first);
823 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
825 if (hashBlock == 0 || nIndex == -1)
828 // Find the block it claims to be in
829 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
830 if (mi == mapBlockIndex.end())
832 CBlockIndex* pindex = (*mi).second;
833 if (!pindex || !pindex->IsInMainChain())
836 // Make sure the merkle branch connects to this block
837 if (!fMerkleVerified)
839 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
841 fMerkleVerified = true;
845 return pindexBest->nHeight - pindex->nHeight + 1;
848 int CMerkleTx::GetBlocksToMaturity() const
850 if (!(IsCoinBase() || IsCoinStake()))
852 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
856 bool CMerkleTx::AcceptToMemoryPool(bool fCheckInputs)
860 if (!IsInMainChain() && !ClientCheckInputs())
862 return CTransaction::AcceptToMemoryPool(false);
866 return CTransaction::AcceptToMemoryPool(fCheckInputs);
870 bool CWalletTx::AcceptWalletTransaction(bool fCheckInputs)
875 // Add previous supporting transactions first
876 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
878 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
880 uint256 hash = tx.GetHash();
881 if (!mempool.exists(hash) && pcoinsTip->HaveCoins(hash))
882 tx.AcceptToMemoryPool(fCheckInputs);
885 return AcceptToMemoryPool(fCheckInputs);
890 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
891 bool GetTransaction(const uint256 &hash, CTransaction &txOut, uint256 &hashBlock, bool fAllowSlow)
893 CBlockIndex *pindexSlow = NULL;
898 if (mempool.exists(hash))
900 txOut = mempool.lookup(hash);
905 if (fAllowSlow) { // use coin database to locate block that contains transaction, and scan it
908 CCoinsViewCache &view = *pcoinsTip;
910 if (view.GetCoins(hash, coins))
911 nHeight = coins.nHeight;
914 pindexSlow = FindBlockByHeight(nHeight);
920 if (block.ReadFromDisk(pindexSlow)) {
921 BOOST_FOREACH(const CTransaction &tx, block.vtx) {
922 if (tx.GetHash() == hash) {
924 hashBlock = pindexSlow->GetBlockHash();
935 //////////////////////////////////////////////////////////////////////////////
937 // CBlock and CBlockIndex
940 static CBlockIndex* pblockindexFBBHLast;
941 CBlockIndex* FindBlockByHeight(int nHeight)
943 CBlockIndex *pblockindex;
944 if (nHeight < nBestHeight / 2)
945 pblockindex = pindexGenesisBlock;
947 pblockindex = pindexBest;
948 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
949 pblockindex = pblockindexFBBHLast;
950 while (pblockindex->nHeight > nHeight)
951 pblockindex = pblockindex->pprev;
952 while (pblockindex->nHeight < nHeight)
953 pblockindex = pblockindex->pnext;
954 pblockindexFBBHLast = pblockindex;
958 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
960 if (!fReadTransactions)
962 *this = pindex->GetBlockHeader();
965 if (!ReadFromDisk(pindex->GetBlockPos(), fReadTransactions))
967 if (GetHash() != pindex->GetBlockHash())
968 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
972 uint256 static GetOrphanRoot(const CBlock* pblock)
974 // Work back to the first block in the orphan chain
975 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
976 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
977 return pblock->GetHash();
980 // ppcoin: find block wanted by given orphan block
981 uint256 WantedByOrphan(const CBlock* pblockOrphan)
983 // Work back to the first block in the orphan chain
984 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
985 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
986 return pblockOrphan->hashPrevBlock;
989 // select stake target limit according to hard-coded conditions
990 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
992 if(fTestNet) // separate proof of stake target limit for testnet
993 return bnProofOfStakeLimit;
994 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
995 return bnProofOfStakeLimit;
996 if(nHeight + 1 > 15000) // 24 bits since block 15000
997 return bnProofOfStakeLegacyLimit;
998 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
999 return bnProofOfStakeHardLimit;
1001 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1004 // miner's coin base reward based on nBits
1005 int64 GetProofOfWorkReward(unsigned int nBits)
1007 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1010 bnTarget.SetCompact(nBits);
1011 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1012 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1014 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1015 // A reasonably continuous curve is used to avoid shock to market
1016 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1018 // Human readable form:
1020 // nSubsidy = 100 / (diff ^ 1/6)
1021 CBigNum bnLowerBound = CENT;
1022 CBigNum bnUpperBound = bnSubsidyLimit;
1023 while (bnLowerBound + CENT <= bnUpperBound)
1025 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1026 if (fDebug && GetBoolArg("-printcreation"))
1027 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1028 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1029 bnUpperBound = bnMidValue;
1031 bnLowerBound = bnMidValue;
1034 int64 nSubsidy = bnUpperBound.getuint64();
1036 nSubsidy = (nSubsidy / CENT) * CENT;
1037 if (fDebug && GetBoolArg("-printcreation"))
1038 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1040 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
1043 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1044 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1046 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1048 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1050 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1052 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1054 bnTarget.SetCompact(nBits);
1055 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1056 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1058 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1060 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1061 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1062 bnMidPart, bnRewardPart;
1064 while (bnLowerBound + CENT <= bnUpperBound)
1066 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1067 if (fDebug && GetBoolArg("-printcreation"))
1068 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1070 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1073 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1075 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1077 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1080 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1081 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1086 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1088 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1090 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1093 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1094 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1097 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1098 bnUpperBound = bnMidValue;
1100 bnLowerBound = bnMidValue;
1103 nRewardCoinYear = bnUpperBound.getuint64();
1104 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1108 // Old creation amount per coin-year, 5% fixed stake mint rate
1109 nRewardCoinYear = 5 * CENT;
1113 return nRewardCoinYear;
1115 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1117 // Set reasonable reward limit for large inputs since 20 Oct 2013
1119 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1120 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1122 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1123 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1125 nSubsidy = min(nSubsidy, nSubsidyLimit);
1128 if (fDebug && GetBoolArg("-printcreation"))
1129 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1133 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1135 // get proof of work blocks max spacing according to hard-coded conditions
1136 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1138 if(nTime > TARGETS_SWITCH_TIME)
1139 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1142 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1144 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1148 // maximum nBits value could possible be required nTime after
1150 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1153 bnResult.SetCompact(nBase);
1155 while (nTime > 0 && bnResult < bnTargetLimit)
1157 // Maximum 200% adjustment per day...
1159 nTime -= 24 * 60 * 60;
1161 if (bnResult > bnTargetLimit)
1162 bnResult = bnTargetLimit;
1163 return bnResult.GetCompact();
1167 // minimum amount of work that could possibly be required nTime after
1168 // minimum proof-of-work required was nBase
1170 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1172 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1176 // minimum amount of stake that could possibly be required nTime after
1177 // minimum proof-of-stake required was nBase
1179 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1181 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1185 // ppcoin: find last block index up to pindex
1186 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1188 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1189 pindex = pindex->pprev;
1193 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1195 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1197 if (pindexLast == NULL)
1198 return bnTargetLimit.GetCompact(); // genesis block
1200 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1201 if (pindexPrev->pprev == NULL)
1202 return bnTargetLimit.GetCompact(); // first block
1203 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1204 if (pindexPrevPrev->pprev == NULL)
1205 return bnTargetLimit.GetCompact(); // second block
1207 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1209 // ppcoin: target change every block
1210 // ppcoin: retarget with exponential moving toward target spacing
1212 bnNew.SetCompact(pindexPrev->nBits);
1213 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1214 int64 nInterval = nTargetTimespan / nTargetSpacing;
1215 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1216 bnNew /= ((nInterval + 1) * nTargetSpacing);
1218 if (bnNew > bnTargetLimit)
1219 bnNew = bnTargetLimit;
1221 return bnNew.GetCompact();
1224 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1227 bnTarget.SetCompact(nBits);
1230 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1231 return error("CheckProofOfWork() : nBits below minimum work");
1233 // Check proof of work matches claimed amount
1234 if (hash > bnTarget.getuint256())
1235 return error("CheckProofOfWork() : hash doesn't match nBits");
1240 // Return maximum amount of blocks that other nodes claim to have
1241 int GetNumBlocksOfPeers()
1243 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1246 bool IsInitialBlockDownload()
1248 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1250 static int64 nLastUpdate;
1251 static CBlockIndex* pindexLastBest;
1252 if (pindexBest != pindexLastBest)
1254 pindexLastBest = pindexBest;
1255 nLastUpdate = GetTime();
1257 return (GetTime() - nLastUpdate < 10 &&
1258 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1261 void static InvalidChainFound(CBlockIndex* pindexNew)
1263 if (pindexNew->nChainTrust > nBestInvalidTrust)
1265 nBestInvalidTrust = pindexNew->nChainTrust;
1266 CChainDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1267 uiInterface.NotifyBlocksChanged();
1270 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1271 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1273 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1274 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1275 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1276 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1277 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1278 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1279 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1280 nBestBlockTrust.Get64(),
1281 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1285 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1287 nTime = max(GetBlockTime(), GetAdjustedTime());
1291 CTxOut CTransaction::GetOutputFor(const CTxIn& input, CCoinsView& view)
1294 if (!view.GetCoins(input.prevout.hash, coins))
1295 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1297 if (input.prevout.n >= coins.vout.size())
1298 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range or already spent");
1300 const CTxOut &out = coins.vout[input.prevout.n];
1302 throw std::runtime_error("CTransaction::GetOutputFor() : already spent");
1307 int64 CTransaction::GetValueIn(CCoinsView& inputs) const
1313 for (unsigned int i = 0; i < vin.size(); i++)
1315 nResult += GetOutputFor(vin[i], inputs).nValue;
1320 unsigned int CTransaction::GetP2SHSigOpCount(CCoinsView& inputs) const
1325 unsigned int nSigOps = 0;
1326 for (unsigned int i = 0; i < vin.size(); i++)
1328 CTxOut prevout = GetOutputFor(vin[i], inputs);
1329 if (prevout.scriptPubKey.IsPayToScriptHash())
1330 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1335 bool CTransaction::UpdateCoins(CCoinsView &inputs, CTxUndo &txundo, int nHeight, unsigned int nTimeStamp) const
1337 uint256 hash = GetHash();
1339 // mark inputs spent
1340 if (!IsCoinBase()) {
1341 BOOST_FOREACH(const CTxIn &txin, vin) {
1343 if (!inputs.GetCoins(txin.prevout.hash, coins))
1344 return error("UpdateCoins() : cannot find prevtx");
1345 if (coins.nTime > nTimeStamp)
1346 return error("UpdateCoins() : timestamp violation");
1348 if (!coins.Spend(txin.prevout, undo))
1349 return error("UpdateCoins() : cannot spend input");
1350 txundo.vprevout.push_back(undo);
1351 if (!inputs.SetCoins(txin.prevout.hash, coins))
1352 return error("UpdateCoins() : cannot update input");
1357 if (!inputs.SetCoins(hash, CCoins(*this, nHeight, nTimeStamp)))
1358 return error("UpdateCoins() : cannot update output");
1363 bool CTransaction::HaveInputs(CCoinsView &inputs) const
1365 if (!IsCoinBase()) {
1366 // first check whether information about the prevout hash is available
1367 for (unsigned int i = 0; i < vin.size(); i++) {
1368 const COutPoint &prevout = vin[i].prevout;
1369 if (!inputs.HaveCoins(prevout.hash))
1373 // then check whether the actual outputs are available
1374 for (unsigned int i = 0; i < vin.size(); i++) {
1375 const COutPoint &prevout = vin[i].prevout;
1377 inputs.GetCoins(prevout.hash, coins);
1378 if (!coins.IsAvailable(prevout.n))
1385 bool CTransaction::CheckInputs(CCoinsView &inputs, enum CheckSig_mode csmode, bool fStrictPayToScriptHash, bool fStrictEncodings, CBlock *pblock) const
1391 for (unsigned int i = 0; i < vin.size(); i++)
1393 const COutPoint &prevout = vin[i].prevout;
1395 if (!inputs.GetCoins(prevout.hash, coins))
1396 return error("CheckInputs() : cannot find prevout tx");
1398 // Check for conflicts (double-spend)
1399 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1400 // for an attacker to attempt to split the network.
1401 if (!coins.IsAvailable(prevout.n))
1402 return error("CheckInputs() : %s prev tx already used", GetHash().ToString().substr(0,10).c_str());
1404 // If prev is coinbase or coinstake, check that it's matured
1405 if (coins.IsCoinBase() || coins.IsCoinStake()) {
1406 CBlockIndex *pindexBlock = inputs.GetBestBlock();
1407 if (pindexBlock->nHeight - coins.nHeight < nCoinbaseMaturity)
1408 return error("CheckInputs() : tried to spend %s at depth %d", coins.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - coins.nHeight);
1411 // Check transaction timestamp
1412 if (coins.nTime > nTime)
1413 return DoS(100, error("CheckInputs() : transaction timestamp earlier than input transaction"));
1415 // Check for negative or overflow input values
1416 nValueIn += coins.vout[prevout.n].nValue;
1417 if (!MoneyRange(coins.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1418 return DoS(100, error("CheckInputs() : txin values out of range"));
1424 return error("CheckInputs() : %s is a coinstake, but no block specified", GetHash().ToString().substr(0,10).c_str());
1426 // Coin stake tx earns reward instead of paying fee
1428 if (!GetCoinAge(nCoinAge))
1429 return error("CheckInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1431 int64 nStakeReward = GetValueOut() - nValueIn;
1432 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pblock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1434 if (nStakeReward > nCalculatedStakeReward)
1435 return DoS(100, error("CheckInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1439 if (nValueIn < GetValueOut())
1440 return DoS(100, error("ChecktInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1442 // Tally transaction fees
1443 int64 nTxFee = nValueIn - GetValueOut();
1445 return DoS(100, error("CheckInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1447 if (!MoneyRange(nFees))
1448 return DoS(100, error("CheckInputs() : nFees out of range"));
1450 // enforce transaction fees for every block until 1 May 2014 04:00:00 GMT
1451 if (!fTestNet && nTxFee < GetMinFee() && nTime < OUTPUT_SWITCH_TIME)
1452 return pblock? DoS(100, error("CheckInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(GetMinFee()).c_str(), FormatMoney(nTxFee).c_str())) : false;
1455 // The first loop above does all the inexpensive checks.
1456 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1457 // Helps prevent CPU exhaustion attacks.
1459 // Skip ECDSA signature verification when connecting blocks
1460 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1461 // still computed and checked, and any change will be caught at the next checkpoint.
1462 if (csmode == CS_ALWAYS ||
1463 (csmode == CS_AFTER_CHECKPOINT && inputs.GetBestBlock()->nHeight >= Checkpoints::GetTotalBlocksEstimate())) {
1464 for (unsigned int i = 0; i < vin.size(); i++) {
1465 const COutPoint &prevout = vin[i].prevout;
1467 inputs.GetCoins(prevout.hash, coins);
1470 if (!VerifySignature(coins, *this, i, fStrictPayToScriptHash, fStrictEncodings, 0)) {
1471 // only during transition phase for P2SH: do not invoke anti-DoS code for
1472 // potentially old clients relaying bad P2SH transactions
1473 if (fStrictPayToScriptHash && VerifySignature(coins, *this, i, false, fStrictEncodings, 0))
1474 return error("CheckInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1476 return DoS(100,error("CheckInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1486 bool CTransaction::ClientCheckInputs() const
1491 // Take over previous transactions' spent pointers
1495 for (unsigned int i = 0; i < vin.size(); i++)
1497 // Get prev tx from single transactions in memory
1498 COutPoint prevout = vin[i].prevout;
1499 if (!mempool.exists(prevout.hash))
1501 CTransaction& txPrev = mempool.lookup(prevout.hash);
1503 if (prevout.n >= txPrev.vout.size())
1507 if (!VerifySignature(CCoins(txPrev, -1, -1), *this, i, true, false, 0))
1508 return error("ConnectInputs() : VerifySignature failed");
1510 ///// this is redundant with the mempool.mapNextTx stuff,
1511 ///// not sure which I want to get rid of
1512 ///// this has to go away now that posNext is gone
1513 // // Check for conflicts
1514 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1515 // return error("ConnectInputs() : prev tx already used");
1517 // // Flag outpoints as used
1518 // txPrev.vout[prevout.n].posNext = posThisTx;
1520 nValueIn += txPrev.vout[prevout.n].nValue;
1522 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1523 return error("ClientConnectInputs() : txin values out of range");
1525 if (GetValueOut() > nValueIn)
1532 bool CBlock::DisconnectBlock(CBlockIndex *pindex, CCoinsView &view)
1534 assert(pindex == view.GetBestBlock());
1536 CBlockUndo blockUndo;
1538 CDiskBlockPos pos = pindex->GetUndoPos();
1540 return error("DisconnectBlock() : no undo data available");
1541 FILE *file = OpenUndoFile(pos, true);
1543 return error("DisconnectBlock() : undo file not available");
1544 CAutoFile fileUndo(file, SER_DISK, CLIENT_VERSION);
1545 fileUndo >> blockUndo;
1548 assert(blockUndo.vtxundo.size() + 1 == vtx.size());
1550 // undo transactions in reverse order
1551 for (int i = vtx.size() - 1; i >= 0; i--) {
1552 const CTransaction &tx = vtx[i];
1553 uint256 hash = tx.GetHash();
1555 // check that all outputs are available
1557 if (!view.GetCoins(hash, outs))
1558 return error("DisconnectBlock() : outputs still spent? database corrupted");
1560 CCoins outsBlock = CCoins(tx, pindex->nHeight, pindex->nTime);
1561 if (outs != outsBlock)
1562 return error("DisconnectBlock() : added transaction mismatch? database corrupted");
1565 if (!view.SetCoins(hash, CCoins()))
1566 return error("DisconnectBlock() : cannot delete coin outputs");
1569 if (i > 0) { // not coinbases
1570 const CTxUndo &txundo = blockUndo.vtxundo[i-1];
1571 assert(txundo.vprevout.size() == tx.vin.size());
1572 for (unsigned int j = tx.vin.size(); j-- > 0;) {
1573 const COutPoint &out = tx.vin[j].prevout;
1574 const CTxInUndo &undo = txundo.vprevout[j];
1576 view.GetCoins(out.hash, coins); // this can fail if the prevout was already entirely spent
1577 if (coins.IsPruned()) {
1578 if (undo.nHeight == 0)
1579 return error("DisconnectBlock() : undo data doesn't contain tx metadata? database corrupted");
1580 coins.fCoinBase = undo.fCoinBase;
1581 coins.fCoinStake = undo.fCoinStake;
1582 coins.nHeight = undo.nHeight;
1583 coins.nTime = undo.nTime;
1584 coins.nBlockTime = undo.nBlockTime;
1585 coins.nVersion = undo.nVersion;
1587 if (undo.nHeight != 0)
1588 return error("DisconnectBlock() : undo data contains unneeded tx metadata? database corrupted");
1590 if (coins.IsAvailable(out.n))
1591 return error("DisconnectBlock() : prevout output not spent? database corrupted");
1592 if (coins.vout.size() < out.n+1)
1593 coins.vout.resize(out.n+1);
1594 coins.vout[out.n] = undo.txout;
1595 if (!view.SetCoins(out.hash, coins))
1596 return error("DisconnectBlock() : cannot restore coin inputs");
1601 // move best block pointer to prevout block
1602 view.SetBestBlock(pindex->pprev);
1607 bool FindUndoPos(CChainDB &chaindb, int nFile, CDiskBlockPos &pos, unsigned int nAddSize);
1609 bool CBlock::ConnectBlock(CBlockIndex* pindex, CCoinsView &view, bool fJustCheck)
1611 // Check it again in case a previous version let a bad block in
1612 if (!CheckBlock(!fJustCheck, !fJustCheck))
1615 // verify that the view's current state corresponds to the previous block
1616 assert(pindex->pprev == view.GetBestBlock());
1618 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1619 // unless those are already completely spent.
1620 // If such overwrites are allowed, coinbases and transactions depending upon those
1621 // can be duplicated to remove the ability to spend the first instance -- even after
1622 // being sent to another address.
1623 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1624 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1625 // already refuses previously-known transaction ids entirely.
1626 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1627 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1628 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1629 // initial block download.
1630 bool fEnforceBIP30 = true;
1632 if (fEnforceBIP30) {
1633 BOOST_FOREACH(CTransaction& tx, vtx) {
1634 uint256 hash = tx.GetHash();
1636 if (view.GetCoins(hash, coins) && !coins.IsPruned())
1637 return error("ConnectBlock() : tried to overwrite transaction");
1641 // BIP16 always active
1642 bool fStrictPayToScriptHash = true;
1644 CBlockUndo blockundo;
1646 int64 nFees = 0, nValueIn = 0, nValueOut = 0;
1647 unsigned int nSigOps = 0;
1648 BOOST_FOREACH(CTransaction& tx, vtx)
1650 nSigOps += tx.GetLegacySigOpCount();
1651 if (nSigOps > MAX_BLOCK_SIGOPS)
1652 return DoS(100, error("ConnectBlock() : too many sigops"));
1654 if (!tx.IsCoinBase())
1656 if (!tx.HaveInputs(view))
1657 return DoS(100, error("ConnectBlock() : inputs missing/spent"));
1659 if (fStrictPayToScriptHash)
1661 // Add in sigops done by pay-to-script-hash inputs;
1662 // this is to prevent a "rogue miner" from creating
1663 // an incredibly-expensive-to-validate block.
1664 nSigOps += tx.GetP2SHSigOpCount(view);
1665 if (nSigOps > MAX_BLOCK_SIGOPS)
1666 return DoS(100, error("ConnectBlock() : too many sigops"));
1669 int64 nTxValueOut = tx.GetValueOut();
1670 int64 nTxValueIn = tx.GetValueIn(view);
1672 nValueIn += nTxValueIn;
1673 nValueOut += nTxValueOut;
1675 if (!tx.IsCoinStake())
1676 nFees += nTxValueIn - nTxValueOut;
1678 if (!tx.CheckInputs(view, CS_AFTER_CHECKPOINT, fStrictPayToScriptHash, false, this))
1683 nValueOut += tx.GetValueOut();
1687 if (!tx.UpdateCoins(view, txundo, pindex->nHeight, pindex->nTime))
1688 return error("ConnectBlock() : UpdateInputs failed");
1689 if (!tx.IsCoinBase())
1690 blockundo.vtxundo.push_back(txundo);
1693 pindex->nMint = nValueOut - nValueIn + nFees;
1694 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1702 // Write undo information to disk
1703 if (pindex->GetUndoPos().IsNull())
1705 if (!FindUndoPos(chaindb, pindex->pos.nFile, pos, ::GetSerializeSize(blockundo, SER_DISK, CLIENT_VERSION) + 8))
1706 return error("ConnectBlock() : FindUndoPos failed");
1707 if (!blockundo.WriteToDisk(pos))
1708 return error("ConnectBlock() : CBlockUndo::WriteToDisk failed");
1710 // update nUndoPos in block index
1711 pindex->nUndoPos = pos.nPos + 1;
1714 CDiskBlockIndex blockindex(pindex);
1715 if (!chaindb.WriteBlockIndex(blockindex))
1716 return error("ConnectBlock() : WriteBlockIndex failed");
1718 // add this block to the view's blockchain
1719 if (!view.SetBestBlock(pindex))
1722 // fees are destroyed to compensate the entire network
1723 if (fDebug && GetBoolArg("-printcreation"))
1724 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1726 // Watch for transactions paying to me
1727 BOOST_FOREACH(CTransaction& tx, vtx)
1728 SyncWithWallets(tx, this, true);
1733 bool CBlock::SetBestChain(CBlockIndex* pindexNew)
1735 CCoinsViewCache &view = *pcoinsTip;
1737 // special case for attaching the genesis block
1738 // note that no ConnectBlock is called, so its coinbase output is non-spendable
1739 if (pindexGenesisBlock == NULL && pindexNew->GetBlockHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1741 view.SetBestBlock(pindexNew);
1744 pindexGenesisBlock = pindexNew;
1745 pindexBest = pindexNew;
1746 hashBestChain = pindexNew->GetBlockHash();
1747 nBestHeight = pindexBest->nHeight;
1748 nBestChainTrust = pindexNew->nChainTrust;
1752 // Find the fork (typically, there is none)
1753 CBlockIndex* pfork = view.GetBestBlock();
1754 CBlockIndex* plonger = pindexNew;
1755 while (pfork != plonger)
1757 while (plonger->nHeight > pfork->nHeight)
1758 if (!(plonger = plonger->pprev))
1759 return error("SetBestChain() : plonger->pprev is null");
1760 if (pfork == plonger)
1762 if (!(pfork = pfork->pprev))
1763 return error("SetBestChain() : pfork->pprev is null");
1766 // List of what to disconnect (typically nothing)
1767 vector<CBlockIndex*> vDisconnect;
1768 for (CBlockIndex* pindex = view.GetBestBlock(); pindex != pfork; pindex = pindex->pprev)
1769 vDisconnect.push_back(pindex);
1771 // List of what to connect (typically only pindexNew)
1772 vector<CBlockIndex*> vConnect;
1773 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1774 vConnect.push_back(pindex);
1775 reverse(vConnect.begin(), vConnect.end());
1777 if (vDisconnect.size() > 0) {
1778 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());
1779 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());
1782 // Disconnect shorter branch
1783 vector<CTransaction> vResurrect;
1784 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect) {
1786 if (!block.ReadFromDisk(pindex))
1787 return error("SetBestBlock() : ReadFromDisk for disconnect failed");
1788 CCoinsViewCache viewTemp(view, true);
1789 if (!block.DisconnectBlock(pindex, viewTemp))
1790 return error("SetBestBlock() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1791 if (!viewTemp.Flush())
1792 return error("SetBestBlock() : Cache flush failed after disconnect");
1794 // Queue memory transactions to resurrect
1795 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1796 if (!tx.IsCoinBase() && !tx.IsCoinStake())
1797 vResurrect.push_back(tx);
1800 // Connect longer branch
1801 vector<CTransaction> vDelete;
1802 BOOST_FOREACH(CBlockIndex *pindex, vConnect) {
1805 if (pindex == pindexNew) // connecting *this block
1807 else { // other block; read it from disk
1808 if (!block.ReadFromDisk(pindex))
1809 return error("SetBestBlock() : ReadFromDisk for connect failed");
1812 CCoinsViewCache viewTemp(view, true);
1813 if (!pblock->ConnectBlock(pindex, viewTemp)) {
1814 InvalidChainFound(pindexNew);
1815 return error("SetBestBlock() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1817 if (!viewTemp.Flush())
1818 return error("SetBestBlock() : Cache flush failed after connect");
1820 // Queue memory transactions to delete
1821 BOOST_FOREACH(const CTransaction& tx, pblock->vtx)
1822 vDelete.push_back(tx);
1825 // Make sure it's successfully written to disk before changing memory structure
1826 bool fIsInitialDownload = IsInitialBlockDownload();
1827 if (!fIsInitialDownload || view.GetCacheSize()>5000)
1831 // At this point, all changes have been done to the database.
1832 // Proceed by updating the memory structures.
1834 // Disconnect shorter branch
1835 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1837 pindex->pprev->pnext = NULL;
1839 // Connect longer branch
1840 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1842 pindex->pprev->pnext = pindex;
1844 // Resurrect memory transactions that were in the disconnected branch
1845 BOOST_FOREACH(CTransaction& tx, vResurrect)
1846 tx.AcceptToMemoryPool(false);
1848 // Delete redundant memory transactions that are in the connected branch
1849 BOOST_FOREACH(CTransaction& tx, vDelete)
1852 // Update best block in wallet (so we can detect restored wallets)
1853 if (!fIsInitialDownload)
1855 const CBlockLocator locator(pindexNew);
1856 ::SetBestChain(locator);
1860 hashBestChain = pindexNew->GetBlockHash();
1861 pindexBest = pindexNew;
1862 pblockindexFBBHLast = NULL;
1863 nBestHeight = pindexBest->nHeight;
1864 nBestChainTrust = pindexNew->nChainTrust;
1865 nTimeBestReceived = GetTime();
1866 nTransactionsUpdated++;
1868 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1870 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1871 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1872 CBigNum(nBestChainTrust).ToString().c_str(),
1873 nBestBlockTrust.Get64(),
1874 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1876 // Check the version of the last 100 blocks to see if we need to upgrade:
1877 if (!fIsInitialDownload)
1880 const CBlockIndex* pindex = pindexBest;
1881 for (int i = 0; i < 100 && pindex != NULL; i++)
1883 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1885 pindex = pindex->pprev;
1888 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1889 if (nUpgraded > 100/2)
1890 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1891 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1894 std::string strCmd = GetArg("-blocknotify", "");
1896 if (!fIsInitialDownload && !strCmd.empty())
1898 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1899 boost::thread t(runCommand, strCmd); // thread runs free
1905 // Total coin age spent in transaction, in the unit of coin-days.
1906 // Only those coins meeting minimum age requirement counts. As those
1907 // transactions not in main chain are not currently indexed so we
1908 // might not find out about their coin age. Older transactions are
1909 // guaranteed to be in main chain by sync-checkpoint. This rule is
1910 // introduced to help nodes establish a consistent view of the coin
1911 // age (trust score) of competing branches.
1912 bool CTransaction::GetCoinAge(uint64& nCoinAge) const
1914 CCoinsViewCache &inputs = *pcoinsTip;
1916 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1922 for (unsigned int i = 0; i < vin.size(); i++)
1924 const COutPoint &prevout = vin[i].prevout;
1926 if (!inputs.GetCoins(prevout.hash, coins))
1929 if (nTime < coins.nTime)
1930 return false; // Transaction timestamp violation
1932 // only count coins meeting min age requirement
1933 if (coins.nBlockTime + nStakeMinAge > nTime)
1936 int64 nValueIn = coins.vout[vin[i].prevout.n].nValue;
1937 bnCentSecond += CBigNum(nValueIn) * (nTime-coins.nTime) / CENT;
1940 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1941 if (fDebug && GetBoolArg("-printcoinage"))
1942 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1943 nCoinAge = bnCoinDay.getuint64();
1947 // Total coin age spent in block, in the unit of coin-days.
1948 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1952 BOOST_FOREACH(const CTransaction& tx, vtx)
1955 if (tx.GetCoinAge(nTxCoinAge))
1956 nCoinAge += nTxCoinAge;
1961 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1963 if (fDebug && GetBoolArg("-printcoinage"))
1964 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1968 bool CBlock::AddToBlockIndex(const CDiskBlockPos &pos)
1970 // Check for duplicate
1971 uint256 hash = GetHash();
1972 if (mapBlockIndex.count(hash))
1973 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1975 // Construct new block index object
1976 CBlockIndex* pindexNew = new CBlockIndex(*this);
1978 return error("AddToBlockIndex() : new CBlockIndex failed");
1979 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1980 pindexNew->phashBlock = &((*mi).first);
1981 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1982 if (miPrev != mapBlockIndex.end())
1984 pindexNew->pprev = (*miPrev).second;
1985 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1987 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
1988 pindexNew->pos = pos;
1989 pindexNew->nUndoPos = 0;
1991 // Compute stake entropy bit for stake modifier
1992 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
1993 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
1995 // Record proof-of-stake hash value
1996 if (pindexNew->IsProofOfStake())
1998 if (!mapProofOfStake.count(hash))
1999 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2000 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2003 // Compute stake modifier
2004 uint64 nStakeModifier = 0;
2005 bool fGeneratedStakeModifier = false;
2006 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2007 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2008 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2009 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2010 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2011 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2014 if (!chaindb.TxnBegin())
2016 chaindb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2017 if (!chaindb.TxnCommit())
2021 if (!SetBestChain(pindexNew))
2024 if (pindexNew == pindexBest)
2026 // Notify UI to display prev block's coinbase if it was ours
2027 static uint256 hashPrevBestCoinBase;
2028 UpdatedTransaction(hashPrevBestCoinBase);
2029 hashPrevBestCoinBase = vtx[0].GetHash();
2032 uiInterface.NotifyBlocksChanged();
2036 bool FindBlockPos(CChainDB &chaindb, CDiskBlockPos &pos, unsigned int nAddSize, unsigned int nHeight, uint64 nTime)
2038 bool fUpdatedLast = false;
2040 LOCK(cs_LastBlockFile);
2042 while (infoLastBlockFile.nSize + nAddSize >= MAX_BLOCKFILE_SIZE) {
2043 printf("Leaving block file %i: %s\n", nLastBlockFile, infoLastBlockFile.ToString().c_str());
2044 FILE *file = OpenBlockFile(pos);
2047 file = OpenUndoFile(pos);
2051 infoLastBlockFile.SetNull();
2052 chaindb.ReadBlockFileInfo(nLastBlockFile, infoLastBlockFile); // check whether data for the new file somehow already exist; can fail just fine
2053 fUpdatedLast = true;
2056 pos.nFile = nLastBlockFile;
2057 pos.nPos = infoLastBlockFile.nSize;
2058 infoLastBlockFile.nSize += nAddSize;
2059 infoLastBlockFile.AddBlock(nHeight, nTime);
2061 unsigned int nOldChunks = (pos.nPos + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2062 unsigned int nNewChunks = (infoLastBlockFile.nSize + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2063 if (nNewChunks > nOldChunks) {
2064 FILE *file = OpenBlockFile(pos);
2066 printf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks * BLOCKFILE_CHUNK_SIZE, pos.nFile);
2067 AllocateFileRange(file, pos.nPos, nNewChunks * BLOCKFILE_CHUNK_SIZE - pos.nPos);
2072 if (!chaindb.WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2073 return error("FindBlockPos() : cannot write updated block info");
2075 chaindb.WriteLastBlockFile(nLastBlockFile);
2080 bool FindUndoPos(CChainDB &chaindb, int nFile, CDiskBlockPos &pos, unsigned int nAddSize)
2084 LOCK(cs_LastBlockFile);
2086 unsigned int nNewSize;
2087 if (nFile == nLastBlockFile) {
2088 pos.nPos = infoLastBlockFile.nUndoSize;
2089 nNewSize = (infoLastBlockFile.nUndoSize += nAddSize);
2090 if (!chaindb.WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2091 return error("FindUndoPos() : cannot write updated block info");
2093 CBlockFileInfo info;
2094 if (!chaindb.ReadBlockFileInfo(nFile, info))
2095 return error("FindUndoPos() : cannot read block info");
2096 pos.nPos = info.nUndoSize;
2097 nNewSize = (info.nUndoSize += nAddSize);
2098 if (!chaindb.WriteBlockFileInfo(nFile, info))
2099 return error("FindUndoPos() : cannot write updated block info");
2102 unsigned int nOldChunks = (pos.nPos + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2103 unsigned int nNewChunks = (nNewSize + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2104 if (nNewChunks > nOldChunks) {
2105 FILE *file = OpenUndoFile(pos);
2107 printf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks * UNDOFILE_CHUNK_SIZE, pos.nFile);
2108 AllocateFileRange(file, pos.nPos, nNewChunks * UNDOFILE_CHUNK_SIZE - pos.nPos);
2116 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2118 // These are checks that are independent of context
2119 // that can be verified before saving an orphan block.
2122 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2123 return DoS(100, error("CheckBlock() : size limits failed"));
2125 // Check proof of work matches claimed amount
2126 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2127 return DoS(50, error("CheckBlock() : proof of work failed"));
2130 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
2131 return error("CheckBlock() : block timestamp too far in the future");
2133 // First transaction must be coinbase, the rest must not be
2134 if (vtx.empty() || !vtx[0].IsCoinBase())
2135 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2136 for (unsigned int i = 1; i < vtx.size(); i++)
2137 if (vtx[i].IsCoinBase())
2138 return DoS(100, error("CheckBlock() : more than one coinbase"));
2140 // Check coinbase timestamp
2141 if (GetBlockTime() > FutureDrift((int64)vtx[0].nTime))
2142 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2144 if (IsProofOfStake())
2146 // Coinbase output should be empty if proof-of-stake block
2147 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2148 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2150 // Second transaction must be coinstake, the rest must not be
2151 if (vtx.empty() || !vtx[1].IsCoinStake())
2152 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2153 for (unsigned int i = 2; i < vtx.size(); i++)
2154 if (vtx[i].IsCoinStake())
2155 return DoS(100, error("CheckBlock() : more than one coinstake"));
2157 // Check coinstake timestamp
2158 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2159 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2161 // NovaCoin: check proof-of-stake block signature
2162 if (fCheckSig && !CheckBlockSignature(true))
2163 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2167 int64 nReward = GetProofOfWorkReward(nBits);
2168 // Check coinbase reward
2169 if (vtx[0].GetValueOut() > nReward)
2170 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2171 vtx[0].GetValueOut(),
2174 // Should we check proof-of-work block signature or not?
2176 // * Always skip on TestNet
2177 // * Perform checking for the first 9689 blocks
2178 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2180 if(!fTestNet && fCheckSig)
2182 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2184 // NovaCoin: check proof-of-work block signature
2185 if (checkEntropySig && !CheckBlockSignature(false))
2186 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2191 // Check transactions
2192 BOOST_FOREACH(const CTransaction& tx, vtx)
2194 if (!tx.CheckTransaction())
2195 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2197 // check transaction timestamp
2198 if (GetBlockTime() < (int64)tx.nTime)
2199 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2202 // Check for duplicate txids. This is caught by ConnectInputs(),
2203 // but catching it earlier avoids a potential DoS attack:
2204 set<uint256> uniqueTx;
2205 BOOST_FOREACH(const CTransaction& tx, vtx)
2207 uniqueTx.insert(tx.GetHash());
2209 if (uniqueTx.size() != vtx.size())
2210 return DoS(100, error("CheckBlock() : duplicate transaction"));
2212 unsigned int nSigOps = 0;
2213 BOOST_FOREACH(const CTransaction& tx, vtx)
2215 nSigOps += tx.GetLegacySigOpCount();
2217 if (nSigOps > MAX_BLOCK_SIGOPS)
2218 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2220 // Check merkle root
2221 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2222 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2228 bool CBlock::AcceptBlock()
2230 // Check for duplicate
2231 uint256 hash = GetHash();
2232 if (mapBlockIndex.count(hash))
2233 return error("AcceptBlock() : block already in mapBlockIndex");
2235 // Get prev block index
2236 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2237 if (mi == mapBlockIndex.end())
2238 return DoS(10, error("AcceptBlock() : prev block not found"));
2239 CBlockIndex* pindexPrev = (*mi).second;
2240 int nHeight = pindexPrev->nHeight+1;
2242 // Check proof-of-work or proof-of-stake
2243 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2244 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2246 // Check timestamp against prev
2247 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2248 return error("AcceptBlock() : block's timestamp is too early");
2250 // Check that all transactions are finalized
2251 BOOST_FOREACH(const CTransaction& tx, vtx)
2252 if (!tx.IsFinal(nHeight, GetBlockTime()))
2253 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2255 // Check that the block chain matches the known block chain up to a checkpoint
2256 if (!Checkpoints::CheckHardened(nHeight, hash))
2257 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2259 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2261 // Check that the block satisfies synchronized checkpoint
2262 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2263 return error("AcceptBlock() : rejected by synchronized checkpoint");
2265 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2266 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2268 // Enforce rule that the coinbase starts with serialized block height
2269 CScript expect = CScript() << nHeight;
2270 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2271 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2272 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2274 // Write block to history file
2275 unsigned int nBlockSize = ::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION);
2276 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2277 return error("AcceptBlock() : out of disk space");
2278 CDiskBlockPos blockPos;
2281 if (!FindBlockPos(chaindb, blockPos, nBlockSize+8, nHeight, nTime))
2282 return error("AcceptBlock() : FindBlockPos failed");
2284 if (!WriteToDisk(blockPos))
2285 return error("AcceptBlock() : WriteToDisk failed");
2286 if (!AddToBlockIndex(blockPos))
2287 return error("AcceptBlock() : AddToBlockIndex failed");
2289 // Relay inventory, but don't relay old inventory during initial block download
2290 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2291 if (hashBestChain == hash)
2294 BOOST_FOREACH(CNode* pnode, vNodes)
2295 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2296 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2299 // Check pending sync-checkpoint
2300 Checkpoints::AcceptPendingSyncCheckpoint();
2305 uint256 CBlockIndex::GetBlockTrust() const
2308 bnTarget.SetCompact(nBits);
2314 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2315 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2319 // Calculate work amount for block
2320 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2322 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2323 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2325 // Return nPoWTrust for the first 12 blocks
2326 if (pprev == NULL || pprev->nHeight < 12)
2329 const CBlockIndex* currentIndex = pprev;
2331 if(IsProofOfStake())
2333 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2335 // Return 1/3 of score if parent block is not the PoW block
2336 if (!pprev->IsProofOfWork())
2337 return (bnNewTrust / 3).getuint256();
2341 // Check last 12 blocks type
2342 while (pprev->nHeight - currentIndex->nHeight < 12)
2344 if (currentIndex->IsProofOfWork())
2346 currentIndex = currentIndex->pprev;
2349 // Return 1/3 of score if less than 3 PoW blocks found
2351 return (bnNewTrust / 3).getuint256();
2353 return bnNewTrust.getuint256();
2357 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2359 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2360 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2361 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2365 // Check last 12 blocks type
2366 while (pprev->nHeight - currentIndex->nHeight < 12)
2368 if (currentIndex->IsProofOfStake())
2370 currentIndex = currentIndex->pprev;
2373 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2375 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2377 bnTarget.SetCompact(pprev->nBits);
2382 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2384 // Return nPoWTrust + full trust score for previous block nBits
2385 return nPoWTrust + bnNewTrust.getuint256();
2389 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2391 unsigned int nFound = 0;
2392 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2394 if (pstart->nVersion >= minVersion)
2396 pstart = pstart->pprev;
2398 return (nFound >= nRequired);
2401 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2403 // Check for duplicate
2404 uint256 hash = pblock->GetHash();
2405 if (mapBlockIndex.count(hash))
2406 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2407 if (mapOrphanBlocks.count(hash))
2408 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2410 // ppcoin: check proof-of-stake
2411 // Limited duplicity on stake: prevents block flood attack
2412 // Duplicate stake allowed only when there is orphan child block
2413 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2414 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());
2416 // Preliminary checks
2417 if (!pblock->CheckBlock())
2418 return error("ProcessBlock() : CheckBlock FAILED");
2420 // ppcoin: verify hash target and signature of coinstake tx
2421 if (pblock->IsProofOfStake())
2423 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2424 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2426 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2427 return false; // do not error here as we expect this during initial block download
2429 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2430 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2433 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2434 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2436 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2437 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2439 bnNewBlock.SetCompact(pblock->nBits);
2442 if (pblock->IsProofOfStake())
2443 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2445 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2447 if (bnNewBlock > bnRequired)
2450 pfrom->Misbehaving(100);
2451 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2455 // ppcoin: ask for pending sync-checkpoint if any
2456 if (!IsInitialBlockDownload())
2457 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2459 // If don't already have its previous block, shunt it off to holding area until we get it
2460 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2462 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2463 CBlock* pblock2 = new CBlock(*pblock);
2464 // ppcoin: check proof-of-stake
2465 if (pblock2->IsProofOfStake())
2467 // Limited duplicity on stake: prevents block flood attack
2468 // Duplicate stake allowed only when there is orphan child block
2469 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2470 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock2->GetProofOfStake().first.ToString().c_str(), pblock2->GetProofOfStake().second, hash.ToString().c_str());
2472 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2474 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2475 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2477 // Ask this guy to fill in what we're missing
2480 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2481 // ppcoin: getblocks may not obtain the ancestor block rejected
2482 // earlier by duplicate-stake check so we ask for it again directly
2483 if (!IsInitialBlockDownload())
2484 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2490 if (!pblock->AcceptBlock())
2491 return error("ProcessBlock() : AcceptBlock FAILED");
2493 // Recursively process any orphan blocks that depended on this one
2494 vector<uint256> vWorkQueue;
2495 vWorkQueue.push_back(hash);
2496 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2498 uint256 hashPrev = vWorkQueue[i];
2499 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2500 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2503 CBlock* pblockOrphan = (*mi).second;
2504 if (pblockOrphan->AcceptBlock())
2505 vWorkQueue.push_back(pblockOrphan->GetHash());
2506 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2507 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2508 delete pblockOrphan;
2510 mapOrphanBlocksByPrev.erase(hashPrev);
2513 printf("ProcessBlock: ACCEPTED\n");
2515 // ppcoin: if responsible for sync-checkpoint send it
2516 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2517 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2522 // novacoin: attempt to generate suitable proof-of-stake
2523 bool CBlock::SignBlock(CWallet& wallet)
2525 // if we are trying to sign
2526 // something except proof-of-stake block template
2527 if (!vtx[0].vout[0].IsEmpty())
2530 // if we are trying to sign
2531 // a complete proof-of-stake block
2532 if (IsProofOfStake())
2535 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2538 CTransaction txCoinStake;
2539 int64 nSearchTime = txCoinStake.nTime; // search to current time
2541 if (nSearchTime > nLastCoinStakeSearchTime)
2543 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2545 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2547 // make sure coinstake would meet timestamp protocol
2548 // as it would be the same as the block timestamp
2549 vtx[0].nTime = nTime = txCoinStake.nTime;
2550 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2551 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2553 // we have to make sure that we have no future timestamps in
2554 // our transactions set
2555 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2556 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2558 vtx.insert(vtx.begin() + 1, txCoinStake);
2559 hashMerkleRoot = BuildMerkleTree();
2561 // append a signature to our block
2562 return key.Sign(GetHash(), vchBlockSig);
2565 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2566 nLastCoinStakeSearchTime = nSearchTime;
2572 // ppcoin: check block signature
2573 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2575 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2576 return vchBlockSig.empty();
2578 vector<valtype> vSolutions;
2579 txnouttype whichType;
2583 const CTxOut& txout = vtx[1].vout[1];
2585 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2587 if (whichType == TX_PUBKEY)
2589 valtype& vchPubKey = vSolutions[0];
2591 if (!key.SetPubKey(vchPubKey))
2593 if (vchBlockSig.empty())
2595 return key.Verify(GetHash(), vchBlockSig);
2600 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2602 const CTxOut& txout = vtx[0].vout[i];
2604 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2607 if (whichType == TX_PUBKEY)
2610 valtype& vchPubKey = vSolutions[0];
2612 if (!key.SetPubKey(vchPubKey))
2614 if (vchBlockSig.empty())
2616 if(!key.Verify(GetHash(), vchBlockSig))
2626 bool CheckDiskSpace(uint64 nAdditionalBytes)
2628 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2630 // Check for nMinDiskSpace bytes (currently 50MB)
2631 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2634 string strMessage = _("Warning: Disk space is low!");
2635 strMiscWarning = strMessage;
2636 printf("*** %s\n", strMessage.c_str());
2637 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2645 CCriticalSection cs_LastBlockFile;
2646 CBlockFileInfo infoLastBlockFile;
2647 int nLastBlockFile = 0;
2649 FILE* OpenDiskFile(const CDiskBlockPos &pos, const char *prefix, bool fReadOnly)
2653 boost::filesystem::path path = GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix, pos.nFile);
2654 boost::filesystem::create_directories(path.parent_path());
2655 FILE* file = fopen(path.string().c_str(), "rb+");
2656 if (!file && !fReadOnly)
2657 file = fopen(path.string().c_str(), "wb+");
2659 printf("Unable to open file %s\n", path.string().c_str());
2663 if (fseek(file, pos.nPos, SEEK_SET)) {
2664 printf("Unable to seek to position %u of %s\n", pos.nPos, path.string().c_str());
2672 FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly) {
2673 return OpenDiskFile(pos, "blk", fReadOnly);
2676 FILE *OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly) {
2677 return OpenDiskFile(pos, "rev", fReadOnly);
2680 bool LoadBlockIndex(bool fAllowNew)
2682 CBigNum bnTrustedModulus;
2686 pchMessageStart[0] = 0xcd;
2687 pchMessageStart[1] = 0xf2;
2688 pchMessageStart[2] = 0xc0;
2689 pchMessageStart[3] = 0xef;
2691 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2692 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2693 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2694 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2695 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2696 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2700 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2703 // Set up the Zerocoin Params object
2704 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2709 CChainDB chaindb("cr");
2710 if (!LoadBlockIndex(chaindb))
2715 // Init with genesis block
2717 if (mapBlockIndex.empty())
2726 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2727 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2728 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2730 // vMerkleTree: 4cb33b3b6a
2734 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2735 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2736 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2738 // vMerkleTree: 4cb33b3b6a
2740 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2742 txNew.nTime = 1360105017;
2743 txNew.vin.resize(1);
2744 txNew.vout.resize(1);
2745 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2746 txNew.vout[0].SetEmpty();
2748 block.vtx.push_back(txNew);
2749 block.hashPrevBlock = 0;
2750 block.hashMerkleRoot = block.BuildMerkleTree();
2752 block.nTime = 1360105017;
2753 block.nBits = bnProofOfWorkLimit.GetCompact();
2754 block.nNonce = !fTestNet ? 1575379 : 46534;
2757 uint256 hash = block.GetHash();
2758 printf("%s\n", hash.ToString().c_str());
2759 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2761 assert(hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2762 assert(block.CheckBlock());
2764 // Start new block file
2765 unsigned int nBlockSize = ::GetSerializeSize(block, SER_DISK, CLIENT_VERSION);
2766 CDiskBlockPos blockPos;
2769 if (!FindBlockPos(chaindb, blockPos, nBlockSize+8, 0, block.nTime))
2770 return error("AcceptBlock() : FindBlockPos failed");
2772 if (!block.WriteToDisk(blockPos))
2773 return error("LoadBlockIndex() : writing genesis block to disk failed");
2774 if (!block.AddToBlockIndex(blockPos))
2775 return error("LoadBlockIndex() : genesis block not accepted");
2777 // initialize synchronized checkpoint
2778 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2779 return error("LoadBlockIndex() : failed to init sync checkpoint");
2782 string strPubKey = "";
2785 // if checkpoint master key changed must reset sync-checkpoint
2786 if (!chaindb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2788 // write checkpoint master key to db
2790 if (!chaindb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2791 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2792 if (!chaindb.TxnCommit())
2793 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2794 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2795 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2802 void PrintBlockTree()
2804 // pre-compute tree structure
2805 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2806 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2808 CBlockIndex* pindex = (*mi).second;
2809 mapNext[pindex->pprev].push_back(pindex);
2811 //while (rand() % 3 == 0)
2812 // mapNext[pindex->pprev].push_back(pindex);
2815 vector<pair<int, CBlockIndex*> > vStack;
2816 vStack.push_back(make_pair(0, pindexGenesisBlock));
2819 while (!vStack.empty())
2821 int nCol = vStack.back().first;
2822 CBlockIndex* pindex = vStack.back().second;
2825 // print split or gap
2826 if (nCol > nPrevCol)
2828 for (int i = 0; i < nCol-1; i++)
2832 else if (nCol < nPrevCol)
2834 for (int i = 0; i < nCol; i++)
2841 for (int i = 0; i < nCol; i++)
2846 block.ReadFromDisk(pindex);
2847 printf("%d (blk%05u.dat:0x%x) %s tx %"PRIszu"",
2849 pindex->GetBlockPos().nFile, pindex->GetBlockPos().nPos,
2850 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2853 PrintWallets(block);
2855 // put the main time-chain first
2856 vector<CBlockIndex*>& vNext = mapNext[pindex];
2857 for (unsigned int i = 0; i < vNext.size(); i++)
2859 if (vNext[i]->pnext)
2861 swap(vNext[0], vNext[i]);
2867 for (unsigned int i = 0; i < vNext.size(); i++)
2868 vStack.push_back(make_pair(nCol+i, vNext[i]));
2872 bool LoadExternalBlockFile(FILE* fileIn)
2874 int64 nStart = GetTimeMillis();
2880 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2881 unsigned int nPos = 0;
2882 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2884 unsigned char pchData[65536];
2886 fseek(blkdat, nPos, SEEK_SET);
2887 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2890 nPos = (unsigned int)-1;
2893 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2896 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2898 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2901 nPos += ((unsigned char*)nFind - pchData) + 1;
2904 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2905 } while(!fRequestShutdown);
2906 if (nPos == (unsigned int)-1)
2908 fseek(blkdat, nPos, SEEK_SET);
2911 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2915 if (ProcessBlock(NULL,&block))
2923 catch (std::exception &e) {
2924 printf("%s() : Deserialize or I/O error caught during load\n",
2925 __PRETTY_FUNCTION__);
2928 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2932 //////////////////////////////////////////////////////////////////////////////
2937 extern map<uint256, CAlert> mapAlerts;
2938 extern CCriticalSection cs_mapAlerts;
2940 extern string strMintMessage;
2941 extern string strMintWarning;
2943 string GetWarnings(string strFor)
2946 string strStatusBar;
2949 if (GetBoolArg("-testsafemode"))
2952 // ppcoin: wallet lock warning for minting
2953 if (strMintWarning != "")
2956 strStatusBar = strMintWarning;
2959 // Misc warnings like out of disk space and clock is wrong
2960 if (strMiscWarning != "")
2963 strStatusBar = strMiscWarning;
2966 // * Should not enter safe mode for longer invalid chain
2967 // * If sync-checkpoint is too old do not enter safe mode
2968 // * Display warning only in the STRICT mode
2969 if (CheckpointsMode == Checkpoints::STRICT && Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) &&
2970 !fTestNet && !IsInitialBlockDownload())
2973 strStatusBar = _("WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.");
2976 // ppcoin: if detected invalid checkpoint enter safe mode
2977 if (Checkpoints::hashInvalidCheckpoint != 0)
2980 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
2986 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2988 const CAlert& alert = item.second;
2989 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2991 nPriority = alert.nPriority;
2992 strStatusBar = alert.strStatusBar;
2993 if (nPriority > 1000)
2994 strRPC = strStatusBar;
2999 if (strFor == "statusbar")
3000 return strStatusBar;
3001 else if (strFor == "rpc")
3003 assert(!"GetWarnings() : invalid parameter");
3014 //////////////////////////////////////////////////////////////////////////////
3020 bool static AlreadyHave(const CInv& inv)
3026 bool txInMap = false;
3029 txInMap = mempool.exists(inv.hash);
3031 return txInMap || mapOrphanTransactions.count(inv.hash) ||
3032 pcoinsTip->HaveCoins(inv.hash);
3035 return mapBlockIndex.count(inv.hash) ||
3036 mapOrphanBlocks.count(inv.hash);
3038 // Don't know what it is, just say we already got one
3045 // The message start string is designed to be unlikely to occur in normal data.
3046 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3047 // a large 4-byte int at any alignment.
3048 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3050 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3052 static map<CService, CPubKey> mapReuseKey;
3053 RandAddSeedPerfmon();
3055 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3056 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3058 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3062 if (strCommand == "version")
3064 // Each connection can only send one version message
3065 if (pfrom->nVersion != 0)
3067 pfrom->Misbehaving(1);
3075 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3076 if (pfrom->nVersion < MIN_PROTO_VERSION)
3078 // Since February 20, 2012, the protocol is initiated at version 209,
3079 // and earlier versions are no longer supported
3080 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3081 pfrom->fDisconnect = true;
3085 if (pfrom->nVersion == 10300)
3086 pfrom->nVersion = 300;
3088 vRecv >> addrFrom >> nNonce;
3090 vRecv >> pfrom->strSubVer;
3092 vRecv >> pfrom->nStartingHeight;
3094 if (pfrom->fInbound && addrMe.IsRoutable())
3096 pfrom->addrLocal = addrMe;
3100 // Disconnect if we connected to ourself
3101 if (nNonce == nLocalHostNonce && nNonce > 1)
3103 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3104 pfrom->fDisconnect = true;
3108 // record my external IP reported by peer
3109 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3110 addrSeenByPeer = addrMe;
3112 // Be shy and don't send version until we hear
3113 if (pfrom->fInbound)
3114 pfrom->PushVersion();
3116 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3118 AddTimeData(pfrom->addr, nTime);
3121 pfrom->PushMessage("verack");
3122 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3124 if (!pfrom->fInbound)
3126 // Advertise our address
3127 if (!fNoListen && !IsInitialBlockDownload())
3129 CAddress addr = GetLocalAddress(&pfrom->addr);
3130 if (addr.IsRoutable())
3131 pfrom->PushAddress(addr);
3134 // Get recent addresses
3135 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3137 pfrom->PushMessage("getaddr");
3138 pfrom->fGetAddr = true;
3140 addrman.Good(pfrom->addr);
3142 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3144 addrman.Add(addrFrom, addrFrom);
3145 addrman.Good(addrFrom);
3149 // Ask the first connected node for block updates
3150 static int nAskedForBlocks = 0;
3151 if (!pfrom->fClient && !pfrom->fOneShot &&
3152 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3153 (pfrom->nVersion < NOBLKS_VERSION_START ||
3154 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3155 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3158 pfrom->PushGetBlocks(pindexBest, uint256(0));
3164 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3165 item.second.RelayTo(pfrom);
3168 // Relay sync-checkpoint
3170 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3171 if (!Checkpoints::checkpointMessage.IsNull())
3172 Checkpoints::checkpointMessage.RelayTo(pfrom);
3175 pfrom->fSuccessfullyConnected = true;
3177 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());
3179 cPeerBlockCounts.input(pfrom->nStartingHeight);
3181 // ppcoin: ask for pending sync-checkpoint if any
3182 if (!IsInitialBlockDownload())
3183 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3187 else if (pfrom->nVersion == 0)
3189 // Must have a version message before anything else
3190 pfrom->Misbehaving(1);
3195 else if (strCommand == "verack")
3197 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3201 else if (strCommand == "addr")
3203 vector<CAddress> vAddr;
3206 // Don't want addr from older versions unless seeding
3207 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3209 if (vAddr.size() > 1000)
3211 pfrom->Misbehaving(20);
3212 return error("message addr size() = %"PRIszu"", vAddr.size());
3215 // Store the new addresses
3216 vector<CAddress> vAddrOk;
3217 int64 nNow = GetAdjustedTime();
3218 int64 nSince = nNow - 10 * 60;
3219 BOOST_FOREACH(CAddress& addr, vAddr)
3223 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3224 addr.nTime = nNow - 5 * 24 * 60 * 60;
3225 pfrom->AddAddressKnown(addr);
3226 bool fReachable = IsReachable(addr);
3227 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3229 // Relay to a limited number of other nodes
3232 // Use deterministic randomness to send to the same nodes for 24 hours
3233 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3234 static uint256 hashSalt;
3236 hashSalt = GetRandHash();
3237 uint64 hashAddr = addr.GetHash();
3238 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3239 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3240 multimap<uint256, CNode*> mapMix;
3241 BOOST_FOREACH(CNode* pnode, vNodes)
3243 if (pnode->nVersion < CADDR_TIME_VERSION)
3245 unsigned int nPointer;
3246 memcpy(&nPointer, &pnode, sizeof(nPointer));
3247 uint256 hashKey = hashRand ^ nPointer;
3248 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3249 mapMix.insert(make_pair(hashKey, pnode));
3251 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3252 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3253 ((*mi).second)->PushAddress(addr);
3256 // Do not store addresses outside our network
3258 vAddrOk.push_back(addr);
3260 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3261 if (vAddr.size() < 1000)
3262 pfrom->fGetAddr = false;
3263 if (pfrom->fOneShot)
3264 pfrom->fDisconnect = true;
3267 else if (strCommand == "inv")
3271 if (vInv.size() > MAX_INV_SZ)
3273 pfrom->Misbehaving(20);
3274 return error("message inv size() = %"PRIszu"", vInv.size());
3277 // find last block in inv vector
3278 unsigned int nLastBlock = (unsigned int)(-1);
3279 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3280 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3281 nLastBlock = vInv.size() - 1 - nInv;
3285 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3287 const CInv &inv = vInv[nInv];
3291 pfrom->AddInventoryKnown(inv);
3293 bool fAlreadyHave = AlreadyHave(inv);
3295 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3299 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3300 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3301 } else if (nInv == nLastBlock) {
3302 // In case we are on a very long side-chain, it is possible that we already have
3303 // the last block in an inv bundle sent in response to getblocks. Try to detect
3304 // this situation and push another getblocks to continue.
3305 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3307 printf("force request: %s\n", inv.ToString().c_str());
3310 // Track requests for our stuff
3311 Inventory(inv.hash);
3316 else if (strCommand == "getdata")
3320 if (vInv.size() > MAX_INV_SZ)
3322 pfrom->Misbehaving(20);
3323 return error("message getdata size() = %"PRIszu"", vInv.size());
3326 if (fDebugNet || (vInv.size() != 1))
3327 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3329 BOOST_FOREACH(const CInv& inv, vInv)
3333 if (fDebugNet || (vInv.size() == 1))
3334 printf("received getdata for: %s\n", inv.ToString().c_str());
3336 if (inv.type == MSG_BLOCK)
3338 // Send block from disk
3339 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3340 if (mi != mapBlockIndex.end())
3343 block.ReadFromDisk((*mi).second);
3344 pfrom->PushMessage("block", block);
3346 // Trigger them to send a getblocks request for the next batch of inventory
3347 if (inv.hash == pfrom->hashContinue)
3349 // ppcoin: send latest proof-of-work block to allow the
3350 // download node to accept as orphan (proof-of-stake
3351 // block might be rejected by stake connection check)
3353 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3354 pfrom->PushMessage("inv", vInv);
3355 pfrom->hashContinue = 0;
3359 else if (inv.IsKnownType())
3361 // Send stream from relay memory
3362 bool pushed = false;
3365 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3366 if (mi != mapRelay.end()) {
3367 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3371 if (!pushed && inv.type == MSG_TX) {
3373 if (mempool.exists(inv.hash)) {
3374 CTransaction tx = mempool.lookup(inv.hash);
3375 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3378 pfrom->PushMessage("tx", ss);
3383 // Track requests for our stuff
3384 Inventory(inv.hash);
3389 else if (strCommand == "getblocks")
3391 CBlockLocator locator;
3393 vRecv >> locator >> hashStop;
3395 // Find the last block the caller has in the main chain
3396 CBlockIndex* pindex = locator.GetBlockIndex();
3398 // Send the rest of the chain
3400 pindex = pindex->pnext;
3402 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3403 for (; pindex; pindex = pindex->pnext)
3405 if (pindex->GetBlockHash() == hashStop)
3407 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3408 // ppcoin: tell downloading node about the latest block if it's
3409 // without risk being rejected due to stake connection check
3410 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3411 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3414 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3417 // When this block is requested, we'll send an inv that'll make them
3418 // getblocks the next batch of inventory.
3419 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3420 pfrom->hashContinue = pindex->GetBlockHash();
3425 else if (strCommand == "checkpoint")
3427 CSyncCheckpoint checkpoint;
3428 vRecv >> checkpoint;
3430 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3433 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3435 BOOST_FOREACH(CNode* pnode, vNodes)
3436 checkpoint.RelayTo(pnode);
3440 else if (strCommand == "getheaders")
3442 CBlockLocator locator;
3444 vRecv >> locator >> hashStop;
3446 CBlockIndex* pindex = NULL;
3447 if (locator.IsNull())
3449 // If locator is null, return the hashStop block
3450 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3451 if (mi == mapBlockIndex.end())
3453 pindex = (*mi).second;
3457 // Find the last block the caller has in the main chain
3458 pindex = locator.GetBlockIndex();
3460 pindex = pindex->pnext;
3463 vector<CBlock> vHeaders;
3465 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3466 for (; pindex; pindex = pindex->pnext)
3468 vHeaders.push_back(pindex->GetBlockHeader());
3469 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3472 pfrom->PushMessage("headers", vHeaders);
3476 else if (strCommand == "tx")
3478 vector<uint256> vWorkQueue;
3479 vector<uint256> vEraseQueue;
3480 CDataStream vMsg(vRecv);
3484 CInv inv(MSG_TX, tx.GetHash());
3485 pfrom->AddInventoryKnown(inv);
3487 bool fMissingInputs = false;
3488 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
3490 SyncWithWallets(tx, NULL, true);
3491 RelayTransaction(tx, inv.hash);
3492 mapAlreadyAskedFor.erase(inv);
3493 vWorkQueue.push_back(inv.hash);
3494 vEraseQueue.push_back(inv.hash);
3496 // Recursively process any orphan transactions that depended on this one
3497 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3499 uint256 hashPrev = vWorkQueue[i];
3500 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3501 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3504 const uint256& orphanTxHash = *mi;
3505 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3506 bool fMissingInputs2 = false;
3508 if (orphanTx.AcceptToMemoryPool(true, &fMissingInputs2))
3510 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3511 SyncWithWallets(tx, NULL, true);
3512 RelayTransaction(orphanTx, orphanTxHash);
3513 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3514 vWorkQueue.push_back(orphanTxHash);
3515 vEraseQueue.push_back(orphanTxHash);
3517 else if (!fMissingInputs2)
3520 vEraseQueue.push_back(orphanTxHash);
3521 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3526 BOOST_FOREACH(uint256 hash, vEraseQueue)
3527 EraseOrphanTx(hash);
3529 else if (fMissingInputs)
3533 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3534 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3536 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3538 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3542 else if (strCommand == "block")
3546 uint256 hashBlock = block.GetHash();
3548 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3551 CInv inv(MSG_BLOCK, hashBlock);
3552 pfrom->AddInventoryKnown(inv);
3554 if (ProcessBlock(pfrom, &block))
3555 mapAlreadyAskedFor.erase(inv);
3556 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3560 else if (strCommand == "getaddr")
3562 // Don't return addresses older than nCutOff timestamp
3563 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3564 pfrom->vAddrToSend.clear();
3565 vector<CAddress> vAddr = addrman.GetAddr();
3566 BOOST_FOREACH(const CAddress &addr, vAddr)
3567 if(addr.nTime > nCutOff)
3568 pfrom->PushAddress(addr);
3572 else if (strCommand == "mempool")
3574 std::vector<uint256> vtxid;
3575 mempool.queryHashes(vtxid);
3577 for (unsigned int i = 0; i < vtxid.size(); i++) {
3578 CInv inv(MSG_TX, vtxid[i]);
3579 vInv.push_back(inv);
3580 if (i == (MAX_INV_SZ - 1))
3583 if (vInv.size() > 0)
3584 pfrom->PushMessage("inv", vInv);
3588 else if (strCommand == "checkorder")
3593 if (!GetBoolArg("-allowreceivebyip"))
3595 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3602 /// we have a chance to check the order here
3604 // Keep giving the same key to the same ip until they use it
3605 if (!mapReuseKey.count(pfrom->addr))
3606 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3608 // Send back approval of order and pubkey to use
3609 CScript scriptPubKey;
3610 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3611 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3615 else if (strCommand == "reply")
3620 CRequestTracker tracker;
3622 LOCK(pfrom->cs_mapRequests);
3623 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3624 if (mi != pfrom->mapRequests.end())
3626 tracker = (*mi).second;
3627 pfrom->mapRequests.erase(mi);
3630 if (!tracker.IsNull())
3631 tracker.fn(tracker.param1, vRecv);
3635 else if (strCommand == "ping")
3637 if (pfrom->nVersion > BIP0031_VERSION)
3641 // Echo the message back with the nonce. This allows for two useful features:
3643 // 1) A remote node can quickly check if the connection is operational
3644 // 2) Remote nodes can measure the latency of the network thread. If this node
3645 // is overloaded it won't respond to pings quickly and the remote node can
3646 // avoid sending us more work, like chain download requests.
3648 // The nonce stops the remote getting confused between different pings: without
3649 // it, if the remote node sends a ping once per second and this node takes 5
3650 // seconds to respond to each, the 5th ping the remote sends would appear to
3651 // return very quickly.
3652 pfrom->PushMessage("pong", nonce);
3657 else if (strCommand == "alert")
3662 uint256 alertHash = alert.GetHash();
3663 if (pfrom->setKnown.count(alertHash) == 0)
3665 if (alert.ProcessAlert())
3668 pfrom->setKnown.insert(alertHash);
3671 BOOST_FOREACH(CNode* pnode, vNodes)
3672 alert.RelayTo(pnode);
3676 // Small DoS penalty so peers that send us lots of
3677 // duplicate/expired/invalid-signature/whatever alerts
3678 // eventually get banned.
3679 // This isn't a Misbehaving(100) (immediate ban) because the
3680 // peer might be an older or different implementation with
3681 // a different signature key, etc.
3682 pfrom->Misbehaving(10);
3690 // Ignore unknown commands for extensibility
3694 // Update the last seen time for this node's address
3695 if (pfrom->fNetworkNode)
3696 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3697 AddressCurrentlyConnected(pfrom->addr);
3703 bool ProcessMessages(CNode* pfrom)
3705 CDataStream& vRecv = pfrom->vRecv;
3709 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3713 // (4) message start
3722 // Don't bother if send buffer is too full to respond anyway
3723 if (pfrom->vSend.size() >= SendBufferSize())
3726 // Scan for message start
3727 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3728 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3729 if (vRecv.end() - pstart < nHeaderSize)
3731 if ((int)vRecv.size() > nHeaderSize)
3733 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3734 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3738 if (pstart - vRecv.begin() > 0)
3739 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3740 vRecv.erase(vRecv.begin(), pstart);
3743 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3748 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3751 string strCommand = hdr.GetCommand();
3754 unsigned int nMessageSize = hdr.nMessageSize;
3755 if (nMessageSize > MAX_SIZE)
3757 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3760 if (nMessageSize > vRecv.size())
3762 // Rewind and wait for rest of message
3763 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3768 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3769 unsigned int nChecksum = 0;
3770 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3771 if (nChecksum != hdr.nChecksum)
3773 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3774 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3778 // Copy message to its own buffer
3779 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3780 vRecv.ignore(nMessageSize);
3788 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3793 catch (std::ios_base::failure& e)
3795 if (strstr(e.what(), "end of data"))
3797 // Allow exceptions from under-length message on vRecv
3798 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());
3800 else if (strstr(e.what(), "size too large"))
3802 // Allow exceptions from over-long size
3803 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3807 PrintExceptionContinue(&e, "ProcessMessages()");
3810 catch (std::exception& e) {
3811 PrintExceptionContinue(&e, "ProcessMessages()");
3813 PrintExceptionContinue(NULL, "ProcessMessages()");
3817 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3825 bool SendMessages(CNode* pto, bool fSendTrickle)
3827 TRY_LOCK(cs_main, lockMain);
3829 // Don't send anything until we get their version message
3830 if (pto->nVersion == 0)
3833 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3835 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3837 if (pto->nVersion > BIP0031_VERSION)
3838 pto->PushMessage("ping", nonce);
3840 pto->PushMessage("ping");
3843 // Resend wallet transactions that haven't gotten in a block yet
3844 ResendWalletTransactions();
3846 // Address refresh broadcast
3847 static int64 nLastRebroadcast;
3848 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3852 BOOST_FOREACH(CNode* pnode, vNodes)
3854 // Periodically clear setAddrKnown to allow refresh broadcasts
3855 if (nLastRebroadcast)
3856 pnode->setAddrKnown.clear();
3858 // Rebroadcast our address
3861 CAddress addr = GetLocalAddress(&pnode->addr);
3862 if (addr.IsRoutable())
3863 pnode->PushAddress(addr);
3867 nLastRebroadcast = GetTime();
3875 vector<CAddress> vAddr;
3876 vAddr.reserve(pto->vAddrToSend.size());
3877 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3879 // returns true if wasn't already contained in the set
3880 if (pto->setAddrKnown.insert(addr).second)
3882 vAddr.push_back(addr);
3883 // receiver rejects addr messages larger than 1000
3884 if (vAddr.size() >= 1000)
3886 pto->PushMessage("addr", vAddr);
3891 pto->vAddrToSend.clear();
3893 pto->PushMessage("addr", vAddr);
3898 // Message: inventory
3901 vector<CInv> vInvWait;
3903 LOCK(pto->cs_inventory);
3904 vInv.reserve(pto->vInventoryToSend.size());
3905 vInvWait.reserve(pto->vInventoryToSend.size());
3906 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3908 if (pto->setInventoryKnown.count(inv))
3911 // trickle out tx inv to protect privacy
3912 if (inv.type == MSG_TX && !fSendTrickle)
3914 // 1/4 of tx invs blast to all immediately
3915 static uint256 hashSalt;
3917 hashSalt = GetRandHash();
3918 uint256 hashRand = inv.hash ^ hashSalt;
3919 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3920 bool fTrickleWait = ((hashRand & 3) != 0);
3922 // always trickle our own transactions
3926 if (GetTransaction(inv.hash, wtx))
3928 fTrickleWait = true;
3933 vInvWait.push_back(inv);
3938 // returns true if wasn't already contained in the set
3939 if (pto->setInventoryKnown.insert(inv).second)
3941 vInv.push_back(inv);
3942 if (vInv.size() >= 1000)
3944 pto->PushMessage("inv", vInv);
3949 pto->vInventoryToSend = vInvWait;
3952 pto->PushMessage("inv", vInv);
3958 vector<CInv> vGetData;
3959 int64 nNow = GetTime() * 1000000;
3960 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3962 const CInv& inv = (*pto->mapAskFor.begin()).second;
3963 if (!AlreadyHave(inv))
3966 printf("sending getdata: %s\n", inv.ToString().c_str());
3967 vGetData.push_back(inv);
3968 if (vGetData.size() >= 1000)
3970 pto->PushMessage("getdata", vGetData);
3973 mapAlreadyAskedFor[inv] = nNow;
3975 pto->mapAskFor.erase(pto->mapAskFor.begin());
3977 if (!vGetData.empty())
3978 pto->PushMessage("getdata", vGetData);
3984 // Amount compression:
3985 // * If the amount is 0, output 0
3986 // * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)
3987 // * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)
3988 // * call the result n
3989 // * output 1 + 10*(9*n + d - 1) + e
3990 // * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9
3991 // (this is decodable, as d is in [1-9] and e is in [0-9])
3993 uint64 CTxOutCompressor::CompressAmount(uint64 n)
3998 while (((n % 10) == 0) && e < 9) {
4004 assert(d >= 1 && d <= 9);
4006 return 1 + (n*9 + d - 1)*10 + e;
4008 return 1 + (n - 1)*10 + 9;
4012 uint64 CTxOutCompressor::DecompressAmount(uint64 x)
4014 // x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9
4018 // x = 10*(9*n + d - 1) + e
4024 int d = (x % 9) + 1;