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)
74 LOCK(cs_setpwalletRegistered);
75 setpwalletRegistered.insert(pwalletIn);
79 void UnregisterWallet(CWallet* pwalletIn)
82 LOCK(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();
477 LOCK(cs_mapTransactions);
478 if (mapTransactions.count(hash))
482 if (txdb.ContainsTx(hash))
485 // Check for conflicts with in-memory transactions
486 CTransaction* ptxOld = NULL;
487 for (int i = 0; i < vin.size(); i++)
489 COutPoint outpoint = vin[i].prevout;
490 if (mapNextTx.count(outpoint))
492 // Disable replacement feature for now
495 // Allow replacing with a newer version of the same transaction
498 ptxOld = mapNextTx[outpoint].ptx;
499 if (ptxOld->IsFinal())
501 if (!IsNewerThan(*ptxOld))
503 for (int i = 0; i < vin.size(); i++)
505 COutPoint outpoint = vin[i].prevout;
506 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
516 map<uint256, CTxIndex> mapUnused;
517 bool fInvalid = false;
518 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
521 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
523 *pfMissingInputs = true;
524 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
527 // Check for non-standard pay-to-script-hash in inputs
528 if (!AreInputsStandard(mapInputs) && !fTestNet)
529 return error("AcceptToMemoryPool() : nonstandard transaction input");
531 // Note: if you modify this code to accept non-standard transactions, then
532 // you should add code here to check that the transaction does a
533 // reasonable number of ECDSA signature verifications.
535 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
536 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
538 // Don't accept it if it can't get into a block
539 if (nFees < GetMinFee(1000, true, GMF_RELAY))
540 return error("AcceptToMemoryPool() : not enough fees");
542 // Continuously rate-limit free transactions
543 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
544 // be annoying or make other's transactions take longer to confirm.
545 if (nFees < MIN_RELAY_TX_FEE)
547 static CCriticalSection cs;
548 static double dFreeCount;
549 static int64 nLastTime;
550 int64 nNow = GetTime();
554 // Use an exponentially decaying ~10-minute window:
555 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
557 // -limitfreerelay unit is thousand-bytes-per-minute
558 // At default rate it would take over a month to fill 1GB
559 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
560 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
562 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
567 // Check against previous transactions
568 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
569 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
571 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
575 // Store transaction in memory
577 LOCK(cs_mapTransactions);
580 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
581 ptxOld->RemoveFromMemoryPool();
583 AddToMemoryPoolUnchecked();
586 ///// are we sure this is ok when loading transactions or restoring block txes
587 // If updated, erase old tx from wallet
589 EraseFromWallets(ptxOld->GetHash());
591 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
595 uint64 nPooledTx = 0;
597 bool CTransaction::AddToMemoryPoolUnchecked()
599 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
600 // Add to memory pool without checking anything. Don't call this directly,
601 // call AcceptToMemoryPool to properly check the transaction first.
603 LOCK(cs_mapTransactions);
604 uint256 hash = GetHash();
605 mapTransactions[hash] = *this;
606 for (int i = 0; i < vin.size(); i++)
607 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
608 nTransactionsUpdated++;
615 bool CTransaction::RemoveFromMemoryPool()
617 // Remove transaction from memory pool
619 LOCK(cs_mapTransactions);
620 uint256 hash = GetHash();
621 if (mapTransactions.count(hash))
623 BOOST_FOREACH(const CTxIn& txin, vin)
624 mapNextTx.erase(txin.prevout);
625 mapTransactions.erase(hash);
626 nTransactionsUpdated++;
638 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
640 if (hashBlock == 0 || nIndex == -1)
643 // Find the block it claims to be in
644 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
645 if (mi == mapBlockIndex.end())
647 CBlockIndex* pindex = (*mi).second;
648 if (!pindex || !pindex->IsInMainChain())
651 // Make sure the merkle branch connects to this block
652 if (!fMerkleVerified)
654 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
656 fMerkleVerified = true;
660 return pindexBest->nHeight - pindex->nHeight + 1;
664 int CMerkleTx::GetBlocksToMaturity() const
668 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
672 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
676 if (!IsInMainChain() && !ClientConnectInputs())
678 return CTransaction::AcceptToMemoryPool(txdb, false);
682 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
686 bool CMerkleTx::AcceptToMemoryPool()
689 return AcceptToMemoryPool(txdb);
694 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
698 LOCK(cs_mapTransactions);
699 // Add previous supporting transactions first
700 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
702 if (!tx.IsCoinBase())
704 uint256 hash = tx.GetHash();
705 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
706 tx.AcceptToMemoryPool(txdb, fCheckInputs);
709 return AcceptToMemoryPool(txdb, fCheckInputs);
714 bool CWalletTx::AcceptWalletTransaction()
717 return AcceptWalletTransaction(txdb);
720 int CTxIndex::GetDepthInMainChain() const
724 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
726 // Find the block in the index
727 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
728 if (mi == mapBlockIndex.end())
730 CBlockIndex* pindex = (*mi).second;
731 if (!pindex || !pindex->IsInMainChain())
733 return 1 + nBestHeight - pindex->nHeight;
745 //////////////////////////////////////////////////////////////////////////////
747 // CBlock and CBlockIndex
750 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
752 if (!fReadTransactions)
754 *this = pindex->GetBlockHeader();
757 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
759 if (GetHash() != pindex->GetBlockHash())
760 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
764 uint256 static GetOrphanRoot(const CBlock* pblock)
766 // Work back to the first block in the orphan chain
767 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
768 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
769 return pblock->GetHash();
772 int64 static GetBlockValue(int nHeight, int64 nFees)
774 int64 nSubsidy = 50 * COIN;
776 // Subsidy is cut in half every 4 years
777 nSubsidy >>= (nHeight / 210000);
779 return nSubsidy + nFees;
782 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
783 static const int64 nTargetSpacing = 10 * 60;
784 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
787 // minimum amount of work that could possibly be required nTime after
788 // minimum work required was nBase
790 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
792 // Testnet has min-difficulty blocks
793 // after nTargetSpacing*2 time between blocks:
794 if (fTestNet && nTime > nTargetSpacing*2)
795 return bnProofOfWorkLimit.GetCompact();
798 bnResult.SetCompact(nBase);
799 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
801 // Maximum 400% adjustment...
803 // ... in best-case exactly 4-times-normal target time
804 nTime -= nTargetTimespan*4;
806 if (bnResult > bnProofOfWorkLimit)
807 bnResult = bnProofOfWorkLimit;
808 return bnResult.GetCompact();
811 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
813 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
816 if (pindexLast == NULL)
817 return nProofOfWorkLimit;
819 // Only change once per interval
820 if ((pindexLast->nHeight+1) % nInterval != 0)
822 // Special rules for testnet after 15 Feb 2012:
823 if (fTestNet && pblock->nTime > 1329264000)
825 // If the new block's timestamp is more than 2* 10 minutes
826 // then allow mining of a min-difficulty block.
827 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
828 return nProofOfWorkLimit;
831 // Return the last non-special-min-difficulty-rules-block
832 const CBlockIndex* pindex = pindexLast;
833 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
834 pindex = pindex->pprev;
835 return pindex->nBits;
839 return pindexLast->nBits;
842 // Go back by what we want to be 14 days worth of blocks
843 const CBlockIndex* pindexFirst = pindexLast;
844 for (int i = 0; pindexFirst && i < nInterval-1; i++)
845 pindexFirst = pindexFirst->pprev;
848 // Limit adjustment step
849 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
850 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
851 if (nActualTimespan < nTargetTimespan/4)
852 nActualTimespan = nTargetTimespan/4;
853 if (nActualTimespan > nTargetTimespan*4)
854 nActualTimespan = nTargetTimespan*4;
858 bnNew.SetCompact(pindexLast->nBits);
859 bnNew *= nActualTimespan;
860 bnNew /= nTargetTimespan;
862 if (bnNew > bnProofOfWorkLimit)
863 bnNew = bnProofOfWorkLimit;
866 printf("GetNextWorkRequired RETARGET\n");
867 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
868 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
869 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
871 return bnNew.GetCompact();
874 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
877 bnTarget.SetCompact(nBits);
880 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
881 return error("CheckProofOfWork() : nBits below minimum work");
883 // Check proof of work matches claimed amount
884 if (hash > bnTarget.getuint256())
885 return error("CheckProofOfWork() : hash doesn't match nBits");
890 // Return maximum amount of blocks that other nodes claim to have
891 int GetNumBlocksOfPeers()
893 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
896 bool IsInitialBlockDownload()
898 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
900 static int64 nLastUpdate;
901 static CBlockIndex* pindexLastBest;
902 if (pindexBest != pindexLastBest)
904 pindexLastBest = pindexBest;
905 nLastUpdate = GetTime();
907 return (GetTime() - nLastUpdate < 10 &&
908 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
911 void static InvalidChainFound(CBlockIndex* pindexNew)
913 if (pindexNew->bnChainWork > bnBestInvalidWork)
915 bnBestInvalidWork = pindexNew->bnChainWork;
916 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
919 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());
920 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
921 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
922 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
925 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
927 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
929 // Updating time can change work required on testnet:
931 nBits = GetNextWorkRequired(pindexPrev, this);
944 bool CTransaction::DisconnectInputs(CTxDB& txdb)
946 // Relinquish previous transactions' spent pointers
949 BOOST_FOREACH(const CTxIn& txin, vin)
951 COutPoint prevout = txin.prevout;
953 // Get prev txindex from disk
955 if (!txdb.ReadTxIndex(prevout.hash, txindex))
956 return error("DisconnectInputs() : ReadTxIndex failed");
958 if (prevout.n >= txindex.vSpent.size())
959 return error("DisconnectInputs() : prevout.n out of range");
961 // Mark outpoint as not spent
962 txindex.vSpent[prevout.n].SetNull();
965 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
966 return error("DisconnectInputs() : UpdateTxIndex failed");
970 // Remove transaction from index
971 // This can fail if a duplicate of this transaction was in a chain that got
972 // reorganized away. This is only possible if this transaction was completely
973 // spent, so erasing it would be a no-op anway.
974 txdb.EraseTxIndex(*this);
980 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
981 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
983 // FetchInputs can return false either because we just haven't seen some inputs
984 // (in which case the transaction should be stored as an orphan)
985 // or because the transaction is malformed (in which case the transaction should
986 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
990 return true; // Coinbase transactions have no inputs to fetch.
992 for (int i = 0; i < vin.size(); i++)
994 COutPoint prevout = vin[i].prevout;
995 if (inputsRet.count(prevout.hash))
996 continue; // Got it already
999 CTxIndex& txindex = inputsRet[prevout.hash].first;
1001 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1003 // Get txindex from current proposed changes
1004 txindex = mapTestPool.find(prevout.hash)->second;
1008 // Read txindex from txdb
1009 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1011 if (!fFound && (fBlock || fMiner))
1012 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());
1015 CTransaction& txPrev = inputsRet[prevout.hash].second;
1016 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1018 // Get prev tx from single transactions in memory
1020 LOCK(cs_mapTransactions);
1021 if (!mapTransactions.count(prevout.hash))
1022 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1023 txPrev = mapTransactions[prevout.hash];
1026 txindex.vSpent.resize(txPrev.vout.size());
1030 // Get prev tx from disk
1031 if (!txPrev.ReadFromDisk(txindex.pos))
1032 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1036 // Make sure all prevout.n's are valid:
1037 for (int i = 0; i < vin.size(); i++)
1039 const COutPoint prevout = vin[i].prevout;
1040 assert(inputsRet.count(prevout.hash) != 0);
1041 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1042 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1043 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1045 // Revisit this if/when transaction replacement is implemented and allows
1048 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()));
1055 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1057 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1058 if (mi == inputs.end())
1059 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1061 const CTransaction& txPrev = (mi->second).second;
1062 if (input.prevout.n >= txPrev.vout.size())
1063 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1065 return txPrev.vout[input.prevout.n];
1068 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1074 for (int i = 0; i < vin.size(); i++)
1076 nResult += GetOutputFor(vin[i], inputs).nValue;
1082 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1088 for (int i = 0; i < vin.size(); i++)
1090 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1091 if (prevout.scriptPubKey.IsPayToScriptHash())
1092 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1097 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1098 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1099 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1101 // Take over previous transactions' spent pointers
1102 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1103 // fMiner is true when called from the internal bitcoin miner
1104 // ... both are false when called from CTransaction::AcceptToMemoryPool
1109 for (int i = 0; i < vin.size(); i++)
1111 COutPoint prevout = vin[i].prevout;
1112 assert(inputs.count(prevout.hash) > 0);
1113 CTxIndex& txindex = inputs[prevout.hash].first;
1114 CTransaction& txPrev = inputs[prevout.hash].second;
1116 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1117 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()));
1119 // If prev is coinbase, check that it's matured
1120 if (txPrev.IsCoinBase())
1121 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1122 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1123 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1125 // Check for conflicts (double-spend)
1126 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1127 // for an attacker to attempt to split the network.
1128 if (!txindex.vSpent[prevout.n].IsNull())
1129 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());
1131 // Check for negative or overflow input values
1132 nValueIn += txPrev.vout[prevout.n].nValue;
1133 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1134 return DoS(100, error("ConnectInputs() : txin values out of range"));
1136 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1137 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1138 // still computed and checked, and any change will be caught at the next checkpoint.
1139 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1142 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1144 // only during transition phase for P2SH: do not invoke anti-DoS code for
1145 // potentially old clients relaying bad P2SH transactions
1146 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1147 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1149 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1153 // Mark outpoints as spent
1154 txindex.vSpent[prevout.n] = posThisTx;
1157 if (fBlock || fMiner)
1159 mapTestPool[prevout.hash] = txindex;
1163 if (nValueIn < GetValueOut())
1164 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1166 // Tally transaction fees
1167 int64 nTxFee = nValueIn - GetValueOut();
1169 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1171 if (!MoneyRange(nFees))
1172 return DoS(100, error("ConnectInputs() : nFees out of range"));
1179 bool CTransaction::ClientConnectInputs()
1184 // Take over previous transactions' spent pointers
1186 LOCK(cs_mapTransactions);
1188 for (int i = 0; i < vin.size(); i++)
1190 // Get prev tx from single transactions in memory
1191 COutPoint prevout = vin[i].prevout;
1192 if (!mapTransactions.count(prevout.hash))
1194 CTransaction& txPrev = mapTransactions[prevout.hash];
1196 if (prevout.n >= txPrev.vout.size())
1200 if (!VerifySignature(txPrev, *this, i, true, 0))
1201 return error("ConnectInputs() : VerifySignature failed");
1203 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1204 ///// this has to go away now that posNext is gone
1205 // // Check for conflicts
1206 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1207 // return error("ConnectInputs() : prev tx already used");
1209 // // Flag outpoints as used
1210 // txPrev.vout[prevout.n].posNext = posThisTx;
1212 nValueIn += txPrev.vout[prevout.n].nValue;
1214 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1215 return error("ClientConnectInputs() : txin values out of range");
1217 if (GetValueOut() > nValueIn)
1227 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1229 // Disconnect in reverse order
1230 for (int i = vtx.size()-1; i >= 0; i--)
1231 if (!vtx[i].DisconnectInputs(txdb))
1234 // Update block index on disk without changing it in memory.
1235 // The memory index structure will be changed after the db commits.
1238 CDiskBlockIndex blockindexPrev(pindex->pprev);
1239 blockindexPrev.hashNext = 0;
1240 if (!txdb.WriteBlockIndex(blockindexPrev))
1241 return error("DisconnectBlock() : WriteBlockIndex failed");
1247 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1249 // Check it again in case a previous version let a bad block in
1253 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1254 // unless those are already completely spent.
1255 // If such overwrites are allowed, coinbases and transactions depending upon those
1256 // can be duplicated to remove the ability to spend the first instance -- even after
1257 // being sent to another address.
1258 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1259 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1260 // already refuses previously-known transaction id's entirely.
1261 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1262 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1263 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1264 BOOST_FOREACH(CTransaction& tx, vtx)
1266 CTxIndex txindexOld;
1267 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1268 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1273 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1274 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1275 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1277 //// issue here: it doesn't know the version
1278 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1280 map<uint256, CTxIndex> mapQueuedChanges;
1283 BOOST_FOREACH(CTransaction& tx, vtx)
1285 nSigOps += tx.GetLegacySigOpCount();
1286 if (nSigOps > MAX_BLOCK_SIGOPS)
1287 return DoS(100, error("ConnectBlock() : too many sigops"));
1289 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1290 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1292 MapPrevTx mapInputs;
1293 if (!tx.IsCoinBase())
1296 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1299 if (fStrictPayToScriptHash)
1301 // Add in sigops done by pay-to-script-hash inputs;
1302 // this is to prevent a "rogue miner" from creating
1303 // an incredibly-expensive-to-validate block.
1304 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1305 if (nSigOps > MAX_BLOCK_SIGOPS)
1306 return DoS(100, error("ConnectBlock() : too many sigops"));
1309 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1311 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1315 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1318 // Write queued txindex changes
1319 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1321 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1322 return error("ConnectBlock() : UpdateTxIndex failed");
1325 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1328 // Update block index on disk without changing it in memory.
1329 // The memory index structure will be changed after the db commits.
1332 CDiskBlockIndex blockindexPrev(pindex->pprev);
1333 blockindexPrev.hashNext = pindex->GetBlockHash();
1334 if (!txdb.WriteBlockIndex(blockindexPrev))
1335 return error("ConnectBlock() : WriteBlockIndex failed");
1338 // Watch for transactions paying to me
1339 BOOST_FOREACH(CTransaction& tx, vtx)
1340 SyncWithWallets(tx, this, true);
1345 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1347 printf("REORGANIZE\n");
1350 CBlockIndex* pfork = pindexBest;
1351 CBlockIndex* plonger = pindexNew;
1352 while (pfork != plonger)
1354 while (plonger->nHeight > pfork->nHeight)
1355 if (!(plonger = plonger->pprev))
1356 return error("Reorganize() : plonger->pprev is null");
1357 if (pfork == plonger)
1359 if (!(pfork = pfork->pprev))
1360 return error("Reorganize() : pfork->pprev is null");
1363 // List of what to disconnect
1364 vector<CBlockIndex*> vDisconnect;
1365 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1366 vDisconnect.push_back(pindex);
1368 // List of what to connect
1369 vector<CBlockIndex*> vConnect;
1370 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1371 vConnect.push_back(pindex);
1372 reverse(vConnect.begin(), vConnect.end());
1374 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());
1375 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());
1377 // Disconnect shorter branch
1378 vector<CTransaction> vResurrect;
1379 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1382 if (!block.ReadFromDisk(pindex))
1383 return error("Reorganize() : ReadFromDisk for disconnect failed");
1384 if (!block.DisconnectBlock(txdb, pindex))
1385 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1387 // Queue memory transactions to resurrect
1388 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1389 if (!tx.IsCoinBase())
1390 vResurrect.push_back(tx);
1393 // Connect longer branch
1394 vector<CTransaction> vDelete;
1395 for (int i = 0; i < vConnect.size(); i++)
1397 CBlockIndex* pindex = vConnect[i];
1399 if (!block.ReadFromDisk(pindex))
1400 return error("Reorganize() : ReadFromDisk for connect failed");
1401 if (!block.ConnectBlock(txdb, pindex))
1405 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1408 // Queue memory transactions to delete
1409 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1410 vDelete.push_back(tx);
1412 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1413 return error("Reorganize() : WriteHashBestChain failed");
1415 // Make sure it's successfully written to disk before changing memory structure
1416 if (!txdb.TxnCommit())
1417 return error("Reorganize() : TxnCommit failed");
1419 // Disconnect shorter branch
1420 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1422 pindex->pprev->pnext = NULL;
1424 // Connect longer branch
1425 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1427 pindex->pprev->pnext = pindex;
1429 // Resurrect memory transactions that were in the disconnected branch
1430 BOOST_FOREACH(CTransaction& tx, vResurrect)
1431 tx.AcceptToMemoryPool(txdb, false);
1433 // Delete redundant memory transactions that are in the connected branch
1434 BOOST_FOREACH(CTransaction& tx, vDelete)
1435 tx.RemoveFromMemoryPool();
1437 printf("REORGANIZE: done\n");
1444 runCommand(std::string strCommand)
1446 int nErr = ::system(strCommand.c_str());
1448 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1451 // Called from inside SetBestChain: attaches a block to the new best chain being built
1452 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1454 uint256 hash = GetHash();
1456 // Adding to current best branch
1457 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1460 InvalidChainFound(pindexNew);
1463 if (!txdb.TxnCommit())
1464 return error("SetBestChain() : TxnCommit failed");
1466 // Add to current best branch
1467 pindexNew->pprev->pnext = pindexNew;
1469 // Delete redundant memory transactions
1470 BOOST_FOREACH(CTransaction& tx, vtx)
1471 tx.RemoveFromMemoryPool();
1476 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1478 uint256 hash = GetHash();
1481 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1483 txdb.WriteHashBestChain(hash);
1484 if (!txdb.TxnCommit())
1485 return error("SetBestChain() : TxnCommit failed");
1486 pindexGenesisBlock = pindexNew;
1488 else if (hashPrevBlock == hashBestChain)
1490 if (!SetBestChainInner(txdb, pindexNew))
1491 return error("SetBestChain() : SetBestChainInner failed");
1495 // the first block in the new chain that will cause it to become the new best chain
1496 CBlockIndex *pindexIntermediate = pindexNew;
1498 // list of blocks that need to be connected afterwards
1499 std::vector<CBlockIndex*> vpindexSecondary;
1501 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1502 // Try to limit how much needs to be done inside
1503 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1505 vpindexSecondary.push_back(pindexIntermediate);
1506 pindexIntermediate = pindexIntermediate->pprev;
1509 if (!vpindexSecondary.empty())
1510 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1512 // Switch to new best branch
1513 if (!Reorganize(txdb, pindexIntermediate))
1516 InvalidChainFound(pindexNew);
1517 return error("SetBestChain() : Reorganize failed");
1520 // Connect futher blocks
1521 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1524 if (!block.ReadFromDisk(pindex))
1526 printf("SetBestChain() : ReadFromDisk failed\n");
1530 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1531 if (!block.SetBestChainInner(txdb, pindex))
1536 // Update best block in wallet (so we can detect restored wallets)
1537 bool fIsInitialDownload = IsInitialBlockDownload();
1538 if (!fIsInitialDownload)
1540 const CBlockLocator locator(pindexNew);
1541 ::SetBestChain(locator);
1545 hashBestChain = hash;
1546 pindexBest = pindexNew;
1547 nBestHeight = pindexBest->nHeight;
1548 bnBestChainWork = pindexNew->bnChainWork;
1549 nTimeBestReceived = GetTime();
1550 nTransactionsUpdated++;
1551 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1553 std::string strCmd = GetArg("-blocknotify", "");
1555 if (!fIsInitialDownload && !strCmd.empty())
1557 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1558 boost::thread t(runCommand, strCmd); // thread runs free
1565 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1567 // Check for duplicate
1568 uint256 hash = GetHash();
1569 if (mapBlockIndex.count(hash))
1570 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1572 // Construct new block index object
1573 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1575 return error("AddToBlockIndex() : new CBlockIndex failed");
1576 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1577 pindexNew->phashBlock = &((*mi).first);
1578 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1579 if (miPrev != mapBlockIndex.end())
1581 pindexNew->pprev = (*miPrev).second;
1582 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1584 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1588 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1589 if (!txdb.TxnCommit())
1593 if (pindexNew->bnChainWork > bnBestChainWork)
1594 if (!SetBestChain(txdb, pindexNew))
1599 if (pindexNew == pindexBest)
1601 // Notify UI to display prev block's coinbase if it was ours
1602 static uint256 hashPrevBestCoinBase;
1603 UpdatedTransaction(hashPrevBestCoinBase);
1604 hashPrevBestCoinBase = vtx[0].GetHash();
1614 bool CBlock::CheckBlock() const
1616 // These are checks that are independent of context
1617 // that can be verified before saving an orphan block.
1620 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1621 return DoS(100, error("CheckBlock() : size limits failed"));
1623 // Check proof of work matches claimed amount
1624 if (!CheckProofOfWork(GetHash(), nBits))
1625 return DoS(50, error("CheckBlock() : proof of work failed"));
1628 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1629 return error("CheckBlock() : block timestamp too far in the future");
1631 // First transaction must be coinbase, the rest must not be
1632 if (vtx.empty() || !vtx[0].IsCoinBase())
1633 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1634 for (int i = 1; i < vtx.size(); i++)
1635 if (vtx[i].IsCoinBase())
1636 return DoS(100, error("CheckBlock() : more than one coinbase"));
1638 // Check transactions
1639 BOOST_FOREACH(const CTransaction& tx, vtx)
1640 if (!tx.CheckTransaction())
1641 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1644 BOOST_FOREACH(const CTransaction& tx, vtx)
1646 nSigOps += tx.GetLegacySigOpCount();
1648 if (nSigOps > MAX_BLOCK_SIGOPS)
1649 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1652 if (hashMerkleRoot != BuildMerkleTree())
1653 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1658 bool CBlock::AcceptBlock()
1660 // Check for duplicate
1661 uint256 hash = GetHash();
1662 if (mapBlockIndex.count(hash))
1663 return error("AcceptBlock() : block already in mapBlockIndex");
1665 // Get prev block index
1666 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1667 if (mi == mapBlockIndex.end())
1668 return DoS(10, error("AcceptBlock() : prev block not found"));
1669 CBlockIndex* pindexPrev = (*mi).second;
1670 int nHeight = pindexPrev->nHeight+1;
1672 // Check proof of work
1673 if (nBits != GetNextWorkRequired(pindexPrev, this))
1674 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1676 // Check timestamp against prev
1677 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1678 return error("AcceptBlock() : block's timestamp is too early");
1680 // Check that all transactions are finalized
1681 BOOST_FOREACH(const CTransaction& tx, vtx)
1682 if (!tx.IsFinal(nHeight, GetBlockTime()))
1683 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1685 // Check that the block chain matches the known block chain up to a checkpoint
1686 if (!Checkpoints::CheckBlock(nHeight, hash))
1687 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1689 // Write block to history file
1690 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1691 return error("AcceptBlock() : out of disk space");
1692 unsigned int nFile = -1;
1693 unsigned int nBlockPos = 0;
1694 if (!WriteToDisk(nFile, nBlockPos))
1695 return error("AcceptBlock() : WriteToDisk failed");
1696 if (!AddToBlockIndex(nFile, nBlockPos))
1697 return error("AcceptBlock() : AddToBlockIndex failed");
1699 // Relay inventory, but don't relay old inventory during initial block download
1700 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1701 if (hashBestChain == hash)
1704 BOOST_FOREACH(CNode* pnode, vNodes)
1705 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1706 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1712 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1714 // Check for duplicate
1715 uint256 hash = pblock->GetHash();
1716 if (mapBlockIndex.count(hash))
1717 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1718 if (mapOrphanBlocks.count(hash))
1719 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1721 // Preliminary checks
1722 if (!pblock->CheckBlock())
1723 return error("ProcessBlock() : CheckBlock FAILED");
1725 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1726 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1728 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1729 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1733 pfrom->Misbehaving(100);
1734 return error("ProcessBlock() : block with timestamp before last checkpoint");
1737 bnNewBlock.SetCompact(pblock->nBits);
1739 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1740 if (bnNewBlock > bnRequired)
1743 pfrom->Misbehaving(100);
1744 return error("ProcessBlock() : block with too little proof-of-work");
1749 // If don't already have its previous block, shunt it off to holding area until we get it
1750 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1752 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1753 CBlock* pblock2 = new CBlock(*pblock);
1754 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1755 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1757 // Ask this guy to fill in what we're missing
1759 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1764 if (!pblock->AcceptBlock())
1765 return error("ProcessBlock() : AcceptBlock FAILED");
1767 // Recursively process any orphan blocks that depended on this one
1768 vector<uint256> vWorkQueue;
1769 vWorkQueue.push_back(hash);
1770 for (int i = 0; i < vWorkQueue.size(); i++)
1772 uint256 hashPrev = vWorkQueue[i];
1773 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1774 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1777 CBlock* pblockOrphan = (*mi).second;
1778 if (pblockOrphan->AcceptBlock())
1779 vWorkQueue.push_back(pblockOrphan->GetHash());
1780 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1781 delete pblockOrphan;
1783 mapOrphanBlocksByPrev.erase(hashPrev);
1786 printf("ProcessBlock: ACCEPTED\n");
1797 bool CheckDiskSpace(uint64 nAdditionalBytes)
1799 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1801 // Check for 15MB because database could create another 10MB log file at any time
1802 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1805 string strMessage = _("Warning: Disk space is low ");
1806 strMiscWarning = strMessage;
1807 printf("*** %s\n", strMessage.c_str());
1808 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1815 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1819 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1822 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1824 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1833 static unsigned int nCurrentBlockFile = 1;
1835 FILE* AppendBlockFile(unsigned int& nFileRet)
1840 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1843 if (fseek(file, 0, SEEK_END) != 0)
1845 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1846 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1848 nFileRet = nCurrentBlockFile;
1852 nCurrentBlockFile++;
1856 bool LoadBlockIndex(bool fAllowNew)
1860 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1861 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1862 pchMessageStart[0] = 0xfa;
1863 pchMessageStart[1] = 0xbf;
1864 pchMessageStart[2] = 0xb5;
1865 pchMessageStart[3] = 0xda;
1872 if (!txdb.LoadBlockIndex())
1877 // Init with genesis block
1879 if (mapBlockIndex.empty())
1885 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1886 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1887 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1888 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1889 // vMerkleTree: 4a5e1e
1892 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1894 txNew.vin.resize(1);
1895 txNew.vout.resize(1);
1896 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1897 txNew.vout[0].nValue = 50 * COIN;
1898 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1900 block.vtx.push_back(txNew);
1901 block.hashPrevBlock = 0;
1902 block.hashMerkleRoot = block.BuildMerkleTree();
1904 block.nTime = 1231006505;
1905 block.nBits = 0x1d00ffff;
1906 block.nNonce = 2083236893;
1910 block.nTime = 1296688602;
1911 block.nBits = 0x1d07fff8;
1912 block.nNonce = 384568319;
1916 printf("%s\n", block.GetHash().ToString().c_str());
1917 printf("%s\n", hashGenesisBlock.ToString().c_str());
1918 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1919 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1921 assert(block.GetHash() == hashGenesisBlock);
1923 // Start new block file
1925 unsigned int nBlockPos;
1926 if (!block.WriteToDisk(nFile, nBlockPos))
1927 return error("LoadBlockIndex() : writing genesis block to disk failed");
1928 if (!block.AddToBlockIndex(nFile, nBlockPos))
1929 return error("LoadBlockIndex() : genesis block not accepted");
1937 void PrintBlockTree()
1939 // precompute tree structure
1940 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1941 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1943 CBlockIndex* pindex = (*mi).second;
1944 mapNext[pindex->pprev].push_back(pindex);
1946 //while (rand() % 3 == 0)
1947 // mapNext[pindex->pprev].push_back(pindex);
1950 vector<pair<int, CBlockIndex*> > vStack;
1951 vStack.push_back(make_pair(0, pindexGenesisBlock));
1954 while (!vStack.empty())
1956 int nCol = vStack.back().first;
1957 CBlockIndex* pindex = vStack.back().second;
1960 // print split or gap
1961 if (nCol > nPrevCol)
1963 for (int i = 0; i < nCol-1; i++)
1967 else if (nCol < nPrevCol)
1969 for (int i = 0; i < nCol; i++)
1976 for (int i = 0; i < nCol; i++)
1981 block.ReadFromDisk(pindex);
1982 printf("%d (%u,%u) %s %s tx %d",
1986 block.GetHash().ToString().substr(0,20).c_str(),
1987 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1990 PrintWallets(block);
1992 // put the main timechain first
1993 vector<CBlockIndex*>& vNext = mapNext[pindex];
1994 for (int i = 0; i < vNext.size(); i++)
1996 if (vNext[i]->pnext)
1998 swap(vNext[0], vNext[i]);
2004 for (int i = 0; i < vNext.size(); i++)
2005 vStack.push_back(make_pair(nCol+i, vNext[i]));
2018 //////////////////////////////////////////////////////////////////////////////
2023 map<uint256, CAlert> mapAlerts;
2024 CCriticalSection cs_mapAlerts;
2026 string GetWarnings(string strFor)
2029 string strStatusBar;
2031 if (GetBoolArg("-testsafemode"))
2034 // Misc warnings like out of disk space and clock is wrong
2035 if (strMiscWarning != "")
2038 strStatusBar = strMiscWarning;
2041 // Longer invalid proof-of-work chain
2042 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2045 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2051 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2053 const CAlert& alert = item.second;
2054 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2056 nPriority = alert.nPriority;
2057 strStatusBar = alert.strStatusBar;
2062 if (strFor == "statusbar")
2063 return strStatusBar;
2064 else if (strFor == "rpc")
2066 assert(!"GetWarnings() : invalid parameter");
2070 bool CAlert::ProcessAlert()
2072 if (!CheckSignature())
2079 // Cancel previous alerts
2080 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2082 const CAlert& alert = (*mi).second;
2085 printf("cancelling alert %d\n", alert.nID);
2086 mapAlerts.erase(mi++);
2088 else if (!alert.IsInEffect())
2090 printf("expiring alert %d\n", alert.nID);
2091 mapAlerts.erase(mi++);
2097 // Check if this alert has been cancelled
2098 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2100 const CAlert& alert = item.second;
2101 if (alert.Cancels(*this))
2103 printf("alert already cancelled by %d\n", alert.nID);
2109 mapAlerts.insert(make_pair(GetHash(), *this));
2112 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2124 //////////////////////////////////////////////////////////////////////////////
2130 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2134 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2135 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2137 // Don't know what it is, just say we already got one
2144 // The message start string is designed to be unlikely to occur in normal data.
2145 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2146 // a large 4-byte int at any alignment.
2147 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2150 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2152 static map<CService, vector<unsigned char> > mapReuseKey;
2153 RandAddSeedPerfmon();
2155 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2156 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2158 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2160 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2168 if (strCommand == "version")
2170 // Each connection can only send one version message
2171 if (pfrom->nVersion != 0)
2173 pfrom->Misbehaving(1);
2181 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2182 if (pfrom->nVersion < 209)
2184 // Since February 20, 2012, the protocol is initiated at version 209,
2185 // and earlier versions are no longer supported
2186 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2187 pfrom->fDisconnect = true;
2191 if (pfrom->nVersion == 10300)
2192 pfrom->nVersion = 300;
2194 vRecv >> addrFrom >> nNonce;
2196 vRecv >> pfrom->strSubVer;
2198 vRecv >> pfrom->nStartingHeight;
2200 // Disconnect if we connected to ourself
2201 if (nNonce == nLocalHostNonce && nNonce > 1)
2203 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2204 pfrom->fDisconnect = true;
2208 // Be shy and don't send version until we hear
2209 if (pfrom->fInbound)
2210 pfrom->PushVersion();
2212 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2214 AddTimeData(pfrom->addr, nTime);
2217 pfrom->PushMessage("verack");
2218 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2220 if (!pfrom->fInbound)
2222 // Advertise our address
2223 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2224 !IsInitialBlockDownload())
2226 CAddress addr(addrLocalHost);
2227 addr.nTime = GetAdjustedTime();
2228 pfrom->PushAddress(addr);
2231 // Get recent addresses
2232 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2234 pfrom->PushMessage("getaddr");
2235 pfrom->fGetAddr = true;
2237 addrman.Good(pfrom->addr);
2239 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2241 addrman.Add(addrFrom, addrFrom);
2242 addrman.Good(addrFrom);
2246 // Ask the first connected node for block updates
2247 static int nAskedForBlocks = 0;
2248 if (!pfrom->fClient &&
2249 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2250 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2253 pfrom->PushGetBlocks(pindexBest, uint256(0));
2259 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2260 item.second.RelayTo(pfrom);
2263 pfrom->fSuccessfullyConnected = true;
2265 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2267 cPeerBlockCounts.input(pfrom->nStartingHeight);
2271 else if (pfrom->nVersion == 0)
2273 // Must have a version message before anything else
2274 pfrom->Misbehaving(1);
2279 else if (strCommand == "verack")
2281 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2285 else if (strCommand == "addr")
2287 vector<CAddress> vAddr;
2290 // Don't want addr from older versions unless seeding
2291 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2293 if (vAddr.size() > 1000)
2295 pfrom->Misbehaving(20);
2296 return error("message addr size() = %d", vAddr.size());
2299 // Store the new addresses
2300 int64 nNow = GetAdjustedTime();
2301 int64 nSince = nNow - 10 * 60;
2302 BOOST_FOREACH(CAddress& addr, vAddr)
2306 // ignore IPv6 for now, since it isn't implemented anyway
2309 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2310 addr.nTime = nNow - 5 * 24 * 60 * 60;
2311 pfrom->AddAddressKnown(addr);
2312 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2314 // Relay to a limited number of other nodes
2317 // Use deterministic randomness to send to the same nodes for 24 hours
2318 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2319 static uint256 hashSalt;
2321 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2322 int64 hashAddr = addr.GetHash();
2323 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2324 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2325 multimap<uint256, CNode*> mapMix;
2326 BOOST_FOREACH(CNode* pnode, vNodes)
2328 if (pnode->nVersion < 31402)
2330 unsigned int nPointer;
2331 memcpy(&nPointer, &pnode, sizeof(nPointer));
2332 uint256 hashKey = hashRand ^ nPointer;
2333 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2334 mapMix.insert(make_pair(hashKey, pnode));
2336 int nRelayNodes = 2;
2337 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2338 ((*mi).second)->PushAddress(addr);
2342 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2343 if (vAddr.size() < 1000)
2344 pfrom->fGetAddr = false;
2348 else if (strCommand == "inv")
2352 if (vInv.size() > 50000)
2354 pfrom->Misbehaving(20);
2355 return error("message inv size() = %d", vInv.size());
2359 for (int nInv = 0; nInv < vInv.size(); nInv++)
2361 const CInv &inv = vInv[nInv];
2365 pfrom->AddInventoryKnown(inv);
2367 bool fAlreadyHave = AlreadyHave(txdb, inv);
2369 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2371 // Always request the last block in an inv bundle (even if we already have it), as it is the
2372 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2373 // this is necessary to connect earlier received orphan blocks to the chain again.
2374 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2376 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2377 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2379 // Track requests for our stuff
2380 Inventory(inv.hash);
2385 else if (strCommand == "getdata")
2389 if (vInv.size() > 50000)
2391 pfrom->Misbehaving(20);
2392 return error("message getdata size() = %d", vInv.size());
2395 BOOST_FOREACH(const CInv& inv, vInv)
2399 printf("received getdata for: %s\n", inv.ToString().c_str());
2401 if (inv.type == MSG_BLOCK)
2403 // Send block from disk
2404 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2405 if (mi != mapBlockIndex.end())
2408 block.ReadFromDisk((*mi).second);
2409 pfrom->PushMessage("block", block);
2411 // Trigger them to send a getblocks request for the next batch of inventory
2412 if (inv.hash == pfrom->hashContinue)
2414 // Bypass PushInventory, this must send even if redundant,
2415 // and we want it right after the last block so they don't
2416 // wait for other stuff first.
2418 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2419 pfrom->PushMessage("inv", vInv);
2420 pfrom->hashContinue = 0;
2424 else if (inv.IsKnownType())
2426 // Send stream from relay memory
2429 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2430 if (mi != mapRelay.end())
2431 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2435 // Track requests for our stuff
2436 Inventory(inv.hash);
2441 else if (strCommand == "getblocks")
2443 CBlockLocator locator;
2445 vRecv >> locator >> hashStop;
2447 // Find the last block the caller has in the main chain
2448 CBlockIndex* pindex = locator.GetBlockIndex();
2450 // Send the rest of the chain
2452 pindex = pindex->pnext;
2453 int nLimit = 500 + locator.GetDistanceBack();
2454 unsigned int nBytes = 0;
2455 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2456 for (; pindex; pindex = pindex->pnext)
2458 if (pindex->GetBlockHash() == hashStop)
2460 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2463 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2465 block.ReadFromDisk(pindex, true);
2466 nBytes += block.GetSerializeSize(SER_NETWORK);
2467 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2469 // When this block is requested, we'll send an inv that'll make them
2470 // getblocks the next batch of inventory.
2471 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2472 pfrom->hashContinue = pindex->GetBlockHash();
2479 else if (strCommand == "getheaders")
2481 CBlockLocator locator;
2483 vRecv >> locator >> hashStop;
2485 CBlockIndex* pindex = NULL;
2486 if (locator.IsNull())
2488 // If locator is null, return the hashStop block
2489 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2490 if (mi == mapBlockIndex.end())
2492 pindex = (*mi).second;
2496 // Find the last block the caller has in the main chain
2497 pindex = locator.GetBlockIndex();
2499 pindex = pindex->pnext;
2502 vector<CBlock> vHeaders;
2504 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2505 for (; pindex; pindex = pindex->pnext)
2507 vHeaders.push_back(pindex->GetBlockHeader());
2508 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2511 pfrom->PushMessage("headers", vHeaders);
2515 else if (strCommand == "tx")
2517 vector<uint256> vWorkQueue;
2518 CDataStream vMsg(vRecv);
2523 CInv inv(MSG_TX, tx.GetHash());
2524 pfrom->AddInventoryKnown(inv);
2526 bool fMissingInputs = false;
2527 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2529 SyncWithWallets(tx, NULL, true);
2530 RelayMessage(inv, vMsg);
2531 mapAlreadyAskedFor.erase(inv);
2532 vWorkQueue.push_back(inv.hash);
2534 // Recursively process any orphan transactions that depended on this one
2535 for (int i = 0; i < vWorkQueue.size(); i++)
2537 uint256 hashPrev = vWorkQueue[i];
2538 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2539 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2542 const CDataStream& vMsg = *((*mi).second);
2544 CDataStream(vMsg) >> tx;
2545 CInv inv(MSG_TX, tx.GetHash());
2547 if (tx.AcceptToMemoryPool(txdb, true))
2549 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2550 SyncWithWallets(tx, NULL, true);
2551 RelayMessage(inv, vMsg);
2552 mapAlreadyAskedFor.erase(inv);
2553 vWorkQueue.push_back(inv.hash);
2558 BOOST_FOREACH(uint256 hash, vWorkQueue)
2559 EraseOrphanTx(hash);
2561 else if (fMissingInputs)
2563 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2566 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2567 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2569 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2571 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2575 else if (strCommand == "block")
2580 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2583 CInv inv(MSG_BLOCK, block.GetHash());
2584 pfrom->AddInventoryKnown(inv);
2586 if (ProcessBlock(pfrom, &block))
2587 mapAlreadyAskedFor.erase(inv);
2588 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2592 else if (strCommand == "getaddr")
2594 pfrom->vAddrToSend.clear();
2595 vector<CAddress> vAddr = addrman.GetAddr();
2596 BOOST_FOREACH(const CAddress &addr, vAddr)
2597 pfrom->PushAddress(addr);
2601 else if (strCommand == "checkorder")
2606 if (!GetBoolArg("-allowreceivebyip"))
2608 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2615 /// we have a chance to check the order here
2617 // Keep giving the same key to the same ip until they use it
2618 if (!mapReuseKey.count(pfrom->addr))
2619 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2621 // Send back approval of order and pubkey to use
2622 CScript scriptPubKey;
2623 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2624 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2628 else if (strCommand == "reply")
2633 CRequestTracker tracker;
2635 LOCK(pfrom->cs_mapRequests);
2636 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2637 if (mi != pfrom->mapRequests.end())
2639 tracker = (*mi).second;
2640 pfrom->mapRequests.erase(mi);
2643 if (!tracker.IsNull())
2644 tracker.fn(tracker.param1, vRecv);
2648 else if (strCommand == "ping")
2653 else if (strCommand == "alert")
2658 if (alert.ProcessAlert())
2661 pfrom->setKnown.insert(alert.GetHash());
2664 BOOST_FOREACH(CNode* pnode, vNodes)
2665 alert.RelayTo(pnode);
2673 // Ignore unknown commands for extensibility
2677 // Update the last seen time for this node's address
2678 if (pfrom->fNetworkNode)
2679 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2680 AddressCurrentlyConnected(pfrom->addr);
2686 bool ProcessMessages(CNode* pfrom)
2688 CDataStream& vRecv = pfrom->vRecv;
2692 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2696 // (4) message start
2705 // Scan for message start
2706 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2707 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2708 if (vRecv.end() - pstart < nHeaderSize)
2710 if (vRecv.size() > nHeaderSize)
2712 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2713 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2717 if (pstart - vRecv.begin() > 0)
2718 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2719 vRecv.erase(vRecv.begin(), pstart);
2722 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2727 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2730 string strCommand = hdr.GetCommand();
2733 unsigned int nMessageSize = hdr.nMessageSize;
2734 if (nMessageSize > MAX_SIZE)
2736 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2739 if (nMessageSize > vRecv.size())
2741 // Rewind and wait for rest of message
2742 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2747 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2748 unsigned int nChecksum = 0;
2749 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2750 if (nChecksum != hdr.nChecksum)
2752 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2753 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2757 // Copy message to its own buffer
2758 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2759 vRecv.ignore(nMessageSize);
2767 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2772 catch (std::ios_base::failure& e)
2774 if (strstr(e.what(), "end of data"))
2776 // Allow exceptions from underlength message on vRecv
2777 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());
2779 else if (strstr(e.what(), "size too large"))
2781 // Allow exceptions from overlong size
2782 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2786 PrintExceptionContinue(&e, "ProcessMessage()");
2789 catch (std::exception& e) {
2790 PrintExceptionContinue(&e, "ProcessMessage()");
2792 PrintExceptionContinue(NULL, "ProcessMessage()");
2796 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2804 bool SendMessages(CNode* pto, bool fSendTrickle)
2808 // Don't send anything until we get their version message
2809 if (pto->nVersion == 0)
2813 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2814 pto->PushMessage("ping");
2816 // Resend wallet transactions that haven't gotten in a block yet
2817 ResendWalletTransactions();
2819 // Address refresh broadcast
2820 static int64 nLastRebroadcast;
2821 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2825 BOOST_FOREACH(CNode* pnode, vNodes)
2827 // Periodically clear setAddrKnown to allow refresh broadcasts
2828 if (nLastRebroadcast)
2829 pnode->setAddrKnown.clear();
2831 // Rebroadcast our address
2832 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2834 CAddress addr(addrLocalHost);
2835 addr.nTime = GetAdjustedTime();
2836 pnode->PushAddress(addr);
2840 nLastRebroadcast = GetTime();
2848 vector<CAddress> vAddr;
2849 vAddr.reserve(pto->vAddrToSend.size());
2850 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2852 // returns true if wasn't already contained in the set
2853 if (pto->setAddrKnown.insert(addr).second)
2855 vAddr.push_back(addr);
2856 // receiver rejects addr messages larger than 1000
2857 if (vAddr.size() >= 1000)
2859 pto->PushMessage("addr", vAddr);
2864 pto->vAddrToSend.clear();
2866 pto->PushMessage("addr", vAddr);
2871 // Message: inventory
2874 vector<CInv> vInvWait;
2876 LOCK(pto->cs_inventory);
2877 vInv.reserve(pto->vInventoryToSend.size());
2878 vInvWait.reserve(pto->vInventoryToSend.size());
2879 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2881 if (pto->setInventoryKnown.count(inv))
2884 // trickle out tx inv to protect privacy
2885 if (inv.type == MSG_TX && !fSendTrickle)
2887 // 1/4 of tx invs blast to all immediately
2888 static uint256 hashSalt;
2890 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2891 uint256 hashRand = inv.hash ^ hashSalt;
2892 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2893 bool fTrickleWait = ((hashRand & 3) != 0);
2895 // always trickle our own transactions
2899 if (GetTransaction(inv.hash, wtx))
2901 fTrickleWait = true;
2906 vInvWait.push_back(inv);
2911 // returns true if wasn't already contained in the set
2912 if (pto->setInventoryKnown.insert(inv).second)
2914 vInv.push_back(inv);
2915 if (vInv.size() >= 1000)
2917 pto->PushMessage("inv", vInv);
2922 pto->vInventoryToSend = vInvWait;
2925 pto->PushMessage("inv", vInv);
2931 vector<CInv> vGetData;
2932 int64 nNow = GetTime() * 1000000;
2934 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2936 const CInv& inv = (*pto->mapAskFor.begin()).second;
2937 if (!AlreadyHave(txdb, inv))
2939 printf("sending getdata: %s\n", inv.ToString().c_str());
2940 vGetData.push_back(inv);
2941 if (vGetData.size() >= 1000)
2943 pto->PushMessage("getdata", vGetData);
2947 mapAlreadyAskedFor[inv] = nNow;
2948 pto->mapAskFor.erase(pto->mapAskFor.begin());
2950 if (!vGetData.empty())
2951 pto->PushMessage("getdata", vGetData);
2970 //////////////////////////////////////////////////////////////////////////////
2975 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2977 unsigned char* pdata = (unsigned char*)pbuffer;
2978 unsigned int blocks = 1 + ((len + 8) / 64);
2979 unsigned char* pend = pdata + 64 * blocks;
2980 memset(pdata + len, 0, 64 * blocks - len);
2982 unsigned int bits = len * 8;
2983 pend[-1] = (bits >> 0) & 0xff;
2984 pend[-2] = (bits >> 8) & 0xff;
2985 pend[-3] = (bits >> 16) & 0xff;
2986 pend[-4] = (bits >> 24) & 0xff;
2990 static const unsigned int pSHA256InitState[8] =
2991 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2993 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2996 unsigned char data[64];
3000 for (int i = 0; i < 16; i++)
3001 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3003 for (int i = 0; i < 8; i++)
3004 ctx.h[i] = ((uint32_t*)pinit)[i];
3006 SHA256_Update(&ctx, data, sizeof(data));
3007 for (int i = 0; i < 8; i++)
3008 ((uint32_t*)pstate)[i] = ctx.h[i];
3012 // ScanHash scans nonces looking for a hash with at least some zero bits.
3013 // It operates on big endian data. Caller does the byte reversing.
3014 // All input buffers are 16-byte aligned. nNonce is usually preserved
3015 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3016 // the block is rebuilt and nNonce starts over at zero.
3018 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3020 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3024 // Hash pdata using pmidstate as the starting state into
3025 // preformatted buffer phash1, then hash phash1 into phash
3027 SHA256Transform(phash1, pdata, pmidstate);
3028 SHA256Transform(phash, phash1, pSHA256InitState);
3030 // Return the nonce if the hash has at least some zero bits,
3031 // caller will check if it has enough to reach the target
3032 if (((unsigned short*)phash)[14] == 0)
3035 // If nothing found after trying for a while, return -1
3036 if ((nNonce & 0xffff) == 0)
3038 nHashesDone = 0xffff+1;
3044 // Some explaining would be appreciated
3049 set<uint256> setDependsOn;
3052 COrphan(CTransaction* ptxIn)
3060 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3061 BOOST_FOREACH(uint256 hash, setDependsOn)
3062 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3067 uint64 nLastBlockTx = 0;
3068 uint64 nLastBlockSize = 0;
3070 CBlock* CreateNewBlock(CReserveKey& reservekey)
3072 CBlockIndex* pindexPrev = pindexBest;
3075 auto_ptr<CBlock> pblock(new CBlock());
3079 // Create coinbase tx
3081 txNew.vin.resize(1);
3082 txNew.vin[0].prevout.SetNull();
3083 txNew.vout.resize(1);
3084 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3086 // Add our coinbase tx as first transaction
3087 pblock->vtx.push_back(txNew);
3089 // Collect memory pool transactions into the block
3092 LOCK2(cs_main, cs_mapTransactions);
3095 // Priority order to process transactions
3096 list<COrphan> vOrphan; // list memory doesn't move
3097 map<uint256, vector<COrphan*> > mapDependers;
3098 multimap<double, CTransaction*> mapPriority;
3099 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3101 CTransaction& tx = (*mi).second;
3102 if (tx.IsCoinBase() || !tx.IsFinal())
3105 COrphan* porphan = NULL;
3106 double dPriority = 0;
3107 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3109 // Read prev transaction
3110 CTransaction txPrev;
3112 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3114 // Has to wait for dependencies
3117 // Use list for automatic deletion
3118 vOrphan.push_back(COrphan(&tx));
3119 porphan = &vOrphan.back();
3121 mapDependers[txin.prevout.hash].push_back(porphan);
3122 porphan->setDependsOn.insert(txin.prevout.hash);
3125 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3127 // Read block header
3128 int nConf = txindex.GetDepthInMainChain();
3130 dPriority += (double)nValueIn * nConf;
3132 if (fDebug && GetBoolArg("-printpriority"))
3133 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3136 // Priority is sum(valuein * age) / txsize
3137 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3140 porphan->dPriority = dPriority;
3142 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3144 if (fDebug && GetBoolArg("-printpriority"))
3146 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3153 // Collect transactions into block
3154 map<uint256, CTxIndex> mapTestPool;
3155 uint64 nBlockSize = 1000;
3156 uint64 nBlockTx = 0;
3157 int nBlockSigOps = 100;
3158 while (!mapPriority.empty())
3160 // Take highest priority transaction off priority queue
3161 double dPriority = -(*mapPriority.begin()).first;
3162 CTransaction& tx = *(*mapPriority.begin()).second;
3163 mapPriority.erase(mapPriority.begin());
3166 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3167 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3170 // Legacy limits on sigOps:
3171 int nTxSigOps = tx.GetLegacySigOpCount();
3172 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3175 // Transaction fee required depends on block size
3176 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3177 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3179 // Connecting shouldn't fail due to dependency on other memory pool transactions
3180 // because we're already processing them in order of dependency
3181 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3182 MapPrevTx mapInputs;
3184 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3187 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3188 if (nTxFees < nMinFee)
3191 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3192 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3195 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3197 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3198 swap(mapTestPool, mapTestPoolTmp);
3201 pblock->vtx.push_back(tx);
3202 nBlockSize += nTxSize;
3204 nBlockSigOps += nTxSigOps;
3207 // Add transactions that depend on this one to the priority queue
3208 uint256 hash = tx.GetHash();
3209 if (mapDependers.count(hash))
3211 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3213 if (!porphan->setDependsOn.empty())
3215 porphan->setDependsOn.erase(hash);
3216 if (porphan->setDependsOn.empty())
3217 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3223 nLastBlockTx = nBlockTx;
3224 nLastBlockSize = nBlockSize;
3225 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3228 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3231 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3232 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3233 pblock->UpdateTime(pindexPrev);
3234 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3237 return pblock.release();
3241 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3243 // Update nExtraNonce
3244 static uint256 hashPrevBlock;
3245 if (hashPrevBlock != pblock->hashPrevBlock)
3248 hashPrevBlock = pblock->hashPrevBlock;
3251 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3252 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3254 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3258 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3261 // Prebuild hash buffers
3268 uint256 hashPrevBlock;
3269 uint256 hashMerkleRoot;
3272 unsigned int nNonce;
3275 unsigned char pchPadding0[64];
3277 unsigned char pchPadding1[64];
3280 memset(&tmp, 0, sizeof(tmp));
3282 tmp.block.nVersion = pblock->nVersion;
3283 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3284 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3285 tmp.block.nTime = pblock->nTime;
3286 tmp.block.nBits = pblock->nBits;
3287 tmp.block.nNonce = pblock->nNonce;
3289 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3290 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3292 // Byte swap all the input buffer
3293 for (int i = 0; i < sizeof(tmp)/4; i++)
3294 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3296 // Precalc the first half of the first hash, which stays constant
3297 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3299 memcpy(pdata, &tmp.block, 128);
3300 memcpy(phash1, &tmp.hash1, 64);
3304 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3306 uint256 hash = pblock->GetHash();
3307 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3309 if (hash > hashTarget)
3313 printf("BitcoinMiner:\n");
3314 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3316 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3317 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3322 if (pblock->hashPrevBlock != hashBestChain)
3323 return error("BitcoinMiner : generated block is stale");
3325 // Remove key from key pool
3326 reservekey.KeepKey();
3328 // Track how many getdata requests this block gets
3330 LOCK(wallet.cs_wallet);
3331 wallet.mapRequestCount[pblock->GetHash()] = 0;
3334 // Process this block the same as if we had received it from another node
3335 if (!ProcessBlock(NULL, pblock))
3336 return error("BitcoinMiner : ProcessBlock, block not accepted");
3342 void static ThreadBitcoinMiner(void* parg);
3344 static bool fGenerateBitcoins = false;
3345 static bool fLimitProcessors = false;
3346 static int nLimitProcessors = -1;
3348 void static BitcoinMiner(CWallet *pwallet)
3350 printf("BitcoinMiner started\n");
3351 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3353 // Each thread has its own key and counter
3354 CReserveKey reservekey(pwallet);
3355 unsigned int nExtraNonce = 0;
3357 while (fGenerateBitcoins)
3361 while (vNodes.empty() || IsInitialBlockDownload())
3366 if (!fGenerateBitcoins)
3374 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3375 CBlockIndex* pindexPrev = pindexBest;
3377 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3380 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3382 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3386 // Prebuild hash buffers
3388 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3389 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3390 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3392 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3394 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3395 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3396 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3402 int64 nStart = GetTime();
3403 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3405 uint256& hash = *alignup<16>(hashbuf);
3408 unsigned int nHashesDone = 0;
3409 unsigned int nNonceFound;
3412 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3413 (char*)&hash, nHashesDone);
3415 // Check if something found
3416 if (nNonceFound != -1)
3418 for (int i = 0; i < sizeof(hash)/4; i++)
3419 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3421 if (hash <= hashTarget)
3424 pblock->nNonce = ByteReverse(nNonceFound);
3425 assert(hash == pblock->GetHash());
3427 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3428 CheckWork(pblock.get(), *pwalletMain, reservekey);
3429 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3435 static int64 nHashCounter;
3436 if (nHPSTimerStart == 0)
3438 nHPSTimerStart = GetTimeMillis();
3442 nHashCounter += nHashesDone;
3443 if (GetTimeMillis() - nHPSTimerStart > 4000)
3445 static CCriticalSection cs;
3448 if (GetTimeMillis() - nHPSTimerStart > 4000)
3450 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3451 nHPSTimerStart = GetTimeMillis();
3453 static int64 nLogTime;
3454 if (GetTime() - nLogTime > 30 * 60)
3456 nLogTime = GetTime();
3457 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3458 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3464 // Check for stop or if block needs to be rebuilt
3467 if (!fGenerateBitcoins)
3469 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3473 if (nBlockNonce >= 0xffff0000)
3475 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3477 if (pindexPrev != pindexBest)
3480 // Update nTime every few seconds
3481 pblock->UpdateTime(pindexPrev);
3482 nBlockTime = ByteReverse(pblock->nTime);
3485 // Changing pblock->nTime can change work required on testnet:
3486 nBlockBits = ByteReverse(pblock->nBits);
3487 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3493 void static ThreadBitcoinMiner(void* parg)
3495 CWallet* pwallet = (CWallet*)parg;
3498 vnThreadsRunning[THREAD_MINER]++;
3499 BitcoinMiner(pwallet);
3500 vnThreadsRunning[THREAD_MINER]--;
3502 catch (std::exception& e) {
3503 vnThreadsRunning[THREAD_MINER]--;
3504 PrintException(&e, "ThreadBitcoinMiner()");
3506 vnThreadsRunning[THREAD_MINER]--;
3507 PrintException(NULL, "ThreadBitcoinMiner()");
3510 if (vnThreadsRunning[THREAD_MINER] == 0)
3512 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3516 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3518 fGenerateBitcoins = fGenerate;
3519 nLimitProcessors = GetArg("-genproclimit", -1);
3520 if (nLimitProcessors == 0)
3521 fGenerateBitcoins = false;
3522 fLimitProcessors = (nLimitProcessors != -1);
3526 int nProcessors = boost::thread::hardware_concurrency();
3527 printf("%d processors\n", nProcessors);
3528 if (nProcessors < 1)
3530 if (fLimitProcessors && nProcessors > nLimitProcessors)
3531 nProcessors = nLimitProcessors;
3532 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3533 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3534 for (int i = 0; i < nAddThreads; i++)
3536 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3537 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");