1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
12 #include "ui_interface.h"
14 #include "zerocoin/Zerocoin.h"
15 #include <boost/algorithm/string/replace.hpp>
16 #include <boost/filesystem.hpp>
17 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
27 CCriticalSection cs_setpwalletRegistered;
28 set<CWallet*> setpwalletRegistered;
30 CCriticalSection cs_main;
33 unsigned int nTransactionsUpdated = 0;
35 map<uint256, CBlockIndex*> mapBlockIndex;
36 set<pair<COutPoint, unsigned int> > setStakeSeen;
37 libzerocoin::Params* ZCParams;
39 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
40 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
41 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
42 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
43 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
45 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
47 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
48 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
49 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
50 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
52 int nCoinbaseMaturity = 500;
53 CBlockIndex* pindexGenesisBlock = NULL;
56 uint256 nBestChainTrust = 0;
57 uint256 nBestInvalidTrust = 0;
59 uint256 hashBestChain = 0;
60 CBlockIndex* pindexBest = NULL;
61 int64 nTimeBestReceived = 0;
62 set<CBlockIndex*, CBlockIndexTrustComparator> setBlockIndexValid; // may contain all CBlockIndex*'s that have validness >=BLOCK_VALID_TRANSACTIONS, and must contain those who aren't failed
64 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
66 map<uint256, CBlock*> mapOrphanBlocks;
67 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
68 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
69 map<uint256, uint256> mapProofOfStake;
71 map<uint256, CTransaction> mapOrphanTransactions;
72 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
74 // Constant stuff for coinbase transactions we create:
75 CScript COINBASE_FLAGS;
77 const string strMessageMagic = "NovaCoin Signed Message:\n";
80 int64 nTransactionFee = MIN_TX_FEE;
81 int64 nMinimumInputValue = MIN_TX_FEE;
83 extern enum Checkpoints::CPMode CheckpointsMode;
85 //////////////////////////////////////////////////////////////////////////////
87 // dispatching functions
90 // These functions dispatch to one or all registered wallets
93 void RegisterWallet(CWallet* pwalletIn)
96 LOCK(cs_setpwalletRegistered);
97 setpwalletRegistered.insert(pwalletIn);
101 void UnregisterWallet(CWallet* pwalletIn)
104 LOCK(cs_setpwalletRegistered);
105 setpwalletRegistered.erase(pwalletIn);
109 // check whether the passed transaction is from us
110 bool static IsFromMe(CTransaction& tx)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 if (pwallet->IsFromMe(tx))
118 // get the wallet transaction with the given hash (if it exists)
119 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 if (pwallet->GetTransaction(hashTx,wtx))
127 // erases transaction with the given hash from all wallets
128 void static EraseFromWallets(uint256 hash)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->EraseFromWallet(hash);
134 // make sure all wallets know about the given transaction, in the given block
135 void SyncWithWallets(const uint256 &hash, const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
139 // ppcoin: wallets need to refund inputs when disconnecting coinstake
140 if (tx.IsCoinStake())
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 if (pwallet->IsFromMe(tx))
144 pwallet->DisableTransaction(tx);
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->AddToWalletIfInvolvingMe(hash, tx, pblock, fUpdate);
153 // notify wallets about a new best chain
154 void static SetBestChain(const CBlockLocator& loc)
156 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
157 pwallet->SetBestChain(loc);
160 // notify wallets about an updated transaction
161 void static UpdatedTransaction(const uint256& hashTx)
163 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
164 pwallet->UpdatedTransaction(hashTx);
168 void static PrintWallets(const CBlock& block)
170 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
171 pwallet->PrintWallet(block);
174 // notify wallets about an incoming inventory (for request counts)
175 void static Inventory(const uint256& hash)
177 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
178 pwallet->Inventory(hash);
181 // ask wallets to resend their transactions
182 void ResendWalletTransactions(bool fForce)
184 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
185 pwallet->ResendWalletTransactions(fForce);
189 //////////////////////////////////////////////////////////////////////////////
191 // CCoinsView implementations
194 bool CCoinsView::GetCoins(uint256 txid, CCoins &coins) { return false; }
195 bool CCoinsView::SetCoins(uint256 txid, const CCoins &coins) { return false; }
196 bool CCoinsView::HaveCoins(uint256 txid) { return false; }
197 CBlockIndex *CCoinsView::GetBestBlock() { return NULL; }
198 bool CCoinsView::SetBestBlock(CBlockIndex *pindex) { return false; }
199 bool CCoinsView::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) { return false; }
200 bool CCoinsView::GetStats(CCoinsStats &stats) { return false; }
202 CCoinsViewBacked::CCoinsViewBacked(CCoinsView &viewIn) : base(&viewIn) { }
203 bool CCoinsViewBacked::GetCoins(uint256 txid, CCoins &coins) { return base->GetCoins(txid, coins); }
204 bool CCoinsViewBacked::SetCoins(uint256 txid, const CCoins &coins) { return base->SetCoins(txid, coins); }
205 bool CCoinsViewBacked::HaveCoins(uint256 txid) { return base->HaveCoins(txid); }
206 CBlockIndex *CCoinsViewBacked::GetBestBlock() { return base->GetBestBlock(); }
207 bool CCoinsViewBacked::SetBestBlock(CBlockIndex *pindex) { return base->SetBestBlock(pindex); }
208 void CCoinsViewBacked::SetBackend(CCoinsView &viewIn) { base = &viewIn; }
209 bool CCoinsViewBacked::GetStats(CCoinsStats &stats) { return base->GetStats(stats); }
211 bool CCoinsViewBacked::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) { return base->BatchWrite(mapCoins, pindex); }
213 CCoinsViewCache::CCoinsViewCache(CCoinsView &baseIn, bool fDummy) : CCoinsViewBacked(baseIn), pindexTip(NULL) { }
215 bool CCoinsViewCache::GetCoins(uint256 txid, CCoins &coins) {
216 if (cacheCoins.count(txid)) {
217 coins = cacheCoins[txid];
220 if (base->GetCoins(txid, coins)) {
221 cacheCoins[txid] = coins;
227 // Select coins from read-only cache or database
228 bool CCoinsViewCache::GetCoinsReadOnly(uint256 txid, CCoins &coins) {
229 if (cacheCoins.count(txid)) {
230 coins = cacheCoins[txid]; // get from cache
233 if (cacheCoinsReadOnly.count(txid)) {
234 coins = cacheCoinsReadOnly[txid]; // get from read-only cache
237 if (base->GetCoins(txid, coins)) {
238 cacheCoinsReadOnly[txid] = coins; // save to read-only cache
244 std::map<uint256,CCoins>::iterator CCoinsViewCache::FetchCoins(uint256 txid) {
245 std::map<uint256,CCoins>::iterator it = cacheCoins.find(txid);
246 if (it != cacheCoins.end())
249 if (!base->GetCoins(txid,tmp))
251 std::pair<std::map<uint256,CCoins>::iterator,bool> ret = cacheCoins.insert(std::make_pair(txid, tmp));
255 CCoins &CCoinsViewCache::GetCoins(uint256 txid) {
256 std::map<uint256,CCoins>::iterator it = FetchCoins(txid);
257 assert(it != cacheCoins.end());
261 bool CCoinsViewCache::SetCoins(uint256 txid, const CCoins &coins) {
262 cacheCoins[txid] = coins;
266 bool CCoinsViewCache::HaveCoins(uint256 txid) {
267 return FetchCoins(txid) != cacheCoins.end();
270 CBlockIndex *CCoinsViewCache::GetBestBlock() {
271 if (pindexTip == NULL)
272 pindexTip = base->GetBestBlock();
276 bool CCoinsViewCache::SetBestBlock(CBlockIndex *pindex) {
281 bool CCoinsViewCache::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) {
282 for (std::map<uint256, CCoins>::const_iterator it = mapCoins.begin(); it != mapCoins.end(); it++)
283 cacheCoins[it->first] = it->second;
288 bool CCoinsViewCache::Flush() {
289 cacheCoinsReadOnly.clear(); // purge read-only cache
291 bool fOk = base->BatchWrite(cacheCoins, pindexTip);
297 unsigned int CCoinsViewCache::GetCacheSize() {
298 return cacheCoins.size();
301 /** CCoinsView that brings transactions from a memorypool into view.
302 It does not check for spendings by memory pool transactions. */
303 CCoinsViewMemPool::CCoinsViewMemPool(CCoinsView &baseIn, CTxMemPool &mempoolIn) : CCoinsViewBacked(baseIn), mempool(mempoolIn) { }
305 bool CCoinsViewMemPool::GetCoins(uint256 txid, CCoins &coins) {
306 if (base->GetCoins(txid, coins))
308 if (mempool.exists(txid)) {
309 const CTransaction &tx = mempool.lookup(txid);
310 coins = CCoins(tx, MEMPOOL_HEIGHT, -1);
316 bool CCoinsViewMemPool::HaveCoins(uint256 txid) {
317 return mempool.exists(txid) || base->HaveCoins(txid);
320 CCoinsViewCache *pcoinsTip = NULL;
321 CBlockTreeDB *pblocktree = NULL;
323 //////////////////////////////////////////////////////////////////////////////
325 // mapOrphanTransactions
328 bool AddOrphanTx(const CTransaction& tx)
330 uint256 hash = tx.GetHash();
331 if (mapOrphanTransactions.count(hash))
334 // Ignore big transactions, to avoid a
335 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
336 // large transaction with a missing parent then we assume
337 // it will rebroadcast it later, after the parent transaction(s)
338 // have been mined or received.
339 // 10,000 orphans, each of which is at most 5,000 bytes big is
340 // at most 500 megabytes of orphans:
342 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
346 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
350 mapOrphanTransactions[hash] = tx;
351 BOOST_FOREACH(const CTxIn& txin, tx.vin)
352 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
354 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
355 mapOrphanTransactions.size());
359 void static EraseOrphanTx(uint256 hash)
361 if (!mapOrphanTransactions.count(hash))
363 const CTransaction& tx = mapOrphanTransactions[hash];
364 BOOST_FOREACH(const CTxIn& txin, tx.vin)
366 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
367 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
368 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
370 mapOrphanTransactions.erase(hash);
373 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
375 unsigned int nEvicted = 0;
376 while (mapOrphanTransactions.size() > nMaxOrphans)
378 // Evict a random orphan:
379 uint256 randomhash = GetRandHash();
380 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
381 if (it == mapOrphanTransactions.end())
382 it = mapOrphanTransactions.begin();
383 EraseOrphanTx(it->first);
395 //////////////////////////////////////////////////////////////////////////////
400 bool CTransaction::IsStandard() const
402 if (nVersion > CTransaction::CURRENT_VERSION) {
406 BOOST_FOREACH(const CTxIn& txin, vin)
408 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
409 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
410 // ~65-byte public keys, plus a few script ops.
411 if (txin.scriptSig.size() > 500) {
414 if (!txin.scriptSig.IsPushOnly()) {
417 if (fEnforceCanonical && !txin.scriptSig.HasCanonicalPushes()) {
422 unsigned int nDataOut = 0;
423 txnouttype whichType;
424 BOOST_FOREACH(const CTxOut& txout, vout) {
425 if (!::IsStandard(txout.scriptPubKey, whichType)) {
428 if (whichType == TX_NULL_DATA)
431 if (txout.nValue == 0) {
434 if (fEnforceCanonical && !txout.scriptPubKey.HasCanonicalPushes()) {
440 // only one OP_RETURN txout is permitted
449 // Check transaction inputs, and make sure any
450 // pay-to-script-hash transactions are evaluating IsStandard scripts
452 // Why bother? To avoid denial-of-service attacks; an attacker
453 // can submit a standard HASH... OP_EQUAL transaction,
454 // which will get accepted into blocks. The redemption
455 // script can be anything; an attacker could use a very
456 // expensive-to-check-upon-redemption script like:
457 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
459 bool CTransaction::AreInputsStandard(CCoinsViewCache& mapInputs) const
462 return true; // Coinbases don't use vin normally
464 for (unsigned int i = 0; i < vin.size(); i++)
466 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
468 vector<vector<unsigned char> > vSolutions;
469 txnouttype whichType;
470 // get the scriptPubKey corresponding to this input:
471 const CScript& prevScript = prev.scriptPubKey;
472 if (!Solver(prevScript, whichType, vSolutions))
474 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
475 if (nArgsExpected < 0)
478 // Transactions with extra stuff in their scriptSigs are
479 // non-standard. Note that this EvalScript() call will
480 // be quick, because if there are any operations
481 // beside "push data" in the scriptSig the
482 // IsStandard() call returns false
483 vector<vector<unsigned char> > stack;
484 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
487 if (whichType == TX_SCRIPTHASH)
491 CScript subscript(stack.back().begin(), stack.back().end());
492 vector<vector<unsigned char> > vSolutions2;
493 txnouttype whichType2;
494 if (!Solver(subscript, whichType2, vSolutions2))
496 if (whichType2 == TX_SCRIPTHASH)
500 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
503 nArgsExpected += tmpExpected;
506 if (stack.size() != (unsigned int)nArgsExpected)
514 CTransaction::GetLegacySigOpCount() const
516 unsigned int nSigOps = 0;
517 BOOST_FOREACH(const CTxIn& txin, vin)
519 nSigOps += txin.scriptSig.GetSigOpCount(false);
521 BOOST_FOREACH(const CTxOut& txout, vout)
523 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
529 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
539 if (pblock == NULL) {
541 if (pcoinsTip->GetCoins(GetHash(), coins)) {
542 CBlockIndex *pindex = FindBlockByHeight(coins.nHeight);
544 if (!blockTmp.ReadFromDisk(pindex))
552 // Update the tx's hashBlock
553 hashBlock = pblock->GetHash();
555 // Locate the transaction
556 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
557 if (pblock->vtx[nIndex] == *(CTransaction*)this)
559 if (nIndex == (int)pblock->vtx.size())
561 vMerkleBranch.clear();
563 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
567 // Fill in merkle branch
568 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
572 // Is the tx in a block that's in the main chain
573 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
574 if (mi == mapBlockIndex.end())
576 CBlockIndex* pindex = (*mi).second;
577 if (!pindex || !pindex->IsInMainChain())
580 return pindexBest->nHeight - pindex->nHeight + 1;
583 bool CTransaction::CheckTransaction() const
585 // Basic checks that don't depend on any context
587 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
589 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
591 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
592 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
594 // Check for negative or overflow output values
596 for (unsigned int i = 0; i < vout.size(); i++)
598 const CTxOut& txout = vout[i];
599 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
600 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
602 // Enforce minimum output amount for user transactions until 1 May 2014 04:00:00 GMT
603 if (!fTestNet && !IsCoinBase() && !txout.IsEmpty() && nTime < OUTPUT_SWITCH_TIME && txout.nValue < MIN_TXOUT_AMOUNT)
604 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
606 if (txout.nValue < 0)
607 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
608 if (txout.nValue > MAX_MONEY)
609 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
610 nValueOut += txout.nValue;
611 if (!MoneyRange(nValueOut))
612 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
615 // Check for duplicate inputs
616 set<COutPoint> vInOutPoints;
617 BOOST_FOREACH(const CTxIn& txin, vin)
619 if (vInOutPoints.count(txin.prevout))
621 vInOutPoints.insert(txin.prevout);
626 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
627 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
631 BOOST_FOREACH(const CTxIn& txin, vin)
632 if (txin.prevout.IsNull())
633 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
639 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
640 enum GetMinFee_mode mode, unsigned int nBytes) const
642 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
643 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
645 unsigned int nNewBlockSize = nBlockSize + nBytes;
646 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
648 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
649 if (nMinFee < nBaseFee)
651 BOOST_FOREACH(const CTxOut& txout, vout)
652 if (txout.nValue < CENT)
656 // Raise the price as the block approaches full
657 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
659 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
661 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
664 if (!MoneyRange(nMinFee))
669 void CTxMemPool::pruneSpent(const uint256 &hashTx, CCoins &coins)
673 std::map<COutPoint, CInPoint>::iterator it = mapNextTx.lower_bound(COutPoint(hashTx, 0));
675 // iterate over all COutPoints in mapNextTx whose hash equals the provided hashTx
676 while (it != mapNextTx.end() && it->first.hash == hashTx) {
677 coins.Spend(it->first.n); // and remove those outputs from coins
682 bool CTxMemPool::accept(CTransaction &tx, bool fCheckInputs, bool* pfMissingInputs)
685 *pfMissingInputs = false;
687 if (!tx.CheckTransaction())
688 return error("CTxMemPool::accept() : CheckTransaction failed");
690 // Coinbase is only valid in a block, not as a loose transaction
692 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
694 // Coinstake is also only valid in a block, not as a loose transaction
695 if (tx.IsCoinStake())
696 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
698 // To help v0.1.5 clients who would see it as a negative number
699 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
700 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
702 // Rather not work on nonstandard transactions (unless -testnet)
703 if (!fTestNet && !tx.IsStandard())
704 return error("CTxMemPool::accept() : nonstandard transaction type");
706 // is it already in the memory pool?
707 uint256 hash = tx.GetHash();
710 if (mapTx.count(hash))
714 // Check for conflicts with in-memory transactions
715 CTransaction* ptxOld = NULL;
716 for (unsigned int i = 0; i < tx.vin.size(); i++)
718 COutPoint outpoint = tx.vin[i].prevout;
719 if (mapNextTx.count(outpoint))
721 // Disable replacement feature for now
724 // Allow replacing with a newer version of the same transaction
727 ptxOld = mapNextTx[outpoint].ptx;
728 if (ptxOld->IsFinal())
730 if (!tx.IsNewerThan(*ptxOld))
732 for (unsigned int i = 0; i < tx.vin.size(); i++)
734 COutPoint outpoint = tx.vin[i].prevout;
735 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
744 CCoinsViewCache &view = *pcoinsTip;
746 // do we already have it?
747 if (view.HaveCoins(hash))
750 // do all inputs exist?
751 BOOST_FOREACH(const CTxIn txin, tx.vin) {
752 if (!view.HaveCoins(txin.prevout.hash)) {
754 *pfMissingInputs = true;
759 if (!tx.HaveInputs(view))
760 return error("CTxMemPool::accept() : inputs already spent");
762 // Check for non-standard pay-to-script-hash in inputs
763 if (!tx.AreInputsStandard(view) && !fTestNet)
764 return error("CTxMemPool::accept() : nonstandard transaction input");
766 // Note: if you modify this code to accept non-standard transactions, then
767 // you should add code here to check that the transaction does a
768 // reasonable number of ECDSA signature verifications.
770 int64 nFees = tx.GetValueIn(view)-tx.GetValueOut();
771 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
773 // Don't accept it if it can't get into a block
774 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY, nSize);
775 if (nFees < txMinFee)
776 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
777 hash.ToString().c_str(),
781 // Continuously rate-limit free transactions
782 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
783 // be annoying or make others' transactions take longer to confirm.
784 if (nFees < MIN_RELAY_TX_FEE)
786 static CCriticalSection cs;
787 static double dFreeCount;
788 static int64 nLastTime;
789 int64 nNow = GetTime();
793 // Use an exponentially decaying ~10-minute window:
794 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
796 // -limitfreerelay unit is thousand-bytes-per-minute
797 // At default rate it would take over a month to fill 1GB
798 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
799 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
801 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
806 // Check against previous transactions
807 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
808 if (!tx.CheckInputs(view, CS_ALWAYS, true, false))
810 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
814 // Store transaction in memory
819 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
822 addUnchecked(hash, tx);
825 ///// are we sure this is ok when loading transactions or restoring block txes
826 // If updated, erase old tx from wallet
828 EraseFromWallets(ptxOld->GetHash());
830 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
831 hash.ToString().substr(0,10).c_str(),
836 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
838 return mempool.accept(*this, fCheckInputs, pfMissingInputs);
841 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
843 // Add to memory pool without checking anything. Don't call this directly,
844 // call CTxMemPool::accept to properly check the transaction first.
847 for (unsigned int i = 0; i < tx.vin.size(); i++)
848 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
849 nTransactionsUpdated++;
855 bool CTxMemPool::remove(CTransaction &tx)
857 // Remove transaction from memory pool
860 uint256 hash = tx.GetHash();
861 if (mapTx.count(hash))
863 BOOST_FOREACH(const CTxIn& txin, tx.vin)
864 mapNextTx.erase(txin.prevout);
866 nTransactionsUpdated++;
872 void CTxMemPool::clear()
877 ++nTransactionsUpdated;
880 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
885 vtxid.reserve(mapTx.size());
886 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
887 vtxid.push_back((*mi).first);
890 // Return depth of transaction in blockchain:
891 // -1 : not in blockchain, and not in memory pool (conflicted transaction)
892 // 0 : in memory pool, waiting to be included in a block
893 // >=1 : this many blocks deep in the main chain
894 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
896 bool fInMemPool = mempool.exists(GetHash());
898 if (hashBlock == 0 || nIndex == -1) {
899 return fInMemPool ? 0 : -1;
902 // Find the block it claims to be in
903 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
904 if (mi == mapBlockIndex.end()) {
905 return fInMemPool ? 0 : -1;
907 CBlockIndex* pindex = (*mi).second;
908 if (!pindex || !pindex->IsInMainChain()) {
909 return fInMemPool ? 0 : -1;
912 // Make sure the merkle branch connects to this block
913 if (!fMerkleVerified)
915 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot) {
916 return fInMemPool ? 0 : -1;
918 fMerkleVerified = true;
922 return pindexBest->nHeight - pindex->nHeight + 1;
925 int CMerkleTx::GetBlocksToMaturity() const
927 if (!(IsCoinBase() || IsCoinStake()))
929 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
933 bool CMerkleTx::AcceptToMemoryPool(bool fCheckInputs)
937 if (!IsInMainChain() && !ClientCheckInputs())
939 return CTransaction::AcceptToMemoryPool(false);
943 return CTransaction::AcceptToMemoryPool(fCheckInputs);
947 bool CWalletTx::AcceptWalletTransaction(bool fCheckInputs)
952 // Add previous supporting transactions first
953 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
955 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
957 uint256 hash = tx.GetHash();
958 if (!mempool.exists(hash) && pcoinsTip->HaveCoins(hash))
959 tx.AcceptToMemoryPool(fCheckInputs);
962 return AcceptToMemoryPool(fCheckInputs);
967 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
968 bool GetTransaction(const uint256 &hash, CTransaction &txOut, uint256 &hashBlock, bool fAllowSlow)
970 CBlockIndex *pindexSlow = NULL;
975 if (mempool.exists(hash))
977 txOut = mempool.lookup(hash);
982 if (fAllowSlow) { // use coin database to locate block that contains transaction, and scan it
985 CCoinsViewCache &view = *pcoinsTip;
987 if (view.GetCoins(hash, coins))
988 nHeight = coins.nHeight;
991 pindexSlow = FindBlockByHeight(nHeight);
997 if (block.ReadFromDisk(pindexSlow)) {
998 BOOST_FOREACH(const CTransaction &tx, block.vtx) {
999 if (tx.GetHash() == hash) {
1001 hashBlock = pindexSlow->GetBlockHash();
1012 //////////////////////////////////////////////////////////////////////////////
1014 // CBlock and CBlockIndex
1017 static CBlockIndex* pblockindexFBBHLast;
1018 CBlockIndex* FindBlockByHeight(int nHeight)
1020 CBlockIndex *pblockindex;
1021 if (nHeight < nBestHeight / 2)
1022 pblockindex = pindexGenesisBlock;
1024 pblockindex = pindexBest;
1025 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
1026 pblockindex = pblockindexFBBHLast;
1027 while (pblockindex->nHeight > nHeight)
1028 pblockindex = pblockindex->pprev;
1029 while (pblockindex->nHeight < nHeight)
1030 pblockindex = pblockindex->pnext;
1031 pblockindexFBBHLast = pblockindex;
1035 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1037 if (!fReadTransactions)
1039 *this = pindex->GetBlockHeader();
1042 if (!ReadFromDisk(pindex->GetBlockPos(), fReadTransactions))
1044 if (GetHash() != pindex->GetBlockHash())
1045 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1049 uint256 static GetOrphanRoot(const CBlock* pblock)
1051 // Work back to the first block in the orphan chain
1052 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1053 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1054 return pblock->GetHash();
1057 // ppcoin: find block wanted by given orphan block
1058 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1060 // Work back to the first block in the orphan chain
1061 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1062 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1063 return pblockOrphan->hashPrevBlock;
1066 // select stake target limit according to hard-coded conditions
1067 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1069 if(fTestNet) // separate proof of stake target limit for testnet
1070 return bnProofOfStakeLimit;
1071 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1072 return bnProofOfStakeLimit;
1073 if(nHeight + 1 > 15000) // 24 bits since block 15000
1074 return bnProofOfStakeLegacyLimit;
1075 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1076 return bnProofOfStakeHardLimit;
1078 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1081 // miner's coin base reward based on nBits
1082 int64 GetProofOfWorkReward(unsigned int nBits)
1084 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1087 bnTarget.SetCompact(nBits);
1088 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1089 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1091 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1092 // A reasonably continuous curve is used to avoid shock to market
1093 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1095 // Human readable form:
1097 // nSubsidy = 100 / (diff ^ 1/6)
1098 CBigNum bnLowerBound = CENT;
1099 CBigNum bnUpperBound = bnSubsidyLimit;
1100 while (bnLowerBound + CENT <= bnUpperBound)
1102 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1103 if (fDebug && GetBoolArg("-printcreation"))
1104 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1105 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1106 bnUpperBound = bnMidValue;
1108 bnLowerBound = bnMidValue;
1111 int64 nSubsidy = bnUpperBound.getuint64();
1113 nSubsidy = (nSubsidy / CENT) * CENT;
1114 if (fDebug && GetBoolArg("-printcreation"))
1115 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1117 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
1120 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1121 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1123 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1125 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1127 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1129 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1131 bnTarget.SetCompact(nBits);
1132 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1133 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1135 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1137 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1138 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1139 bnMidPart, bnRewardPart;
1141 while (bnLowerBound + CENT <= bnUpperBound)
1143 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1144 if (fDebug && GetBoolArg("-printcreation"))
1145 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1147 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1150 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1152 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1154 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1157 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1158 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1163 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1165 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1167 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1170 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1171 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1174 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1175 bnUpperBound = bnMidValue;
1177 bnLowerBound = bnMidValue;
1180 nRewardCoinYear = bnUpperBound.getuint64();
1181 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1185 // Old creation amount per coin-year, 5% fixed stake mint rate
1186 nRewardCoinYear = 5 * CENT;
1190 return nRewardCoinYear;
1192 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1194 // Set reasonable reward limit for large inputs since 20 Oct 2013
1196 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1197 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1199 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1200 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1202 nSubsidy = min(nSubsidy, nSubsidyLimit);
1205 if (fDebug && GetBoolArg("-printcreation"))
1206 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1210 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1212 // get proof of work blocks max spacing according to hard-coded conditions
1213 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1215 if(nTime > TARGETS_SWITCH_TIME)
1216 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1219 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1221 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1225 // maximum nBits value could possible be required nTime after
1227 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1230 bnResult.SetCompact(nBase);
1232 while (nTime > 0 && bnResult < bnTargetLimit)
1234 // Maximum 200% adjustment per day...
1236 nTime -= 24 * 60 * 60;
1238 if (bnResult > bnTargetLimit)
1239 bnResult = bnTargetLimit;
1240 return bnResult.GetCompact();
1244 // minimum amount of work that could possibly be required nTime after
1245 // minimum proof-of-work required was nBase
1247 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1249 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1253 // minimum amount of stake that could possibly be required nTime after
1254 // minimum proof-of-stake required was nBase
1256 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1258 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1262 // ppcoin: find last block index up to pindex
1263 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1265 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1266 pindex = pindex->pprev;
1270 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1272 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1274 if (pindexLast == NULL)
1275 return bnTargetLimit.GetCompact(); // genesis block
1277 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1278 if (pindexPrev->pprev == NULL)
1279 return bnTargetLimit.GetCompact(); // first block
1280 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1281 if (pindexPrevPrev->pprev == NULL)
1282 return bnTargetLimit.GetCompact(); // second block
1284 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1286 // ppcoin: target change every block
1287 // ppcoin: retarget with exponential moving toward target spacing
1289 bnNew.SetCompact(pindexPrev->nBits);
1290 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1291 int64 nInterval = nTargetTimespan / nTargetSpacing;
1292 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1293 bnNew /= ((nInterval + 1) * nTargetSpacing);
1295 if (bnNew > bnTargetLimit)
1296 bnNew = bnTargetLimit;
1298 return bnNew.GetCompact();
1301 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1304 bnTarget.SetCompact(nBits);
1307 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1308 return error("CheckProofOfWork() : nBits below minimum work");
1310 // Check proof of work matches claimed amount
1311 if (hash > bnTarget.getuint256())
1312 return error("CheckProofOfWork() : hash doesn't match nBits");
1317 // Return maximum amount of blocks that other nodes claim to have
1318 int GetNumBlocksOfPeers()
1320 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1323 bool IsInitialBlockDownload()
1325 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1327 static int64 nLastUpdate;
1328 static CBlockIndex* pindexLastBest;
1329 if (pindexBest != pindexLastBest)
1331 pindexLastBest = pindexBest;
1332 nLastUpdate = GetTime();
1334 return (GetTime() - nLastUpdate < 10 &&
1335 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1338 void static InvalidChainFound(CBlockIndex* pindexNew)
1340 if (pindexNew->nChainTrust > nBestInvalidTrust)
1342 nBestInvalidTrust = pindexNew->nChainTrust;
1343 pblocktree->WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1344 uiInterface.NotifyBlocksChanged();
1347 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1348 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1350 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1351 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1352 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1353 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1354 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1355 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1356 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1357 nBestBlockTrust.Get64(),
1358 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1361 void static InvalidBlockFound(CBlockIndex *pindex) {
1362 pindex->nStatus |= BLOCK_FAILED_VALID;
1363 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindex));
1364 setBlockIndexValid.erase(pindex);
1365 InvalidChainFound(pindex);
1367 ConnectBestBlock(); // reorganise away from the failed block
1370 bool ConnectBestBlock() {
1372 CBlockIndex *pindexNewBest;
1375 std::set<CBlockIndex*,CBlockIndexTrustComparator>::reverse_iterator it = setBlockIndexValid.rbegin();
1376 if (it == setBlockIndexValid.rend())
1378 pindexNewBest = *it;
1381 if (pindexNewBest == pindexBest)
1382 return true; // nothing to do
1385 CBlockIndex *pindexTest = pindexNewBest;
1386 std::vector<CBlockIndex*> vAttach;
1388 if (pindexTest->nStatus & BLOCK_FAILED_MASK) {
1389 // mark descendants failed
1390 CBlockIndex *pindexFailed = pindexNewBest;
1391 while (pindexTest != pindexFailed) {
1392 pindexFailed->nStatus |= BLOCK_FAILED_CHILD;
1393 setBlockIndexValid.erase(pindexFailed);
1394 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindexFailed));
1395 pindexFailed = pindexFailed->pprev;
1397 InvalidChainFound(pindexNewBest);
1401 if (pindexBest == NULL || pindexTest->nChainTrust > pindexBest->nChainTrust)
1402 vAttach.push_back(pindexTest);
1404 if (pindexTest->pprev == NULL || pindexTest->pnext != NULL) {
1405 reverse(vAttach.begin(), vAttach.end());
1406 BOOST_FOREACH(CBlockIndex *pindexSwitch, vAttach)
1407 if (!SetBestChain(pindexSwitch))
1411 pindexTest = pindexTest->pprev;
1416 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1418 nTime = max(GetBlockTime(), GetAdjustedTime());
1421 const CTxOut &CTransaction::GetOutputFor(const CTxIn& input, CCoinsViewCache& view)
1423 const CCoins &coins = view.GetCoins(input.prevout.hash);
1424 assert(coins.IsAvailable(input.prevout.n));
1425 return coins.vout[input.prevout.n];
1428 int64 CTransaction::GetValueIn(CCoinsViewCache& inputs) const
1434 for (unsigned int i = 0; i < vin.size(); i++)
1435 nResult += GetOutputFor(vin[i], inputs).nValue;
1440 unsigned int CTransaction::GetP2SHSigOpCount(CCoinsViewCache& inputs) const
1445 unsigned int nSigOps = 0;
1446 for (unsigned int i = 0; i < vin.size(); i++)
1448 const CTxOut &prevout = GetOutputFor(vin[i], inputs);
1449 if (prevout.scriptPubKey.IsPayToScriptHash())
1450 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1455 bool CTransaction::UpdateCoins(CCoinsViewCache &inputs, CTxUndo &txundo, int nHeight, unsigned int nTimeStamp, const uint256 &txhash) const
1457 // mark inputs spent
1458 if (!IsCoinBase()) {
1459 BOOST_FOREACH(const CTxIn &txin, vin) {
1460 CCoins &coins = inputs.GetCoins(txin.prevout.hash);
1461 if (coins.nTime > nTimeStamp)
1462 return error("UpdateCoins() : timestamp violation");
1464 if (!coins.Spend(txin.prevout, undo))
1465 return error("UpdateCoins() : cannot spend input");
1466 txundo.vprevout.push_back(undo);
1471 if (!inputs.SetCoins(txhash, CCoins(*this, nHeight, nTimeStamp)))
1472 return error("UpdateCoins() : cannot update output");
1477 bool CTransaction::HaveInputs(CCoinsViewCache &inputs) const
1479 if (!IsCoinBase()) {
1480 // first check whether information about the prevout hash is available
1481 for (unsigned int i = 0; i < vin.size(); i++) {
1482 const COutPoint &prevout = vin[i].prevout;
1483 if (!inputs.HaveCoins(prevout.hash))
1487 // then check whether the actual outputs are available
1488 for (unsigned int i = 0; i < vin.size(); i++) {
1489 const COutPoint &prevout = vin[i].prevout;
1490 const CCoins &coins = inputs.GetCoins(prevout.hash);
1491 if (!coins.IsAvailable(prevout.n))
1498 bool CTransaction::CheckInputs(CCoinsViewCache &inputs, enum CheckSig_mode csmode, bool fStrictPayToScriptHash, bool fStrictEncodings, CBlock *pblock) const
1502 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1503 // for an attacker to attempt to split the network.
1504 if (!HaveInputs(inputs))
1505 return error("CheckInputs() : %s inputs unavailable", GetHash().ToString().substr(0,10).c_str());
1507 CBlockIndex *pindexBlock = inputs.GetBestBlock();
1510 for (unsigned int i = 0; i < vin.size(); i++)
1512 const COutPoint &prevout = vin[i].prevout;
1513 const CCoins &coins = inputs.GetCoins(prevout.hash);
1515 // If prev is coinbase or coinstake, check that it's matured
1516 if (coins.IsCoinBase() || coins.IsCoinStake()) {
1517 if (pindexBlock->nHeight - coins.nHeight < nCoinbaseMaturity)
1518 return error("CheckInputs() : tried to spend %s at depth %d", coins.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - coins.nHeight);
1521 // Check transaction timestamp
1522 if (coins.nTime > nTime)
1523 return DoS(100, error("CheckInputs() : transaction timestamp earlier than input transaction"));
1525 // Check for negative or overflow input values
1526 nValueIn += coins.vout[prevout.n].nValue;
1527 if (!MoneyRange(coins.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1528 return DoS(100, error("CheckInputs() : txin values out of range"));
1534 return error("CheckInputs() : %s is a coinstake, but no block specified", GetHash().ToString().substr(0,10).c_str());
1536 // Coin stake tx earns reward instead of paying fee
1538 if (!GetCoinAge(nCoinAge))
1539 return error("CheckInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1541 int64 nStakeReward = GetValueOut() - nValueIn;
1542 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pblock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1544 if (nStakeReward > nCalculatedStakeReward)
1545 return DoS(100, error("CheckInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1549 if (nValueIn < GetValueOut())
1550 return DoS(100, error("ChecktInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1552 // Tally transaction fees
1553 int64 nTxFee = nValueIn - GetValueOut();
1555 return DoS(100, error("CheckInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1557 if (!MoneyRange(nFees))
1558 return DoS(100, error("CheckInputs() : nFees out of range"));
1560 // enforce transaction fees for every block until 1 May 2014 04:00:00 GMT
1561 if (!fTestNet && nTxFee < GetMinFee() && nTime < OUTPUT_SWITCH_TIME)
1562 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;
1565 // The first loop above does all the inexpensive checks.
1566 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1567 // Helps prevent CPU exhaustion attacks.
1569 // Skip ECDSA signature verification when connecting blocks
1570 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1571 // still computed and checked, and any change will be caught at the next checkpoint.
1572 if (csmode == CS_ALWAYS ||
1573 (csmode == CS_AFTER_CHECKPOINT && inputs.GetBestBlock()->nHeight >= Checkpoints::GetTotalBlocksEstimate())) {
1574 for (unsigned int i = 0; i < vin.size(); i++) {
1575 const COutPoint &prevout = vin[i].prevout;
1576 const CCoins &coins = inputs.GetCoins(prevout.hash);
1579 if (!VerifySignature(coins, *this, i, fStrictPayToScriptHash, fStrictEncodings, 0)) {
1580 // only during transition phase for P2SH: do not invoke anti-DoS code for
1581 // potentially old clients relaying bad P2SH transactions
1582 if (fStrictPayToScriptHash && VerifySignature(coins, *this, i, false, fStrictEncodings, 0))
1583 return error("CheckInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1585 return DoS(100,error("CheckInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1595 bool CTransaction::ClientCheckInputs() const
1600 // Take over previous transactions' spent pointers
1604 for (unsigned int i = 0; i < vin.size(); i++)
1606 // Get prev tx from single transactions in memory
1607 COutPoint prevout = vin[i].prevout;
1608 if (!mempool.exists(prevout.hash))
1610 CTransaction& txPrev = mempool.lookup(prevout.hash);
1612 if (prevout.n >= txPrev.vout.size())
1616 if (!VerifySignature(CCoins(txPrev, -1, -1), *this, i, true, false, 0))
1617 return error("ConnectInputs() : VerifySignature failed");
1619 ///// this is redundant with the mempool.mapNextTx stuff,
1620 ///// not sure which I want to get rid of
1621 ///// this has to go away now that posNext is gone
1622 // // Check for conflicts
1623 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1624 // return error("ConnectInputs() : prev tx already used");
1626 // // Flag outpoints as used
1627 // txPrev.vout[prevout.n].posNext = posThisTx;
1629 nValueIn += txPrev.vout[prevout.n].nValue;
1631 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1632 return error("ClientConnectInputs() : txin values out of range");
1634 if (GetValueOut() > nValueIn)
1641 bool CBlock::DisconnectBlock(CBlockIndex *pindex, CCoinsViewCache &view)
1643 assert(pindex == view.GetBestBlock());
1645 CBlockUndo blockUndo;
1647 CDiskBlockPos pos = pindex->GetUndoPos();
1649 return error("DisconnectBlock() : no undo data available");
1650 FILE *file = OpenUndoFile(pos, true);
1652 return error("DisconnectBlock() : undo file not available");
1653 CAutoFile fileUndo(file, SER_DISK, CLIENT_VERSION);
1654 fileUndo >> blockUndo;
1657 assert(blockUndo.vtxundo.size() + 1 == vtx.size());
1659 // undo transactions in reverse order
1660 for (int i = vtx.size() - 1; i >= 0; i--) {
1661 const CTransaction &tx = vtx[i];
1662 uint256 hash = tx.GetHash();
1664 // don't check coinbase coins for proof-of-stake block
1665 if(IsProofOfStake() && tx.IsCoinBase())
1668 // check that all outputs are available
1669 if (!view.HaveCoins(hash))
1670 return error("DisconnectBlock() : outputs still spent? database corrupted");
1671 CCoins &outs = view.GetCoins(hash);
1673 CCoins outsBlock = CCoins(tx, pindex->nHeight, pindex->nTime);
1674 if (outs != outsBlock)
1675 return error("DisconnectBlock() : added transaction mismatch? database corrupted");
1681 if (i > 0) { // not coinbases
1682 const CTxUndo &txundo = blockUndo.vtxundo[i-1];
1683 assert(txundo.vprevout.size() == tx.vin.size());
1684 for (unsigned int j = tx.vin.size(); j-- > 0;) {
1685 const COutPoint &out = tx.vin[j].prevout;
1686 const CTxInUndo &undo = txundo.vprevout[j];
1688 view.GetCoins(out.hash, coins); // this can fail if the prevout was already entirely spent
1689 if (coins.IsPruned()) {
1690 if (undo.nHeight == 0)
1691 return error("DisconnectBlock() : undo data doesn't contain tx metadata? database corrupted");
1692 coins.fCoinBase = undo.fCoinBase;
1693 coins.fCoinStake = undo.fCoinStake;
1694 coins.nHeight = undo.nHeight;
1695 coins.nTime = undo.nTime;
1696 coins.nBlockTime = undo.nBlockTime;
1697 coins.nVersion = undo.nVersion;
1699 if (undo.nHeight != 0)
1700 return error("DisconnectBlock() : undo data contains unneeded tx metadata? database corrupted");
1702 if (coins.IsAvailable(out.n))
1703 return error("DisconnectBlock() : prevout output not spent? database corrupted");
1704 if (coins.vout.size() < out.n+1)
1705 coins.vout.resize(out.n+1);
1706 coins.vout[out.n] = undo.txout;
1707 if (!view.SetCoins(out.hash, coins))
1708 return error("DisconnectBlock() : cannot restore coin inputs");
1712 // clean up wallet after disconnecting coinstake
1713 SyncWithWallets(vtx[i].GetHash(), vtx[i], this, false, false);
1716 // move best block pointer to prevout block
1717 view.SetBestBlock(pindex->pprev);
1722 bool FindUndoPos(int nFile, CDiskBlockPos &pos, unsigned int nAddSize);
1724 bool CBlock::ConnectBlock(CBlockIndex* pindex, CCoinsViewCache &view, bool fJustCheck)
1726 // Check it again in case a previous version let a bad block in
1727 if (!CheckBlock(!fJustCheck, !fJustCheck))
1730 // verify that the view's current state corresponds to the previous block
1731 assert(pindex->pprev == view.GetBestBlock());
1733 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1734 // unless those are already completely spent.
1735 // If such overwrites are allowed, coinbases and transactions depending upon those
1736 // can be duplicated to remove the ability to spend the first instance -- even after
1737 // being sent to another address.
1738 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1739 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1740 // already refuses previously-known transaction ids entirely.
1741 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1742 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1743 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1744 // initial block download.
1745 bool fEnforceBIP30 = true;
1747 if (fEnforceBIP30) {
1748 for (unsigned int i=0; i<vtx.size(); i++) {
1749 uint256 hash = GetTxHash(i);
1750 if (view.HaveCoins(hash) && !view.GetCoins(hash).IsPruned())
1751 return error("ConnectBlock() : tried to overwrite transaction");
1755 // BIP16 always active
1756 bool fStrictPayToScriptHash = true;
1758 CBlockUndo blockundo;
1760 int64 nFees = 0, nValueIn = 0, nValueOut = 0;
1761 unsigned int nSigOps = 0;
1762 for (unsigned int i=0; i<vtx.size(); i++)
1764 const CTransaction &tx = vtx[i];
1765 nSigOps += tx.GetLegacySigOpCount();
1766 if (nSigOps > MAX_BLOCK_SIGOPS)
1767 return DoS(100, error("ConnectBlock() : too many sigops"));
1769 if (!tx.IsCoinBase())
1771 if (!tx.HaveInputs(view))
1772 return DoS(100, error("ConnectBlock() : inputs missing/spent"));
1774 if (fStrictPayToScriptHash)
1776 // Add in sigops done by pay-to-script-hash inputs;
1777 // this is to prevent a "rogue miner" from creating
1778 // an incredibly-expensive-to-validate block.
1779 nSigOps += tx.GetP2SHSigOpCount(view);
1780 if (nSigOps > MAX_BLOCK_SIGOPS)
1781 return DoS(100, error("ConnectBlock() : too many sigops"));
1784 int64 nTxValueOut = tx.GetValueOut();
1785 int64 nTxValueIn = tx.GetValueIn(view);
1787 nValueIn += nTxValueIn;
1788 nValueOut += nTxValueOut;
1790 if (!tx.IsCoinStake())
1791 nFees += nTxValueIn - nTxValueOut;
1793 if (!tx.CheckInputs(view, CS_AFTER_CHECKPOINT, fStrictPayToScriptHash, false, this))
1798 nValueOut += tx.GetValueOut();
1801 // don't create coinbase coins for proof-of-stake block
1802 if(IsProofOfStake() && tx.IsCoinBase())
1806 if (!tx.UpdateCoins(view, txundo, pindex->nHeight, pindex->nTime, GetTxHash(i)))
1807 return error("ConnectBlock() : UpdateInputs failed");
1808 if (!tx.IsCoinBase())
1809 blockundo.vtxundo.push_back(txundo);
1812 pindex->nMint = nValueOut - nValueIn + nFees;
1813 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1818 // Write undo information to disk
1819 if (pindex->GetUndoPos().IsNull() || (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_SCRIPTS)
1821 if (pindex->GetUndoPos().IsNull()) {
1823 if (!FindUndoPos(pindex->nFile, pos, ::GetSerializeSize(blockundo, SER_DISK, CLIENT_VERSION) + 8))
1824 return error("ConnectBlock() : FindUndoPos failed");
1825 if (!blockundo.WriteToDisk(pos))
1826 return error("ConnectBlock() : CBlockUndo::WriteToDisk failed");
1828 // update nUndoPos in block index
1829 pindex->nUndoPos = pos.nPos;
1830 pindex->nStatus |= BLOCK_HAVE_UNDO;
1833 pindex->nStatus = (pindex->nStatus & ~BLOCK_VALID_MASK) | BLOCK_VALID_SCRIPTS;
1835 CDiskBlockIndex blockindex(pindex);
1836 if (!pblocktree->WriteBlockIndex(blockindex))
1837 return error("ConnectBlock() : WriteBlockIndex failed");
1840 // add this block to the view's blockchain
1841 if (!view.SetBestBlock(pindex))
1844 // fees are destroyed to compensate the entire network
1845 if (fDebug && GetBoolArg("-printcreation"))
1846 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1848 // Watch for transactions paying to me
1849 for (unsigned int i=0; i<vtx.size(); i++)
1850 SyncWithWallets(GetTxHash(i), vtx[i], this, true);
1855 bool SetBestChain(CBlockIndex* pindexNew)
1857 CCoinsViewCache &view = *pcoinsTip;
1859 // special case for attaching the genesis block
1860 // note that no ConnectBlock is called, so its coinbase output is non-spendable
1861 if (pindexGenesisBlock == NULL && pindexNew->GetBlockHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1863 view.SetBestBlock(pindexNew);
1866 pindexGenesisBlock = pindexNew;
1867 pindexBest = pindexNew;
1868 hashBestChain = pindexNew->GetBlockHash();
1869 nBestHeight = pindexBest->nHeight;
1870 nBestChainTrust = pindexNew->nChainTrust;
1874 // Find the fork (typically, there is none)
1875 CBlockIndex* pfork = view.GetBestBlock();
1876 CBlockIndex* plonger = pindexNew;
1877 while (pfork != plonger)
1879 while (plonger->nHeight > pfork->nHeight)
1880 if (!(plonger = plonger->pprev))
1881 return error("SetBestChain() : plonger->pprev is null");
1882 if (pfork == plonger)
1884 if (!(pfork = pfork->pprev))
1885 return error("SetBestChain() : pfork->pprev is null");
1888 // List of what to disconnect (typically nothing)
1889 vector<CBlockIndex*> vDisconnect;
1890 for (CBlockIndex* pindex = view.GetBestBlock(); pindex != pfork; pindex = pindex->pprev)
1891 vDisconnect.push_back(pindex);
1893 // List of what to connect (typically only pindexNew)
1894 vector<CBlockIndex*> vConnect;
1895 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1896 vConnect.push_back(pindex);
1897 reverse(vConnect.begin(), vConnect.end());
1899 if (vDisconnect.size() > 0) {
1900 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());
1901 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());
1904 // Disconnect shorter branch
1905 vector<CTransaction> vResurrect;
1906 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect) {
1908 if (!block.ReadFromDisk(pindex))
1909 return error("SetBestChain() : ReadFromDisk for disconnect failed");
1910 CCoinsViewCache viewTemp(view, true);
1911 if (!block.DisconnectBlock(pindex, viewTemp))
1912 return error("SetBestChain() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1913 if (!viewTemp.Flush())
1914 return error("SetBestChain() : Cache flush failed after disconnect");
1916 // Queue memory transactions to resurrect
1917 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1918 if (!tx.IsCoinBase() && !tx.IsCoinStake())
1919 vResurrect.push_back(tx);
1922 // Connect longer branch
1923 vector<CTransaction> vDelete;
1924 BOOST_FOREACH(CBlockIndex *pindex, vConnect) {
1926 if (!block.ReadFromDisk(pindex))
1927 return error("SetBestChain() : ReadFromDisk for connect failed");
1928 CCoinsViewCache viewTemp(view, true);
1929 if (!block.ConnectBlock(pindex, viewTemp)) {
1930 InvalidChainFound(pindexNew);
1931 InvalidBlockFound(pindex);
1932 return error("SetBestChain() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1934 if (!viewTemp.Flush())
1935 return error("SetBestChain() : Cache flush failed after connect");
1937 // Queue memory transactions to delete
1938 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1939 vDelete.push_back(tx);
1942 // Make sure it's successfully written to disk before changing memory structure
1943 bool fIsInitialDownload = IsInitialBlockDownload();
1944 if (!fIsInitialDownload || view.GetCacheSize()>5000)
1948 // At this point, all changes have been done to the database.
1949 // Proceed by updating the memory structures.
1951 // Disconnect shorter branch
1952 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1954 pindex->pprev->pnext = NULL;
1956 // Connect longer branch
1957 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1959 pindex->pprev->pnext = pindex;
1961 // Resurrect memory transactions that were in the disconnected branch
1962 BOOST_FOREACH(CTransaction& tx, vResurrect)
1963 tx.AcceptToMemoryPool(false);
1965 // Delete redundant memory transactions that are in the connected branch
1966 BOOST_FOREACH(CTransaction& tx, vDelete)
1969 // Update best block in wallet (so we can detect restored wallets)
1970 if (!fIsInitialDownload)
1972 const CBlockLocator locator(pindexNew);
1973 ::SetBestChain(locator);
1977 hashBestChain = pindexNew->GetBlockHash();
1978 pindexBest = pindexNew;
1979 pblockindexFBBHLast = NULL;
1980 nBestHeight = pindexBest->nHeight;
1981 nBestChainTrust = pindexNew->nChainTrust;
1982 nTimeBestReceived = GetTime();
1983 nTransactionsUpdated++;
1985 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1987 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%s tx=%lu date=%s\n",
1988 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str(), CBigNum(nBestBlockTrust).ToString().c_str(), (unsigned long)pindexNew->nChainTx,
1989 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1991 // Check the version of the last 100 blocks to see if we need to upgrade:
1992 if (!fIsInitialDownload)
1995 const CBlockIndex* pindex = pindexBest;
1996 for (int i = 0; i < 100 && pindex != NULL; i++)
1998 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2000 pindex = pindex->pprev;
2003 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2004 if (nUpgraded > 100/2)
2005 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2006 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2009 std::string strCmd = GetArg("-blocknotify", "");
2011 if (!fIsInitialDownload && !strCmd.empty())
2013 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2014 boost::thread t(runCommand, strCmd); // thread runs free
2020 // Total coin age spent in transaction, in the unit of coin-days.
2021 // Only those coins meeting minimum age requirement counts. As those
2022 // transactions not in main chain are not currently indexed so we
2023 // might not find out about their coin age. Older transactions are
2024 // guaranteed to be in main chain by sync-checkpoint. This rule is
2025 // introduced to help nodes establish a consistent view of the coin
2026 // age (trust score) of competing branches.
2027 bool CTransaction::GetCoinAge(uint64& nCoinAge) const
2029 CCoinsViewCache &inputs = *pcoinsTip;
2031 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2037 for (unsigned int i = 0; i < vin.size(); i++)
2039 const COutPoint &prevout = vin[i].prevout;
2041 if (!inputs.GetCoins(prevout.hash, coins))
2044 if (nTime < coins.nTime)
2045 return false; // Transaction timestamp violation
2047 // only count coins meeting min age requirement
2048 if (coins.nBlockTime + nStakeMinAge > nTime)
2051 int64 nValueIn = coins.vout[vin[i].prevout.n].nValue;
2052 bnCentSecond += CBigNum(nValueIn) * (nTime-coins.nTime) / CENT;
2055 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2056 if (fDebug && GetBoolArg("-printcoinage"))
2057 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2058 nCoinAge = bnCoinDay.getuint64();
2062 // Total coin age spent in block, in the unit of coin-days.
2063 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2067 BOOST_FOREACH(const CTransaction& tx, vtx)
2070 if (tx.GetCoinAge(nTxCoinAge))
2071 nCoinAge += nTxCoinAge;
2076 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2078 if (fDebug && GetBoolArg("-printcoinage"))
2079 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2083 bool CBlock::AddToBlockIndex(const CDiskBlockPos &pos)
2085 // Check for duplicate
2086 uint256 hash = GetHash();
2087 if (mapBlockIndex.count(hash))
2088 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2090 // Construct new block index object
2091 CBlockIndex* pindexNew = new CBlockIndex(*this);
2093 return error("AddToBlockIndex() : new CBlockIndex failed");
2094 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2095 pindexNew->phashBlock = &((*mi).first);
2096 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2097 if (miPrev != mapBlockIndex.end())
2099 pindexNew->pprev = (*miPrev).second;
2100 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2102 pindexNew->nTx = vtx.size();
2103 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2104 pindexNew->nChainTx = (pindexNew->pprev ? pindexNew->pprev->nChainTx : 0) + pindexNew->nTx;
2105 pindexNew->nFile = pos.nFile;
2106 pindexNew->nDataPos = pos.nPos;
2107 pindexNew->nUndoPos = 0;
2108 pindexNew->nStatus = BLOCK_VALID_TRANSACTIONS | BLOCK_HAVE_DATA;
2110 // Compute stake entropy bit for stake modifier
2111 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2112 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2114 // Record proof-of-stake hash value
2115 if (pindexNew->IsProofOfStake())
2117 if (!mapProofOfStake.count(hash))
2118 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2119 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2122 // Compute stake modifier
2123 uint64 nStakeModifier = 0;
2124 bool fGeneratedStakeModifier = false;
2125 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2126 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2127 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2128 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2129 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2130 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2132 setBlockIndexValid.insert(pindexNew);
2134 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindexNew));
2137 if (!ConnectBestBlock())
2140 if (pindexNew == pindexBest)
2142 // Notify UI to display prev block's coinbase if it was ours
2143 static uint256 hashPrevBestCoinBase;
2144 UpdatedTransaction(hashPrevBestCoinBase);
2145 hashPrevBestCoinBase = GetTxHash(0);
2148 pblocktree->Flush();
2150 uiInterface.NotifyBlocksChanged();
2154 bool FindBlockPos(CDiskBlockPos &pos, unsigned int nAddSize, unsigned int nHeight, uint64 nTime)
2156 bool fUpdatedLast = false;
2158 LOCK(cs_LastBlockFile);
2160 while (infoLastBlockFile.nSize + nAddSize >= MAX_BLOCKFILE_SIZE) {
2161 printf("Leaving block file %i: %s\n", nLastBlockFile, infoLastBlockFile.ToString().c_str());
2162 FILE *file = OpenBlockFile(pos);
2165 file = OpenUndoFile(pos);
2169 infoLastBlockFile.SetNull();
2170 pblocktree->ReadBlockFileInfo(nLastBlockFile, infoLastBlockFile); // check whether data for the new file somehow already exist; can fail just fine
2171 fUpdatedLast = true;
2174 pos.nFile = nLastBlockFile;
2175 pos.nPos = infoLastBlockFile.nSize;
2176 infoLastBlockFile.nSize += nAddSize;
2177 infoLastBlockFile.AddBlock(nHeight, nTime);
2179 unsigned int nOldChunks = (pos.nPos + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2180 unsigned int nNewChunks = (infoLastBlockFile.nSize + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2181 if (nNewChunks > nOldChunks) {
2182 FILE *file = OpenBlockFile(pos);
2184 printf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks * BLOCKFILE_CHUNK_SIZE, pos.nFile);
2185 AllocateFileRange(file, pos.nPos, nNewChunks * BLOCKFILE_CHUNK_SIZE - pos.nPos);
2190 if (!pblocktree->WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2191 return error("FindBlockPos() : cannot write updated block info");
2193 pblocktree->WriteLastBlockFile(nLastBlockFile);
2198 bool FindUndoPos(int nFile, CDiskBlockPos &pos, unsigned int nAddSize)
2202 LOCK(cs_LastBlockFile);
2204 unsigned int nNewSize;
2205 if (nFile == nLastBlockFile) {
2206 pos.nPos = infoLastBlockFile.nUndoSize;
2207 nNewSize = (infoLastBlockFile.nUndoSize += nAddSize);
2208 if (!pblocktree->WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2209 return error("FindUndoPos() : cannot write updated block info");
2211 CBlockFileInfo info;
2212 if (!pblocktree->ReadBlockFileInfo(nFile, info))
2213 return error("FindUndoPos() : cannot read block info");
2214 pos.nPos = info.nUndoSize;
2215 nNewSize = (info.nUndoSize += nAddSize);
2216 if (!pblocktree->WriteBlockFileInfo(nFile, info))
2217 return error("FindUndoPos() : cannot write updated block info");
2220 unsigned int nOldChunks = (pos.nPos + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2221 unsigned int nNewChunks = (nNewSize + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2222 if (nNewChunks > nOldChunks) {
2223 FILE *file = OpenUndoFile(pos);
2225 printf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks * UNDOFILE_CHUNK_SIZE, pos.nFile);
2226 AllocateFileRange(file, pos.nPos, nNewChunks * UNDOFILE_CHUNK_SIZE - pos.nPos);
2234 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2236 // These are checks that are independent of context
2237 // that can be verified before saving an orphan block.
2240 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2241 return DoS(100, error("CheckBlock() : size limits failed"));
2243 // Check proof of work matches claimed amount
2244 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2245 return DoS(50, error("CheckBlock() : proof of work failed"));
2248 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
2249 return error("CheckBlock() : block timestamp too far in the future");
2251 // First transaction must be coinbase, the rest must not be
2252 if (vtx.empty() || !vtx[0].IsCoinBase())
2253 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2254 for (unsigned int i = 1; i < vtx.size(); i++)
2255 if (vtx[i].IsCoinBase())
2256 return DoS(100, error("CheckBlock() : more than one coinbase"));
2258 // Check coinbase timestamp
2259 if (GetBlockTime() > FutureDrift((int64)vtx[0].nTime))
2260 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2262 if (IsProofOfStake())
2264 // Coinbase output should be empty if proof-of-stake block
2265 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2266 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2268 // Second transaction must be coinstake, the rest must not be
2269 if (vtx.empty() || !vtx[1].IsCoinStake())
2270 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2271 for (unsigned int i = 2; i < vtx.size(); i++)
2272 if (vtx[i].IsCoinStake())
2273 return DoS(100, error("CheckBlock() : more than one coinstake"));
2275 // Check coinstake timestamp
2276 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2277 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2281 int64 nReward = GetProofOfWorkReward(nBits);
2282 // Check coinbase reward
2283 if (vtx[0].GetValueOut() > nReward)
2284 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2285 vtx[0].GetValueOut(),
2288 // Should we check proof-of-work block signature or not?
2290 // * Always skip on TestNet
2291 // * Perform checking for the first 9689 blocks
2292 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2294 if(!fTestNet && fCheckSig)
2296 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2298 // check legacy proof-of-work block signature
2299 if (checkEntropySig && !CheckLegacySignature())
2300 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2305 // Check transactions
2306 BOOST_FOREACH(const CTransaction& tx, vtx)
2308 if (!tx.CheckTransaction())
2309 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2311 // check transaction timestamp
2312 if (GetBlockTime() < (int64)tx.nTime)
2313 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2316 // Check for duplicate txids. This is caught by ConnectInputs(),
2317 // but catching it earlier avoids a potential DoS attack:
2319 set<uint256> uniqueTx;
2320 for (unsigned int i=0; i<vtx.size(); i++) {
2321 uniqueTx.insert(GetTxHash(i));
2323 if (uniqueTx.size() != vtx.size())
2324 return DoS(100, error("CheckBlock() : duplicate transaction"));
2326 unsigned int nSigOps = 0;
2327 BOOST_FOREACH(const CTransaction& tx, vtx)
2329 nSigOps += tx.GetLegacySigOpCount();
2331 if (nSigOps > MAX_BLOCK_SIGOPS)
2332 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2334 // Check merkle root
2335 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2336 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2342 bool CBlock::AcceptBlock()
2344 // Check for duplicate
2345 uint256 hash = GetHash();
2346 if (mapBlockIndex.count(hash))
2347 return error("AcceptBlock() : block already in mapBlockIndex");
2349 // Get prev block index
2350 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2351 if (mi == mapBlockIndex.end())
2352 return DoS(10, error("AcceptBlock() : prev block not found"));
2353 CBlockIndex* pindexPrev = (*mi).second;
2354 int nHeight = pindexPrev->nHeight+1;
2356 // Check proof-of-work or proof-of-stake
2357 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2358 return DoS(100, error("AcceptBlock() : incorrect proof-of-%s amount", IsProofOfWork() ? "work" : "stake"));
2360 // Check timestamp against prev
2361 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2362 return error("AcceptBlock() : block's timestamp is too early");
2364 // Check that all transactions are finalized
2365 BOOST_FOREACH(const CTransaction& tx, vtx)
2366 if (!tx.IsFinal(nHeight, GetBlockTime()))
2367 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2369 // Check that the block chain matches the known block chain up to a checkpoint
2370 if (!Checkpoints::CheckHardened(nHeight, hash))
2371 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2373 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2375 // Check that the block satisfies synchronized checkpoint
2376 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2377 return error("AcceptBlock() : rejected by synchronized checkpoint");
2379 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2380 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2382 // Enforce rule that the coinbase starts with serialized block height
2383 CScript expect = CScript() << nHeight;
2384 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2385 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2386 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2388 // Write block to history file
2389 unsigned int nBlockSize = ::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION);
2390 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2391 return error("AcceptBlock() : out of disk space");
2392 CDiskBlockPos blockPos;
2394 if (!FindBlockPos(blockPos, nBlockSize+8, nHeight, nTime))
2395 return error("AcceptBlock() : FindBlockPos failed");
2397 if (!WriteToDisk(blockPos))
2398 return error("AcceptBlock() : WriteToDisk failed");
2399 if (!AddToBlockIndex(blockPos))
2400 return error("AcceptBlock() : AddToBlockIndex failed");
2402 // Relay inventory, but don't relay old inventory during initial block download
2403 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2404 if (hashBestChain == hash)
2407 BOOST_FOREACH(CNode* pnode, vNodes)
2408 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2409 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2412 // Check pending sync-checkpoint
2413 Checkpoints::AcceptPendingSyncCheckpoint();
2418 uint256 CBlockIndex::GetBlockTrust() const
2421 bnTarget.SetCompact(nBits);
2427 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2428 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2432 // Calculate work amount for block
2433 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2435 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2436 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2438 // Return nPoWTrust for the first 12 blocks
2439 if (pprev == NULL || pprev->nHeight < 12)
2442 const CBlockIndex* currentIndex = pprev;
2444 if(IsProofOfStake())
2446 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2448 // Return 1/3 of score if parent block is not the PoW block
2449 if (!pprev->IsProofOfWork())
2450 return (bnNewTrust / 3).getuint256();
2454 // Check last 12 blocks type
2455 while (pprev->nHeight - currentIndex->nHeight < 12)
2457 if (currentIndex->IsProofOfWork())
2459 currentIndex = currentIndex->pprev;
2462 // Return 1/3 of score if less than 3 PoW blocks found
2464 return (bnNewTrust / 3).getuint256();
2466 return bnNewTrust.getuint256();
2470 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2472 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2473 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2474 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2478 // Check last 12 blocks type
2479 while (pprev->nHeight - currentIndex->nHeight < 12)
2481 if (currentIndex->IsProofOfStake())
2483 currentIndex = currentIndex->pprev;
2486 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2488 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2490 bnTarget.SetCompact(pprev->nBits);
2495 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2497 // Return nPoWTrust + full trust score for previous block nBits
2498 return nPoWTrust + bnNewTrust.getuint256();
2502 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2504 unsigned int nFound = 0;
2505 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2507 if (pstart->nVersion >= minVersion)
2509 pstart = pstart->pprev;
2511 return (nFound >= nRequired);
2514 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2516 // Check for duplicate
2517 uint256 hash = pblock->GetHash();
2518 if (mapBlockIndex.count(hash))
2519 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2520 if (mapOrphanBlocks.count(hash))
2521 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2523 // Preliminary checks
2524 if (!pblock->CheckBlock())
2525 return error("ProcessBlock() : CheckBlock FAILED");
2527 if (pblock->IsProofOfStake())
2529 // Limited duplicity on stake: prevents block flood attack
2530 // Duplicate stake allowed only when there is orphan child block
2531 if (setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2532 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());
2534 bool fFatal = false;
2535 uint256 hashProofOfStake;
2537 // Verify proof-of-stake script, hash target and signature
2538 if (!pblock->CheckSignature(fFatal, hashProofOfStake))
2542 // Invalid coinstake script, blockhash signature or no generator defined, nothing to do here
2543 // This also may occur when supplied proof-of-stake doesn't satisfy required target
2545 pfrom->Misbehaving(100);
2546 return error("ProcessBlock() : invalid signatures found in proof-of-stake block %s", hash.ToString().c_str());
2550 // Blockhash and coinstake signatures are OK but target checkings failed
2551 // This may occur during initial block download
2554 pfrom->Misbehaving(1); // Small DoS penalty
2556 printf("WARNING: ProcessBlock(): proof-of-stake target checkings failed for block %s, we'll try again later\n", hash.ToString().c_str());
2561 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2562 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2565 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2566 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2568 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2569 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2571 bnNewBlock.SetCompact(pblock->nBits);
2574 if (pblock->IsProofOfStake())
2575 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2577 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2579 if (bnNewBlock > bnRequired)
2582 pfrom->Misbehaving(100);
2583 return error("ProcessBlock() : block with too little proof-of-%s", pblock->IsProofOfStake() ? "stake" : "work");
2587 // Ask for pending sync-checkpoint if any
2588 if (!IsInitialBlockDownload())
2589 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2591 // If don't already have its previous block, shunt it off to holding area until we get it
2592 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2594 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2595 CBlock* pblock2 = new CBlock(*pblock);
2597 if (pblock2->IsProofOfStake())
2599 // Limited duplicity on stake: prevents block flood attack
2600 // Duplicate stake allowed only when there is orphan child block
2601 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2602 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());
2604 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2607 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2608 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2610 // Ask this guy to fill in what we're missing
2613 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2614 // ppcoin: getblocks may not obtain the ancestor block rejected
2615 // earlier by duplicate-stake check so we ask for it again directly
2616 if (!IsInitialBlockDownload())
2617 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2623 if (!pblock->AcceptBlock())
2624 return error("ProcessBlock() : AcceptBlock FAILED");
2626 // Recursively process any orphan blocks that depended on this one
2627 vector<uint256> vWorkQueue;
2628 vWorkQueue.push_back(hash);
2629 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2631 uint256 hashPrev = vWorkQueue[i];
2632 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2633 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2636 CBlock* pblockOrphan = (*mi).second;
2637 if (pblockOrphan->AcceptBlock())
2638 vWorkQueue.push_back(pblockOrphan->GetHash());
2639 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2640 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2641 delete pblockOrphan;
2643 mapOrphanBlocksByPrev.erase(hashPrev);
2646 printf("ProcessBlock: ACCEPTED\n");
2648 // ppcoin: if responsible for sync-checkpoint send it
2649 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2650 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2655 // attempt to generate suitable proof-of-stake
2656 bool CBlock::SignBlock(CWallet& wallet)
2658 // if we are trying to sign
2659 // something except proof-of-stake block template
2660 if (!vtx[0].vout[0].IsEmpty())
2663 // if we are trying to sign
2664 // a complete proof-of-stake block
2665 if (IsProofOfStake())
2668 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2671 CTransaction txCoinStake;
2672 int64 nSearchTime = txCoinStake.nTime; // search to current time
2674 if (nSearchTime > nLastCoinStakeSearchTime)
2676 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2678 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2680 // make sure coinstake would meet timestamp protocol
2681 // as it would be the same as the block timestamp
2682 vtx[0].nTime = nTime = txCoinStake.nTime;
2683 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2684 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2686 // we have to make sure that we have no future timestamps in
2687 // our transactions set
2688 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2689 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2691 vtx.insert(vtx.begin() + 1, txCoinStake);
2692 hashMerkleRoot = BuildMerkleTree();
2694 // append a signature to our block
2695 return key.Sign(GetHash(), vchBlockSig);
2698 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2699 nLastCoinStakeSearchTime = nSearchTime;
2705 // get generation key
2706 bool CBlock::GetGenerator(CKey& GeneratorKey) const
2708 if(!IsProofOfStake())
2711 vector<valtype> vSolutions;
2712 txnouttype whichType;
2714 const CTxOut& txout = vtx[1].vout[1];
2716 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2718 if (whichType == TX_PUBKEY)
2720 valtype& vchPubKey = vSolutions[0];
2722 return GeneratorKey.SetPubKey(vchPubKey);
2728 // verify proof-of-stake signatures
2729 bool CBlock::CheckSignature(bool& fFatal, uint256& hashProofOfStake) const
2733 // no generator or invalid hash signature means fatal error
2734 fFatal = !GetGenerator(key) || !key.Verify(GetHash(), vchBlockSig);
2739 uint256 hashTarget = 0;
2740 if (!CheckProofOfStake(vtx[1], nBits, hashProofOfStake, hashTarget, fFatal))
2741 return false; // hash target mismatch or invalid coinstake signature
2746 // verify legacy proof-of-work signature
2747 bool CBlock::CheckLegacySignature() const
2749 if (IsProofOfStake())
2752 vector<valtype> vSolutions;
2753 txnouttype whichType;
2755 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2757 const CTxOut& txout = vtx[0].vout[i];
2759 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2762 if (whichType == TX_PUBKEY)
2765 valtype& vchPubKey = vSolutions[0];
2767 if (!key.SetPubKey(vchPubKey))
2769 if (vchBlockSig.empty())
2771 if(!key.Verify(GetHash(), vchBlockSig))
2780 // entropy bit for stake modifier if chosen by modifier
2781 unsigned int CBlock::GetStakeEntropyBit(unsigned int nTime) const
2783 // Protocol switch at novacoin block #9689
2784 if (nTime >= ENTROPY_SWITCH_TIME || fTestNet)
2786 // Take last bit of block hash as entropy bit
2787 unsigned int nEntropyBit = ((GetHash().Get64()) & 1llu);
2788 if (fDebug && GetBoolArg("-printstakemodifier"))
2789 printf("GetStakeEntropyBit: nTime=%u hashBlock=%s nEntropyBit=%u\n", nTime, GetHash().ToString().c_str(), nEntropyBit);
2792 // Before novacoin block #9689 - old protocol
2793 uint160 hashSig = Hash160(vchBlockSig);
2794 if (fDebug && GetBoolArg("-printstakemodifier"))
2795 printf("GetStakeEntropyBit: hashSig=%s", hashSig.ToString().c_str());
2796 hashSig >>= 159; // take the first bit of the hash
2797 if (fDebug && GetBoolArg("-printstakemodifier"))
2798 printf(" entropybit=%"PRI64d"\n", hashSig.Get64());
2799 return hashSig.Get64();
2802 bool CheckDiskSpace(uint64 nAdditionalBytes)
2804 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2806 // Check for nMinDiskSpace bytes (currently 50MB)
2807 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2810 string strMessage = _("Warning: Disk space is low!");
2811 strMiscWarning = strMessage;
2812 printf("*** %s\n", strMessage.c_str());
2813 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2821 CCriticalSection cs_LastBlockFile;
2822 CBlockFileInfo infoLastBlockFile;
2823 int nLastBlockFile = 0;
2825 FILE* OpenDiskFile(const CDiskBlockPos &pos, const char *prefix, bool fReadOnly)
2829 boost::filesystem::path path = GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix, pos.nFile);
2830 boost::filesystem::create_directories(path.parent_path());
2831 FILE* file = fopen(path.string().c_str(), "rb+");
2832 if (!file && !fReadOnly)
2833 file = fopen(path.string().c_str(), "wb+");
2835 printf("Unable to open file %s\n", path.string().c_str());
2839 if (fseek(file, pos.nPos, SEEK_SET)) {
2840 printf("Unable to seek to position %u of %s\n", pos.nPos, path.string().c_str());
2848 FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly) {
2849 return OpenDiskFile(pos, "blk", fReadOnly);
2852 FILE *OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly) {
2853 return OpenDiskFile(pos, "rev", fReadOnly);
2856 CBlockIndex * InsertBlockIndex(uint256 hash)
2862 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
2863 if (mi != mapBlockIndex.end())
2864 return (*mi).second;
2867 CBlockIndex* pindexNew = new CBlockIndex();
2869 throw runtime_error("InsertBlockIndex() : new CBlockIndex failed");
2870 mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2871 pindexNew->phashBlock = &((*mi).first);
2876 bool static LoadBlockIndexDB()
2878 if (!pblocktree->LoadBlockIndexGuts())
2881 if (fRequestShutdown)
2884 // Calculate nChainTrust
2885 vector<pair<int, CBlockIndex*> > vSortedByHeight;
2886 vSortedByHeight.reserve(mapBlockIndex.size());
2887 BOOST_FOREACH(const PAIRTYPE(uint256, CBlockIndex*)& item, mapBlockIndex)
2889 CBlockIndex* pindex = item.second;
2890 vSortedByHeight.push_back(make_pair(pindex->nHeight, pindex));
2892 sort(vSortedByHeight.begin(), vSortedByHeight.end());
2893 BOOST_FOREACH(const PAIRTYPE(int, CBlockIndex*)& item, vSortedByHeight)
2895 CBlockIndex* pindex = item.second;
2896 pindex->nChainTrust = (pindex->pprev ? pindex->pprev->nChainTrust : 0) + pindex->GetBlockTrust();
2897 pindex->nChainTx = (pindex->pprev ? pindex->pprev->nChainTx : 0) + pindex->nTx;
2898 if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TRANSACTIONS && !(pindex->nStatus & BLOCK_FAILED_MASK))
2899 setBlockIndexValid.insert(pindex);
2901 // Calculate stake modifier checksum
2902 pindex->nStakeModifierChecksum = GetStakeModifierChecksum(pindex);
2903 if (!CheckStakeModifierCheckpoints(pindex->nHeight, pindex->nStakeModifierChecksum))
2904 return error("LoadBlockIndexDB() : Failed stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindex->nHeight, pindex->nStakeModifier);
2907 // Load block file info
2908 pblocktree->ReadLastBlockFile(nLastBlockFile);
2909 printf("LoadBlockIndexDB(): last block file = %i\n", nLastBlockFile);
2910 if (pblocktree->ReadBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2911 printf("LoadBlockIndexDB(): last block file: %s\n", infoLastBlockFile.ToString().c_str());
2913 // Load hashBestChain pointer to end of best chain
2914 pindexBest = pcoinsTip->GetBestBlock();
2915 if (pindexBest == NULL)
2917 if (pindexGenesisBlock == NULL)
2919 return error("LoadBlockIndexDB() : hashBestChain not loaded");
2921 hashBestChain = pindexBest->GetBlockHash();
2922 nBestHeight = pindexBest->nHeight;
2923 nBestChainTrust = pindexBest->nChainTrust;
2925 // set 'next' pointers in best chain
2926 CBlockIndex *pindex = pindexBest;
2927 while(pindex != NULL && pindex->pprev != NULL) {
2928 CBlockIndex *pindexPrev = pindex->pprev;
2929 pindexPrev->pnext = pindex;
2930 pindex = pindexPrev;
2932 printf("LoadBlockIndexDB(): hashBestChain=%s height=%d date=%s\n",
2933 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2934 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2936 // Load sync-checkpoint
2937 if (!pblocktree->ReadSyncCheckpoint(Checkpoints::hashSyncCheckpoint))
2938 return error("LoadBlockIndexDB() : hashSyncCheckpoint not loaded");
2939 printf("LoadBlockIndexDB(): synchronized checkpoint %s\n", Checkpoints::hashSyncCheckpoint.ToString().c_str());
2941 // Load bnBestInvalidTrust, OK if it doesn't exist
2942 CBigNum bnBestInvalidTrust;
2943 pblocktree->ReadBestInvalidTrust(bnBestInvalidTrust);
2944 nBestInvalidTrust = bnBestInvalidTrust.getuint256();
2946 // Verify blocks in the best chain
2947 int nCheckLevel = GetArg("-checklevel", 1);
2948 int nCheckDepth = GetArg( "-checkblocks", 2500);
2949 if (nCheckDepth == 0)
2950 nCheckDepth = 1000000000; // suffices until the year 19000
2951 if (nCheckDepth > nBestHeight)
2952 nCheckDepth = nBestHeight;
2953 printf("Verifying last %i blocks at level %i\n", nCheckDepth, nCheckLevel);
2954 CBlockIndex* pindexFork = NULL;
2955 for (CBlockIndex* pindex = pindexBest; pindex && pindex->pprev; pindex = pindex->pprev)
2957 if (fRequestShutdown || pindex->nHeight < nBestHeight-nCheckDepth)
2960 if (!block.ReadFromDisk(pindex))
2961 return error("LoadBlockIndexDB() : block.ReadFromDisk failed");
2962 // check level 1: verify block validity
2963 if (nCheckLevel>0 && !block.CheckBlock())
2965 printf("LoadBlockIndexDB() : *** found bad block at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString().c_str());
2966 pindexFork = pindex->pprev;
2968 // TODO: stronger verifications
2970 if (pindexFork && !fRequestShutdown)
2973 return error("LoadBlockIndexDB(): chain database corrupted");
2980 bool LoadBlockIndex(bool fAllowNew)
2982 CBigNum bnTrustedModulus;
2986 pchMessageStart[0] = 0xcd;
2987 pchMessageStart[1] = 0xf2;
2988 pchMessageStart[2] = 0xc0;
2989 pchMessageStart[3] = 0xef;
2991 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2992 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2993 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2994 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2995 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2996 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
3000 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
3003 // Set up the Zerocoin Params object
3004 ZCParams = new libzerocoin::Params(bnTrustedModulus);
3007 // Load block index from databases
3009 if (!LoadBlockIndexDB())
3013 // Init with genesis block
3015 if (mapBlockIndex.empty())
3024 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
3025 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
3026 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
3028 // vMerkleTree: 4cb33b3b6a
3032 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
3033 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
3034 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
3036 // vMerkleTree: 4cb33b3b6a
3038 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
3040 txNew.nTime = 1360105017;
3041 txNew.vin.resize(1);
3042 txNew.vout.resize(1);
3043 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
3044 txNew.vout[0].SetEmpty();
3046 block.vtx.push_back(txNew);
3047 block.hashPrevBlock = 0;
3048 block.hashMerkleRoot = block.BuildMerkleTree();
3050 block.nTime = 1360105017;
3051 block.nBits = bnProofOfWorkLimit.GetCompact();
3052 block.nNonce = !fTestNet ? 1575379 : 46534;
3055 uint256 hash = block.GetHash();
3056 printf("%s\n", hash.ToString().c_str());
3057 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
3059 assert(hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
3060 assert(block.CheckBlock());
3062 // Start new block file
3063 unsigned int nBlockSize = ::GetSerializeSize(block, SER_DISK, CLIENT_VERSION);
3064 CDiskBlockPos blockPos;
3065 if (!FindBlockPos(blockPos, nBlockSize+8, 0, block.nTime))
3066 return error("AcceptBlock() : FindBlockPos failed");
3067 if (!block.WriteToDisk(blockPos))
3068 return error("LoadBlockIndex() : writing genesis block to disk failed");
3069 if (!block.AddToBlockIndex(blockPos))
3070 return error("LoadBlockIndex() : genesis block not accepted");
3072 // initialize synchronized checkpoint
3073 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
3074 return error("LoadBlockIndex() : failed to init sync checkpoint");
3077 string strPubKey = "";
3078 // if checkpoint master key changed must reset sync-checkpoint
3079 if (!pblocktree->ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
3082 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3083 // write checkpoint master key to db
3084 if (!pblocktree->WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
3085 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
3088 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
3089 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
3095 void PrintBlockTree()
3097 // pre-compute tree structure
3098 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
3099 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
3101 CBlockIndex* pindex = (*mi).second;
3102 mapNext[pindex->pprev].push_back(pindex);
3104 //while (rand() % 3 == 0)
3105 // mapNext[pindex->pprev].push_back(pindex);
3108 vector<pair<int, CBlockIndex*> > vStack;
3109 vStack.push_back(make_pair(0, pindexGenesisBlock));
3112 while (!vStack.empty())
3114 int nCol = vStack.back().first;
3115 CBlockIndex* pindex = vStack.back().second;
3118 // print split or gap
3119 if (nCol > nPrevCol)
3121 for (int i = 0; i < nCol-1; i++)
3125 else if (nCol < nPrevCol)
3127 for (int i = 0; i < nCol; i++)
3134 for (int i = 0; i < nCol; i++)
3139 block.ReadFromDisk(pindex);
3140 printf("%d (blk%05u.dat:0x%x) %s tx %"PRIszu"",
3142 pindex->GetBlockPos().nFile, pindex->GetBlockPos().nPos,
3143 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
3146 PrintWallets(block);
3148 // put the main time-chain first
3149 vector<CBlockIndex*>& vNext = mapNext[pindex];
3150 for (unsigned int i = 0; i < vNext.size(); i++)
3152 if (vNext[i]->pnext)
3154 swap(vNext[0], vNext[i]);
3160 for (unsigned int i = 0; i < vNext.size(); i++)
3161 vStack.push_back(make_pair(nCol+i, vNext[i]));
3165 bool LoadExternalBlockFile(FILE* fileIn)
3167 int64 nStart = GetTimeMillis();
3173 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
3174 unsigned int nPos = 0;
3175 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
3177 unsigned char pchData[65536];
3179 fseek(blkdat, nPos, SEEK_SET);
3180 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
3183 nPos = (unsigned int)-1;
3186 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
3189 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
3191 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
3194 nPos += ((unsigned char*)nFind - pchData) + 1;
3197 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
3198 } while(!fRequestShutdown);
3199 if (nPos == (unsigned int)-1)
3201 fseek(blkdat, nPos, SEEK_SET);
3204 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3208 if (ProcessBlock(NULL,&block))
3216 catch (std::exception &e) {
3217 printf("%s() : Deserialize or I/O error caught during load\n",
3218 __PRETTY_FUNCTION__);
3221 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
3225 //////////////////////////////////////////////////////////////////////////////
3230 extern map<uint256, CAlert> mapAlerts;
3231 extern CCriticalSection cs_mapAlerts;
3233 extern string strMintMessage;
3234 extern string strMintWarning;
3236 string GetWarnings(string strFor)
3239 string strStatusBar;
3242 if (GetBoolArg("-testsafemode"))
3245 // ppcoin: wallet lock warning for minting
3246 if (strMintWarning != "")
3249 strStatusBar = strMintWarning;
3252 // Misc warnings like out of disk space and clock is wrong
3253 if (strMiscWarning != "")
3256 strStatusBar = strMiscWarning;
3259 // * Should not enter safe mode for longer invalid chain
3260 // * If sync-checkpoint is too old do not enter safe mode
3261 // * Display warning only in the STRICT mode
3262 if (CheckpointsMode == Checkpoints::STRICT && Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) &&
3263 !fTestNet && !IsInitialBlockDownload())
3266 strStatusBar = _("WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.");
3269 // ppcoin: if detected invalid checkpoint enter safe mode
3270 if (Checkpoints::hashInvalidCheckpoint != 0)
3273 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3279 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3281 const CAlert& alert = item.second;
3282 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3284 nPriority = alert.nPriority;
3285 strStatusBar = alert.strStatusBar;
3286 if (nPriority > 1000)
3287 strRPC = strStatusBar;
3292 if (strFor == "statusbar")
3293 return strStatusBar;
3294 else if (strFor == "rpc")
3296 assert(!"GetWarnings() : invalid parameter");
3307 //////////////////////////////////////////////////////////////////////////////
3313 bool static AlreadyHave(const CInv& inv)
3319 bool txInMap = false;
3322 txInMap = mempool.exists(inv.hash);
3324 return txInMap || mapOrphanTransactions.count(inv.hash) ||
3325 pcoinsTip->HaveCoins(inv.hash);
3328 return mapBlockIndex.count(inv.hash) ||
3329 mapOrphanBlocks.count(inv.hash);
3331 // Don't know what it is, just say we already got one
3338 // The message start string is designed to be unlikely to occur in normal data.
3339 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3340 // a large 4-byte int at any alignment.
3341 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3343 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3345 static map<CService, CPubKey> mapReuseKey;
3346 RandAddSeedPerfmon();
3348 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3349 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3351 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3355 if (strCommand == "version")
3357 // Each connection can only send one version message
3358 if (pfrom->nVersion != 0)
3360 pfrom->Misbehaving(1);
3368 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3369 if (pfrom->nVersion < MIN_PROTO_VERSION)
3371 // Since February 20, 2012, the protocol is initiated at version 209,
3372 // and earlier versions are no longer supported
3373 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3374 pfrom->fDisconnect = true;
3378 if (pfrom->nVersion == 10300)
3379 pfrom->nVersion = 300;
3381 vRecv >> addrFrom >> nNonce;
3383 vRecv >> pfrom->strSubVer;
3385 vRecv >> pfrom->nStartingHeight;
3387 if (pfrom->fInbound && addrMe.IsRoutable())
3389 pfrom->addrLocal = addrMe;
3393 // Disconnect if we connected to ourself
3394 if (nNonce == nLocalHostNonce && nNonce > 1)
3396 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3397 pfrom->fDisconnect = true;
3401 if (pfrom->nVersion < 60010)
3403 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3404 pfrom->fDisconnect = true;
3408 // record my external IP reported by peer
3409 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3410 addrSeenByPeer = addrMe;
3412 // Be shy and don't send version until we hear
3413 if (pfrom->fInbound)
3414 pfrom->PushVersion();
3416 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3418 AddTimeData(pfrom->addr, nTime);
3421 pfrom->PushMessage("verack");
3422 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3424 if (!pfrom->fInbound)
3426 // Advertise our address
3427 if (!fNoListen && !IsInitialBlockDownload())
3429 CAddress addr = GetLocalAddress(&pfrom->addr);
3430 if (addr.IsRoutable())
3431 pfrom->PushAddress(addr);
3434 // Get recent addresses
3435 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3437 pfrom->PushMessage("getaddr");
3438 pfrom->fGetAddr = true;
3440 addrman.Good(pfrom->addr);
3442 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3444 addrman.Add(addrFrom, addrFrom);
3445 addrman.Good(addrFrom);
3449 // Ask the first connected node for block updates
3450 static int nAskedForBlocks = 0;
3451 if (!pfrom->fClient && !pfrom->fOneShot &&
3452 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3453 (pfrom->nVersion < NOBLKS_VERSION_START ||
3454 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3455 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3458 pfrom->PushGetBlocks(pindexBest, uint256(0));
3464 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3465 item.second.RelayTo(pfrom);
3468 // Relay sync-checkpoint
3470 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3471 if (!Checkpoints::checkpointMessage.IsNull())
3472 Checkpoints::checkpointMessage.RelayTo(pfrom);
3475 pfrom->fSuccessfullyConnected = true;
3477 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());
3479 cPeerBlockCounts.input(pfrom->nStartingHeight);
3481 // ppcoin: ask for pending sync-checkpoint if any
3482 if (!IsInitialBlockDownload())
3483 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3487 else if (pfrom->nVersion == 0)
3489 // Must have a version message before anything else
3490 pfrom->Misbehaving(1);
3495 else if (strCommand == "verack")
3497 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3501 else if (strCommand == "addr")
3503 vector<CAddress> vAddr;
3506 // Don't want addr from older versions unless seeding
3507 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3509 if (vAddr.size() > 1000)
3511 pfrom->Misbehaving(20);
3512 return error("message addr size() = %"PRIszu"", vAddr.size());
3515 // Store the new addresses
3516 vector<CAddress> vAddrOk;
3517 int64 nNow = GetAdjustedTime();
3518 int64 nSince = nNow - 10 * 60;
3519 BOOST_FOREACH(CAddress& addr, vAddr)
3523 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3524 addr.nTime = nNow - 5 * 24 * 60 * 60;
3525 pfrom->AddAddressKnown(addr);
3526 bool fReachable = IsReachable(addr);
3527 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3529 // Relay to a limited number of other nodes
3532 // Use deterministic randomness to send to the same nodes for 24 hours
3533 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3534 static uint256 hashSalt;
3536 hashSalt = GetRandHash();
3537 uint64 hashAddr = addr.GetHash();
3538 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3539 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3540 multimap<uint256, CNode*> mapMix;
3541 BOOST_FOREACH(CNode* pnode, vNodes)
3543 if (pnode->nVersion < CADDR_TIME_VERSION)
3545 unsigned int nPointer;
3546 memcpy(&nPointer, &pnode, sizeof(nPointer));
3547 uint256 hashKey = hashRand ^ nPointer;
3548 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3549 mapMix.insert(make_pair(hashKey, pnode));
3551 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3552 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3553 ((*mi).second)->PushAddress(addr);
3556 // Do not store addresses outside our network
3558 vAddrOk.push_back(addr);
3560 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3561 if (vAddr.size() < 1000)
3562 pfrom->fGetAddr = false;
3563 if (pfrom->fOneShot)
3564 pfrom->fDisconnect = true;
3567 else if (strCommand == "inv")
3571 if (vInv.size() > MAX_INV_SZ)
3573 pfrom->Misbehaving(20);
3574 return error("message inv size() = %"PRIszu"", vInv.size());
3577 // find last block in inv vector
3578 unsigned int nLastBlock = (unsigned int)(-1);
3579 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3580 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3581 nLastBlock = vInv.size() - 1 - nInv;
3585 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3587 const CInv &inv = vInv[nInv];
3591 pfrom->AddInventoryKnown(inv);
3593 bool fAlreadyHave = AlreadyHave(inv);
3595 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3599 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3600 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3601 } else if (nInv == nLastBlock) {
3602 // In case we are on a very long side-chain, it is possible that we already have
3603 // the last block in an inv bundle sent in response to getblocks. Try to detect
3604 // this situation and push another getblocks to continue.
3605 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3607 printf("force request: %s\n", inv.ToString().c_str());
3610 // Track requests for our stuff
3611 Inventory(inv.hash);
3616 else if (strCommand == "getdata")
3620 if (vInv.size() > MAX_INV_SZ)
3622 pfrom->Misbehaving(20);
3623 return error("message getdata size() = %"PRIszu"", vInv.size());
3626 if (fDebugNet || (vInv.size() != 1))
3627 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3629 BOOST_FOREACH(const CInv& inv, vInv)
3633 if (fDebugNet || (vInv.size() == 1))
3634 printf("received getdata for: %s\n", inv.ToString().c_str());
3636 if (inv.type == MSG_BLOCK)
3638 // Send block from disk
3639 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3640 if (mi != mapBlockIndex.end())
3643 block.ReadFromDisk((*mi).second);
3644 pfrom->PushMessage("block", block);
3646 // Trigger them to send a getblocks request for the next batch of inventory
3647 if (inv.hash == pfrom->hashContinue)
3649 // ppcoin: send latest proof-of-work block to allow the
3650 // download node to accept as orphan (proof-of-stake
3651 // block might be rejected by stake connection check)
3653 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3654 pfrom->PushMessage("inv", vInv);
3655 pfrom->hashContinue = 0;
3659 else if (inv.IsKnownType())
3661 // Send stream from relay memory
3662 bool pushed = false;
3665 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3666 if (mi != mapRelay.end()) {
3667 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3671 if (!pushed && inv.type == MSG_TX) {
3673 if (mempool.exists(inv.hash)) {
3674 CTransaction tx = mempool.lookup(inv.hash);
3675 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3678 pfrom->PushMessage("tx", ss);
3683 // Track requests for our stuff
3684 Inventory(inv.hash);
3689 else if (strCommand == "getblocks")
3691 CBlockLocator locator;
3693 vRecv >> locator >> hashStop;
3695 // Find the last block the caller has in the main chain
3696 CBlockIndex* pindex = locator.GetBlockIndex();
3698 // Send the rest of the chain
3700 pindex = pindex->pnext;
3702 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3703 for (; pindex; pindex = pindex->pnext)
3705 if (pindex->GetBlockHash() == hashStop)
3707 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3708 // ppcoin: tell downloading node about the latest block if it's
3709 // without risk being rejected due to stake connection check
3710 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3711 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3714 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3717 // When this block is requested, we'll send an inv that'll make them
3718 // getblocks the next batch of inventory.
3719 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3720 pfrom->hashContinue = pindex->GetBlockHash();
3725 else if (strCommand == "checkpoint")
3727 CSyncCheckpoint checkpoint;
3728 vRecv >> checkpoint;
3730 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3733 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3735 BOOST_FOREACH(CNode* pnode, vNodes)
3736 checkpoint.RelayTo(pnode);
3740 else if (strCommand == "getheaders")
3742 CBlockLocator locator;
3744 vRecv >> locator >> hashStop;
3746 CBlockIndex* pindex = NULL;
3747 if (locator.IsNull())
3749 // If locator is null, return the hashStop block
3750 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3751 if (mi == mapBlockIndex.end())
3753 pindex = (*mi).second;
3757 // Find the last block the caller has in the main chain
3758 pindex = locator.GetBlockIndex();
3760 pindex = pindex->pnext;
3763 vector<CBlock> vHeaders;
3765 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3766 for (; pindex; pindex = pindex->pnext)
3768 vHeaders.push_back(pindex->GetBlockHeader());
3769 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3772 pfrom->PushMessage("headers", vHeaders);
3776 else if (strCommand == "tx")
3778 vector<uint256> vWorkQueue;
3779 vector<uint256> vEraseQueue;
3780 CDataStream vMsg(vRecv);
3784 CInv inv(MSG_TX, tx.GetHash());
3785 pfrom->AddInventoryKnown(inv);
3787 bool fMissingInputs = false;
3788 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
3790 SyncWithWallets(inv.hash, tx, NULL, true);
3791 RelayTransaction(tx, inv.hash);
3792 mapAlreadyAskedFor.erase(inv);
3793 vWorkQueue.push_back(inv.hash);
3794 vEraseQueue.push_back(inv.hash);
3796 // Recursively process any orphan transactions that depended on this one
3797 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3799 uint256 hashPrev = vWorkQueue[i];
3800 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3801 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3804 const uint256& orphanTxHash = *mi;
3805 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3806 bool fMissingInputs2 = false;
3808 if (orphanTx.AcceptToMemoryPool(true, &fMissingInputs2))
3810 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3811 SyncWithWallets(inv.hash, tx, NULL, true);
3812 RelayTransaction(orphanTx, orphanTxHash);
3813 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3814 vWorkQueue.push_back(orphanTxHash);
3815 vEraseQueue.push_back(orphanTxHash);
3817 else if (!fMissingInputs2)
3820 vEraseQueue.push_back(orphanTxHash);
3821 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3826 BOOST_FOREACH(uint256 hash, vEraseQueue)
3827 EraseOrphanTx(hash);
3829 else if (fMissingInputs)
3833 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3834 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3836 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3838 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3842 else if (strCommand == "block")
3846 uint256 hashBlock = block.GetHash();
3848 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3851 CInv inv(MSG_BLOCK, hashBlock);
3852 pfrom->AddInventoryKnown(inv);
3854 if (ProcessBlock(pfrom, &block))
3855 mapAlreadyAskedFor.erase(inv);
3856 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3860 else if (strCommand == "getaddr")
3862 // Don't return addresses older than nCutOff timestamp
3863 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3864 pfrom->vAddrToSend.clear();
3865 vector<CAddress> vAddr = addrman.GetAddr();
3866 BOOST_FOREACH(const CAddress &addr, vAddr)
3867 if(addr.nTime > nCutOff)
3868 pfrom->PushAddress(addr);
3872 else if (strCommand == "mempool")
3874 std::vector<uint256> vtxid;
3875 mempool.queryHashes(vtxid);
3877 for (unsigned int i = 0; i < vtxid.size(); i++) {
3878 CInv inv(MSG_TX, vtxid[i]);
3879 vInv.push_back(inv);
3880 if (i == (MAX_INV_SZ - 1))
3883 if (vInv.size() > 0)
3884 pfrom->PushMessage("inv", vInv);
3888 else if (strCommand == "checkorder")
3893 if (!GetBoolArg("-allowreceivebyip"))
3895 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3902 /// we have a chance to check the order here
3904 // Keep giving the same key to the same ip until they use it
3905 if (!mapReuseKey.count(pfrom->addr))
3906 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3908 // Send back approval of order and pubkey to use
3909 CScript scriptPubKey;
3910 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3911 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3915 else if (strCommand == "reply")
3920 CRequestTracker tracker;
3922 LOCK(pfrom->cs_mapRequests);
3923 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3924 if (mi != pfrom->mapRequests.end())
3926 tracker = (*mi).second;
3927 pfrom->mapRequests.erase(mi);
3930 if (!tracker.IsNull())
3931 tracker.fn(tracker.param1, vRecv);
3935 else if (strCommand == "ping")
3937 if (pfrom->nVersion > BIP0031_VERSION)
3941 // Echo the message back with the nonce. This allows for two useful features:
3943 // 1) A remote node can quickly check if the connection is operational
3944 // 2) Remote nodes can measure the latency of the network thread. If this node
3945 // is overloaded it won't respond to pings quickly and the remote node can
3946 // avoid sending us more work, like chain download requests.
3948 // The nonce stops the remote getting confused between different pings: without
3949 // it, if the remote node sends a ping once per second and this node takes 5
3950 // seconds to respond to each, the 5th ping the remote sends would appear to
3951 // return very quickly.
3952 pfrom->PushMessage("pong", nonce);
3957 else if (strCommand == "alert")
3962 uint256 alertHash = alert.GetHash();
3963 if (pfrom->setKnown.count(alertHash) == 0)
3965 if (alert.ProcessAlert())
3968 pfrom->setKnown.insert(alertHash);
3971 BOOST_FOREACH(CNode* pnode, vNodes)
3972 alert.RelayTo(pnode);
3976 // Small DoS penalty so peers that send us lots of
3977 // duplicate/expired/invalid-signature/whatever alerts
3978 // eventually get banned.
3979 // This isn't a Misbehaving(100) (immediate ban) because the
3980 // peer might be an older or different implementation with
3981 // a different signature key, etc.
3982 pfrom->Misbehaving(10);
3990 // Ignore unknown commands for extensibility
3994 // Update the last seen time for this node's address
3995 if (pfrom->fNetworkNode)
3996 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3997 AddressCurrentlyConnected(pfrom->addr);
4003 bool ProcessMessages(CNode* pfrom)
4005 CDataStream& vRecv = pfrom->vRecv;
4009 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
4013 // (4) message start
4022 // Don't bother if send buffer is too full to respond anyway
4023 if (pfrom->vSend.size() >= SendBufferSize())
4026 // Scan for message start
4027 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
4028 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
4029 if (vRecv.end() - pstart < nHeaderSize)
4031 if ((int)vRecv.size() > nHeaderSize)
4033 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
4034 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
4038 if (pstart - vRecv.begin() > 0)
4039 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
4040 vRecv.erase(vRecv.begin(), pstart);
4043 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
4048 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
4051 string strCommand = hdr.GetCommand();
4054 unsigned int nMessageSize = hdr.nMessageSize;
4055 if (nMessageSize > MAX_SIZE)
4057 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
4060 if (nMessageSize > vRecv.size())
4062 // Rewind and wait for rest of message
4063 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
4068 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
4069 unsigned int nChecksum = 0;
4070 memcpy(&nChecksum, &hash, sizeof(nChecksum));
4071 if (nChecksum != hdr.nChecksum)
4073 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
4074 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
4078 // Copy message to its own buffer
4079 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
4080 vRecv.ignore(nMessageSize);
4088 fRet = ProcessMessage(pfrom, strCommand, vMsg);
4093 catch (std::ios_base::failure& e)
4095 if (strstr(e.what(), "end of data"))
4097 // Allow exceptions from under-length message on vRecv
4098 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());
4100 else if (strstr(e.what(), "size too large"))
4102 // Allow exceptions from over-long size
4103 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
4107 PrintExceptionContinue(&e, "ProcessMessages()");
4110 catch (std::exception& e) {
4111 PrintExceptionContinue(&e, "ProcessMessages()");
4113 PrintExceptionContinue(NULL, "ProcessMessages()");
4117 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
4125 bool SendMessages(CNode* pto, bool fSendTrickle)
4127 TRY_LOCK(cs_main, lockMain);
4129 // Don't send anything until we get their version message
4130 if (pto->nVersion == 0)
4133 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
4135 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
4137 if (pto->nVersion > BIP0031_VERSION)
4138 pto->PushMessage("ping", nonce);
4140 pto->PushMessage("ping");
4143 // Resend wallet transactions that haven't gotten in a block yet
4144 ResendWalletTransactions();
4146 // Address refresh broadcast
4147 static int64 nLastRebroadcast;
4148 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
4152 BOOST_FOREACH(CNode* pnode, vNodes)
4154 // Periodically clear setAddrKnown to allow refresh broadcasts
4155 if (nLastRebroadcast)
4156 pnode->setAddrKnown.clear();
4158 // Rebroadcast our address
4161 CAddress addr = GetLocalAddress(&pnode->addr);
4162 if (addr.IsRoutable())
4163 pnode->PushAddress(addr);
4167 nLastRebroadcast = GetTime();
4175 vector<CAddress> vAddr;
4176 vAddr.reserve(pto->vAddrToSend.size());
4177 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
4179 // returns true if wasn't already contained in the set
4180 if (pto->setAddrKnown.insert(addr).second)
4182 vAddr.push_back(addr);
4183 // receiver rejects addr messages larger than 1000
4184 if (vAddr.size() >= 1000)
4186 pto->PushMessage("addr", vAddr);
4191 pto->vAddrToSend.clear();
4193 pto->PushMessage("addr", vAddr);
4198 // Message: inventory
4201 vector<CInv> vInvWait;
4203 LOCK(pto->cs_inventory);
4204 vInv.reserve(pto->vInventoryToSend.size());
4205 vInvWait.reserve(pto->vInventoryToSend.size());
4206 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4208 if (pto->setInventoryKnown.count(inv))
4211 // trickle out tx inv to protect privacy
4212 if (inv.type == MSG_TX && !fSendTrickle)
4214 // 1/4 of tx invs blast to all immediately
4215 static uint256 hashSalt;
4217 hashSalt = GetRandHash();
4218 uint256 hashRand = inv.hash ^ hashSalt;
4219 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4220 bool fTrickleWait = ((hashRand & 3) != 0);
4222 // always trickle our own transactions
4226 if (GetTransaction(inv.hash, wtx))
4228 fTrickleWait = true;
4233 vInvWait.push_back(inv);
4238 // returns true if wasn't already contained in the set
4239 if (pto->setInventoryKnown.insert(inv).second)
4241 vInv.push_back(inv);
4242 if (vInv.size() >= 1000)
4244 pto->PushMessage("inv", vInv);
4249 pto->vInventoryToSend = vInvWait;
4252 pto->PushMessage("inv", vInv);
4258 vector<CInv> vGetData;
4259 int64 nNow = GetTime() * 1000000;
4260 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4262 const CInv& inv = (*pto->mapAskFor.begin()).second;
4263 if (!AlreadyHave(inv))
4266 printf("sending getdata: %s\n", inv.ToString().c_str());
4267 vGetData.push_back(inv);
4268 if (vGetData.size() >= 1000)
4270 pto->PushMessage("getdata", vGetData);
4273 mapAlreadyAskedFor[inv] = nNow;
4275 pto->mapAskFor.erase(pto->mapAskFor.begin());
4277 if (!vGetData.empty())
4278 pto->PushMessage("getdata", vGetData);
4284 // Amount compression:
4285 // * If the amount is 0, output 0
4286 // * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)
4287 // * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)
4288 // * call the result n
4289 // * output 1 + 10*(9*n + d - 1) + e
4290 // * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9
4291 // (this is decodable, as d is in [1-9] and e is in [0-9])
4293 uint64 CTxOutCompressor::CompressAmount(uint64 n)
4298 while (((n % 10) == 0) && e < 9) {
4304 assert(d >= 1 && d <= 9);
4306 return 1 + (n*9 + d - 1)*10 + e;
4308 return 1 + (n - 1)*10 + 9;
4312 uint64 CTxOutCompressor::DecompressAmount(uint64 x)
4314 // x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9
4318 // x = 10*(9*n + d - 1) + e
4324 int d = (x % 9) + 1;