1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Copyright (c) 2011 The PPCoin developers
4 // Distributed under the MIT/X11 software license, see the accompanying
5 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
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("0x000000006d52486334316794cc38ffeb7ebf35a7ebd661fd39f5f46b0d001575");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 uint64 nBestChainTrust = 0;
38 uint64 nBestInvalidTrust = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
45 map<uint256, CBlock*> mapOrphanBlocks;
46 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
48 map<uint256, CDataStream*> mapOrphanTransactions;
49 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
56 int fGenerateBitcoins = false;
57 int64 nTransactionFee = MIN_TX_FEE;
58 int fLimitProcessors = false;
59 int nLimitProcessors = 1;
60 int fMinimizeToTray = true;
61 int fMinimizeOnClose = true;
69 //////////////////////////////////////////////////////////////////////////////
71 // dispatching functions
74 // These functions dispatch to one or all registered wallets
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 // check whether the passed transaction is from us
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 // get the wallet transaction with the given hash (if it exists)
103 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->GetTransaction(hashTx,wtx))
111 // erases transaction with the given hash from all wallets
112 void static EraseFromWallets(uint256 hash)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 pwallet->EraseFromWallet(hash);
118 // make sure all wallets know about the given transaction, in the given block
119 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
125 // notify wallets about a new best chain
126 void static SetBestChain(const CBlockLocator& loc)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->SetBestChain(loc);
132 // notify wallets about an updated transaction
133 void static UpdatedTransaction(const uint256& hashTx)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->UpdatedTransaction(hashTx);
140 void static PrintWallets(const CBlock& block)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->PrintWallet(block);
146 // notify wallets about an incoming inventory (for request counts)
147 void static Inventory(const uint256& hash)
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->Inventory(hash);
153 // ask wallets to resend their transactions
154 void static ResendWalletTransactions()
156 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
157 pwallet->ResendWalletTransactions();
166 //////////////////////////////////////////////////////////////////////////////
168 // mapOrphanTransactions
171 void static AddOrphanTx(const CDataStream& vMsg)
174 CDataStream(vMsg) >> tx;
175 uint256 hash = tx.GetHash();
176 if (mapOrphanTransactions.count(hash))
178 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
179 BOOST_FOREACH(const CTxIn& txin, tx.vin)
180 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
183 void static EraseOrphanTx(uint256 hash)
185 if (!mapOrphanTransactions.count(hash))
187 const CDataStream* pvMsg = mapOrphanTransactions[hash];
189 CDataStream(*pvMsg) >> tx;
190 BOOST_FOREACH(const CTxIn& txin, tx.vin)
192 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
193 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
195 if ((*mi).second == pvMsg)
196 mapOrphanTransactionsByPrev.erase(mi++);
202 mapOrphanTransactions.erase(hash);
212 //////////////////////////////////////////////////////////////////////////////
214 // CTransaction and CTxIndex
217 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
220 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
222 if (!ReadFromDisk(txindexRet.pos))
224 if (prevout.n >= vout.size())
232 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
235 return ReadFromDisk(txdb, prevout, txindex);
238 bool CTransaction::ReadFromDisk(COutPoint prevout)
242 return ReadFromDisk(txdb, prevout, txindex);
247 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
259 // Load the block this tx is in
261 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
263 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
268 // Update the tx's hashBlock
269 hashBlock = pblock->GetHash();
271 // Locate the transaction
272 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
273 if (pblock->vtx[nIndex] == *(CTransaction*)this)
275 if (nIndex == pblock->vtx.size())
277 vMerkleBranch.clear();
279 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
283 // Fill in merkle branch
284 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
287 // Is the tx in a block that's in the main chain
288 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
289 if (mi == mapBlockIndex.end())
291 CBlockIndex* pindex = (*mi).second;
292 if (!pindex || !pindex->IsInMainChain())
295 return pindexBest->nHeight - pindex->nHeight + 1;
304 bool CTransaction::CheckTransaction() const
306 // Basic checks that don't depend on any context
308 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
310 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
312 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
313 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
315 // Check for negative or overflow output values
317 BOOST_FOREACH(const CTxOut& txout, vout)
319 if (txout.nValue < 0)
320 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
321 if (txout.nValue > MAX_MONEY)
322 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
323 nValueOut += txout.nValue;
324 if (!MoneyRange(nValueOut))
325 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
328 // Check for duplicate inputs
329 set<COutPoint> vInOutPoints;
330 BOOST_FOREACH(const CTxIn& txin, vin)
332 if (vInOutPoints.count(txin.prevout))
334 vInOutPoints.insert(txin.prevout);
339 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
340 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
344 BOOST_FOREACH(const CTxIn& txin, vin)
345 if (txin.prevout.IsNull())
346 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
352 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
355 *pfMissingInputs = false;
357 if (!CheckTransaction())
358 return error("AcceptToMemoryPool() : CheckTransaction failed");
360 // Coinbase is only valid in a block, not as a loose transaction
362 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
364 // To help v0.1.5 clients who would see it as a negative number
365 if ((int64)nLockTime > INT_MAX)
366 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
369 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
370 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
371 // attacks disallow transactions with more than one SigOp per 34 bytes.
372 // 34 bytes because a TxOut is:
373 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
374 if (GetSigOpCount() > nSize / 34 || nSize < 100)
375 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
377 // Rather not work on nonstandard transactions (unless -testnet)
378 if (!fTestNet && !IsStandard())
379 return error("AcceptToMemoryPool() : nonstandard transaction type");
381 // Do we already have it?
382 uint256 hash = GetHash();
383 CRITICAL_BLOCK(cs_mapTransactions)
384 if (mapTransactions.count(hash))
387 if (txdb.ContainsTx(hash))
390 // Check for conflicts with in-memory transactions
391 CTransaction* ptxOld = NULL;
392 for (int i = 0; i < vin.size(); i++)
394 COutPoint outpoint = vin[i].prevout;
395 if (mapNextTx.count(outpoint))
397 // Disable replacement feature for now
400 // Allow replacing with a newer version of the same transaction
403 ptxOld = mapNextTx[outpoint].ptx;
404 if (ptxOld->IsFinal())
406 if (!IsNewerThan(*ptxOld))
408 for (int i = 0; i < vin.size(); i++)
410 COutPoint outpoint = vin[i].prevout;
411 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
420 // Check against previous transactions
421 map<uint256, CTxIndex> mapUnused;
423 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
426 *pfMissingInputs = true;
427 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
430 // Don't accept it if it can't get into a block
431 if (nFees < GetMinFee(1000, false, true))
432 return error("AcceptToMemoryPool() : not enough fees");
434 // Continuously rate-limit free transactions
435 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
436 // be annoying or make other's transactions take longer to confirm.
437 if (nFees < MIN_RELAY_TX_FEE)
439 static CCriticalSection cs;
440 static double dFreeCount;
441 static int64 nLastTime;
442 int64 nNow = GetTime();
446 // Use an exponentially decaying ~10-minute window:
447 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
449 // -limitfreerelay unit is thousand-bytes-per-minute
450 // At default rate it would take over a month to fill 1GB
451 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
452 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
454 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
460 // Store transaction in memory
461 CRITICAL_BLOCK(cs_mapTransactions)
465 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
466 ptxOld->RemoveFromMemoryPool();
468 AddToMemoryPoolUnchecked();
471 ///// are we sure this is ok when loading transactions or restoring block txes
472 // If updated, erase old tx from wallet
474 EraseFromWallets(ptxOld->GetHash());
476 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
480 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
483 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
486 bool CTransaction::AddToMemoryPoolUnchecked()
488 // Add to memory pool without checking anything. Don't call this directly,
489 // call AcceptToMemoryPool to properly check the transaction first.
490 CRITICAL_BLOCK(cs_mapTransactions)
492 uint256 hash = GetHash();
493 mapTransactions[hash] = *this;
494 for (int i = 0; i < vin.size(); i++)
495 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
496 nTransactionsUpdated++;
502 bool CTransaction::RemoveFromMemoryPool()
504 // Remove transaction from memory pool
505 CRITICAL_BLOCK(cs_mapTransactions)
507 BOOST_FOREACH(const CTxIn& txin, vin)
508 mapNextTx.erase(txin.prevout);
509 mapTransactions.erase(GetHash());
510 nTransactionsUpdated++;
520 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
522 if (hashBlock == 0 || nIndex == -1)
525 // Find the block it claims to be in
526 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
527 if (mi == mapBlockIndex.end())
529 CBlockIndex* pindex = (*mi).second;
530 if (!pindex || !pindex->IsInMainChain())
533 // Make sure the merkle branch connects to this block
534 if (!fMerkleVerified)
536 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
538 fMerkleVerified = true;
541 nHeightRet = pindex->nHeight;
542 return pindexBest->nHeight - pindex->nHeight + 1;
546 int CMerkleTx::GetBlocksToMaturity() const
550 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
554 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
558 if (!IsInMainChain() && !ClientConnectInputs())
560 return CTransaction::AcceptToMemoryPool(txdb, false);
564 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
568 bool CMerkleTx::AcceptToMemoryPool()
571 return AcceptToMemoryPool(txdb);
576 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
578 CRITICAL_BLOCK(cs_mapTransactions)
580 // Add previous supporting transactions first
581 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
583 if (!tx.IsCoinBase())
585 uint256 hash = tx.GetHash();
586 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
587 tx.AcceptToMemoryPool(txdb, fCheckInputs);
590 return AcceptToMemoryPool(txdb, fCheckInputs);
595 bool CWalletTx::AcceptWalletTransaction()
598 return AcceptWalletTransaction(txdb);
601 int CTxIndex::GetDepthInMainChain() const
605 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
607 // Find the block in the index
608 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
609 if (mi == mapBlockIndex.end())
611 CBlockIndex* pindex = (*mi).second;
612 if (!pindex || !pindex->IsInMainChain())
614 return 1 + nBestHeight - pindex->nHeight;
626 //////////////////////////////////////////////////////////////////////////////
628 // CBlock and CBlockIndex
631 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
633 if (!fReadTransactions)
635 *this = pindex->GetBlockHeader();
638 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
640 if (GetHash() != pindex->GetBlockHash())
641 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
645 uint256 static GetOrphanRoot(const CBlock* pblock)
647 // Work back to the first block in the orphan chain
648 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
649 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
650 return pblock->GetHash();
653 int64 static GetBlockValue(unsigned int nBits, int64 nFees)
655 CBigNum bnSubsidyLimit = 9999 * COIN; // subsidy amount for difficulty 1
657 bnTarget.SetCompact(nBits);
658 CBigNum bnTargetLimit = bnProofOfWorkLimit;
659 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
661 // ppcoin: subsidy is cut in half every 16x multiply of difficulty
662 // A reasonably continuous curve is used to avoid shock to market
663 // (nSubsidyLimit / nSubsidy) ** 4 == bnProofOfWorkLimit / bnTarget
664 CBigNum bnLowerBound = CENT;
665 CBigNum bnUpperBound = bnSubsidyLimit;
666 while (bnLowerBound + CENT <= bnUpperBound)
668 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
669 if (fDebug && GetBoolArg("-printcreation"))
670 printf("GetBlockValue() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
671 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
672 bnUpperBound = bnMidValue;
674 bnLowerBound = bnMidValue;
677 int64 nSubsidy = bnUpperBound.getuint64();
678 nSubsidy = (nSubsidy / CENT) * CENT;
679 if (fDebug && GetBoolArg("-printcreation"))
680 printf("GetBlockValue() : nBits=0x%08x nSubsidy=%"PRI64d"\n", nBits, nSubsidy);
682 return nSubsidy + nFees;
685 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
686 static const int64 nTargetSpacing = 10 * 60;
687 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
688 static const int64 nMaxClockDrift = 2 * 60 * 60; // 2 hours
691 // minimum amount of work that could possibly be required nTime after
692 // minimum work required was nBase
694 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
697 bnResult.SetCompact(nBase);
698 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
700 // Maximum 400% adjustment...
702 // ... in best-case exactly 4-times-normal target time
703 nTime -= nTargetTimespan*4;
705 if (bnResult > bnProofOfWorkLimit)
706 bnResult = bnProofOfWorkLimit;
707 return bnResult.GetCompact();
710 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
712 // Genesis block and first block
713 if (pindexLast == NULL || pindexLast->pprev == NULL)
714 return bnProofOfWorkLimit.GetCompact();
716 int64 nActualSpacing = pindexLast->GetBlockTime() - pindexLast->pprev->GetBlockTime();
718 // ppcoin: target change every block
719 // ppcoin: retarget with exponential moving toward target spacing
721 bnNew.SetCompact(pindexLast->nBits);
722 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
723 bnNew /= ((nInterval + 1) * nTargetSpacing);
725 if (bnNew > bnProofOfWorkLimit)
726 bnNew = bnProofOfWorkLimit;
728 return bnNew.GetCompact();
731 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
734 bnTarget.SetCompact(nBits);
737 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
738 return error("CheckProofOfWork() : nBits below minimum work");
740 // Check proof of work matches claimed amount
741 if (hash > bnTarget.getuint256())
742 return error("CheckProofOfWork() : hash doesn't match nBits");
747 // Return maximum amount of blocks that other nodes claim to have
748 int GetNumBlocksOfPeers()
750 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
753 bool IsInitialBlockDownload()
755 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
757 static int64 nLastUpdate;
758 static CBlockIndex* pindexLastBest;
759 if (pindexBest != pindexLastBest)
761 pindexLastBest = pindexBest;
762 nLastUpdate = GetTime();
764 return (GetTime() - nLastUpdate < 10 &&
765 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
768 void static InvalidChainFound(CBlockIndex* pindexNew)
770 if (pindexNew->nChainTrust > nBestInvalidTrust)
772 nBestInvalidTrust = pindexNew->nChainTrust;
773 CTxDB().WriteBestInvalidTrust(nBestInvalidTrust);
776 printf("InvalidChainFound: invalid block=%s height=%d trust=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, CBigNum(pindexNew->nChainTrust).ToString().c_str());
777 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
778 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
779 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
792 bool CTransaction::DisconnectInputs(CTxDB& txdb)
794 // Relinquish previous transactions' spent pointers
797 BOOST_FOREACH(const CTxIn& txin, vin)
799 COutPoint prevout = txin.prevout;
801 // Get prev txindex from disk
803 if (!txdb.ReadTxIndex(prevout.hash, txindex))
804 return error("DisconnectInputs() : ReadTxIndex failed");
806 if (prevout.n >= txindex.vSpent.size())
807 return error("DisconnectInputs() : prevout.n out of range");
809 // Mark outpoint as not spent
810 txindex.vSpent[prevout.n].SetNull();
813 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
814 return error("DisconnectInputs() : UpdateTxIndex failed");
818 // Remove transaction from index
819 if (!txdb.EraseTxIndex(*this))
820 return error("DisconnectInputs() : EraseTxPos failed");
826 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
827 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
829 // Take over previous transactions' spent pointers
830 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
831 // fMiner is true when called from the internal bitcoin miner
832 // ... both are false when called from CTransaction::AcceptToMemoryPool
836 for (int i = 0; i < vin.size(); i++)
838 COutPoint prevout = vin[i].prevout;
843 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
845 // Get txindex from current proposed changes
846 txindex = mapTestPool[prevout.hash];
850 // Read txindex from txdb
851 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
853 if (!fFound && (fBlock || fMiner))
854 return fMiner ? false : error("ConnectInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
858 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
860 // Get prev tx from single transactions in memory
861 CRITICAL_BLOCK(cs_mapTransactions)
863 if (!mapTransactions.count(prevout.hash))
864 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
865 txPrev = mapTransactions[prevout.hash];
868 txindex.vSpent.resize(txPrev.vout.size());
872 // Get prev tx from disk
873 if (!txPrev.ReadFromDisk(txindex.pos))
874 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
877 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
878 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()));
880 // If prev is coinbase, check that it's matured
881 if (txPrev.IsCoinBase())
882 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
883 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
884 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
886 // ppcoin: check transaction timestamp
887 if (txPrev.nTime > nTime)
888 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
890 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
891 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
892 // still computed and checked, and any change will be caught at the next checkpoint.
893 if (!(fBlock && IsInitialBlockDownload()))
895 if (!VerifySignature(txPrev, *this, i))
896 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
898 // Check for conflicts (double-spend)
899 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
900 // for an attacker to attempt to split the network.
901 if (!txindex.vSpent[prevout.n].IsNull())
902 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());
904 // Check for negative or overflow input values
905 nValueIn += txPrev.vout[prevout.n].nValue;
906 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
907 return DoS(100, error("ConnectInputs() : txin values out of range"));
909 // Mark outpoints as spent
910 txindex.vSpent[prevout.n] = posThisTx;
913 if (fBlock || fMiner)
915 mapTestPool[prevout.hash] = txindex;
919 if (nValueIn < GetValueOut())
920 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
922 // Tally transaction fees
923 int64 nTxFee = nValueIn - GetValueOut();
925 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
926 if (nTxFee < nMinFee) //ppcoin: enforce transaction fees for every block
927 return fBlock? DoS(100, error("ConnectInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(nMinFee).c_str(), FormatMoney(nTxFee).c_str())) : false;
929 if (!MoneyRange(nFees))
930 return DoS(100, error("ConnectInputs() : nFees out of range"));
935 // Add transaction to changes
936 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
940 // Add transaction to test pool
941 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
948 bool CTransaction::ClientConnectInputs()
953 // Take over previous transactions' spent pointers
954 CRITICAL_BLOCK(cs_mapTransactions)
957 for (int i = 0; i < vin.size(); i++)
959 // Get prev tx from single transactions in memory
960 COutPoint prevout = vin[i].prevout;
961 if (!mapTransactions.count(prevout.hash))
963 CTransaction& txPrev = mapTransactions[prevout.hash];
965 if (prevout.n >= txPrev.vout.size())
969 if (!VerifySignature(txPrev, *this, i))
970 return error("ConnectInputs() : VerifySignature failed");
972 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
973 ///// this has to go away now that posNext is gone
974 // // Check for conflicts
975 // if (!txPrev.vout[prevout.n].posNext.IsNull())
976 // return error("ConnectInputs() : prev tx already used");
978 // // Flag outpoints as used
979 // txPrev.vout[prevout.n].posNext = posThisTx;
981 nValueIn += txPrev.vout[prevout.n].nValue;
983 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
984 return error("ClientConnectInputs() : txin values out of range");
986 if (GetValueOut() > nValueIn)
996 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
998 // Disconnect in reverse order
999 for (int i = vtx.size()-1; i >= 0; i--)
1000 if (!vtx[i].DisconnectInputs(txdb))
1003 // Update block index on disk without changing it in memory.
1004 // The memory index structure will be changed after the db commits.
1007 CDiskBlockIndex blockindexPrev(pindex->pprev);
1008 blockindexPrev.hashNext = 0;
1009 if (!txdb.WriteBlockIndex(blockindexPrev))
1010 return error("DisconnectBlock() : WriteBlockIndex failed");
1016 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1018 // Check it again in case a previous version let a bad block in
1022 //// issue here: it doesn't know the version
1023 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1025 map<uint256, CTxIndex> mapQueuedChanges;
1027 BOOST_FOREACH(CTransaction& tx, vtx)
1029 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1030 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1032 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, tx.GetMinFee()))
1035 // Write queued txindex changes
1036 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1038 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1039 return error("ConnectBlock() : UpdateTxIndex failed");
1042 if (vtx[0].GetValueOut() > GetBlockValue(nBits, nFees))
1045 // Update block index on disk without changing it in memory.
1046 // The memory index structure will be changed after the db commits.
1049 CDiskBlockIndex blockindexPrev(pindex->pprev);
1050 blockindexPrev.hashNext = pindex->GetBlockHash();
1051 if (!txdb.WriteBlockIndex(blockindexPrev))
1052 return error("ConnectBlock() : WriteBlockIndex failed");
1055 // Watch for transactions paying to me
1056 BOOST_FOREACH(CTransaction& tx, vtx)
1057 SyncWithWallets(tx, this, true);
1062 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1064 printf("REORGANIZE\n");
1067 CBlockIndex* pfork = pindexBest;
1068 CBlockIndex* plonger = pindexNew;
1069 while (pfork != plonger)
1071 while (plonger->nHeight > pfork->nHeight)
1072 if (!(plonger = plonger->pprev))
1073 return error("Reorganize() : plonger->pprev is null");
1074 if (pfork == plonger)
1076 if (!(pfork = pfork->pprev))
1077 return error("Reorganize() : pfork->pprev is null");
1080 // List of what to disconnect
1081 vector<CBlockIndex*> vDisconnect;
1082 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1083 vDisconnect.push_back(pindex);
1085 // List of what to connect
1086 vector<CBlockIndex*> vConnect;
1087 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1088 vConnect.push_back(pindex);
1089 reverse(vConnect.begin(), vConnect.end());
1091 // Disconnect shorter branch
1092 vector<CTransaction> vResurrect;
1093 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1096 if (!block.ReadFromDisk(pindex))
1097 return error("Reorganize() : ReadFromDisk for disconnect failed");
1098 if (!block.DisconnectBlock(txdb, pindex))
1099 return error("Reorganize() : DisconnectBlock failed");
1101 // Queue memory transactions to resurrect
1102 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1103 if (!tx.IsCoinBase())
1104 vResurrect.push_back(tx);
1107 // Connect longer branch
1108 vector<CTransaction> vDelete;
1109 for (int i = 0; i < vConnect.size(); i++)
1111 CBlockIndex* pindex = vConnect[i];
1113 if (!block.ReadFromDisk(pindex))
1114 return error("Reorganize() : ReadFromDisk for connect failed");
1115 if (!block.ConnectBlock(txdb, pindex))
1119 return error("Reorganize() : ConnectBlock failed");
1122 // Queue memory transactions to delete
1123 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1124 vDelete.push_back(tx);
1126 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1127 return error("Reorganize() : WriteHashBestChain failed");
1128 if (!txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1129 return error("Reorganize() : WriteAutoCheckpoint failed");
1131 // Make sure it's successfully written to disk before changing memory structure
1132 if (!txdb.TxnCommit())
1133 return error("Reorganize() : TxnCommit failed");
1135 // Disconnect shorter branch
1136 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1138 pindex->pprev->pnext = NULL;
1140 // Connect longer branch
1141 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1143 pindex->pprev->pnext = pindex;
1145 // Resurrect memory transactions that were in the disconnected branch
1146 BOOST_FOREACH(CTransaction& tx, vResurrect)
1147 tx.AcceptToMemoryPool(txdb, false);
1149 // Delete redundant memory transactions that are in the connected branch
1150 BOOST_FOREACH(CTransaction& tx, vDelete)
1151 tx.RemoveFromMemoryPool();
1157 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1159 uint256 hash = GetHash();
1162 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1164 txdb.WriteHashBestChain(hash);
1165 txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint));
1166 if (!txdb.TxnCommit())
1167 return error("SetBestChain() : TxnCommit failed");
1168 pindexGenesisBlock = pindexNew;
1170 else if (hashPrevBlock == hashBestChain)
1172 // Adding to current best branch
1173 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash) || !txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1176 InvalidChainFound(pindexNew);
1177 return error("SetBestChain() : ConnectBlock failed");
1179 if (!txdb.TxnCommit())
1180 return error("SetBestChain() : TxnCommit failed");
1182 // Add to current best branch
1183 pindexNew->pprev->pnext = pindexNew;
1185 // Delete redundant memory transactions
1186 BOOST_FOREACH(CTransaction& tx, vtx)
1187 tx.RemoveFromMemoryPool();
1192 if (!Reorganize(txdb, pindexNew))
1195 InvalidChainFound(pindexNew);
1196 return error("SetBestChain() : Reorganize failed");
1200 // Update best block in wallet (so we can detect restored wallets)
1201 if (!IsInitialBlockDownload())
1203 const CBlockLocator locator(pindexNew);
1204 ::SetBestChain(locator);
1208 hashBestChain = hash;
1209 pindexBest = pindexNew;
1210 nBestHeight = pindexBest->nHeight;
1211 nBestChainTrust = pindexNew->nChainTrust;
1212 nTimeBestReceived = GetTime();
1213 nTransactionsUpdated++;
1214 Checkpoints::AdvanceAutoCheckpoint(pindexBest->nCheckpoint);
1215 printf("SetBestChain: new best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
1221 // ppcoin: total coin age spent in block, in the unit of coin-days.
1222 // Only those coins last spent at least a week ago count. As those
1223 // transactions not in main chain are not currently indexed so we
1224 // might not find out about their coin age. Older transactions are
1225 // guaranteed to be in main chain by auto checkpoint. This rule is
1226 // introduced to help nodes establish a consistent view of the coin
1227 // age (trust score) of competing branches.
1228 uint64 CBlock::GetBlockCoinAge()
1230 CBigNum bnCentSecond = 0;
1232 BOOST_FOREACH(const CTransaction& tx, vtx)
1234 if (tx.IsCoinBase())
1237 BOOST_FOREACH(const CTxIn& txin, tx.vin)
1239 // First try finding the previous transaction in database
1241 CTransaction txPrev;
1243 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1244 continue; // previous transaction not in main chain
1245 if (tx.nTime < txPrev.nTime)
1246 return 0; // Transaction timestamp violation
1248 // Read block header
1250 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1251 return 0; // unable to read block of previous transaction
1252 if (block.GetBlockTime() + AUTO_CHECKPOINT_TRUST_SPAN > tx.nTime)
1253 continue; // only count coins from at least one week ago
1255 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1256 bnCentSecond += CBigNum(nValueIn) * (tx.nTime-txPrev.nTime) / CENT;
1258 if (fDebug && GetBoolArg("-printcoinage"))
1259 printf("coin age nValueIn=%-12I64d nTimeDiff=%d bnCentSecond=%s\n", nValueIn, tx.nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1263 CBigNum bnCoinAge = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1267 return bnCoinAge.getuint64();
1271 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1273 // Check for duplicate
1274 uint256 hash = GetHash();
1275 if (mapBlockIndex.count(hash))
1276 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1278 // Construct new block index object
1279 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1281 return error("AddToBlockIndex() : new CBlockIndex failed");
1282 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1284 pindexNew->phashBlock = &((*mi).first);
1285 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1286 if (miPrev != mapBlockIndex.end())
1288 pindexNew->pprev = (*miPrev).second;
1289 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1291 // ppcoin: compute chain checkpoint
1292 pindexNew->nCheckpoint = Checkpoints::GetNextChainCheckpoint(pindexNew->pprev);
1293 assert (pindexNew->nCheckpoint >= pindexNew->pprev->nCheckpoint);
1296 // ppcoin: compute chain trust score
1297 uint64 nCoinAge = GetBlockCoinAge();
1299 return error("AddToBlockIndex() : invalid transaction in block");
1300 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + nCoinAge;
1304 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1305 if (!txdb.TxnCommit())
1309 if (pindexNew->nChainTrust > nBestChainTrust)
1310 if (!SetBestChain(txdb, pindexNew))
1315 if (pindexNew == pindexBest)
1317 // Notify UI to display prev block's coinbase if it was ours
1318 static uint256 hashPrevBestCoinBase;
1319 UpdatedTransaction(hashPrevBestCoinBase);
1320 hashPrevBestCoinBase = vtx[0].GetHash();
1330 bool CBlock::CheckBlock() const
1332 // These are checks that are independent of context
1333 // that can be verified before saving an orphan block.
1336 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1337 return DoS(100, error("CheckBlock() : size limits failed"));
1339 // Check proof of work matches claimed amount
1340 if (!CheckProofOfWork(GetHash(), nBits))
1341 return DoS(50, error("CheckBlock() : proof of work failed"));
1344 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
1345 return error("CheckBlock() : block timestamp too far in the future");
1347 // First transaction must be coinbase, the rest must not be
1348 if (vtx.empty() || !vtx[0].IsCoinBase())
1349 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1350 for (int i = 1; i < vtx.size(); i++)
1351 if (vtx[i].IsCoinBase())
1352 return DoS(100, error("CheckBlock() : more than one coinbase"));
1354 // Check coinbase timestamp
1355 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
1356 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
1358 // Check transactions
1359 BOOST_FOREACH(const CTransaction& tx, vtx)
1361 if (!tx.CheckTransaction())
1362 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1363 // ppcoin: check transaction timestamp
1364 if (GetBlockTime() < (int64)tx.nTime)
1365 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1368 // Check that it's not full of nonstandard transactions
1369 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1370 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1373 if (hashMerkleRoot != BuildMerkleTree())
1374 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1379 bool CBlock::AcceptBlock()
1381 // Check for duplicate
1382 uint256 hash = GetHash();
1383 if (mapBlockIndex.count(hash))
1384 return error("AcceptBlock() : block already in mapBlockIndex");
1386 // Get prev block index
1387 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1388 if (mi == mapBlockIndex.end())
1389 return DoS(10, error("AcceptBlock() : prev block not found"));
1390 CBlockIndex* pindexPrev = (*mi).second;
1391 int nHeight = pindexPrev->nHeight+1;
1393 // Check proof of work
1394 if (nBits != GetNextWorkRequired(pindexPrev))
1395 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1397 // Check timestamp against prev
1398 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
1399 return error("AcceptBlock() : block's timestamp is too early");
1401 // Check that all transactions are finalized
1402 BOOST_FOREACH(const CTransaction& tx, vtx)
1403 if (!tx.IsFinal(nHeight, GetBlockTime()))
1404 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1406 // Check that the block chain matches the known block chain up to a hardened checkpoint
1407 if (!Checkpoints::CheckHardened(nHeight, hash))
1408 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1410 // ppcoin: check that the block satisfies automatic checkpoint
1411 if (!Checkpoints::CheckAuto(pindexPrev))
1412 return DoS(100, error("AcceptBlock() : rejected by automatic checkpoint at %d", Checkpoints::nAutoCheckpoint));
1414 // Write block to history file
1415 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1416 return error("AcceptBlock() : out of disk space");
1417 unsigned int nFile = -1;
1418 unsigned int nBlockPos = 0;
1419 if (!WriteToDisk(nFile, nBlockPos))
1420 return error("AcceptBlock() : WriteToDisk failed");
1421 if (!AddToBlockIndex(nFile, nBlockPos))
1422 return error("AcceptBlock() : AddToBlockIndex failed");
1424 // Relay inventory, but don't relay old inventory during initial block download
1425 if (hashBestChain == hash)
1426 CRITICAL_BLOCK(cs_vNodes)
1427 BOOST_FOREACH(CNode* pnode, vNodes)
1428 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1429 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1434 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1436 // Check for duplicate
1437 uint256 hash = pblock->GetHash();
1438 if (mapBlockIndex.count(hash))
1439 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1440 if (mapOrphanBlocks.count(hash))
1441 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1443 // Preliminary checks
1444 if (!pblock->CheckBlock())
1445 return error("ProcessBlock() : CheckBlock FAILED");
1447 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1448 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1450 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1451 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1454 pfrom->Misbehaving(100);
1455 return error("ProcessBlock() : block with timestamp before last checkpoint");
1458 bnNewBlock.SetCompact(pblock->nBits);
1460 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1461 if (bnNewBlock > bnRequired)
1463 pfrom->Misbehaving(100);
1464 return error("ProcessBlock() : block with too little proof-of-work");
1469 // If don't already have its previous block, shunt it off to holding area until we get it
1470 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1472 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1473 CBlock* pblock2 = new CBlock(*pblock);
1474 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1475 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1477 // Ask this guy to fill in what we're missing
1479 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1484 if (!pblock->AcceptBlock())
1485 return error("ProcessBlock() : AcceptBlock FAILED");
1487 // Recursively process any orphan blocks that depended on this one
1488 vector<uint256> vWorkQueue;
1489 vWorkQueue.push_back(hash);
1490 for (int i = 0; i < vWorkQueue.size(); i++)
1492 uint256 hashPrev = vWorkQueue[i];
1493 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1494 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1497 CBlock* pblockOrphan = (*mi).second;
1498 if (pblockOrphan->AcceptBlock())
1499 vWorkQueue.push_back(pblockOrphan->GetHash());
1500 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1501 delete pblockOrphan;
1503 mapOrphanBlocksByPrev.erase(hashPrev);
1506 printf("ProcessBlock: ACCEPTED\n");
1517 bool CheckDiskSpace(uint64 nAdditionalBytes)
1519 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1521 // Check for 15MB because database could create another 10MB log file at any time
1522 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1525 string strMessage = _("Warning: Disk space is low ");
1526 strMiscWarning = strMessage;
1527 printf("*** %s\n", strMessage.c_str());
1528 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1529 CreateThread(Shutdown, NULL);
1535 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1539 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1542 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1544 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1553 static unsigned int nCurrentBlockFile = 1;
1555 FILE* AppendBlockFile(unsigned int& nFileRet)
1560 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1563 if (fseek(file, 0, SEEK_END) != 0)
1565 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1566 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1568 nFileRet = nCurrentBlockFile;
1572 nCurrentBlockFile++;
1576 bool LoadBlockIndex(bool fAllowNew)
1580 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1581 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1582 pchMessageStart[0] = 0xfa;
1583 pchMessageStart[1] = 0xbf;
1584 pchMessageStart[2] = 0xb5;
1585 pchMessageStart[3] = 0xda;
1592 if (!txdb.LoadBlockIndex())
1597 // Init with genesis block
1599 if (mapBlockIndex.empty())
1605 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1606 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1607 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1608 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1609 // vMerkleTree: 4a5e1e
1612 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1614 txNew.nTime = 1325878371;
1615 txNew.vin.resize(1);
1616 txNew.vout.resize(1);
1617 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1618 txNew.vout[0].nValue = GetBlockValue(bnProofOfWorkLimit.GetCompact(), 0);
1619 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1621 block.vtx.push_back(txNew);
1622 block.hashPrevBlock = 0;
1623 block.hashMerkleRoot = block.BuildMerkleTree();
1625 block.nTime = 1325882536;
1626 block.nBits = bnProofOfWorkLimit.GetCompact();
1627 block.nNonce = 2081920190;
1631 block.nTime = 1296688602;
1632 block.nBits = 0x1d07fff8;
1633 block.nNonce = 384568319;
1637 printf("%s\n", block.GetHash().ToString().c_str());
1638 printf("%s\n", hashGenesisBlock.ToString().c_str());
1639 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1640 assert(block.hashMerkleRoot == uint256("0xc7311b56de266580cca65be108ae53d7100b5c3b17da8b1106044103abd7a521"));
1642 assert(block.GetHash() == hashGenesisBlock);
1644 // Start new block file
1646 unsigned int nBlockPos;
1647 if (!block.WriteToDisk(nFile, nBlockPos))
1648 return error("LoadBlockIndex() : writing genesis block to disk failed");
1649 if (!block.AddToBlockIndex(nFile, nBlockPos))
1650 return error("LoadBlockIndex() : genesis block not accepted");
1658 void PrintBlockTree()
1660 // precompute tree structure
1661 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1662 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1664 CBlockIndex* pindex = (*mi).second;
1665 mapNext[pindex->pprev].push_back(pindex);
1667 //while (rand() % 3 == 0)
1668 // mapNext[pindex->pprev].push_back(pindex);
1671 vector<pair<int, CBlockIndex*> > vStack;
1672 vStack.push_back(make_pair(0, pindexGenesisBlock));
1675 while (!vStack.empty())
1677 int nCol = vStack.back().first;
1678 CBlockIndex* pindex = vStack.back().second;
1681 // print split or gap
1682 if (nCol > nPrevCol)
1684 for (int i = 0; i < nCol-1; i++)
1688 else if (nCol < nPrevCol)
1690 for (int i = 0; i < nCol; i++)
1697 for (int i = 0; i < nCol; i++)
1702 block.ReadFromDisk(pindex);
1703 printf("%d (%u,%u) %s %s tx %d",
1707 block.GetHash().ToString().substr(0,20).c_str(),
1708 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1711 PrintWallets(block);
1713 // put the main timechain first
1714 vector<CBlockIndex*>& vNext = mapNext[pindex];
1715 for (int i = 0; i < vNext.size(); i++)
1717 if (vNext[i]->pnext)
1719 swap(vNext[0], vNext[i]);
1725 for (int i = 0; i < vNext.size(); i++)
1726 vStack.push_back(make_pair(nCol+i, vNext[i]));
1739 //////////////////////////////////////////////////////////////////////////////
1744 map<uint256, CAlert> mapAlerts;
1745 CCriticalSection cs_mapAlerts;
1747 string GetWarnings(string strFor)
1750 string strStatusBar;
1752 if (GetBoolArg("-testsafemode"))
1755 // Misc warnings like out of disk space and clock is wrong
1756 if (strMiscWarning != "")
1759 strStatusBar = strMiscWarning;
1762 // Longer invalid proof-of-work chain
1763 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
1766 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1770 CRITICAL_BLOCK(cs_mapAlerts)
1772 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1774 const CAlert& alert = item.second;
1775 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1777 nPriority = alert.nPriority;
1778 strStatusBar = alert.strStatusBar;
1783 if (strFor == "statusbar")
1784 return strStatusBar;
1785 else if (strFor == "rpc")
1787 assert(!"GetWarnings() : invalid parameter");
1791 bool CAlert::ProcessAlert()
1793 if (!CheckSignature())
1798 CRITICAL_BLOCK(cs_mapAlerts)
1800 // Cancel previous alerts
1801 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1803 const CAlert& alert = (*mi).second;
1806 printf("cancelling alert %d\n", alert.nID);
1807 mapAlerts.erase(mi++);
1809 else if (!alert.IsInEffect())
1811 printf("expiring alert %d\n", alert.nID);
1812 mapAlerts.erase(mi++);
1818 // Check if this alert has been cancelled
1819 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1821 const CAlert& alert = item.second;
1822 if (alert.Cancels(*this))
1824 printf("alert already cancelled by %d\n", alert.nID);
1830 mapAlerts.insert(make_pair(GetHash(), *this));
1833 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1845 //////////////////////////////////////////////////////////////////////////////
1851 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1855 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1856 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1858 // Don't know what it is, just say we already got one
1865 // The message start string is designed to be unlikely to occur in normal data.
1866 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1867 // a large 4-byte int at any alignment.
1868 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1871 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1873 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1874 RandAddSeedPerfmon();
1876 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1877 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1879 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1881 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1889 if (strCommand == "version")
1891 // Each connection can only send one version message
1892 if (pfrom->nVersion != 0)
1894 pfrom->Misbehaving(1);
1902 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1903 if (pfrom->nVersion == 10300)
1904 pfrom->nVersion = 300;
1905 if (pfrom->nVersion >= 106 && !vRecv.empty())
1906 vRecv >> addrFrom >> nNonce;
1907 if (pfrom->nVersion >= 106 && !vRecv.empty())
1908 vRecv >> pfrom->strSubVer;
1909 if (pfrom->nVersion >= 209 && !vRecv.empty())
1910 vRecv >> pfrom->nStartingHeight;
1912 if (pfrom->nVersion == 0)
1915 // Disconnect if we connected to ourself
1916 if (nNonce == nLocalHostNonce && nNonce > 1)
1918 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1919 pfrom->fDisconnect = true;
1923 // Be shy and don't send version until we hear
1924 if (pfrom->fInbound)
1925 pfrom->PushVersion();
1927 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1929 AddTimeData(pfrom->addr.ip, nTime);
1932 if (pfrom->nVersion >= 209)
1933 pfrom->PushMessage("verack");
1934 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1935 if (pfrom->nVersion < 209)
1936 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1938 if (!pfrom->fInbound)
1940 // Advertise our address
1941 if (addrLocalHost.IsRoutable() && !fUseProxy)
1943 CAddress addr(addrLocalHost);
1944 addr.nTime = GetAdjustedTime();
1945 pfrom->PushAddress(addr);
1948 // Get recent addresses
1949 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1951 pfrom->PushMessage("getaddr");
1952 pfrom->fGetAddr = true;
1956 // Ask the first connected node for block updates
1957 static int nAskedForBlocks;
1958 if (!pfrom->fClient &&
1959 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1960 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1963 pfrom->PushGetBlocks(pindexBest, uint256(0));
1967 CRITICAL_BLOCK(cs_mapAlerts)
1968 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1969 item.second.RelayTo(pfrom);
1971 pfrom->fSuccessfullyConnected = true;
1973 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1975 cPeerBlockCounts.input(pfrom->nStartingHeight);
1979 else if (pfrom->nVersion == 0)
1981 // Must have a version message before anything else
1982 pfrom->Misbehaving(1);
1987 else if (strCommand == "verack")
1989 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1993 else if (strCommand == "addr")
1995 vector<CAddress> vAddr;
1998 // Don't want addr from older versions unless seeding
1999 if (pfrom->nVersion < 209)
2001 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2003 if (vAddr.size() > 1000)
2005 pfrom->Misbehaving(20);
2006 return error("message addr size() = %d", vAddr.size());
2009 // Store the new addresses
2012 int64 nNow = GetAdjustedTime();
2013 int64 nSince = nNow - 10 * 60;
2014 BOOST_FOREACH(CAddress& addr, vAddr)
2018 // ignore IPv6 for now, since it isn't implemented anyway
2021 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2022 addr.nTime = nNow - 5 * 24 * 60 * 60;
2023 AddAddress(addr, 2 * 60 * 60, &addrDB);
2024 pfrom->AddAddressKnown(addr);
2025 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2027 // Relay to a limited number of other nodes
2028 CRITICAL_BLOCK(cs_vNodes)
2030 // Use deterministic randomness to send to the same nodes for 24 hours
2031 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2032 static uint256 hashSalt;
2034 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2035 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2036 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2037 multimap<uint256, CNode*> mapMix;
2038 BOOST_FOREACH(CNode* pnode, vNodes)
2040 if (pnode->nVersion < 31402)
2042 unsigned int nPointer;
2043 memcpy(&nPointer, &pnode, sizeof(nPointer));
2044 uint256 hashKey = hashRand ^ nPointer;
2045 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2046 mapMix.insert(make_pair(hashKey, pnode));
2048 int nRelayNodes = 2;
2049 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2050 ((*mi).second)->PushAddress(addr);
2054 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2055 if (vAddr.size() < 1000)
2056 pfrom->fGetAddr = false;
2060 else if (strCommand == "inv")
2064 if (vInv.size() > 50000)
2066 pfrom->Misbehaving(20);
2067 return error("message inv size() = %d", vInv.size());
2071 BOOST_FOREACH(const CInv& inv, vInv)
2075 pfrom->AddInventoryKnown(inv);
2077 bool fAlreadyHave = AlreadyHave(txdb, inv);
2079 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2083 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2084 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2086 // Track requests for our stuff
2087 Inventory(inv.hash);
2092 else if (strCommand == "getdata")
2096 if (vInv.size() > 50000)
2098 pfrom->Misbehaving(20);
2099 return error("message getdata size() = %d", vInv.size());
2102 BOOST_FOREACH(const CInv& inv, vInv)
2106 printf("received getdata for: %s\n", inv.ToString().c_str());
2108 if (inv.type == MSG_BLOCK)
2110 // Send block from disk
2111 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2112 if (mi != mapBlockIndex.end())
2115 block.ReadFromDisk((*mi).second);
2116 pfrom->PushMessage("block", block);
2118 // Trigger them to send a getblocks request for the next batch of inventory
2119 if (inv.hash == pfrom->hashContinue)
2121 // Bypass PushInventory, this must send even if redundant,
2122 // and we want it right after the last block so they don't
2123 // wait for other stuff first.
2125 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2126 pfrom->PushMessage("inv", vInv);
2127 pfrom->hashContinue = 0;
2131 else if (inv.IsKnownType())
2133 // Send stream from relay memory
2134 CRITICAL_BLOCK(cs_mapRelay)
2136 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2137 if (mi != mapRelay.end())
2138 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2142 // Track requests for our stuff
2143 Inventory(inv.hash);
2148 else if (strCommand == "getblocks")
2150 CBlockLocator locator;
2152 vRecv >> locator >> hashStop;
2154 // Find the last block the caller has in the main chain
2155 CBlockIndex* pindex = locator.GetBlockIndex();
2157 // Send the rest of the chain
2159 pindex = pindex->pnext;
2160 int nLimit = 500 + locator.GetDistanceBack();
2161 unsigned int nBytes = 0;
2162 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2163 for (; pindex; pindex = pindex->pnext)
2165 if (pindex->GetBlockHash() == hashStop)
2167 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2170 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2172 block.ReadFromDisk(pindex, true);
2173 nBytes += block.GetSerializeSize(SER_NETWORK);
2174 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2176 // When this block is requested, we'll send an inv that'll make them
2177 // getblocks the next batch of inventory.
2178 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2179 pfrom->hashContinue = pindex->GetBlockHash();
2186 else if (strCommand == "getheaders")
2188 CBlockLocator locator;
2190 vRecv >> locator >> hashStop;
2192 CBlockIndex* pindex = NULL;
2193 if (locator.IsNull())
2195 // If locator is null, return the hashStop block
2196 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2197 if (mi == mapBlockIndex.end())
2199 pindex = (*mi).second;
2203 // Find the last block the caller has in the main chain
2204 pindex = locator.GetBlockIndex();
2206 pindex = pindex->pnext;
2209 vector<CBlock> vHeaders;
2210 int nLimit = 2000 + locator.GetDistanceBack();
2211 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2212 for (; pindex; pindex = pindex->pnext)
2214 vHeaders.push_back(pindex->GetBlockHeader());
2215 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2218 pfrom->PushMessage("headers", vHeaders);
2222 else if (strCommand == "tx")
2224 vector<uint256> vWorkQueue;
2225 CDataStream vMsg(vRecv);
2229 CInv inv(MSG_TX, tx.GetHash());
2230 pfrom->AddInventoryKnown(inv);
2232 bool fMissingInputs = false;
2233 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2235 SyncWithWallets(tx, NULL, true);
2236 RelayMessage(inv, vMsg);
2237 mapAlreadyAskedFor.erase(inv);
2238 vWorkQueue.push_back(inv.hash);
2240 // Recursively process any orphan transactions that depended on this one
2241 for (int i = 0; i < vWorkQueue.size(); i++)
2243 uint256 hashPrev = vWorkQueue[i];
2244 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2245 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2248 const CDataStream& vMsg = *((*mi).second);
2250 CDataStream(vMsg) >> tx;
2251 CInv inv(MSG_TX, tx.GetHash());
2253 if (tx.AcceptToMemoryPool(true))
2255 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2256 SyncWithWallets(tx, NULL, true);
2257 RelayMessage(inv, vMsg);
2258 mapAlreadyAskedFor.erase(inv);
2259 vWorkQueue.push_back(inv.hash);
2264 BOOST_FOREACH(uint256 hash, vWorkQueue)
2265 EraseOrphanTx(hash);
2267 else if (fMissingInputs)
2269 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2272 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2276 else if (strCommand == "block")
2281 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2284 CInv inv(MSG_BLOCK, block.GetHash());
2285 pfrom->AddInventoryKnown(inv);
2287 if (ProcessBlock(pfrom, &block))
2288 mapAlreadyAskedFor.erase(inv);
2289 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2293 else if (strCommand == "getaddr")
2295 // Nodes rebroadcast an addr every 24 hours
2296 pfrom->vAddrToSend.clear();
2297 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2298 CRITICAL_BLOCK(cs_mapAddresses)
2300 unsigned int nCount = 0;
2301 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2303 const CAddress& addr = item.second;
2304 if (addr.nTime > nSince)
2307 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2309 const CAddress& addr = item.second;
2310 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2311 pfrom->PushAddress(addr);
2317 else if (strCommand == "checkorder")
2322 if (!GetBoolArg("-allowreceivebyip"))
2324 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2331 /// we have a chance to check the order here
2333 // Keep giving the same key to the same ip until they use it
2334 if (!mapReuseKey.count(pfrom->addr.ip))
2335 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2337 // Send back approval of order and pubkey to use
2338 CScript scriptPubKey;
2339 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2340 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2344 else if (strCommand == "reply")
2349 CRequestTracker tracker;
2350 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2352 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2353 if (mi != pfrom->mapRequests.end())
2355 tracker = (*mi).second;
2356 pfrom->mapRequests.erase(mi);
2359 if (!tracker.IsNull())
2360 tracker.fn(tracker.param1, vRecv);
2364 else if (strCommand == "ping")
2369 else if (strCommand == "alert")
2374 if (alert.ProcessAlert())
2377 pfrom->setKnown.insert(alert.GetHash());
2378 CRITICAL_BLOCK(cs_vNodes)
2379 BOOST_FOREACH(CNode* pnode, vNodes)
2380 alert.RelayTo(pnode);
2387 // Ignore unknown commands for extensibility
2391 // Update the last seen time for this node's address
2392 if (pfrom->fNetworkNode)
2393 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2394 AddressCurrentlyConnected(pfrom->addr);
2400 bool ProcessMessages(CNode* pfrom)
2402 CDataStream& vRecv = pfrom->vRecv;
2406 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2410 // (4) message start
2419 // Scan for message start
2420 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2421 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2422 if (vRecv.end() - pstart < nHeaderSize)
2424 if (vRecv.size() > nHeaderSize)
2426 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2427 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2431 if (pstart - vRecv.begin() > 0)
2432 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2433 vRecv.erase(vRecv.begin(), pstart);
2436 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2441 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2444 string strCommand = hdr.GetCommand();
2447 unsigned int nMessageSize = hdr.nMessageSize;
2448 if (nMessageSize > MAX_SIZE)
2450 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2453 if (nMessageSize > vRecv.size())
2455 // Rewind and wait for rest of message
2456 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2461 if (vRecv.GetVersion() >= 209)
2463 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2464 unsigned int nChecksum = 0;
2465 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2466 if (nChecksum != hdr.nChecksum)
2468 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2469 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2474 // Copy message to its own buffer
2475 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2476 vRecv.ignore(nMessageSize);
2482 CRITICAL_BLOCK(cs_main)
2483 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2487 catch (std::ios_base::failure& e)
2489 if (strstr(e.what(), "end of data"))
2491 // Allow exceptions from underlength message on vRecv
2492 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());
2494 else if (strstr(e.what(), "size too large"))
2496 // Allow exceptions from overlong size
2497 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2501 PrintExceptionContinue(&e, "ProcessMessage()");
2504 catch (std::exception& e) {
2505 PrintExceptionContinue(&e, "ProcessMessage()");
2507 PrintExceptionContinue(NULL, "ProcessMessage()");
2511 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2519 bool SendMessages(CNode* pto, bool fSendTrickle)
2521 CRITICAL_BLOCK(cs_main)
2523 // Don't send anything until we get their version message
2524 if (pto->nVersion == 0)
2528 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2529 pto->PushMessage("ping");
2531 // Resend wallet transactions that haven't gotten in a block yet
2532 ResendWalletTransactions();
2534 // Address refresh broadcast
2535 static int64 nLastRebroadcast;
2536 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2538 nLastRebroadcast = GetTime();
2539 CRITICAL_BLOCK(cs_vNodes)
2541 BOOST_FOREACH(CNode* pnode, vNodes)
2543 // Periodically clear setAddrKnown to allow refresh broadcasts
2544 pnode->setAddrKnown.clear();
2546 // Rebroadcast our address
2547 if (addrLocalHost.IsRoutable() && !fUseProxy)
2549 CAddress addr(addrLocalHost);
2550 addr.nTime = GetAdjustedTime();
2551 pnode->PushAddress(addr);
2557 // Clear out old addresses periodically so it's not too much work at once
2558 static int64 nLastClear;
2559 if (nLastClear == 0)
2560 nLastClear = GetTime();
2561 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2563 nLastClear = GetTime();
2564 CRITICAL_BLOCK(cs_mapAddresses)
2567 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2568 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2569 mi != mapAddresses.end();)
2571 const CAddress& addr = (*mi).second;
2572 if (addr.nTime < nSince)
2574 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2576 addrdb.EraseAddress(addr);
2577 mapAddresses.erase(mi++);
2591 vector<CAddress> vAddr;
2592 vAddr.reserve(pto->vAddrToSend.size());
2593 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2595 // returns true if wasn't already contained in the set
2596 if (pto->setAddrKnown.insert(addr).second)
2598 vAddr.push_back(addr);
2599 // receiver rejects addr messages larger than 1000
2600 if (vAddr.size() >= 1000)
2602 pto->PushMessage("addr", vAddr);
2607 pto->vAddrToSend.clear();
2609 pto->PushMessage("addr", vAddr);
2614 // Message: inventory
2617 vector<CInv> vInvWait;
2618 CRITICAL_BLOCK(pto->cs_inventory)
2620 vInv.reserve(pto->vInventoryToSend.size());
2621 vInvWait.reserve(pto->vInventoryToSend.size());
2622 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2624 if (pto->setInventoryKnown.count(inv))
2627 // trickle out tx inv to protect privacy
2628 if (inv.type == MSG_TX && !fSendTrickle)
2630 // 1/4 of tx invs blast to all immediately
2631 static uint256 hashSalt;
2633 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2634 uint256 hashRand = inv.hash ^ hashSalt;
2635 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2636 bool fTrickleWait = ((hashRand & 3) != 0);
2638 // always trickle our own transactions
2642 if (GetTransaction(inv.hash, wtx))
2644 fTrickleWait = true;
2649 vInvWait.push_back(inv);
2654 // returns true if wasn't already contained in the set
2655 if (pto->setInventoryKnown.insert(inv).second)
2657 vInv.push_back(inv);
2658 if (vInv.size() >= 1000)
2660 pto->PushMessage("inv", vInv);
2665 pto->vInventoryToSend = vInvWait;
2668 pto->PushMessage("inv", vInv);
2674 vector<CInv> vGetData;
2675 int64 nNow = GetTime() * 1000000;
2677 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2679 const CInv& inv = (*pto->mapAskFor.begin()).second;
2680 if (!AlreadyHave(txdb, inv))
2682 printf("sending getdata: %s\n", inv.ToString().c_str());
2683 vGetData.push_back(inv);
2684 if (vGetData.size() >= 1000)
2686 pto->PushMessage("getdata", vGetData);
2690 mapAlreadyAskedFor[inv] = nNow;
2691 pto->mapAskFor.erase(pto->mapAskFor.begin());
2693 if (!vGetData.empty())
2694 pto->PushMessage("getdata", vGetData);
2713 //////////////////////////////////////////////////////////////////////////////
2718 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2720 unsigned char* pdata = (unsigned char*)pbuffer;
2721 unsigned int blocks = 1 + ((len + 8) / 64);
2722 unsigned char* pend = pdata + 64 * blocks;
2723 memset(pdata + len, 0, 64 * blocks - len);
2725 unsigned int bits = len * 8;
2726 pend[-1] = (bits >> 0) & 0xff;
2727 pend[-2] = (bits >> 8) & 0xff;
2728 pend[-3] = (bits >> 16) & 0xff;
2729 pend[-4] = (bits >> 24) & 0xff;
2733 static const unsigned int pSHA256InitState[8] =
2734 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2736 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2739 unsigned char data[64];
2743 for (int i = 0; i < 16; i++)
2744 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2746 for (int i = 0; i < 8; i++)
2747 ctx.h[i] = ((uint32_t*)pinit)[i];
2749 SHA256_Update(&ctx, data, sizeof(data));
2750 for (int i = 0; i < 8; i++)
2751 ((uint32_t*)pstate)[i] = ctx.h[i];
2755 // ScanHash scans nonces looking for a hash with at least some zero bits.
2756 // It operates on big endian data. Caller does the byte reversing.
2757 // All input buffers are 16-byte aligned. nNonce is usually preserved
2758 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2759 // the block is rebuilt and nNonce starts over at zero.
2761 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2763 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2767 // Hash pdata using pmidstate as the starting state into
2768 // preformatted buffer phash1, then hash phash1 into phash
2770 SHA256Transform(phash1, pdata, pmidstate);
2771 SHA256Transform(phash, phash1, pSHA256InitState);
2773 // Return the nonce if the hash has at least some zero bits,
2774 // caller will check if it has enough to reach the target
2775 if (((unsigned short*)phash)[14] == 0)
2778 // If nothing found after trying for a while, return -1
2779 if ((nNonce & 0xffff) == 0)
2781 nHashesDone = 0xffff+1;
2787 // Some explaining would be appreciated
2792 set<uint256> setDependsOn;
2795 COrphan(CTransaction* ptxIn)
2803 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2804 BOOST_FOREACH(uint256 hash, setDependsOn)
2805 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2810 CBlock* CreateNewBlock(CReserveKey& reservekey)
2812 CBlockIndex* pindexPrev = pindexBest;
2815 auto_ptr<CBlock> pblock(new CBlock());
2819 // Create coinbase tx
2821 txNew.vin.resize(1);
2822 txNew.vin[0].prevout.SetNull();
2823 txNew.vout.resize(1);
2824 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2826 // Add our coinbase tx as first transaction
2827 pblock->vtx.push_back(txNew);
2829 // Collect memory pool transactions into the block
2831 CRITICAL_BLOCK(cs_main)
2832 CRITICAL_BLOCK(cs_mapTransactions)
2836 // Priority order to process transactions
2837 list<COrphan> vOrphan; // list memory doesn't move
2838 map<uint256, vector<COrphan*> > mapDependers;
2839 multimap<double, CTransaction*> mapPriority;
2840 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2842 CTransaction& tx = (*mi).second;
2843 if (tx.IsCoinBase() || !tx.IsFinal())
2846 COrphan* porphan = NULL;
2847 double dPriority = 0;
2848 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2850 // Read prev transaction
2851 CTransaction txPrev;
2853 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2855 // Has to wait for dependencies
2858 // Use list for automatic deletion
2859 vOrphan.push_back(COrphan(&tx));
2860 porphan = &vOrphan.back();
2862 mapDependers[txin.prevout.hash].push_back(porphan);
2863 porphan->setDependsOn.insert(txin.prevout.hash);
2866 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2868 // Read block header
2869 int nConf = txindex.GetDepthInMainChain();
2871 dPriority += (double)nValueIn * nConf;
2873 if (fDebug && GetBoolArg("-printpriority"))
2874 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2877 // Priority is sum(valuein * age) / txsize
2878 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2881 porphan->dPriority = dPriority;
2883 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2885 if (fDebug && GetBoolArg("-printpriority"))
2887 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2894 // Collect transactions into block
2895 map<uint256, CTxIndex> mapTestPool;
2896 uint64 nBlockSize = 1000;
2897 int nBlockSigOps = 100;
2898 while (!mapPriority.empty())
2900 // Take highest priority transaction off priority queue
2901 double dPriority = -(*mapPriority.begin()).first;
2902 CTransaction& tx = *(*mapPriority.begin()).second;
2903 mapPriority.erase(mapPriority.begin());
2906 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2907 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2909 int nTxSigOps = tx.GetSigOpCount();
2910 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2914 if (tx.nTime > GetAdjustedTime())
2917 // ppcoin: simplify transaction fee - allow free = false
2918 int64 nMinFee = tx.GetMinFee(nBlockSize, false, true);
2920 // Connecting shouldn't fail due to dependency on other memory pool transactions
2921 // because we're already processing them in order of dependency
2922 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2923 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2925 swap(mapTestPool, mapTestPoolTmp);
2928 pblock->vtx.push_back(tx);
2929 nBlockSize += nTxSize;
2930 nBlockSigOps += nTxSigOps;
2932 // Add transactions that depend on this one to the priority queue
2933 uint256 hash = tx.GetHash();
2934 if (mapDependers.count(hash))
2936 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2938 if (!porphan->setDependsOn.empty())
2940 porphan->setDependsOn.erase(hash);
2941 if (porphan->setDependsOn.empty())
2942 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2948 pblock->nBits = GetNextWorkRequired(pindexPrev);
2949 pblock->vtx[0].vout[0].nValue = GetBlockValue(pblock->nBits, nFees);
2952 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2953 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2954 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2955 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
2956 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
2959 return pblock.release();
2963 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2965 // Update nExtraNonce
2966 static uint256 hashPrevBlock;
2967 if (hashPrevBlock != pblock->hashPrevBlock)
2970 hashPrevBlock = pblock->hashPrevBlock;
2973 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2974 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2978 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2981 // Prebuild hash buffers
2988 uint256 hashPrevBlock;
2989 uint256 hashMerkleRoot;
2992 unsigned int nNonce;
2995 unsigned char pchPadding0[64];
2997 unsigned char pchPadding1[64];
3000 memset(&tmp, 0, sizeof(tmp));
3002 tmp.block.nVersion = pblock->nVersion;
3003 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3004 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3005 tmp.block.nTime = pblock->nTime;
3006 tmp.block.nBits = pblock->nBits;
3007 tmp.block.nNonce = pblock->nNonce;
3009 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3010 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3012 // Byte swap all the input buffer
3013 for (int i = 0; i < sizeof(tmp)/4; i++)
3014 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3016 // Precalc the first half of the first hash, which stays constant
3017 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3019 memcpy(pdata, &tmp.block, 128);
3020 memcpy(phash1, &tmp.hash1, 64);
3024 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3026 uint256 hash = pblock->GetHash();
3027 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3029 if (hash > hashTarget)
3033 printf("BitcoinMiner:\n");
3034 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3036 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3037 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3040 CRITICAL_BLOCK(cs_main)
3042 if (pblock->hashPrevBlock != hashBestChain)
3043 return error("BitcoinMiner : generated block is stale");
3045 // Remove key from key pool
3046 reservekey.KeepKey();
3048 // Track how many getdata requests this block gets
3049 CRITICAL_BLOCK(wallet.cs_wallet)
3050 wallet.mapRequestCount[pblock->GetHash()] = 0;
3052 // Process this block the same as if we had received it from another node
3053 if (!ProcessBlock(NULL, pblock))
3054 return error("BitcoinMiner : ProcessBlock, block not accepted");
3060 void static ThreadBitcoinMiner(void* parg);
3062 void static BitcoinMiner(CWallet *pwallet)
3064 printf("BitcoinMiner started\n");
3065 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3067 // Each thread has its own key and counter
3068 CReserveKey reservekey(pwallet);
3069 unsigned int nExtraNonce = 0;
3071 while (fGenerateBitcoins)
3073 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3077 while (vNodes.empty() || IsInitialBlockDownload())
3082 if (!fGenerateBitcoins)
3090 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3091 CBlockIndex* pindexPrev = pindexBest;
3093 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3096 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3098 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3102 // Prebuild hash buffers
3104 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3105 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3106 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3108 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3110 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3111 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3117 int64 nStart = GetTime();
3118 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3120 uint256& hash = *alignup<16>(hashbuf);
3123 unsigned int nHashesDone = 0;
3124 unsigned int nNonceFound;
3127 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3128 (char*)&hash, nHashesDone);
3130 // Check if something found
3131 if (nNonceFound != -1)
3133 for (int i = 0; i < sizeof(hash)/4; i++)
3134 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3136 if (hash <= hashTarget)
3139 pblock->nNonce = ByteReverse(nNonceFound);
3140 assert(hash == pblock->GetHash());
3142 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3143 CheckWork(pblock.get(), *pwalletMain, reservekey);
3144 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3150 static int64 nHashCounter;
3151 if (nHPSTimerStart == 0)
3153 nHPSTimerStart = GetTimeMillis();
3157 nHashCounter += nHashesDone;
3158 if (GetTimeMillis() - nHPSTimerStart > 4000)
3160 static CCriticalSection cs;
3163 if (GetTimeMillis() - nHPSTimerStart > 4000)
3165 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3166 nHPSTimerStart = GetTimeMillis();
3168 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3169 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3170 static int64 nLogTime;
3171 if (GetTime() - nLogTime > 30 * 60)
3173 nLogTime = GetTime();
3174 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3175 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3181 // Check for stop or if block needs to be rebuilt
3184 if (!fGenerateBitcoins)
3186 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3190 if (nBlockNonce >= 0xffff0000)
3192 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3194 if (pindexPrev != pindexBest)
3197 // Update nTime every few seconds
3198 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3199 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3200 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3201 nBlockTime = ByteReverse(pblock->nTime);
3202 if (pblock->GetBlockTime() >= (int64)pblock->vtx[0].nTime + nMaxClockDrift)
3203 break; // need to update coinbase timestamp
3208 void static ThreadBitcoinMiner(void* parg)
3210 CWallet* pwallet = (CWallet*)parg;
3213 vnThreadsRunning[3]++;
3214 BitcoinMiner(pwallet);
3215 vnThreadsRunning[3]--;
3217 catch (std::exception& e) {
3218 vnThreadsRunning[3]--;
3219 PrintException(&e, "ThreadBitcoinMiner()");
3221 vnThreadsRunning[3]--;
3222 PrintException(NULL, "ThreadBitcoinMiner()");
3224 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3226 if (vnThreadsRunning[3] == 0)
3228 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3232 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3234 if (fGenerateBitcoins != fGenerate)
3236 fGenerateBitcoins = fGenerate;
3237 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3240 if (fGenerateBitcoins)
3242 int nProcessors = boost::thread::hardware_concurrency();
3243 printf("%d processors\n", nProcessors);
3244 if (nProcessors < 1)
3246 if (fLimitProcessors && nProcessors > nLimitProcessors)
3247 nProcessors = nLimitProcessors;
3248 int nAddThreads = nProcessors - vnThreadsRunning[3];
3249 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3250 for (int i = 0; i < nAddThreads; i++)
3252 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3253 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");