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, bool fConnect = true)
123 // ppcoin: wallets need to refund inputs when disconnecting coinstake
124 if (tx.IsCoinStake())
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 if (pwallet->IsFromMe(tx))
127 pwallet->DisableTransaction(tx);
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
135 // notify wallets about a new best chain
136 void static SetBestChain(const CBlockLocator& loc)
138 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
139 pwallet->SetBestChain(loc);
142 // notify wallets about an updated transaction
143 void static UpdatedTransaction(const uint256& hashTx)
145 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
146 pwallet->UpdatedTransaction(hashTx);
150 void static PrintWallets(const CBlock& block)
152 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
153 pwallet->PrintWallet(block);
156 // notify wallets about an incoming inventory (for request counts)
157 void static Inventory(const uint256& hash)
159 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
160 pwallet->Inventory(hash);
163 // ask wallets to resend their transactions
164 void static ResendWalletTransactions()
166 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
167 pwallet->ResendWalletTransactions();
176 //////////////////////////////////////////////////////////////////////////////
178 // mapOrphanTransactions
181 void static AddOrphanTx(const CDataStream& vMsg)
184 CDataStream(vMsg) >> tx;
185 uint256 hash = tx.GetHash();
186 if (mapOrphanTransactions.count(hash))
188 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
190 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
193 void static EraseOrphanTx(uint256 hash)
195 if (!mapOrphanTransactions.count(hash))
197 const CDataStream* pvMsg = mapOrphanTransactions[hash];
199 CDataStream(*pvMsg) >> tx;
200 BOOST_FOREACH(const CTxIn& txin, tx.vin)
202 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
203 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
205 if ((*mi).second == pvMsg)
206 mapOrphanTransactionsByPrev.erase(mi++);
212 mapOrphanTransactions.erase(hash);
222 //////////////////////////////////////////////////////////////////////////////
224 // CTransaction and CTxIndex
227 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
230 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
232 if (!ReadFromDisk(txindexRet.pos))
234 if (prevout.n >= vout.size())
242 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
245 return ReadFromDisk(txdb, prevout, txindex);
248 bool CTransaction::ReadFromDisk(COutPoint prevout)
252 return ReadFromDisk(txdb, prevout, txindex);
257 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
269 // Load the block this tx is in
271 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
273 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
278 // Update the tx's hashBlock
279 hashBlock = pblock->GetHash();
281 // Locate the transaction
282 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
283 if (pblock->vtx[nIndex] == *(CTransaction*)this)
285 if (nIndex == pblock->vtx.size())
287 vMerkleBranch.clear();
289 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
293 // Fill in merkle branch
294 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
297 // Is the tx in a block that's in the main chain
298 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
299 if (mi == mapBlockIndex.end())
301 CBlockIndex* pindex = (*mi).second;
302 if (!pindex || !pindex->IsInMainChain())
305 return pindexBest->nHeight - pindex->nHeight + 1;
314 bool CTransaction::CheckTransaction() const
316 // Basic checks that don't depend on any context
318 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
320 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
322 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
323 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
325 // Check for negative or overflow output values
327 for (int i = (IsCoinStake()? 1 : 0); i < vout.size(); i++)
329 const CTxOut& txout = vout[i];
330 if (txout.nValue < 0)
331 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
332 if (txout.nValue > MAX_MONEY)
333 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
334 nValueOut += txout.nValue;
335 if (!MoneyRange(nValueOut))
336 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
339 // Check for duplicate inputs
340 set<COutPoint> vInOutPoints;
341 BOOST_FOREACH(const CTxIn& txin, vin)
343 if (vInOutPoints.count(txin.prevout))
345 vInOutPoints.insert(txin.prevout);
350 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
351 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
355 BOOST_FOREACH(const CTxIn& txin, vin)
356 if (txin.prevout.IsNull())
357 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
363 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
366 *pfMissingInputs = false;
368 if (!CheckTransaction())
369 return error("AcceptToMemoryPool() : CheckTransaction failed");
371 // Coinbase is only valid in a block, not as a loose transaction
373 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
374 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
376 return DoS(100, error("AcceptToMemoryPool() : coinstake as individual tx"));
378 // To help v0.1.5 clients who would see it as a negative number
379 if ((int64)nLockTime > INT_MAX)
380 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
383 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
384 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
385 // attacks disallow transactions with more than one SigOp per 34 bytes.
386 // 34 bytes because a TxOut is:
387 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
388 if (GetSigOpCount() > nSize / 34 || nSize < 100)
389 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
391 // Rather not work on nonstandard transactions (unless -testnet)
392 if (!fTestNet && !IsStandard())
393 return error("AcceptToMemoryPool() : nonstandard transaction type");
395 // Do we already have it?
396 uint256 hash = GetHash();
397 CRITICAL_BLOCK(cs_mapTransactions)
398 if (mapTransactions.count(hash))
401 if (txdb.ContainsTx(hash))
404 // Check for conflicts with in-memory transactions
405 CTransaction* ptxOld = NULL;
406 for (int i = 0; i < vin.size(); i++)
408 COutPoint outpoint = vin[i].prevout;
409 if (mapNextTx.count(outpoint))
411 // Disable replacement feature for now
414 // Allow replacing with a newer version of the same transaction
417 ptxOld = mapNextTx[outpoint].ptx;
418 if (ptxOld->IsFinal())
420 if (!IsNewerThan(*ptxOld))
422 for (int i = 0; i < vin.size(); i++)
424 COutPoint outpoint = vin[i].prevout;
425 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
434 // Check against previous transactions
435 map<uint256, CTxIndex> mapUnused;
437 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
440 *pfMissingInputs = true;
441 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
444 // Don't accept it if it can't get into a block
445 if (nFees < GetMinFee(1000, false, true))
446 return error("AcceptToMemoryPool() : not enough fees");
448 // Continuously rate-limit free transactions
449 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
450 // be annoying or make other's transactions take longer to confirm.
451 if (nFees < MIN_RELAY_TX_FEE)
453 static CCriticalSection cs;
454 static double dFreeCount;
455 static int64 nLastTime;
456 int64 nNow = GetTime();
460 // Use an exponentially decaying ~10-minute window:
461 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
463 // -limitfreerelay unit is thousand-bytes-per-minute
464 // At default rate it would take over a month to fill 1GB
465 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
466 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
468 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
474 // Store transaction in memory
475 CRITICAL_BLOCK(cs_mapTransactions)
479 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
480 ptxOld->RemoveFromMemoryPool();
482 AddToMemoryPoolUnchecked();
485 ///// are we sure this is ok when loading transactions or restoring block txes
486 // If updated, erase old tx from wallet
488 EraseFromWallets(ptxOld->GetHash());
490 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
494 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
497 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
500 bool CTransaction::AddToMemoryPoolUnchecked()
502 // Add to memory pool without checking anything. Don't call this directly,
503 // call AcceptToMemoryPool to properly check the transaction first.
504 CRITICAL_BLOCK(cs_mapTransactions)
506 uint256 hash = GetHash();
507 mapTransactions[hash] = *this;
508 for (int i = 0; i < vin.size(); i++)
509 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
510 nTransactionsUpdated++;
516 bool CTransaction::RemoveFromMemoryPool()
518 // Remove transaction from memory pool
519 CRITICAL_BLOCK(cs_mapTransactions)
521 BOOST_FOREACH(const CTxIn& txin, vin)
522 mapNextTx.erase(txin.prevout);
523 mapTransactions.erase(GetHash());
524 nTransactionsUpdated++;
534 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
536 if (hashBlock == 0 || nIndex == -1)
539 // Find the block it claims to be in
540 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
541 if (mi == mapBlockIndex.end())
543 CBlockIndex* pindex = (*mi).second;
544 if (!pindex || !pindex->IsInMainChain())
547 // Make sure the merkle branch connects to this block
548 if (!fMerkleVerified)
550 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
552 fMerkleVerified = true;
555 nHeightRet = pindex->nHeight;
556 return pindexBest->nHeight - pindex->nHeight + 1;
560 int CMerkleTx::GetBlocksToMaturity() const
562 if (!(IsCoinBase() || IsCoinStake()))
564 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
568 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
572 if (!IsInMainChain() && !ClientConnectInputs())
574 return CTransaction::AcceptToMemoryPool(txdb, false);
578 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
582 bool CMerkleTx::AcceptToMemoryPool()
585 return AcceptToMemoryPool(txdb);
590 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
592 CRITICAL_BLOCK(cs_mapTransactions)
594 // Add previous supporting transactions first
595 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
597 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
599 uint256 hash = tx.GetHash();
600 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
601 tx.AcceptToMemoryPool(txdb, fCheckInputs);
604 return AcceptToMemoryPool(txdb, fCheckInputs);
609 bool CWalletTx::AcceptWalletTransaction()
612 return AcceptWalletTransaction(txdb);
615 int CTxIndex::GetDepthInMainChain() const
619 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
621 // Find the block in the index
622 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
623 if (mi == mapBlockIndex.end())
625 CBlockIndex* pindex = (*mi).second;
626 if (!pindex || !pindex->IsInMainChain())
628 return 1 + nBestHeight - pindex->nHeight;
640 //////////////////////////////////////////////////////////////////////////////
642 // CBlock and CBlockIndex
645 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
647 if (!fReadTransactions)
649 *this = pindex->GetBlockHeader();
652 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
654 if (GetHash() != pindex->GetBlockHash())
655 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
659 uint256 static GetOrphanRoot(const CBlock* pblock)
661 // Work back to the first block in the orphan chain
662 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
663 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
664 return pblock->GetHash();
667 int64 static GetProofOfWorkReward(unsigned int nBits)
669 CBigNum bnSubsidyLimit = 9999 * COIN; // subsidy amount for difficulty 1
671 bnTarget.SetCompact(nBits);
672 CBigNum bnTargetLimit = bnProofOfWorkLimit;
673 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
675 // ppcoin: subsidy is cut in half every 16x multiply of difficulty
676 // A reasonably continuous curve is used to avoid shock to market
677 // (nSubsidyLimit / nSubsidy) ** 4 == bnProofOfWorkLimit / bnTarget
678 CBigNum bnLowerBound = CENT;
679 CBigNum bnUpperBound = bnSubsidyLimit;
680 while (bnLowerBound + CENT <= bnUpperBound)
682 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
683 if (fDebug && GetBoolArg("-printcreation"))
684 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
685 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
686 bnUpperBound = bnMidValue;
688 bnLowerBound = bnMidValue;
691 int64 nSubsidy = bnUpperBound.getuint64();
692 nSubsidy = (nSubsidy / CENT) * CENT;
693 if (fDebug && GetBoolArg("-printcreation"))
694 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
699 // ppcoin: miner's coin stake is rewarded based on coin age spent (coin-days)
700 int64 GetProofOfStakeReward(int64 nCoinAge)
702 static int64 nRewardCoinYear = CENT; // creation amount per coin-year
703 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
704 if (fDebug && GetBoolArg("-printcreation"))
705 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nCoinAge);
709 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
710 static const int64 nTargetSpacing = 10 * 60;
711 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
712 static const int64 nMaxClockDrift = 2 * 60 * 60; // 2 hours
715 // minimum amount of work that could possibly be required nTime after
716 // minimum work required was nBase
718 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
721 bnResult.SetCompact(nBase);
722 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
724 // Maximum 400% adjustment...
726 // ... in best-case exactly 4-times-normal target time
727 nTime -= nTargetTimespan*4;
729 if (bnResult > bnProofOfWorkLimit)
730 bnResult = bnProofOfWorkLimit;
731 return bnResult.GetCompact();
734 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
736 // Genesis block and first block
737 if (pindexLast == NULL || pindexLast->pprev == NULL)
738 return bnProofOfWorkLimit.GetCompact();
740 int64 nActualSpacing = pindexLast->GetBlockTime() - pindexLast->pprev->GetBlockTime();
742 // ppcoin: target change every block
743 // ppcoin: retarget with exponential moving toward target spacing
745 bnNew.SetCompact(pindexLast->nBits);
746 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
747 bnNew /= ((nInterval + 1) * nTargetSpacing);
749 if (bnNew > bnProofOfWorkLimit)
750 bnNew = bnProofOfWorkLimit;
752 return bnNew.GetCompact();
755 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
758 bnTarget.SetCompact(nBits);
761 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
762 return error("CheckProofOfWork() : nBits below minimum work");
764 // Check proof of work matches claimed amount
765 if (hash > bnTarget.getuint256())
766 return error("CheckProofOfWork() : hash doesn't match nBits");
771 // Return maximum amount of blocks that other nodes claim to have
772 int GetNumBlocksOfPeers()
774 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
777 bool IsInitialBlockDownload()
779 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
781 static int64 nLastUpdate;
782 static CBlockIndex* pindexLastBest;
783 if (pindexBest != pindexLastBest)
785 pindexLastBest = pindexBest;
786 nLastUpdate = GetTime();
788 return (GetTime() - nLastUpdate < 10 &&
789 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
792 void static InvalidChainFound(CBlockIndex* pindexNew)
794 if (pindexNew->nChainTrust > nBestInvalidTrust)
796 nBestInvalidTrust = pindexNew->nChainTrust;
797 CTxDB().WriteBestInvalidTrust(nBestInvalidTrust);
800 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());
801 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
802 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
803 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
816 bool CTransaction::DisconnectInputs(CTxDB& txdb)
818 // Relinquish previous transactions' spent pointers
821 BOOST_FOREACH(const CTxIn& txin, vin)
823 COutPoint prevout = txin.prevout;
825 // Get prev txindex from disk
827 if (!txdb.ReadTxIndex(prevout.hash, txindex))
828 return error("DisconnectInputs() : ReadTxIndex failed");
830 if (prevout.n >= txindex.vSpent.size())
831 return error("DisconnectInputs() : prevout.n out of range");
833 // Mark outpoint as not spent
834 txindex.vSpent[prevout.n].SetNull();
837 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
838 return error("DisconnectInputs() : UpdateTxIndex failed");
842 // Remove transaction from index
843 if (!txdb.EraseTxIndex(*this))
844 return error("DisconnectInputs() : EraseTxPos failed");
850 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
851 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
853 // Take over previous transactions' spent pointers
854 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
855 // fMiner is true when called from the internal bitcoin miner
856 // ... both are false when called from CTransaction::AcceptToMemoryPool
860 for (int i = 0; i < vin.size(); i++)
862 COutPoint prevout = vin[i].prevout;
867 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
869 // Get txindex from current proposed changes
870 txindex = mapTestPool[prevout.hash];
874 // Read txindex from txdb
875 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
877 if (!fFound && (fBlock || fMiner))
878 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());
882 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
884 // Get prev tx from single transactions in memory
885 CRITICAL_BLOCK(cs_mapTransactions)
887 if (!mapTransactions.count(prevout.hash))
888 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
889 txPrev = mapTransactions[prevout.hash];
892 txindex.vSpent.resize(txPrev.vout.size());
896 // Get prev tx from disk
897 if (!txPrev.ReadFromDisk(txindex.pos))
898 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
901 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
902 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()));
904 // If prev is coinbase/coinstake, check that it's matured
905 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
906 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
907 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
908 return error("ConnectInputs() : tried to spend coinbase/coinstake at depth %d", pindexBlock->nHeight - pindex->nHeight);
910 // ppcoin: check transaction timestamp
911 if (txPrev.nTime > nTime)
912 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
914 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
915 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
916 // still computed and checked, and any change will be caught at the next checkpoint.
917 if (!(fBlock && IsInitialBlockDownload()))
919 if (!VerifySignature(txPrev, *this, i))
920 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
922 // Check for conflicts (double-spend)
923 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
924 // for an attacker to attempt to split the network.
925 if (!txindex.vSpent[prevout.n].IsNull())
926 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());
928 // Check for negative or overflow input values
929 nValueIn += txPrev.vout[prevout.n].nValue;
930 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
931 return DoS(100, error("ConnectInputs() : txin values out of range"));
933 // Mark outpoints as spent
934 txindex.vSpent[prevout.n] = posThisTx;
937 if (fBlock || fMiner)
939 mapTestPool[prevout.hash] = txindex;
945 // ppcoin: coin stake tx earns reward instead of paying fee
947 if (!GetCoinAge(txdb, nCoinAge))
948 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
949 int64 nStakeReward = GetValueOut() - nValueIn;
950 if (nStakeReward > GetProofOfStakeReward(nCoinAge))
951 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
955 if (nValueIn < GetValueOut())
956 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
958 // Tally transaction fees
959 int64 nTxFee = nValueIn - GetValueOut();
961 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
962 // ppcoin: enforce transaction fees for every block
963 if (nTxFee < nMinFee)
964 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;
966 if (!MoneyRange(nFees))
967 return DoS(100, error("ConnectInputs() : nFees out of range"));
973 // Add transaction to changes
974 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
978 // Add transaction to test pool
979 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
986 bool CTransaction::ClientConnectInputs()
991 // Take over previous transactions' spent pointers
992 CRITICAL_BLOCK(cs_mapTransactions)
995 for (int i = 0; i < vin.size(); i++)
997 // Get prev tx from single transactions in memory
998 COutPoint prevout = vin[i].prevout;
999 if (!mapTransactions.count(prevout.hash))
1001 CTransaction& txPrev = mapTransactions[prevout.hash];
1003 if (prevout.n >= txPrev.vout.size())
1007 if (!VerifySignature(txPrev, *this, i))
1008 return error("ConnectInputs() : VerifySignature failed");
1010 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1011 ///// this has to go away now that posNext is gone
1012 // // Check for conflicts
1013 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1014 // return error("ConnectInputs() : prev tx already used");
1016 // // Flag outpoints as used
1017 // txPrev.vout[prevout.n].posNext = posThisTx;
1019 nValueIn += txPrev.vout[prevout.n].nValue;
1021 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1022 return error("ClientConnectInputs() : txin values out of range");
1024 if (GetValueOut() > nValueIn)
1034 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1036 // Disconnect in reverse order
1037 for (int i = vtx.size()-1; i >= 0; i--)
1038 if (!vtx[i].DisconnectInputs(txdb))
1041 // Update block index on disk without changing it in memory.
1042 // The memory index structure will be changed after the db commits.
1045 CDiskBlockIndex blockindexPrev(pindex->pprev);
1046 blockindexPrev.hashNext = 0;
1047 if (!txdb.WriteBlockIndex(blockindexPrev))
1048 return error("DisconnectBlock() : WriteBlockIndex failed");
1051 // ppcoin: clean up wallet after disconnecting coinstake
1052 BOOST_FOREACH(CTransaction& tx, vtx)
1053 SyncWithWallets(tx, this, false, false);
1058 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1060 // Check it again in case a previous version let a bad block in
1064 //// issue here: it doesn't know the version
1065 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1067 map<uint256, CTxIndex> mapQueuedChanges;
1069 BOOST_FOREACH(CTransaction& tx, vtx)
1071 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1072 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1074 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, tx.GetMinFee()))
1077 // Write queued txindex changes
1078 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1080 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1081 return error("ConnectBlock() : UpdateTxIndex failed");
1084 // ppcoin: fees are not collected by miners as in bitcoin
1085 // ppcoin: fees are destroyed to compensate the entire network
1086 if (vtx[0].GetValueOut() > GetProofOfWorkReward(nBits))
1088 if (fDebug && GetBoolArg("-printcreation"))
1089 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1091 // Update block index on disk without changing it in memory.
1092 // The memory index structure will be changed after the db commits.
1095 CDiskBlockIndex blockindexPrev(pindex->pprev);
1096 blockindexPrev.hashNext = pindex->GetBlockHash();
1097 if (!txdb.WriteBlockIndex(blockindexPrev))
1098 return error("ConnectBlock() : WriteBlockIndex failed");
1101 // Watch for transactions paying to me
1102 BOOST_FOREACH(CTransaction& tx, vtx)
1103 SyncWithWallets(tx, this, true);
1108 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1110 printf("REORGANIZE\n");
1113 CBlockIndex* pfork = pindexBest;
1114 CBlockIndex* plonger = pindexNew;
1115 while (pfork != plonger)
1117 while (plonger->nHeight > pfork->nHeight)
1118 if (!(plonger = plonger->pprev))
1119 return error("Reorganize() : plonger->pprev is null");
1120 if (pfork == plonger)
1122 if (!(pfork = pfork->pprev))
1123 return error("Reorganize() : pfork->pprev is null");
1126 // List of what to disconnect
1127 vector<CBlockIndex*> vDisconnect;
1128 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1129 vDisconnect.push_back(pindex);
1131 // List of what to connect
1132 vector<CBlockIndex*> vConnect;
1133 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1134 vConnect.push_back(pindex);
1135 reverse(vConnect.begin(), vConnect.end());
1137 // Disconnect shorter branch
1138 vector<CTransaction> vResurrect;
1139 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1142 if (!block.ReadFromDisk(pindex))
1143 return error("Reorganize() : ReadFromDisk for disconnect failed");
1144 if (!block.DisconnectBlock(txdb, pindex))
1145 return error("Reorganize() : DisconnectBlock failed");
1147 // Queue memory transactions to resurrect
1148 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1149 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1150 vResurrect.push_back(tx);
1153 // Connect longer branch
1154 vector<CTransaction> vDelete;
1155 for (int i = 0; i < vConnect.size(); i++)
1157 CBlockIndex* pindex = vConnect[i];
1159 if (!block.ReadFromDisk(pindex))
1160 return error("Reorganize() : ReadFromDisk for connect failed");
1161 if (!block.ConnectBlock(txdb, pindex))
1165 return error("Reorganize() : ConnectBlock failed");
1168 // Queue memory transactions to delete
1169 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1170 vDelete.push_back(tx);
1172 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1173 return error("Reorganize() : WriteHashBestChain failed");
1174 if (!txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1175 return error("Reorganize() : WriteAutoCheckpoint failed");
1177 // Make sure it's successfully written to disk before changing memory structure
1178 if (!txdb.TxnCommit())
1179 return error("Reorganize() : TxnCommit failed");
1181 // Disconnect shorter branch
1182 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1184 pindex->pprev->pnext = NULL;
1186 // Connect longer branch
1187 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1189 pindex->pprev->pnext = pindex;
1191 // Resurrect memory transactions that were in the disconnected branch
1192 BOOST_FOREACH(CTransaction& tx, vResurrect)
1193 tx.AcceptToMemoryPool(txdb, false);
1195 // Delete redundant memory transactions that are in the connected branch
1196 BOOST_FOREACH(CTransaction& tx, vDelete)
1197 tx.RemoveFromMemoryPool();
1203 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1205 uint256 hash = GetHash();
1208 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1210 txdb.WriteHashBestChain(hash);
1211 txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint));
1212 if (!txdb.TxnCommit())
1213 return error("SetBestChain() : TxnCommit failed");
1214 pindexGenesisBlock = pindexNew;
1216 else if (hashPrevBlock == hashBestChain)
1218 // Adding to current best branch
1219 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash) || !txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1222 InvalidChainFound(pindexNew);
1223 return error("SetBestChain() : ConnectBlock failed");
1225 if (!txdb.TxnCommit())
1226 return error("SetBestChain() : TxnCommit failed");
1228 // Add to current best branch
1229 pindexNew->pprev->pnext = pindexNew;
1231 // Delete redundant memory transactions
1232 BOOST_FOREACH(CTransaction& tx, vtx)
1233 tx.RemoveFromMemoryPool();
1238 if (!Reorganize(txdb, pindexNew))
1241 InvalidChainFound(pindexNew);
1242 return error("SetBestChain() : Reorganize failed");
1246 // Update best block in wallet (so we can detect restored wallets)
1247 if (!IsInitialBlockDownload())
1249 const CBlockLocator locator(pindexNew);
1250 ::SetBestChain(locator);
1254 hashBestChain = hash;
1255 pindexBest = pindexNew;
1256 nBestHeight = pindexBest->nHeight;
1257 nBestChainTrust = pindexNew->nChainTrust;
1258 nTimeBestReceived = GetTime();
1259 nTransactionsUpdated++;
1260 Checkpoints::AdvanceAutoCheckpoint(pindexBest->nCheckpoint);
1261 printf("SetBestChain: new best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
1267 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1268 // Only those coins last spent at least a week ago count. As those
1269 // transactions not in main chain are not currently indexed so we
1270 // might not find out about their coin age. Older transactions are
1271 // guaranteed to be in main chain by auto checkpoint. This rule is
1272 // introduced to help nodes establish a consistent view of the coin
1273 // age (trust score) of competing branches.
1274 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1276 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1282 BOOST_FOREACH(const CTxIn& txin, vin)
1284 // First try finding the previous transaction in database
1285 CTransaction txPrev;
1287 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1288 continue; // previous transaction not in main chain
1289 if (nTime < txPrev.nTime)
1290 return false; // Transaction timestamp violation
1292 // Read block header
1294 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1295 return false; // unable to read block of previous transaction
1296 if (block.GetBlockTime() + AUTO_CHECKPOINT_TRUST_SPAN > nTime)
1297 continue; // only count coins from at least one week ago
1299 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1300 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1302 if (fDebug && GetBoolArg("-printcoinage"))
1303 printf("coin age nValueIn=%-12I64d nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1306 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1307 if (fDebug && GetBoolArg("-printcoinage"))
1308 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1309 nCoinAge = bnCoinDay.getuint64();
1313 // ppcoin: total coin age spent in block, in the unit of coin-days.
1314 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1319 BOOST_FOREACH(const CTransaction& tx, vtx)
1322 if (tx.GetCoinAge(txdb, nTxCoinAge))
1323 nCoinAge += nTxCoinAge;
1328 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1330 if (fDebug && GetBoolArg("-printcoinage"))
1331 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1336 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1338 // Check for duplicate
1339 uint256 hash = GetHash();
1340 if (mapBlockIndex.count(hash))
1341 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1343 // Construct new block index object
1344 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1346 return error("AddToBlockIndex() : new CBlockIndex failed");
1347 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1349 pindexNew->phashBlock = &((*mi).first);
1350 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1351 if (miPrev != mapBlockIndex.end())
1353 pindexNew->pprev = (*miPrev).second;
1354 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1356 // ppcoin: compute chain checkpoint
1357 pindexNew->nCheckpoint = Checkpoints::GetNextChainCheckpoint(pindexNew->pprev);
1358 assert (pindexNew->nCheckpoint >= pindexNew->pprev->nCheckpoint);
1361 // ppcoin: compute chain trust score
1363 if (!GetCoinAge(nCoinAge))
1364 return error("AddToBlockIndex() : invalid transaction in block");
1365 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + nCoinAge;
1369 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1370 if (!txdb.TxnCommit())
1374 if (pindexNew->nChainTrust > nBestChainTrust)
1375 if (!SetBestChain(txdb, pindexNew))
1380 if (pindexNew == pindexBest)
1382 // Notify UI to display prev block's coinbase if it was ours
1383 static uint256 hashPrevBestCoinBase;
1384 UpdatedTransaction(hashPrevBestCoinBase);
1385 hashPrevBestCoinBase = vtx[0].GetHash();
1395 bool CBlock::CheckBlock() const
1397 // These are checks that are independent of context
1398 // that can be verified before saving an orphan block.
1401 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1402 return DoS(100, error("CheckBlock() : size limits failed"));
1404 // Check proof of work matches claimed amount
1405 if (!CheckProofOfWork(GetHash(), nBits))
1406 return DoS(50, error("CheckBlock() : proof of work failed"));
1409 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
1410 return error("CheckBlock() : block timestamp too far in the future");
1412 // First transaction must be coinbase, the rest must not be
1413 if (vtx.empty() || !vtx[0].IsCoinBase())
1414 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1415 for (int i = 1; i < vtx.size(); i++)
1416 if (vtx[i].IsCoinBase())
1417 return DoS(100, error("CheckBlock() : more than one coinbase"));
1419 // ppcoin: only the second transaction can be the optional coinstake
1420 for (int i = 2; i < vtx.size(); i++)
1421 if (vtx[i].IsCoinStake())
1422 return DoS(100, error("CheckBlock() : coinstake in wrong position"));
1424 // Check coinbase timestamp
1425 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
1426 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
1428 // Check transactions
1429 BOOST_FOREACH(const CTransaction& tx, vtx)
1431 if (!tx.CheckTransaction())
1432 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1433 // ppcoin: check transaction timestamp
1434 if (GetBlockTime() < (int64)tx.nTime)
1435 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1438 // Check that it's not full of nonstandard transactions
1439 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1440 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1443 if (hashMerkleRoot != BuildMerkleTree())
1444 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1446 // Check block signature
1447 if (!CheckBlockSignature())
1448 return DoS(100, error("CheckBlock() : bad block signature"));
1453 bool CBlock::AcceptBlock()
1455 // Check for duplicate
1456 uint256 hash = GetHash();
1457 if (mapBlockIndex.count(hash))
1458 return error("AcceptBlock() : block already in mapBlockIndex");
1460 // Get prev block index
1461 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1462 if (mi == mapBlockIndex.end())
1463 return DoS(10, error("AcceptBlock() : prev block not found"));
1464 CBlockIndex* pindexPrev = (*mi).second;
1465 int nHeight = pindexPrev->nHeight+1;
1467 // Check proof of work
1468 if (nBits != GetNextWorkRequired(pindexPrev))
1469 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1471 // Check timestamp against prev
1472 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
1473 return error("AcceptBlock() : block's timestamp is too early");
1475 // Check that all transactions are finalized
1476 BOOST_FOREACH(const CTransaction& tx, vtx)
1477 if (!tx.IsFinal(nHeight, GetBlockTime()))
1478 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1480 // Check that the block chain matches the known block chain up to a hardened checkpoint
1481 if (!Checkpoints::CheckHardened(nHeight, hash))
1482 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1484 // ppcoin: check that the block satisfies automatic checkpoint
1485 if (!Checkpoints::CheckAuto(pindexPrev))
1486 return DoS(100, error("AcceptBlock() : rejected by automatic checkpoint at %d", Checkpoints::nAutoCheckpoint));
1488 // Write block to history file
1489 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1490 return error("AcceptBlock() : out of disk space");
1491 unsigned int nFile = -1;
1492 unsigned int nBlockPos = 0;
1493 if (!WriteToDisk(nFile, nBlockPos))
1494 return error("AcceptBlock() : WriteToDisk failed");
1495 if (!AddToBlockIndex(nFile, nBlockPos))
1496 return error("AcceptBlock() : AddToBlockIndex failed");
1498 // Relay inventory, but don't relay old inventory during initial block download
1499 if (hashBestChain == hash)
1500 CRITICAL_BLOCK(cs_vNodes)
1501 BOOST_FOREACH(CNode* pnode, vNodes)
1502 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1503 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1508 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1510 // Check for duplicate
1511 uint256 hash = pblock->GetHash();
1512 if (mapBlockIndex.count(hash))
1513 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1514 if (mapOrphanBlocks.count(hash))
1515 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1517 // Preliminary checks
1518 if (!pblock->CheckBlock())
1519 return error("ProcessBlock() : CheckBlock FAILED");
1521 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1522 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1524 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1525 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1528 pfrom->Misbehaving(100);
1529 return error("ProcessBlock() : block with timestamp before last checkpoint");
1532 bnNewBlock.SetCompact(pblock->nBits);
1534 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1535 if (bnNewBlock > bnRequired)
1537 pfrom->Misbehaving(100);
1538 return error("ProcessBlock() : block with too little proof-of-work");
1543 // If don't already have its previous block, shunt it off to holding area until we get it
1544 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1546 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1547 CBlock* pblock2 = new CBlock(*pblock);
1548 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1549 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1551 // Ask this guy to fill in what we're missing
1553 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1558 if (!pblock->AcceptBlock())
1559 return error("ProcessBlock() : AcceptBlock FAILED");
1561 // Recursively process any orphan blocks that depended on this one
1562 vector<uint256> vWorkQueue;
1563 vWorkQueue.push_back(hash);
1564 for (int i = 0; i < vWorkQueue.size(); i++)
1566 uint256 hashPrev = vWorkQueue[i];
1567 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1568 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1571 CBlock* pblockOrphan = (*mi).second;
1572 if (pblockOrphan->AcceptBlock())
1573 vWorkQueue.push_back(pblockOrphan->GetHash());
1574 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1575 delete pblockOrphan;
1577 mapOrphanBlocksByPrev.erase(hashPrev);
1580 printf("ProcessBlock: ACCEPTED\n");
1591 bool CheckDiskSpace(uint64 nAdditionalBytes)
1593 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1595 // Check for 15MB because database could create another 10MB log file at any time
1596 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1599 string strMessage = _("Warning: Disk space is low ");
1600 strMiscWarning = strMessage;
1601 printf("*** %s\n", strMessage.c_str());
1602 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1603 CreateThread(Shutdown, NULL);
1609 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1613 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1616 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1618 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1627 static unsigned int nCurrentBlockFile = 1;
1629 FILE* AppendBlockFile(unsigned int& nFileRet)
1634 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1637 if (fseek(file, 0, SEEK_END) != 0)
1639 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1640 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1642 nFileRet = nCurrentBlockFile;
1646 nCurrentBlockFile++;
1650 bool LoadBlockIndex(bool fAllowNew)
1654 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1655 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1656 pchMessageStart[0] = 0xfa;
1657 pchMessageStart[1] = 0xbf;
1658 pchMessageStart[2] = 0xb5;
1659 pchMessageStart[3] = 0xda;
1666 if (!txdb.LoadBlockIndex())
1671 // Init with genesis block
1673 if (mapBlockIndex.empty())
1679 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1680 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1681 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1682 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1683 // vMerkleTree: 4a5e1e
1686 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1688 txNew.nTime = 1325878371;
1689 txNew.vin.resize(1);
1690 txNew.vout.resize(1);
1691 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1692 txNew.vout[0].nValue = GetProofOfWorkReward(bnProofOfWorkLimit.GetCompact());
1693 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1695 block.vtx.push_back(txNew);
1696 block.hashPrevBlock = 0;
1697 block.hashMerkleRoot = block.BuildMerkleTree();
1699 block.nTime = 1325882536;
1700 block.nBits = bnProofOfWorkLimit.GetCompact();
1701 block.nNonce = 2081920190;
1705 block.nTime = 1296688602;
1706 block.nBits = 0x1d07fff8;
1707 block.nNonce = 384568319;
1711 printf("%s\n", block.GetHash().ToString().c_str());
1712 printf("%s\n", hashGenesisBlock.ToString().c_str());
1713 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1714 assert(block.hashMerkleRoot == uint256("0xc7311b56de266580cca65be108ae53d7100b5c3b17da8b1106044103abd7a521"));
1716 assert(block.GetHash() == hashGenesisBlock);
1717 assert(block.CheckBlock());
1719 // Start new block file
1721 unsigned int nBlockPos;
1722 if (!block.WriteToDisk(nFile, nBlockPos))
1723 return error("LoadBlockIndex() : writing genesis block to disk failed");
1724 if (!block.AddToBlockIndex(nFile, nBlockPos))
1725 return error("LoadBlockIndex() : genesis block not accepted");
1733 void PrintBlockTree()
1735 // precompute tree structure
1736 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1737 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1739 CBlockIndex* pindex = (*mi).second;
1740 mapNext[pindex->pprev].push_back(pindex);
1742 //while (rand() % 3 == 0)
1743 // mapNext[pindex->pprev].push_back(pindex);
1746 vector<pair<int, CBlockIndex*> > vStack;
1747 vStack.push_back(make_pair(0, pindexGenesisBlock));
1750 while (!vStack.empty())
1752 int nCol = vStack.back().first;
1753 CBlockIndex* pindex = vStack.back().second;
1756 // print split or gap
1757 if (nCol > nPrevCol)
1759 for (int i = 0; i < nCol-1; i++)
1763 else if (nCol < nPrevCol)
1765 for (int i = 0; i < nCol; i++)
1772 for (int i = 0; i < nCol; i++)
1777 block.ReadFromDisk(pindex);
1778 printf("%d (%u,%u) %s %s tx %d",
1782 block.GetHash().ToString().substr(0,20).c_str(),
1783 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1786 PrintWallets(block);
1788 // put the main timechain first
1789 vector<CBlockIndex*>& vNext = mapNext[pindex];
1790 for (int i = 0; i < vNext.size(); i++)
1792 if (vNext[i]->pnext)
1794 swap(vNext[0], vNext[i]);
1800 for (int i = 0; i < vNext.size(); i++)
1801 vStack.push_back(make_pair(nCol+i, vNext[i]));
1814 //////////////////////////////////////////////////////////////////////////////
1819 map<uint256, CAlert> mapAlerts;
1820 CCriticalSection cs_mapAlerts;
1822 string GetWarnings(string strFor)
1825 string strStatusBar;
1827 if (GetBoolArg("-testsafemode"))
1830 // Misc warnings like out of disk space and clock is wrong
1831 if (strMiscWarning != "")
1834 strStatusBar = strMiscWarning;
1837 // Longer invalid proof-of-work chain
1838 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
1841 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1845 CRITICAL_BLOCK(cs_mapAlerts)
1847 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1849 const CAlert& alert = item.second;
1850 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1852 nPriority = alert.nPriority;
1853 strStatusBar = alert.strStatusBar;
1858 if (strFor == "statusbar")
1859 return strStatusBar;
1860 else if (strFor == "rpc")
1862 assert(!"GetWarnings() : invalid parameter");
1866 bool CAlert::ProcessAlert()
1868 if (!CheckSignature())
1873 CRITICAL_BLOCK(cs_mapAlerts)
1875 // Cancel previous alerts
1876 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1878 const CAlert& alert = (*mi).second;
1881 printf("cancelling alert %d\n", alert.nID);
1882 mapAlerts.erase(mi++);
1884 else if (!alert.IsInEffect())
1886 printf("expiring alert %d\n", alert.nID);
1887 mapAlerts.erase(mi++);
1893 // Check if this alert has been cancelled
1894 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1896 const CAlert& alert = item.second;
1897 if (alert.Cancels(*this))
1899 printf("alert already cancelled by %d\n", alert.nID);
1905 mapAlerts.insert(make_pair(GetHash(), *this));
1908 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1920 //////////////////////////////////////////////////////////////////////////////
1926 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1930 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1931 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1933 // Don't know what it is, just say we already got one
1940 // The message start string is designed to be unlikely to occur in normal data.
1941 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1942 // a large 4-byte int at any alignment.
1943 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1946 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1948 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1949 RandAddSeedPerfmon();
1951 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1952 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1954 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1956 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1964 if (strCommand == "version")
1966 // Each connection can only send one version message
1967 if (pfrom->nVersion != 0)
1969 pfrom->Misbehaving(1);
1977 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1978 if (pfrom->nVersion == 10300)
1979 pfrom->nVersion = 300;
1980 if (pfrom->nVersion >= 106 && !vRecv.empty())
1981 vRecv >> addrFrom >> nNonce;
1982 if (pfrom->nVersion >= 106 && !vRecv.empty())
1983 vRecv >> pfrom->strSubVer;
1984 if (pfrom->nVersion >= 209 && !vRecv.empty())
1985 vRecv >> pfrom->nStartingHeight;
1987 if (pfrom->nVersion == 0)
1990 // Disconnect if we connected to ourself
1991 if (nNonce == nLocalHostNonce && nNonce > 1)
1993 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1994 pfrom->fDisconnect = true;
1998 // ppcoin: record my external IP reported by peer
1999 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
2000 addrSeenByPeer = addrMe;
2002 // Be shy and don't send version until we hear
2003 if (pfrom->fInbound)
2004 pfrom->PushVersion();
2006 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2008 AddTimeData(pfrom->addr.ip, nTime);
2011 if (pfrom->nVersion >= 209)
2012 pfrom->PushMessage("verack");
2013 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2014 if (pfrom->nVersion < 209)
2015 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2017 if (!pfrom->fInbound)
2019 // Advertise our address
2020 if (addrLocalHost.IsRoutable() && !fUseProxy)
2022 CAddress addr(addrLocalHost);
2023 addr.nTime = GetAdjustedTime();
2024 pfrom->PushAddress(addr);
2027 // Get recent addresses
2028 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2030 pfrom->PushMessage("getaddr");
2031 pfrom->fGetAddr = true;
2035 // Ask the first connected node for block updates
2036 static int nAskedForBlocks;
2037 if (!pfrom->fClient &&
2038 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2039 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2042 pfrom->PushGetBlocks(pindexBest, uint256(0));
2046 CRITICAL_BLOCK(cs_mapAlerts)
2047 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2048 item.second.RelayTo(pfrom);
2050 pfrom->fSuccessfullyConnected = true;
2052 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2054 cPeerBlockCounts.input(pfrom->nStartingHeight);
2058 else if (pfrom->nVersion == 0)
2060 // Must have a version message before anything else
2061 pfrom->Misbehaving(1);
2066 else if (strCommand == "verack")
2068 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2072 else if (strCommand == "addr")
2074 vector<CAddress> vAddr;
2077 // Don't want addr from older versions unless seeding
2078 if (pfrom->nVersion < 209)
2080 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2082 if (vAddr.size() > 1000)
2084 pfrom->Misbehaving(20);
2085 return error("message addr size() = %d", vAddr.size());
2088 // Store the new addresses
2091 int64 nNow = GetAdjustedTime();
2092 int64 nSince = nNow - 10 * 60;
2093 BOOST_FOREACH(CAddress& addr, vAddr)
2097 // ignore IPv6 for now, since it isn't implemented anyway
2100 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2101 addr.nTime = nNow - 5 * 24 * 60 * 60;
2102 AddAddress(addr, 2 * 60 * 60, &addrDB);
2103 pfrom->AddAddressKnown(addr);
2104 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2106 // Relay to a limited number of other nodes
2107 CRITICAL_BLOCK(cs_vNodes)
2109 // Use deterministic randomness to send to the same nodes for 24 hours
2110 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2111 static uint256 hashSalt;
2113 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2114 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2115 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2116 multimap<uint256, CNode*> mapMix;
2117 BOOST_FOREACH(CNode* pnode, vNodes)
2119 if (pnode->nVersion < 31402)
2121 unsigned int nPointer;
2122 memcpy(&nPointer, &pnode, sizeof(nPointer));
2123 uint256 hashKey = hashRand ^ nPointer;
2124 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2125 mapMix.insert(make_pair(hashKey, pnode));
2127 int nRelayNodes = 2;
2128 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2129 ((*mi).second)->PushAddress(addr);
2133 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2134 if (vAddr.size() < 1000)
2135 pfrom->fGetAddr = false;
2139 else if (strCommand == "inv")
2143 if (vInv.size() > 50000)
2145 pfrom->Misbehaving(20);
2146 return error("message inv size() = %d", vInv.size());
2150 BOOST_FOREACH(const CInv& inv, vInv)
2154 pfrom->AddInventoryKnown(inv);
2156 bool fAlreadyHave = AlreadyHave(txdb, inv);
2158 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2162 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2163 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2165 // Track requests for our stuff
2166 Inventory(inv.hash);
2171 else if (strCommand == "getdata")
2175 if (vInv.size() > 50000)
2177 pfrom->Misbehaving(20);
2178 return error("message getdata size() = %d", vInv.size());
2181 BOOST_FOREACH(const CInv& inv, vInv)
2185 printf("received getdata for: %s\n", inv.ToString().c_str());
2187 if (inv.type == MSG_BLOCK)
2189 // Send block from disk
2190 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2191 if (mi != mapBlockIndex.end())
2194 block.ReadFromDisk((*mi).second);
2195 pfrom->PushMessage("block", block);
2197 // Trigger them to send a getblocks request for the next batch of inventory
2198 if (inv.hash == pfrom->hashContinue)
2200 // Bypass PushInventory, this must send even if redundant,
2201 // and we want it right after the last block so they don't
2202 // wait for other stuff first.
2204 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2205 pfrom->PushMessage("inv", vInv);
2206 pfrom->hashContinue = 0;
2210 else if (inv.IsKnownType())
2212 // Send stream from relay memory
2213 CRITICAL_BLOCK(cs_mapRelay)
2215 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2216 if (mi != mapRelay.end())
2217 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2221 // Track requests for our stuff
2222 Inventory(inv.hash);
2227 else if (strCommand == "getblocks")
2229 CBlockLocator locator;
2231 vRecv >> locator >> hashStop;
2233 // Find the last block the caller has in the main chain
2234 CBlockIndex* pindex = locator.GetBlockIndex();
2236 // Send the rest of the chain
2238 pindex = pindex->pnext;
2239 int nLimit = 500 + locator.GetDistanceBack();
2240 unsigned int nBytes = 0;
2241 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2242 for (; pindex; pindex = pindex->pnext)
2244 if (pindex->GetBlockHash() == hashStop)
2246 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2249 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2251 block.ReadFromDisk(pindex, true);
2252 nBytes += block.GetSerializeSize(SER_NETWORK);
2253 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2255 // When this block is requested, we'll send an inv that'll make them
2256 // getblocks the next batch of inventory.
2257 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2258 pfrom->hashContinue = pindex->GetBlockHash();
2265 else if (strCommand == "getheaders")
2267 CBlockLocator locator;
2269 vRecv >> locator >> hashStop;
2271 CBlockIndex* pindex = NULL;
2272 if (locator.IsNull())
2274 // If locator is null, return the hashStop block
2275 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2276 if (mi == mapBlockIndex.end())
2278 pindex = (*mi).second;
2282 // Find the last block the caller has in the main chain
2283 pindex = locator.GetBlockIndex();
2285 pindex = pindex->pnext;
2288 vector<CBlock> vHeaders;
2289 int nLimit = 2000 + locator.GetDistanceBack();
2290 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2291 for (; pindex; pindex = pindex->pnext)
2293 vHeaders.push_back(pindex->GetBlockHeader());
2294 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2297 pfrom->PushMessage("headers", vHeaders);
2301 else if (strCommand == "tx")
2303 vector<uint256> vWorkQueue;
2304 CDataStream vMsg(vRecv);
2308 CInv inv(MSG_TX, tx.GetHash());
2309 pfrom->AddInventoryKnown(inv);
2311 bool fMissingInputs = false;
2312 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2314 SyncWithWallets(tx, NULL, true);
2315 RelayMessage(inv, vMsg);
2316 mapAlreadyAskedFor.erase(inv);
2317 vWorkQueue.push_back(inv.hash);
2319 // Recursively process any orphan transactions that depended on this one
2320 for (int i = 0; i < vWorkQueue.size(); i++)
2322 uint256 hashPrev = vWorkQueue[i];
2323 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2324 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2327 const CDataStream& vMsg = *((*mi).second);
2329 CDataStream(vMsg) >> tx;
2330 CInv inv(MSG_TX, tx.GetHash());
2332 if (tx.AcceptToMemoryPool(true))
2334 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2335 SyncWithWallets(tx, NULL, true);
2336 RelayMessage(inv, vMsg);
2337 mapAlreadyAskedFor.erase(inv);
2338 vWorkQueue.push_back(inv.hash);
2343 BOOST_FOREACH(uint256 hash, vWorkQueue)
2344 EraseOrphanTx(hash);
2346 else if (fMissingInputs)
2348 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2351 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2355 else if (strCommand == "block")
2360 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2363 CInv inv(MSG_BLOCK, block.GetHash());
2364 pfrom->AddInventoryKnown(inv);
2366 if (ProcessBlock(pfrom, &block))
2367 mapAlreadyAskedFor.erase(inv);
2368 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2372 else if (strCommand == "getaddr")
2374 // Nodes rebroadcast an addr every 24 hours
2375 pfrom->vAddrToSend.clear();
2376 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2377 CRITICAL_BLOCK(cs_mapAddresses)
2379 unsigned int nCount = 0;
2380 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2382 const CAddress& addr = item.second;
2383 if (addr.nTime > nSince)
2386 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2388 const CAddress& addr = item.second;
2389 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2390 pfrom->PushAddress(addr);
2396 else if (strCommand == "checkorder")
2401 if (!GetBoolArg("-allowreceivebyip"))
2403 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2410 /// we have a chance to check the order here
2412 // Keep giving the same key to the same ip until they use it
2413 if (!mapReuseKey.count(pfrom->addr.ip))
2414 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2416 // Send back approval of order and pubkey to use
2417 CScript scriptPubKey;
2418 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2419 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2423 else if (strCommand == "reply")
2428 CRequestTracker tracker;
2429 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2431 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2432 if (mi != pfrom->mapRequests.end())
2434 tracker = (*mi).second;
2435 pfrom->mapRequests.erase(mi);
2438 if (!tracker.IsNull())
2439 tracker.fn(tracker.param1, vRecv);
2443 else if (strCommand == "ping")
2448 else if (strCommand == "alert")
2453 if (alert.ProcessAlert())
2456 pfrom->setKnown.insert(alert.GetHash());
2457 CRITICAL_BLOCK(cs_vNodes)
2458 BOOST_FOREACH(CNode* pnode, vNodes)
2459 alert.RelayTo(pnode);
2466 // Ignore unknown commands for extensibility
2470 // Update the last seen time for this node's address
2471 if (pfrom->fNetworkNode)
2472 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2473 AddressCurrentlyConnected(pfrom->addr);
2479 bool ProcessMessages(CNode* pfrom)
2481 CDataStream& vRecv = pfrom->vRecv;
2485 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2489 // (4) message start
2498 // Scan for message start
2499 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2500 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2501 if (vRecv.end() - pstart < nHeaderSize)
2503 if (vRecv.size() > nHeaderSize)
2505 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2506 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2510 if (pstart - vRecv.begin() > 0)
2511 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2512 vRecv.erase(vRecv.begin(), pstart);
2515 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2520 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2523 string strCommand = hdr.GetCommand();
2526 unsigned int nMessageSize = hdr.nMessageSize;
2527 if (nMessageSize > MAX_SIZE)
2529 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2532 if (nMessageSize > vRecv.size())
2534 // Rewind and wait for rest of message
2535 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2540 if (vRecv.GetVersion() >= 209)
2542 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2543 unsigned int nChecksum = 0;
2544 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2545 if (nChecksum != hdr.nChecksum)
2547 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2548 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2553 // Copy message to its own buffer
2554 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2555 vRecv.ignore(nMessageSize);
2561 CRITICAL_BLOCK(cs_main)
2562 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2566 catch (std::ios_base::failure& e)
2568 if (strstr(e.what(), "end of data"))
2570 // Allow exceptions from underlength message on vRecv
2571 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());
2573 else if (strstr(e.what(), "size too large"))
2575 // Allow exceptions from overlong size
2576 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2580 PrintExceptionContinue(&e, "ProcessMessage()");
2583 catch (std::exception& e) {
2584 PrintExceptionContinue(&e, "ProcessMessage()");
2586 PrintExceptionContinue(NULL, "ProcessMessage()");
2590 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2598 bool SendMessages(CNode* pto, bool fSendTrickle)
2600 CRITICAL_BLOCK(cs_main)
2602 // Don't send anything until we get their version message
2603 if (pto->nVersion == 0)
2607 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2608 pto->PushMessage("ping");
2610 // Resend wallet transactions that haven't gotten in a block yet
2611 ResendWalletTransactions();
2613 // Address refresh broadcast
2614 static int64 nLastRebroadcast;
2615 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2617 nLastRebroadcast = GetTime();
2618 CRITICAL_BLOCK(cs_vNodes)
2620 BOOST_FOREACH(CNode* pnode, vNodes)
2622 // Periodically clear setAddrKnown to allow refresh broadcasts
2623 pnode->setAddrKnown.clear();
2625 // Rebroadcast our address
2626 if (addrLocalHost.IsRoutable() && !fUseProxy)
2628 CAddress addr(addrLocalHost);
2629 addr.nTime = GetAdjustedTime();
2630 pnode->PushAddress(addr);
2636 // Clear out old addresses periodically so it's not too much work at once
2637 static int64 nLastClear;
2638 if (nLastClear == 0)
2639 nLastClear = GetTime();
2640 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2642 nLastClear = GetTime();
2643 CRITICAL_BLOCK(cs_mapAddresses)
2646 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2647 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2648 mi != mapAddresses.end();)
2650 const CAddress& addr = (*mi).second;
2651 if (addr.nTime < nSince)
2653 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2655 addrdb.EraseAddress(addr);
2656 mapAddresses.erase(mi++);
2670 vector<CAddress> vAddr;
2671 vAddr.reserve(pto->vAddrToSend.size());
2672 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2674 // returns true if wasn't already contained in the set
2675 if (pto->setAddrKnown.insert(addr).second)
2677 vAddr.push_back(addr);
2678 // receiver rejects addr messages larger than 1000
2679 if (vAddr.size() >= 1000)
2681 pto->PushMessage("addr", vAddr);
2686 pto->vAddrToSend.clear();
2688 pto->PushMessage("addr", vAddr);
2693 // Message: inventory
2696 vector<CInv> vInvWait;
2697 CRITICAL_BLOCK(pto->cs_inventory)
2699 vInv.reserve(pto->vInventoryToSend.size());
2700 vInvWait.reserve(pto->vInventoryToSend.size());
2701 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2703 if (pto->setInventoryKnown.count(inv))
2706 // trickle out tx inv to protect privacy
2707 if (inv.type == MSG_TX && !fSendTrickle)
2709 // 1/4 of tx invs blast to all immediately
2710 static uint256 hashSalt;
2712 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2713 uint256 hashRand = inv.hash ^ hashSalt;
2714 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2715 bool fTrickleWait = ((hashRand & 3) != 0);
2717 // always trickle our own transactions
2721 if (GetTransaction(inv.hash, wtx))
2723 fTrickleWait = true;
2728 vInvWait.push_back(inv);
2733 // returns true if wasn't already contained in the set
2734 if (pto->setInventoryKnown.insert(inv).second)
2736 vInv.push_back(inv);
2737 if (vInv.size() >= 1000)
2739 pto->PushMessage("inv", vInv);
2744 pto->vInventoryToSend = vInvWait;
2747 pto->PushMessage("inv", vInv);
2753 vector<CInv> vGetData;
2754 int64 nNow = GetTime() * 1000000;
2756 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2758 const CInv& inv = (*pto->mapAskFor.begin()).second;
2759 if (!AlreadyHave(txdb, inv))
2761 printf("sending getdata: %s\n", inv.ToString().c_str());
2762 vGetData.push_back(inv);
2763 if (vGetData.size() >= 1000)
2765 pto->PushMessage("getdata", vGetData);
2769 mapAlreadyAskedFor[inv] = nNow;
2770 pto->mapAskFor.erase(pto->mapAskFor.begin());
2772 if (!vGetData.empty())
2773 pto->PushMessage("getdata", vGetData);
2792 //////////////////////////////////////////////////////////////////////////////
2797 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2799 unsigned char* pdata = (unsigned char*)pbuffer;
2800 unsigned int blocks = 1 + ((len + 8) / 64);
2801 unsigned char* pend = pdata + 64 * blocks;
2802 memset(pdata + len, 0, 64 * blocks - len);
2804 unsigned int bits = len * 8;
2805 pend[-1] = (bits >> 0) & 0xff;
2806 pend[-2] = (bits >> 8) & 0xff;
2807 pend[-3] = (bits >> 16) & 0xff;
2808 pend[-4] = (bits >> 24) & 0xff;
2812 static const unsigned int pSHA256InitState[8] =
2813 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2815 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2818 unsigned char data[64];
2822 for (int i = 0; i < 16; i++)
2823 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2825 for (int i = 0; i < 8; i++)
2826 ctx.h[i] = ((uint32_t*)pinit)[i];
2828 SHA256_Update(&ctx, data, sizeof(data));
2829 for (int i = 0; i < 8; i++)
2830 ((uint32_t*)pstate)[i] = ctx.h[i];
2834 // ScanHash scans nonces looking for a hash with at least some zero bits.
2835 // It operates on big endian data. Caller does the byte reversing.
2836 // All input buffers are 16-byte aligned. nNonce is usually preserved
2837 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2838 // the block is rebuilt and nNonce starts over at zero.
2840 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2842 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2846 // Hash pdata using pmidstate as the starting state into
2847 // preformatted buffer phash1, then hash phash1 into phash
2849 SHA256Transform(phash1, pdata, pmidstate);
2850 SHA256Transform(phash, phash1, pSHA256InitState);
2852 // Return the nonce if the hash has at least some zero bits,
2853 // caller will check if it has enough to reach the target
2854 if (((unsigned short*)phash)[14] == 0)
2857 // If nothing found after trying for a while, return -1
2858 if ((nNonce & 0xffff) == 0)
2860 nHashesDone = 0xffff+1;
2866 // Some explaining would be appreciated
2871 set<uint256> setDependsOn;
2874 COrphan(CTransaction* ptxIn)
2882 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2883 BOOST_FOREACH(uint256 hash, setDependsOn)
2884 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2889 CBlock* CreateNewBlock(CWallet* pwallet)
2891 CBlockIndex* pindexPrev = pindexBest;
2892 CReserveKey reservekey(pwallet);
2895 auto_ptr<CBlock> pblock(new CBlock());
2899 // Create coinbase tx
2901 txNew.vin.resize(1);
2902 txNew.vin[0].prevout.SetNull();
2903 txNew.vout.resize(1);
2904 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2906 // Add our coinbase tx as first transaction
2907 pblock->vtx.push_back(txNew);
2909 // ppcoin: if coinstake available add coinstake tx
2910 CTransaction txCoinStake;
2911 if (pwallet->CreateCoinStake(txNew.vout[0].scriptPubKey, txCoinStake))
2912 pblock->vtx.push_back(txCoinStake);
2914 // Collect memory pool transactions into the block
2916 CRITICAL_BLOCK(cs_main)
2917 CRITICAL_BLOCK(cs_mapTransactions)
2921 // Priority order to process transactions
2922 list<COrphan> vOrphan; // list memory doesn't move
2923 map<uint256, vector<COrphan*> > mapDependers;
2924 multimap<double, CTransaction*> mapPriority;
2925 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2927 CTransaction& tx = (*mi).second;
2928 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
2931 COrphan* porphan = NULL;
2932 double dPriority = 0;
2933 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2935 // Read prev transaction
2936 CTransaction txPrev;
2938 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2940 // Has to wait for dependencies
2943 // Use list for automatic deletion
2944 vOrphan.push_back(COrphan(&tx));
2945 porphan = &vOrphan.back();
2947 mapDependers[txin.prevout.hash].push_back(porphan);
2948 porphan->setDependsOn.insert(txin.prevout.hash);
2951 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2953 // Read block header
2954 int nConf = txindex.GetDepthInMainChain();
2956 dPriority += (double)nValueIn * nConf;
2958 if (fDebug && GetBoolArg("-printpriority"))
2959 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2962 // Priority is sum(valuein * age) / txsize
2963 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2966 porphan->dPriority = dPriority;
2968 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2970 if (fDebug && GetBoolArg("-printpriority"))
2972 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2979 // Collect transactions into block
2980 map<uint256, CTxIndex> mapTestPool;
2981 uint64 nBlockSize = 1000;
2982 int nBlockSigOps = 100;
2983 while (!mapPriority.empty())
2985 // Take highest priority transaction off priority queue
2986 double dPriority = -(*mapPriority.begin()).first;
2987 CTransaction& tx = *(*mapPriority.begin()).second;
2988 mapPriority.erase(mapPriority.begin());
2991 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2992 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2994 int nTxSigOps = tx.GetSigOpCount();
2995 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2999 if (tx.nTime > GetAdjustedTime())
3002 // ppcoin: simplify transaction fee - allow free = false
3003 int64 nMinFee = tx.GetMinFee(nBlockSize, false, true);
3005 // Connecting shouldn't fail due to dependency on other memory pool transactions
3006 // because we're already processing them in order of dependency
3007 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3008 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
3010 swap(mapTestPool, mapTestPoolTmp);
3013 pblock->vtx.push_back(tx);
3014 nBlockSize += nTxSize;
3015 nBlockSigOps += nTxSigOps;
3017 // Add transactions that depend on this one to the priority queue
3018 uint256 hash = tx.GetHash();
3019 if (mapDependers.count(hash))
3021 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3023 if (!porphan->setDependsOn.empty())
3025 porphan->setDependsOn.erase(hash);
3026 if (porphan->setDependsOn.empty())
3027 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3033 pblock->nBits = GetNextWorkRequired(pindexPrev);
3034 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
3037 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3038 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3039 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3040 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3041 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3044 return pblock.release();
3048 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3050 // Update nExtraNonce
3051 static uint256 hashPrevBlock;
3052 if (hashPrevBlock != pblock->hashPrevBlock)
3055 hashPrevBlock = pblock->hashPrevBlock;
3058 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3059 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3063 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3066 // Prebuild hash buffers
3073 uint256 hashPrevBlock;
3074 uint256 hashMerkleRoot;
3077 unsigned int nNonce;
3080 unsigned char pchPadding0[64];
3082 unsigned char pchPadding1[64];
3085 memset(&tmp, 0, sizeof(tmp));
3087 tmp.block.nVersion = pblock->nVersion;
3088 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3089 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3090 tmp.block.nTime = pblock->nTime;
3091 tmp.block.nBits = pblock->nBits;
3092 tmp.block.nNonce = pblock->nNonce;
3094 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3095 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3097 // Byte swap all the input buffer
3098 for (int i = 0; i < sizeof(tmp)/4; i++)
3099 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3101 // Precalc the first half of the first hash, which stays constant
3102 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3104 memcpy(pdata, &tmp.block, 128);
3105 memcpy(phash1, &tmp.hash1, 64);
3109 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3111 uint256 hash = pblock->GetHash();
3112 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3114 if (hash > hashTarget)
3118 printf("BitcoinMiner:\n");
3119 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3121 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3122 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3125 CRITICAL_BLOCK(cs_main)
3127 if (pblock->hashPrevBlock != hashBestChain)
3128 return error("BitcoinMiner : generated block is stale");
3130 // Remove key from key pool
3131 reservekey.KeepKey();
3133 // Track how many getdata requests this block gets
3134 CRITICAL_BLOCK(wallet.cs_wallet)
3135 wallet.mapRequestCount[pblock->GetHash()] = 0;
3137 // Process this block the same as if we had received it from another node
3138 if (!ProcessBlock(NULL, pblock))
3139 return error("BitcoinMiner : ProcessBlock, block not accepted");
3145 void static ThreadBitcoinMiner(void* parg);
3147 void static BitcoinMiner(CWallet *pwallet)
3149 printf("BitcoinMiner started\n");
3150 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3152 // Each thread has its own key and counter
3153 CReserveKey reservekey(pwallet);
3154 unsigned int nExtraNonce = 0;
3156 while (fGenerateBitcoins)
3158 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3162 while (vNodes.empty() || IsInitialBlockDownload())
3167 if (!fGenerateBitcoins)
3175 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3176 CBlockIndex* pindexPrev = pindexBest;
3178 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet));
3181 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3183 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3187 // Prebuild hash buffers
3189 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3190 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3191 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3193 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3195 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3196 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3202 int64 nStart = GetTime();
3203 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3205 uint256& hash = *alignup<16>(hashbuf);
3208 unsigned int nHashesDone = 0;
3209 unsigned int nNonceFound;
3212 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3213 (char*)&hash, nHashesDone);
3215 // Check if something found
3216 if (nNonceFound != -1)
3218 for (int i = 0; i < sizeof(hash)/4; i++)
3219 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3221 if (hash <= hashTarget)
3224 pblock->nNonce = ByteReverse(nNonceFound);
3225 assert(hash == pblock->GetHash());
3226 // should be able to sign block - assert here for now
3227 assert(pblock->SignBlock(*pwalletMain));
3229 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3230 CheckWork(pblock.get(), *pwalletMain, reservekey);
3231 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3237 static int64 nHashCounter;
3238 if (nHPSTimerStart == 0)
3240 nHPSTimerStart = GetTimeMillis();
3244 nHashCounter += nHashesDone;
3245 if (GetTimeMillis() - nHPSTimerStart > 4000)
3247 static CCriticalSection cs;
3250 if (GetTimeMillis() - nHPSTimerStart > 4000)
3252 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3253 nHPSTimerStart = GetTimeMillis();
3255 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3256 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3257 static int64 nLogTime;
3258 if (GetTime() - nLogTime > 30 * 60)
3260 nLogTime = GetTime();
3261 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3262 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3268 // Check for stop or if block needs to be rebuilt
3271 if (!fGenerateBitcoins)
3273 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3277 if (nBlockNonce >= 0xffff0000)
3279 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3281 if (pindexPrev != pindexBest)
3284 // Update nTime every few seconds
3285 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3286 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3287 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3288 nBlockTime = ByteReverse(pblock->nTime);
3289 if (pblock->GetBlockTime() >= (int64)pblock->vtx[0].nTime + nMaxClockDrift)
3290 break; // need to update coinbase timestamp
3295 void static ThreadBitcoinMiner(void* parg)
3297 CWallet* pwallet = (CWallet*)parg;
3300 vnThreadsRunning[3]++;
3301 BitcoinMiner(pwallet);
3302 vnThreadsRunning[3]--;
3304 catch (std::exception& e) {
3305 vnThreadsRunning[3]--;
3306 PrintException(&e, "ThreadBitcoinMiner()");
3308 vnThreadsRunning[3]--;
3309 PrintException(NULL, "ThreadBitcoinMiner()");
3311 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3313 if (vnThreadsRunning[3] == 0)
3315 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3319 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3321 if (fGenerateBitcoins != fGenerate)
3323 fGenerateBitcoins = fGenerate;
3324 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3327 if (fGenerateBitcoins)
3329 int nProcessors = boost::thread::hardware_concurrency();
3330 printf("%d processors\n", nProcessors);
3331 if (nProcessors < 1)
3333 if (fLimitProcessors && nProcessors > nLimitProcessors)
3334 nProcessors = nLimitProcessors;
3335 int nAddThreads = nProcessors - vnThreadsRunning[3];
3336 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3337 for (int i = 0; i < nAddThreads; i++)
3339 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3340 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");