1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Copyright (c) 2011-2012 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;
67 int64 nBalanceReserve = 0;
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 for (int i = (IsCoinStake()? 1 : 0); i < vout.size(); i++)
319 const CTxOut& txout = vout[i];
320 if (txout.nValue < 0)
321 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
322 if (txout.nValue > MAX_MONEY)
323 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
324 nValueOut += txout.nValue;
325 if (!MoneyRange(nValueOut))
326 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
329 // Check for duplicate inputs
330 set<COutPoint> vInOutPoints;
331 BOOST_FOREACH(const CTxIn& txin, vin)
333 if (vInOutPoints.count(txin.prevout))
335 vInOutPoints.insert(txin.prevout);
340 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
341 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
345 BOOST_FOREACH(const CTxIn& txin, vin)
346 if (txin.prevout.IsNull())
347 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
353 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
356 *pfMissingInputs = false;
358 if (!CheckTransaction())
359 return error("AcceptToMemoryPool() : CheckTransaction failed");
361 // Coinbase is only valid in a block, not as a loose transaction
363 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
364 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
366 return DoS(100, error("AcceptToMemoryPool() : coinstake as individual tx"));
368 // To help v0.1.5 clients who would see it as a negative number
369 if ((int64)nLockTime > INT_MAX)
370 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
373 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
374 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
375 // attacks disallow transactions with more than one SigOp per 34 bytes.
376 // 34 bytes because a TxOut is:
377 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
378 if (GetSigOpCount() > nSize / 34 || nSize < 100)
379 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
381 // Rather not work on nonstandard transactions (unless -testnet)
382 if (!fTestNet && !IsStandard())
383 return error("AcceptToMemoryPool() : nonstandard transaction type");
385 // Do we already have it?
386 uint256 hash = GetHash();
387 CRITICAL_BLOCK(cs_mapTransactions)
388 if (mapTransactions.count(hash))
391 if (txdb.ContainsTx(hash))
394 // Check for conflicts with in-memory transactions
395 CTransaction* ptxOld = NULL;
396 for (int i = 0; i < vin.size(); i++)
398 COutPoint outpoint = vin[i].prevout;
399 if (mapNextTx.count(outpoint))
401 // Disable replacement feature for now
404 // Allow replacing with a newer version of the same transaction
407 ptxOld = mapNextTx[outpoint].ptx;
408 if (ptxOld->IsFinal())
410 if (!IsNewerThan(*ptxOld))
412 for (int i = 0; i < vin.size(); i++)
414 COutPoint outpoint = vin[i].prevout;
415 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
424 // Check against previous transactions
425 map<uint256, CTxIndex> mapUnused;
427 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
430 *pfMissingInputs = true;
431 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
434 // Don't accept it if it can't get into a block
435 if (nFees < GetMinFee(1000, false, true))
436 return error("AcceptToMemoryPool() : not enough fees");
438 // Continuously rate-limit free transactions
439 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
440 // be annoying or make other's transactions take longer to confirm.
441 if (nFees < MIN_RELAY_TX_FEE)
443 static CCriticalSection cs;
444 static double dFreeCount;
445 static int64 nLastTime;
446 int64 nNow = GetTime();
450 // Use an exponentially decaying ~10-minute window:
451 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
453 // -limitfreerelay unit is thousand-bytes-per-minute
454 // At default rate it would take over a month to fill 1GB
455 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
456 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
458 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
464 // Store transaction in memory
465 CRITICAL_BLOCK(cs_mapTransactions)
469 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
470 ptxOld->RemoveFromMemoryPool();
472 AddToMemoryPoolUnchecked();
475 ///// are we sure this is ok when loading transactions or restoring block txes
476 // If updated, erase old tx from wallet
478 EraseFromWallets(ptxOld->GetHash());
480 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
484 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
487 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
490 bool CTransaction::AddToMemoryPoolUnchecked()
492 // Add to memory pool without checking anything. Don't call this directly,
493 // call AcceptToMemoryPool to properly check the transaction first.
494 CRITICAL_BLOCK(cs_mapTransactions)
496 uint256 hash = GetHash();
497 mapTransactions[hash] = *this;
498 for (int i = 0; i < vin.size(); i++)
499 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
500 nTransactionsUpdated++;
506 bool CTransaction::RemoveFromMemoryPool()
508 // Remove transaction from memory pool
509 CRITICAL_BLOCK(cs_mapTransactions)
511 BOOST_FOREACH(const CTxIn& txin, vin)
512 mapNextTx.erase(txin.prevout);
513 mapTransactions.erase(GetHash());
514 nTransactionsUpdated++;
524 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
526 if (hashBlock == 0 || nIndex == -1)
529 // Find the block it claims to be in
530 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
531 if (mi == mapBlockIndex.end())
533 CBlockIndex* pindex = (*mi).second;
534 if (!pindex || !pindex->IsInMainChain())
537 // Make sure the merkle branch connects to this block
538 if (!fMerkleVerified)
540 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
542 fMerkleVerified = true;
545 nHeightRet = pindex->nHeight;
546 return pindexBest->nHeight - pindex->nHeight + 1;
550 int CMerkleTx::GetBlocksToMaturity() const
552 if (!(IsCoinBase() || IsCoinStake()))
554 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
558 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
562 if (!IsInMainChain() && !ClientConnectInputs())
564 return CTransaction::AcceptToMemoryPool(txdb, false);
568 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
572 bool CMerkleTx::AcceptToMemoryPool()
575 return AcceptToMemoryPool(txdb);
580 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
582 CRITICAL_BLOCK(cs_mapTransactions)
584 // Add previous supporting transactions first
585 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
587 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
589 uint256 hash = tx.GetHash();
590 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
591 tx.AcceptToMemoryPool(txdb, fCheckInputs);
594 return AcceptToMemoryPool(txdb, fCheckInputs);
599 bool CWalletTx::AcceptWalletTransaction()
602 return AcceptWalletTransaction(txdb);
605 int CTxIndex::GetDepthInMainChain() const
609 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
611 // Find the block in the index
612 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
613 if (mi == mapBlockIndex.end())
615 CBlockIndex* pindex = (*mi).second;
616 if (!pindex || !pindex->IsInMainChain())
618 return 1 + nBestHeight - pindex->nHeight;
630 //////////////////////////////////////////////////////////////////////////////
632 // CBlock and CBlockIndex
635 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
637 if (!fReadTransactions)
639 *this = pindex->GetBlockHeader();
642 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
644 if (GetHash() != pindex->GetBlockHash())
645 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
649 uint256 static GetOrphanRoot(const CBlock* pblock)
651 // Work back to the first block in the orphan chain
652 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
653 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
654 return pblock->GetHash();
657 int64 static GetProofOfWorkReward(unsigned int nBits)
659 CBigNum bnSubsidyLimit = 9999 * COIN; // subsidy amount for difficulty 1
661 bnTarget.SetCompact(nBits);
662 CBigNum bnTargetLimit = bnProofOfWorkLimit;
663 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
665 // ppcoin: subsidy is cut in half every 16x multiply of difficulty
666 // A reasonably continuous curve is used to avoid shock to market
667 // (nSubsidyLimit / nSubsidy) ** 4 == bnProofOfWorkLimit / bnTarget
668 CBigNum bnLowerBound = CENT;
669 CBigNum bnUpperBound = bnSubsidyLimit;
670 while (bnLowerBound + CENT <= bnUpperBound)
672 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
673 if (fDebug && GetBoolArg("-printcreation"))
674 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
675 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
676 bnUpperBound = bnMidValue;
678 bnLowerBound = bnMidValue;
681 int64 nSubsidy = bnUpperBound.getuint64();
682 nSubsidy = (nSubsidy / CENT) * CENT;
683 if (fDebug && GetBoolArg("-printcreation"))
684 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
689 // ppcoin: miner's coin stake is rewarded based on coin age spent (coin-days)
690 int64 GetProofOfStakeReward(int64 nCoinAge)
692 static int64 nRewardCoinYear = CENT; // creation amount per coin-year
693 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
694 if (fDebug && GetBoolArg("-printcreation"))
695 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nCoinAge);
699 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
700 static const int64 nTargetSpacing = 10 * 60;
701 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
702 static const int64 nMaxClockDrift = 2 * 60 * 60; // 2 hours
705 // minimum amount of work that could possibly be required nTime after
706 // minimum work required was nBase
708 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
711 bnResult.SetCompact(nBase);
712 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
714 // Maximum 400% adjustment...
716 // ... in best-case exactly 4-times-normal target time
717 nTime -= nTargetTimespan*4;
719 if (bnResult > bnProofOfWorkLimit)
720 bnResult = bnProofOfWorkLimit;
721 return bnResult.GetCompact();
724 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
726 // Genesis block and first block
727 if (pindexLast == NULL || pindexLast->pprev == NULL)
728 return bnProofOfWorkLimit.GetCompact();
730 int64 nActualSpacing = pindexLast->GetBlockTime() - pindexLast->pprev->GetBlockTime();
732 // ppcoin: target change every block
733 // ppcoin: retarget with exponential moving toward target spacing
735 bnNew.SetCompact(pindexLast->nBits);
736 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
737 bnNew /= ((nInterval + 1) * nTargetSpacing);
739 if (bnNew > bnProofOfWorkLimit)
740 bnNew = bnProofOfWorkLimit;
742 return bnNew.GetCompact();
745 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
748 bnTarget.SetCompact(nBits);
751 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
752 return error("CheckProofOfWork() : nBits below minimum work");
754 // Check proof of work matches claimed amount
755 if (hash > bnTarget.getuint256())
756 return error("CheckProofOfWork() : hash doesn't match nBits");
761 // Return maximum amount of blocks that other nodes claim to have
762 int GetNumBlocksOfPeers()
764 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
767 bool IsInitialBlockDownload()
769 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
771 static int64 nLastUpdate;
772 static CBlockIndex* pindexLastBest;
773 if (pindexBest != pindexLastBest)
775 pindexLastBest = pindexBest;
776 nLastUpdate = GetTime();
778 return (GetTime() - nLastUpdate < 10 &&
779 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
782 void static InvalidChainFound(CBlockIndex* pindexNew)
784 if (pindexNew->nChainTrust > nBestInvalidTrust)
786 nBestInvalidTrust = pindexNew->nChainTrust;
787 CTxDB().WriteBestInvalidTrust(nBestInvalidTrust);
790 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());
791 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
792 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
793 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
806 bool CTransaction::DisconnectInputs(CTxDB& txdb)
808 // Relinquish previous transactions' spent pointers
811 BOOST_FOREACH(const CTxIn& txin, vin)
813 COutPoint prevout = txin.prevout;
815 // Get prev txindex from disk
817 if (!txdb.ReadTxIndex(prevout.hash, txindex))
818 return error("DisconnectInputs() : ReadTxIndex failed");
820 if (prevout.n >= txindex.vSpent.size())
821 return error("DisconnectInputs() : prevout.n out of range");
823 // Mark outpoint as not spent
824 txindex.vSpent[prevout.n].SetNull();
827 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
828 return error("DisconnectInputs() : UpdateTxIndex failed");
832 // Remove transaction from index
833 if (!txdb.EraseTxIndex(*this))
834 return error("DisconnectInputs() : EraseTxPos failed");
840 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
841 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
843 // Take over previous transactions' spent pointers
844 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
845 // fMiner is true when called from the internal bitcoin miner
846 // ... both are false when called from CTransaction::AcceptToMemoryPool
850 for (int i = 0; i < vin.size(); i++)
852 COutPoint prevout = vin[i].prevout;
857 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
859 // Get txindex from current proposed changes
860 txindex = mapTestPool[prevout.hash];
864 // Read txindex from txdb
865 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
867 if (!fFound && (fBlock || fMiner))
868 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());
872 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
874 // Get prev tx from single transactions in memory
875 CRITICAL_BLOCK(cs_mapTransactions)
877 if (!mapTransactions.count(prevout.hash))
878 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
879 txPrev = mapTransactions[prevout.hash];
882 txindex.vSpent.resize(txPrev.vout.size());
886 // Get prev tx from disk
887 if (!txPrev.ReadFromDisk(txindex.pos))
888 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
891 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
892 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()));
894 // If prev is coinbase/coinstake, check that it's matured
895 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
896 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
897 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
898 return error("ConnectInputs() : tried to spend coinbase/coinstake at depth %d", pindexBlock->nHeight - pindex->nHeight);
900 // ppcoin: check transaction timestamp
901 if (txPrev.nTime > nTime)
902 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
904 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
905 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
906 // still computed and checked, and any change will be caught at the next checkpoint.
907 if (!(fBlock && IsInitialBlockDownload()))
909 if (!VerifySignature(txPrev, *this, i))
910 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
912 // Check for conflicts (double-spend)
913 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
914 // for an attacker to attempt to split the network.
915 if (!txindex.vSpent[prevout.n].IsNull())
916 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());
918 // Check for negative or overflow input values
919 nValueIn += txPrev.vout[prevout.n].nValue;
920 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
921 return DoS(100, error("ConnectInputs() : txin values out of range"));
923 // Mark outpoints as spent
924 txindex.vSpent[prevout.n] = posThisTx;
927 if (fBlock || fMiner)
929 mapTestPool[prevout.hash] = txindex;
935 // ppcoin: coin stake tx earns reward instead of paying fee
937 if (!GetCoinAge(txdb, nCoinAge))
938 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
939 int64 nStakeReward = GetValueOut() - nValueIn;
940 if (nStakeReward > GetProofOfStakeReward(nCoinAge))
941 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
945 if (nValueIn < GetValueOut())
946 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
948 // Tally transaction fees
949 int64 nTxFee = nValueIn - GetValueOut();
951 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
952 // ppcoin: enforce transaction fees for every block
953 if (nTxFee < nMinFee)
954 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;
956 if (!MoneyRange(nFees))
957 return DoS(100, error("ConnectInputs() : nFees out of range"));
963 // Add transaction to changes
964 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
968 // Add transaction to test pool
969 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
976 bool CTransaction::ClientConnectInputs()
981 // Take over previous transactions' spent pointers
982 CRITICAL_BLOCK(cs_mapTransactions)
985 for (int i = 0; i < vin.size(); i++)
987 // Get prev tx from single transactions in memory
988 COutPoint prevout = vin[i].prevout;
989 if (!mapTransactions.count(prevout.hash))
991 CTransaction& txPrev = mapTransactions[prevout.hash];
993 if (prevout.n >= txPrev.vout.size())
997 if (!VerifySignature(txPrev, *this, i))
998 return error("ConnectInputs() : VerifySignature failed");
1000 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1001 ///// this has to go away now that posNext is gone
1002 // // Check for conflicts
1003 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1004 // return error("ConnectInputs() : prev tx already used");
1006 // // Flag outpoints as used
1007 // txPrev.vout[prevout.n].posNext = posThisTx;
1009 nValueIn += txPrev.vout[prevout.n].nValue;
1011 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1012 return error("ClientConnectInputs() : txin values out of range");
1014 if (GetValueOut() > nValueIn)
1024 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1026 // Disconnect in reverse order
1027 for (int i = vtx.size()-1; i >= 0; i--)
1028 if (!vtx[i].DisconnectInputs(txdb))
1031 // Update block index on disk without changing it in memory.
1032 // The memory index structure will be changed after the db commits.
1035 CDiskBlockIndex blockindexPrev(pindex->pprev);
1036 blockindexPrev.hashNext = 0;
1037 if (!txdb.WriteBlockIndex(blockindexPrev))
1038 return error("DisconnectBlock() : WriteBlockIndex failed");
1044 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1046 // Check it again in case a previous version let a bad block in
1050 //// issue here: it doesn't know the version
1051 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1053 map<uint256, CTxIndex> mapQueuedChanges;
1055 BOOST_FOREACH(CTransaction& tx, vtx)
1057 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1058 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1060 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, tx.GetMinFee()))
1063 // Write queued txindex changes
1064 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1066 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1067 return error("ConnectBlock() : UpdateTxIndex failed");
1070 // ppcoin: fees are not collected by miners as in bitcoin
1071 // ppcoin: fees are destroyed to compensate the entire network
1072 if (vtx[0].GetValueOut() > GetProofOfWorkReward(nBits))
1074 if (fDebug && GetBoolArg("-printcreation"))
1075 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1077 // Update block index on disk without changing it in memory.
1078 // The memory index structure will be changed after the db commits.
1081 CDiskBlockIndex blockindexPrev(pindex->pprev);
1082 blockindexPrev.hashNext = pindex->GetBlockHash();
1083 if (!txdb.WriteBlockIndex(blockindexPrev))
1084 return error("ConnectBlock() : WriteBlockIndex failed");
1087 // Watch for transactions paying to me
1088 BOOST_FOREACH(CTransaction& tx, vtx)
1089 SyncWithWallets(tx, this, true);
1094 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1096 printf("REORGANIZE\n");
1099 CBlockIndex* pfork = pindexBest;
1100 CBlockIndex* plonger = pindexNew;
1101 while (pfork != plonger)
1103 while (plonger->nHeight > pfork->nHeight)
1104 if (!(plonger = plonger->pprev))
1105 return error("Reorganize() : plonger->pprev is null");
1106 if (pfork == plonger)
1108 if (!(pfork = pfork->pprev))
1109 return error("Reorganize() : pfork->pprev is null");
1112 // List of what to disconnect
1113 vector<CBlockIndex*> vDisconnect;
1114 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1115 vDisconnect.push_back(pindex);
1117 // List of what to connect
1118 vector<CBlockIndex*> vConnect;
1119 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1120 vConnect.push_back(pindex);
1121 reverse(vConnect.begin(), vConnect.end());
1123 // Disconnect shorter branch
1124 vector<CTransaction> vResurrect;
1125 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1128 if (!block.ReadFromDisk(pindex))
1129 return error("Reorganize() : ReadFromDisk for disconnect failed");
1130 if (!block.DisconnectBlock(txdb, pindex))
1131 return error("Reorganize() : DisconnectBlock failed");
1133 // Queue memory transactions to resurrect
1134 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1135 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1136 vResurrect.push_back(tx);
1139 // Connect longer branch
1140 vector<CTransaction> vDelete;
1141 for (int i = 0; i < vConnect.size(); i++)
1143 CBlockIndex* pindex = vConnect[i];
1145 if (!block.ReadFromDisk(pindex))
1146 return error("Reorganize() : ReadFromDisk for connect failed");
1147 if (!block.ConnectBlock(txdb, pindex))
1151 return error("Reorganize() : ConnectBlock failed");
1154 // Queue memory transactions to delete
1155 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1156 vDelete.push_back(tx);
1158 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1159 return error("Reorganize() : WriteHashBestChain failed");
1160 if (!txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1161 return error("Reorganize() : WriteAutoCheckpoint failed");
1163 // Make sure it's successfully written to disk before changing memory structure
1164 if (!txdb.TxnCommit())
1165 return error("Reorganize() : TxnCommit failed");
1167 // Disconnect shorter branch
1168 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1170 pindex->pprev->pnext = NULL;
1172 // Connect longer branch
1173 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1175 pindex->pprev->pnext = pindex;
1177 // Resurrect memory transactions that were in the disconnected branch
1178 BOOST_FOREACH(CTransaction& tx, vResurrect)
1179 tx.AcceptToMemoryPool(txdb, false);
1181 // Delete redundant memory transactions that are in the connected branch
1182 BOOST_FOREACH(CTransaction& tx, vDelete)
1183 tx.RemoveFromMemoryPool();
1189 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1191 uint256 hash = GetHash();
1194 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1196 txdb.WriteHashBestChain(hash);
1197 txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint));
1198 if (!txdb.TxnCommit())
1199 return error("SetBestChain() : TxnCommit failed");
1200 pindexGenesisBlock = pindexNew;
1202 else if (hashPrevBlock == hashBestChain)
1204 // Adding to current best branch
1205 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash) || !txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1208 InvalidChainFound(pindexNew);
1209 return error("SetBestChain() : ConnectBlock failed");
1211 if (!txdb.TxnCommit())
1212 return error("SetBestChain() : TxnCommit failed");
1214 // Add to current best branch
1215 pindexNew->pprev->pnext = pindexNew;
1217 // Delete redundant memory transactions
1218 BOOST_FOREACH(CTransaction& tx, vtx)
1219 tx.RemoveFromMemoryPool();
1224 if (!Reorganize(txdb, pindexNew))
1227 InvalidChainFound(pindexNew);
1228 return error("SetBestChain() : Reorganize failed");
1232 // Update best block in wallet (so we can detect restored wallets)
1233 if (!IsInitialBlockDownload())
1235 const CBlockLocator locator(pindexNew);
1236 ::SetBestChain(locator);
1240 hashBestChain = hash;
1241 pindexBest = pindexNew;
1242 nBestHeight = pindexBest->nHeight;
1243 nBestChainTrust = pindexNew->nChainTrust;
1244 nTimeBestReceived = GetTime();
1245 nTransactionsUpdated++;
1246 Checkpoints::AdvanceAutoCheckpoint(pindexBest->nCheckpoint);
1247 printf("SetBestChain: new best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
1253 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1254 // Only those coins last spent at least a week ago count. As those
1255 // transactions not in main chain are not currently indexed so we
1256 // might not find out about their coin age. Older transactions are
1257 // guaranteed to be in main chain by auto checkpoint. This rule is
1258 // introduced to help nodes establish a consistent view of the coin
1259 // age (trust score) of competing branches.
1260 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1262 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1268 BOOST_FOREACH(const CTxIn& txin, vin)
1270 // First try finding the previous transaction in database
1271 CTransaction txPrev;
1273 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1274 continue; // previous transaction not in main chain
1275 if (nTime < txPrev.nTime)
1276 return false; // Transaction timestamp violation
1278 // Read block header
1280 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1281 return false; // unable to read block of previous transaction
1282 if (block.GetBlockTime() + AUTO_CHECKPOINT_TRUST_SPAN > nTime)
1283 continue; // only count coins from at least one week ago
1285 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1286 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1288 if (fDebug && GetBoolArg("-printcoinage"))
1289 printf("coin age nValueIn=%-12I64d nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1292 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1293 if (fDebug && GetBoolArg("-printcoinage"))
1294 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1295 nCoinAge = bnCoinDay.getuint64();
1299 // ppcoin: total coin age spent in block, in the unit of coin-days.
1300 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1305 BOOST_FOREACH(const CTransaction& tx, vtx)
1308 if (tx.GetCoinAge(txdb, nTxCoinAge))
1309 nCoinAge += nTxCoinAge;
1314 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1316 if (fDebug && GetBoolArg("-printcoinage"))
1317 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1322 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1324 // Check for duplicate
1325 uint256 hash = GetHash();
1326 if (mapBlockIndex.count(hash))
1327 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1329 // Construct new block index object
1330 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1332 return error("AddToBlockIndex() : new CBlockIndex failed");
1333 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1335 pindexNew->phashBlock = &((*mi).first);
1336 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1337 if (miPrev != mapBlockIndex.end())
1339 pindexNew->pprev = (*miPrev).second;
1340 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1342 // ppcoin: compute chain checkpoint
1343 pindexNew->nCheckpoint = Checkpoints::GetNextChainCheckpoint(pindexNew->pprev);
1344 assert (pindexNew->nCheckpoint >= pindexNew->pprev->nCheckpoint);
1347 // ppcoin: compute chain trust score
1349 if (!GetCoinAge(nCoinAge))
1350 return error("AddToBlockIndex() : invalid transaction in block");
1351 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + nCoinAge;
1355 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1356 if (!txdb.TxnCommit())
1360 if (pindexNew->nChainTrust > nBestChainTrust)
1361 if (!SetBestChain(txdb, pindexNew))
1366 if (pindexNew == pindexBest)
1368 // Notify UI to display prev block's coinbase if it was ours
1369 static uint256 hashPrevBestCoinBase;
1370 UpdatedTransaction(hashPrevBestCoinBase);
1371 hashPrevBestCoinBase = vtx[0].GetHash();
1381 bool CBlock::CheckBlock() const
1383 // These are checks that are independent of context
1384 // that can be verified before saving an orphan block.
1387 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1388 return DoS(100, error("CheckBlock() : size limits failed"));
1390 // Check proof of work matches claimed amount
1391 if (!CheckProofOfWork(GetHash(), nBits))
1392 return DoS(50, error("CheckBlock() : proof of work failed"));
1395 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
1396 return error("CheckBlock() : block timestamp too far in the future");
1398 // First transaction must be coinbase, the rest must not be
1399 if (vtx.empty() || !vtx[0].IsCoinBase())
1400 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1401 for (int i = 1; i < vtx.size(); i++)
1402 if (vtx[i].IsCoinBase())
1403 return DoS(100, error("CheckBlock() : more than one coinbase"));
1405 // ppcoin: only the second transaction can be the optional coinstake
1406 for (int i = 2; i < vtx.size(); i++)
1407 if (vtx[i].IsCoinStake())
1408 return DoS(100, error("CheckBlock() : coinstake in wrong position"));
1410 // Check coinbase timestamp
1411 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
1412 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
1414 // Check transactions
1415 BOOST_FOREACH(const CTransaction& tx, vtx)
1417 if (!tx.CheckTransaction())
1418 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1419 // ppcoin: check transaction timestamp
1420 if (GetBlockTime() < (int64)tx.nTime)
1421 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1424 // Check that it's not full of nonstandard transactions
1425 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1426 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1429 if (hashMerkleRoot != BuildMerkleTree())
1430 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1435 bool CBlock::AcceptBlock()
1437 // Check for duplicate
1438 uint256 hash = GetHash();
1439 if (mapBlockIndex.count(hash))
1440 return error("AcceptBlock() : block already in mapBlockIndex");
1442 // Get prev block index
1443 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1444 if (mi == mapBlockIndex.end())
1445 return DoS(10, error("AcceptBlock() : prev block not found"));
1446 CBlockIndex* pindexPrev = (*mi).second;
1447 int nHeight = pindexPrev->nHeight+1;
1449 // Check proof of work
1450 if (nBits != GetNextWorkRequired(pindexPrev))
1451 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1453 // Check timestamp against prev
1454 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
1455 return error("AcceptBlock() : block's timestamp is too early");
1457 // Check that all transactions are finalized
1458 BOOST_FOREACH(const CTransaction& tx, vtx)
1459 if (!tx.IsFinal(nHeight, GetBlockTime()))
1460 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1462 // Check that the block chain matches the known block chain up to a hardened checkpoint
1463 if (!Checkpoints::CheckHardened(nHeight, hash))
1464 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1466 // ppcoin: check that the block satisfies automatic checkpoint
1467 if (!Checkpoints::CheckAuto(pindexPrev))
1468 return DoS(100, error("AcceptBlock() : rejected by automatic checkpoint at %d", Checkpoints::nAutoCheckpoint));
1470 // Write block to history file
1471 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1472 return error("AcceptBlock() : out of disk space");
1473 unsigned int nFile = -1;
1474 unsigned int nBlockPos = 0;
1475 if (!WriteToDisk(nFile, nBlockPos))
1476 return error("AcceptBlock() : WriteToDisk failed");
1477 if (!AddToBlockIndex(nFile, nBlockPos))
1478 return error("AcceptBlock() : AddToBlockIndex failed");
1480 // Relay inventory, but don't relay old inventory during initial block download
1481 if (hashBestChain == hash)
1482 CRITICAL_BLOCK(cs_vNodes)
1483 BOOST_FOREACH(CNode* pnode, vNodes)
1484 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1485 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1490 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1492 // Check for duplicate
1493 uint256 hash = pblock->GetHash();
1494 if (mapBlockIndex.count(hash))
1495 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1496 if (mapOrphanBlocks.count(hash))
1497 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1499 // Preliminary checks
1500 if (!pblock->CheckBlock())
1501 return error("ProcessBlock() : CheckBlock FAILED");
1503 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1504 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1506 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1507 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1510 pfrom->Misbehaving(100);
1511 return error("ProcessBlock() : block with timestamp before last checkpoint");
1514 bnNewBlock.SetCompact(pblock->nBits);
1516 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1517 if (bnNewBlock > bnRequired)
1519 pfrom->Misbehaving(100);
1520 return error("ProcessBlock() : block with too little proof-of-work");
1525 // If don't already have its previous block, shunt it off to holding area until we get it
1526 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1528 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1529 CBlock* pblock2 = new CBlock(*pblock);
1530 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1531 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1533 // Ask this guy to fill in what we're missing
1535 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1540 if (!pblock->AcceptBlock())
1541 return error("ProcessBlock() : AcceptBlock FAILED");
1543 // Recursively process any orphan blocks that depended on this one
1544 vector<uint256> vWorkQueue;
1545 vWorkQueue.push_back(hash);
1546 for (int i = 0; i < vWorkQueue.size(); i++)
1548 uint256 hashPrev = vWorkQueue[i];
1549 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1550 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1553 CBlock* pblockOrphan = (*mi).second;
1554 if (pblockOrphan->AcceptBlock())
1555 vWorkQueue.push_back(pblockOrphan->GetHash());
1556 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1557 delete pblockOrphan;
1559 mapOrphanBlocksByPrev.erase(hashPrev);
1562 printf("ProcessBlock: ACCEPTED\n");
1573 bool CheckDiskSpace(uint64 nAdditionalBytes)
1575 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1577 // Check for 15MB because database could create another 10MB log file at any time
1578 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1581 string strMessage = _("Warning: Disk space is low ");
1582 strMiscWarning = strMessage;
1583 printf("*** %s\n", strMessage.c_str());
1584 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1585 CreateThread(Shutdown, NULL);
1591 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1595 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1598 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1600 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1609 static unsigned int nCurrentBlockFile = 1;
1611 FILE* AppendBlockFile(unsigned int& nFileRet)
1616 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1619 if (fseek(file, 0, SEEK_END) != 0)
1621 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1622 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1624 nFileRet = nCurrentBlockFile;
1628 nCurrentBlockFile++;
1632 bool LoadBlockIndex(bool fAllowNew)
1636 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1637 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1638 pchMessageStart[0] = 0xfa;
1639 pchMessageStart[1] = 0xbf;
1640 pchMessageStart[2] = 0xb5;
1641 pchMessageStart[3] = 0xda;
1648 if (!txdb.LoadBlockIndex())
1653 // Init with genesis block
1655 if (mapBlockIndex.empty())
1661 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1662 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1663 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1664 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1665 // vMerkleTree: 4a5e1e
1668 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1670 txNew.nTime = 1325878371;
1671 txNew.vin.resize(1);
1672 txNew.vout.resize(1);
1673 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1674 txNew.vout[0].nValue = GetProofOfWorkReward(bnProofOfWorkLimit.GetCompact());
1675 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1677 block.vtx.push_back(txNew);
1678 block.hashPrevBlock = 0;
1679 block.hashMerkleRoot = block.BuildMerkleTree();
1681 block.nTime = 1325882536;
1682 block.nBits = bnProofOfWorkLimit.GetCompact();
1683 block.nNonce = 2081920190;
1687 block.nTime = 1296688602;
1688 block.nBits = 0x1d07fff8;
1689 block.nNonce = 384568319;
1693 printf("%s\n", block.GetHash().ToString().c_str());
1694 printf("%s\n", hashGenesisBlock.ToString().c_str());
1695 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1696 assert(block.hashMerkleRoot == uint256("0xc7311b56de266580cca65be108ae53d7100b5c3b17da8b1106044103abd7a521"));
1698 assert(block.GetHash() == hashGenesisBlock);
1700 // Start new block file
1702 unsigned int nBlockPos;
1703 if (!block.WriteToDisk(nFile, nBlockPos))
1704 return error("LoadBlockIndex() : writing genesis block to disk failed");
1705 if (!block.AddToBlockIndex(nFile, nBlockPos))
1706 return error("LoadBlockIndex() : genesis block not accepted");
1714 void PrintBlockTree()
1716 // precompute tree structure
1717 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1718 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1720 CBlockIndex* pindex = (*mi).second;
1721 mapNext[pindex->pprev].push_back(pindex);
1723 //while (rand() % 3 == 0)
1724 // mapNext[pindex->pprev].push_back(pindex);
1727 vector<pair<int, CBlockIndex*> > vStack;
1728 vStack.push_back(make_pair(0, pindexGenesisBlock));
1731 while (!vStack.empty())
1733 int nCol = vStack.back().first;
1734 CBlockIndex* pindex = vStack.back().second;
1737 // print split or gap
1738 if (nCol > nPrevCol)
1740 for (int i = 0; i < nCol-1; i++)
1744 else if (nCol < nPrevCol)
1746 for (int i = 0; i < nCol; i++)
1753 for (int i = 0; i < nCol; i++)
1758 block.ReadFromDisk(pindex);
1759 printf("%d (%u,%u) %s %s tx %d",
1763 block.GetHash().ToString().substr(0,20).c_str(),
1764 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1767 PrintWallets(block);
1769 // put the main timechain first
1770 vector<CBlockIndex*>& vNext = mapNext[pindex];
1771 for (int i = 0; i < vNext.size(); i++)
1773 if (vNext[i]->pnext)
1775 swap(vNext[0], vNext[i]);
1781 for (int i = 0; i < vNext.size(); i++)
1782 vStack.push_back(make_pair(nCol+i, vNext[i]));
1795 //////////////////////////////////////////////////////////////////////////////
1800 map<uint256, CAlert> mapAlerts;
1801 CCriticalSection cs_mapAlerts;
1803 string GetWarnings(string strFor)
1806 string strStatusBar;
1808 if (GetBoolArg("-testsafemode"))
1811 // Misc warnings like out of disk space and clock is wrong
1812 if (strMiscWarning != "")
1815 strStatusBar = strMiscWarning;
1818 // Longer invalid proof-of-work chain
1819 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
1822 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1826 CRITICAL_BLOCK(cs_mapAlerts)
1828 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1830 const CAlert& alert = item.second;
1831 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1833 nPriority = alert.nPriority;
1834 strStatusBar = alert.strStatusBar;
1839 if (strFor == "statusbar")
1840 return strStatusBar;
1841 else if (strFor == "rpc")
1843 assert(!"GetWarnings() : invalid parameter");
1847 bool CAlert::ProcessAlert()
1849 if (!CheckSignature())
1854 CRITICAL_BLOCK(cs_mapAlerts)
1856 // Cancel previous alerts
1857 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1859 const CAlert& alert = (*mi).second;
1862 printf("cancelling alert %d\n", alert.nID);
1863 mapAlerts.erase(mi++);
1865 else if (!alert.IsInEffect())
1867 printf("expiring alert %d\n", alert.nID);
1868 mapAlerts.erase(mi++);
1874 // Check if this alert has been cancelled
1875 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1877 const CAlert& alert = item.second;
1878 if (alert.Cancels(*this))
1880 printf("alert already cancelled by %d\n", alert.nID);
1886 mapAlerts.insert(make_pair(GetHash(), *this));
1889 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1901 //////////////////////////////////////////////////////////////////////////////
1907 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1911 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1912 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1914 // Don't know what it is, just say we already got one
1921 // The message start string is designed to be unlikely to occur in normal data.
1922 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1923 // a large 4-byte int at any alignment.
1924 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1927 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1929 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1930 RandAddSeedPerfmon();
1932 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1933 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1935 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1937 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1945 if (strCommand == "version")
1947 // Each connection can only send one version message
1948 if (pfrom->nVersion != 0)
1950 pfrom->Misbehaving(1);
1958 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1959 if (pfrom->nVersion == 10300)
1960 pfrom->nVersion = 300;
1961 if (pfrom->nVersion >= 106 && !vRecv.empty())
1962 vRecv >> addrFrom >> nNonce;
1963 if (pfrom->nVersion >= 106 && !vRecv.empty())
1964 vRecv >> pfrom->strSubVer;
1965 if (pfrom->nVersion >= 209 && !vRecv.empty())
1966 vRecv >> pfrom->nStartingHeight;
1968 if (pfrom->nVersion == 0)
1971 // Disconnect if we connected to ourself
1972 if (nNonce == nLocalHostNonce && nNonce > 1)
1974 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1975 pfrom->fDisconnect = true;
1979 // Be shy and don't send version until we hear
1980 if (pfrom->fInbound)
1981 pfrom->PushVersion();
1983 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1985 AddTimeData(pfrom->addr.ip, nTime);
1988 if (pfrom->nVersion >= 209)
1989 pfrom->PushMessage("verack");
1990 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1991 if (pfrom->nVersion < 209)
1992 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1994 if (!pfrom->fInbound)
1996 // Advertise our address
1997 if (addrLocalHost.IsRoutable() && !fUseProxy)
1999 CAddress addr(addrLocalHost);
2000 addr.nTime = GetAdjustedTime();
2001 pfrom->PushAddress(addr);
2004 // Get recent addresses
2005 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2007 pfrom->PushMessage("getaddr");
2008 pfrom->fGetAddr = true;
2012 // Ask the first connected node for block updates
2013 static int nAskedForBlocks;
2014 if (!pfrom->fClient &&
2015 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2016 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2019 pfrom->PushGetBlocks(pindexBest, uint256(0));
2023 CRITICAL_BLOCK(cs_mapAlerts)
2024 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2025 item.second.RelayTo(pfrom);
2027 pfrom->fSuccessfullyConnected = true;
2029 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2031 cPeerBlockCounts.input(pfrom->nStartingHeight);
2035 else if (pfrom->nVersion == 0)
2037 // Must have a version message before anything else
2038 pfrom->Misbehaving(1);
2043 else if (strCommand == "verack")
2045 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2049 else if (strCommand == "addr")
2051 vector<CAddress> vAddr;
2054 // Don't want addr from older versions unless seeding
2055 if (pfrom->nVersion < 209)
2057 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2059 if (vAddr.size() > 1000)
2061 pfrom->Misbehaving(20);
2062 return error("message addr size() = %d", vAddr.size());
2065 // Store the new addresses
2068 int64 nNow = GetAdjustedTime();
2069 int64 nSince = nNow - 10 * 60;
2070 BOOST_FOREACH(CAddress& addr, vAddr)
2074 // ignore IPv6 for now, since it isn't implemented anyway
2077 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2078 addr.nTime = nNow - 5 * 24 * 60 * 60;
2079 AddAddress(addr, 2 * 60 * 60, &addrDB);
2080 pfrom->AddAddressKnown(addr);
2081 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2083 // Relay to a limited number of other nodes
2084 CRITICAL_BLOCK(cs_vNodes)
2086 // Use deterministic randomness to send to the same nodes for 24 hours
2087 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2088 static uint256 hashSalt;
2090 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2091 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2092 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2093 multimap<uint256, CNode*> mapMix;
2094 BOOST_FOREACH(CNode* pnode, vNodes)
2096 if (pnode->nVersion < 31402)
2098 unsigned int nPointer;
2099 memcpy(&nPointer, &pnode, sizeof(nPointer));
2100 uint256 hashKey = hashRand ^ nPointer;
2101 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2102 mapMix.insert(make_pair(hashKey, pnode));
2104 int nRelayNodes = 2;
2105 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2106 ((*mi).second)->PushAddress(addr);
2110 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2111 if (vAddr.size() < 1000)
2112 pfrom->fGetAddr = false;
2116 else if (strCommand == "inv")
2120 if (vInv.size() > 50000)
2122 pfrom->Misbehaving(20);
2123 return error("message inv size() = %d", vInv.size());
2127 BOOST_FOREACH(const CInv& inv, vInv)
2131 pfrom->AddInventoryKnown(inv);
2133 bool fAlreadyHave = AlreadyHave(txdb, inv);
2135 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2139 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2140 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2142 // Track requests for our stuff
2143 Inventory(inv.hash);
2148 else if (strCommand == "getdata")
2152 if (vInv.size() > 50000)
2154 pfrom->Misbehaving(20);
2155 return error("message getdata size() = %d", vInv.size());
2158 BOOST_FOREACH(const CInv& inv, vInv)
2162 printf("received getdata for: %s\n", inv.ToString().c_str());
2164 if (inv.type == MSG_BLOCK)
2166 // Send block from disk
2167 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2168 if (mi != mapBlockIndex.end())
2171 block.ReadFromDisk((*mi).second);
2172 pfrom->PushMessage("block", block);
2174 // Trigger them to send a getblocks request for the next batch of inventory
2175 if (inv.hash == pfrom->hashContinue)
2177 // Bypass PushInventory, this must send even if redundant,
2178 // and we want it right after the last block so they don't
2179 // wait for other stuff first.
2181 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2182 pfrom->PushMessage("inv", vInv);
2183 pfrom->hashContinue = 0;
2187 else if (inv.IsKnownType())
2189 // Send stream from relay memory
2190 CRITICAL_BLOCK(cs_mapRelay)
2192 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2193 if (mi != mapRelay.end())
2194 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2198 // Track requests for our stuff
2199 Inventory(inv.hash);
2204 else if (strCommand == "getblocks")
2206 CBlockLocator locator;
2208 vRecv >> locator >> hashStop;
2210 // Find the last block the caller has in the main chain
2211 CBlockIndex* pindex = locator.GetBlockIndex();
2213 // Send the rest of the chain
2215 pindex = pindex->pnext;
2216 int nLimit = 500 + locator.GetDistanceBack();
2217 unsigned int nBytes = 0;
2218 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2219 for (; pindex; pindex = pindex->pnext)
2221 if (pindex->GetBlockHash() == hashStop)
2223 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2226 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2228 block.ReadFromDisk(pindex, true);
2229 nBytes += block.GetSerializeSize(SER_NETWORK);
2230 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2232 // When this block is requested, we'll send an inv that'll make them
2233 // getblocks the next batch of inventory.
2234 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2235 pfrom->hashContinue = pindex->GetBlockHash();
2242 else if (strCommand == "getheaders")
2244 CBlockLocator locator;
2246 vRecv >> locator >> hashStop;
2248 CBlockIndex* pindex = NULL;
2249 if (locator.IsNull())
2251 // If locator is null, return the hashStop block
2252 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2253 if (mi == mapBlockIndex.end())
2255 pindex = (*mi).second;
2259 // Find the last block the caller has in the main chain
2260 pindex = locator.GetBlockIndex();
2262 pindex = pindex->pnext;
2265 vector<CBlock> vHeaders;
2266 int nLimit = 2000 + locator.GetDistanceBack();
2267 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2268 for (; pindex; pindex = pindex->pnext)
2270 vHeaders.push_back(pindex->GetBlockHeader());
2271 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2274 pfrom->PushMessage("headers", vHeaders);
2278 else if (strCommand == "tx")
2280 vector<uint256> vWorkQueue;
2281 CDataStream vMsg(vRecv);
2285 CInv inv(MSG_TX, tx.GetHash());
2286 pfrom->AddInventoryKnown(inv);
2288 bool fMissingInputs = false;
2289 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2291 SyncWithWallets(tx, NULL, true);
2292 RelayMessage(inv, vMsg);
2293 mapAlreadyAskedFor.erase(inv);
2294 vWorkQueue.push_back(inv.hash);
2296 // Recursively process any orphan transactions that depended on this one
2297 for (int i = 0; i < vWorkQueue.size(); i++)
2299 uint256 hashPrev = vWorkQueue[i];
2300 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2301 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2304 const CDataStream& vMsg = *((*mi).second);
2306 CDataStream(vMsg) >> tx;
2307 CInv inv(MSG_TX, tx.GetHash());
2309 if (tx.AcceptToMemoryPool(true))
2311 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2312 SyncWithWallets(tx, NULL, true);
2313 RelayMessage(inv, vMsg);
2314 mapAlreadyAskedFor.erase(inv);
2315 vWorkQueue.push_back(inv.hash);
2320 BOOST_FOREACH(uint256 hash, vWorkQueue)
2321 EraseOrphanTx(hash);
2323 else if (fMissingInputs)
2325 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2328 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2332 else if (strCommand == "block")
2337 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2340 CInv inv(MSG_BLOCK, block.GetHash());
2341 pfrom->AddInventoryKnown(inv);
2343 if (ProcessBlock(pfrom, &block))
2344 mapAlreadyAskedFor.erase(inv);
2345 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2349 else if (strCommand == "getaddr")
2351 // Nodes rebroadcast an addr every 24 hours
2352 pfrom->vAddrToSend.clear();
2353 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2354 CRITICAL_BLOCK(cs_mapAddresses)
2356 unsigned int nCount = 0;
2357 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2359 const CAddress& addr = item.second;
2360 if (addr.nTime > nSince)
2363 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2365 const CAddress& addr = item.second;
2366 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2367 pfrom->PushAddress(addr);
2373 else if (strCommand == "checkorder")
2378 if (!GetBoolArg("-allowreceivebyip"))
2380 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2387 /// we have a chance to check the order here
2389 // Keep giving the same key to the same ip until they use it
2390 if (!mapReuseKey.count(pfrom->addr.ip))
2391 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2393 // Send back approval of order and pubkey to use
2394 CScript scriptPubKey;
2395 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2396 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2400 else if (strCommand == "reply")
2405 CRequestTracker tracker;
2406 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2408 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2409 if (mi != pfrom->mapRequests.end())
2411 tracker = (*mi).second;
2412 pfrom->mapRequests.erase(mi);
2415 if (!tracker.IsNull())
2416 tracker.fn(tracker.param1, vRecv);
2420 else if (strCommand == "ping")
2425 else if (strCommand == "alert")
2430 if (alert.ProcessAlert())
2433 pfrom->setKnown.insert(alert.GetHash());
2434 CRITICAL_BLOCK(cs_vNodes)
2435 BOOST_FOREACH(CNode* pnode, vNodes)
2436 alert.RelayTo(pnode);
2443 // Ignore unknown commands for extensibility
2447 // Update the last seen time for this node's address
2448 if (pfrom->fNetworkNode)
2449 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2450 AddressCurrentlyConnected(pfrom->addr);
2456 bool ProcessMessages(CNode* pfrom)
2458 CDataStream& vRecv = pfrom->vRecv;
2462 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2466 // (4) message start
2475 // Scan for message start
2476 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2477 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2478 if (vRecv.end() - pstart < nHeaderSize)
2480 if (vRecv.size() > nHeaderSize)
2482 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2483 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2487 if (pstart - vRecv.begin() > 0)
2488 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2489 vRecv.erase(vRecv.begin(), pstart);
2492 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2497 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2500 string strCommand = hdr.GetCommand();
2503 unsigned int nMessageSize = hdr.nMessageSize;
2504 if (nMessageSize > MAX_SIZE)
2506 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2509 if (nMessageSize > vRecv.size())
2511 // Rewind and wait for rest of message
2512 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2517 if (vRecv.GetVersion() >= 209)
2519 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2520 unsigned int nChecksum = 0;
2521 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2522 if (nChecksum != hdr.nChecksum)
2524 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2525 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2530 // Copy message to its own buffer
2531 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2532 vRecv.ignore(nMessageSize);
2538 CRITICAL_BLOCK(cs_main)
2539 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2543 catch (std::ios_base::failure& e)
2545 if (strstr(e.what(), "end of data"))
2547 // Allow exceptions from underlength message on vRecv
2548 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());
2550 else if (strstr(e.what(), "size too large"))
2552 // Allow exceptions from overlong size
2553 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2557 PrintExceptionContinue(&e, "ProcessMessage()");
2560 catch (std::exception& e) {
2561 PrintExceptionContinue(&e, "ProcessMessage()");
2563 PrintExceptionContinue(NULL, "ProcessMessage()");
2567 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2575 bool SendMessages(CNode* pto, bool fSendTrickle)
2577 CRITICAL_BLOCK(cs_main)
2579 // Don't send anything until we get their version message
2580 if (pto->nVersion == 0)
2584 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2585 pto->PushMessage("ping");
2587 // Resend wallet transactions that haven't gotten in a block yet
2588 ResendWalletTransactions();
2590 // Address refresh broadcast
2591 static int64 nLastRebroadcast;
2592 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2594 nLastRebroadcast = GetTime();
2595 CRITICAL_BLOCK(cs_vNodes)
2597 BOOST_FOREACH(CNode* pnode, vNodes)
2599 // Periodically clear setAddrKnown to allow refresh broadcasts
2600 pnode->setAddrKnown.clear();
2602 // Rebroadcast our address
2603 if (addrLocalHost.IsRoutable() && !fUseProxy)
2605 CAddress addr(addrLocalHost);
2606 addr.nTime = GetAdjustedTime();
2607 pnode->PushAddress(addr);
2613 // Clear out old addresses periodically so it's not too much work at once
2614 static int64 nLastClear;
2615 if (nLastClear == 0)
2616 nLastClear = GetTime();
2617 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2619 nLastClear = GetTime();
2620 CRITICAL_BLOCK(cs_mapAddresses)
2623 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2624 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2625 mi != mapAddresses.end();)
2627 const CAddress& addr = (*mi).second;
2628 if (addr.nTime < nSince)
2630 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2632 addrdb.EraseAddress(addr);
2633 mapAddresses.erase(mi++);
2647 vector<CAddress> vAddr;
2648 vAddr.reserve(pto->vAddrToSend.size());
2649 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2651 // returns true if wasn't already contained in the set
2652 if (pto->setAddrKnown.insert(addr).second)
2654 vAddr.push_back(addr);
2655 // receiver rejects addr messages larger than 1000
2656 if (vAddr.size() >= 1000)
2658 pto->PushMessage("addr", vAddr);
2663 pto->vAddrToSend.clear();
2665 pto->PushMessage("addr", vAddr);
2670 // Message: inventory
2673 vector<CInv> vInvWait;
2674 CRITICAL_BLOCK(pto->cs_inventory)
2676 vInv.reserve(pto->vInventoryToSend.size());
2677 vInvWait.reserve(pto->vInventoryToSend.size());
2678 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2680 if (pto->setInventoryKnown.count(inv))
2683 // trickle out tx inv to protect privacy
2684 if (inv.type == MSG_TX && !fSendTrickle)
2686 // 1/4 of tx invs blast to all immediately
2687 static uint256 hashSalt;
2689 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2690 uint256 hashRand = inv.hash ^ hashSalt;
2691 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2692 bool fTrickleWait = ((hashRand & 3) != 0);
2694 // always trickle our own transactions
2698 if (GetTransaction(inv.hash, wtx))
2700 fTrickleWait = true;
2705 vInvWait.push_back(inv);
2710 // returns true if wasn't already contained in the set
2711 if (pto->setInventoryKnown.insert(inv).second)
2713 vInv.push_back(inv);
2714 if (vInv.size() >= 1000)
2716 pto->PushMessage("inv", vInv);
2721 pto->vInventoryToSend = vInvWait;
2724 pto->PushMessage("inv", vInv);
2730 vector<CInv> vGetData;
2731 int64 nNow = GetTime() * 1000000;
2733 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2735 const CInv& inv = (*pto->mapAskFor.begin()).second;
2736 if (!AlreadyHave(txdb, inv))
2738 printf("sending getdata: %s\n", inv.ToString().c_str());
2739 vGetData.push_back(inv);
2740 if (vGetData.size() >= 1000)
2742 pto->PushMessage("getdata", vGetData);
2746 mapAlreadyAskedFor[inv] = nNow;
2747 pto->mapAskFor.erase(pto->mapAskFor.begin());
2749 if (!vGetData.empty())
2750 pto->PushMessage("getdata", vGetData);
2769 //////////////////////////////////////////////////////////////////////////////
2774 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2776 unsigned char* pdata = (unsigned char*)pbuffer;
2777 unsigned int blocks = 1 + ((len + 8) / 64);
2778 unsigned char* pend = pdata + 64 * blocks;
2779 memset(pdata + len, 0, 64 * blocks - len);
2781 unsigned int bits = len * 8;
2782 pend[-1] = (bits >> 0) & 0xff;
2783 pend[-2] = (bits >> 8) & 0xff;
2784 pend[-3] = (bits >> 16) & 0xff;
2785 pend[-4] = (bits >> 24) & 0xff;
2789 static const unsigned int pSHA256InitState[8] =
2790 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2792 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2795 unsigned char data[64];
2799 for (int i = 0; i < 16; i++)
2800 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2802 for (int i = 0; i < 8; i++)
2803 ctx.h[i] = ((uint32_t*)pinit)[i];
2805 SHA256_Update(&ctx, data, sizeof(data));
2806 for (int i = 0; i < 8; i++)
2807 ((uint32_t*)pstate)[i] = ctx.h[i];
2811 // ScanHash scans nonces looking for a hash with at least some zero bits.
2812 // It operates on big endian data. Caller does the byte reversing.
2813 // All input buffers are 16-byte aligned. nNonce is usually preserved
2814 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2815 // the block is rebuilt and nNonce starts over at zero.
2817 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2819 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2823 // Hash pdata using pmidstate as the starting state into
2824 // preformatted buffer phash1, then hash phash1 into phash
2826 SHA256Transform(phash1, pdata, pmidstate);
2827 SHA256Transform(phash, phash1, pSHA256InitState);
2829 // Return the nonce if the hash has at least some zero bits,
2830 // caller will check if it has enough to reach the target
2831 if (((unsigned short*)phash)[14] == 0)
2834 // If nothing found after trying for a while, return -1
2835 if ((nNonce & 0xffff) == 0)
2837 nHashesDone = 0xffff+1;
2843 // Some explaining would be appreciated
2848 set<uint256> setDependsOn;
2851 COrphan(CTransaction* ptxIn)
2859 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2860 BOOST_FOREACH(uint256 hash, setDependsOn)
2861 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2866 CBlock* CreateNewBlock(CWallet* pwallet)
2868 CBlockIndex* pindexPrev = pindexBest;
2869 CReserveKey reservekey(pwallet);
2872 auto_ptr<CBlock> pblock(new CBlock());
2876 // Create coinbase tx
2878 txNew.vin.resize(1);
2879 txNew.vin[0].prevout.SetNull();
2880 txNew.vout.resize(1);
2881 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2883 // Add our coinbase tx as first transaction
2884 pblock->vtx.push_back(txNew);
2886 // ppcoin: if coinstake available add coinstake tx
2887 CTransaction txCoinStake;
2888 if (pwallet->CreateCoinStake(txNew.vout[0].scriptPubKey, txCoinStake))
2889 pblock->vtx.push_back(txCoinStake);
2891 // Collect memory pool transactions into the block
2893 CRITICAL_BLOCK(cs_main)
2894 CRITICAL_BLOCK(cs_mapTransactions)
2898 // Priority order to process transactions
2899 list<COrphan> vOrphan; // list memory doesn't move
2900 map<uint256, vector<COrphan*> > mapDependers;
2901 multimap<double, CTransaction*> mapPriority;
2902 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2904 CTransaction& tx = (*mi).second;
2905 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
2908 COrphan* porphan = NULL;
2909 double dPriority = 0;
2910 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2912 // Read prev transaction
2913 CTransaction txPrev;
2915 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2917 // Has to wait for dependencies
2920 // Use list for automatic deletion
2921 vOrphan.push_back(COrphan(&tx));
2922 porphan = &vOrphan.back();
2924 mapDependers[txin.prevout.hash].push_back(porphan);
2925 porphan->setDependsOn.insert(txin.prevout.hash);
2928 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2930 // Read block header
2931 int nConf = txindex.GetDepthInMainChain();
2933 dPriority += (double)nValueIn * nConf;
2935 if (fDebug && GetBoolArg("-printpriority"))
2936 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2939 // Priority is sum(valuein * age) / txsize
2940 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2943 porphan->dPriority = dPriority;
2945 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2947 if (fDebug && GetBoolArg("-printpriority"))
2949 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2956 // Collect transactions into block
2957 map<uint256, CTxIndex> mapTestPool;
2958 uint64 nBlockSize = 1000;
2959 int nBlockSigOps = 100;
2960 while (!mapPriority.empty())
2962 // Take highest priority transaction off priority queue
2963 double dPriority = -(*mapPriority.begin()).first;
2964 CTransaction& tx = *(*mapPriority.begin()).second;
2965 mapPriority.erase(mapPriority.begin());
2968 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2969 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2971 int nTxSigOps = tx.GetSigOpCount();
2972 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2976 if (tx.nTime > GetAdjustedTime())
2979 // ppcoin: simplify transaction fee - allow free = false
2980 int64 nMinFee = tx.GetMinFee(nBlockSize, false, true);
2982 // Connecting shouldn't fail due to dependency on other memory pool transactions
2983 // because we're already processing them in order of dependency
2984 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2985 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2987 swap(mapTestPool, mapTestPoolTmp);
2990 pblock->vtx.push_back(tx);
2991 nBlockSize += nTxSize;
2992 nBlockSigOps += nTxSigOps;
2994 // Add transactions that depend on this one to the priority queue
2995 uint256 hash = tx.GetHash();
2996 if (mapDependers.count(hash))
2998 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3000 if (!porphan->setDependsOn.empty())
3002 porphan->setDependsOn.erase(hash);
3003 if (porphan->setDependsOn.empty())
3004 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3010 pblock->nBits = GetNextWorkRequired(pindexPrev);
3011 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
3014 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3015 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3016 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3017 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3018 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3021 return pblock.release();
3025 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3027 // Update nExtraNonce
3028 static uint256 hashPrevBlock;
3029 if (hashPrevBlock != pblock->hashPrevBlock)
3032 hashPrevBlock = pblock->hashPrevBlock;
3035 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3036 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3040 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3043 // Prebuild hash buffers
3050 uint256 hashPrevBlock;
3051 uint256 hashMerkleRoot;
3054 unsigned int nNonce;
3057 unsigned char pchPadding0[64];
3059 unsigned char pchPadding1[64];
3062 memset(&tmp, 0, sizeof(tmp));
3064 tmp.block.nVersion = pblock->nVersion;
3065 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3066 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3067 tmp.block.nTime = pblock->nTime;
3068 tmp.block.nBits = pblock->nBits;
3069 tmp.block.nNonce = pblock->nNonce;
3071 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3072 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3074 // Byte swap all the input buffer
3075 for (int i = 0; i < sizeof(tmp)/4; i++)
3076 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3078 // Precalc the first half of the first hash, which stays constant
3079 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3081 memcpy(pdata, &tmp.block, 128);
3082 memcpy(phash1, &tmp.hash1, 64);
3086 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3088 uint256 hash = pblock->GetHash();
3089 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3091 if (hash > hashTarget)
3095 printf("BitcoinMiner:\n");
3096 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3098 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3099 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3102 CRITICAL_BLOCK(cs_main)
3104 if (pblock->hashPrevBlock != hashBestChain)
3105 return error("BitcoinMiner : generated block is stale");
3107 // Remove key from key pool
3108 reservekey.KeepKey();
3110 // Track how many getdata requests this block gets
3111 CRITICAL_BLOCK(wallet.cs_wallet)
3112 wallet.mapRequestCount[pblock->GetHash()] = 0;
3114 // Process this block the same as if we had received it from another node
3115 if (!ProcessBlock(NULL, pblock))
3116 return error("BitcoinMiner : ProcessBlock, block not accepted");
3122 void static ThreadBitcoinMiner(void* parg);
3124 void static BitcoinMiner(CWallet *pwallet)
3126 printf("BitcoinMiner started\n");
3127 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3129 // Each thread has its own key and counter
3130 CReserveKey reservekey(pwallet);
3131 unsigned int nExtraNonce = 0;
3133 while (fGenerateBitcoins)
3135 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3139 while (vNodes.empty() || IsInitialBlockDownload())
3144 if (!fGenerateBitcoins)
3152 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3153 CBlockIndex* pindexPrev = pindexBest;
3155 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet));
3158 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3160 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3164 // Prebuild hash buffers
3166 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3167 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3168 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3170 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3172 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3173 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3179 int64 nStart = GetTime();
3180 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3182 uint256& hash = *alignup<16>(hashbuf);
3185 unsigned int nHashesDone = 0;
3186 unsigned int nNonceFound;
3189 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3190 (char*)&hash, nHashesDone);
3192 // Check if something found
3193 if (nNonceFound != -1)
3195 for (int i = 0; i < sizeof(hash)/4; i++)
3196 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3198 if (hash <= hashTarget)
3201 pblock->nNonce = ByteReverse(nNonceFound);
3202 assert(hash == pblock->GetHash());
3204 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3205 CheckWork(pblock.get(), *pwalletMain, reservekey);
3206 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3212 static int64 nHashCounter;
3213 if (nHPSTimerStart == 0)
3215 nHPSTimerStart = GetTimeMillis();
3219 nHashCounter += nHashesDone;
3220 if (GetTimeMillis() - nHPSTimerStart > 4000)
3222 static CCriticalSection cs;
3225 if (GetTimeMillis() - nHPSTimerStart > 4000)
3227 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3228 nHPSTimerStart = GetTimeMillis();
3230 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3231 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3232 static int64 nLogTime;
3233 if (GetTime() - nLogTime > 30 * 60)
3235 nLogTime = GetTime();
3236 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3237 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3243 // Check for stop or if block needs to be rebuilt
3246 if (!fGenerateBitcoins)
3248 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3252 if (nBlockNonce >= 0xffff0000)
3254 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3256 if (pindexPrev != pindexBest)
3259 // Update nTime every few seconds
3260 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3261 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3262 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3263 nBlockTime = ByteReverse(pblock->nTime);
3264 if (pblock->GetBlockTime() >= (int64)pblock->vtx[0].nTime + nMaxClockDrift)
3265 break; // need to update coinbase timestamp
3270 void static ThreadBitcoinMiner(void* parg)
3272 CWallet* pwallet = (CWallet*)parg;
3275 vnThreadsRunning[3]++;
3276 BitcoinMiner(pwallet);
3277 vnThreadsRunning[3]--;
3279 catch (std::exception& e) {
3280 vnThreadsRunning[3]--;
3281 PrintException(&e, "ThreadBitcoinMiner()");
3283 vnThreadsRunning[3]--;
3284 PrintException(NULL, "ThreadBitcoinMiner()");
3286 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3288 if (vnThreadsRunning[3] == 0)
3290 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3294 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3296 if (fGenerateBitcoins != fGenerate)
3298 fGenerateBitcoins = fGenerate;
3299 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3302 if (fGenerateBitcoins)
3304 int nProcessors = boost::thread::hardware_concurrency();
3305 printf("%d processors\n", nProcessors);
3306 if (nProcessors < 1)
3308 if (fLimitProcessors && nProcessors > nLimitProcessors)
3309 nProcessors = nLimitProcessors;
3310 int nAddThreads = nProcessors - vnThreadsRunning[3];
3311 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3312 for (int i = 0; i < nAddThreads; i++)
3314 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3315 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");