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 BOOST_FOREACH(const CTxOut& txout, vout) {
423 if (!::IsStandard(txout.scriptPubKey)) {
426 if (txout.nValue == 0) {
429 if (fEnforceCanonical && !txout.scriptPubKey.HasCanonicalPushes()) {
438 // Check transaction inputs, and make sure any
439 // pay-to-script-hash transactions are evaluating IsStandard scripts
441 // Why bother? To avoid denial-of-service attacks; an attacker
442 // can submit a standard HASH... OP_EQUAL transaction,
443 // which will get accepted into blocks. The redemption
444 // script can be anything; an attacker could use a very
445 // expensive-to-check-upon-redemption script like:
446 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
448 bool CTransaction::AreInputsStandard(CCoinsViewCache& mapInputs) const
451 return true; // Coinbases don't use vin normally
453 for (unsigned int i = 0; i < vin.size(); i++)
455 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
457 vector<vector<unsigned char> > vSolutions;
458 txnouttype whichType;
459 // get the scriptPubKey corresponding to this input:
460 const CScript& prevScript = prev.scriptPubKey;
461 if (!Solver(prevScript, whichType, vSolutions))
463 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
464 if (nArgsExpected < 0)
467 // Transactions with extra stuff in their scriptSigs are
468 // non-standard. Note that this EvalScript() call will
469 // be quick, because if there are any operations
470 // beside "push data" in the scriptSig the
471 // IsStandard() call returns false
472 vector<vector<unsigned char> > stack;
473 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
476 if (whichType == TX_SCRIPTHASH)
480 CScript subscript(stack.back().begin(), stack.back().end());
481 vector<vector<unsigned char> > vSolutions2;
482 txnouttype whichType2;
483 if (!Solver(subscript, whichType2, vSolutions2))
485 if (whichType2 == TX_SCRIPTHASH)
489 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
492 nArgsExpected += tmpExpected;
495 if (stack.size() != (unsigned int)nArgsExpected)
503 CTransaction::GetLegacySigOpCount() const
505 unsigned int nSigOps = 0;
506 BOOST_FOREACH(const CTxIn& txin, vin)
508 nSigOps += txin.scriptSig.GetSigOpCount(false);
510 BOOST_FOREACH(const CTxOut& txout, vout)
512 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
518 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
528 if (pblock == NULL) {
530 if (pcoinsTip->GetCoins(GetHash(), coins)) {
531 CBlockIndex *pindex = FindBlockByHeight(coins.nHeight);
533 if (!blockTmp.ReadFromDisk(pindex))
541 // Update the tx's hashBlock
542 hashBlock = pblock->GetHash();
544 // Locate the transaction
545 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
546 if (pblock->vtx[nIndex] == *(CTransaction*)this)
548 if (nIndex == (int)pblock->vtx.size())
550 vMerkleBranch.clear();
552 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
556 // Fill in merkle branch
557 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
561 // Is the tx in a block that's in the main chain
562 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
563 if (mi == mapBlockIndex.end())
565 CBlockIndex* pindex = (*mi).second;
566 if (!pindex || !pindex->IsInMainChain())
569 return pindexBest->nHeight - pindex->nHeight + 1;
572 bool CTransaction::CheckTransaction() const
574 // Basic checks that don't depend on any context
576 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
578 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
580 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
581 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
583 // Check for negative or overflow output values
585 for (unsigned int i = 0; i < vout.size(); i++)
587 const CTxOut& txout = vout[i];
588 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
589 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
591 // Enforce minimum output amount for user transactions until 1 May 2014 04:00:00 GMT
592 if (!fTestNet && !IsCoinBase() && !txout.IsEmpty() && nTime < OUTPUT_SWITCH_TIME && txout.nValue < MIN_TXOUT_AMOUNT)
593 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
595 if (txout.nValue < 0)
596 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
597 if (txout.nValue > MAX_MONEY)
598 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
599 nValueOut += txout.nValue;
600 if (!MoneyRange(nValueOut))
601 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
604 // Check for duplicate inputs
605 set<COutPoint> vInOutPoints;
606 BOOST_FOREACH(const CTxIn& txin, vin)
608 if (vInOutPoints.count(txin.prevout))
610 vInOutPoints.insert(txin.prevout);
615 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
616 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
620 BOOST_FOREACH(const CTxIn& txin, vin)
621 if (txin.prevout.IsNull())
622 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
628 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
629 enum GetMinFee_mode mode, unsigned int nBytes) const
631 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
632 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
634 unsigned int nNewBlockSize = nBlockSize + nBytes;
635 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
637 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
638 if (nMinFee < nBaseFee)
640 BOOST_FOREACH(const CTxOut& txout, vout)
641 if (txout.nValue < CENT)
645 // Raise the price as the block approaches full
646 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
648 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
650 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
653 if (!MoneyRange(nMinFee))
658 void CTxMemPool::pruneSpent(const uint256 &hashTx, CCoins &coins)
662 std::map<COutPoint, CInPoint>::iterator it = mapNextTx.lower_bound(COutPoint(hashTx, 0));
664 // iterate over all COutPoints in mapNextTx whose hash equals the provided hashTx
665 while (it != mapNextTx.end() && it->first.hash == hashTx) {
666 coins.Spend(it->first.n); // and remove those outputs from coins
671 bool CTxMemPool::accept(CTransaction &tx, bool fCheckInputs, bool* pfMissingInputs)
674 *pfMissingInputs = false;
676 if (!tx.CheckTransaction())
677 return error("CTxMemPool::accept() : CheckTransaction failed");
679 // Coinbase is only valid in a block, not as a loose transaction
681 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
683 // Coinstake is also only valid in a block, not as a loose transaction
684 if (tx.IsCoinStake())
685 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
687 // To help v0.1.5 clients who would see it as a negative number
688 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
689 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
691 // Rather not work on nonstandard transactions (unless -testnet)
692 if (!fTestNet && !tx.IsStandard())
693 return error("CTxMemPool::accept() : nonstandard transaction type");
695 // is it already in the memory pool?
696 uint256 hash = tx.GetHash();
699 if (mapTx.count(hash))
703 // Check for conflicts with in-memory transactions
704 CTransaction* ptxOld = NULL;
705 for (unsigned int i = 0; i < tx.vin.size(); i++)
707 COutPoint outpoint = tx.vin[i].prevout;
708 if (mapNextTx.count(outpoint))
710 // Disable replacement feature for now
713 // Allow replacing with a newer version of the same transaction
716 ptxOld = mapNextTx[outpoint].ptx;
717 if (ptxOld->IsFinal())
719 if (!tx.IsNewerThan(*ptxOld))
721 for (unsigned int i = 0; i < tx.vin.size(); i++)
723 COutPoint outpoint = tx.vin[i].prevout;
724 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
733 CCoinsViewCache &view = *pcoinsTip;
735 // do we already have it?
736 if (view.HaveCoins(hash))
739 // do all inputs exist?
740 BOOST_FOREACH(const CTxIn txin, tx.vin) {
741 if (!view.HaveCoins(txin.prevout.hash)) {
743 *pfMissingInputs = true;
748 if (!tx.HaveInputs(view))
749 return error("CTxMemPool::accept() : inputs already spent");
751 // Check for non-standard pay-to-script-hash in inputs
752 if (!tx.AreInputsStandard(view) && !fTestNet)
753 return error("CTxMemPool::accept() : nonstandard transaction input");
755 // Note: if you modify this code to accept non-standard transactions, then
756 // you should add code here to check that the transaction does a
757 // reasonable number of ECDSA signature verifications.
759 int64 nFees = tx.GetValueIn(view)-tx.GetValueOut();
760 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
762 // Don't accept it if it can't get into a block
763 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY, nSize);
764 if (nFees < txMinFee)
765 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
766 hash.ToString().c_str(),
770 // Continuously rate-limit free transactions
771 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
772 // be annoying or make others' transactions take longer to confirm.
773 if (nFees < MIN_RELAY_TX_FEE)
775 static CCriticalSection cs;
776 static double dFreeCount;
777 static int64 nLastTime;
778 int64 nNow = GetTime();
782 // Use an exponentially decaying ~10-minute window:
783 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
785 // -limitfreerelay unit is thousand-bytes-per-minute
786 // At default rate it would take over a month to fill 1GB
787 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
788 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
790 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
795 // Check against previous transactions
796 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
797 if (!tx.CheckInputs(view, CS_ALWAYS, true, false))
799 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
803 // Store transaction in memory
808 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
811 addUnchecked(hash, tx);
814 ///// are we sure this is ok when loading transactions or restoring block txes
815 // If updated, erase old tx from wallet
817 EraseFromWallets(ptxOld->GetHash());
819 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
820 hash.ToString().substr(0,10).c_str(),
825 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
827 return mempool.accept(*this, fCheckInputs, pfMissingInputs);
830 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
832 // Add to memory pool without checking anything. Don't call this directly,
833 // call CTxMemPool::accept to properly check the transaction first.
836 for (unsigned int i = 0; i < tx.vin.size(); i++)
837 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
838 nTransactionsUpdated++;
844 bool CTxMemPool::remove(CTransaction &tx)
846 // Remove transaction from memory pool
849 uint256 hash = tx.GetHash();
850 if (mapTx.count(hash))
852 BOOST_FOREACH(const CTxIn& txin, tx.vin)
853 mapNextTx.erase(txin.prevout);
855 nTransactionsUpdated++;
861 void CTxMemPool::clear()
866 ++nTransactionsUpdated;
869 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
874 vtxid.reserve(mapTx.size());
875 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
876 vtxid.push_back((*mi).first);
879 // Return depth of transaction in blockchain:
880 // -1 : not in blockchain, and not in memory pool (conflicted transaction)
881 // 0 : in memory pool, waiting to be included in a block
882 // >=1 : this many blocks deep in the main chain
883 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
885 bool fInMemPool = mempool.exists(GetHash());
887 if (hashBlock == 0 || nIndex == -1) {
888 return fInMemPool ? 0 : -1;
891 // Find the block it claims to be in
892 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
893 if (mi == mapBlockIndex.end()) {
894 return fInMemPool ? 0 : -1;
896 CBlockIndex* pindex = (*mi).second;
897 if (!pindex || !pindex->IsInMainChain()) {
898 return fInMemPool ? 0 : -1;
901 // Make sure the merkle branch connects to this block
902 if (!fMerkleVerified)
904 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot) {
905 return fInMemPool ? 0 : -1;
907 fMerkleVerified = true;
911 return pindexBest->nHeight - pindex->nHeight + 1;
914 int CMerkleTx::GetBlocksToMaturity() const
916 if (!(IsCoinBase() || IsCoinStake()))
918 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
922 bool CMerkleTx::AcceptToMemoryPool(bool fCheckInputs)
926 if (!IsInMainChain() && !ClientCheckInputs())
928 return CTransaction::AcceptToMemoryPool(false);
932 return CTransaction::AcceptToMemoryPool(fCheckInputs);
936 bool CWalletTx::AcceptWalletTransaction(bool fCheckInputs)
941 // Add previous supporting transactions first
942 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
944 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
946 uint256 hash = tx.GetHash();
947 if (!mempool.exists(hash) && pcoinsTip->HaveCoins(hash))
948 tx.AcceptToMemoryPool(fCheckInputs);
951 return AcceptToMemoryPool(fCheckInputs);
956 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
957 bool GetTransaction(const uint256 &hash, CTransaction &txOut, uint256 &hashBlock, bool fAllowSlow)
959 CBlockIndex *pindexSlow = NULL;
964 if (mempool.exists(hash))
966 txOut = mempool.lookup(hash);
971 if (fAllowSlow) { // use coin database to locate block that contains transaction, and scan it
974 CCoinsViewCache &view = *pcoinsTip;
976 if (view.GetCoins(hash, coins))
977 nHeight = coins.nHeight;
980 pindexSlow = FindBlockByHeight(nHeight);
986 if (block.ReadFromDisk(pindexSlow)) {
987 BOOST_FOREACH(const CTransaction &tx, block.vtx) {
988 if (tx.GetHash() == hash) {
990 hashBlock = pindexSlow->GetBlockHash();
1001 //////////////////////////////////////////////////////////////////////////////
1003 // CBlock and CBlockIndex
1006 static CBlockIndex* pblockindexFBBHLast;
1007 CBlockIndex* FindBlockByHeight(int nHeight)
1009 CBlockIndex *pblockindex;
1010 if (nHeight < nBestHeight / 2)
1011 pblockindex = pindexGenesisBlock;
1013 pblockindex = pindexBest;
1014 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
1015 pblockindex = pblockindexFBBHLast;
1016 while (pblockindex->nHeight > nHeight)
1017 pblockindex = pblockindex->pprev;
1018 while (pblockindex->nHeight < nHeight)
1019 pblockindex = pblockindex->pnext;
1020 pblockindexFBBHLast = pblockindex;
1024 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1026 if (!fReadTransactions)
1028 *this = pindex->GetBlockHeader();
1031 if (!ReadFromDisk(pindex->GetBlockPos(), fReadTransactions))
1033 if (GetHash() != pindex->GetBlockHash())
1034 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1038 uint256 static GetOrphanRoot(const CBlock* pblock)
1040 // Work back to the first block in the orphan chain
1041 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1042 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1043 return pblock->GetHash();
1046 // ppcoin: find block wanted by given orphan block
1047 uint256 WantedByOrphan(const CBlock* pblockOrphan)
1049 // Work back to the first block in the orphan chain
1050 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
1051 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
1052 return pblockOrphan->hashPrevBlock;
1055 // select stake target limit according to hard-coded conditions
1056 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1058 if(fTestNet) // separate proof of stake target limit for testnet
1059 return bnProofOfStakeLimit;
1060 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1061 return bnProofOfStakeLimit;
1062 if(nHeight + 1 > 15000) // 24 bits since block 15000
1063 return bnProofOfStakeLegacyLimit;
1064 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1065 return bnProofOfStakeHardLimit;
1067 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1070 // miner's coin base reward based on nBits
1071 int64 GetProofOfWorkReward(unsigned int nBits)
1073 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1076 bnTarget.SetCompact(nBits);
1077 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1078 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1080 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1081 // A reasonably continuous curve is used to avoid shock to market
1082 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1084 // Human readable form:
1086 // nSubsidy = 100 / (diff ^ 1/6)
1087 CBigNum bnLowerBound = CENT;
1088 CBigNum bnUpperBound = bnSubsidyLimit;
1089 while (bnLowerBound + CENT <= bnUpperBound)
1091 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1092 if (fDebug && GetBoolArg("-printcreation"))
1093 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1094 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1095 bnUpperBound = bnMidValue;
1097 bnLowerBound = bnMidValue;
1100 int64 nSubsidy = bnUpperBound.getuint64();
1102 nSubsidy = (nSubsidy / CENT) * CENT;
1103 if (fDebug && GetBoolArg("-printcreation"))
1104 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1106 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
1109 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1110 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1112 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1114 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1116 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1118 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1120 bnTarget.SetCompact(nBits);
1121 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1122 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1124 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1126 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1127 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1128 bnMidPart, bnRewardPart;
1130 while (bnLowerBound + CENT <= bnUpperBound)
1132 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1133 if (fDebug && GetBoolArg("-printcreation"))
1134 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1136 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1139 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1141 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1143 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1146 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1147 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1152 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1154 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1156 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1159 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1160 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1163 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1164 bnUpperBound = bnMidValue;
1166 bnLowerBound = bnMidValue;
1169 nRewardCoinYear = bnUpperBound.getuint64();
1170 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1174 // Old creation amount per coin-year, 5% fixed stake mint rate
1175 nRewardCoinYear = 5 * CENT;
1179 return nRewardCoinYear;
1181 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1183 // Set reasonable reward limit for large inputs since 20 Oct 2013
1185 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1186 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1188 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1189 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1191 nSubsidy = min(nSubsidy, nSubsidyLimit);
1194 if (fDebug && GetBoolArg("-printcreation"))
1195 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1199 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1201 // get proof of work blocks max spacing according to hard-coded conditions
1202 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1204 if(nTime > TARGETS_SWITCH_TIME)
1205 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1208 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1210 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1214 // maximum nBits value could possible be required nTime after
1216 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1219 bnResult.SetCompact(nBase);
1221 while (nTime > 0 && bnResult < bnTargetLimit)
1223 // Maximum 200% adjustment per day...
1225 nTime -= 24 * 60 * 60;
1227 if (bnResult > bnTargetLimit)
1228 bnResult = bnTargetLimit;
1229 return bnResult.GetCompact();
1233 // minimum amount of work that could possibly be required nTime after
1234 // minimum proof-of-work required was nBase
1236 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1238 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1242 // minimum amount of stake that could possibly be required nTime after
1243 // minimum proof-of-stake required was nBase
1245 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1247 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1251 // ppcoin: find last block index up to pindex
1252 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1254 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1255 pindex = pindex->pprev;
1259 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1261 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1263 if (pindexLast == NULL)
1264 return bnTargetLimit.GetCompact(); // genesis block
1266 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1267 if (pindexPrev->pprev == NULL)
1268 return bnTargetLimit.GetCompact(); // first block
1269 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1270 if (pindexPrevPrev->pprev == NULL)
1271 return bnTargetLimit.GetCompact(); // second block
1273 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1275 // ppcoin: target change every block
1276 // ppcoin: retarget with exponential moving toward target spacing
1278 bnNew.SetCompact(pindexPrev->nBits);
1279 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1280 int64 nInterval = nTargetTimespan / nTargetSpacing;
1281 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1282 bnNew /= ((nInterval + 1) * nTargetSpacing);
1284 if (bnNew > bnTargetLimit)
1285 bnNew = bnTargetLimit;
1287 return bnNew.GetCompact();
1290 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1293 bnTarget.SetCompact(nBits);
1296 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1297 return error("CheckProofOfWork() : nBits below minimum work");
1299 // Check proof of work matches claimed amount
1300 if (hash > bnTarget.getuint256())
1301 return error("CheckProofOfWork() : hash doesn't match nBits");
1306 // Return maximum amount of blocks that other nodes claim to have
1307 int GetNumBlocksOfPeers()
1309 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1312 bool IsInitialBlockDownload()
1314 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1316 static int64 nLastUpdate;
1317 static CBlockIndex* pindexLastBest;
1318 if (pindexBest != pindexLastBest)
1320 pindexLastBest = pindexBest;
1321 nLastUpdate = GetTime();
1323 return (GetTime() - nLastUpdate < 10 &&
1324 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1327 void static InvalidChainFound(CBlockIndex* pindexNew)
1329 if (pindexNew->nChainTrust > nBestInvalidTrust)
1331 nBestInvalidTrust = pindexNew->nChainTrust;
1332 pblocktree->WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1333 uiInterface.NotifyBlocksChanged();
1336 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1337 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1339 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1340 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1341 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1342 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1343 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1344 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1345 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1346 nBestBlockTrust.Get64(),
1347 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1350 void static InvalidBlockFound(CBlockIndex *pindex) {
1351 pindex->nStatus |= BLOCK_FAILED_VALID;
1352 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindex));
1353 setBlockIndexValid.erase(pindex);
1354 InvalidChainFound(pindex);
1356 ConnectBestBlock(); // reorganise away from the failed block
1359 bool ConnectBestBlock() {
1361 CBlockIndex *pindexNewBest;
1364 std::set<CBlockIndex*,CBlockIndexTrustComparator>::reverse_iterator it = setBlockIndexValid.rbegin();
1365 if (it == setBlockIndexValid.rend())
1367 pindexNewBest = *it;
1370 if (pindexNewBest == pindexBest)
1371 return true; // nothing to do
1374 CBlockIndex *pindexTest = pindexNewBest;
1375 std::vector<CBlockIndex*> vAttach;
1377 if (pindexTest->nStatus & BLOCK_FAILED_MASK) {
1378 // mark descendants failed
1379 CBlockIndex *pindexFailed = pindexNewBest;
1380 while (pindexTest != pindexFailed) {
1381 pindexFailed->nStatus |= BLOCK_FAILED_CHILD;
1382 setBlockIndexValid.erase(pindexFailed);
1383 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindexFailed));
1384 pindexFailed = pindexFailed->pprev;
1386 InvalidChainFound(pindexNewBest);
1390 if (pindexBest == NULL || pindexTest->nChainTrust > pindexBest->nChainTrust)
1391 vAttach.push_back(pindexTest);
1393 if (pindexTest->pprev == NULL || pindexTest->pnext != NULL) {
1394 reverse(vAttach.begin(), vAttach.end());
1395 BOOST_FOREACH(CBlockIndex *pindexSwitch, vAttach)
1396 if (!SetBestChain(pindexSwitch))
1400 pindexTest = pindexTest->pprev;
1405 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1407 nTime = max(GetBlockTime(), GetAdjustedTime());
1410 const CTxOut &CTransaction::GetOutputFor(const CTxIn& input, CCoinsViewCache& view)
1412 const CCoins &coins = view.GetCoins(input.prevout.hash);
1413 assert(coins.IsAvailable(input.prevout.n));
1414 return coins.vout[input.prevout.n];
1417 int64 CTransaction::GetValueIn(CCoinsViewCache& inputs) const
1423 for (unsigned int i = 0; i < vin.size(); i++)
1424 nResult += GetOutputFor(vin[i], inputs).nValue;
1429 unsigned int CTransaction::GetP2SHSigOpCount(CCoinsViewCache& inputs) const
1434 unsigned int nSigOps = 0;
1435 for (unsigned int i = 0; i < vin.size(); i++)
1437 const CTxOut &prevout = GetOutputFor(vin[i], inputs);
1438 if (prevout.scriptPubKey.IsPayToScriptHash())
1439 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1444 bool CTransaction::UpdateCoins(CCoinsViewCache &inputs, CTxUndo &txundo, int nHeight, unsigned int nTimeStamp, const uint256 &txhash) const
1446 // mark inputs spent
1447 if (!IsCoinBase()) {
1448 BOOST_FOREACH(const CTxIn &txin, vin) {
1449 CCoins &coins = inputs.GetCoins(txin.prevout.hash);
1450 if (coins.nTime > nTimeStamp)
1451 return error("UpdateCoins() : timestamp violation");
1453 if (!coins.Spend(txin.prevout, undo))
1454 return error("UpdateCoins() : cannot spend input");
1455 txundo.vprevout.push_back(undo);
1460 if (!inputs.SetCoins(txhash, CCoins(*this, nHeight, nTimeStamp)))
1461 return error("UpdateCoins() : cannot update output");
1466 bool CTransaction::HaveInputs(CCoinsViewCache &inputs) const
1468 if (!IsCoinBase()) {
1469 // first check whether information about the prevout hash is available
1470 for (unsigned int i = 0; i < vin.size(); i++) {
1471 const COutPoint &prevout = vin[i].prevout;
1472 if (!inputs.HaveCoins(prevout.hash))
1476 // then check whether the actual outputs are available
1477 for (unsigned int i = 0; i < vin.size(); i++) {
1478 const COutPoint &prevout = vin[i].prevout;
1479 const CCoins &coins = inputs.GetCoins(prevout.hash);
1480 if (!coins.IsAvailable(prevout.n))
1487 bool CTransaction::CheckInputs(CCoinsViewCache &inputs, enum CheckSig_mode csmode, bool fStrictPayToScriptHash, bool fStrictEncodings, CBlock *pblock) const
1491 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1492 // for an attacker to attempt to split the network.
1493 if (!HaveInputs(inputs))
1494 return error("CheckInputs() : %s inputs unavailable", GetHash().ToString().substr(0,10).c_str());
1496 CBlockIndex *pindexBlock = inputs.GetBestBlock();
1499 for (unsigned int i = 0; i < vin.size(); i++)
1501 const COutPoint &prevout = vin[i].prevout;
1502 const CCoins &coins = inputs.GetCoins(prevout.hash);
1504 // If prev is coinbase or coinstake, check that it's matured
1505 if (coins.IsCoinBase() || coins.IsCoinStake()) {
1506 if (pindexBlock->nHeight - coins.nHeight < nCoinbaseMaturity)
1507 return error("CheckInputs() : tried to spend %s at depth %d", coins.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - coins.nHeight);
1510 // Check transaction timestamp
1511 if (coins.nTime > nTime)
1512 return DoS(100, error("CheckInputs() : transaction timestamp earlier than input transaction"));
1514 // Check for negative or overflow input values
1515 nValueIn += coins.vout[prevout.n].nValue;
1516 if (!MoneyRange(coins.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1517 return DoS(100, error("CheckInputs() : txin values out of range"));
1523 return error("CheckInputs() : %s is a coinstake, but no block specified", GetHash().ToString().substr(0,10).c_str());
1525 // Coin stake tx earns reward instead of paying fee
1527 if (!GetCoinAge(nCoinAge))
1528 return error("CheckInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1530 int64 nStakeReward = GetValueOut() - nValueIn;
1531 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pblock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1533 if (nStakeReward > nCalculatedStakeReward)
1534 return DoS(100, error("CheckInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1538 if (nValueIn < GetValueOut())
1539 return DoS(100, error("ChecktInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1541 // Tally transaction fees
1542 int64 nTxFee = nValueIn - GetValueOut();
1544 return DoS(100, error("CheckInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1546 if (!MoneyRange(nFees))
1547 return DoS(100, error("CheckInputs() : nFees out of range"));
1549 // enforce transaction fees for every block until 1 May 2014 04:00:00 GMT
1550 if (!fTestNet && nTxFee < GetMinFee() && nTime < OUTPUT_SWITCH_TIME)
1551 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;
1554 // The first loop above does all the inexpensive checks.
1555 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1556 // Helps prevent CPU exhaustion attacks.
1558 // Skip ECDSA signature verification when connecting blocks
1559 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1560 // still computed and checked, and any change will be caught at the next checkpoint.
1561 if (csmode == CS_ALWAYS ||
1562 (csmode == CS_AFTER_CHECKPOINT && inputs.GetBestBlock()->nHeight >= Checkpoints::GetTotalBlocksEstimate())) {
1563 for (unsigned int i = 0; i < vin.size(); i++) {
1564 const COutPoint &prevout = vin[i].prevout;
1565 const CCoins &coins = inputs.GetCoins(prevout.hash);
1568 if (!VerifySignature(coins, *this, i, fStrictPayToScriptHash, fStrictEncodings, 0)) {
1569 // only during transition phase for P2SH: do not invoke anti-DoS code for
1570 // potentially old clients relaying bad P2SH transactions
1571 if (fStrictPayToScriptHash && VerifySignature(coins, *this, i, false, fStrictEncodings, 0))
1572 return error("CheckInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1574 return DoS(100,error("CheckInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1584 bool CTransaction::ClientCheckInputs() const
1589 // Take over previous transactions' spent pointers
1593 for (unsigned int i = 0; i < vin.size(); i++)
1595 // Get prev tx from single transactions in memory
1596 COutPoint prevout = vin[i].prevout;
1597 if (!mempool.exists(prevout.hash))
1599 CTransaction& txPrev = mempool.lookup(prevout.hash);
1601 if (prevout.n >= txPrev.vout.size())
1605 if (!VerifySignature(CCoins(txPrev, -1, -1), *this, i, true, false, 0))
1606 return error("ConnectInputs() : VerifySignature failed");
1608 ///// this is redundant with the mempool.mapNextTx stuff,
1609 ///// not sure which I want to get rid of
1610 ///// this has to go away now that posNext is gone
1611 // // Check for conflicts
1612 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1613 // return error("ConnectInputs() : prev tx already used");
1615 // // Flag outpoints as used
1616 // txPrev.vout[prevout.n].posNext = posThisTx;
1618 nValueIn += txPrev.vout[prevout.n].nValue;
1620 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1621 return error("ClientConnectInputs() : txin values out of range");
1623 if (GetValueOut() > nValueIn)
1630 bool CBlock::DisconnectBlock(CBlockIndex *pindex, CCoinsViewCache &view)
1632 assert(pindex == view.GetBestBlock());
1634 CBlockUndo blockUndo;
1636 CDiskBlockPos pos = pindex->GetUndoPos();
1638 return error("DisconnectBlock() : no undo data available");
1639 FILE *file = OpenUndoFile(pos, true);
1641 return error("DisconnectBlock() : undo file not available");
1642 CAutoFile fileUndo(file, SER_DISK, CLIENT_VERSION);
1643 fileUndo >> blockUndo;
1646 assert(blockUndo.vtxundo.size() + 1 == vtx.size());
1648 // undo transactions in reverse order
1649 for (int i = vtx.size() - 1; i >= 0; i--) {
1650 const CTransaction &tx = vtx[i];
1651 uint256 hash = tx.GetHash();
1653 // don't check coinbase coins for proof-of-stake block
1654 if(IsProofOfStake() && tx.IsCoinBase())
1657 // check that all outputs are available
1658 if (!view.HaveCoins(hash))
1659 return error("DisconnectBlock() : outputs still spent? database corrupted");
1660 CCoins &outs = view.GetCoins(hash);
1662 CCoins outsBlock = CCoins(tx, pindex->nHeight, pindex->nTime);
1663 if (outs != outsBlock)
1664 return error("DisconnectBlock() : added transaction mismatch? database corrupted");
1670 if (i > 0) { // not coinbases
1671 const CTxUndo &txundo = blockUndo.vtxundo[i-1];
1672 assert(txundo.vprevout.size() == tx.vin.size());
1673 for (unsigned int j = tx.vin.size(); j-- > 0;) {
1674 const COutPoint &out = tx.vin[j].prevout;
1675 const CTxInUndo &undo = txundo.vprevout[j];
1677 view.GetCoins(out.hash, coins); // this can fail if the prevout was already entirely spent
1678 if (coins.IsPruned()) {
1679 if (undo.nHeight == 0)
1680 return error("DisconnectBlock() : undo data doesn't contain tx metadata? database corrupted");
1681 coins.fCoinBase = undo.fCoinBase;
1682 coins.fCoinStake = undo.fCoinStake;
1683 coins.nHeight = undo.nHeight;
1684 coins.nTime = undo.nTime;
1685 coins.nBlockTime = undo.nBlockTime;
1686 coins.nVersion = undo.nVersion;
1688 if (undo.nHeight != 0)
1689 return error("DisconnectBlock() : undo data contains unneeded tx metadata? database corrupted");
1691 if (coins.IsAvailable(out.n))
1692 return error("DisconnectBlock() : prevout output not spent? database corrupted");
1693 if (coins.vout.size() < out.n+1)
1694 coins.vout.resize(out.n+1);
1695 coins.vout[out.n] = undo.txout;
1696 if (!view.SetCoins(out.hash, coins))
1697 return error("DisconnectBlock() : cannot restore coin inputs");
1701 // clean up wallet after disconnecting coinstake
1702 SyncWithWallets(vtx[i].GetHash(), vtx[i], this, false, false);
1705 // move best block pointer to prevout block
1706 view.SetBestBlock(pindex->pprev);
1711 bool FindUndoPos(int nFile, CDiskBlockPos &pos, unsigned int nAddSize);
1713 bool CBlock::ConnectBlock(CBlockIndex* pindex, CCoinsViewCache &view, bool fJustCheck)
1715 // Check it again in case a previous version let a bad block in
1716 if (!CheckBlock(!fJustCheck, !fJustCheck))
1719 // verify that the view's current state corresponds to the previous block
1720 assert(pindex->pprev == view.GetBestBlock());
1722 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1723 // unless those are already completely spent.
1724 // If such overwrites are allowed, coinbases and transactions depending upon those
1725 // can be duplicated to remove the ability to spend the first instance -- even after
1726 // being sent to another address.
1727 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1728 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1729 // already refuses previously-known transaction ids entirely.
1730 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1731 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1732 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1733 // initial block download.
1734 bool fEnforceBIP30 = true;
1736 if (fEnforceBIP30) {
1737 for (unsigned int i=0; i<vtx.size(); i++) {
1738 uint256 hash = GetTxHash(i);
1739 if (view.HaveCoins(hash) && !view.GetCoins(hash).IsPruned())
1740 return error("ConnectBlock() : tried to overwrite transaction");
1744 // BIP16 always active
1745 bool fStrictPayToScriptHash = true;
1747 CBlockUndo blockundo;
1749 int64 nFees = 0, nValueIn = 0, nValueOut = 0;
1750 unsigned int nSigOps = 0;
1751 for (unsigned int i=0; i<vtx.size(); i++)
1753 const CTransaction &tx = vtx[i];
1754 nSigOps += tx.GetLegacySigOpCount();
1755 if (nSigOps > MAX_BLOCK_SIGOPS)
1756 return DoS(100, error("ConnectBlock() : too many sigops"));
1758 if (!tx.IsCoinBase())
1760 if (!tx.HaveInputs(view))
1761 return DoS(100, error("ConnectBlock() : inputs missing/spent"));
1763 if (fStrictPayToScriptHash)
1765 // Add in sigops done by pay-to-script-hash inputs;
1766 // this is to prevent a "rogue miner" from creating
1767 // an incredibly-expensive-to-validate block.
1768 nSigOps += tx.GetP2SHSigOpCount(view);
1769 if (nSigOps > MAX_BLOCK_SIGOPS)
1770 return DoS(100, error("ConnectBlock() : too many sigops"));
1773 int64 nTxValueOut = tx.GetValueOut();
1774 int64 nTxValueIn = tx.GetValueIn(view);
1776 nValueIn += nTxValueIn;
1777 nValueOut += nTxValueOut;
1779 if (!tx.IsCoinStake())
1780 nFees += nTxValueIn - nTxValueOut;
1782 if (!tx.CheckInputs(view, CS_AFTER_CHECKPOINT, fStrictPayToScriptHash, false, this))
1787 nValueOut += tx.GetValueOut();
1790 // don't create coinbase coins for proof-of-stake block
1791 if(IsProofOfStake() && tx.IsCoinBase())
1795 if (!tx.UpdateCoins(view, txundo, pindex->nHeight, pindex->nTime, GetTxHash(i)))
1796 return error("ConnectBlock() : UpdateInputs failed");
1797 if (!tx.IsCoinBase())
1798 blockundo.vtxundo.push_back(txundo);
1801 pindex->nMint = nValueOut - nValueIn + nFees;
1802 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1807 // Write undo information to disk
1808 if (pindex->GetUndoPos().IsNull() || (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_SCRIPTS)
1810 if (pindex->GetUndoPos().IsNull()) {
1812 if (!FindUndoPos(pindex->nFile, pos, ::GetSerializeSize(blockundo, SER_DISK, CLIENT_VERSION) + 8))
1813 return error("ConnectBlock() : FindUndoPos failed");
1814 if (!blockundo.WriteToDisk(pos))
1815 return error("ConnectBlock() : CBlockUndo::WriteToDisk failed");
1817 // update nUndoPos in block index
1818 pindex->nUndoPos = pos.nPos;
1819 pindex->nStatus |= BLOCK_HAVE_UNDO;
1822 pindex->nStatus = (pindex->nStatus & ~BLOCK_VALID_MASK) | BLOCK_VALID_SCRIPTS;
1824 CDiskBlockIndex blockindex(pindex);
1825 if (!pblocktree->WriteBlockIndex(blockindex))
1826 return error("ConnectBlock() : WriteBlockIndex failed");
1829 // add this block to the view's blockchain
1830 if (!view.SetBestBlock(pindex))
1833 // fees are destroyed to compensate the entire network
1834 if (fDebug && GetBoolArg("-printcreation"))
1835 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1837 // Watch for transactions paying to me
1838 for (unsigned int i=0; i<vtx.size(); i++)
1839 SyncWithWallets(GetTxHash(i), vtx[i], this, true);
1844 bool SetBestChain(CBlockIndex* pindexNew)
1846 CCoinsViewCache &view = *pcoinsTip;
1848 // special case for attaching the genesis block
1849 // note that no ConnectBlock is called, so its coinbase output is non-spendable
1850 if (pindexGenesisBlock == NULL && pindexNew->GetBlockHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1852 view.SetBestBlock(pindexNew);
1855 pindexGenesisBlock = pindexNew;
1856 pindexBest = pindexNew;
1857 hashBestChain = pindexNew->GetBlockHash();
1858 nBestHeight = pindexBest->nHeight;
1859 nBestChainTrust = pindexNew->nChainTrust;
1863 // Find the fork (typically, there is none)
1864 CBlockIndex* pfork = view.GetBestBlock();
1865 CBlockIndex* plonger = pindexNew;
1866 while (pfork != plonger)
1868 while (plonger->nHeight > pfork->nHeight)
1869 if (!(plonger = plonger->pprev))
1870 return error("SetBestChain() : plonger->pprev is null");
1871 if (pfork == plonger)
1873 if (!(pfork = pfork->pprev))
1874 return error("SetBestChain() : pfork->pprev is null");
1877 // List of what to disconnect (typically nothing)
1878 vector<CBlockIndex*> vDisconnect;
1879 for (CBlockIndex* pindex = view.GetBestBlock(); pindex != pfork; pindex = pindex->pprev)
1880 vDisconnect.push_back(pindex);
1882 // List of what to connect (typically only pindexNew)
1883 vector<CBlockIndex*> vConnect;
1884 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1885 vConnect.push_back(pindex);
1886 reverse(vConnect.begin(), vConnect.end());
1888 if (vDisconnect.size() > 0) {
1889 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());
1890 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());
1893 // Disconnect shorter branch
1894 vector<CTransaction> vResurrect;
1895 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect) {
1897 if (!block.ReadFromDisk(pindex))
1898 return error("SetBestChain() : ReadFromDisk for disconnect failed");
1899 CCoinsViewCache viewTemp(view, true);
1900 if (!block.DisconnectBlock(pindex, viewTemp))
1901 return error("SetBestChain() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1902 if (!viewTemp.Flush())
1903 return error("SetBestChain() : Cache flush failed after disconnect");
1905 // Queue memory transactions to resurrect
1906 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1907 if (!tx.IsCoinBase() && !tx.IsCoinStake())
1908 vResurrect.push_back(tx);
1911 // Connect longer branch
1912 vector<CTransaction> vDelete;
1913 BOOST_FOREACH(CBlockIndex *pindex, vConnect) {
1915 if (!block.ReadFromDisk(pindex))
1916 return error("SetBestChain() : ReadFromDisk for connect failed");
1917 CCoinsViewCache viewTemp(view, true);
1918 if (!block.ConnectBlock(pindex, viewTemp)) {
1919 InvalidChainFound(pindexNew);
1920 InvalidBlockFound(pindex);
1921 return error("SetBestChain() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1923 if (!viewTemp.Flush())
1924 return error("SetBestChain() : Cache flush failed after connect");
1926 // Queue memory transactions to delete
1927 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1928 vDelete.push_back(tx);
1931 // Make sure it's successfully written to disk before changing memory structure
1932 bool fIsInitialDownload = IsInitialBlockDownload();
1933 if (!fIsInitialDownload || view.GetCacheSize()>5000)
1937 // At this point, all changes have been done to the database.
1938 // Proceed by updating the memory structures.
1940 // Disconnect shorter branch
1941 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1943 pindex->pprev->pnext = NULL;
1945 // Connect longer branch
1946 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1948 pindex->pprev->pnext = pindex;
1950 // Resurrect memory transactions that were in the disconnected branch
1951 BOOST_FOREACH(CTransaction& tx, vResurrect)
1952 tx.AcceptToMemoryPool(false);
1954 // Delete redundant memory transactions that are in the connected branch
1955 BOOST_FOREACH(CTransaction& tx, vDelete)
1958 // Update best block in wallet (so we can detect restored wallets)
1959 if (!fIsInitialDownload)
1961 const CBlockLocator locator(pindexNew);
1962 ::SetBestChain(locator);
1966 hashBestChain = pindexNew->GetBlockHash();
1967 pindexBest = pindexNew;
1968 pblockindexFBBHLast = NULL;
1969 nBestHeight = pindexBest->nHeight;
1970 nBestChainTrust = pindexNew->nChainTrust;
1971 nTimeBestReceived = GetTime();
1972 nTransactionsUpdated++;
1974 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1976 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%s tx=%lu date=%s\n",
1977 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str(), CBigNum(nBestBlockTrust).ToString().c_str(), (unsigned long)pindexNew->nChainTx,
1978 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1980 // Check the version of the last 100 blocks to see if we need to upgrade:
1981 if (!fIsInitialDownload)
1984 const CBlockIndex* pindex = pindexBest;
1985 for (int i = 0; i < 100 && pindex != NULL; i++)
1987 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1989 pindex = pindex->pprev;
1992 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1993 if (nUpgraded > 100/2)
1994 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1995 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1998 std::string strCmd = GetArg("-blocknotify", "");
2000 if (!fIsInitialDownload && !strCmd.empty())
2002 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2003 boost::thread t(runCommand, strCmd); // thread runs free
2009 // Total coin age spent in transaction, in the unit of coin-days.
2010 // Only those coins meeting minimum age requirement counts. As those
2011 // transactions not in main chain are not currently indexed so we
2012 // might not find out about their coin age. Older transactions are
2013 // guaranteed to be in main chain by sync-checkpoint. This rule is
2014 // introduced to help nodes establish a consistent view of the coin
2015 // age (trust score) of competing branches.
2016 bool CTransaction::GetCoinAge(uint64& nCoinAge) const
2018 CCoinsViewCache &inputs = *pcoinsTip;
2020 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2026 for (unsigned int i = 0; i < vin.size(); i++)
2028 const COutPoint &prevout = vin[i].prevout;
2030 if (!inputs.GetCoins(prevout.hash, coins))
2033 if (nTime < coins.nTime)
2034 return false; // Transaction timestamp violation
2036 // only count coins meeting min age requirement
2037 if (coins.nBlockTime + nStakeMinAge > nTime)
2040 int64 nValueIn = coins.vout[vin[i].prevout.n].nValue;
2041 bnCentSecond += CBigNum(nValueIn) * (nTime-coins.nTime) / CENT;
2044 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2045 if (fDebug && GetBoolArg("-printcoinage"))
2046 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2047 nCoinAge = bnCoinDay.getuint64();
2051 // Total coin age spent in block, in the unit of coin-days.
2052 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2056 BOOST_FOREACH(const CTransaction& tx, vtx)
2059 if (tx.GetCoinAge(nTxCoinAge))
2060 nCoinAge += nTxCoinAge;
2065 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2067 if (fDebug && GetBoolArg("-printcoinage"))
2068 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2072 bool CBlock::AddToBlockIndex(const CDiskBlockPos &pos)
2074 // Check for duplicate
2075 uint256 hash = GetHash();
2076 if (mapBlockIndex.count(hash))
2077 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2079 // Construct new block index object
2080 CBlockIndex* pindexNew = new CBlockIndex(*this);
2082 return error("AddToBlockIndex() : new CBlockIndex failed");
2083 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2084 pindexNew->phashBlock = &((*mi).first);
2085 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2086 if (miPrev != mapBlockIndex.end())
2088 pindexNew->pprev = (*miPrev).second;
2089 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2091 pindexNew->nTx = vtx.size();
2092 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2093 pindexNew->nChainTx = (pindexNew->pprev ? pindexNew->pprev->nChainTx : 0) + pindexNew->nTx;
2094 pindexNew->nFile = pos.nFile;
2095 pindexNew->nDataPos = pos.nPos;
2096 pindexNew->nUndoPos = 0;
2097 pindexNew->nStatus = BLOCK_VALID_TRANSACTIONS | BLOCK_HAVE_DATA;
2099 // Compute stake entropy bit for stake modifier
2100 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2101 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2103 // Record proof-of-stake hash value
2104 if (pindexNew->IsProofOfStake())
2106 if (!mapProofOfStake.count(hash))
2107 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2108 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2111 // Compute stake modifier
2112 uint64 nStakeModifier = 0;
2113 bool fGeneratedStakeModifier = false;
2114 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2115 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2116 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2117 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2118 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2119 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2121 setBlockIndexValid.insert(pindexNew);
2123 pblocktree->WriteBlockIndex(CDiskBlockIndex(pindexNew));
2126 if (!ConnectBestBlock())
2129 if (pindexNew == pindexBest)
2131 // Notify UI to display prev block's coinbase if it was ours
2132 static uint256 hashPrevBestCoinBase;
2133 UpdatedTransaction(hashPrevBestCoinBase);
2134 hashPrevBestCoinBase = GetTxHash(0);
2137 pblocktree->Flush();
2139 uiInterface.NotifyBlocksChanged();
2143 bool FindBlockPos(CDiskBlockPos &pos, unsigned int nAddSize, unsigned int nHeight, uint64 nTime)
2145 bool fUpdatedLast = false;
2147 LOCK(cs_LastBlockFile);
2149 while (infoLastBlockFile.nSize + nAddSize >= MAX_BLOCKFILE_SIZE) {
2150 printf("Leaving block file %i: %s\n", nLastBlockFile, infoLastBlockFile.ToString().c_str());
2151 FILE *file = OpenBlockFile(pos);
2154 file = OpenUndoFile(pos);
2158 infoLastBlockFile.SetNull();
2159 pblocktree->ReadBlockFileInfo(nLastBlockFile, infoLastBlockFile); // check whether data for the new file somehow already exist; can fail just fine
2160 fUpdatedLast = true;
2163 pos.nFile = nLastBlockFile;
2164 pos.nPos = infoLastBlockFile.nSize;
2165 infoLastBlockFile.nSize += nAddSize;
2166 infoLastBlockFile.AddBlock(nHeight, nTime);
2168 unsigned int nOldChunks = (pos.nPos + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2169 unsigned int nNewChunks = (infoLastBlockFile.nSize + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
2170 if (nNewChunks > nOldChunks) {
2171 FILE *file = OpenBlockFile(pos);
2173 printf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks * BLOCKFILE_CHUNK_SIZE, pos.nFile);
2174 AllocateFileRange(file, pos.nPos, nNewChunks * BLOCKFILE_CHUNK_SIZE - pos.nPos);
2179 if (!pblocktree->WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2180 return error("FindBlockPos() : cannot write updated block info");
2182 pblocktree->WriteLastBlockFile(nLastBlockFile);
2187 bool FindUndoPos(int nFile, CDiskBlockPos &pos, unsigned int nAddSize)
2191 LOCK(cs_LastBlockFile);
2193 unsigned int nNewSize;
2194 if (nFile == nLastBlockFile) {
2195 pos.nPos = infoLastBlockFile.nUndoSize;
2196 nNewSize = (infoLastBlockFile.nUndoSize += nAddSize);
2197 if (!pblocktree->WriteBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2198 return error("FindUndoPos() : cannot write updated block info");
2200 CBlockFileInfo info;
2201 if (!pblocktree->ReadBlockFileInfo(nFile, info))
2202 return error("FindUndoPos() : cannot read block info");
2203 pos.nPos = info.nUndoSize;
2204 nNewSize = (info.nUndoSize += nAddSize);
2205 if (!pblocktree->WriteBlockFileInfo(nFile, info))
2206 return error("FindUndoPos() : cannot write updated block info");
2209 unsigned int nOldChunks = (pos.nPos + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2210 unsigned int nNewChunks = (nNewSize + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
2211 if (nNewChunks > nOldChunks) {
2212 FILE *file = OpenUndoFile(pos);
2214 printf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks * UNDOFILE_CHUNK_SIZE, pos.nFile);
2215 AllocateFileRange(file, pos.nPos, nNewChunks * UNDOFILE_CHUNK_SIZE - pos.nPos);
2223 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2225 // These are checks that are independent of context
2226 // that can be verified before saving an orphan block.
2229 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2230 return DoS(100, error("CheckBlock() : size limits failed"));
2232 // Check proof of work matches claimed amount
2233 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2234 return DoS(50, error("CheckBlock() : proof of work failed"));
2237 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
2238 return error("CheckBlock() : block timestamp too far in the future");
2240 // First transaction must be coinbase, the rest must not be
2241 if (vtx.empty() || !vtx[0].IsCoinBase())
2242 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2243 for (unsigned int i = 1; i < vtx.size(); i++)
2244 if (vtx[i].IsCoinBase())
2245 return DoS(100, error("CheckBlock() : more than one coinbase"));
2247 // Check coinbase timestamp
2248 if (GetBlockTime() > FutureDrift((int64)vtx[0].nTime))
2249 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2251 if (IsProofOfStake())
2253 // Coinbase output should be empty if proof-of-stake block
2254 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2255 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2257 // Second transaction must be coinstake, the rest must not be
2258 if (vtx.empty() || !vtx[1].IsCoinStake())
2259 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2260 for (unsigned int i = 2; i < vtx.size(); i++)
2261 if (vtx[i].IsCoinStake())
2262 return DoS(100, error("CheckBlock() : more than one coinstake"));
2264 // Check coinstake timestamp
2265 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2266 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2270 int64 nReward = GetProofOfWorkReward(nBits);
2271 // Check coinbase reward
2272 if (vtx[0].GetValueOut() > nReward)
2273 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2274 vtx[0].GetValueOut(),
2277 // Should we check proof-of-work block signature or not?
2279 // * Always skip on TestNet
2280 // * Perform checking for the first 9689 blocks
2281 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2283 if(!fTestNet && fCheckSig)
2285 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2287 // check legacy proof-of-work block signature
2288 if (checkEntropySig && !CheckLegacySignature())
2289 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2294 // Check transactions
2295 BOOST_FOREACH(const CTransaction& tx, vtx)
2297 if (!tx.CheckTransaction())
2298 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2300 // check transaction timestamp
2301 if (GetBlockTime() < (int64)tx.nTime)
2302 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2305 // Check for duplicate txids. This is caught by ConnectInputs(),
2306 // but catching it earlier avoids a potential DoS attack:
2308 set<uint256> uniqueTx;
2309 for (unsigned int i=0; i<vtx.size(); i++) {
2310 uniqueTx.insert(GetTxHash(i));
2312 if (uniqueTx.size() != vtx.size())
2313 return DoS(100, error("CheckBlock() : duplicate transaction"));
2315 unsigned int nSigOps = 0;
2316 BOOST_FOREACH(const CTransaction& tx, vtx)
2318 nSigOps += tx.GetLegacySigOpCount();
2320 if (nSigOps > MAX_BLOCK_SIGOPS)
2321 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2323 // Check merkle root
2324 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2325 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2331 bool CBlock::AcceptBlock()
2333 // Check for duplicate
2334 uint256 hash = GetHash();
2335 if (mapBlockIndex.count(hash))
2336 return error("AcceptBlock() : block already in mapBlockIndex");
2338 // Get prev block index
2339 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2340 if (mi == mapBlockIndex.end())
2341 return DoS(10, error("AcceptBlock() : prev block not found"));
2342 CBlockIndex* pindexPrev = (*mi).second;
2343 int nHeight = pindexPrev->nHeight+1;
2345 // Check proof-of-work or proof-of-stake
2346 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2347 return DoS(100, error("AcceptBlock() : incorrect proof-of-%s amount", IsProofOfWork() ? "work" : "stake"));
2349 // Check timestamp against prev
2350 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2351 return error("AcceptBlock() : block's timestamp is too early");
2353 // Check that all transactions are finalized
2354 BOOST_FOREACH(const CTransaction& tx, vtx)
2355 if (!tx.IsFinal(nHeight, GetBlockTime()))
2356 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2358 // Check that the block chain matches the known block chain up to a checkpoint
2359 if (!Checkpoints::CheckHardened(nHeight, hash))
2360 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2362 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2364 // Check that the block satisfies synchronized checkpoint
2365 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2366 return error("AcceptBlock() : rejected by synchronized checkpoint");
2368 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2369 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2371 // Enforce rule that the coinbase starts with serialized block height
2372 CScript expect = CScript() << nHeight;
2373 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2374 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2375 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2377 // Write block to history file
2378 unsigned int nBlockSize = ::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION);
2379 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2380 return error("AcceptBlock() : out of disk space");
2381 CDiskBlockPos blockPos;
2383 if (!FindBlockPos(blockPos, nBlockSize+8, nHeight, nTime))
2384 return error("AcceptBlock() : FindBlockPos failed");
2386 if (!WriteToDisk(blockPos))
2387 return error("AcceptBlock() : WriteToDisk failed");
2388 if (!AddToBlockIndex(blockPos))
2389 return error("AcceptBlock() : AddToBlockIndex failed");
2391 // Relay inventory, but don't relay old inventory during initial block download
2392 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2393 if (hashBestChain == hash)
2396 BOOST_FOREACH(CNode* pnode, vNodes)
2397 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2398 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2401 // Check pending sync-checkpoint
2402 Checkpoints::AcceptPendingSyncCheckpoint();
2407 uint256 CBlockIndex::GetBlockTrust() const
2410 bnTarget.SetCompact(nBits);
2416 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2417 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2421 // Calculate work amount for block
2422 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2424 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2425 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2427 // Return nPoWTrust for the first 12 blocks
2428 if (pprev == NULL || pprev->nHeight < 12)
2431 const CBlockIndex* currentIndex = pprev;
2433 if(IsProofOfStake())
2435 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2437 // Return 1/3 of score if parent block is not the PoW block
2438 if (!pprev->IsProofOfWork())
2439 return (bnNewTrust / 3).getuint256();
2443 // Check last 12 blocks type
2444 while (pprev->nHeight - currentIndex->nHeight < 12)
2446 if (currentIndex->IsProofOfWork())
2448 currentIndex = currentIndex->pprev;
2451 // Return 1/3 of score if less than 3 PoW blocks found
2453 return (bnNewTrust / 3).getuint256();
2455 return bnNewTrust.getuint256();
2459 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2461 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2462 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2463 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2467 // Check last 12 blocks type
2468 while (pprev->nHeight - currentIndex->nHeight < 12)
2470 if (currentIndex->IsProofOfStake())
2472 currentIndex = currentIndex->pprev;
2475 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2477 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2479 bnTarget.SetCompact(pprev->nBits);
2484 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2486 // Return nPoWTrust + full trust score for previous block nBits
2487 return nPoWTrust + bnNewTrust.getuint256();
2491 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2493 unsigned int nFound = 0;
2494 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2496 if (pstart->nVersion >= minVersion)
2498 pstart = pstart->pprev;
2500 return (nFound >= nRequired);
2503 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2505 // Check for duplicate
2506 uint256 hash = pblock->GetHash();
2507 if (mapBlockIndex.count(hash))
2508 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2509 if (mapOrphanBlocks.count(hash))
2510 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2512 // Preliminary checks
2513 if (!pblock->CheckBlock())
2514 return error("ProcessBlock() : CheckBlock FAILED");
2516 if (pblock->IsProofOfStake())
2518 // Limited duplicity on stake: prevents block flood attack
2519 // Duplicate stake allowed only when there is orphan child block
2520 if (setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2521 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());
2523 bool fFatal = false;
2524 uint256 hashProofOfStake;
2526 // Verify proof-of-stake script, hash target and signature
2527 if (!pblock->CheckSignature(fFatal, hashProofOfStake))
2531 // Invalid coinstake script, blockhash signature or no generator defined, nothing to do here
2532 // This also may occur when supplied proof-of-stake doesn't satisfy required target
2534 pfrom->Misbehaving(100);
2535 return error("ProcessBlock() : invalid signatures found in proof-of-stake block %s", hash.ToString().c_str());
2539 // Blockhash and coinstake signatures are OK but target checkings failed
2540 // This may occur during initial block download
2543 pfrom->Misbehaving(1); // Small DoS penalty
2545 printf("WARNING: ProcessBlock(): proof-of-stake target checkings failed for block %s, we'll try again later\n", hash.ToString().c_str());
2550 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2551 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2554 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2555 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2557 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2558 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2560 bnNewBlock.SetCompact(pblock->nBits);
2563 if (pblock->IsProofOfStake())
2564 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2566 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2568 if (bnNewBlock > bnRequired)
2571 pfrom->Misbehaving(100);
2572 return error("ProcessBlock() : block with too little proof-of-%s", pblock->IsProofOfStake() ? "stake" : "work");
2576 // Ask for pending sync-checkpoint if any
2577 if (!IsInitialBlockDownload())
2578 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2580 // If don't already have its previous block, shunt it off to holding area until we get it
2581 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2583 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2584 CBlock* pblock2 = new CBlock(*pblock);
2586 if (pblock2->IsProofOfStake())
2588 // Limited duplicity on stake: prevents block flood attack
2589 // Duplicate stake allowed only when there is orphan child block
2590 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2591 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());
2593 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2596 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2597 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2599 // Ask this guy to fill in what we're missing
2602 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2603 // ppcoin: getblocks may not obtain the ancestor block rejected
2604 // earlier by duplicate-stake check so we ask for it again directly
2605 if (!IsInitialBlockDownload())
2606 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2612 if (!pblock->AcceptBlock())
2613 return error("ProcessBlock() : AcceptBlock FAILED");
2615 // Recursively process any orphan blocks that depended on this one
2616 vector<uint256> vWorkQueue;
2617 vWorkQueue.push_back(hash);
2618 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2620 uint256 hashPrev = vWorkQueue[i];
2621 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2622 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2625 CBlock* pblockOrphan = (*mi).second;
2626 if (pblockOrphan->AcceptBlock())
2627 vWorkQueue.push_back(pblockOrphan->GetHash());
2628 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2629 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2630 delete pblockOrphan;
2632 mapOrphanBlocksByPrev.erase(hashPrev);
2635 printf("ProcessBlock: ACCEPTED\n");
2637 // ppcoin: if responsible for sync-checkpoint send it
2638 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2639 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2644 // attempt to generate suitable proof-of-stake
2645 bool CBlock::SignBlock(CWallet& wallet)
2647 // if we are trying to sign
2648 // something except proof-of-stake block template
2649 if (!vtx[0].vout[0].IsEmpty())
2652 // if we are trying to sign
2653 // a complete proof-of-stake block
2654 if (IsProofOfStake())
2657 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2660 CTransaction txCoinStake;
2661 int64 nSearchTime = txCoinStake.nTime; // search to current time
2663 if (nSearchTime > nLastCoinStakeSearchTime)
2665 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2667 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2669 // make sure coinstake would meet timestamp protocol
2670 // as it would be the same as the block timestamp
2671 vtx[0].nTime = nTime = txCoinStake.nTime;
2672 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2673 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2675 // we have to make sure that we have no future timestamps in
2676 // our transactions set
2677 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2678 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2680 vtx.insert(vtx.begin() + 1, txCoinStake);
2681 hashMerkleRoot = BuildMerkleTree();
2683 // append a signature to our block
2684 return key.Sign(GetHash(), vchBlockSig);
2687 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2688 nLastCoinStakeSearchTime = nSearchTime;
2694 // get generation key
2695 bool CBlock::GetGenerator(CKey& GeneratorKey) const
2697 if(!IsProofOfStake())
2700 vector<valtype> vSolutions;
2701 txnouttype whichType;
2703 const CTxOut& txout = vtx[1].vout[1];
2705 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2707 if (whichType == TX_PUBKEY)
2709 valtype& vchPubKey = vSolutions[0];
2711 return GeneratorKey.SetPubKey(vchPubKey);
2717 // verify proof-of-stake signatures
2718 bool CBlock::CheckSignature(bool& fFatal, uint256& hashProofOfStake) const
2722 // no generator or invalid hash signature means fatal error
2723 fFatal = !GetGenerator(key) || !key.Verify(GetHash(), vchBlockSig);
2728 uint256 hashTarget = 0;
2729 if (!CheckProofOfStake(vtx[1], nBits, hashProofOfStake, hashTarget, fFatal))
2730 return false; // hash target mismatch or invalid coinstake signature
2735 // verify legacy proof-of-work signature
2736 bool CBlock::CheckLegacySignature() const
2738 if (IsProofOfStake())
2741 vector<valtype> vSolutions;
2742 txnouttype whichType;
2744 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2746 const CTxOut& txout = vtx[0].vout[i];
2748 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2751 if (whichType == TX_PUBKEY)
2754 valtype& vchPubKey = vSolutions[0];
2756 if (!key.SetPubKey(vchPubKey))
2758 if (vchBlockSig.empty())
2760 if(!key.Verify(GetHash(), vchBlockSig))
2769 bool CheckDiskSpace(uint64 nAdditionalBytes)
2771 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2773 // Check for nMinDiskSpace bytes (currently 50MB)
2774 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2777 string strMessage = _("Warning: Disk space is low!");
2778 strMiscWarning = strMessage;
2779 printf("*** %s\n", strMessage.c_str());
2780 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2788 CCriticalSection cs_LastBlockFile;
2789 CBlockFileInfo infoLastBlockFile;
2790 int nLastBlockFile = 0;
2792 FILE* OpenDiskFile(const CDiskBlockPos &pos, const char *prefix, bool fReadOnly)
2796 boost::filesystem::path path = GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix, pos.nFile);
2797 boost::filesystem::create_directories(path.parent_path());
2798 FILE* file = fopen(path.string().c_str(), "rb+");
2799 if (!file && !fReadOnly)
2800 file = fopen(path.string().c_str(), "wb+");
2802 printf("Unable to open file %s\n", path.string().c_str());
2806 if (fseek(file, pos.nPos, SEEK_SET)) {
2807 printf("Unable to seek to position %u of %s\n", pos.nPos, path.string().c_str());
2815 FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly) {
2816 return OpenDiskFile(pos, "blk", fReadOnly);
2819 FILE *OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly) {
2820 return OpenDiskFile(pos, "rev", fReadOnly);
2823 CBlockIndex * InsertBlockIndex(uint256 hash)
2829 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
2830 if (mi != mapBlockIndex.end())
2831 return (*mi).second;
2834 CBlockIndex* pindexNew = new CBlockIndex();
2836 throw runtime_error("InsertBlockIndex() : new CBlockIndex failed");
2837 mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2838 pindexNew->phashBlock = &((*mi).first);
2843 bool static LoadBlockIndexDB()
2845 if (!pblocktree->LoadBlockIndexGuts())
2848 if (fRequestShutdown)
2851 // Calculate nChainTrust
2852 vector<pair<int, CBlockIndex*> > vSortedByHeight;
2853 vSortedByHeight.reserve(mapBlockIndex.size());
2854 BOOST_FOREACH(const PAIRTYPE(uint256, CBlockIndex*)& item, mapBlockIndex)
2856 CBlockIndex* pindex = item.second;
2857 vSortedByHeight.push_back(make_pair(pindex->nHeight, pindex));
2859 sort(vSortedByHeight.begin(), vSortedByHeight.end());
2860 BOOST_FOREACH(const PAIRTYPE(int, CBlockIndex*)& item, vSortedByHeight)
2862 CBlockIndex* pindex = item.second;
2863 pindex->nChainTrust = (pindex->pprev ? pindex->pprev->nChainTrust : 0) + pindex->GetBlockTrust();
2864 pindex->nChainTx = (pindex->pprev ? pindex->pprev->nChainTx : 0) + pindex->nTx;
2865 if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TRANSACTIONS && !(pindex->nStatus & BLOCK_FAILED_MASK))
2866 setBlockIndexValid.insert(pindex);
2868 // Calculate stake modifier checksum
2869 pindex->nStakeModifierChecksum = GetStakeModifierChecksum(pindex);
2870 if (!CheckStakeModifierCheckpoints(pindex->nHeight, pindex->nStakeModifierChecksum))
2871 return error("LoadBlockIndexDB() : Failed stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindex->nHeight, pindex->nStakeModifier);
2874 // Load block file info
2875 pblocktree->ReadLastBlockFile(nLastBlockFile);
2876 printf("LoadBlockIndexDB(): last block file = %i\n", nLastBlockFile);
2877 if (pblocktree->ReadBlockFileInfo(nLastBlockFile, infoLastBlockFile))
2878 printf("LoadBlockIndexDB(): last block file: %s\n", infoLastBlockFile.ToString().c_str());
2880 // Load hashBestChain pointer to end of best chain
2881 pindexBest = pcoinsTip->GetBestBlock();
2882 if (pindexBest == NULL)
2884 if (pindexGenesisBlock == NULL)
2886 return error("LoadBlockIndexDB() : hashBestChain not loaded");
2888 hashBestChain = pindexBest->GetBlockHash();
2889 nBestHeight = pindexBest->nHeight;
2890 nBestChainTrust = pindexBest->nChainTrust;
2892 // set 'next' pointers in best chain
2893 CBlockIndex *pindex = pindexBest;
2894 while(pindex != NULL && pindex->pprev != NULL) {
2895 CBlockIndex *pindexPrev = pindex->pprev;
2896 pindexPrev->pnext = pindex;
2897 pindex = pindexPrev;
2899 printf("LoadBlockIndexDB(): hashBestChain=%s height=%d date=%s\n",
2900 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2901 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2903 // Load sync-checkpoint
2904 if (!pblocktree->ReadSyncCheckpoint(Checkpoints::hashSyncCheckpoint))
2905 return error("LoadBlockIndexDB() : hashSyncCheckpoint not loaded");
2906 printf("LoadBlockIndexDB(): synchronized checkpoint %s\n", Checkpoints::hashSyncCheckpoint.ToString().c_str());
2908 // Load bnBestInvalidTrust, OK if it doesn't exist
2909 CBigNum bnBestInvalidTrust;
2910 pblocktree->ReadBestInvalidTrust(bnBestInvalidTrust);
2911 nBestInvalidTrust = bnBestInvalidTrust.getuint256();
2913 // Verify blocks in the best chain
2914 int nCheckLevel = GetArg("-checklevel", 1);
2915 int nCheckDepth = GetArg( "-checkblocks", 2500);
2916 if (nCheckDepth == 0)
2917 nCheckDepth = 1000000000; // suffices until the year 19000
2918 if (nCheckDepth > nBestHeight)
2919 nCheckDepth = nBestHeight;
2920 printf("Verifying last %i blocks at level %i\n", nCheckDepth, nCheckLevel);
2921 CBlockIndex* pindexFork = NULL;
2922 for (CBlockIndex* pindex = pindexBest; pindex && pindex->pprev; pindex = pindex->pprev)
2924 if (fRequestShutdown || pindex->nHeight < nBestHeight-nCheckDepth)
2927 if (!block.ReadFromDisk(pindex))
2928 return error("LoadBlockIndexDB() : block.ReadFromDisk failed");
2929 // check level 1: verify block validity
2930 if (nCheckLevel>0 && !block.CheckBlock())
2932 printf("LoadBlockIndexDB() : *** found bad block at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString().c_str());
2933 pindexFork = pindex->pprev;
2935 // TODO: stronger verifications
2937 if (pindexFork && !fRequestShutdown)
2940 return error("LoadBlockIndexDB(): chain database corrupted");
2947 bool LoadBlockIndex(bool fAllowNew)
2949 CBigNum bnTrustedModulus;
2953 pchMessageStart[0] = 0xcd;
2954 pchMessageStart[1] = 0xf2;
2955 pchMessageStart[2] = 0xc0;
2956 pchMessageStart[3] = 0xef;
2958 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2959 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2960 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2961 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2962 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2963 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2967 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2970 // Set up the Zerocoin Params object
2971 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2974 // Load block index from databases
2976 if (!LoadBlockIndexDB())
2980 // Init with genesis block
2982 if (mapBlockIndex.empty())
2991 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2992 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2993 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2995 // vMerkleTree: 4cb33b3b6a
2999 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
3000 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
3001 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
3003 // vMerkleTree: 4cb33b3b6a
3005 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
3007 txNew.nTime = 1360105017;
3008 txNew.vin.resize(1);
3009 txNew.vout.resize(1);
3010 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
3011 txNew.vout[0].SetEmpty();
3013 block.vtx.push_back(txNew);
3014 block.hashPrevBlock = 0;
3015 block.hashMerkleRoot = block.BuildMerkleTree();
3017 block.nTime = 1360105017;
3018 block.nBits = bnProofOfWorkLimit.GetCompact();
3019 block.nNonce = !fTestNet ? 1575379 : 46534;
3022 uint256 hash = block.GetHash();
3023 printf("%s\n", hash.ToString().c_str());
3024 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
3026 assert(hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
3027 assert(block.CheckBlock());
3029 // Start new block file
3030 unsigned int nBlockSize = ::GetSerializeSize(block, SER_DISK, CLIENT_VERSION);
3031 CDiskBlockPos blockPos;
3032 if (!FindBlockPos(blockPos, nBlockSize+8, 0, block.nTime))
3033 return error("AcceptBlock() : FindBlockPos failed");
3034 if (!block.WriteToDisk(blockPos))
3035 return error("LoadBlockIndex() : writing genesis block to disk failed");
3036 if (!block.AddToBlockIndex(blockPos))
3037 return error("LoadBlockIndex() : genesis block not accepted");
3039 // initialize synchronized checkpoint
3040 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
3041 return error("LoadBlockIndex() : failed to init sync checkpoint");
3044 string strPubKey = "";
3045 // if checkpoint master key changed must reset sync-checkpoint
3046 if (!pblocktree->ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
3049 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3050 // write checkpoint master key to db
3051 if (!pblocktree->WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
3052 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
3055 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
3056 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
3062 void PrintBlockTree()
3064 // pre-compute tree structure
3065 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
3066 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
3068 CBlockIndex* pindex = (*mi).second;
3069 mapNext[pindex->pprev].push_back(pindex);
3071 //while (rand() % 3 == 0)
3072 // mapNext[pindex->pprev].push_back(pindex);
3075 vector<pair<int, CBlockIndex*> > vStack;
3076 vStack.push_back(make_pair(0, pindexGenesisBlock));
3079 while (!vStack.empty())
3081 int nCol = vStack.back().first;
3082 CBlockIndex* pindex = vStack.back().second;
3085 // print split or gap
3086 if (nCol > nPrevCol)
3088 for (int i = 0; i < nCol-1; i++)
3092 else if (nCol < nPrevCol)
3094 for (int i = 0; i < nCol; i++)
3101 for (int i = 0; i < nCol; i++)
3106 block.ReadFromDisk(pindex);
3107 printf("%d (blk%05u.dat:0x%x) %s tx %"PRIszu"",
3109 pindex->GetBlockPos().nFile, pindex->GetBlockPos().nPos,
3110 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
3113 PrintWallets(block);
3115 // put the main time-chain first
3116 vector<CBlockIndex*>& vNext = mapNext[pindex];
3117 for (unsigned int i = 0; i < vNext.size(); i++)
3119 if (vNext[i]->pnext)
3121 swap(vNext[0], vNext[i]);
3127 for (unsigned int i = 0; i < vNext.size(); i++)
3128 vStack.push_back(make_pair(nCol+i, vNext[i]));
3132 bool LoadExternalBlockFile(FILE* fileIn)
3134 int64 nStart = GetTimeMillis();
3140 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
3141 unsigned int nPos = 0;
3142 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
3144 unsigned char pchData[65536];
3146 fseek(blkdat, nPos, SEEK_SET);
3147 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
3150 nPos = (unsigned int)-1;
3153 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
3156 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
3158 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
3161 nPos += ((unsigned char*)nFind - pchData) + 1;
3164 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
3165 } while(!fRequestShutdown);
3166 if (nPos == (unsigned int)-1)
3168 fseek(blkdat, nPos, SEEK_SET);
3171 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3175 if (ProcessBlock(NULL,&block))
3183 catch (std::exception &e) {
3184 printf("%s() : Deserialize or I/O error caught during load\n",
3185 __PRETTY_FUNCTION__);
3188 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
3192 //////////////////////////////////////////////////////////////////////////////
3197 extern map<uint256, CAlert> mapAlerts;
3198 extern CCriticalSection cs_mapAlerts;
3200 extern string strMintMessage;
3201 extern string strMintWarning;
3203 string GetWarnings(string strFor)
3206 string strStatusBar;
3209 if (GetBoolArg("-testsafemode"))
3212 // ppcoin: wallet lock warning for minting
3213 if (strMintWarning != "")
3216 strStatusBar = strMintWarning;
3219 // Misc warnings like out of disk space and clock is wrong
3220 if (strMiscWarning != "")
3223 strStatusBar = strMiscWarning;
3226 // * Should not enter safe mode for longer invalid chain
3227 // * If sync-checkpoint is too old do not enter safe mode
3228 // * Display warning only in the STRICT mode
3229 if (CheckpointsMode == Checkpoints::STRICT && Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) &&
3230 !fTestNet && !IsInitialBlockDownload())
3233 strStatusBar = _("WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.");
3236 // ppcoin: if detected invalid checkpoint enter safe mode
3237 if (Checkpoints::hashInvalidCheckpoint != 0)
3240 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3246 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3248 const CAlert& alert = item.second;
3249 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3251 nPriority = alert.nPriority;
3252 strStatusBar = alert.strStatusBar;
3253 if (nPriority > 1000)
3254 strRPC = strStatusBar;
3259 if (strFor == "statusbar")
3260 return strStatusBar;
3261 else if (strFor == "rpc")
3263 assert(!"GetWarnings() : invalid parameter");
3274 //////////////////////////////////////////////////////////////////////////////
3280 bool static AlreadyHave(const CInv& inv)
3286 bool txInMap = false;
3289 txInMap = mempool.exists(inv.hash);
3291 return txInMap || mapOrphanTransactions.count(inv.hash) ||
3292 pcoinsTip->HaveCoins(inv.hash);
3295 return mapBlockIndex.count(inv.hash) ||
3296 mapOrphanBlocks.count(inv.hash);
3298 // Don't know what it is, just say we already got one
3305 // The message start string is designed to be unlikely to occur in normal data.
3306 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3307 // a large 4-byte int at any alignment.
3308 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3310 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3312 static map<CService, CPubKey> mapReuseKey;
3313 RandAddSeedPerfmon();
3315 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3316 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3318 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3322 if (strCommand == "version")
3324 // Each connection can only send one version message
3325 if (pfrom->nVersion != 0)
3327 pfrom->Misbehaving(1);
3335 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3336 if (pfrom->nVersion < MIN_PROTO_VERSION)
3338 // Since February 20, 2012, the protocol is initiated at version 209,
3339 // and earlier versions are no longer supported
3340 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3341 pfrom->fDisconnect = true;
3345 if (pfrom->nVersion == 10300)
3346 pfrom->nVersion = 300;
3348 vRecv >> addrFrom >> nNonce;
3350 vRecv >> pfrom->strSubVer;
3352 vRecv >> pfrom->nStartingHeight;
3354 if (pfrom->fInbound && addrMe.IsRoutable())
3356 pfrom->addrLocal = addrMe;
3360 // Disconnect if we connected to ourself
3361 if (nNonce == nLocalHostNonce && nNonce > 1)
3363 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3364 pfrom->fDisconnect = true;
3368 if (pfrom->nVersion < 60010)
3370 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3371 pfrom->fDisconnect = true;
3375 // record my external IP reported by peer
3376 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3377 addrSeenByPeer = addrMe;
3379 // Be shy and don't send version until we hear
3380 if (pfrom->fInbound)
3381 pfrom->PushVersion();
3383 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3385 AddTimeData(pfrom->addr, nTime);
3388 pfrom->PushMessage("verack");
3389 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3391 if (!pfrom->fInbound)
3393 // Advertise our address
3394 if (!fNoListen && !IsInitialBlockDownload())
3396 CAddress addr = GetLocalAddress(&pfrom->addr);
3397 if (addr.IsRoutable())
3398 pfrom->PushAddress(addr);
3401 // Get recent addresses
3402 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3404 pfrom->PushMessage("getaddr");
3405 pfrom->fGetAddr = true;
3407 addrman.Good(pfrom->addr);
3409 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3411 addrman.Add(addrFrom, addrFrom);
3412 addrman.Good(addrFrom);
3416 // Ask the first connected node for block updates
3417 static int nAskedForBlocks = 0;
3418 if (!pfrom->fClient && !pfrom->fOneShot &&
3419 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3420 (pfrom->nVersion < NOBLKS_VERSION_START ||
3421 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3422 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3425 pfrom->PushGetBlocks(pindexBest, uint256(0));
3431 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3432 item.second.RelayTo(pfrom);
3435 // Relay sync-checkpoint
3437 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3438 if (!Checkpoints::checkpointMessage.IsNull())
3439 Checkpoints::checkpointMessage.RelayTo(pfrom);
3442 pfrom->fSuccessfullyConnected = true;
3444 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());
3446 cPeerBlockCounts.input(pfrom->nStartingHeight);
3448 // ppcoin: ask for pending sync-checkpoint if any
3449 if (!IsInitialBlockDownload())
3450 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3454 else if (pfrom->nVersion == 0)
3456 // Must have a version message before anything else
3457 pfrom->Misbehaving(1);
3462 else if (strCommand == "verack")
3464 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3468 else if (strCommand == "addr")
3470 vector<CAddress> vAddr;
3473 // Don't want addr from older versions unless seeding
3474 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3476 if (vAddr.size() > 1000)
3478 pfrom->Misbehaving(20);
3479 return error("message addr size() = %"PRIszu"", vAddr.size());
3482 // Store the new addresses
3483 vector<CAddress> vAddrOk;
3484 int64 nNow = GetAdjustedTime();
3485 int64 nSince = nNow - 10 * 60;
3486 BOOST_FOREACH(CAddress& addr, vAddr)
3490 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3491 addr.nTime = nNow - 5 * 24 * 60 * 60;
3492 pfrom->AddAddressKnown(addr);
3493 bool fReachable = IsReachable(addr);
3494 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3496 // Relay to a limited number of other nodes
3499 // Use deterministic randomness to send to the same nodes for 24 hours
3500 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3501 static uint256 hashSalt;
3503 hashSalt = GetRandHash();
3504 uint64 hashAddr = addr.GetHash();
3505 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3506 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3507 multimap<uint256, CNode*> mapMix;
3508 BOOST_FOREACH(CNode* pnode, vNodes)
3510 if (pnode->nVersion < CADDR_TIME_VERSION)
3512 unsigned int nPointer;
3513 memcpy(&nPointer, &pnode, sizeof(nPointer));
3514 uint256 hashKey = hashRand ^ nPointer;
3515 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3516 mapMix.insert(make_pair(hashKey, pnode));
3518 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3519 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3520 ((*mi).second)->PushAddress(addr);
3523 // Do not store addresses outside our network
3525 vAddrOk.push_back(addr);
3527 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3528 if (vAddr.size() < 1000)
3529 pfrom->fGetAddr = false;
3530 if (pfrom->fOneShot)
3531 pfrom->fDisconnect = true;
3534 else if (strCommand == "inv")
3538 if (vInv.size() > MAX_INV_SZ)
3540 pfrom->Misbehaving(20);
3541 return error("message inv size() = %"PRIszu"", vInv.size());
3544 // find last block in inv vector
3545 unsigned int nLastBlock = (unsigned int)(-1);
3546 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3547 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3548 nLastBlock = vInv.size() - 1 - nInv;
3552 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3554 const CInv &inv = vInv[nInv];
3558 pfrom->AddInventoryKnown(inv);
3560 bool fAlreadyHave = AlreadyHave(inv);
3562 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3566 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3567 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3568 } else if (nInv == nLastBlock) {
3569 // In case we are on a very long side-chain, it is possible that we already have
3570 // the last block in an inv bundle sent in response to getblocks. Try to detect
3571 // this situation and push another getblocks to continue.
3572 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3574 printf("force request: %s\n", inv.ToString().c_str());
3577 // Track requests for our stuff
3578 Inventory(inv.hash);
3583 else if (strCommand == "getdata")
3587 if (vInv.size() > MAX_INV_SZ)
3589 pfrom->Misbehaving(20);
3590 return error("message getdata size() = %"PRIszu"", vInv.size());
3593 if (fDebugNet || (vInv.size() != 1))
3594 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3596 BOOST_FOREACH(const CInv& inv, vInv)
3600 if (fDebugNet || (vInv.size() == 1))
3601 printf("received getdata for: %s\n", inv.ToString().c_str());
3603 if (inv.type == MSG_BLOCK)
3605 // Send block from disk
3606 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3607 if (mi != mapBlockIndex.end())
3610 block.ReadFromDisk((*mi).second);
3611 pfrom->PushMessage("block", block);
3613 // Trigger them to send a getblocks request for the next batch of inventory
3614 if (inv.hash == pfrom->hashContinue)
3616 // ppcoin: send latest proof-of-work block to allow the
3617 // download node to accept as orphan (proof-of-stake
3618 // block might be rejected by stake connection check)
3620 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3621 pfrom->PushMessage("inv", vInv);
3622 pfrom->hashContinue = 0;
3626 else if (inv.IsKnownType())
3628 // Send stream from relay memory
3629 bool pushed = false;
3632 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3633 if (mi != mapRelay.end()) {
3634 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3638 if (!pushed && inv.type == MSG_TX) {
3640 if (mempool.exists(inv.hash)) {
3641 CTransaction tx = mempool.lookup(inv.hash);
3642 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3645 pfrom->PushMessage("tx", ss);
3650 // Track requests for our stuff
3651 Inventory(inv.hash);
3656 else if (strCommand == "getblocks")
3658 CBlockLocator locator;
3660 vRecv >> locator >> hashStop;
3662 // Find the last block the caller has in the main chain
3663 CBlockIndex* pindex = locator.GetBlockIndex();
3665 // Send the rest of the chain
3667 pindex = pindex->pnext;
3669 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3670 for (; pindex; pindex = pindex->pnext)
3672 if (pindex->GetBlockHash() == hashStop)
3674 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3675 // ppcoin: tell downloading node about the latest block if it's
3676 // without risk being rejected due to stake connection check
3677 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3678 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3681 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3684 // When this block is requested, we'll send an inv that'll make them
3685 // getblocks the next batch of inventory.
3686 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3687 pfrom->hashContinue = pindex->GetBlockHash();
3692 else if (strCommand == "checkpoint")
3694 CSyncCheckpoint checkpoint;
3695 vRecv >> checkpoint;
3697 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3700 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3702 BOOST_FOREACH(CNode* pnode, vNodes)
3703 checkpoint.RelayTo(pnode);
3707 else if (strCommand == "getheaders")
3709 CBlockLocator locator;
3711 vRecv >> locator >> hashStop;
3713 CBlockIndex* pindex = NULL;
3714 if (locator.IsNull())
3716 // If locator is null, return the hashStop block
3717 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3718 if (mi == mapBlockIndex.end())
3720 pindex = (*mi).second;
3724 // Find the last block the caller has in the main chain
3725 pindex = locator.GetBlockIndex();
3727 pindex = pindex->pnext;
3730 vector<CBlock> vHeaders;
3732 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3733 for (; pindex; pindex = pindex->pnext)
3735 vHeaders.push_back(pindex->GetBlockHeader());
3736 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3739 pfrom->PushMessage("headers", vHeaders);
3743 else if (strCommand == "tx")
3745 vector<uint256> vWorkQueue;
3746 vector<uint256> vEraseQueue;
3747 CDataStream vMsg(vRecv);
3751 CInv inv(MSG_TX, tx.GetHash());
3752 pfrom->AddInventoryKnown(inv);
3754 bool fMissingInputs = false;
3755 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
3757 SyncWithWallets(inv.hash, tx, NULL, true);
3758 RelayTransaction(tx, inv.hash);
3759 mapAlreadyAskedFor.erase(inv);
3760 vWorkQueue.push_back(inv.hash);
3761 vEraseQueue.push_back(inv.hash);
3763 // Recursively process any orphan transactions that depended on this one
3764 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3766 uint256 hashPrev = vWorkQueue[i];
3767 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3768 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3771 const uint256& orphanTxHash = *mi;
3772 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3773 bool fMissingInputs2 = false;
3775 if (orphanTx.AcceptToMemoryPool(true, &fMissingInputs2))
3777 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3778 SyncWithWallets(inv.hash, tx, NULL, true);
3779 RelayTransaction(orphanTx, orphanTxHash);
3780 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3781 vWorkQueue.push_back(orphanTxHash);
3782 vEraseQueue.push_back(orphanTxHash);
3784 else if (!fMissingInputs2)
3787 vEraseQueue.push_back(orphanTxHash);
3788 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3793 BOOST_FOREACH(uint256 hash, vEraseQueue)
3794 EraseOrphanTx(hash);
3796 else if (fMissingInputs)
3800 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3801 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3803 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3805 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3809 else if (strCommand == "block")
3813 uint256 hashBlock = block.GetHash();
3815 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3818 CInv inv(MSG_BLOCK, hashBlock);
3819 pfrom->AddInventoryKnown(inv);
3821 if (ProcessBlock(pfrom, &block))
3822 mapAlreadyAskedFor.erase(inv);
3823 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3827 else if (strCommand == "getaddr")
3829 // Don't return addresses older than nCutOff timestamp
3830 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3831 pfrom->vAddrToSend.clear();
3832 vector<CAddress> vAddr = addrman.GetAddr();
3833 BOOST_FOREACH(const CAddress &addr, vAddr)
3834 if(addr.nTime > nCutOff)
3835 pfrom->PushAddress(addr);
3839 else if (strCommand == "mempool")
3841 std::vector<uint256> vtxid;
3842 mempool.queryHashes(vtxid);
3844 for (unsigned int i = 0; i < vtxid.size(); i++) {
3845 CInv inv(MSG_TX, vtxid[i]);
3846 vInv.push_back(inv);
3847 if (i == (MAX_INV_SZ - 1))
3850 if (vInv.size() > 0)
3851 pfrom->PushMessage("inv", vInv);
3855 else if (strCommand == "checkorder")
3860 if (!GetBoolArg("-allowreceivebyip"))
3862 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3869 /// we have a chance to check the order here
3871 // Keep giving the same key to the same ip until they use it
3872 if (!mapReuseKey.count(pfrom->addr))
3873 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3875 // Send back approval of order and pubkey to use
3876 CScript scriptPubKey;
3877 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3878 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3882 else if (strCommand == "reply")
3887 CRequestTracker tracker;
3889 LOCK(pfrom->cs_mapRequests);
3890 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3891 if (mi != pfrom->mapRequests.end())
3893 tracker = (*mi).second;
3894 pfrom->mapRequests.erase(mi);
3897 if (!tracker.IsNull())
3898 tracker.fn(tracker.param1, vRecv);
3902 else if (strCommand == "ping")
3904 if (pfrom->nVersion > BIP0031_VERSION)
3908 // Echo the message back with the nonce. This allows for two useful features:
3910 // 1) A remote node can quickly check if the connection is operational
3911 // 2) Remote nodes can measure the latency of the network thread. If this node
3912 // is overloaded it won't respond to pings quickly and the remote node can
3913 // avoid sending us more work, like chain download requests.
3915 // The nonce stops the remote getting confused between different pings: without
3916 // it, if the remote node sends a ping once per second and this node takes 5
3917 // seconds to respond to each, the 5th ping the remote sends would appear to
3918 // return very quickly.
3919 pfrom->PushMessage("pong", nonce);
3924 else if (strCommand == "alert")
3929 uint256 alertHash = alert.GetHash();
3930 if (pfrom->setKnown.count(alertHash) == 0)
3932 if (alert.ProcessAlert())
3935 pfrom->setKnown.insert(alertHash);
3938 BOOST_FOREACH(CNode* pnode, vNodes)
3939 alert.RelayTo(pnode);
3943 // Small DoS penalty so peers that send us lots of
3944 // duplicate/expired/invalid-signature/whatever alerts
3945 // eventually get banned.
3946 // This isn't a Misbehaving(100) (immediate ban) because the
3947 // peer might be an older or different implementation with
3948 // a different signature key, etc.
3949 pfrom->Misbehaving(10);
3957 // Ignore unknown commands for extensibility
3961 // Update the last seen time for this node's address
3962 if (pfrom->fNetworkNode)
3963 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3964 AddressCurrentlyConnected(pfrom->addr);
3970 bool ProcessMessages(CNode* pfrom)
3972 CDataStream& vRecv = pfrom->vRecv;
3976 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3980 // (4) message start
3989 // Don't bother if send buffer is too full to respond anyway
3990 if (pfrom->vSend.size() >= SendBufferSize())
3993 // Scan for message start
3994 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3995 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3996 if (vRecv.end() - pstart < nHeaderSize)
3998 if ((int)vRecv.size() > nHeaderSize)
4000 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
4001 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
4005 if (pstart - vRecv.begin() > 0)
4006 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
4007 vRecv.erase(vRecv.begin(), pstart);
4010 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
4015 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
4018 string strCommand = hdr.GetCommand();
4021 unsigned int nMessageSize = hdr.nMessageSize;
4022 if (nMessageSize > MAX_SIZE)
4024 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
4027 if (nMessageSize > vRecv.size())
4029 // Rewind and wait for rest of message
4030 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
4035 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
4036 unsigned int nChecksum = 0;
4037 memcpy(&nChecksum, &hash, sizeof(nChecksum));
4038 if (nChecksum != hdr.nChecksum)
4040 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
4041 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
4045 // Copy message to its own buffer
4046 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
4047 vRecv.ignore(nMessageSize);
4055 fRet = ProcessMessage(pfrom, strCommand, vMsg);
4060 catch (std::ios_base::failure& e)
4062 if (strstr(e.what(), "end of data"))
4064 // Allow exceptions from under-length message on vRecv
4065 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());
4067 else if (strstr(e.what(), "size too large"))
4069 // Allow exceptions from over-long size
4070 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
4074 PrintExceptionContinue(&e, "ProcessMessages()");
4077 catch (std::exception& e) {
4078 PrintExceptionContinue(&e, "ProcessMessages()");
4080 PrintExceptionContinue(NULL, "ProcessMessages()");
4084 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
4092 bool SendMessages(CNode* pto, bool fSendTrickle)
4094 TRY_LOCK(cs_main, lockMain);
4096 // Don't send anything until we get their version message
4097 if (pto->nVersion == 0)
4100 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
4102 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
4104 if (pto->nVersion > BIP0031_VERSION)
4105 pto->PushMessage("ping", nonce);
4107 pto->PushMessage("ping");
4110 // Resend wallet transactions that haven't gotten in a block yet
4111 ResendWalletTransactions();
4113 // Address refresh broadcast
4114 static int64 nLastRebroadcast;
4115 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
4119 BOOST_FOREACH(CNode* pnode, vNodes)
4121 // Periodically clear setAddrKnown to allow refresh broadcasts
4122 if (nLastRebroadcast)
4123 pnode->setAddrKnown.clear();
4125 // Rebroadcast our address
4128 CAddress addr = GetLocalAddress(&pnode->addr);
4129 if (addr.IsRoutable())
4130 pnode->PushAddress(addr);
4134 nLastRebroadcast = GetTime();
4142 vector<CAddress> vAddr;
4143 vAddr.reserve(pto->vAddrToSend.size());
4144 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
4146 // returns true if wasn't already contained in the set
4147 if (pto->setAddrKnown.insert(addr).second)
4149 vAddr.push_back(addr);
4150 // receiver rejects addr messages larger than 1000
4151 if (vAddr.size() >= 1000)
4153 pto->PushMessage("addr", vAddr);
4158 pto->vAddrToSend.clear();
4160 pto->PushMessage("addr", vAddr);
4165 // Message: inventory
4168 vector<CInv> vInvWait;
4170 LOCK(pto->cs_inventory);
4171 vInv.reserve(pto->vInventoryToSend.size());
4172 vInvWait.reserve(pto->vInventoryToSend.size());
4173 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4175 if (pto->setInventoryKnown.count(inv))
4178 // trickle out tx inv to protect privacy
4179 if (inv.type == MSG_TX && !fSendTrickle)
4181 // 1/4 of tx invs blast to all immediately
4182 static uint256 hashSalt;
4184 hashSalt = GetRandHash();
4185 uint256 hashRand = inv.hash ^ hashSalt;
4186 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4187 bool fTrickleWait = ((hashRand & 3) != 0);
4189 // always trickle our own transactions
4193 if (GetTransaction(inv.hash, wtx))
4195 fTrickleWait = true;
4200 vInvWait.push_back(inv);
4205 // returns true if wasn't already contained in the set
4206 if (pto->setInventoryKnown.insert(inv).second)
4208 vInv.push_back(inv);
4209 if (vInv.size() >= 1000)
4211 pto->PushMessage("inv", vInv);
4216 pto->vInventoryToSend = vInvWait;
4219 pto->PushMessage("inv", vInv);
4225 vector<CInv> vGetData;
4226 int64 nNow = GetTime() * 1000000;
4227 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4229 const CInv& inv = (*pto->mapAskFor.begin()).second;
4230 if (!AlreadyHave(inv))
4233 printf("sending getdata: %s\n", inv.ToString().c_str());
4234 vGetData.push_back(inv);
4235 if (vGetData.size() >= 1000)
4237 pto->PushMessage("getdata", vGetData);
4240 mapAlreadyAskedFor[inv] = nNow;
4242 pto->mapAskFor.erase(pto->mapAskFor.begin());
4244 if (!vGetData.empty())
4245 pto->PushMessage("getdata", vGetData);
4251 // Amount compression:
4252 // * If the amount is 0, output 0
4253 // * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)
4254 // * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)
4255 // * call the result n
4256 // * output 1 + 10*(9*n + d - 1) + e
4257 // * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9
4258 // (this is decodable, as d is in [1-9] and e is in [0-9])
4260 uint64 CTxOutCompressor::CompressAmount(uint64 n)
4265 while (((n % 10) == 0) && e < 9) {
4271 assert(d >= 1 && d <= 9);
4273 return 1 + (n*9 + d - 1)*10 + e;
4275 return 1 + (n - 1)*10 + 9;
4279 uint64 CTxOutCompressor::DecompressAmount(uint64 x)
4281 // x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9
4285 // x = 10*(9*n + d - 1) + e
4291 int d = (x % 9) + 1;