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))
1265 BOOST_FOREACH(CTransaction& tx, vtx)
1267 CTxIndex txindexOld;
1268 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1270 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1277 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1278 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1279 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1281 //// issue here: it doesn't know the version
1282 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1284 map<uint256, CTxIndex> mapQueuedChanges;
1287 BOOST_FOREACH(CTransaction& tx, vtx)
1289 nSigOps += tx.GetLegacySigOpCount();
1290 if (nSigOps > MAX_BLOCK_SIGOPS)
1291 return DoS(100, error("ConnectBlock() : too many sigops"));
1293 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1294 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1296 MapPrevTx mapInputs;
1297 if (!tx.IsCoinBase())
1300 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1303 if (fStrictPayToScriptHash)
1305 // Add in sigops done by pay-to-script-hash inputs;
1306 // this is to prevent a "rogue miner" from creating
1307 // an incredibly-expensive-to-validate block.
1308 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1309 if (nSigOps > MAX_BLOCK_SIGOPS)
1310 return DoS(100, error("ConnectBlock() : too many sigops"));
1313 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1315 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1319 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1322 // Write queued txindex changes
1323 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1325 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1326 return error("ConnectBlock() : UpdateTxIndex failed");
1329 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1332 // Update block index on disk without changing it in memory.
1333 // The memory index structure will be changed after the db commits.
1336 CDiskBlockIndex blockindexPrev(pindex->pprev);
1337 blockindexPrev.hashNext = pindex->GetBlockHash();
1338 if (!txdb.WriteBlockIndex(blockindexPrev))
1339 return error("ConnectBlock() : WriteBlockIndex failed");
1342 // Watch for transactions paying to me
1343 BOOST_FOREACH(CTransaction& tx, vtx)
1344 SyncWithWallets(tx, this, true);
1349 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1351 printf("REORGANIZE\n");
1354 CBlockIndex* pfork = pindexBest;
1355 CBlockIndex* plonger = pindexNew;
1356 while (pfork != plonger)
1358 while (plonger->nHeight > pfork->nHeight)
1359 if (!(plonger = plonger->pprev))
1360 return error("Reorganize() : plonger->pprev is null");
1361 if (pfork == plonger)
1363 if (!(pfork = pfork->pprev))
1364 return error("Reorganize() : pfork->pprev is null");
1367 // List of what to disconnect
1368 vector<CBlockIndex*> vDisconnect;
1369 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1370 vDisconnect.push_back(pindex);
1372 // List of what to connect
1373 vector<CBlockIndex*> vConnect;
1374 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1375 vConnect.push_back(pindex);
1376 reverse(vConnect.begin(), vConnect.end());
1378 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());
1379 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());
1381 // Disconnect shorter branch
1382 vector<CTransaction> vResurrect;
1383 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1386 if (!block.ReadFromDisk(pindex))
1387 return error("Reorganize() : ReadFromDisk for disconnect failed");
1388 if (!block.DisconnectBlock(txdb, pindex))
1389 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1391 // Queue memory transactions to resurrect
1392 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1393 if (!tx.IsCoinBase())
1394 vResurrect.push_back(tx);
1397 // Connect longer branch
1398 vector<CTransaction> vDelete;
1399 for (int i = 0; i < vConnect.size(); i++)
1401 CBlockIndex* pindex = vConnect[i];
1403 if (!block.ReadFromDisk(pindex))
1404 return error("Reorganize() : ReadFromDisk for connect failed");
1405 if (!block.ConnectBlock(txdb, pindex))
1409 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1412 // Queue memory transactions to delete
1413 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1414 vDelete.push_back(tx);
1416 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1417 return error("Reorganize() : WriteHashBestChain failed");
1419 // Make sure it's successfully written to disk before changing memory structure
1420 if (!txdb.TxnCommit())
1421 return error("Reorganize() : TxnCommit failed");
1423 // Disconnect shorter branch
1424 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1426 pindex->pprev->pnext = NULL;
1428 // Connect longer branch
1429 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1431 pindex->pprev->pnext = pindex;
1433 // Resurrect memory transactions that were in the disconnected branch
1434 BOOST_FOREACH(CTransaction& tx, vResurrect)
1435 tx.AcceptToMemoryPool(txdb, false);
1437 // Delete redundant memory transactions that are in the connected branch
1438 BOOST_FOREACH(CTransaction& tx, vDelete)
1439 tx.RemoveFromMemoryPool();
1441 printf("REORGANIZE: done\n");
1448 runCommand(std::string strCommand)
1450 int nErr = ::system(strCommand.c_str());
1452 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1455 // Called from inside SetBestChain: attaches a block to the new best chain being built
1456 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1458 uint256 hash = GetHash();
1460 // Adding to current best branch
1461 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1464 InvalidChainFound(pindexNew);
1467 if (!txdb.TxnCommit())
1468 return error("SetBestChain() : TxnCommit failed");
1470 // Add to current best branch
1471 pindexNew->pprev->pnext = pindexNew;
1473 // Delete redundant memory transactions
1474 BOOST_FOREACH(CTransaction& tx, vtx)
1475 tx.RemoveFromMemoryPool();
1480 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1482 uint256 hash = GetHash();
1485 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1487 txdb.WriteHashBestChain(hash);
1488 if (!txdb.TxnCommit())
1489 return error("SetBestChain() : TxnCommit failed");
1490 pindexGenesisBlock = pindexNew;
1492 else if (hashPrevBlock == hashBestChain)
1494 if (!SetBestChainInner(txdb, pindexNew))
1495 return error("SetBestChain() : SetBestChainInner failed");
1499 // the first block in the new chain that will cause it to become the new best chain
1500 CBlockIndex *pindexIntermediate = pindexNew;
1502 // list of blocks that need to be connected afterwards
1503 std::vector<CBlockIndex*> vpindexSecondary;
1505 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1506 // Try to limit how much needs to be done inside
1507 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1509 vpindexSecondary.push_back(pindexIntermediate);
1510 pindexIntermediate = pindexIntermediate->pprev;
1513 if (!vpindexSecondary.empty())
1514 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1516 // Switch to new best branch
1517 if (!Reorganize(txdb, pindexIntermediate))
1520 InvalidChainFound(pindexNew);
1521 return error("SetBestChain() : Reorganize failed");
1524 // Connect futher blocks
1525 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1528 if (!block.ReadFromDisk(pindex))
1530 printf("SetBestChain() : ReadFromDisk failed\n");
1534 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1535 if (!block.SetBestChainInner(txdb, pindex))
1540 // Update best block in wallet (so we can detect restored wallets)
1541 bool fIsInitialDownload = IsInitialBlockDownload();
1542 if (!fIsInitialDownload)
1544 const CBlockLocator locator(pindexNew);
1545 ::SetBestChain(locator);
1549 hashBestChain = hash;
1550 pindexBest = pindexNew;
1551 nBestHeight = pindexBest->nHeight;
1552 bnBestChainWork = pindexNew->bnChainWork;
1553 nTimeBestReceived = GetTime();
1554 nTransactionsUpdated++;
1555 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1557 std::string strCmd = GetArg("-blocknotify", "");
1559 if (!fIsInitialDownload && !strCmd.empty())
1561 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1562 boost::thread t(runCommand, strCmd); // thread runs free
1569 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1571 // Check for duplicate
1572 uint256 hash = GetHash();
1573 if (mapBlockIndex.count(hash))
1574 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1576 // Construct new block index object
1577 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1579 return error("AddToBlockIndex() : new CBlockIndex failed");
1580 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1581 pindexNew->phashBlock = &((*mi).first);
1582 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1583 if (miPrev != mapBlockIndex.end())
1585 pindexNew->pprev = (*miPrev).second;
1586 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1588 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1592 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1593 if (!txdb.TxnCommit())
1597 if (pindexNew->bnChainWork > bnBestChainWork)
1598 if (!SetBestChain(txdb, pindexNew))
1603 if (pindexNew == pindexBest)
1605 // Notify UI to display prev block's coinbase if it was ours
1606 static uint256 hashPrevBestCoinBase;
1607 UpdatedTransaction(hashPrevBestCoinBase);
1608 hashPrevBestCoinBase = vtx[0].GetHash();
1618 bool CBlock::CheckBlock() const
1620 // These are checks that are independent of context
1621 // that can be verified before saving an orphan block.
1624 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1625 return DoS(100, error("CheckBlock() : size limits failed"));
1627 // Check proof of work matches claimed amount
1628 if (!CheckProofOfWork(GetHash(), nBits))
1629 return DoS(50, error("CheckBlock() : proof of work failed"));
1632 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1633 return error("CheckBlock() : block timestamp too far in the future");
1635 // First transaction must be coinbase, the rest must not be
1636 if (vtx.empty() || !vtx[0].IsCoinBase())
1637 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1638 for (int i = 1; i < vtx.size(); i++)
1639 if (vtx[i].IsCoinBase())
1640 return DoS(100, error("CheckBlock() : more than one coinbase"));
1642 // Check transactions
1643 BOOST_FOREACH(const CTransaction& tx, vtx)
1644 if (!tx.CheckTransaction())
1645 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1648 BOOST_FOREACH(const CTransaction& tx, vtx)
1650 nSigOps += tx.GetLegacySigOpCount();
1652 if (nSigOps > MAX_BLOCK_SIGOPS)
1653 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1656 if (hashMerkleRoot != BuildMerkleTree())
1657 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1662 bool CBlock::AcceptBlock()
1664 // Check for duplicate
1665 uint256 hash = GetHash();
1666 if (mapBlockIndex.count(hash))
1667 return error("AcceptBlock() : block already in mapBlockIndex");
1669 // Get prev block index
1670 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1671 if (mi == mapBlockIndex.end())
1672 return DoS(10, error("AcceptBlock() : prev block not found"));
1673 CBlockIndex* pindexPrev = (*mi).second;
1674 int nHeight = pindexPrev->nHeight+1;
1676 // Check proof of work
1677 if (nBits != GetNextWorkRequired(pindexPrev, this))
1678 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1680 // Check timestamp against prev
1681 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1682 return error("AcceptBlock() : block's timestamp is too early");
1684 // Check that all transactions are finalized
1685 BOOST_FOREACH(const CTransaction& tx, vtx)
1686 if (!tx.IsFinal(nHeight, GetBlockTime()))
1687 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1689 // Check that the block chain matches the known block chain up to a checkpoint
1690 if (!Checkpoints::CheckBlock(nHeight, hash))
1691 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1693 // Write block to history file
1694 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1695 return error("AcceptBlock() : out of disk space");
1696 unsigned int nFile = -1;
1697 unsigned int nBlockPos = 0;
1698 if (!WriteToDisk(nFile, nBlockPos))
1699 return error("AcceptBlock() : WriteToDisk failed");
1700 if (!AddToBlockIndex(nFile, nBlockPos))
1701 return error("AcceptBlock() : AddToBlockIndex failed");
1703 // Relay inventory, but don't relay old inventory during initial block download
1704 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1705 if (hashBestChain == hash)
1708 BOOST_FOREACH(CNode* pnode, vNodes)
1709 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1710 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1716 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1718 // Check for duplicate
1719 uint256 hash = pblock->GetHash();
1720 if (mapBlockIndex.count(hash))
1721 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1722 if (mapOrphanBlocks.count(hash))
1723 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1725 // Preliminary checks
1726 if (!pblock->CheckBlock())
1727 return error("ProcessBlock() : CheckBlock FAILED");
1729 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1730 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1732 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1733 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1737 pfrom->Misbehaving(100);
1738 return error("ProcessBlock() : block with timestamp before last checkpoint");
1741 bnNewBlock.SetCompact(pblock->nBits);
1743 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1744 if (bnNewBlock > bnRequired)
1747 pfrom->Misbehaving(100);
1748 return error("ProcessBlock() : block with too little proof-of-work");
1753 // If don't already have its previous block, shunt it off to holding area until we get it
1754 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1756 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1757 CBlock* pblock2 = new CBlock(*pblock);
1758 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1759 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1761 // Ask this guy to fill in what we're missing
1763 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1768 if (!pblock->AcceptBlock())
1769 return error("ProcessBlock() : AcceptBlock FAILED");
1771 // Recursively process any orphan blocks that depended on this one
1772 vector<uint256> vWorkQueue;
1773 vWorkQueue.push_back(hash);
1774 for (int i = 0; i < vWorkQueue.size(); i++)
1776 uint256 hashPrev = vWorkQueue[i];
1777 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1778 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1781 CBlock* pblockOrphan = (*mi).second;
1782 if (pblockOrphan->AcceptBlock())
1783 vWorkQueue.push_back(pblockOrphan->GetHash());
1784 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1785 delete pblockOrphan;
1787 mapOrphanBlocksByPrev.erase(hashPrev);
1790 printf("ProcessBlock: ACCEPTED\n");
1801 bool CheckDiskSpace(uint64 nAdditionalBytes)
1803 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1805 // Check for 15MB because database could create another 10MB log file at any time
1806 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1809 string strMessage = _("Warning: Disk space is low ");
1810 strMiscWarning = strMessage;
1811 printf("*** %s\n", strMessage.c_str());
1812 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1819 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1823 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1826 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1828 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1837 static unsigned int nCurrentBlockFile = 1;
1839 FILE* AppendBlockFile(unsigned int& nFileRet)
1844 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1847 if (fseek(file, 0, SEEK_END) != 0)
1849 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1850 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1852 nFileRet = nCurrentBlockFile;
1856 nCurrentBlockFile++;
1860 bool LoadBlockIndex(bool fAllowNew)
1864 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1865 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1866 pchMessageStart[0] = 0xfa;
1867 pchMessageStart[1] = 0xbf;
1868 pchMessageStart[2] = 0xb5;
1869 pchMessageStart[3] = 0xda;
1876 if (!txdb.LoadBlockIndex())
1881 // Init with genesis block
1883 if (mapBlockIndex.empty())
1889 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1890 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1891 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1892 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1893 // vMerkleTree: 4a5e1e
1896 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1898 txNew.vin.resize(1);
1899 txNew.vout.resize(1);
1900 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1901 txNew.vout[0].nValue = 50 * COIN;
1902 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1904 block.vtx.push_back(txNew);
1905 block.hashPrevBlock = 0;
1906 block.hashMerkleRoot = block.BuildMerkleTree();
1908 block.nTime = 1231006505;
1909 block.nBits = 0x1d00ffff;
1910 block.nNonce = 2083236893;
1914 block.nTime = 1296688602;
1915 block.nBits = 0x1d07fff8;
1916 block.nNonce = 384568319;
1920 printf("%s\n", block.GetHash().ToString().c_str());
1921 printf("%s\n", hashGenesisBlock.ToString().c_str());
1922 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1923 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1925 assert(block.GetHash() == hashGenesisBlock);
1927 // Start new block file
1929 unsigned int nBlockPos;
1930 if (!block.WriteToDisk(nFile, nBlockPos))
1931 return error("LoadBlockIndex() : writing genesis block to disk failed");
1932 if (!block.AddToBlockIndex(nFile, nBlockPos))
1933 return error("LoadBlockIndex() : genesis block not accepted");
1941 void PrintBlockTree()
1943 // precompute tree structure
1944 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1945 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1947 CBlockIndex* pindex = (*mi).second;
1948 mapNext[pindex->pprev].push_back(pindex);
1950 //while (rand() % 3 == 0)
1951 // mapNext[pindex->pprev].push_back(pindex);
1954 vector<pair<int, CBlockIndex*> > vStack;
1955 vStack.push_back(make_pair(0, pindexGenesisBlock));
1958 while (!vStack.empty())
1960 int nCol = vStack.back().first;
1961 CBlockIndex* pindex = vStack.back().second;
1964 // print split or gap
1965 if (nCol > nPrevCol)
1967 for (int i = 0; i < nCol-1; i++)
1971 else if (nCol < nPrevCol)
1973 for (int i = 0; i < nCol; i++)
1980 for (int i = 0; i < nCol; i++)
1985 block.ReadFromDisk(pindex);
1986 printf("%d (%u,%u) %s %s tx %d",
1990 block.GetHash().ToString().substr(0,20).c_str(),
1991 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1994 PrintWallets(block);
1996 // put the main timechain first
1997 vector<CBlockIndex*>& vNext = mapNext[pindex];
1998 for (int i = 0; i < vNext.size(); i++)
2000 if (vNext[i]->pnext)
2002 swap(vNext[0], vNext[i]);
2008 for (int i = 0; i < vNext.size(); i++)
2009 vStack.push_back(make_pair(nCol+i, vNext[i]));
2022 //////////////////////////////////////////////////////////////////////////////
2027 map<uint256, CAlert> mapAlerts;
2028 CCriticalSection cs_mapAlerts;
2030 string GetWarnings(string strFor)
2033 string strStatusBar;
2035 if (GetBoolArg("-testsafemode"))
2038 // Misc warnings like out of disk space and clock is wrong
2039 if (strMiscWarning != "")
2042 strStatusBar = strMiscWarning;
2045 // Longer invalid proof-of-work chain
2046 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2049 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2055 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2057 const CAlert& alert = item.second;
2058 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2060 nPriority = alert.nPriority;
2061 strStatusBar = alert.strStatusBar;
2066 if (strFor == "statusbar")
2067 return strStatusBar;
2068 else if (strFor == "rpc")
2070 assert(!"GetWarnings() : invalid parameter");
2074 bool CAlert::ProcessAlert()
2076 if (!CheckSignature())
2083 // Cancel previous alerts
2084 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2086 const CAlert& alert = (*mi).second;
2089 printf("cancelling alert %d\n", alert.nID);
2090 mapAlerts.erase(mi++);
2092 else if (!alert.IsInEffect())
2094 printf("expiring alert %d\n", alert.nID);
2095 mapAlerts.erase(mi++);
2101 // Check if this alert has been cancelled
2102 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2104 const CAlert& alert = item.second;
2105 if (alert.Cancels(*this))
2107 printf("alert already cancelled by %d\n", alert.nID);
2113 mapAlerts.insert(make_pair(GetHash(), *this));
2116 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2128 //////////////////////////////////////////////////////////////////////////////
2134 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2138 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2139 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2141 // Don't know what it is, just say we already got one
2148 // The message start string is designed to be unlikely to occur in normal data.
2149 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2150 // a large 4-byte int at any alignment.
2151 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2154 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2156 static map<CService, vector<unsigned char> > mapReuseKey;
2157 RandAddSeedPerfmon();
2159 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2160 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2162 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2164 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2172 if (strCommand == "version")
2174 // Each connection can only send one version message
2175 if (pfrom->nVersion != 0)
2177 pfrom->Misbehaving(1);
2185 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2186 if (pfrom->nVersion < MIN_PROTO_VERSION)
2188 // Since February 20, 2012, the protocol is initiated at version 209,
2189 // and earlier versions are no longer supported
2190 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2191 pfrom->fDisconnect = true;
2195 if (pfrom->nVersion == 10300)
2196 pfrom->nVersion = 300;
2198 vRecv >> addrFrom >> nNonce;
2200 vRecv >> pfrom->strSubVer;
2202 vRecv >> pfrom->nStartingHeight;
2204 // Disconnect if we connected to ourself
2205 if (nNonce == nLocalHostNonce && nNonce > 1)
2207 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2208 pfrom->fDisconnect = true;
2212 // Be shy and don't send version until we hear
2213 if (pfrom->fInbound)
2214 pfrom->PushVersion();
2216 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2218 AddTimeData(pfrom->addr, nTime);
2221 pfrom->PushMessage("verack");
2222 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2224 if (!pfrom->fInbound)
2226 // Advertise our address
2227 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2228 !IsInitialBlockDownload())
2230 CAddress addr(addrLocalHost);
2231 addr.nTime = GetAdjustedTime();
2232 pfrom->PushAddress(addr);
2235 // Get recent addresses
2236 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2238 pfrom->PushMessage("getaddr");
2239 pfrom->fGetAddr = true;
2241 addrman.Good(pfrom->addr);
2243 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2245 addrman.Add(addrFrom, addrFrom);
2246 addrman.Good(addrFrom);
2250 // Ask the first connected node for block updates
2251 static int nAskedForBlocks = 0;
2252 if (!pfrom->fClient &&
2253 (pfrom->nVersion < NOBLKS_VERSION_START ||
2254 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2255 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2258 pfrom->PushGetBlocks(pindexBest, uint256(0));
2264 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2265 item.second.RelayTo(pfrom);
2268 pfrom->fSuccessfullyConnected = true;
2270 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2272 cPeerBlockCounts.input(pfrom->nStartingHeight);
2276 else if (pfrom->nVersion == 0)
2278 // Must have a version message before anything else
2279 pfrom->Misbehaving(1);
2284 else if (strCommand == "verack")
2286 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2290 else if (strCommand == "addr")
2292 vector<CAddress> vAddr;
2295 // Don't want addr from older versions unless seeding
2296 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2298 if (vAddr.size() > 1000)
2300 pfrom->Misbehaving(20);
2301 return error("message addr size() = %d", vAddr.size());
2304 // Store the new addresses
2305 int64 nNow = GetAdjustedTime();
2306 int64 nSince = nNow - 10 * 60;
2307 BOOST_FOREACH(CAddress& addr, vAddr)
2311 // ignore IPv6 for now, since it isn't implemented anyway
2314 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2315 addr.nTime = nNow - 5 * 24 * 60 * 60;
2316 pfrom->AddAddressKnown(addr);
2317 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2319 // Relay to a limited number of other nodes
2322 // Use deterministic randomness to send to the same nodes for 24 hours
2323 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2324 static uint256 hashSalt;
2326 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2327 int64 hashAddr = addr.GetHash();
2328 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2329 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2330 multimap<uint256, CNode*> mapMix;
2331 BOOST_FOREACH(CNode* pnode, vNodes)
2333 if (pnode->nVersion < CADDR_TIME_VERSION)
2335 unsigned int nPointer;
2336 memcpy(&nPointer, &pnode, sizeof(nPointer));
2337 uint256 hashKey = hashRand ^ nPointer;
2338 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2339 mapMix.insert(make_pair(hashKey, pnode));
2341 int nRelayNodes = 2;
2342 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2343 ((*mi).second)->PushAddress(addr);
2347 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2348 if (vAddr.size() < 1000)
2349 pfrom->fGetAddr = false;
2353 else if (strCommand == "inv")
2357 if (vInv.size() > 50000)
2359 pfrom->Misbehaving(20);
2360 return error("message inv size() = %d", vInv.size());
2364 for (int nInv = 0; nInv < vInv.size(); nInv++)
2366 const CInv &inv = vInv[nInv];
2370 pfrom->AddInventoryKnown(inv);
2372 bool fAlreadyHave = AlreadyHave(txdb, inv);
2374 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2376 // Always request the last block in an inv bundle (even if we already have it), as it is the
2377 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2378 // this is necessary to connect earlier received orphan blocks to the chain again.
2379 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2381 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2382 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2384 // Track requests for our stuff
2385 Inventory(inv.hash);
2390 else if (strCommand == "getdata")
2394 if (vInv.size() > 50000)
2396 pfrom->Misbehaving(20);
2397 return error("message getdata size() = %d", vInv.size());
2400 BOOST_FOREACH(const CInv& inv, vInv)
2404 printf("received getdata for: %s\n", inv.ToString().c_str());
2406 if (inv.type == MSG_BLOCK)
2408 // Send block from disk
2409 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2410 if (mi != mapBlockIndex.end())
2413 block.ReadFromDisk((*mi).second);
2414 pfrom->PushMessage("block", block);
2416 // Trigger them to send a getblocks request for the next batch of inventory
2417 if (inv.hash == pfrom->hashContinue)
2419 // Bypass PushInventory, this must send even if redundant,
2420 // and we want it right after the last block so they don't
2421 // wait for other stuff first.
2423 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2424 pfrom->PushMessage("inv", vInv);
2425 pfrom->hashContinue = 0;
2429 else if (inv.IsKnownType())
2431 // Send stream from relay memory
2434 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2435 if (mi != mapRelay.end())
2436 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2440 // Track requests for our stuff
2441 Inventory(inv.hash);
2446 else if (strCommand == "getblocks")
2448 CBlockLocator locator;
2450 vRecv >> locator >> hashStop;
2452 // Find the last block the caller has in the main chain
2453 CBlockIndex* pindex = locator.GetBlockIndex();
2455 // Send the rest of the chain
2457 pindex = pindex->pnext;
2458 int nLimit = 500 + locator.GetDistanceBack();
2459 unsigned int nBytes = 0;
2460 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2461 for (; pindex; pindex = pindex->pnext)
2463 if (pindex->GetBlockHash() == hashStop)
2465 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2468 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2470 block.ReadFromDisk(pindex, true);
2471 nBytes += block.GetSerializeSize(SER_NETWORK);
2472 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2474 // When this block is requested, we'll send an inv that'll make them
2475 // getblocks the next batch of inventory.
2476 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2477 pfrom->hashContinue = pindex->GetBlockHash();
2484 else if (strCommand == "getheaders")
2486 CBlockLocator locator;
2488 vRecv >> locator >> hashStop;
2490 CBlockIndex* pindex = NULL;
2491 if (locator.IsNull())
2493 // If locator is null, return the hashStop block
2494 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2495 if (mi == mapBlockIndex.end())
2497 pindex = (*mi).second;
2501 // Find the last block the caller has in the main chain
2502 pindex = locator.GetBlockIndex();
2504 pindex = pindex->pnext;
2507 vector<CBlock> vHeaders;
2509 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2510 for (; pindex; pindex = pindex->pnext)
2512 vHeaders.push_back(pindex->GetBlockHeader());
2513 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2516 pfrom->PushMessage("headers", vHeaders);
2520 else if (strCommand == "tx")
2522 vector<uint256> vWorkQueue;
2523 CDataStream vMsg(vRecv);
2528 CInv inv(MSG_TX, tx.GetHash());
2529 pfrom->AddInventoryKnown(inv);
2531 bool fMissingInputs = false;
2532 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2534 SyncWithWallets(tx, NULL, true);
2535 RelayMessage(inv, vMsg);
2536 mapAlreadyAskedFor.erase(inv);
2537 vWorkQueue.push_back(inv.hash);
2539 // Recursively process any orphan transactions that depended on this one
2540 for (int i = 0; i < vWorkQueue.size(); i++)
2542 uint256 hashPrev = vWorkQueue[i];
2543 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2544 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2547 const CDataStream& vMsg = *((*mi).second);
2549 CDataStream(vMsg) >> tx;
2550 CInv inv(MSG_TX, tx.GetHash());
2552 if (tx.AcceptToMemoryPool(txdb, true))
2554 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2555 SyncWithWallets(tx, NULL, true);
2556 RelayMessage(inv, vMsg);
2557 mapAlreadyAskedFor.erase(inv);
2558 vWorkQueue.push_back(inv.hash);
2563 BOOST_FOREACH(uint256 hash, vWorkQueue)
2564 EraseOrphanTx(hash);
2566 else if (fMissingInputs)
2568 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2571 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2572 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2574 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2576 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2580 else if (strCommand == "block")
2585 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2588 CInv inv(MSG_BLOCK, block.GetHash());
2589 pfrom->AddInventoryKnown(inv);
2591 if (ProcessBlock(pfrom, &block))
2592 mapAlreadyAskedFor.erase(inv);
2593 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2597 else if (strCommand == "getaddr")
2599 pfrom->vAddrToSend.clear();
2600 vector<CAddress> vAddr = addrman.GetAddr();
2601 BOOST_FOREACH(const CAddress &addr, vAddr)
2602 pfrom->PushAddress(addr);
2606 else if (strCommand == "checkorder")
2611 if (!GetBoolArg("-allowreceivebyip"))
2613 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2620 /// we have a chance to check the order here
2622 // Keep giving the same key to the same ip until they use it
2623 if (!mapReuseKey.count(pfrom->addr))
2624 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2626 // Send back approval of order and pubkey to use
2627 CScript scriptPubKey;
2628 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2629 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2633 else if (strCommand == "reply")
2638 CRequestTracker tracker;
2640 LOCK(pfrom->cs_mapRequests);
2641 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2642 if (mi != pfrom->mapRequests.end())
2644 tracker = (*mi).second;
2645 pfrom->mapRequests.erase(mi);
2648 if (!tracker.IsNull())
2649 tracker.fn(tracker.param1, vRecv);
2653 else if (strCommand == "ping")
2655 if (pfrom->nVersion > BIP0031_VERSION)
2659 // Echo the message back with the nonce. This allows for two useful features:
2661 // 1) A remote node can quickly check if the connection is operational
2662 // 2) Remote nodes can measure the latency of the network thread. If this node
2663 // is overloaded it won't respond to pings quickly and the remote node can
2664 // avoid sending us more work, like chain download requests.
2666 // The nonce stops the remote getting confused between different pings: without
2667 // it, if the remote node sends a ping once per second and this node takes 5
2668 // seconds to respond to each, the 5th ping the remote sends would appear to
2669 // return very quickly.
2670 pfrom->PushMessage("pong", nonce);
2675 else if (strCommand == "alert")
2680 if (alert.ProcessAlert())
2683 pfrom->setKnown.insert(alert.GetHash());
2686 BOOST_FOREACH(CNode* pnode, vNodes)
2687 alert.RelayTo(pnode);
2695 // Ignore unknown commands for extensibility
2699 // Update the last seen time for this node's address
2700 if (pfrom->fNetworkNode)
2701 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2702 AddressCurrentlyConnected(pfrom->addr);
2708 bool ProcessMessages(CNode* pfrom)
2710 CDataStream& vRecv = pfrom->vRecv;
2714 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2718 // (4) message start
2727 // Scan for message start
2728 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2729 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2730 if (vRecv.end() - pstart < nHeaderSize)
2732 if (vRecv.size() > nHeaderSize)
2734 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2735 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2739 if (pstart - vRecv.begin() > 0)
2740 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2741 vRecv.erase(vRecv.begin(), pstart);
2744 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2749 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2752 string strCommand = hdr.GetCommand();
2755 unsigned int nMessageSize = hdr.nMessageSize;
2756 if (nMessageSize > MAX_SIZE)
2758 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2761 if (nMessageSize > vRecv.size())
2763 // Rewind and wait for rest of message
2764 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2769 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2770 unsigned int nChecksum = 0;
2771 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2772 if (nChecksum != hdr.nChecksum)
2774 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2775 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2779 // Copy message to its own buffer
2780 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2781 vRecv.ignore(nMessageSize);
2789 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2794 catch (std::ios_base::failure& e)
2796 if (strstr(e.what(), "end of data"))
2798 // Allow exceptions from underlength message on vRecv
2799 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());
2801 else if (strstr(e.what(), "size too large"))
2803 // Allow exceptions from overlong size
2804 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2808 PrintExceptionContinue(&e, "ProcessMessage()");
2811 catch (std::exception& e) {
2812 PrintExceptionContinue(&e, "ProcessMessage()");
2814 PrintExceptionContinue(NULL, "ProcessMessage()");
2818 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2826 bool SendMessages(CNode* pto, bool fSendTrickle)
2830 // Don't send anything until we get their version message
2831 if (pto->nVersion == 0)
2834 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2836 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2837 if (pto->nVersion > BIP0031_VERSION)
2838 pto->PushMessage("ping", 0);
2840 pto->PushMessage("ping");
2843 // Resend wallet transactions that haven't gotten in a block yet
2844 ResendWalletTransactions();
2846 // Address refresh broadcast
2847 static int64 nLastRebroadcast;
2848 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2852 BOOST_FOREACH(CNode* pnode, vNodes)
2854 // Periodically clear setAddrKnown to allow refresh broadcasts
2855 if (nLastRebroadcast)
2856 pnode->setAddrKnown.clear();
2858 // Rebroadcast our address
2859 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2861 CAddress addr(addrLocalHost);
2862 addr.nTime = GetAdjustedTime();
2863 pnode->PushAddress(addr);
2867 nLastRebroadcast = GetTime();
2875 vector<CAddress> vAddr;
2876 vAddr.reserve(pto->vAddrToSend.size());
2877 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2879 // returns true if wasn't already contained in the set
2880 if (pto->setAddrKnown.insert(addr).second)
2882 vAddr.push_back(addr);
2883 // receiver rejects addr messages larger than 1000
2884 if (vAddr.size() >= 1000)
2886 pto->PushMessage("addr", vAddr);
2891 pto->vAddrToSend.clear();
2893 pto->PushMessage("addr", vAddr);
2898 // Message: inventory
2901 vector<CInv> vInvWait;
2903 LOCK(pto->cs_inventory);
2904 vInv.reserve(pto->vInventoryToSend.size());
2905 vInvWait.reserve(pto->vInventoryToSend.size());
2906 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2908 if (pto->setInventoryKnown.count(inv))
2911 // trickle out tx inv to protect privacy
2912 if (inv.type == MSG_TX && !fSendTrickle)
2914 // 1/4 of tx invs blast to all immediately
2915 static uint256 hashSalt;
2917 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2918 uint256 hashRand = inv.hash ^ hashSalt;
2919 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2920 bool fTrickleWait = ((hashRand & 3) != 0);
2922 // always trickle our own transactions
2926 if (GetTransaction(inv.hash, wtx))
2928 fTrickleWait = true;
2933 vInvWait.push_back(inv);
2938 // returns true if wasn't already contained in the set
2939 if (pto->setInventoryKnown.insert(inv).second)
2941 vInv.push_back(inv);
2942 if (vInv.size() >= 1000)
2944 pto->PushMessage("inv", vInv);
2949 pto->vInventoryToSend = vInvWait;
2952 pto->PushMessage("inv", vInv);
2958 vector<CInv> vGetData;
2959 int64 nNow = GetTime() * 1000000;
2961 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2963 const CInv& inv = (*pto->mapAskFor.begin()).second;
2964 if (!AlreadyHave(txdb, inv))
2966 printf("sending getdata: %s\n", inv.ToString().c_str());
2967 vGetData.push_back(inv);
2968 if (vGetData.size() >= 1000)
2970 pto->PushMessage("getdata", vGetData);
2974 mapAlreadyAskedFor[inv] = nNow;
2975 pto->mapAskFor.erase(pto->mapAskFor.begin());
2977 if (!vGetData.empty())
2978 pto->PushMessage("getdata", vGetData);
2997 //////////////////////////////////////////////////////////////////////////////
3002 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3004 unsigned char* pdata = (unsigned char*)pbuffer;
3005 unsigned int blocks = 1 + ((len + 8) / 64);
3006 unsigned char* pend = pdata + 64 * blocks;
3007 memset(pdata + len, 0, 64 * blocks - len);
3009 unsigned int bits = len * 8;
3010 pend[-1] = (bits >> 0) & 0xff;
3011 pend[-2] = (bits >> 8) & 0xff;
3012 pend[-3] = (bits >> 16) & 0xff;
3013 pend[-4] = (bits >> 24) & 0xff;
3017 static const unsigned int pSHA256InitState[8] =
3018 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3020 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3023 unsigned char data[64];
3027 for (int i = 0; i < 16; i++)
3028 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3030 for (int i = 0; i < 8; i++)
3031 ctx.h[i] = ((uint32_t*)pinit)[i];
3033 SHA256_Update(&ctx, data, sizeof(data));
3034 for (int i = 0; i < 8; i++)
3035 ((uint32_t*)pstate)[i] = ctx.h[i];
3039 // ScanHash scans nonces looking for a hash with at least some zero bits.
3040 // It operates on big endian data. Caller does the byte reversing.
3041 // All input buffers are 16-byte aligned. nNonce is usually preserved
3042 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3043 // the block is rebuilt and nNonce starts over at zero.
3045 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3047 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3051 // Hash pdata using pmidstate as the starting state into
3052 // preformatted buffer phash1, then hash phash1 into phash
3054 SHA256Transform(phash1, pdata, pmidstate);
3055 SHA256Transform(phash, phash1, pSHA256InitState);
3057 // Return the nonce if the hash has at least some zero bits,
3058 // caller will check if it has enough to reach the target
3059 if (((unsigned short*)phash)[14] == 0)
3062 // If nothing found after trying for a while, return -1
3063 if ((nNonce & 0xffff) == 0)
3065 nHashesDone = 0xffff+1;
3071 // Some explaining would be appreciated
3076 set<uint256> setDependsOn;
3079 COrphan(CTransaction* ptxIn)
3087 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3088 BOOST_FOREACH(uint256 hash, setDependsOn)
3089 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3094 uint64 nLastBlockTx = 0;
3095 uint64 nLastBlockSize = 0;
3097 CBlock* CreateNewBlock(CReserveKey& reservekey)
3099 CBlockIndex* pindexPrev = pindexBest;
3102 auto_ptr<CBlock> pblock(new CBlock());
3106 // Create coinbase tx
3108 txNew.vin.resize(1);
3109 txNew.vin[0].prevout.SetNull();
3110 txNew.vout.resize(1);
3111 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3113 // Add our coinbase tx as first transaction
3114 pblock->vtx.push_back(txNew);
3116 // Collect memory pool transactions into the block
3119 LOCK2(cs_main, cs_mapTransactions);
3122 // Priority order to process transactions
3123 list<COrphan> vOrphan; // list memory doesn't move
3124 map<uint256, vector<COrphan*> > mapDependers;
3125 multimap<double, CTransaction*> mapPriority;
3126 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3128 CTransaction& tx = (*mi).second;
3129 if (tx.IsCoinBase() || !tx.IsFinal())
3132 COrphan* porphan = NULL;
3133 double dPriority = 0;
3134 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3136 // Read prev transaction
3137 CTransaction txPrev;
3139 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3141 // Has to wait for dependencies
3144 // Use list for automatic deletion
3145 vOrphan.push_back(COrphan(&tx));
3146 porphan = &vOrphan.back();
3148 mapDependers[txin.prevout.hash].push_back(porphan);
3149 porphan->setDependsOn.insert(txin.prevout.hash);
3152 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3154 // Read block header
3155 int nConf = txindex.GetDepthInMainChain();
3157 dPriority += (double)nValueIn * nConf;
3159 if (fDebug && GetBoolArg("-printpriority"))
3160 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3163 // Priority is sum(valuein * age) / txsize
3164 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3167 porphan->dPriority = dPriority;
3169 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3171 if (fDebug && GetBoolArg("-printpriority"))
3173 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3180 // Collect transactions into block
3181 map<uint256, CTxIndex> mapTestPool;
3182 uint64 nBlockSize = 1000;
3183 uint64 nBlockTx = 0;
3184 int nBlockSigOps = 100;
3185 while (!mapPriority.empty())
3187 // Take highest priority transaction off priority queue
3188 double dPriority = -(*mapPriority.begin()).first;
3189 CTransaction& tx = *(*mapPriority.begin()).second;
3190 mapPriority.erase(mapPriority.begin());
3193 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3194 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3197 // Legacy limits on sigOps:
3198 int nTxSigOps = tx.GetLegacySigOpCount();
3199 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3202 // Transaction fee required depends on block size
3203 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3204 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3206 // Connecting shouldn't fail due to dependency on other memory pool transactions
3207 // because we're already processing them in order of dependency
3208 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3209 MapPrevTx mapInputs;
3211 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3214 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3215 if (nTxFees < nMinFee)
3218 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3219 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3222 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3224 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3225 swap(mapTestPool, mapTestPoolTmp);
3228 pblock->vtx.push_back(tx);
3229 nBlockSize += nTxSize;
3231 nBlockSigOps += nTxSigOps;
3234 // Add transactions that depend on this one to the priority queue
3235 uint256 hash = tx.GetHash();
3236 if (mapDependers.count(hash))
3238 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3240 if (!porphan->setDependsOn.empty())
3242 porphan->setDependsOn.erase(hash);
3243 if (porphan->setDependsOn.empty())
3244 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3250 nLastBlockTx = nBlockTx;
3251 nLastBlockSize = nBlockSize;
3252 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3255 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3258 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3259 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3260 pblock->UpdateTime(pindexPrev);
3261 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3264 return pblock.release();
3268 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3270 // Update nExtraNonce
3271 static uint256 hashPrevBlock;
3272 if (hashPrevBlock != pblock->hashPrevBlock)
3275 hashPrevBlock = pblock->hashPrevBlock;
3278 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3279 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3281 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3285 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3288 // Prebuild hash buffers
3295 uint256 hashPrevBlock;
3296 uint256 hashMerkleRoot;
3299 unsigned int nNonce;
3302 unsigned char pchPadding0[64];
3304 unsigned char pchPadding1[64];
3307 memset(&tmp, 0, sizeof(tmp));
3309 tmp.block.nVersion = pblock->nVersion;
3310 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3311 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3312 tmp.block.nTime = pblock->nTime;
3313 tmp.block.nBits = pblock->nBits;
3314 tmp.block.nNonce = pblock->nNonce;
3316 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3317 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3319 // Byte swap all the input buffer
3320 for (int i = 0; i < sizeof(tmp)/4; i++)
3321 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3323 // Precalc the first half of the first hash, which stays constant
3324 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3326 memcpy(pdata, &tmp.block, 128);
3327 memcpy(phash1, &tmp.hash1, 64);
3331 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3333 uint256 hash = pblock->GetHash();
3334 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3336 if (hash > hashTarget)
3340 printf("BitcoinMiner:\n");
3341 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3343 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3344 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3349 if (pblock->hashPrevBlock != hashBestChain)
3350 return error("BitcoinMiner : generated block is stale");
3352 // Remove key from key pool
3353 reservekey.KeepKey();
3355 // Track how many getdata requests this block gets
3357 LOCK(wallet.cs_wallet);
3358 wallet.mapRequestCount[pblock->GetHash()] = 0;
3361 // Process this block the same as if we had received it from another node
3362 if (!ProcessBlock(NULL, pblock))
3363 return error("BitcoinMiner : ProcessBlock, block not accepted");
3369 void static ThreadBitcoinMiner(void* parg);
3371 static bool fGenerateBitcoins = false;
3372 static bool fLimitProcessors = false;
3373 static int nLimitProcessors = -1;
3375 void static BitcoinMiner(CWallet *pwallet)
3377 printf("BitcoinMiner started\n");
3378 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3380 // Each thread has its own key and counter
3381 CReserveKey reservekey(pwallet);
3382 unsigned int nExtraNonce = 0;
3384 while (fGenerateBitcoins)
3388 while (vNodes.empty() || IsInitialBlockDownload())
3393 if (!fGenerateBitcoins)
3401 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3402 CBlockIndex* pindexPrev = pindexBest;
3404 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3407 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3409 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3413 // Prebuild hash buffers
3415 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3416 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3417 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3419 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3421 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3422 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3423 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3429 int64 nStart = GetTime();
3430 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3432 uint256& hash = *alignup<16>(hashbuf);
3435 unsigned int nHashesDone = 0;
3436 unsigned int nNonceFound;
3439 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3440 (char*)&hash, nHashesDone);
3442 // Check if something found
3443 if (nNonceFound != -1)
3445 for (int i = 0; i < sizeof(hash)/4; i++)
3446 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3448 if (hash <= hashTarget)
3451 pblock->nNonce = ByteReverse(nNonceFound);
3452 assert(hash == pblock->GetHash());
3454 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3455 CheckWork(pblock.get(), *pwalletMain, reservekey);
3456 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3462 static int64 nHashCounter;
3463 if (nHPSTimerStart == 0)
3465 nHPSTimerStart = GetTimeMillis();
3469 nHashCounter += nHashesDone;
3470 if (GetTimeMillis() - nHPSTimerStart > 4000)
3472 static CCriticalSection cs;
3475 if (GetTimeMillis() - nHPSTimerStart > 4000)
3477 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3478 nHPSTimerStart = GetTimeMillis();
3480 static int64 nLogTime;
3481 if (GetTime() - nLogTime > 30 * 60)
3483 nLogTime = GetTime();
3484 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3485 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3491 // Check for stop or if block needs to be rebuilt
3494 if (!fGenerateBitcoins)
3496 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3500 if (nBlockNonce >= 0xffff0000)
3502 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3504 if (pindexPrev != pindexBest)
3507 // Update nTime every few seconds
3508 pblock->UpdateTime(pindexPrev);
3509 nBlockTime = ByteReverse(pblock->nTime);
3512 // Changing pblock->nTime can change work required on testnet:
3513 nBlockBits = ByteReverse(pblock->nBits);
3514 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3520 void static ThreadBitcoinMiner(void* parg)
3522 CWallet* pwallet = (CWallet*)parg;
3525 vnThreadsRunning[THREAD_MINER]++;
3526 BitcoinMiner(pwallet);
3527 vnThreadsRunning[THREAD_MINER]--;
3529 catch (std::exception& e) {
3530 vnThreadsRunning[THREAD_MINER]--;
3531 PrintException(&e, "ThreadBitcoinMiner()");
3533 vnThreadsRunning[THREAD_MINER]--;
3534 PrintException(NULL, "ThreadBitcoinMiner()");
3537 if (vnThreadsRunning[THREAD_MINER] == 0)
3539 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3543 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3545 fGenerateBitcoins = fGenerate;
3546 nLimitProcessors = GetArg("-genproclimit", -1);
3547 if (nLimitProcessors == 0)
3548 fGenerateBitcoins = false;
3549 fLimitProcessors = (nLimitProcessors != -1);
3553 int nProcessors = boost::thread::hardware_concurrency();
3554 printf("%d processors\n", nProcessors);
3555 if (nProcessors < 1)
3557 if (fLimitProcessors && nProcessors > nLimitProcessors)
3558 nProcessors = nLimitProcessors;
3559 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3560 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3561 for (int i = 0; i < nAddThreads; i++)
3563 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3564 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");