1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
13 #include "scrypt_mine.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
19 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
40 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
42 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
44 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as minimum age for coin age
45 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as stake age of full weight
46 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
47 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
49 int nCoinbaseMaturity = 500;
50 CBlockIndex* pindexGenesisBlock = NULL;
53 uint256 nBestChainTrust = 0;
54 uint256 nBestInvalidTrust = 0;
56 uint256 hashBestChain = 0;
57 CBlockIndex* pindexBest = NULL;
58 int64 nTimeBestReceived = 0;
60 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
62 map<uint256, CBlock*> mapOrphanBlocks;
63 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
64 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
65 map<uint256, uint256> mapProofOfStake;
67 map<uint256, CDataStream*> mapOrphanTransactions;
68 map<uint256, map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;
70 // Constant stuff for coinbase transactions we create:
71 CScript COINBASE_FLAGS;
73 const string strMessageMagic = "NovaCoin Signed Message:\n";
79 int64 nTransactionFee = MIN_TX_FEE;
82 //////////////////////////////////////////////////////////////////////////////
84 // dispatching functions
87 // These functions dispatch to one or all registered wallets
90 void RegisterWallet(CWallet* pwalletIn)
93 LOCK(cs_setpwalletRegistered);
94 setpwalletRegistered.insert(pwalletIn);
98 void UnregisterWallet(CWallet* pwalletIn)
101 LOCK(cs_setpwalletRegistered);
102 setpwalletRegistered.erase(pwalletIn);
106 // check whether the passed transaction is from us
107 bool static IsFromMe(CTransaction& tx)
109 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
110 if (pwallet->IsFromMe(tx))
115 // get the wallet transaction with the given hash (if it exists)
116 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 if (pwallet->GetTransaction(hashTx,wtx))
124 // erases transaction with the given hash from all wallets
125 void static EraseFromWallets(uint256 hash)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->EraseFromWallet(hash);
131 // make sure all wallets know about the given transaction, in the given block
132 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
136 // ppcoin: wallets need to refund inputs when disconnecting coinstake
137 if (tx.IsCoinStake())
139 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
140 if (pwallet->IsFromMe(tx))
141 pwallet->DisableTransaction(tx);
146 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
147 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
150 // notify wallets about a new best chain
151 void static SetBestChain(const CBlockLocator& loc)
153 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
154 pwallet->SetBestChain(loc);
157 // notify wallets about an updated transaction
158 void static UpdatedTransaction(const uint256& hashTx)
160 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
161 pwallet->UpdatedTransaction(hashTx);
165 void static PrintWallets(const CBlock& block)
167 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
168 pwallet->PrintWallet(block);
171 // notify wallets about an incoming inventory (for request counts)
172 void static Inventory(const uint256& hash)
174 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
175 pwallet->Inventory(hash);
178 // ask wallets to resend their transactions
179 void ResendWalletTransactions()
181 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
182 pwallet->ResendWalletTransactions();
191 //////////////////////////////////////////////////////////////////////////////
193 // mapOrphanTransactions
196 bool AddOrphanTx(const CDataStream& vMsg)
199 CDataStream(vMsg) >> tx;
200 uint256 hash = tx.GetHash();
201 if (mapOrphanTransactions.count(hash))
204 CDataStream* pvMsg = new CDataStream(vMsg);
206 // Ignore big transactions, to avoid a
207 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
208 // large transaction with a missing parent then we assume
209 // it will rebroadcast it later, after the parent transaction(s)
210 // have been mined or received.
211 // 10,000 orphans, each of which is at most 5,000 bytes big is
212 // at most 500 megabytes of orphans:
213 if (pvMsg->size() > 5000)
215 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
220 mapOrphanTransactions[hash] = pvMsg;
221 BOOST_FOREACH(const CTxIn& txin, tx.vin)
222 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
224 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
225 mapOrphanTransactions.size());
229 void static EraseOrphanTx(uint256 hash)
231 if (!mapOrphanTransactions.count(hash))
233 const CDataStream* pvMsg = mapOrphanTransactions[hash];
235 CDataStream(*pvMsg) >> tx;
236 BOOST_FOREACH(const CTxIn& txin, tx.vin)
238 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
239 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
240 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
243 mapOrphanTransactions.erase(hash);
246 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
248 unsigned int nEvicted = 0;
249 while (mapOrphanTransactions.size() > nMaxOrphans)
251 // Evict a random orphan:
252 uint256 randomhash = GetRandHash();
253 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
254 if (it == mapOrphanTransactions.end())
255 it = mapOrphanTransactions.begin();
256 EraseOrphanTx(it->first);
268 //////////////////////////////////////////////////////////////////////////////
270 // CTransaction and CTxIndex
273 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
276 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
278 if (!ReadFromDisk(txindexRet.pos))
280 if (prevout.n >= vout.size())
288 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
291 return ReadFromDisk(txdb, prevout, txindex);
294 bool CTransaction::ReadFromDisk(COutPoint prevout)
298 return ReadFromDisk(txdb, prevout, txindex);
301 bool CTransaction::IsStandard() const
303 if (nVersion > CTransaction::CURRENT_VERSION)
306 BOOST_FOREACH(const CTxIn& txin, vin)
308 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
309 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
310 // ~65-byte public keys, plus a few script ops.
311 if (txin.scriptSig.size() > 500)
313 if (!txin.scriptSig.IsPushOnly())
316 BOOST_FOREACH(const CTxOut& txout, vout) {
317 if (!::IsStandard(txout.scriptPubKey))
319 if (txout.nValue == 0)
326 // Check transaction inputs, and make sure any
327 // pay-to-script-hash transactions are evaluating IsStandard scripts
329 // Why bother? To avoid denial-of-service attacks; an attacker
330 // can submit a standard HASH... OP_EQUAL transaction,
331 // which will get accepted into blocks. The redemption
332 // script can be anything; an attacker could use a very
333 // expensive-to-check-upon-redemption script like:
334 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
336 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
339 return true; // Coinbases don't use vin normally
341 for (unsigned int i = 0; i < vin.size(); i++)
343 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
345 vector<vector<unsigned char> > vSolutions;
346 txnouttype whichType;
347 // get the scriptPubKey corresponding to this input:
348 const CScript& prevScript = prev.scriptPubKey;
349 if (!Solver(prevScript, whichType, vSolutions))
351 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
352 if (nArgsExpected < 0)
355 // Transactions with extra stuff in their scriptSigs are
356 // non-standard. Note that this EvalScript() call will
357 // be quick, because if there are any operations
358 // beside "push data" in the scriptSig the
359 // IsStandard() call returns false
360 vector<vector<unsigned char> > stack;
361 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
364 if (whichType == TX_SCRIPTHASH)
368 CScript subscript(stack.back().begin(), stack.back().end());
369 vector<vector<unsigned char> > vSolutions2;
370 txnouttype whichType2;
371 if (!Solver(subscript, whichType2, vSolutions2))
373 if (whichType2 == TX_SCRIPTHASH)
377 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
380 nArgsExpected += tmpExpected;
383 if (stack.size() != (unsigned int)nArgsExpected)
391 CTransaction::GetLegacySigOpCount() const
393 unsigned int nSigOps = 0;
394 BOOST_FOREACH(const CTxIn& txin, vin)
396 nSigOps += txin.scriptSig.GetSigOpCount(false);
398 BOOST_FOREACH(const CTxOut& txout, vout)
400 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
406 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
418 // Load the block this tx is in
420 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
422 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
427 // Update the tx's hashBlock
428 hashBlock = pblock->GetHash();
430 // Locate the transaction
431 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
432 if (pblock->vtx[nIndex] == *(CTransaction*)this)
434 if (nIndex == (int)pblock->vtx.size())
436 vMerkleBranch.clear();
438 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
442 // Fill in merkle branch
443 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
446 // Is the tx in a block that's in the main chain
447 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
448 if (mi == mapBlockIndex.end())
450 CBlockIndex* pindex = (*mi).second;
451 if (!pindex || !pindex->IsInMainChain())
454 return pindexBest->nHeight - pindex->nHeight + 1;
463 bool CTransaction::CheckTransaction() const
465 // Basic checks that don't depend on any context
467 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
469 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
471 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
472 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
474 // Check for negative or overflow output values
476 for (unsigned int i = 0; i < vout.size(); i++)
478 const CTxOut& txout = vout[i];
479 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
480 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
482 // NovaCoin: enforce minimum output amount for user transactions
483 // (and for all transactions until 20 Sep 2013)
484 if ((!IsCoinBase() || nTime < CHAINCHECKS_SWITCH_TIME)
485 && (!txout.IsEmpty()) && txout.nValue < MIN_TXOUT_AMOUNT)
486 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
488 if (txout.nValue > MAX_MONEY)
489 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
490 nValueOut += txout.nValue;
491 if (!MoneyRange(nValueOut))
492 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
495 // Check for duplicate inputs
496 set<COutPoint> vInOutPoints;
497 BOOST_FOREACH(const CTxIn& txin, vin)
499 if (vInOutPoints.count(txin.prevout))
501 vInOutPoints.insert(txin.prevout);
506 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
507 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
511 BOOST_FOREACH(const CTxIn& txin, vin)
512 if (txin.prevout.IsNull())
513 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
519 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
520 enum GetMinFee_mode mode) const
522 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
523 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
525 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
526 unsigned int nNewBlockSize = nBlockSize + nBytes;
527 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
529 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
530 if (nMinFee < nBaseFee)
532 BOOST_FOREACH(const CTxOut& txout, vout)
533 if (txout.nValue < CENT)
537 // Raise the price as the block approaches full
538 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
540 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
542 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
545 if (!MoneyRange(nMinFee))
551 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
552 bool* pfMissingInputs)
555 *pfMissingInputs = false;
557 if (!tx.CheckTransaction())
558 return error("CTxMemPool::accept() : CheckTransaction failed");
560 // Coinbase is only valid in a block, not as a loose transaction
562 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
564 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
565 if (tx.IsCoinStake())
566 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
568 // To help v0.1.5 clients who would see it as a negative number
569 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
570 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
572 // Rather not work on nonstandard transactions (unless -testnet)
573 if (!fTestNet && !tx.IsStandard())
574 return error("CTxMemPool::accept() : nonstandard transaction type");
576 // Do we already have it?
577 uint256 hash = tx.GetHash();
580 if (mapTx.count(hash))
584 if (txdb.ContainsTx(hash))
587 // Check for conflicts with in-memory transactions
588 CTransaction* ptxOld = NULL;
589 for (unsigned int i = 0; i < tx.vin.size(); i++)
591 COutPoint outpoint = tx.vin[i].prevout;
592 if (mapNextTx.count(outpoint))
594 // Disable replacement feature for now
597 // Allow replacing with a newer version of the same transaction
600 ptxOld = mapNextTx[outpoint].ptx;
601 if (ptxOld->IsFinal())
603 if (!tx.IsNewerThan(*ptxOld))
605 for (unsigned int i = 0; i < tx.vin.size(); i++)
607 COutPoint outpoint = tx.vin[i].prevout;
608 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
618 map<uint256, CTxIndex> mapUnused;
619 bool fInvalid = false;
620 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
623 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
625 *pfMissingInputs = true;
629 // Check for non-standard pay-to-script-hash in inputs
630 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
631 return error("CTxMemPool::accept() : nonstandard transaction input");
633 // Note: if you modify this code to accept non-standard transactions, then
634 // you should add code here to check that the transaction does a
635 // reasonable number of ECDSA signature verifications.
637 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
638 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
640 // Don't accept it if it can't get into a block
641 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY);
642 if (nFees < txMinFee)
643 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
644 hash.ToString().c_str(),
647 // Continuously rate-limit free transactions
648 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
649 // be annoying or make others' transactions take longer to confirm.
650 if (nFees < MIN_RELAY_TX_FEE)
652 static CCriticalSection cs;
653 static double dFreeCount;
654 static int64 nLastTime;
655 int64 nNow = GetTime();
659 // Use an exponentially decaying ~10-minute window:
660 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
662 // -limitfreerelay unit is thousand-bytes-per-minute
663 // At default rate it would take over a month to fill 1GB
664 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
665 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
667 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
672 // Check against previous transactions
673 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
674 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
676 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
680 // Store transaction in memory
685 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
688 addUnchecked(hash, tx);
691 ///// are we sure this is ok when loading transactions or restoring block txes
692 // If updated, erase old tx from wallet
694 EraseFromWallets(ptxOld->GetHash());
696 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
697 hash.ToString().substr(0,10).c_str(),
702 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
704 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
707 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
709 // Add to memory pool without checking anything. Don't call this directly,
710 // call CTxMemPool::accept to properly check the transaction first.
713 for (unsigned int i = 0; i < tx.vin.size(); i++)
714 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
715 nTransactionsUpdated++;
721 bool CTxMemPool::remove(CTransaction &tx)
723 // Remove transaction from memory pool
726 uint256 hash = tx.GetHash();
727 if (mapTx.count(hash))
729 BOOST_FOREACH(const CTxIn& txin, tx.vin)
730 mapNextTx.erase(txin.prevout);
732 nTransactionsUpdated++;
738 void CTxMemPool::clear()
743 ++nTransactionsUpdated;
746 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
751 vtxid.reserve(mapTx.size());
752 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
753 vtxid.push_back((*mi).first);
759 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
761 if (hashBlock == 0 || nIndex == -1)
764 // Find the block it claims to be in
765 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
766 if (mi == mapBlockIndex.end())
768 CBlockIndex* pindex = (*mi).second;
769 if (!pindex || !pindex->IsInMainChain())
772 // Make sure the merkle branch connects to this block
773 if (!fMerkleVerified)
775 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
777 fMerkleVerified = true;
781 return pindexBest->nHeight - pindex->nHeight + 1;
785 int CMerkleTx::GetBlocksToMaturity() const
787 if (!(IsCoinBase() || IsCoinStake()))
789 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
793 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
797 if (!IsInMainChain() && !ClientConnectInputs())
799 return CTransaction::AcceptToMemoryPool(txdb, false);
803 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
807 bool CMerkleTx::AcceptToMemoryPool()
810 return AcceptToMemoryPool(txdb);
815 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
820 // Add previous supporting transactions first
821 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
823 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
825 uint256 hash = tx.GetHash();
826 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
827 tx.AcceptToMemoryPool(txdb, fCheckInputs);
830 return AcceptToMemoryPool(txdb, fCheckInputs);
835 bool CWalletTx::AcceptWalletTransaction()
838 return AcceptWalletTransaction(txdb);
841 int CTxIndex::GetDepthInMainChain() const
845 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
847 // Find the block in the index
848 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
849 if (mi == mapBlockIndex.end())
851 CBlockIndex* pindex = (*mi).second;
852 if (!pindex || !pindex->IsInMainChain())
854 return 1 + nBestHeight - pindex->nHeight;
857 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
858 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
864 if (mempool.exists(hash))
866 tx = mempool.lookup(hash);
872 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
875 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
876 hashBlock = block.GetHash();
890 //////////////////////////////////////////////////////////////////////////////
892 // CBlock and CBlockIndex
895 static CBlockIndex* pblockindexFBBHLast;
896 CBlockIndex* FindBlockByHeight(int nHeight)
898 CBlockIndex *pblockindex;
899 if (nHeight < nBestHeight / 2)
900 pblockindex = pindexGenesisBlock;
902 pblockindex = pindexBest;
903 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
904 pblockindex = pblockindexFBBHLast;
905 while (pblockindex->nHeight > nHeight)
906 pblockindex = pblockindex->pprev;
907 while (pblockindex->nHeight < nHeight)
908 pblockindex = pblockindex->pnext;
909 pblockindexFBBHLast = pblockindex;
913 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
915 if (!fReadTransactions)
917 *this = pindex->GetBlockHeader();
920 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
922 if (GetHash() != pindex->GetBlockHash())
923 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
927 uint256 static GetOrphanRoot(const CBlock* pblock)
929 // Work back to the first block in the orphan chain
930 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
931 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
932 return pblock->GetHash();
935 // ppcoin: find block wanted by given orphan block
936 uint256 WantedByOrphan(const CBlock* pblockOrphan)
938 // Work back to the first block in the orphan chain
939 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
940 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
941 return pblockOrphan->hashPrevBlock;
944 // select stake target limit according to hard-coded conditions
945 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
947 if(fTestNet) // separate proof of stake target limit for testnet
948 return bnProofOfStakeLimit;
949 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
950 return bnProofOfStakeLimit;
951 if(nHeight + 1 > 15000) // 24 bits since block 15000
952 return bnProofOfStakeLegacyLimit;
953 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
954 return bnProofOfStakeHardLimit;
956 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
959 // miner's coin base reward based on nBits
960 int64 GetProofOfWorkReward(unsigned int nBits)
962 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
965 bnTarget.SetCompact(nBits);
966 CBigNum bnTargetLimit = bnProofOfWorkLimit;
967 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
969 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
970 // A reasonably continuous curve is used to avoid shock to market
971 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
973 // Human readable form:
975 // nSubsidy = 100 / (diff ^ 1/6)
976 CBigNum bnLowerBound = CENT;
977 CBigNum bnUpperBound = bnSubsidyLimit;
978 while (bnLowerBound + CENT <= bnUpperBound)
980 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
981 if (fDebug && GetBoolArg("-printcreation"))
982 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
983 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
984 bnUpperBound = bnMidValue;
986 bnLowerBound = bnMidValue;
989 int64 nSubsidy = bnUpperBound.getuint64();
991 nSubsidy = (nSubsidy / CENT) * CENT;
992 if (fDebug && GetBoolArg("-printcreation"))
993 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
995 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
998 // miner's coin stake reward based on nBits and coin age spent (coin-days)
999 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1001 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1003 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1005 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1007 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1009 bnTarget.SetCompact(nBits);
1010 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1011 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1013 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1015 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1016 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1017 bnMidPart, bnRewardPart;
1019 while (bnLowerBound + CENT <= bnUpperBound)
1021 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1022 if (fDebug && GetBoolArg("-printcreation"))
1023 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1025 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1028 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1030 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1032 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1035 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1036 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1041 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1043 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1045 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1048 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1049 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1052 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1053 bnUpperBound = bnMidValue;
1055 bnLowerBound = bnMidValue;
1058 nRewardCoinYear = bnUpperBound.getuint64();
1059 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1063 // Old creation amount per coin-year, 5% fixed stake mint rate
1064 nRewardCoinYear = 5 * CENT;
1068 return nRewardCoinYear;
1070 // Fix problem with proof-of-stake rewards calculation since 20 Sep 2013
1071 if(nTime < CHAINCHECKS_SWITCH_TIME)
1072 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
1074 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1076 // Set reasonable reward limit for large inputs since 20 Oct 2013
1078 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1079 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1081 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1082 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1084 nSubsidy = min(nSubsidy, nSubsidyLimit);
1087 if (fDebug && GetBoolArg("-printcreation"))
1088 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1092 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1094 // get proof of work blocks max spacing according to hard-coded conditions
1095 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1097 if(nTime > TARGETS_SWITCH_TIME)
1098 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1101 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1103 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1107 // minimum amount of work that could possibly be required nTime after
1108 // minimum work required was nBase
1110 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1112 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1115 bnResult.SetCompact(nBase);
1117 while (nTime > 0 && bnResult < bnTargetLimit)
1119 // Maximum 200% adjustment per day...
1121 nTime -= 24 * 60 * 60;
1123 if (bnResult > bnTargetLimit)
1124 bnResult = bnTargetLimit;
1125 return bnResult.GetCompact();
1128 // ppcoin: find last block index up to pindex
1129 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1131 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1132 pindex = pindex->pprev;
1136 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1138 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1140 if (pindexLast == NULL)
1141 return bnTargetLimit.GetCompact(); // genesis block
1143 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1144 if (pindexPrev->pprev == NULL)
1145 return bnTargetLimit.GetCompact(); // first block
1146 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1147 if (pindexPrevPrev->pprev == NULL)
1148 return bnTargetLimit.GetCompact(); // second block
1150 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1152 // ppcoin: target change every block
1153 // ppcoin: retarget with exponential moving toward target spacing
1155 bnNew.SetCompact(pindexPrev->nBits);
1156 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1157 int64 nInterval = nTargetTimespan / nTargetSpacing;
1158 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1159 bnNew /= ((nInterval + 1) * nTargetSpacing);
1161 if (bnNew > bnTargetLimit)
1162 bnNew = bnTargetLimit;
1164 return bnNew.GetCompact();
1167 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1170 bnTarget.SetCompact(nBits);
1173 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1174 return error("CheckProofOfWork() : nBits below minimum work");
1176 // Check proof of work matches claimed amount
1177 if (hash > bnTarget.getuint256())
1178 return error("CheckProofOfWork() : hash doesn't match nBits");
1183 // Return maximum amount of blocks that other nodes claim to have
1184 int GetNumBlocksOfPeers()
1186 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1189 bool IsInitialBlockDownload()
1191 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1193 static int64 nLastUpdate;
1194 static CBlockIndex* pindexLastBest;
1195 if (pindexBest != pindexLastBest)
1197 pindexLastBest = pindexBest;
1198 nLastUpdate = GetTime();
1200 return (GetTime() - nLastUpdate < 10 &&
1201 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1204 void static InvalidChainFound(CBlockIndex* pindexNew)
1206 if (pindexNew->nChainTrust > nBestInvalidTrust)
1208 nBestInvalidTrust = pindexNew->nChainTrust;
1209 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1210 uiInterface.NotifyBlocksChanged();
1213 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1214 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1216 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1217 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1218 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1219 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1220 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1221 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1222 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1223 nBestBlockTrust.Get64(),
1224 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1228 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1230 nTime = max(GetBlockTime(), GetAdjustedTime());
1243 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1245 // Relinquish previous transactions' spent pointers
1248 BOOST_FOREACH(const CTxIn& txin, vin)
1250 COutPoint prevout = txin.prevout;
1252 // Get prev txindex from disk
1254 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1255 return error("DisconnectInputs() : ReadTxIndex failed");
1257 if (prevout.n >= txindex.vSpent.size())
1258 return error("DisconnectInputs() : prevout.n out of range");
1260 // Mark outpoint as not spent
1261 txindex.vSpent[prevout.n].SetNull();
1264 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1265 return error("DisconnectInputs() : UpdateTxIndex failed");
1269 // Remove transaction from index
1270 // This can fail if a duplicate of this transaction was in a chain that got
1271 // reorganized away. This is only possible if this transaction was completely
1272 // spent, so erasing it would be a no-op anyway.
1273 txdb.EraseTxIndex(*this);
1279 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1280 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1282 // FetchInputs can return false either because we just haven't seen some inputs
1283 // (in which case the transaction should be stored as an orphan)
1284 // or because the transaction is malformed (in which case the transaction should
1285 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1289 return true; // Coinbase transactions have no inputs to fetch.
1291 for (unsigned int i = 0; i < vin.size(); i++)
1293 COutPoint prevout = vin[i].prevout;
1294 if (inputsRet.count(prevout.hash))
1295 continue; // Got it already
1298 CTxIndex& txindex = inputsRet[prevout.hash].first;
1300 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1302 // Get txindex from current proposed changes
1303 txindex = mapTestPool.find(prevout.hash)->second;
1307 // Read txindex from txdb
1308 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1310 if (!fFound && (fBlock || fMiner))
1311 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1314 CTransaction& txPrev = inputsRet[prevout.hash].second;
1315 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1317 // Get prev tx from single transactions in memory
1320 if (!mempool.exists(prevout.hash))
1321 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1322 txPrev = mempool.lookup(prevout.hash);
1325 txindex.vSpent.resize(txPrev.vout.size());
1329 // Get prev tx from disk
1330 if (!txPrev.ReadFromDisk(txindex.pos))
1331 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1335 // Make sure all prevout.n indexes are valid:
1336 for (unsigned int i = 0; i < vin.size(); i++)
1338 const COutPoint prevout = vin[i].prevout;
1339 assert(inputsRet.count(prevout.hash) != 0);
1340 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1341 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1342 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1344 // Revisit this if/when transaction replacement is implemented and allows
1347 return DoS(100, error("FetchInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" 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()));
1354 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1356 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1357 if (mi == inputs.end())
1358 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1360 const CTransaction& txPrev = (mi->second).second;
1361 if (input.prevout.n >= txPrev.vout.size())
1362 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1364 return txPrev.vout[input.prevout.n];
1367 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1373 for (unsigned int i = 0; i < vin.size(); i++)
1375 nResult += GetOutputFor(vin[i], inputs).nValue;
1381 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1386 unsigned int nSigOps = 0;
1387 for (unsigned int i = 0; i < vin.size(); i++)
1389 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1390 if (prevout.scriptPubKey.IsPayToScriptHash())
1391 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1396 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
1397 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1398 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1400 // Take over previous transactions' spent pointers
1401 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1402 // fMiner is true when called from the internal bitcoin miner
1403 // ... both are false when called from CTransaction::AcceptToMemoryPool
1408 for (unsigned int i = 0; i < vin.size(); i++)
1410 COutPoint prevout = vin[i].prevout;
1411 assert(inputs.count(prevout.hash) > 0);
1412 CTxIndex& txindex = inputs[prevout.hash].first;
1413 CTransaction& txPrev = inputs[prevout.hash].second;
1415 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1416 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" 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()));
1418 // If prev is coinbase or coinstake, check that it's matured
1419 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1420 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1421 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1422 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1424 // ppcoin: check transaction timestamp
1425 if (txPrev.nTime > nTime)
1426 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1428 // Check for negative or overflow input values
1429 nValueIn += txPrev.vout[prevout.n].nValue;
1430 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1431 return DoS(100, error("ConnectInputs() : txin values out of range"));
1434 // The first loop above does all the inexpensive checks.
1435 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1436 // Helps prevent CPU exhaustion attacks.
1437 for (unsigned int i = 0; i < vin.size(); i++)
1439 COutPoint prevout = vin[i].prevout;
1440 assert(inputs.count(prevout.hash) > 0);
1441 CTxIndex& txindex = inputs[prevout.hash].first;
1442 CTransaction& txPrev = inputs[prevout.hash].second;
1444 // Check for conflicts (double-spend)
1445 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1446 // for an attacker to attempt to split the network.
1447 if (!txindex.vSpent[prevout.n].IsNull())
1448 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());
1450 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1451 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1452 // still computed and checked, and any change will be caught at the next checkpoint.
1453 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1456 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1458 // only during transition phase for P2SH: do not invoke anti-DoS code for
1459 // potentially old clients relaying bad P2SH transactions
1460 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1461 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1463 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1467 // Mark outpoints as spent
1468 txindex.vSpent[prevout.n] = posThisTx;
1471 if (fBlock || fMiner)
1473 mapTestPool[prevout.hash] = txindex;
1479 // ppcoin: coin stake tx earns reward instead of paying fee
1481 if (!GetCoinAge(txdb, nCoinAge))
1482 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1484 int64 nStakeReward = GetValueOut() - nValueIn;
1485 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1487 if (nStakeReward > nCalculatedStakeReward)
1488 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1492 if (nValueIn < GetValueOut())
1493 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1495 // Tally transaction fees
1496 int64 nTxFee = nValueIn - GetValueOut();
1498 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1499 // ppcoin: enforce transaction fees for every block
1500 if (nTxFee < GetMinFee())
1501 return fBlock? DoS(100, error("ConnectInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(GetMinFee()).c_str(), FormatMoney(nTxFee).c_str())) : false;
1504 if (!MoneyRange(nFees))
1505 return DoS(100, error("ConnectInputs() : nFees out of range"));
1513 bool CTransaction::ClientConnectInputs()
1518 // Take over previous transactions' spent pointers
1522 for (unsigned int i = 0; i < vin.size(); i++)
1524 // Get prev tx from single transactions in memory
1525 COutPoint prevout = vin[i].prevout;
1526 if (!mempool.exists(prevout.hash))
1528 CTransaction& txPrev = mempool.lookup(prevout.hash);
1530 if (prevout.n >= txPrev.vout.size())
1534 if (!VerifySignature(txPrev, *this, i, true, 0))
1535 return error("ConnectInputs() : VerifySignature failed");
1537 ///// this is redundant with the mempool.mapNextTx stuff,
1538 ///// not sure which I want to get rid of
1539 ///// this has to go away now that posNext is gone
1540 // // Check for conflicts
1541 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1542 // return error("ConnectInputs() : prev tx already used");
1544 // // Flag outpoints as used
1545 // txPrev.vout[prevout.n].posNext = posThisTx;
1547 nValueIn += txPrev.vout[prevout.n].nValue;
1549 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1550 return error("ClientConnectInputs() : txin values out of range");
1552 if (GetValueOut() > nValueIn)
1562 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1564 // Disconnect in reverse order
1565 for (int i = vtx.size()-1; i >= 0; i--)
1566 if (!vtx[i].DisconnectInputs(txdb))
1569 // Update block index on disk without changing it in memory.
1570 // The memory index structure will be changed after the db commits.
1573 CDiskBlockIndex blockindexPrev(pindex->pprev);
1574 blockindexPrev.hashNext = 0;
1575 if (!txdb.WriteBlockIndex(blockindexPrev))
1576 return error("DisconnectBlock() : WriteBlockIndex failed");
1579 // ppcoin: clean up wallet after disconnecting coinstake
1580 BOOST_FOREACH(CTransaction& tx, vtx)
1581 SyncWithWallets(tx, this, false, false);
1586 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1588 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1589 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1592 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1593 // unless those are already completely spent.
1594 // If such overwrites are allowed, coinbases and transactions depending upon those
1595 // can be duplicated to remove the ability to spend the first instance -- even after
1596 // being sent to another address.
1597 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1598 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1599 // already refuses previously-known transaction ids entirely.
1600 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1601 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1602 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1603 // initial block download.
1604 bool fEnforceBIP30 = true; // Always active in NovaCoin
1605 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1607 //// issue here: it doesn't know the version
1608 unsigned int nTxPos;
1610 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1611 // Since we're just checking the block and not actually connecting it, it might not (and probably shouldn't) be on the disk to get the transaction from
1614 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1616 map<uint256, CTxIndex> mapQueuedChanges;
1619 int64 nValueOut = 0;
1620 unsigned int nSigOps = 0;
1621 BOOST_FOREACH(CTransaction& tx, vtx)
1623 uint256 hashTx = tx.GetHash();
1625 if (fEnforceBIP30) {
1626 CTxIndex txindexOld;
1627 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1628 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1634 nSigOps += tx.GetLegacySigOpCount();
1635 if (nSigOps > MAX_BLOCK_SIGOPS)
1636 return DoS(100, error("ConnectBlock() : too many sigops"));
1638 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1640 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1642 MapPrevTx mapInputs;
1643 if (tx.IsCoinBase())
1644 nValueOut += tx.GetValueOut();
1648 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1651 if (fStrictPayToScriptHash)
1653 // Add in sigops done by pay-to-script-hash inputs;
1654 // this is to prevent a "rogue miner" from creating
1655 // an incredibly-expensive-to-validate block.
1656 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1657 if (nSigOps > MAX_BLOCK_SIGOPS)
1658 return DoS(100, error("ConnectBlock() : too many sigops"));
1661 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1662 int64 nTxValueOut = tx.GetValueOut();
1663 nValueIn += nTxValueIn;
1664 nValueOut += nTxValueOut;
1665 if (!tx.IsCoinStake())
1666 nFees += nTxValueIn - nTxValueOut;
1668 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1672 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1675 // ppcoin: track money supply and mint amount info
1676 pindex->nMint = nValueOut - nValueIn + nFees;
1677 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1678 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1679 return error("Connect() : WriteBlockIndex for pindex failed");
1681 // ppcoin: fees are not collected by miners as in bitcoin
1682 // ppcoin: fees are destroyed to compensate the entire network
1683 if (fDebug && GetBoolArg("-printcreation"))
1684 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1689 // Write queued txindex changes
1690 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1692 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1693 return error("ConnectBlock() : UpdateTxIndex failed");
1696 // Update block index on disk without changing it in memory.
1697 // The memory index structure will be changed after the db commits.
1700 CDiskBlockIndex blockindexPrev(pindex->pprev);
1701 blockindexPrev.hashNext = pindex->GetBlockHash();
1702 if (!txdb.WriteBlockIndex(blockindexPrev))
1703 return error("ConnectBlock() : WriteBlockIndex failed");
1706 // Watch for transactions paying to me
1707 BOOST_FOREACH(CTransaction& tx, vtx)
1708 SyncWithWallets(tx, this, true);
1713 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1715 printf("REORGANIZE\n");
1718 CBlockIndex* pfork = pindexBest;
1719 CBlockIndex* plonger = pindexNew;
1720 while (pfork != plonger)
1722 while (plonger->nHeight > pfork->nHeight)
1723 if (!(plonger = plonger->pprev))
1724 return error("Reorganize() : plonger->pprev is null");
1725 if (pfork == plonger)
1727 if (!(pfork = pfork->pprev))
1728 return error("Reorganize() : pfork->pprev is null");
1731 // List of what to disconnect
1732 vector<CBlockIndex*> vDisconnect;
1733 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1734 vDisconnect.push_back(pindex);
1736 // List of what to connect
1737 vector<CBlockIndex*> vConnect;
1738 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1739 vConnect.push_back(pindex);
1740 reverse(vConnect.begin(), vConnect.end());
1742 printf("REORGANIZE: Disconnect %"PRIszu" blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1743 printf("REORGANIZE: Connect %"PRIszu" blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1745 // Disconnect shorter branch
1746 vector<CTransaction> vResurrect;
1747 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1750 if (!block.ReadFromDisk(pindex))
1751 return error("Reorganize() : ReadFromDisk for disconnect failed");
1752 if (!block.DisconnectBlock(txdb, pindex))
1753 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1755 // Queue memory transactions to resurrect
1756 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1757 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1758 vResurrect.push_back(tx);
1761 // Connect longer branch
1762 vector<CTransaction> vDelete;
1763 for (unsigned int i = 0; i < vConnect.size(); i++)
1765 CBlockIndex* pindex = vConnect[i];
1767 if (!block.ReadFromDisk(pindex))
1768 return error("Reorganize() : ReadFromDisk for connect failed");
1769 if (!block.ConnectBlock(txdb, pindex))
1772 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1775 // Queue memory transactions to delete
1776 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1777 vDelete.push_back(tx);
1779 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1780 return error("Reorganize() : WriteHashBestChain failed");
1782 // Make sure it's successfully written to disk before changing memory structure
1783 if (!txdb.TxnCommit())
1784 return error("Reorganize() : TxnCommit failed");
1786 // Disconnect shorter branch
1787 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1789 pindex->pprev->pnext = NULL;
1791 // Connect longer branch
1792 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1794 pindex->pprev->pnext = pindex;
1796 // Resurrect memory transactions that were in the disconnected branch
1797 BOOST_FOREACH(CTransaction& tx, vResurrect)
1798 tx.AcceptToMemoryPool(txdb, false);
1800 // Delete redundant memory transactions that are in the connected branch
1801 BOOST_FOREACH(CTransaction& tx, vDelete)
1804 printf("REORGANIZE: done\n");
1810 // Called from inside SetBestChain: attaches a block to the new best chain being built
1811 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1813 uint256 hash = GetHash();
1815 // Adding to current best branch
1816 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1819 InvalidChainFound(pindexNew);
1822 if (!txdb.TxnCommit())
1823 return error("SetBestChain() : TxnCommit failed");
1825 // Add to current best branch
1826 pindexNew->pprev->pnext = pindexNew;
1828 // Delete redundant memory transactions
1829 BOOST_FOREACH(CTransaction& tx, vtx)
1835 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1837 uint256 hash = GetHash();
1839 if (!txdb.TxnBegin())
1840 return error("SetBestChain() : TxnBegin failed");
1842 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1844 txdb.WriteHashBestChain(hash);
1845 if (!txdb.TxnCommit())
1846 return error("SetBestChain() : TxnCommit failed");
1847 pindexGenesisBlock = pindexNew;
1849 else if (hashPrevBlock == hashBestChain)
1851 if (!SetBestChainInner(txdb, pindexNew))
1852 return error("SetBestChain() : SetBestChainInner failed");
1856 // the first block in the new chain that will cause it to become the new best chain
1857 CBlockIndex *pindexIntermediate = pindexNew;
1859 // list of blocks that need to be connected afterwards
1860 std::vector<CBlockIndex*> vpindexSecondary;
1862 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1863 // Try to limit how much needs to be done inside
1864 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1866 vpindexSecondary.push_back(pindexIntermediate);
1867 pindexIntermediate = pindexIntermediate->pprev;
1870 if (!vpindexSecondary.empty())
1871 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1873 // Switch to new best branch
1874 if (!Reorganize(txdb, pindexIntermediate))
1877 InvalidChainFound(pindexNew);
1878 return error("SetBestChain() : Reorganize failed");
1881 // Connect further blocks
1882 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1885 if (!block.ReadFromDisk(pindex))
1887 printf("SetBestChain() : ReadFromDisk failed\n");
1890 if (!txdb.TxnBegin()) {
1891 printf("SetBestChain() : TxnBegin 2 failed\n");
1894 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1895 if (!block.SetBestChainInner(txdb, pindex))
1900 // Update best block in wallet (so we can detect restored wallets)
1901 bool fIsInitialDownload = IsInitialBlockDownload();
1902 if (!fIsInitialDownload)
1904 const CBlockLocator locator(pindexNew);
1905 ::SetBestChain(locator);
1909 hashBestChain = hash;
1910 pindexBest = pindexNew;
1911 pblockindexFBBHLast = NULL;
1912 nBestHeight = pindexBest->nHeight;
1913 nBestChainTrust = pindexNew->nChainTrust;
1914 nTimeBestReceived = GetTime();
1915 nTransactionsUpdated++;
1917 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1919 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1920 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1921 CBigNum(nBestChainTrust).ToString().c_str(),
1922 nBestBlockTrust.Get64(),
1923 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1925 // Check the version of the last 100 blocks to see if we need to upgrade:
1926 if (!fIsInitialDownload)
1929 const CBlockIndex* pindex = pindexBest;
1930 for (int i = 0; i < 100 && pindex != NULL; i++)
1932 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1934 pindex = pindex->pprev;
1937 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1938 if (nUpgraded > 100/2)
1939 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1940 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1943 std::string strCmd = GetArg("-blocknotify", "");
1945 if (!fIsInitialDownload && !strCmd.empty())
1947 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1948 boost::thread t(runCommand, strCmd); // thread runs free
1954 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1955 // Only those coins meeting minimum age requirement counts. As those
1956 // transactions not in main chain are not currently indexed so we
1957 // might not find out about their coin age. Older transactions are
1958 // guaranteed to be in main chain by sync-checkpoint. This rule is
1959 // introduced to help nodes establish a consistent view of the coin
1960 // age (trust score) of competing branches.
1961 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1963 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1969 BOOST_FOREACH(const CTxIn& txin, vin)
1971 // First try finding the previous transaction in database
1972 CTransaction txPrev;
1974 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1975 continue; // previous transaction not in main chain
1976 if (nTime < txPrev.nTime)
1977 return false; // Transaction timestamp violation
1979 // Read block header
1981 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1982 return false; // unable to read block of previous transaction
1983 if (block.GetBlockTime() + nStakeMinAge > nTime)
1984 continue; // only count coins meeting min age requirement
1986 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1987 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1989 if (fDebug && GetBoolArg("-printcoinage"))
1990 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1993 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1994 if (fDebug && GetBoolArg("-printcoinage"))
1995 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1996 nCoinAge = bnCoinDay.getuint64();
2000 // ppcoin: total coin age spent in block, in the unit of coin-days.
2001 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2006 BOOST_FOREACH(const CTransaction& tx, vtx)
2009 if (tx.GetCoinAge(txdb, nTxCoinAge))
2010 nCoinAge += nTxCoinAge;
2015 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2017 if (fDebug && GetBoolArg("-printcoinage"))
2018 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2022 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2024 // Check for duplicate
2025 uint256 hash = GetHash();
2026 if (mapBlockIndex.count(hash))
2027 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2029 // Construct new block index object
2030 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2032 return error("AddToBlockIndex() : new CBlockIndex failed");
2033 pindexNew->phashBlock = &hash;
2034 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2035 if (miPrev != mapBlockIndex.end())
2037 pindexNew->pprev = (*miPrev).second;
2038 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2041 // ppcoin: compute chain trust score
2042 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2044 // ppcoin: compute stake entropy bit for stake modifier
2045 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2046 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2048 // ppcoin: record proof-of-stake hash value
2049 if (pindexNew->IsProofOfStake())
2051 if (!mapProofOfStake.count(hash))
2052 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2053 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2056 // ppcoin: compute stake modifier
2057 uint64 nStakeModifier = 0;
2058 bool fGeneratedStakeModifier = false;
2059 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2060 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2061 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2062 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2063 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2064 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2066 // Add to mapBlockIndex
2067 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2068 if (pindexNew->IsProofOfStake())
2069 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2070 pindexNew->phashBlock = &((*mi).first);
2072 // Write to disk block index
2074 if (!txdb.TxnBegin())
2076 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2077 if (!txdb.TxnCommit())
2081 if (pindexNew->nChainTrust > nBestChainTrust)
2082 if (!SetBestChain(txdb, pindexNew))
2087 if (pindexNew == pindexBest)
2089 // Notify UI to display prev block's coinbase if it was ours
2090 static uint256 hashPrevBestCoinBase;
2091 UpdatedTransaction(hashPrevBestCoinBase);
2092 hashPrevBestCoinBase = vtx[0].GetHash();
2095 uiInterface.NotifyBlocksChanged();
2102 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2104 // These are checks that are independent of context
2105 // that can be verified before saving an orphan block.
2108 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2109 return DoS(100, error("CheckBlock() : size limits failed"));
2111 // Special short-term limits to avoid 10,000 BDB lock limit:
2112 if (GetBlockTime() < LOCKS_SWITCH_TIME)
2114 // Rule is: #unique txids referenced <= 4,500
2115 // ... to prevent 10,000 BDB lock exhaustion on old clients
2116 set<uint256> setTxIn;
2117 for (size_t i = 0; i < vtx.size(); i++)
2119 setTxIn.insert(vtx[i].GetHash());
2120 if (i == 0) continue; // skip coinbase txin
2121 BOOST_FOREACH(const CTxIn& txin, vtx[i].vin)
2122 setTxIn.insert(txin.prevout.hash);
2124 size_t nTxids = setTxIn.size();
2126 return error("CheckBlock() : maxlocks violation");
2129 // Check proof of work matches claimed amount
2130 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2131 return DoS(50, error("CheckBlock() : proof of work failed"));
2134 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
2135 return error("CheckBlock() : block timestamp too far in the future");
2137 // First transaction must be coinbase, the rest must not be
2138 if (vtx.empty() || !vtx[0].IsCoinBase())
2139 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2140 for (unsigned int i = 1; i < vtx.size(); i++)
2141 if (vtx[i].IsCoinBase())
2142 return DoS(100, error("CheckBlock() : more than one coinbase"));
2144 // Check coinbase timestamp
2145 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
2146 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2148 if (IsProofOfStake())
2150 assert(nNonce == 0);
2152 // Coinbase output should be empty if proof-of-stake block
2153 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2154 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2156 // Second transaction must be coinstake, the rest must not be
2157 if (vtx.empty() || !vtx[1].IsCoinStake())
2158 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2159 for (unsigned int i = 2; i < vtx.size(); i++)
2160 if (vtx[i].IsCoinStake())
2161 return DoS(100, error("CheckBlock() : more than one coinstake"));
2163 // Check coinstake timestamp
2164 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2165 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2167 // NovaCoin: check proof-of-stake block signature
2168 if (fCheckSig && !CheckBlockSignature(true))
2169 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2173 assert(nNonce != 0);
2175 // Coinbase fee paid until 20 Sep 2013
2176 int64 nFee = GetBlockTime() < CHAINCHECKS_SWITCH_TIME ? vtx[0].GetMinFee() - MIN_TX_FEE : 0;
2178 // Check coinbase reward
2179 if (vtx[0].GetValueOut() > (GetProofOfWorkReward(nBits) - nFee))
2180 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2181 vtx[0].GetValueOut(),
2182 GetProofOfWorkReward(nBits) - nFee));
2184 // Should we check proof-of-work block signature or not?
2186 // * Always skip on TestNet
2187 // * Perform checking for the first 9689 blocks
2188 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2190 if(!fTestNet && fCheckSig)
2192 bool isAfterCheckpoint = (GetBlockTime() > Checkpoints::GetLastCheckpointTime());
2193 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2194 bool checkPoWSig = (isAfterCheckpoint && GetBlockTime() < CHAINCHECKS_SWITCH_TIME);
2196 // NovaCoin: check proof-of-work block signature
2197 if ((checkEntropySig || checkPoWSig) && !CheckBlockSignature(false))
2198 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2202 // Check transactions
2203 BOOST_FOREACH(const CTransaction& tx, vtx)
2205 if (!tx.CheckTransaction())
2206 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2208 // ppcoin: check transaction timestamp
2209 if (GetBlockTime() < (int64)tx.nTime)
2210 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2213 // Check for duplicate txids. This is caught by ConnectInputs(),
2214 // but catching it earlier avoids a potential DoS attack:
2215 set<uint256> uniqueTx;
2216 BOOST_FOREACH(const CTransaction& tx, vtx)
2218 uniqueTx.insert(tx.GetHash());
2220 if (uniqueTx.size() != vtx.size())
2221 return DoS(100, error("CheckBlock() : duplicate transaction"));
2223 unsigned int nSigOps = 0;
2224 BOOST_FOREACH(const CTransaction& tx, vtx)
2226 nSigOps += tx.GetLegacySigOpCount();
2228 if (nSigOps > MAX_BLOCK_SIGOPS)
2229 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2231 // Check merkle root
2232 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2233 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2239 bool CBlock::AcceptBlock()
2241 // Check for duplicate
2242 uint256 hash = GetHash();
2243 if (mapBlockIndex.count(hash))
2244 return error("AcceptBlock() : block already in mapBlockIndex");
2246 // Get prev block index
2247 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2248 if (mi == mapBlockIndex.end())
2249 return DoS(10, error("AcceptBlock() : prev block not found"));
2250 CBlockIndex* pindexPrev = (*mi).second;
2251 int nHeight = pindexPrev->nHeight+1;
2253 // Check proof-of-work or proof-of-stake
2254 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2255 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2257 // Check timestamp against prev
2258 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
2259 return error("AcceptBlock() : block's timestamp is too early");
2261 // Check that all transactions are finalized
2262 BOOST_FOREACH(const CTransaction& tx, vtx)
2263 if (!tx.IsFinal(nHeight, GetBlockTime()))
2264 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2266 // Check that the block chain matches the known block chain up to a checkpoint
2267 if (!Checkpoints::CheckHardened(nHeight, hash))
2268 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2270 // ppcoin: check that the block satisfies synchronized checkpoint
2271 if (!Checkpoints::CheckSync(hash, pindexPrev))
2273 if(!GetBoolArg("-nosynccheckpoints", false))
2275 return error("AcceptBlock() : rejected by synchronized checkpoint");
2279 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2283 // Enforce rule that the coinbase starts with serialized block height
2284 CScript expect = CScript() << nHeight;
2285 if (!std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2286 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2288 // Write block to history file
2289 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2290 return error("AcceptBlock() : out of disk space");
2291 unsigned int nFile = -1;
2292 unsigned int nBlockPos = 0;
2293 if (!WriteToDisk(nFile, nBlockPos))
2294 return error("AcceptBlock() : WriteToDisk failed");
2295 if (!AddToBlockIndex(nFile, nBlockPos))
2296 return error("AcceptBlock() : AddToBlockIndex failed");
2298 // Relay inventory, but don't relay old inventory during initial block download
2299 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2300 if (hashBestChain == hash)
2303 BOOST_FOREACH(CNode* pnode, vNodes)
2304 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2305 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2308 // ppcoin: check pending sync-checkpoint
2309 Checkpoints::AcceptPendingSyncCheckpoint();
2314 uint256 CBlockIndex::GetBlockTrust() const
2317 bnTarget.SetCompact(nBits);
2322 /* Old protocol, will be removed later */
2323 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2324 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2328 // Calculate work amount for block
2329 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2331 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2332 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2334 // Return nPoWTrust for the first 12 blocks
2335 if (pprev == NULL || pprev->nHeight < 12)
2338 const CBlockIndex* currentIndex = pprev;
2340 if(IsProofOfStake())
2342 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2344 // Return 1/3 of score if parent block is not the PoW block
2345 if (!pprev->IsProofOfWork())
2346 return (bnNewTrust / 3).getuint256();
2350 // Check last 12 blocks type
2351 while (pprev->nHeight - currentIndex->nHeight < 12)
2353 if (currentIndex->IsProofOfWork())
2355 currentIndex = currentIndex->pprev;
2358 // Return 1/3 of score if less than 3 PoW blocks found
2360 return (bnNewTrust / 3).getuint256();
2362 return bnNewTrust.getuint256();
2366 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2368 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2369 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2370 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2374 // Check last 12 blocks type
2375 while (pprev->nHeight - currentIndex->nHeight < 12)
2377 if (currentIndex->IsProofOfStake())
2379 currentIndex = currentIndex->pprev;
2382 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2384 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2386 bnTarget.SetCompact(pprev->nBits);
2391 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2393 // Return nPoWTrust + full trust score for previous block nBits
2394 return nPoWTrust + bnNewTrust.getuint256();
2398 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2400 unsigned int nFound = 0;
2401 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2403 if (pstart->nVersion >= minVersion)
2405 pstart = pstart->pprev;
2407 return (nFound >= nRequired);
2410 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2412 // Check for duplicate
2413 uint256 hash = pblock->GetHash();
2414 if (mapBlockIndex.count(hash))
2415 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2416 if (mapOrphanBlocks.count(hash))
2417 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2419 // ppcoin: check proof-of-stake
2420 // Limited duplicity on stake: prevents block flood attack
2421 // Duplicate stake allowed only when there is orphan child block
2422 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2423 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2425 // Preliminary checks
2426 if (!pblock->CheckBlock())
2427 return error("ProcessBlock() : CheckBlock FAILED");
2429 // ppcoin: verify hash target and signature of coinstake tx
2430 if (pblock->IsProofOfStake())
2432 uint256 hashProofOfStake = 0;
2433 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake))
2435 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2436 return false; // do not error here as we expect this during initial block download
2438 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2439 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2442 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2443 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2445 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2446 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2448 bnNewBlock.SetCompact(pblock->nBits);
2450 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, pblock->IsProofOfStake())->nBits, deltaTime));
2451 if (bnNewBlock > bnRequired)
2454 pfrom->Misbehaving(100);
2455 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2459 // ppcoin: ask for pending sync-checkpoint if any
2460 if (!IsInitialBlockDownload())
2461 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2463 // If don't already have its previous block, shunt it off to holding area until we get it
2464 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2466 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2467 CBlock* pblock2 = new CBlock(*pblock);
2468 // ppcoin: check proof-of-stake
2469 if (pblock2->IsProofOfStake())
2471 // Limited duplicity on stake: prevents block flood attack
2472 // Duplicate stake allowed only when there is orphan child block
2473 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2474 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock2->GetProofOfStake().first.ToString().c_str(), pblock2->GetProofOfStake().second, hash.ToString().c_str());
2476 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2478 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2479 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2481 // Ask this guy to fill in what we're missing
2484 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2485 // ppcoin: getblocks may not obtain the ancestor block rejected
2486 // earlier by duplicate-stake check so we ask for it again directly
2487 if (!IsInitialBlockDownload())
2488 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2494 if (!pblock->AcceptBlock())
2495 return error("ProcessBlock() : AcceptBlock FAILED");
2497 // Recursively process any orphan blocks that depended on this one
2498 vector<uint256> vWorkQueue;
2499 vWorkQueue.push_back(hash);
2500 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2502 uint256 hashPrev = vWorkQueue[i];
2503 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2504 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2507 CBlock* pblockOrphan = (*mi).second;
2508 if (pblockOrphan->AcceptBlock())
2509 vWorkQueue.push_back(pblockOrphan->GetHash());
2510 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2511 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2512 delete pblockOrphan;
2514 mapOrphanBlocksByPrev.erase(hashPrev);
2517 printf("ProcessBlock: ACCEPTED\n");
2519 // ppcoin: if responsible for sync-checkpoint send it
2520 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2521 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2526 // ppcoin: sign block
2527 bool CBlock::SignBlock(const CKeyStore& keystore)
2529 vector<valtype> vSolutions;
2530 txnouttype whichType;
2532 if(!IsProofOfStake())
2534 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2536 const CTxOut& txout = vtx[0].vout[i];
2538 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2541 if (whichType == TX_PUBKEY)
2544 valtype& vchPubKey = vSolutions[0];
2547 if (!keystore.GetKey(Hash160(vchPubKey), key))
2549 if (key.GetPubKey() != vchPubKey)
2551 if(!key.Sign(GetHash(), vchBlockSig))
2560 const CTxOut& txout = vtx[1].vout[1];
2562 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2565 if (whichType == TX_PUBKEY)
2568 valtype& vchPubKey = vSolutions[0];
2571 if (!keystore.GetKey(Hash160(vchPubKey), key))
2573 if (key.GetPubKey() != vchPubKey)
2576 return key.Sign(GetHash(), vchBlockSig);
2580 printf("Sign failed\n");
2584 // ppcoin: check block signature
2585 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2587 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2588 return vchBlockSig.empty();
2590 vector<valtype> vSolutions;
2591 txnouttype whichType;
2595 const CTxOut& txout = vtx[1].vout[1];
2597 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2599 if (whichType == TX_PUBKEY)
2601 valtype& vchPubKey = vSolutions[0];
2603 if (!key.SetPubKey(vchPubKey))
2605 if (vchBlockSig.empty())
2607 return key.Verify(GetHash(), vchBlockSig);
2612 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2614 const CTxOut& txout = vtx[0].vout[i];
2616 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2619 if (whichType == TX_PUBKEY)
2622 valtype& vchPubKey = vSolutions[0];
2624 if (!key.SetPubKey(vchPubKey))
2626 if (vchBlockSig.empty())
2628 if(!key.Verify(GetHash(), vchBlockSig))
2638 bool CheckDiskSpace(uint64 nAdditionalBytes)
2640 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2642 // Check for nMinDiskSpace bytes (currently 50MB)
2643 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2646 string strMessage = _("Warning: Disk space is low!");
2647 strMiscWarning = strMessage;
2648 printf("*** %s\n", strMessage.c_str());
2649 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2656 static filesystem::path BlockFilePath(unsigned int nFile)
2658 string strBlockFn = strprintf("blk%04u.dat", nFile);
2659 return GetDataDir() / strBlockFn;
2662 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2664 if ((nFile < 1) || (nFile == (unsigned int) -1))
2666 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2669 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2671 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2680 static unsigned int nCurrentBlockFile = 1;
2682 FILE* AppendBlockFile(unsigned int& nFileRet)
2687 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2690 if (fseek(file, 0, SEEK_END) != 0)
2692 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2693 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2695 nFileRet = nCurrentBlockFile;
2699 nCurrentBlockFile++;
2703 bool LoadBlockIndex(bool fAllowNew)
2707 pchMessageStart[0] = 0xcd;
2708 pchMessageStart[1] = 0xf2;
2709 pchMessageStart[2] = 0xc0;
2710 pchMessageStart[3] = 0xef;
2712 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2713 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2714 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2715 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2716 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2723 if (!txdb.LoadBlockIndex())
2728 // Init with genesis block
2730 if (mapBlockIndex.empty())
2739 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2740 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2741 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2743 // vMerkleTree: 4cb33b3b6a
2747 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2748 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2749 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2751 // vMerkleTree: 4cb33b3b6a
2753 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2755 txNew.nTime = 1360105017;
2756 txNew.vin.resize(1);
2757 txNew.vout.resize(1);
2758 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2759 txNew.vout[0].SetEmpty();
2761 block.vtx.push_back(txNew);
2762 block.hashPrevBlock = 0;
2763 block.hashMerkleRoot = block.BuildMerkleTree();
2765 block.nTime = 1360105017;
2766 block.nBits = bnProofOfWorkLimit.GetCompact();
2767 block.nNonce = !fTestNet ? 1575379 : 46534;
2770 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2772 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2773 assert(block.CheckBlock());
2775 // Start new block file
2777 unsigned int nBlockPos;
2778 if (!block.WriteToDisk(nFile, nBlockPos))
2779 return error("LoadBlockIndex() : writing genesis block to disk failed");
2780 if (!block.AddToBlockIndex(nFile, nBlockPos))
2781 return error("LoadBlockIndex() : genesis block not accepted");
2783 // ppcoin: initialize synchronized checkpoint
2784 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2785 return error("LoadBlockIndex() : failed to init sync checkpoint");
2788 // ppcoin: if checkpoint master key changed must reset sync-checkpoint
2791 string strPubKey = "";
2792 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2794 // write checkpoint master key to db
2796 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2797 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2798 if (!txdb.TxnCommit())
2799 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2800 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2801 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2811 void PrintBlockTree()
2813 // pre-compute tree structure
2814 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2815 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2817 CBlockIndex* pindex = (*mi).second;
2818 mapNext[pindex->pprev].push_back(pindex);
2820 //while (rand() % 3 == 0)
2821 // mapNext[pindex->pprev].push_back(pindex);
2824 vector<pair<int, CBlockIndex*> > vStack;
2825 vStack.push_back(make_pair(0, pindexGenesisBlock));
2828 while (!vStack.empty())
2830 int nCol = vStack.back().first;
2831 CBlockIndex* pindex = vStack.back().second;
2834 // print split or gap
2835 if (nCol > nPrevCol)
2837 for (int i = 0; i < nCol-1; i++)
2841 else if (nCol < nPrevCol)
2843 for (int i = 0; i < nCol; i++)
2850 for (int i = 0; i < nCol; i++)
2855 block.ReadFromDisk(pindex);
2856 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2860 block.GetHash().ToString().c_str(),
2862 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2863 FormatMoney(pindex->nMint).c_str(),
2866 PrintWallets(block);
2868 // put the main time-chain first
2869 vector<CBlockIndex*>& vNext = mapNext[pindex];
2870 for (unsigned int i = 0; i < vNext.size(); i++)
2872 if (vNext[i]->pnext)
2874 swap(vNext[0], vNext[i]);
2880 for (unsigned int i = 0; i < vNext.size(); i++)
2881 vStack.push_back(make_pair(nCol+i, vNext[i]));
2885 bool LoadExternalBlockFile(FILE* fileIn)
2887 int64 nStart = GetTimeMillis();
2893 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2894 unsigned int nPos = 0;
2895 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2897 unsigned char pchData[65536];
2899 fseek(blkdat, nPos, SEEK_SET);
2900 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2903 nPos = (unsigned int)-1;
2906 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2909 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2911 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2914 nPos += ((unsigned char*)nFind - pchData) + 1;
2917 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2918 } while(!fRequestShutdown);
2919 if (nPos == (unsigned int)-1)
2921 fseek(blkdat, nPos, SEEK_SET);
2924 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2928 if (ProcessBlock(NULL,&block))
2936 catch (std::exception &e) {
2937 printf("%s() : Deserialize or I/O error caught during load\n",
2938 __PRETTY_FUNCTION__);
2941 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2953 //////////////////////////////////////////////////////////////////////////////
2958 extern map<uint256, CAlert> mapAlerts;
2959 extern CCriticalSection cs_mapAlerts;
2961 static string strMintMessage = "Info: Minting suspended due to locked wallet.";
2962 static string strMintWarning;
2964 string GetWarnings(string strFor)
2967 string strStatusBar;
2970 if (GetBoolArg("-testsafemode"))
2973 // ppcoin: wallet lock warning for minting
2974 if (strMintWarning != "")
2977 strStatusBar = strMintWarning;
2980 // Misc warnings like out of disk space and clock is wrong
2981 if (strMiscWarning != "")
2984 strStatusBar = strMiscWarning;
2987 // ppcoin: should not enter safe mode for longer invalid chain
2988 // ppcoin: if sync-checkpoint is too old do not enter safe mode
2989 if (Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) && !fTestNet && !IsInitialBlockDownload())
2992 strStatusBar = "WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.";
2995 // ppcoin: if detected invalid checkpoint enter safe mode
2996 if (Checkpoints::hashInvalidCheckpoint != 0)
2999 strStatusBar = strRPC = "WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.";
3005 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3007 const CAlert& alert = item.second;
3008 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3010 nPriority = alert.nPriority;
3011 strStatusBar = alert.strStatusBar;
3012 if (nPriority > 1000)
3013 strRPC = strStatusBar; // ppcoin: safe mode for high alert
3018 if (strFor == "statusbar")
3019 return strStatusBar;
3020 else if (strFor == "rpc")
3022 assert(!"GetWarnings() : invalid parameter");
3033 //////////////////////////////////////////////////////////////////////////////
3039 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3045 bool txInMap = false;
3048 txInMap = (mempool.exists(inv.hash));
3051 mapOrphanTransactions.count(inv.hash) ||
3052 txdb.ContainsTx(inv.hash);
3056 return mapBlockIndex.count(inv.hash) ||
3057 mapOrphanBlocks.count(inv.hash);
3059 // Don't know what it is, just say we already got one
3066 // The message start string is designed to be unlikely to occur in normal data.
3067 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3068 // a large 4-byte int at any alignment.
3069 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3071 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3073 static map<CService, CPubKey> mapReuseKey;
3074 RandAddSeedPerfmon();
3076 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3077 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3079 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3087 if (strCommand == "version")
3089 // Each connection can only send one version message
3090 if (pfrom->nVersion != 0)
3092 pfrom->Misbehaving(1);
3100 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3101 if (pfrom->nVersion < MIN_PROTO_VERSION)
3103 // Since February 20, 2012, the protocol is initiated at version 209,
3104 // and earlier versions are no longer supported
3105 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3106 pfrom->fDisconnect = true;
3110 if (pfrom->nVersion == 10300)
3111 pfrom->nVersion = 300;
3113 vRecv >> addrFrom >> nNonce;
3115 vRecv >> pfrom->strSubVer;
3117 vRecv >> pfrom->nStartingHeight;
3119 if (pfrom->fInbound && addrMe.IsRoutable())
3121 pfrom->addrLocal = addrMe;
3125 // Disconnect if we connected to ourself
3126 if (nNonce == nLocalHostNonce && nNonce > 1)
3128 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3129 pfrom->fDisconnect = true;
3133 // ppcoin: record my external IP reported by peer
3134 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3135 addrSeenByPeer = addrMe;
3137 // Be shy and don't send version until we hear
3138 if (pfrom->fInbound)
3139 pfrom->PushVersion();
3141 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3143 AddTimeData(pfrom->addr, nTime);
3146 pfrom->PushMessage("verack");
3147 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3149 if (!pfrom->fInbound)
3151 // Advertise our address
3152 if (!fNoListen && !IsInitialBlockDownload())
3154 CAddress addr = GetLocalAddress(&pfrom->addr);
3155 if (addr.IsRoutable())
3156 pfrom->PushAddress(addr);
3159 // Get recent addresses
3160 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3162 pfrom->PushMessage("getaddr");
3163 pfrom->fGetAddr = true;
3165 addrman.Good(pfrom->addr);
3167 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3169 addrman.Add(addrFrom, addrFrom);
3170 addrman.Good(addrFrom);
3174 // Ask the first connected node for block updates
3175 static int nAskedForBlocks = 0;
3176 if (!pfrom->fClient && !pfrom->fOneShot &&
3177 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3178 (pfrom->nVersion < NOBLKS_VERSION_START ||
3179 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3180 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3183 pfrom->PushGetBlocks(pindexBest, uint256(0));
3189 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3190 item.second.RelayTo(pfrom);
3193 // ppcoin: relay sync-checkpoint
3195 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3196 if (!Checkpoints::checkpointMessage.IsNull())
3197 Checkpoints::checkpointMessage.RelayTo(pfrom);
3200 pfrom->fSuccessfullyConnected = true;
3202 printf("receive version message: version %d, blocks=%d, us=%s, them=%s, peer=%s\n", pfrom->nVersion, pfrom->nStartingHeight, addrMe.ToString().c_str(), addrFrom.ToString().c_str(), pfrom->addr.ToString().c_str());
3204 cPeerBlockCounts.input(pfrom->nStartingHeight);
3206 // ppcoin: ask for pending sync-checkpoint if any
3207 if (!IsInitialBlockDownload())
3208 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3212 else if (pfrom->nVersion == 0)
3214 // Must have a version message before anything else
3215 pfrom->Misbehaving(1);
3220 else if (strCommand == "verack")
3222 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3226 else if (strCommand == "addr")
3228 vector<CAddress> vAddr;
3231 // Don't want addr from older versions unless seeding
3232 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3234 if (vAddr.size() > 1000)
3236 pfrom->Misbehaving(20);
3237 return error("message addr size() = %"PRIszu"", vAddr.size());
3240 // Store the new addresses
3241 vector<CAddress> vAddrOk;
3242 int64 nNow = GetAdjustedTime();
3243 int64 nSince = nNow - 10 * 60;
3244 BOOST_FOREACH(CAddress& addr, vAddr)
3248 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3249 addr.nTime = nNow - 5 * 24 * 60 * 60;
3250 pfrom->AddAddressKnown(addr);
3251 bool fReachable = IsReachable(addr);
3252 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3254 // Relay to a limited number of other nodes
3257 // Use deterministic randomness to send to the same nodes for 24 hours
3258 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3259 static uint256 hashSalt;
3261 hashSalt = GetRandHash();
3262 uint64 hashAddr = addr.GetHash();
3263 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3264 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3265 multimap<uint256, CNode*> mapMix;
3266 BOOST_FOREACH(CNode* pnode, vNodes)
3268 if (pnode->nVersion < CADDR_TIME_VERSION)
3270 unsigned int nPointer;
3271 memcpy(&nPointer, &pnode, sizeof(nPointer));
3272 uint256 hashKey = hashRand ^ nPointer;
3273 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3274 mapMix.insert(make_pair(hashKey, pnode));
3276 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3277 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3278 ((*mi).second)->PushAddress(addr);
3281 // Do not store addresses outside our network
3283 vAddrOk.push_back(addr);
3285 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3286 if (vAddr.size() < 1000)
3287 pfrom->fGetAddr = false;
3288 if (pfrom->fOneShot)
3289 pfrom->fDisconnect = true;
3293 else if (strCommand == "inv")
3297 if (vInv.size() > MAX_INV_SZ)
3299 pfrom->Misbehaving(20);
3300 return error("message inv size() = %"PRIszu"", vInv.size());
3303 // find last block in inv vector
3304 unsigned int nLastBlock = (unsigned int)(-1);
3305 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3306 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3307 nLastBlock = vInv.size() - 1 - nInv;
3312 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3314 const CInv &inv = vInv[nInv];
3318 pfrom->AddInventoryKnown(inv);
3320 bool fAlreadyHave = AlreadyHave(txdb, inv);
3322 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3326 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3327 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3328 } else if (nInv == nLastBlock) {
3329 // In case we are on a very long side-chain, it is possible that we already have
3330 // the last block in an inv bundle sent in response to getblocks. Try to detect
3331 // this situation and push another getblocks to continue.
3332 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3334 printf("force request: %s\n", inv.ToString().c_str());
3337 // Track requests for our stuff
3338 Inventory(inv.hash);
3343 else if (strCommand == "getdata")
3347 if (vInv.size() > MAX_INV_SZ)
3349 pfrom->Misbehaving(20);
3350 return error("message getdata size() = %"PRIszu"", vInv.size());
3353 if (fDebugNet || (vInv.size() != 1))
3354 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3356 BOOST_FOREACH(const CInv& inv, vInv)
3360 if (fDebugNet || (vInv.size() == 1))
3361 printf("received getdata for: %s\n", inv.ToString().c_str());
3363 if (inv.type == MSG_BLOCK)
3365 // Send block from disk
3366 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3367 if (mi != mapBlockIndex.end())
3370 block.ReadFromDisk((*mi).second);
3371 pfrom->PushMessage("block", block);
3373 // Trigger them to send a getblocks request for the next batch of inventory
3374 if (inv.hash == pfrom->hashContinue)
3376 // ppcoin: send latest proof-of-work block to allow the
3377 // download node to accept as orphan (proof-of-stake
3378 // block might be rejected by stake connection check)
3380 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3381 pfrom->PushMessage("inv", vInv);
3382 pfrom->hashContinue = 0;
3386 else if (inv.IsKnownType())
3388 // Send stream from relay memory
3389 bool pushed = false;
3392 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3393 if (mi != mapRelay.end()) {
3394 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3398 if (!pushed && inv.type == MSG_TX) {
3400 if (mempool.exists(inv.hash)) {
3401 CTransaction tx = mempool.lookup(inv.hash);
3402 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3405 pfrom->PushMessage("tx", ss);
3410 // Track requests for our stuff
3411 Inventory(inv.hash);
3416 else if (strCommand == "getblocks")
3418 CBlockLocator locator;
3420 vRecv >> locator >> hashStop;
3422 // Find the last block the caller has in the main chain
3423 CBlockIndex* pindex = locator.GetBlockIndex();
3425 // Send the rest of the chain
3427 pindex = pindex->pnext;
3429 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3430 for (; pindex; pindex = pindex->pnext)
3432 if (pindex->GetBlockHash() == hashStop)
3434 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3435 // ppcoin: tell downloading node about the latest block if it's
3436 // without risk being rejected due to stake connection check
3437 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3438 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3441 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3444 // When this block is requested, we'll send an inv that'll make them
3445 // getblocks the next batch of inventory.
3446 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3447 pfrom->hashContinue = pindex->GetBlockHash();
3452 else if (strCommand == "checkpoint")
3454 CSyncCheckpoint checkpoint;
3455 vRecv >> checkpoint;
3457 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3460 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3462 BOOST_FOREACH(CNode* pnode, vNodes)
3463 checkpoint.RelayTo(pnode);
3467 else if (strCommand == "getheaders")
3469 CBlockLocator locator;
3471 vRecv >> locator >> hashStop;
3473 CBlockIndex* pindex = NULL;
3474 if (locator.IsNull())
3476 // If locator is null, return the hashStop block
3477 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3478 if (mi == mapBlockIndex.end())
3480 pindex = (*mi).second;
3484 // Find the last block the caller has in the main chain
3485 pindex = locator.GetBlockIndex();
3487 pindex = pindex->pnext;
3490 vector<CBlock> vHeaders;
3492 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3493 for (; pindex; pindex = pindex->pnext)
3495 vHeaders.push_back(pindex->GetBlockHeader());
3496 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3499 pfrom->PushMessage("headers", vHeaders);
3503 else if (strCommand == "tx")
3505 vector<uint256> vWorkQueue;
3506 vector<uint256> vEraseQueue;
3507 CDataStream vMsg(vRecv);
3512 CInv inv(MSG_TX, tx.GetHash());
3513 pfrom->AddInventoryKnown(inv);
3515 // Truncate messages to the size of the tx in them
3516 unsigned int nSize = ::GetSerializeSize(tx,SER_NETWORK, PROTOCOL_VERSION);
3517 if (nSize < vMsg.size()){
3521 bool fMissingInputs = false;
3522 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3524 SyncWithWallets(tx, NULL, true);
3525 RelayMessage(inv, vMsg);
3526 mapAlreadyAskedFor.erase(inv);
3527 vWorkQueue.push_back(inv.hash);
3528 vEraseQueue.push_back(inv.hash);
3530 // Recursively process any orphan transactions that depended on this one
3531 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3533 uint256 hashPrev = vWorkQueue[i];
3534 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3535 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3538 const CDataStream& vMsg = *((*mi).second);
3540 CDataStream(vMsg) >> tx;
3541 CInv inv(MSG_TX, tx.GetHash());
3542 bool fMissingInputs2 = false;
3544 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3546 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3547 SyncWithWallets(tx, NULL, true);
3548 RelayMessage(inv, vMsg);
3549 mapAlreadyAskedFor.erase(inv);
3550 vWorkQueue.push_back(inv.hash);
3551 vEraseQueue.push_back(inv.hash);
3553 else if (!fMissingInputs2)
3556 vEraseQueue.push_back(inv.hash);
3557 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3562 BOOST_FOREACH(uint256 hash, vEraseQueue)
3563 EraseOrphanTx(hash);
3565 else if (fMissingInputs)
3569 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3570 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3572 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3574 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3578 else if (strCommand == "block")
3583 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
3586 CInv inv(MSG_BLOCK, block.GetHash());
3587 pfrom->AddInventoryKnown(inv);
3589 if (ProcessBlock(pfrom, &block))
3590 mapAlreadyAskedFor.erase(inv);
3591 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3595 else if (strCommand == "getaddr")
3597 // Don't return addresses older than nCutOff timestamp
3598 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3599 pfrom->vAddrToSend.clear();
3600 vector<CAddress> vAddr = addrman.GetAddr();
3601 BOOST_FOREACH(const CAddress &addr, vAddr)
3602 if(addr.nTime > nCutOff)
3603 pfrom->PushAddress(addr);
3607 else if (strCommand == "mempool")
3609 std::vector<uint256> vtxid;
3610 mempool.queryHashes(vtxid);
3612 for (unsigned int i = 0; i < vtxid.size(); i++) {
3613 CInv inv(MSG_TX, vtxid[i]);
3614 vInv.push_back(inv);
3615 if (i == (MAX_INV_SZ - 1))
3618 if (vInv.size() > 0)
3619 pfrom->PushMessage("inv", vInv);
3623 else if (strCommand == "checkorder")
3628 if (!GetBoolArg("-allowreceivebyip"))
3630 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3637 /// we have a chance to check the order here
3639 // Keep giving the same key to the same ip until they use it
3640 if (!mapReuseKey.count(pfrom->addr))
3641 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3643 // Send back approval of order and pubkey to use
3644 CScript scriptPubKey;
3645 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3646 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3650 else if (strCommand == "reply")
3655 CRequestTracker tracker;
3657 LOCK(pfrom->cs_mapRequests);
3658 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3659 if (mi != pfrom->mapRequests.end())
3661 tracker = (*mi).second;
3662 pfrom->mapRequests.erase(mi);
3665 if (!tracker.IsNull())
3666 tracker.fn(tracker.param1, vRecv);
3670 else if (strCommand == "ping")
3672 if (pfrom->nVersion > BIP0031_VERSION)
3676 // Echo the message back with the nonce. This allows for two useful features:
3678 // 1) A remote node can quickly check if the connection is operational
3679 // 2) Remote nodes can measure the latency of the network thread. If this node
3680 // is overloaded it won't respond to pings quickly and the remote node can
3681 // avoid sending us more work, like chain download requests.
3683 // The nonce stops the remote getting confused between different pings: without
3684 // it, if the remote node sends a ping once per second and this node takes 5
3685 // seconds to respond to each, the 5th ping the remote sends would appear to
3686 // return very quickly.
3687 pfrom->PushMessage("pong", nonce);
3692 else if (strCommand == "alert")
3697 uint256 alertHash = alert.GetHash();
3698 if (pfrom->setKnown.count(alertHash) == 0)
3700 if (alert.ProcessAlert())
3703 pfrom->setKnown.insert(alertHash);
3706 BOOST_FOREACH(CNode* pnode, vNodes)
3707 alert.RelayTo(pnode);
3711 // Small DoS penalty so peers that send us lots of
3712 // duplicate/expired/invalid-signature/whatever alerts
3713 // eventually get banned.
3714 // This isn't a Misbehaving(100) (immediate ban) because the
3715 // peer might be an older or different implementation with
3716 // a different signature key, etc.
3717 pfrom->Misbehaving(10);
3725 // Ignore unknown commands for extensibility
3729 // Update the last seen time for this node's address
3730 if (pfrom->fNetworkNode)
3731 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3732 AddressCurrentlyConnected(pfrom->addr);
3738 bool ProcessMessages(CNode* pfrom)
3740 CDataStream& vRecv = pfrom->vRecv;
3744 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3748 // (4) message start
3757 // Don't bother if send buffer is too full to respond anyway
3758 if (pfrom->vSend.size() >= SendBufferSize())
3761 // Scan for message start
3762 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3763 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3764 if (vRecv.end() - pstart < nHeaderSize)
3766 if ((int)vRecv.size() > nHeaderSize)
3768 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3769 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3773 if (pstart - vRecv.begin() > 0)
3774 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3775 vRecv.erase(vRecv.begin(), pstart);
3778 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3783 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3786 string strCommand = hdr.GetCommand();
3789 unsigned int nMessageSize = hdr.nMessageSize;
3790 if (nMessageSize > MAX_SIZE)
3792 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3795 if (nMessageSize > vRecv.size())
3797 // Rewind and wait for rest of message
3798 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3803 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3804 unsigned int nChecksum = 0;
3805 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3806 if (nChecksum != hdr.nChecksum)
3808 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3809 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3813 // Copy message to its own buffer
3814 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3815 vRecv.ignore(nMessageSize);
3823 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3828 catch (std::ios_base::failure& e)
3830 if (strstr(e.what(), "end of data"))
3832 // Allow exceptions from under-length message on vRecv
3833 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
3835 else if (strstr(e.what(), "size too large"))
3837 // Allow exceptions from over-long size
3838 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3842 PrintExceptionContinue(&e, "ProcessMessages()");
3845 catch (std::exception& e) {
3846 PrintExceptionContinue(&e, "ProcessMessages()");
3848 PrintExceptionContinue(NULL, "ProcessMessages()");
3852 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3860 bool SendMessages(CNode* pto, bool fSendTrickle)
3862 TRY_LOCK(cs_main, lockMain);
3864 // Don't send anything until we get their version message
3865 if (pto->nVersion == 0)
3868 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3870 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3872 if (pto->nVersion > BIP0031_VERSION)
3873 pto->PushMessage("ping", nonce);
3875 pto->PushMessage("ping");
3878 // Resend wallet transactions that haven't gotten in a block yet
3879 ResendWalletTransactions();
3881 // Address refresh broadcast
3882 static int64 nLastRebroadcast;
3883 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3887 BOOST_FOREACH(CNode* pnode, vNodes)
3889 // Periodically clear setAddrKnown to allow refresh broadcasts
3890 if (nLastRebroadcast)
3891 pnode->setAddrKnown.clear();
3893 // Rebroadcast our address
3896 CAddress addr = GetLocalAddress(&pnode->addr);
3897 if (addr.IsRoutable())
3898 pnode->PushAddress(addr);
3902 nLastRebroadcast = GetTime();
3910 vector<CAddress> vAddr;
3911 vAddr.reserve(pto->vAddrToSend.size());
3912 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3914 // returns true if wasn't already contained in the set
3915 if (pto->setAddrKnown.insert(addr).second)
3917 vAddr.push_back(addr);
3918 // receiver rejects addr messages larger than 1000
3919 if (vAddr.size() >= 1000)
3921 pto->PushMessage("addr", vAddr);
3926 pto->vAddrToSend.clear();
3928 pto->PushMessage("addr", vAddr);
3933 // Message: inventory
3936 vector<CInv> vInvWait;
3938 LOCK(pto->cs_inventory);
3939 vInv.reserve(pto->vInventoryToSend.size());
3940 vInvWait.reserve(pto->vInventoryToSend.size());
3941 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3943 if (pto->setInventoryKnown.count(inv))
3946 // trickle out tx inv to protect privacy
3947 if (inv.type == MSG_TX && !fSendTrickle)
3949 // 1/4 of tx invs blast to all immediately
3950 static uint256 hashSalt;
3952 hashSalt = GetRandHash();
3953 uint256 hashRand = inv.hash ^ hashSalt;
3954 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3955 bool fTrickleWait = ((hashRand & 3) != 0);
3957 // always trickle our own transactions
3961 if (GetTransaction(inv.hash, wtx))
3963 fTrickleWait = true;
3968 vInvWait.push_back(inv);
3973 // returns true if wasn't already contained in the set
3974 if (pto->setInventoryKnown.insert(inv).second)
3976 vInv.push_back(inv);
3977 if (vInv.size() >= 1000)
3979 pto->PushMessage("inv", vInv);
3984 pto->vInventoryToSend = vInvWait;
3987 pto->PushMessage("inv", vInv);
3993 vector<CInv> vGetData;
3994 int64 nNow = GetTime() * 1000000;
3996 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3998 const CInv& inv = (*pto->mapAskFor.begin()).second;
3999 if (!AlreadyHave(txdb, inv))
4002 printf("sending getdata: %s\n", inv.ToString().c_str());
4003 vGetData.push_back(inv);
4004 if (vGetData.size() >= 1000)
4006 pto->PushMessage("getdata", vGetData);
4009 mapAlreadyAskedFor[inv] = nNow;
4011 pto->mapAskFor.erase(pto->mapAskFor.begin());
4013 if (!vGetData.empty())
4014 pto->PushMessage("getdata", vGetData);
4033 //////////////////////////////////////////////////////////////////////////////
4038 int static FormatHashBlocks(void* pbuffer, unsigned int len)
4040 unsigned char* pdata = (unsigned char*)pbuffer;
4041 unsigned int blocks = 1 + ((len + 8) / 64);
4042 unsigned char* pend = pdata + 64 * blocks;
4043 memset(pdata + len, 0, 64 * blocks - len);
4045 unsigned int bits = len * 8;
4046 pend[-1] = (bits >> 0) & 0xff;
4047 pend[-2] = (bits >> 8) & 0xff;
4048 pend[-3] = (bits >> 16) & 0xff;
4049 pend[-4] = (bits >> 24) & 0xff;
4053 static const unsigned int pSHA256InitState[8] =
4054 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
4056 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
4059 unsigned char data[64];
4063 for (int i = 0; i < 16; i++)
4064 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
4066 for (int i = 0; i < 8; i++)
4067 ctx.h[i] = ((uint32_t*)pinit)[i];
4069 SHA256_Update(&ctx, data, sizeof(data));
4070 for (int i = 0; i < 8; i++)
4071 ((uint32_t*)pstate)[i] = ctx.h[i];
4074 // Some explaining would be appreciated
4079 set<uint256> setDependsOn;
4083 COrphan(CTransaction* ptxIn)
4086 dPriority = dFeePerKb = 0;
4091 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
4092 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
4093 BOOST_FOREACH(uint256 hash, setDependsOn)
4094 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
4099 uint64 nLastBlockTx = 0;
4100 uint64 nLastBlockSize = 0;
4101 int64 nLastCoinStakeSearchInterval = 0;
4103 // We want to sort transactions by priority and fee, so:
4104 typedef boost::tuple<double, double, CTransaction*> TxPriority;
4105 class TxPriorityCompare
4109 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
4110 bool operator()(const TxPriority& a, const TxPriority& b)
4114 if (a.get<1>() == b.get<1>())
4115 return a.get<0>() < b.get<0>();
4116 return a.get<1>() < b.get<1>();
4120 if (a.get<0>() == b.get<0>())
4121 return a.get<1>() < b.get<1>();
4122 return a.get<0>() < b.get<0>();
4128 // fProofOfStake: try (best effort) to make a proof-of-stake block
4129 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
4131 CReserveKey reservekey(pwallet);
4134 auto_ptr<CBlock> pblock(new CBlock());
4138 // Create coinbase tx
4140 txNew.vin.resize(1);
4141 txNew.vin[0].prevout.SetNull();
4142 txNew.vout.resize(1);
4143 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
4145 // Add our coinbase tx as first transaction
4146 pblock->vtx.push_back(txNew);
4148 // Largest block you're willing to create:
4149 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
4150 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
4151 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
4153 // Special compatibility rule before 20 Aug: limit size to 500,000 bytes:
4154 if (GetAdjustedTime() < LOCKS_SWITCH_TIME)
4155 nBlockMaxSize = std::min(nBlockMaxSize, (unsigned int)(MAX_BLOCK_SIZE_GEN));
4157 // How much of the block should be dedicated to high-priority transactions,
4158 // included regardless of the fees they pay
4159 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
4160 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
4162 // Minimum block size you want to create; block will be filled with free transactions
4163 // until there are no more or the block reaches this size:
4164 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
4165 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
4167 // Fee-per-kilobyte amount considered the same as "free"
4168 // Be careful setting this: if you set it to zero then
4169 // a transaction spammer can cheaply fill blocks using
4170 // 1-satoshi-fee transactions. It should be set above the real
4171 // cost to you of processing a transaction.
4172 int64 nMinTxFee = MIN_TX_FEE;
4173 if (mapArgs.count("-mintxfee"))
4174 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
4176 // ppcoin: if coinstake available add coinstake tx
4177 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // only initialized at startup
4178 CBlockIndex* pindexPrev = pindexBest;
4180 if (fProofOfStake) // attempt to find a coinstake
4182 pblock->nBits = GetNextTargetRequired(pindexPrev, true);
4183 CTransaction txCoinStake;
4184 int64 nSearchTime = txCoinStake.nTime; // search to current time
4185 if (nSearchTime > nLastCoinStakeSearchTime)
4187 if (pwallet->CreateCoinStake(*pwallet, pblock->nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake))
4189 if (txCoinStake.nTime >= max(pindexPrev->GetMedianTimePast()+1, pindexPrev->GetBlockTime() - nMaxClockDrift))
4190 { // make sure coinstake would meet timestamp protocol
4191 // as it would be the same as the block timestamp
4192 pblock->vtx[0].vout[0].SetEmpty();
4193 pblock->vtx[0].nTime = txCoinStake.nTime;
4194 pblock->vtx.push_back(txCoinStake);
4197 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
4198 nLastCoinStakeSearchTime = nSearchTime;
4202 pblock->nBits = GetNextTargetRequired(pindexPrev, pblock->IsProofOfStake());
4204 // Collect memory pool transactions into the block
4207 LOCK2(cs_main, mempool.cs);
4208 CBlockIndex* pindexPrev = pindexBest;
4211 // Priority order to process transactions
4212 list<COrphan> vOrphan; // list memory doesn't move
4213 map<uint256, vector<COrphan*> > mapDependers;
4215 // This vector will be sorted into a priority queue:
4216 vector<TxPriority> vecPriority;
4217 vecPriority.reserve(mempool.mapTx.size());
4218 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
4220 CTransaction& tx = (*mi).second;
4221 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
4224 COrphan* porphan = NULL;
4225 double dPriority = 0;
4227 bool fMissingInputs = false;
4228 BOOST_FOREACH(const CTxIn& txin, tx.vin)
4230 // Read prev transaction
4231 CTransaction txPrev;
4233 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
4235 // This should never happen; all transactions in the memory
4236 // pool should connect to either transactions in the chain
4237 // or other transactions in the memory pool.
4238 if (!mempool.mapTx.count(txin.prevout.hash))
4240 printf("ERROR: mempool transaction missing input\n");
4241 if (fDebug) assert("mempool transaction missing input" == 0);
4242 fMissingInputs = true;
4248 // Has to wait for dependencies
4251 // Use list for automatic deletion
4252 vOrphan.push_back(COrphan(&tx));
4253 porphan = &vOrphan.back();
4255 mapDependers[txin.prevout.hash].push_back(porphan);
4256 porphan->setDependsOn.insert(txin.prevout.hash);
4257 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
4260 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
4261 nTotalIn += nValueIn;
4263 int nConf = txindex.GetDepthInMainChain();
4264 dPriority += (double)nValueIn * nConf;
4266 if (fMissingInputs) continue;
4268 // Priority is sum(valuein * age) / txsize
4269 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4270 dPriority /= nTxSize;
4272 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
4273 // client code rounds up the size to the nearest 1K. That's good, because it gives an
4274 // incentive to create smaller transactions.
4275 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
4279 porphan->dPriority = dPriority;
4280 porphan->dFeePerKb = dFeePerKb;
4283 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
4286 // Collect transactions into block
4287 map<uint256, CTxIndex> mapTestPool;
4288 uint64 nBlockSize = 1000;
4289 uint64 nBlockTx = 0;
4290 int nBlockSigOps = 100;
4291 bool fSortedByFee = (nBlockPrioritySize <= 0);
4293 TxPriorityCompare comparer(fSortedByFee);
4294 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4296 while (!vecPriority.empty())
4298 // Take highest priority transaction off the priority queue:
4299 double dPriority = vecPriority.front().get<0>();
4300 double dFeePerKb = vecPriority.front().get<1>();
4301 CTransaction& tx = *(vecPriority.front().get<2>());
4303 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
4304 vecPriority.pop_back();
4307 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4308 if (nBlockSize + nTxSize >= nBlockMaxSize)
4311 // Legacy limits on sigOps:
4312 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
4313 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4317 if (tx.nTime > GetAdjustedTime() || (pblock->IsProofOfStake() && tx.nTime > pblock->vtx[1].nTime))
4320 // ppcoin: simplify transaction fee - allow free = false
4321 int64 nMinFee = tx.GetMinFee(nBlockSize, false, GMF_BLOCK);
4323 // Skip free transactions if we're past the minimum block size:
4324 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
4327 // Prioritize by fee once past the priority size or we run out of high-priority
4329 if (!fSortedByFee &&
4330 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
4332 fSortedByFee = true;
4333 comparer = TxPriorityCompare(fSortedByFee);
4334 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4337 // Connecting shouldn't fail due to dependency on other memory pool transactions
4338 // because we're already processing them in order of dependency
4339 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
4340 MapPrevTx mapInputs;
4342 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
4345 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
4346 if (nTxFees < nMinFee)
4349 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
4350 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4353 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
4355 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
4356 swap(mapTestPool, mapTestPoolTmp);
4359 pblock->vtx.push_back(tx);
4360 nBlockSize += nTxSize;
4362 nBlockSigOps += nTxSigOps;
4365 if (fDebug && GetBoolArg("-printpriority"))
4367 printf("priority %.1f feeperkb %.1f txid %s\n",
4368 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
4371 // Add transactions that depend on this one to the priority queue
4372 uint256 hash = tx.GetHash();
4373 if (mapDependers.count(hash))
4375 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
4377 if (!porphan->setDependsOn.empty())
4379 porphan->setDependsOn.erase(hash);
4380 if (porphan->setDependsOn.empty())
4382 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
4383 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
4390 nLastBlockTx = nBlockTx;
4391 nLastBlockSize = nBlockSize;
4393 if (fDebug && GetBoolArg("-printpriority"))
4394 printf("CreateNewBlock(): total size %"PRI64u"\n", nBlockSize);
4396 if (pblock->IsProofOfWork())
4397 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
4400 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
4401 if (pblock->IsProofOfStake())
4402 pblock->nTime = pblock->vtx[1].nTime; //same as coinstake timestamp
4403 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
4404 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
4405 if (pblock->IsProofOfWork())
4406 pblock->UpdateTime(pindexPrev);
4410 return pblock.release();
4414 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
4416 // Update nExtraNonce
4417 static uint256 hashPrevBlock;
4418 if (hashPrevBlock != pblock->hashPrevBlock)
4421 hashPrevBlock = pblock->hashPrevBlock;
4424 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
4425 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
4426 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
4428 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
4432 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
4435 // Pre-build hash buffers
4442 uint256 hashPrevBlock;
4443 uint256 hashMerkleRoot;
4446 unsigned int nNonce;
4449 unsigned char pchPadding0[64];
4451 unsigned char pchPadding1[64];
4454 memset(&tmp, 0, sizeof(tmp));
4456 tmp.block.nVersion = pblock->nVersion;
4457 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
4458 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
4459 tmp.block.nTime = pblock->nTime;
4460 tmp.block.nBits = pblock->nBits;
4461 tmp.block.nNonce = pblock->nNonce;
4463 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
4464 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
4466 // Byte swap all the input buffer
4467 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
4468 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
4470 // Precalc the first half of the first hash, which stays constant
4471 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
4473 memcpy(pdata, &tmp.block, 128);
4474 memcpy(phash1, &tmp.hash1, 64);
4478 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
4480 uint256 hash = pblock->GetHash();
4481 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
4483 if (hash > hashTarget && pblock->IsProofOfWork())
4484 return error("BitcoinMiner : proof-of-work not meeting target");
4487 printf("BitcoinMiner:\n");
4488 printf("new block found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
4490 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
4495 if (pblock->hashPrevBlock != hashBestChain)
4496 return error("BitcoinMiner : generated block is stale");
4498 // Remove key from key pool
4499 reservekey.KeepKey();
4501 // Track how many getdata requests this block gets
4503 LOCK(wallet.cs_wallet);
4504 wallet.mapRequestCount[pblock->GetHash()] = 0;
4507 // Process this block the same as if we had received it from another node
4508 if (!ProcessBlock(NULL, pblock))
4509 return error("BitcoinMiner : ProcessBlock, block not accepted");
4515 void BitcoinMiner(CWallet *pwallet, bool fProofOfStake)
4517 SetThreadPriority(THREAD_PRIORITY_LOWEST);
4519 // Make this thread recognisable as the mining thread
4520 RenameThread("bitcoin-miner");
4522 // Each thread has its own key and counter
4523 CReserveKey reservekey(pwallet);
4524 unsigned int nExtraNonce = 0;
4526 while (fProofOfStake)
4530 while (vNodes.empty() || IsInitialBlockDownload())
4539 while (pwallet->IsLocked())
4541 strMintWarning = strMintMessage;
4544 strMintWarning = "";
4549 CBlockIndex* pindexPrev = pindexBest;
4551 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, fProofOfStake));
4554 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
4558 // ppcoin: if proof-of-stake block found then process block
4559 if (pblock->IsProofOfStake())
4561 if (!pblock->SignBlock(*pwalletMain))
4563 strMintWarning = strMintMessage;
4566 strMintWarning = "";
4567 printf("StakeMiner : proof-of-stake block found %s\n", pblock->GetHash().ToString().c_str());
4568 SetThreadPriority(THREAD_PRIORITY_NORMAL);
4569 CheckWork(pblock.get(), *pwalletMain, reservekey);
4570 SetThreadPriority(THREAD_PRIORITY_LOWEST);