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 license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 CBlockIndex* pindexGenesisBlock = NULL;
36 CBigNum bnBestChainWork = 0;
37 CBigNum bnBestInvalidWork = 0;
38 uint256 hashBestChain = 0;
39 CBlockIndex* pindexBest = NULL;
40 int64 nTimeBestReceived = 0;
42 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
44 map<uint256, CBlock*> mapOrphanBlocks;
45 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
47 map<uint256, CDataStream*> mapOrphanTransactions;
48 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
50 // Constant stuff for coinbase transactions we create:
51 CScript COINBASE_FLAGS;
53 const string strMessageMagic = "Bitcoin Signed Message:\n";
59 int64 nTransactionFee = 0;
63 //////////////////////////////////////////////////////////////////////////////
65 // dispatching functions
68 // These functions dispatch to one or all registered wallets
71 void RegisterWallet(CWallet* pwalletIn)
73 CRITICAL_BLOCK(cs_setpwalletRegistered)
75 setpwalletRegistered.insert(pwalletIn);
79 void UnregisterWallet(CWallet* pwalletIn)
81 CRITICAL_BLOCK(cs_setpwalletRegistered)
83 setpwalletRegistered.erase(pwalletIn);
87 // check whether the passed transaction is from us
88 bool static IsFromMe(CTransaction& tx)
90 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
91 if (pwallet->IsFromMe(tx))
96 // get the wallet transaction with the given hash (if it exists)
97 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
99 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
100 if (pwallet->GetTransaction(hashTx,wtx))
105 // erases transaction with the given hash from all wallets
106 void static EraseFromWallets(uint256 hash)
108 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
109 pwallet->EraseFromWallet(hash);
112 // make sure all wallets know about the given transaction, in the given block
113 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
115 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
116 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
119 // notify wallets about a new best chain
120 void static SetBestChain(const CBlockLocator& loc)
122 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
123 pwallet->SetBestChain(loc);
126 // notify wallets about an updated transaction
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
134 void static PrintWallets(const CBlock& block)
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 pwallet->PrintWallet(block);
140 // notify wallets about an incoming inventory (for request counts)
141 void static Inventory(const uint256& hash)
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->Inventory(hash);
147 // ask wallets to resend their transactions
148 void static ResendWalletTransactions()
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->ResendWalletTransactions();
160 //////////////////////////////////////////////////////////////////////////////
162 // mapOrphanTransactions
165 void AddOrphanTx(const CDataStream& vMsg)
168 CDataStream(vMsg) >> tx;
169 uint256 hash = tx.GetHash();
170 if (mapOrphanTransactions.count(hash))
173 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
174 BOOST_FOREACH(const CTxIn& txin, tx.vin)
175 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
178 void static EraseOrphanTx(uint256 hash)
180 if (!mapOrphanTransactions.count(hash))
182 const CDataStream* pvMsg = mapOrphanTransactions[hash];
184 CDataStream(*pvMsg) >> tx;
185 BOOST_FOREACH(const CTxIn& txin, tx.vin)
187 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
188 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
190 if ((*mi).second == pvMsg)
191 mapOrphanTransactionsByPrev.erase(mi++);
197 mapOrphanTransactions.erase(hash);
200 int LimitOrphanTxSize(int nMaxOrphans)
203 while (mapOrphanTransactions.size() > nMaxOrphans)
205 // Evict a random orphan:
206 std::vector<unsigned char> randbytes(32);
207 RAND_bytes(&randbytes[0], 32);
208 uint256 randomhash(randbytes);
209 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
210 if (it == mapOrphanTransactions.end())
211 it = mapOrphanTransactions.begin();
212 EraseOrphanTx(it->first);
224 //////////////////////////////////////////////////////////////////////////////
226 // CTransaction and CTxIndex
229 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
232 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
234 if (!ReadFromDisk(txindexRet.pos))
236 if (prevout.n >= vout.size())
244 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
247 return ReadFromDisk(txdb, prevout, txindex);
250 bool CTransaction::ReadFromDisk(COutPoint prevout)
254 return ReadFromDisk(txdb, prevout, txindex);
257 bool CTransaction::IsStandard() const
259 BOOST_FOREACH(const CTxIn& txin, vin)
261 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
262 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
263 // ~65-byte public keys, plus a few script ops.
264 if (txin.scriptSig.size() > 500)
266 if (!txin.scriptSig.IsPushOnly())
269 BOOST_FOREACH(const CTxOut& txout, vout)
270 if (!::IsStandard(txout.scriptPubKey))
276 // Check transaction inputs, and make sure any
277 // pay-to-script-hash transactions are evaluating IsStandard scripts
279 // Why bother? To avoid denial-of-service attacks; an attacker
280 // can submit a standard HASH... OP_EQUAL transaction,
281 // which will get accepted into blocks. The redemption
282 // script can be anything; an attacker could use a very
283 // expensive-to-check-upon-redemption script like:
284 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
286 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
289 return true; // Coinbases don't use vin normally
291 for (int i = 0; i < vin.size(); i++)
293 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
295 vector<vector<unsigned char> > vSolutions;
296 txnouttype whichType;
297 // get the scriptPubKey corresponding to this input:
298 const CScript& prevScript = prev.scriptPubKey;
299 if (!Solver(prevScript, whichType, vSolutions))
301 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
303 // Transactions with extra stuff in their scriptSigs are
304 // non-standard. Note that this EvalScript() call will
305 // be quick, because if there are any operations
306 // beside "push data" in the scriptSig the
307 // IsStandard() call returns false
308 vector<vector<unsigned char> > stack;
309 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
312 if (whichType == TX_SCRIPTHASH)
316 CScript subscript(stack.back().begin(), stack.back().end());
317 vector<vector<unsigned char> > vSolutions2;
318 txnouttype whichType2;
319 if (!Solver(subscript, whichType2, vSolutions2))
321 if (whichType2 == TX_SCRIPTHASH)
323 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
326 if (stack.size() != nArgsExpected)
334 CTransaction::GetLegacySigOpCount() const
337 BOOST_FOREACH(const CTxIn& txin, vin)
339 nSigOps += txin.scriptSig.GetSigOpCount(false);
341 BOOST_FOREACH(const CTxOut& txout, vout)
343 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
349 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
361 // Load the block this tx is in
363 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
365 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
370 // Update the tx's hashBlock
371 hashBlock = pblock->GetHash();
373 // Locate the transaction
374 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
375 if (pblock->vtx[nIndex] == *(CTransaction*)this)
377 if (nIndex == pblock->vtx.size())
379 vMerkleBranch.clear();
381 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
385 // Fill in merkle branch
386 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
389 // Is the tx in a block that's in the main chain
390 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
391 if (mi == mapBlockIndex.end())
393 CBlockIndex* pindex = (*mi).second;
394 if (!pindex || !pindex->IsInMainChain())
397 return pindexBest->nHeight - pindex->nHeight + 1;
406 bool CTransaction::CheckTransaction() const
408 // Basic checks that don't depend on any context
410 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
412 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
414 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
415 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
417 // Check for negative or overflow output values
419 BOOST_FOREACH(const CTxOut& txout, vout)
421 if (txout.nValue < 0)
422 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
423 if (txout.nValue > MAX_MONEY)
424 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
425 nValueOut += txout.nValue;
426 if (!MoneyRange(nValueOut))
427 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
430 // Check for duplicate inputs
431 set<COutPoint> vInOutPoints;
432 BOOST_FOREACH(const CTxIn& txin, vin)
434 if (vInOutPoints.count(txin.prevout))
436 vInOutPoints.insert(txin.prevout);
441 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
442 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
446 BOOST_FOREACH(const CTxIn& txin, vin)
447 if (txin.prevout.IsNull())
448 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
454 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
457 *pfMissingInputs = false;
459 if (!CheckTransaction())
460 return error("AcceptToMemoryPool() : CheckTransaction failed");
462 // Coinbase is only valid in a block, not as a loose transaction
464 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
466 // To help v0.1.5 clients who would see it as a negative number
467 if ((int64)nLockTime > std::numeric_limits<int>::max())
468 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
470 // Rather not work on nonstandard transactions (unless -testnet)
471 if (!fTestNet && !IsStandard())
472 return error("AcceptToMemoryPool() : nonstandard transaction type");
474 // Do we already have it?
475 uint256 hash = GetHash();
476 CRITICAL_BLOCK(cs_mapTransactions)
477 if (mapTransactions.count(hash))
480 if (txdb.ContainsTx(hash))
483 // Check for conflicts with in-memory transactions
484 CTransaction* ptxOld = NULL;
485 for (int i = 0; i < vin.size(); i++)
487 COutPoint outpoint = vin[i].prevout;
488 if (mapNextTx.count(outpoint))
490 // Disable replacement feature for now
493 // Allow replacing with a newer version of the same transaction
496 ptxOld = mapNextTx[outpoint].ptx;
497 if (ptxOld->IsFinal())
499 if (!IsNewerThan(*ptxOld))
501 for (int i = 0; i < vin.size(); i++)
503 COutPoint outpoint = vin[i].prevout;
504 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
514 map<uint256, CTxIndex> mapUnused;
515 bool fInvalid = false;
516 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
519 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
521 *pfMissingInputs = true;
522 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
525 // Check for non-standard pay-to-script-hash in inputs
526 if (!AreInputsStandard(mapInputs) && !fTestNet)
527 return error("AcceptToMemoryPool() : nonstandard transaction input");
529 // Note: if you modify this code to accept non-standard transactions, then
530 // you should add code here to check that the transaction does a
531 // reasonable number of ECDSA signature verifications.
533 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
534 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
536 // Don't accept it if it can't get into a block
537 if (nFees < GetMinFee(1000, true, GMF_RELAY))
538 return error("AcceptToMemoryPool() : not enough fees");
540 // Continuously rate-limit free transactions
541 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
542 // be annoying or make other's transactions take longer to confirm.
543 if (nFees < MIN_RELAY_TX_FEE)
545 static CCriticalSection cs;
546 static double dFreeCount;
547 static int64 nLastTime;
548 int64 nNow = GetTime();
552 // Use an exponentially decaying ~10-minute window:
553 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
555 // -limitfreerelay unit is thousand-bytes-per-minute
556 // At default rate it would take over a month to fill 1GB
557 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
558 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
560 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
565 // Check against previous transactions
566 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
567 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
569 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
573 // Store transaction in memory
574 CRITICAL_BLOCK(cs_mapTransactions)
578 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
579 ptxOld->RemoveFromMemoryPool();
581 AddToMemoryPoolUnchecked();
584 ///// are we sure this is ok when loading transactions or restoring block txes
585 // If updated, erase old tx from wallet
587 EraseFromWallets(ptxOld->GetHash());
589 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
593 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
596 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
599 uint64 nPooledTx = 0;
601 bool CTransaction::AddToMemoryPoolUnchecked()
603 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
604 // Add to memory pool without checking anything. Don't call this directly,
605 // call AcceptToMemoryPool to properly check the transaction first.
606 CRITICAL_BLOCK(cs_mapTransactions)
608 uint256 hash = GetHash();
609 mapTransactions[hash] = *this;
610 for (int i = 0; i < vin.size(); i++)
611 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
612 nTransactionsUpdated++;
619 bool CTransaction::RemoveFromMemoryPool()
621 // Remove transaction from memory pool
622 CRITICAL_BLOCK(cs_mapTransactions)
624 uint256 hash = GetHash();
625 if (mapTransactions.count(hash))
627 BOOST_FOREACH(const CTxIn& txin, vin)
628 mapNextTx.erase(txin.prevout);
629 mapTransactions.erase(hash);
630 nTransactionsUpdated++;
642 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
644 if (hashBlock == 0 || nIndex == -1)
647 // Find the block it claims to be in
648 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
649 if (mi == mapBlockIndex.end())
651 CBlockIndex* pindex = (*mi).second;
652 if (!pindex || !pindex->IsInMainChain())
655 // Make sure the merkle branch connects to this block
656 if (!fMerkleVerified)
658 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
660 fMerkleVerified = true;
664 return pindexBest->nHeight - pindex->nHeight + 1;
668 int CMerkleTx::GetBlocksToMaturity() const
672 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
676 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
680 if (!IsInMainChain() && !ClientConnectInputs())
682 return CTransaction::AcceptToMemoryPool(txdb, false);
686 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
690 bool CMerkleTx::AcceptToMemoryPool()
693 return AcceptToMemoryPool(txdb);
698 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
700 CRITICAL_BLOCK(cs_mapTransactions)
702 // Add previous supporting transactions first
703 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
705 if (!tx.IsCoinBase())
707 uint256 hash = tx.GetHash();
708 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
709 tx.AcceptToMemoryPool(txdb, fCheckInputs);
712 return AcceptToMemoryPool(txdb, fCheckInputs);
717 bool CWalletTx::AcceptWalletTransaction()
720 return AcceptWalletTransaction(txdb);
723 int CTxIndex::GetDepthInMainChain() const
727 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
729 // Find the block in the index
730 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
731 if (mi == mapBlockIndex.end())
733 CBlockIndex* pindex = (*mi).second;
734 if (!pindex || !pindex->IsInMainChain())
736 return 1 + nBestHeight - pindex->nHeight;
748 //////////////////////////////////////////////////////////////////////////////
750 // CBlock and CBlockIndex
753 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
755 if (!fReadTransactions)
757 *this = pindex->GetBlockHeader();
760 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
762 if (GetHash() != pindex->GetBlockHash())
763 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
767 uint256 static GetOrphanRoot(const CBlock* pblock)
769 // Work back to the first block in the orphan chain
770 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
771 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
772 return pblock->GetHash();
775 int64 static GetBlockValue(int nHeight, int64 nFees)
777 int64 nSubsidy = 50 * COIN;
779 // Subsidy is cut in half every 4 years
780 nSubsidy >>= (nHeight / 210000);
782 return nSubsidy + nFees;
785 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
786 static const int64 nTargetSpacing = 10 * 60;
787 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
790 // minimum amount of work that could possibly be required nTime after
791 // minimum work required was nBase
793 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
795 // Testnet has min-difficulty blocks
796 // after nTargetSpacing*2 time between blocks:
797 if (fTestNet && nTime > nTargetSpacing*2)
798 return bnProofOfWorkLimit.GetCompact();
801 bnResult.SetCompact(nBase);
802 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
804 // Maximum 400% adjustment...
806 // ... in best-case exactly 4-times-normal target time
807 nTime -= nTargetTimespan*4;
809 if (bnResult > bnProofOfWorkLimit)
810 bnResult = bnProofOfWorkLimit;
811 return bnResult.GetCompact();
814 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
816 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
819 if (pindexLast == NULL)
820 return nProofOfWorkLimit;
822 // Only change once per interval
823 if ((pindexLast->nHeight+1) % nInterval != 0)
825 // Special rules for testnet after 15 Feb 2012:
826 if (fTestNet && pblock->nTime > 1329264000)
828 // If the new block's timestamp is more than 2* 10 minutes
829 // then allow mining of a min-difficulty block.
830 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
831 return nProofOfWorkLimit;
834 // Return the last non-special-min-difficulty-rules-block
835 const CBlockIndex* pindex = pindexLast;
836 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
837 pindex = pindex->pprev;
838 return pindex->nBits;
842 return pindexLast->nBits;
845 // Go back by what we want to be 14 days worth of blocks
846 const CBlockIndex* pindexFirst = pindexLast;
847 for (int i = 0; pindexFirst && i < nInterval-1; i++)
848 pindexFirst = pindexFirst->pprev;
851 // Limit adjustment step
852 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
853 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
854 if (nActualTimespan < nTargetTimespan/4)
855 nActualTimespan = nTargetTimespan/4;
856 if (nActualTimespan > nTargetTimespan*4)
857 nActualTimespan = nTargetTimespan*4;
861 bnNew.SetCompact(pindexLast->nBits);
862 bnNew *= nActualTimespan;
863 bnNew /= nTargetTimespan;
865 if (bnNew > bnProofOfWorkLimit)
866 bnNew = bnProofOfWorkLimit;
869 printf("GetNextWorkRequired RETARGET\n");
870 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
871 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
872 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
874 return bnNew.GetCompact();
877 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
880 bnTarget.SetCompact(nBits);
883 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
884 return error("CheckProofOfWork() : nBits below minimum work");
886 // Check proof of work matches claimed amount
887 if (hash > bnTarget.getuint256())
888 return error("CheckProofOfWork() : hash doesn't match nBits");
893 // Return maximum amount of blocks that other nodes claim to have
894 int GetNumBlocksOfPeers()
896 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
899 bool IsInitialBlockDownload()
901 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
903 static int64 nLastUpdate;
904 static CBlockIndex* pindexLastBest;
905 if (pindexBest != pindexLastBest)
907 pindexLastBest = pindexBest;
908 nLastUpdate = GetTime();
910 return (GetTime() - nLastUpdate < 10 &&
911 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
914 void static InvalidChainFound(CBlockIndex* pindexNew)
916 if (pindexNew->bnChainWork > bnBestInvalidWork)
918 bnBestInvalidWork = pindexNew->bnChainWork;
919 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
922 printf("InvalidChainFound: invalid block=%s height=%d work=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, pindexNew->bnChainWork.ToString().c_str());
923 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
924 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
925 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
928 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
930 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
932 // Updating time can change work required on testnet:
934 nBits = GetNextWorkRequired(pindexPrev, this);
947 bool CTransaction::DisconnectInputs(CTxDB& txdb)
949 // Relinquish previous transactions' spent pointers
952 BOOST_FOREACH(const CTxIn& txin, vin)
954 COutPoint prevout = txin.prevout;
956 // Get prev txindex from disk
958 if (!txdb.ReadTxIndex(prevout.hash, txindex))
959 return error("DisconnectInputs() : ReadTxIndex failed");
961 if (prevout.n >= txindex.vSpent.size())
962 return error("DisconnectInputs() : prevout.n out of range");
964 // Mark outpoint as not spent
965 txindex.vSpent[prevout.n].SetNull();
968 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
969 return error("DisconnectInputs() : UpdateTxIndex failed");
973 // Remove transaction from index
974 // This can fail if a duplicate of this transaction was in a chain that got
975 // reorganized away. This is only possible if this transaction was completely
976 // spent, so erasing it would be a no-op anway.
977 txdb.EraseTxIndex(*this);
983 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
984 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
986 // FetchInputs can return false either because we just haven't seen some inputs
987 // (in which case the transaction should be stored as an orphan)
988 // or because the transaction is malformed (in which case the transaction should
989 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
993 return true; // Coinbase transactions have no inputs to fetch.
995 for (int i = 0; i < vin.size(); i++)
997 COutPoint prevout = vin[i].prevout;
998 if (inputsRet.count(prevout.hash))
999 continue; // Got it already
1002 CTxIndex& txindex = inputsRet[prevout.hash].first;
1004 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1006 // Get txindex from current proposed changes
1007 txindex = mapTestPool.find(prevout.hash)->second;
1011 // Read txindex from txdb
1012 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1014 if (!fFound && (fBlock || fMiner))
1015 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1018 CTransaction& txPrev = inputsRet[prevout.hash].second;
1019 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1021 // Get prev tx from single transactions in memory
1022 CRITICAL_BLOCK(cs_mapTransactions)
1024 if (!mapTransactions.count(prevout.hash))
1025 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1026 txPrev = mapTransactions[prevout.hash];
1029 txindex.vSpent.resize(txPrev.vout.size());
1033 // Get prev tx from disk
1034 if (!txPrev.ReadFromDisk(txindex.pos))
1035 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1039 // Make sure all prevout.n's are valid:
1040 for (int i = 0; i < vin.size(); i++)
1042 const COutPoint prevout = vin[i].prevout;
1043 assert(inputsRet.count(prevout.hash) != 0);
1044 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1045 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1046 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1048 // Revisit this if/when transaction replacement is implemented and allows
1051 return DoS(100, error("FetchInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1058 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1060 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1061 if (mi == inputs.end())
1062 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1064 const CTransaction& txPrev = (mi->second).second;
1065 if (input.prevout.n >= txPrev.vout.size())
1066 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1068 return txPrev.vout[input.prevout.n];
1071 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1077 for (int i = 0; i < vin.size(); i++)
1079 nResult += GetOutputFor(vin[i], inputs).nValue;
1085 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1091 for (int i = 0; i < vin.size(); i++)
1093 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1094 if (prevout.scriptPubKey.IsPayToScriptHash())
1095 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1100 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1101 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1102 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1104 // Take over previous transactions' spent pointers
1105 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1106 // fMiner is true when called from the internal bitcoin miner
1107 // ... both are false when called from CTransaction::AcceptToMemoryPool
1112 for (int i = 0; i < vin.size(); i++)
1114 COutPoint prevout = vin[i].prevout;
1115 assert(inputs.count(prevout.hash) > 0);
1116 CTxIndex& txindex = inputs[prevout.hash].first;
1117 CTransaction& txPrev = inputs[prevout.hash].second;
1119 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1120 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1122 // If prev is coinbase, check that it's matured
1123 if (txPrev.IsCoinBase())
1124 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1125 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1126 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1128 // Check for conflicts (double-spend)
1129 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1130 // for an attacker to attempt to split the network.
1131 if (!txindex.vSpent[prevout.n].IsNull())
1132 return fMiner ? false : error("ConnectInputs() : %s prev tx already used at %s", GetHash().ToString().substr(0,10).c_str(), txindex.vSpent[prevout.n].ToString().c_str());
1134 // Check for negative or overflow input values
1135 nValueIn += txPrev.vout[prevout.n].nValue;
1136 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1137 return DoS(100, error("ConnectInputs() : txin values out of range"));
1139 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1140 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1141 // still computed and checked, and any change will be caught at the next checkpoint.
1142 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1145 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1147 // only during transition phase for P2SH: do not invoke anti-DoS code for
1148 // potentially old clients relaying bad P2SH transactions
1149 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1150 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1152 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1156 // Mark outpoints as spent
1157 txindex.vSpent[prevout.n] = posThisTx;
1160 if (fBlock || fMiner)
1162 mapTestPool[prevout.hash] = txindex;
1166 if (nValueIn < GetValueOut())
1167 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1169 // Tally transaction fees
1170 int64 nTxFee = nValueIn - GetValueOut();
1172 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1174 if (!MoneyRange(nFees))
1175 return DoS(100, error("ConnectInputs() : nFees out of range"));
1182 bool CTransaction::ClientConnectInputs()
1187 // Take over previous transactions' spent pointers
1188 CRITICAL_BLOCK(cs_mapTransactions)
1191 for (int i = 0; i < vin.size(); i++)
1193 // Get prev tx from single transactions in memory
1194 COutPoint prevout = vin[i].prevout;
1195 if (!mapTransactions.count(prevout.hash))
1197 CTransaction& txPrev = mapTransactions[prevout.hash];
1199 if (prevout.n >= txPrev.vout.size())
1203 if (!VerifySignature(txPrev, *this, i, true, 0))
1204 return error("ConnectInputs() : VerifySignature failed");
1206 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1207 ///// this has to go away now that posNext is gone
1208 // // Check for conflicts
1209 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1210 // return error("ConnectInputs() : prev tx already used");
1212 // // Flag outpoints as used
1213 // txPrev.vout[prevout.n].posNext = posThisTx;
1215 nValueIn += txPrev.vout[prevout.n].nValue;
1217 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1218 return error("ClientConnectInputs() : txin values out of range");
1220 if (GetValueOut() > nValueIn)
1230 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1232 // Disconnect in reverse order
1233 for (int i = vtx.size()-1; i >= 0; i--)
1234 if (!vtx[i].DisconnectInputs(txdb))
1237 // Update block index on disk without changing it in memory.
1238 // The memory index structure will be changed after the db commits.
1241 CDiskBlockIndex blockindexPrev(pindex->pprev);
1242 blockindexPrev.hashNext = 0;
1243 if (!txdb.WriteBlockIndex(blockindexPrev))
1244 return error("DisconnectBlock() : WriteBlockIndex failed");
1250 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1252 // Check it again in case a previous version let a bad block in
1256 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1257 // unless those are already completely spent.
1258 // If such overwrites are allowed, coinbases and transactions depending upon those
1259 // can be duplicated to remove the ability to spend the first instance -- even after
1260 // being sent to another address.
1261 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1262 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1263 // already refuses previously-known transaction id's entirely.
1264 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1265 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1266 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1267 BOOST_FOREACH(CTransaction& tx, vtx)
1269 CTxIndex txindexOld;
1270 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1271 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1276 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1277 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1278 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1280 //// issue here: it doesn't know the version
1281 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1283 map<uint256, CTxIndex> mapQueuedChanges;
1286 BOOST_FOREACH(CTransaction& tx, vtx)
1288 nSigOps += tx.GetLegacySigOpCount();
1289 if (nSigOps > MAX_BLOCK_SIGOPS)
1290 return DoS(100, error("ConnectBlock() : too many sigops"));
1292 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1293 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1295 MapPrevTx mapInputs;
1296 if (!tx.IsCoinBase())
1299 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1302 if (fStrictPayToScriptHash)
1304 // Add in sigops done by pay-to-script-hash inputs;
1305 // this is to prevent a "rogue miner" from creating
1306 // an incredibly-expensive-to-validate block.
1307 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1308 if (nSigOps > MAX_BLOCK_SIGOPS)
1309 return DoS(100, error("ConnectBlock() : too many sigops"));
1312 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1314 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1318 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1321 // Write queued txindex changes
1322 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1324 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1325 return error("ConnectBlock() : UpdateTxIndex failed");
1328 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1331 // Update block index on disk without changing it in memory.
1332 // The memory index structure will be changed after the db commits.
1335 CDiskBlockIndex blockindexPrev(pindex->pprev);
1336 blockindexPrev.hashNext = pindex->GetBlockHash();
1337 if (!txdb.WriteBlockIndex(blockindexPrev))
1338 return error("ConnectBlock() : WriteBlockIndex failed");
1341 // Watch for transactions paying to me
1342 BOOST_FOREACH(CTransaction& tx, vtx)
1343 SyncWithWallets(tx, this, true);
1348 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1350 printf("REORGANIZE\n");
1353 CBlockIndex* pfork = pindexBest;
1354 CBlockIndex* plonger = pindexNew;
1355 while (pfork != plonger)
1357 while (plonger->nHeight > pfork->nHeight)
1358 if (!(plonger = plonger->pprev))
1359 return error("Reorganize() : plonger->pprev is null");
1360 if (pfork == plonger)
1362 if (!(pfork = pfork->pprev))
1363 return error("Reorganize() : pfork->pprev is null");
1366 // List of what to disconnect
1367 vector<CBlockIndex*> vDisconnect;
1368 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1369 vDisconnect.push_back(pindex);
1371 // List of what to connect
1372 vector<CBlockIndex*> vConnect;
1373 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1374 vConnect.push_back(pindex);
1375 reverse(vConnect.begin(), vConnect.end());
1377 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1378 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1380 // Disconnect shorter branch
1381 vector<CTransaction> vResurrect;
1382 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1385 if (!block.ReadFromDisk(pindex))
1386 return error("Reorganize() : ReadFromDisk for disconnect failed");
1387 if (!block.DisconnectBlock(txdb, pindex))
1388 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1390 // Queue memory transactions to resurrect
1391 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1392 if (!tx.IsCoinBase())
1393 vResurrect.push_back(tx);
1396 // Connect longer branch
1397 vector<CTransaction> vDelete;
1398 for (int i = 0; i < vConnect.size(); i++)
1400 CBlockIndex* pindex = vConnect[i];
1402 if (!block.ReadFromDisk(pindex))
1403 return error("Reorganize() : ReadFromDisk for connect failed");
1404 if (!block.ConnectBlock(txdb, pindex))
1408 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1411 // Queue memory transactions to delete
1412 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1413 vDelete.push_back(tx);
1415 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1416 return error("Reorganize() : WriteHashBestChain failed");
1418 // Make sure it's successfully written to disk before changing memory structure
1419 if (!txdb.TxnCommit())
1420 return error("Reorganize() : TxnCommit failed");
1422 // Disconnect shorter branch
1423 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1425 pindex->pprev->pnext = NULL;
1427 // Connect longer branch
1428 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1430 pindex->pprev->pnext = pindex;
1432 // Resurrect memory transactions that were in the disconnected branch
1433 BOOST_FOREACH(CTransaction& tx, vResurrect)
1434 tx.AcceptToMemoryPool(txdb, false);
1436 // Delete redundant memory transactions that are in the connected branch
1437 BOOST_FOREACH(CTransaction& tx, vDelete)
1438 tx.RemoveFromMemoryPool();
1440 printf("REORGANIZE: done\n");
1447 runCommand(std::string strCommand)
1449 int nErr = ::system(strCommand.c_str());
1451 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1454 // Called from inside SetBestChain: attaches a block to the new best chain being built
1455 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1457 uint256 hash = GetHash();
1459 // Adding to current best branch
1460 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1463 InvalidChainFound(pindexNew);
1466 if (!txdb.TxnCommit())
1467 return error("SetBestChain() : TxnCommit failed");
1469 // Add to current best branch
1470 pindexNew->pprev->pnext = pindexNew;
1472 // Delete redundant memory transactions
1473 BOOST_FOREACH(CTransaction& tx, vtx)
1474 tx.RemoveFromMemoryPool();
1479 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1481 uint256 hash = GetHash();
1484 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1486 txdb.WriteHashBestChain(hash);
1487 if (!txdb.TxnCommit())
1488 return error("SetBestChain() : TxnCommit failed");
1489 pindexGenesisBlock = pindexNew;
1491 else if (hashPrevBlock == hashBestChain)
1493 if (!SetBestChainInner(txdb, pindexNew))
1494 return error("SetBestChain() : SetBestChainInner failed");
1498 // the first block in the new chain that will cause it to become the new best chain
1499 CBlockIndex *pindexIntermediate = pindexNew;
1501 // list of blocks that need to be connected afterwards
1502 std::vector<CBlockIndex*> vpindexSecondary;
1504 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1505 // Try to limit how much needs to be done inside
1506 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1508 vpindexSecondary.push_back(pindexIntermediate);
1509 pindexIntermediate = pindexIntermediate->pprev;
1512 if (!vpindexSecondary.empty())
1513 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1515 // Switch to new best branch
1516 if (!Reorganize(txdb, pindexIntermediate))
1519 InvalidChainFound(pindexNew);
1520 return error("SetBestChain() : Reorganize failed");
1523 // Connect futher blocks
1524 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1527 if (!block.ReadFromDisk(pindex))
1529 printf("SetBestChain() : ReadFromDisk failed\n");
1533 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1534 if (!block.SetBestChainInner(txdb, pindex))
1539 // Update best block in wallet (so we can detect restored wallets)
1540 bool fIsInitialDownload = IsInitialBlockDownload();
1541 if (!fIsInitialDownload)
1543 const CBlockLocator locator(pindexNew);
1544 ::SetBestChain(locator);
1548 hashBestChain = hash;
1549 pindexBest = pindexNew;
1550 nBestHeight = pindexBest->nHeight;
1551 bnBestChainWork = pindexNew->bnChainWork;
1552 nTimeBestReceived = GetTime();
1553 nTransactionsUpdated++;
1554 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1556 std::string strCmd = GetArg("-blocknotify", "");
1558 if (!fIsInitialDownload && !strCmd.empty())
1560 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1561 boost::thread t(runCommand, strCmd); // thread runs free
1568 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1570 // Check for duplicate
1571 uint256 hash = GetHash();
1572 if (mapBlockIndex.count(hash))
1573 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1575 // Construct new block index object
1576 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1578 return error("AddToBlockIndex() : new CBlockIndex failed");
1579 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1580 pindexNew->phashBlock = &((*mi).first);
1581 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1582 if (miPrev != mapBlockIndex.end())
1584 pindexNew->pprev = (*miPrev).second;
1585 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1587 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1591 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1592 if (!txdb.TxnCommit())
1596 if (pindexNew->bnChainWork > bnBestChainWork)
1597 if (!SetBestChain(txdb, pindexNew))
1602 if (pindexNew == pindexBest)
1604 // Notify UI to display prev block's coinbase if it was ours
1605 static uint256 hashPrevBestCoinBase;
1606 UpdatedTransaction(hashPrevBestCoinBase);
1607 hashPrevBestCoinBase = vtx[0].GetHash();
1617 bool CBlock::CheckBlock() const
1619 // These are checks that are independent of context
1620 // that can be verified before saving an orphan block.
1623 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1624 return DoS(100, error("CheckBlock() : size limits failed"));
1626 // Check proof of work matches claimed amount
1627 if (!CheckProofOfWork(GetHash(), nBits))
1628 return DoS(50, error("CheckBlock() : proof of work failed"));
1631 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1632 return error("CheckBlock() : block timestamp too far in the future");
1634 // First transaction must be coinbase, the rest must not be
1635 if (vtx.empty() || !vtx[0].IsCoinBase())
1636 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1637 for (int i = 1; i < vtx.size(); i++)
1638 if (vtx[i].IsCoinBase())
1639 return DoS(100, error("CheckBlock() : more than one coinbase"));
1641 // Check transactions
1642 BOOST_FOREACH(const CTransaction& tx, vtx)
1643 if (!tx.CheckTransaction())
1644 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1647 BOOST_FOREACH(const CTransaction& tx, vtx)
1649 nSigOps += tx.GetLegacySigOpCount();
1651 if (nSigOps > MAX_BLOCK_SIGOPS)
1652 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1655 if (hashMerkleRoot != BuildMerkleTree())
1656 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1661 bool CBlock::AcceptBlock()
1663 // Check for duplicate
1664 uint256 hash = GetHash();
1665 if (mapBlockIndex.count(hash))
1666 return error("AcceptBlock() : block already in mapBlockIndex");
1668 // Get prev block index
1669 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1670 if (mi == mapBlockIndex.end())
1671 return DoS(10, error("AcceptBlock() : prev block not found"));
1672 CBlockIndex* pindexPrev = (*mi).second;
1673 int nHeight = pindexPrev->nHeight+1;
1675 // Check proof of work
1676 if (nBits != GetNextWorkRequired(pindexPrev, this))
1677 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1679 // Check timestamp against prev
1680 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1681 return error("AcceptBlock() : block's timestamp is too early");
1683 // Check that all transactions are finalized
1684 BOOST_FOREACH(const CTransaction& tx, vtx)
1685 if (!tx.IsFinal(nHeight, GetBlockTime()))
1686 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1688 // Check that the block chain matches the known block chain up to a checkpoint
1689 if (!Checkpoints::CheckBlock(nHeight, hash))
1690 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1692 // Write block to history file
1693 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1694 return error("AcceptBlock() : out of disk space");
1695 unsigned int nFile = -1;
1696 unsigned int nBlockPos = 0;
1697 if (!WriteToDisk(nFile, nBlockPos))
1698 return error("AcceptBlock() : WriteToDisk failed");
1699 if (!AddToBlockIndex(nFile, nBlockPos))
1700 return error("AcceptBlock() : AddToBlockIndex failed");
1702 // Relay inventory, but don't relay old inventory during initial block download
1703 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1704 if (hashBestChain == hash)
1705 CRITICAL_BLOCK(cs_vNodes)
1706 BOOST_FOREACH(CNode* pnode, vNodes)
1707 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1708 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1713 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1715 // Check for duplicate
1716 uint256 hash = pblock->GetHash();
1717 if (mapBlockIndex.count(hash))
1718 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1719 if (mapOrphanBlocks.count(hash))
1720 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1722 // Preliminary checks
1723 if (!pblock->CheckBlock())
1724 return error("ProcessBlock() : CheckBlock FAILED");
1726 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1727 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1729 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1730 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1734 pfrom->Misbehaving(100);
1735 return error("ProcessBlock() : block with timestamp before last checkpoint");
1738 bnNewBlock.SetCompact(pblock->nBits);
1740 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1741 if (bnNewBlock > bnRequired)
1744 pfrom->Misbehaving(100);
1745 return error("ProcessBlock() : block with too little proof-of-work");
1750 // If don't already have its previous block, shunt it off to holding area until we get it
1751 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1753 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1754 CBlock* pblock2 = new CBlock(*pblock);
1755 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1756 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1758 // Ask this guy to fill in what we're missing
1760 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1765 if (!pblock->AcceptBlock())
1766 return error("ProcessBlock() : AcceptBlock FAILED");
1768 // Recursively process any orphan blocks that depended on this one
1769 vector<uint256> vWorkQueue;
1770 vWorkQueue.push_back(hash);
1771 for (int i = 0; i < vWorkQueue.size(); i++)
1773 uint256 hashPrev = vWorkQueue[i];
1774 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1775 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1778 CBlock* pblockOrphan = (*mi).second;
1779 if (pblockOrphan->AcceptBlock())
1780 vWorkQueue.push_back(pblockOrphan->GetHash());
1781 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1782 delete pblockOrphan;
1784 mapOrphanBlocksByPrev.erase(hashPrev);
1787 printf("ProcessBlock: ACCEPTED\n");
1798 bool CheckDiskSpace(uint64 nAdditionalBytes)
1800 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1802 // Check for 15MB because database could create another 10MB log file at any time
1803 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1806 string strMessage = _("Warning: Disk space is low ");
1807 strMiscWarning = strMessage;
1808 printf("*** %s\n", strMessage.c_str());
1809 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1816 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1820 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1823 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1825 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1834 static unsigned int nCurrentBlockFile = 1;
1836 FILE* AppendBlockFile(unsigned int& nFileRet)
1841 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1844 if (fseek(file, 0, SEEK_END) != 0)
1846 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1847 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1849 nFileRet = nCurrentBlockFile;
1853 nCurrentBlockFile++;
1857 bool LoadBlockIndex(bool fAllowNew)
1861 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1862 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1863 pchMessageStart[0] = 0xfa;
1864 pchMessageStart[1] = 0xbf;
1865 pchMessageStart[2] = 0xb5;
1866 pchMessageStart[3] = 0xda;
1873 if (!txdb.LoadBlockIndex())
1878 // Init with genesis block
1880 if (mapBlockIndex.empty())
1886 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1887 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1888 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1889 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1890 // vMerkleTree: 4a5e1e
1893 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1895 txNew.vin.resize(1);
1896 txNew.vout.resize(1);
1897 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1898 txNew.vout[0].nValue = 50 * COIN;
1899 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1901 block.vtx.push_back(txNew);
1902 block.hashPrevBlock = 0;
1903 block.hashMerkleRoot = block.BuildMerkleTree();
1905 block.nTime = 1231006505;
1906 block.nBits = 0x1d00ffff;
1907 block.nNonce = 2083236893;
1911 block.nTime = 1296688602;
1912 block.nBits = 0x1d07fff8;
1913 block.nNonce = 384568319;
1917 printf("%s\n", block.GetHash().ToString().c_str());
1918 printf("%s\n", hashGenesisBlock.ToString().c_str());
1919 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1920 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1922 assert(block.GetHash() == hashGenesisBlock);
1924 // Start new block file
1926 unsigned int nBlockPos;
1927 if (!block.WriteToDisk(nFile, nBlockPos))
1928 return error("LoadBlockIndex() : writing genesis block to disk failed");
1929 if (!block.AddToBlockIndex(nFile, nBlockPos))
1930 return error("LoadBlockIndex() : genesis block not accepted");
1938 void PrintBlockTree()
1940 // precompute tree structure
1941 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1942 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1944 CBlockIndex* pindex = (*mi).second;
1945 mapNext[pindex->pprev].push_back(pindex);
1947 //while (rand() % 3 == 0)
1948 // mapNext[pindex->pprev].push_back(pindex);
1951 vector<pair<int, CBlockIndex*> > vStack;
1952 vStack.push_back(make_pair(0, pindexGenesisBlock));
1955 while (!vStack.empty())
1957 int nCol = vStack.back().first;
1958 CBlockIndex* pindex = vStack.back().second;
1961 // print split or gap
1962 if (nCol > nPrevCol)
1964 for (int i = 0; i < nCol-1; i++)
1968 else if (nCol < nPrevCol)
1970 for (int i = 0; i < nCol; i++)
1977 for (int i = 0; i < nCol; i++)
1982 block.ReadFromDisk(pindex);
1983 printf("%d (%u,%u) %s %s tx %d",
1987 block.GetHash().ToString().substr(0,20).c_str(),
1988 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1991 PrintWallets(block);
1993 // put the main timechain first
1994 vector<CBlockIndex*>& vNext = mapNext[pindex];
1995 for (int i = 0; i < vNext.size(); i++)
1997 if (vNext[i]->pnext)
1999 swap(vNext[0], vNext[i]);
2005 for (int i = 0; i < vNext.size(); i++)
2006 vStack.push_back(make_pair(nCol+i, vNext[i]));
2019 //////////////////////////////////////////////////////////////////////////////
2024 map<uint256, CAlert> mapAlerts;
2025 CCriticalSection cs_mapAlerts;
2027 string GetWarnings(string strFor)
2030 string strStatusBar;
2032 if (GetBoolArg("-testsafemode"))
2035 // Misc warnings like out of disk space and clock is wrong
2036 if (strMiscWarning != "")
2039 strStatusBar = strMiscWarning;
2042 // Longer invalid proof-of-work chain
2043 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2046 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2050 CRITICAL_BLOCK(cs_mapAlerts)
2052 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2054 const CAlert& alert = item.second;
2055 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2057 nPriority = alert.nPriority;
2058 strStatusBar = alert.strStatusBar;
2063 if (strFor == "statusbar")
2064 return strStatusBar;
2065 else if (strFor == "rpc")
2067 assert(!"GetWarnings() : invalid parameter");
2071 bool CAlert::ProcessAlert()
2073 if (!CheckSignature())
2078 CRITICAL_BLOCK(cs_mapAlerts)
2080 // Cancel previous alerts
2081 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2083 const CAlert& alert = (*mi).second;
2086 printf("cancelling alert %d\n", alert.nID);
2087 mapAlerts.erase(mi++);
2089 else if (!alert.IsInEffect())
2091 printf("expiring alert %d\n", alert.nID);
2092 mapAlerts.erase(mi++);
2098 // Check if this alert has been cancelled
2099 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2101 const CAlert& alert = item.second;
2102 if (alert.Cancels(*this))
2104 printf("alert already cancelled by %d\n", alert.nID);
2110 mapAlerts.insert(make_pair(GetHash(), *this));
2113 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2125 //////////////////////////////////////////////////////////////////////////////
2131 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2135 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2136 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2138 // Don't know what it is, just say we already got one
2145 // The message start string is designed to be unlikely to occur in normal data.
2146 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2147 // a large 4-byte int at any alignment.
2148 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2151 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2153 static map<CService, vector<unsigned char> > mapReuseKey;
2154 RandAddSeedPerfmon();
2156 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2157 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2159 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2161 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2169 if (strCommand == "version")
2171 // Each connection can only send one version message
2172 if (pfrom->nVersion != 0)
2174 pfrom->Misbehaving(1);
2182 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2183 if (pfrom->nVersion < 209)
2185 // Since February 20, 2012, the protocol is initiated at version 209,
2186 // and earlier versions are no longer supported
2187 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2188 pfrom->fDisconnect = true;
2192 if (pfrom->nVersion == 10300)
2193 pfrom->nVersion = 300;
2195 vRecv >> addrFrom >> nNonce;
2197 vRecv >> pfrom->strSubVer;
2199 vRecv >> pfrom->nStartingHeight;
2201 // Disconnect if we connected to ourself
2202 if (nNonce == nLocalHostNonce && nNonce > 1)
2204 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2205 pfrom->fDisconnect = true;
2209 // Be shy and don't send version until we hear
2210 if (pfrom->fInbound)
2211 pfrom->PushVersion();
2213 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2215 AddTimeData(pfrom->addr, nTime);
2218 pfrom->PushMessage("verack");
2219 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2221 if (!pfrom->fInbound)
2223 // Advertise our address
2224 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2225 !IsInitialBlockDownload())
2227 CAddress addr(addrLocalHost);
2228 addr.nTime = GetAdjustedTime();
2229 pfrom->PushAddress(addr);
2232 // Get recent addresses
2233 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2235 pfrom->PushMessage("getaddr");
2236 pfrom->fGetAddr = true;
2238 addrman.Good(pfrom->addr);
2240 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2242 addrman.Add(addrFrom, addrFrom);
2243 addrman.Good(addrFrom);
2247 // Ask the first connected node for block updates
2248 static int nAskedForBlocks = 0;
2249 if (!pfrom->fClient &&
2250 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2251 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2254 pfrom->PushGetBlocks(pindexBest, uint256(0));
2258 CRITICAL_BLOCK(cs_mapAlerts)
2259 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2260 item.second.RelayTo(pfrom);
2262 pfrom->fSuccessfullyConnected = true;
2264 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2266 cPeerBlockCounts.input(pfrom->nStartingHeight);
2270 else if (pfrom->nVersion == 0)
2272 // Must have a version message before anything else
2273 pfrom->Misbehaving(1);
2278 else if (strCommand == "verack")
2280 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2284 else if (strCommand == "addr")
2286 vector<CAddress> vAddr;
2289 // Don't want addr from older versions unless seeding
2290 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2292 if (vAddr.size() > 1000)
2294 pfrom->Misbehaving(20);
2295 return error("message addr size() = %d", vAddr.size());
2298 // Store the new addresses
2299 int64 nNow = GetAdjustedTime();
2300 int64 nSince = nNow - 10 * 60;
2301 BOOST_FOREACH(CAddress& addr, vAddr)
2305 // ignore IPv6 for now, since it isn't implemented anyway
2308 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2309 addr.nTime = nNow - 5 * 24 * 60 * 60;
2310 pfrom->AddAddressKnown(addr);
2311 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2313 // Relay to a limited number of other nodes
2314 CRITICAL_BLOCK(cs_vNodes)
2316 // Use deterministic randomness to send to the same nodes for 24 hours
2317 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2318 static uint256 hashSalt;
2320 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2321 int64 hashAddr = addr.GetHash();
2322 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2323 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2324 multimap<uint256, CNode*> mapMix;
2325 BOOST_FOREACH(CNode* pnode, vNodes)
2327 if (pnode->nVersion < 31402)
2329 unsigned int nPointer;
2330 memcpy(&nPointer, &pnode, sizeof(nPointer));
2331 uint256 hashKey = hashRand ^ nPointer;
2332 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2333 mapMix.insert(make_pair(hashKey, pnode));
2335 int nRelayNodes = 2;
2336 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2337 ((*mi).second)->PushAddress(addr);
2341 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2342 if (vAddr.size() < 1000)
2343 pfrom->fGetAddr = false;
2347 else if (strCommand == "inv")
2351 if (vInv.size() > 50000)
2353 pfrom->Misbehaving(20);
2354 return error("message inv size() = %d", vInv.size());
2358 for (int nInv = 0; nInv < vInv.size(); nInv++)
2360 const CInv &inv = vInv[nInv];
2364 pfrom->AddInventoryKnown(inv);
2366 bool fAlreadyHave = AlreadyHave(txdb, inv);
2368 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2370 // Always request the last block in an inv bundle (even if we already have it), as it is the
2371 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2372 // this is necessary to connect earlier received orphan blocks to the chain again.
2373 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2375 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2376 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2378 // Track requests for our stuff
2379 Inventory(inv.hash);
2384 else if (strCommand == "getdata")
2388 if (vInv.size() > 50000)
2390 pfrom->Misbehaving(20);
2391 return error("message getdata size() = %d", vInv.size());
2394 BOOST_FOREACH(const CInv& inv, vInv)
2398 printf("received getdata for: %s\n", inv.ToString().c_str());
2400 if (inv.type == MSG_BLOCK)
2402 // Send block from disk
2403 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2404 if (mi != mapBlockIndex.end())
2407 block.ReadFromDisk((*mi).second);
2408 pfrom->PushMessage("block", block);
2410 // Trigger them to send a getblocks request for the next batch of inventory
2411 if (inv.hash == pfrom->hashContinue)
2413 // Bypass PushInventory, this must send even if redundant,
2414 // and we want it right after the last block so they don't
2415 // wait for other stuff first.
2417 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2418 pfrom->PushMessage("inv", vInv);
2419 pfrom->hashContinue = 0;
2423 else if (inv.IsKnownType())
2425 // Send stream from relay memory
2426 CRITICAL_BLOCK(cs_mapRelay)
2428 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2429 if (mi != mapRelay.end())
2430 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2434 // Track requests for our stuff
2435 Inventory(inv.hash);
2440 else if (strCommand == "getblocks")
2442 CBlockLocator locator;
2444 vRecv >> locator >> hashStop;
2446 // Find the last block the caller has in the main chain
2447 CBlockIndex* pindex = locator.GetBlockIndex();
2449 // Send the rest of the chain
2451 pindex = pindex->pnext;
2452 int nLimit = 500 + locator.GetDistanceBack();
2453 unsigned int nBytes = 0;
2454 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2455 for (; pindex; pindex = pindex->pnext)
2457 if (pindex->GetBlockHash() == hashStop)
2459 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2462 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2464 block.ReadFromDisk(pindex, true);
2465 nBytes += block.GetSerializeSize(SER_NETWORK);
2466 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2468 // When this block is requested, we'll send an inv that'll make them
2469 // getblocks the next batch of inventory.
2470 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2471 pfrom->hashContinue = pindex->GetBlockHash();
2478 else if (strCommand == "getheaders")
2480 CBlockLocator locator;
2482 vRecv >> locator >> hashStop;
2484 CBlockIndex* pindex = NULL;
2485 if (locator.IsNull())
2487 // If locator is null, return the hashStop block
2488 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2489 if (mi == mapBlockIndex.end())
2491 pindex = (*mi).second;
2495 // Find the last block the caller has in the main chain
2496 pindex = locator.GetBlockIndex();
2498 pindex = pindex->pnext;
2501 vector<CBlock> vHeaders;
2503 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2504 for (; pindex; pindex = pindex->pnext)
2506 vHeaders.push_back(pindex->GetBlockHeader());
2507 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2510 pfrom->PushMessage("headers", vHeaders);
2514 else if (strCommand == "tx")
2516 vector<uint256> vWorkQueue;
2517 CDataStream vMsg(vRecv);
2521 CInv inv(MSG_TX, tx.GetHash());
2522 pfrom->AddInventoryKnown(inv);
2524 bool fMissingInputs = false;
2525 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2527 SyncWithWallets(tx, NULL, true);
2528 RelayMessage(inv, vMsg);
2529 mapAlreadyAskedFor.erase(inv);
2530 vWorkQueue.push_back(inv.hash);
2532 // Recursively process any orphan transactions that depended on this one
2533 for (int i = 0; i < vWorkQueue.size(); i++)
2535 uint256 hashPrev = vWorkQueue[i];
2536 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2537 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2540 const CDataStream& vMsg = *((*mi).second);
2542 CDataStream(vMsg) >> tx;
2543 CInv inv(MSG_TX, tx.GetHash());
2545 if (tx.AcceptToMemoryPool(true))
2547 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2548 SyncWithWallets(tx, NULL, true);
2549 RelayMessage(inv, vMsg);
2550 mapAlreadyAskedFor.erase(inv);
2551 vWorkQueue.push_back(inv.hash);
2556 BOOST_FOREACH(uint256 hash, vWorkQueue)
2557 EraseOrphanTx(hash);
2559 else if (fMissingInputs)
2561 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2564 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2565 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2567 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2569 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2573 else if (strCommand == "block")
2578 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2581 CInv inv(MSG_BLOCK, block.GetHash());
2582 pfrom->AddInventoryKnown(inv);
2584 if (ProcessBlock(pfrom, &block))
2585 mapAlreadyAskedFor.erase(inv);
2586 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2590 else if (strCommand == "getaddr")
2592 pfrom->vAddrToSend.clear();
2593 vector<CAddress> vAddr = addrman.GetAddr();
2594 BOOST_FOREACH(const CAddress &addr, vAddr)
2595 pfrom->PushAddress(addr);
2599 else if (strCommand == "checkorder")
2604 if (!GetBoolArg("-allowreceivebyip"))
2606 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2613 /// we have a chance to check the order here
2615 // Keep giving the same key to the same ip until they use it
2616 if (!mapReuseKey.count(pfrom->addr))
2617 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2619 // Send back approval of order and pubkey to use
2620 CScript scriptPubKey;
2621 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2622 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2626 else if (strCommand == "reply")
2631 CRequestTracker tracker;
2632 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2634 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2635 if (mi != pfrom->mapRequests.end())
2637 tracker = (*mi).second;
2638 pfrom->mapRequests.erase(mi);
2641 if (!tracker.IsNull())
2642 tracker.fn(tracker.param1, vRecv);
2646 else if (strCommand == "ping")
2651 else if (strCommand == "alert")
2656 if (alert.ProcessAlert())
2659 pfrom->setKnown.insert(alert.GetHash());
2660 CRITICAL_BLOCK(cs_vNodes)
2661 BOOST_FOREACH(CNode* pnode, vNodes)
2662 alert.RelayTo(pnode);
2669 // Ignore unknown commands for extensibility
2673 // Update the last seen time for this node's address
2674 if (pfrom->fNetworkNode)
2675 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2676 AddressCurrentlyConnected(pfrom->addr);
2682 bool ProcessMessages(CNode* pfrom)
2684 CDataStream& vRecv = pfrom->vRecv;
2688 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2692 // (4) message start
2701 // Scan for message start
2702 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2703 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2704 if (vRecv.end() - pstart < nHeaderSize)
2706 if (vRecv.size() > nHeaderSize)
2708 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2709 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2713 if (pstart - vRecv.begin() > 0)
2714 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2715 vRecv.erase(vRecv.begin(), pstart);
2718 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2723 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2726 string strCommand = hdr.GetCommand();
2729 unsigned int nMessageSize = hdr.nMessageSize;
2730 if (nMessageSize > MAX_SIZE)
2732 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2735 if (nMessageSize > vRecv.size())
2737 // Rewind and wait for rest of message
2738 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2743 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2744 unsigned int nChecksum = 0;
2745 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2746 if (nChecksum != hdr.nChecksum)
2748 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2749 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2753 // Copy message to its own buffer
2754 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2755 vRecv.ignore(nMessageSize);
2761 CRITICAL_BLOCK(cs_main)
2762 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2766 catch (std::ios_base::failure& e)
2768 if (strstr(e.what(), "end of data"))
2770 // Allow exceptions from underlength message on vRecv
2771 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2773 else if (strstr(e.what(), "size too large"))
2775 // Allow exceptions from overlong size
2776 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2780 PrintExceptionContinue(&e, "ProcessMessage()");
2783 catch (std::exception& e) {
2784 PrintExceptionContinue(&e, "ProcessMessage()");
2786 PrintExceptionContinue(NULL, "ProcessMessage()");
2790 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2798 bool SendMessages(CNode* pto, bool fSendTrickle)
2800 CRITICAL_BLOCK(cs_main)
2802 // Don't send anything until we get their version message
2803 if (pto->nVersion == 0)
2807 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2808 pto->PushMessage("ping");
2810 // Resend wallet transactions that haven't gotten in a block yet
2811 ResendWalletTransactions();
2813 // Address refresh broadcast
2814 static int64 nLastRebroadcast;
2815 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2817 CRITICAL_BLOCK(cs_vNodes)
2819 BOOST_FOREACH(CNode* pnode, vNodes)
2821 // Periodically clear setAddrKnown to allow refresh broadcasts
2822 if (nLastRebroadcast)
2823 pnode->setAddrKnown.clear();
2825 // Rebroadcast our address
2826 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2828 CAddress addr(addrLocalHost);
2829 addr.nTime = GetAdjustedTime();
2830 pnode->PushAddress(addr);
2834 nLastRebroadcast = GetTime();
2842 vector<CAddress> vAddr;
2843 vAddr.reserve(pto->vAddrToSend.size());
2844 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2846 // returns true if wasn't already contained in the set
2847 if (pto->setAddrKnown.insert(addr).second)
2849 vAddr.push_back(addr);
2850 // receiver rejects addr messages larger than 1000
2851 if (vAddr.size() >= 1000)
2853 pto->PushMessage("addr", vAddr);
2858 pto->vAddrToSend.clear();
2860 pto->PushMessage("addr", vAddr);
2865 // Message: inventory
2868 vector<CInv> vInvWait;
2869 CRITICAL_BLOCK(pto->cs_inventory)
2871 vInv.reserve(pto->vInventoryToSend.size());
2872 vInvWait.reserve(pto->vInventoryToSend.size());
2873 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2875 if (pto->setInventoryKnown.count(inv))
2878 // trickle out tx inv to protect privacy
2879 if (inv.type == MSG_TX && !fSendTrickle)
2881 // 1/4 of tx invs blast to all immediately
2882 static uint256 hashSalt;
2884 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2885 uint256 hashRand = inv.hash ^ hashSalt;
2886 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2887 bool fTrickleWait = ((hashRand & 3) != 0);
2889 // always trickle our own transactions
2893 if (GetTransaction(inv.hash, wtx))
2895 fTrickleWait = true;
2900 vInvWait.push_back(inv);
2905 // returns true if wasn't already contained in the set
2906 if (pto->setInventoryKnown.insert(inv).second)
2908 vInv.push_back(inv);
2909 if (vInv.size() >= 1000)
2911 pto->PushMessage("inv", vInv);
2916 pto->vInventoryToSend = vInvWait;
2919 pto->PushMessage("inv", vInv);
2925 vector<CInv> vGetData;
2926 int64 nNow = GetTime() * 1000000;
2928 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2930 const CInv& inv = (*pto->mapAskFor.begin()).second;
2931 if (!AlreadyHave(txdb, inv))
2933 printf("sending getdata: %s\n", inv.ToString().c_str());
2934 vGetData.push_back(inv);
2935 if (vGetData.size() >= 1000)
2937 pto->PushMessage("getdata", vGetData);
2941 mapAlreadyAskedFor[inv] = nNow;
2942 pto->mapAskFor.erase(pto->mapAskFor.begin());
2944 if (!vGetData.empty())
2945 pto->PushMessage("getdata", vGetData);
2964 //////////////////////////////////////////////////////////////////////////////
2969 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2971 unsigned char* pdata = (unsigned char*)pbuffer;
2972 unsigned int blocks = 1 + ((len + 8) / 64);
2973 unsigned char* pend = pdata + 64 * blocks;
2974 memset(pdata + len, 0, 64 * blocks - len);
2976 unsigned int bits = len * 8;
2977 pend[-1] = (bits >> 0) & 0xff;
2978 pend[-2] = (bits >> 8) & 0xff;
2979 pend[-3] = (bits >> 16) & 0xff;
2980 pend[-4] = (bits >> 24) & 0xff;
2984 static const unsigned int pSHA256InitState[8] =
2985 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2987 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2990 unsigned char data[64];
2994 for (int i = 0; i < 16; i++)
2995 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2997 for (int i = 0; i < 8; i++)
2998 ctx.h[i] = ((uint32_t*)pinit)[i];
3000 SHA256_Update(&ctx, data, sizeof(data));
3001 for (int i = 0; i < 8; i++)
3002 ((uint32_t*)pstate)[i] = ctx.h[i];
3006 // ScanHash scans nonces looking for a hash with at least some zero bits.
3007 // It operates on big endian data. Caller does the byte reversing.
3008 // All input buffers are 16-byte aligned. nNonce is usually preserved
3009 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3010 // the block is rebuilt and nNonce starts over at zero.
3012 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3014 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3018 // Hash pdata using pmidstate as the starting state into
3019 // preformatted buffer phash1, then hash phash1 into phash
3021 SHA256Transform(phash1, pdata, pmidstate);
3022 SHA256Transform(phash, phash1, pSHA256InitState);
3024 // Return the nonce if the hash has at least some zero bits,
3025 // caller will check if it has enough to reach the target
3026 if (((unsigned short*)phash)[14] == 0)
3029 // If nothing found after trying for a while, return -1
3030 if ((nNonce & 0xffff) == 0)
3032 nHashesDone = 0xffff+1;
3038 // Some explaining would be appreciated
3043 set<uint256> setDependsOn;
3046 COrphan(CTransaction* ptxIn)
3054 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3055 BOOST_FOREACH(uint256 hash, setDependsOn)
3056 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3061 uint64 nLastBlockTx = 0;
3062 uint64 nLastBlockSize = 0;
3064 CBlock* CreateNewBlock(CReserveKey& reservekey)
3066 CBlockIndex* pindexPrev = pindexBest;
3069 auto_ptr<CBlock> pblock(new CBlock());
3073 // Create coinbase tx
3075 txNew.vin.resize(1);
3076 txNew.vin[0].prevout.SetNull();
3077 txNew.vout.resize(1);
3078 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3080 // Add our coinbase tx as first transaction
3081 pblock->vtx.push_back(txNew);
3083 // Collect memory pool transactions into the block
3085 CRITICAL_BLOCK(cs_main)
3086 CRITICAL_BLOCK(cs_mapTransactions)
3090 // Priority order to process transactions
3091 list<COrphan> vOrphan; // list memory doesn't move
3092 map<uint256, vector<COrphan*> > mapDependers;
3093 multimap<double, CTransaction*> mapPriority;
3094 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3096 CTransaction& tx = (*mi).second;
3097 if (tx.IsCoinBase() || !tx.IsFinal())
3100 COrphan* porphan = NULL;
3101 double dPriority = 0;
3102 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3104 // Read prev transaction
3105 CTransaction txPrev;
3107 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3109 // Has to wait for dependencies
3112 // Use list for automatic deletion
3113 vOrphan.push_back(COrphan(&tx));
3114 porphan = &vOrphan.back();
3116 mapDependers[txin.prevout.hash].push_back(porphan);
3117 porphan->setDependsOn.insert(txin.prevout.hash);
3120 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3122 // Read block header
3123 int nConf = txindex.GetDepthInMainChain();
3125 dPriority += (double)nValueIn * nConf;
3127 if (fDebug && GetBoolArg("-printpriority"))
3128 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3131 // Priority is sum(valuein * age) / txsize
3132 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3135 porphan->dPriority = dPriority;
3137 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3139 if (fDebug && GetBoolArg("-printpriority"))
3141 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3148 // Collect transactions into block
3149 map<uint256, CTxIndex> mapTestPool;
3150 uint64 nBlockSize = 1000;
3151 uint64 nBlockTx = 0;
3152 int nBlockSigOps = 100;
3153 while (!mapPriority.empty())
3155 // Take highest priority transaction off priority queue
3156 double dPriority = -(*mapPriority.begin()).first;
3157 CTransaction& tx = *(*mapPriority.begin()).second;
3158 mapPriority.erase(mapPriority.begin());
3161 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3162 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3165 // Legacy limits on sigOps:
3166 int nTxSigOps = tx.GetLegacySigOpCount();
3167 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3170 // Transaction fee required depends on block size
3171 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3172 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3174 // Connecting shouldn't fail due to dependency on other memory pool transactions
3175 // because we're already processing them in order of dependency
3176 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3177 MapPrevTx mapInputs;
3179 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3182 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3183 if (nTxFees < nMinFee)
3186 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3187 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3190 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3192 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3193 swap(mapTestPool, mapTestPoolTmp);
3196 pblock->vtx.push_back(tx);
3197 nBlockSize += nTxSize;
3199 nBlockSigOps += nTxSigOps;
3202 // Add transactions that depend on this one to the priority queue
3203 uint256 hash = tx.GetHash();
3204 if (mapDependers.count(hash))
3206 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3208 if (!porphan->setDependsOn.empty())
3210 porphan->setDependsOn.erase(hash);
3211 if (porphan->setDependsOn.empty())
3212 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3218 nLastBlockTx = nBlockTx;
3219 nLastBlockSize = nBlockSize;
3220 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3223 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3226 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3227 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3228 pblock->UpdateTime(pindexPrev);
3229 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3232 return pblock.release();
3236 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3238 // Update nExtraNonce
3239 static uint256 hashPrevBlock;
3240 if (hashPrevBlock != pblock->hashPrevBlock)
3243 hashPrevBlock = pblock->hashPrevBlock;
3246 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3247 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3249 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3253 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3256 // Prebuild hash buffers
3263 uint256 hashPrevBlock;
3264 uint256 hashMerkleRoot;
3267 unsigned int nNonce;
3270 unsigned char pchPadding0[64];
3272 unsigned char pchPadding1[64];
3275 memset(&tmp, 0, sizeof(tmp));
3277 tmp.block.nVersion = pblock->nVersion;
3278 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3279 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3280 tmp.block.nTime = pblock->nTime;
3281 tmp.block.nBits = pblock->nBits;
3282 tmp.block.nNonce = pblock->nNonce;
3284 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3285 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3287 // Byte swap all the input buffer
3288 for (int i = 0; i < sizeof(tmp)/4; i++)
3289 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3291 // Precalc the first half of the first hash, which stays constant
3292 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3294 memcpy(pdata, &tmp.block, 128);
3295 memcpy(phash1, &tmp.hash1, 64);
3299 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3301 uint256 hash = pblock->GetHash();
3302 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3304 if (hash > hashTarget)
3308 printf("BitcoinMiner:\n");
3309 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3311 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3312 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3315 CRITICAL_BLOCK(cs_main)
3317 if (pblock->hashPrevBlock != hashBestChain)
3318 return error("BitcoinMiner : generated block is stale");
3320 // Remove key from key pool
3321 reservekey.KeepKey();
3323 // Track how many getdata requests this block gets
3324 CRITICAL_BLOCK(wallet.cs_wallet)
3325 wallet.mapRequestCount[pblock->GetHash()] = 0;
3327 // Process this block the same as if we had received it from another node
3328 if (!ProcessBlock(NULL, pblock))
3329 return error("BitcoinMiner : ProcessBlock, block not accepted");
3335 void static ThreadBitcoinMiner(void* parg);
3337 static bool fGenerateBitcoins = false;
3338 static bool fLimitProcessors = false;
3339 static int nLimitProcessors = -1;
3341 void static BitcoinMiner(CWallet *pwallet)
3343 printf("BitcoinMiner started\n");
3344 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3346 // Each thread has its own key and counter
3347 CReserveKey reservekey(pwallet);
3348 unsigned int nExtraNonce = 0;
3350 while (fGenerateBitcoins)
3352 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3356 while (vNodes.empty() || IsInitialBlockDownload())
3361 if (!fGenerateBitcoins)
3369 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3370 CBlockIndex* pindexPrev = pindexBest;
3372 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3375 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3377 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3381 // Prebuild hash buffers
3383 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3384 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3385 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3387 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3389 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3390 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3391 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3397 int64 nStart = GetTime();
3398 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3400 uint256& hash = *alignup<16>(hashbuf);
3403 unsigned int nHashesDone = 0;
3404 unsigned int nNonceFound;
3407 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3408 (char*)&hash, nHashesDone);
3410 // Check if something found
3411 if (nNonceFound != -1)
3413 for (int i = 0; i < sizeof(hash)/4; i++)
3414 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3416 if (hash <= hashTarget)
3419 pblock->nNonce = ByteReverse(nNonceFound);
3420 assert(hash == pblock->GetHash());
3422 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3423 CheckWork(pblock.get(), *pwalletMain, reservekey);
3424 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3430 static int64 nHashCounter;
3431 if (nHPSTimerStart == 0)
3433 nHPSTimerStart = GetTimeMillis();
3437 nHashCounter += nHashesDone;
3438 if (GetTimeMillis() - nHPSTimerStart > 4000)
3440 static CCriticalSection cs;
3443 if (GetTimeMillis() - nHPSTimerStart > 4000)
3445 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3446 nHPSTimerStart = GetTimeMillis();
3448 static int64 nLogTime;
3449 if (GetTime() - nLogTime > 30 * 60)
3451 nLogTime = GetTime();
3452 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3453 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3459 // Check for stop or if block needs to be rebuilt
3462 if (!fGenerateBitcoins)
3464 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3468 if (nBlockNonce >= 0xffff0000)
3470 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3472 if (pindexPrev != pindexBest)
3475 // Update nTime every few seconds
3476 pblock->UpdateTime(pindexPrev);
3477 nBlockTime = ByteReverse(pblock->nTime);
3480 // Changing pblock->nTime can change work required on testnet:
3481 nBlockBits = ByteReverse(pblock->nBits);
3482 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3488 void static ThreadBitcoinMiner(void* parg)
3490 CWallet* pwallet = (CWallet*)parg;
3493 vnThreadsRunning[THREAD_MINER]++;
3494 BitcoinMiner(pwallet);
3495 vnThreadsRunning[THREAD_MINER]--;
3497 catch (std::exception& e) {
3498 vnThreadsRunning[THREAD_MINER]--;
3499 PrintException(&e, "ThreadBitcoinMiner()");
3501 vnThreadsRunning[THREAD_MINER]--;
3502 PrintException(NULL, "ThreadBitcoinMiner()");
3505 if (vnThreadsRunning[THREAD_MINER] == 0)
3507 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3511 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3513 fGenerateBitcoins = fGenerate;
3514 nLimitProcessors = GetArg("-genproclimit", -1);
3515 if (nLimitProcessors == 0)
3516 fGenerateBitcoins = false;
3517 fLimitProcessors = (nLimitProcessors != -1);
3521 int nProcessors = boost::thread::hardware_concurrency();
3522 printf("%d processors\n", nProcessors);
3523 if (nProcessors < 1)
3525 if (fLimitProcessors && nProcessors > nLimitProcessors)
3526 nProcessors = nLimitProcessors;
3527 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3528 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3529 for (int i = 0; i < nAddThreads; i++)
3531 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3532 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");