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";
76 int64 nTransactionFee = MIN_TX_FEE;
77 bool fStakeUsePooledKeys = false;
79 //////////////////////////////////////////////////////////////////////////////
81 // dispatching functions
84 // These functions dispatch to one or all registered wallets
87 void RegisterWallet(CWallet* pwalletIn)
90 LOCK(cs_setpwalletRegistered);
91 setpwalletRegistered.insert(pwalletIn);
95 void UnregisterWallet(CWallet* pwalletIn)
98 LOCK(cs_setpwalletRegistered);
99 setpwalletRegistered.erase(pwalletIn);
103 // check whether the passed transaction is from us
104 bool static IsFromMe(CTransaction& tx)
106 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
107 if (pwallet->IsFromMe(tx))
112 // get the wallet transaction with the given hash (if it exists)
113 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
115 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
116 if (pwallet->GetTransaction(hashTx,wtx))
121 // erases transaction with the given hash from all wallets
122 void static EraseFromWallets(uint256 hash)
124 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 pwallet->EraseFromWallet(hash);
128 // make sure all wallets know about the given transaction, in the given block
129 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
133 // ppcoin: wallets need to refund inputs when disconnecting coinstake
134 if (tx.IsCoinStake())
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 if (pwallet->IsFromMe(tx))
138 pwallet->DisableTransaction(tx);
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
147 // notify wallets about a new best chain
148 void static SetBestChain(const CBlockLocator& loc)
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->SetBestChain(loc);
154 // notify wallets about an updated transaction
155 void static UpdatedTransaction(const uint256& hashTx)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->UpdatedTransaction(hashTx);
162 void static PrintWallets(const CBlock& block)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->PrintWallet(block);
168 // notify wallets about an incoming inventory (for request counts)
169 void static Inventory(const uint256& hash)
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->Inventory(hash);
175 // ask wallets to resend their transactions
176 void ResendWalletTransactions()
178 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
179 pwallet->ResendWalletTransactions();
188 //////////////////////////////////////////////////////////////////////////////
190 // mapOrphanTransactions
193 bool AddOrphanTx(const CDataStream& vMsg)
196 CDataStream(vMsg) >> tx;
197 uint256 hash = tx.GetHash();
198 if (mapOrphanTransactions.count(hash))
201 CDataStream* pvMsg = new CDataStream(vMsg);
203 // Ignore big transactions, to avoid a
204 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
205 // large transaction with a missing parent then we assume
206 // it will rebroadcast it later, after the parent transaction(s)
207 // have been mined or received.
208 // 10,000 orphans, each of which is at most 5,000 bytes big is
209 // at most 500 megabytes of orphans:
210 if (pvMsg->size() > 5000)
212 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
217 mapOrphanTransactions[hash] = pvMsg;
218 BOOST_FOREACH(const CTxIn& txin, tx.vin)
219 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
221 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
222 mapOrphanTransactions.size());
226 void static EraseOrphanTx(uint256 hash)
228 if (!mapOrphanTransactions.count(hash))
230 const CDataStream* pvMsg = mapOrphanTransactions[hash];
232 CDataStream(*pvMsg) >> tx;
233 BOOST_FOREACH(const CTxIn& txin, tx.vin)
235 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
236 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
237 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
240 mapOrphanTransactions.erase(hash);
243 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
245 unsigned int nEvicted = 0;
246 while (mapOrphanTransactions.size() > nMaxOrphans)
248 // Evict a random orphan:
249 uint256 randomhash = GetRandHash();
250 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
251 if (it == mapOrphanTransactions.end())
252 it = mapOrphanTransactions.begin();
253 EraseOrphanTx(it->first);
265 //////////////////////////////////////////////////////////////////////////////
267 // CTransaction and CTxIndex
270 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
273 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
275 if (!ReadFromDisk(txindexRet.pos))
277 if (prevout.n >= vout.size())
285 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
288 return ReadFromDisk(txdb, prevout, txindex);
291 bool CTransaction::ReadFromDisk(COutPoint prevout)
295 return ReadFromDisk(txdb, prevout, txindex);
298 bool CTransaction::IsStandard() const
300 if (nVersion > CTransaction::CURRENT_VERSION)
303 BOOST_FOREACH(const CTxIn& txin, vin)
305 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
306 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
307 // ~65-byte public keys, plus a few script ops.
308 if (txin.scriptSig.size() > 500)
310 if (!txin.scriptSig.IsPushOnly())
313 BOOST_FOREACH(const CTxOut& txout, vout) {
314 if (!::IsStandard(txout.scriptPubKey))
316 if (txout.nValue == 0)
323 // Check transaction inputs, and make sure any
324 // pay-to-script-hash transactions are evaluating IsStandard scripts
326 // Why bother? To avoid denial-of-service attacks; an attacker
327 // can submit a standard HASH... OP_EQUAL transaction,
328 // which will get accepted into blocks. The redemption
329 // script can be anything; an attacker could use a very
330 // expensive-to-check-upon-redemption script like:
331 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
333 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
336 return true; // Coinbases don't use vin normally
338 for (unsigned int i = 0; i < vin.size(); i++)
340 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
342 vector<vector<unsigned char> > vSolutions;
343 txnouttype whichType;
344 // get the scriptPubKey corresponding to this input:
345 const CScript& prevScript = prev.scriptPubKey;
346 if (!Solver(prevScript, whichType, vSolutions))
348 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
349 if (nArgsExpected < 0)
352 // Transactions with extra stuff in their scriptSigs are
353 // non-standard. Note that this EvalScript() call will
354 // be quick, because if there are any operations
355 // beside "push data" in the scriptSig the
356 // IsStandard() call returns false
357 vector<vector<unsigned char> > stack;
358 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
361 if (whichType == TX_SCRIPTHASH)
365 CScript subscript(stack.back().begin(), stack.back().end());
366 vector<vector<unsigned char> > vSolutions2;
367 txnouttype whichType2;
368 if (!Solver(subscript, whichType2, vSolutions2))
370 if (whichType2 == TX_SCRIPTHASH)
374 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
377 nArgsExpected += tmpExpected;
380 if (stack.size() != (unsigned int)nArgsExpected)
388 CTransaction::GetLegacySigOpCount() const
390 unsigned int nSigOps = 0;
391 BOOST_FOREACH(const CTxIn& txin, vin)
393 nSigOps += txin.scriptSig.GetSigOpCount(false);
395 BOOST_FOREACH(const CTxOut& txout, vout)
397 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
403 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
415 // Load the block this tx is in
417 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
419 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
424 // Update the tx's hashBlock
425 hashBlock = pblock->GetHash();
427 // Locate the transaction
428 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
429 if (pblock->vtx[nIndex] == *(CTransaction*)this)
431 if (nIndex == (int)pblock->vtx.size())
433 vMerkleBranch.clear();
435 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
439 // Fill in merkle branch
440 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
443 // Is the tx in a block that's in the main chain
444 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
445 if (mi == mapBlockIndex.end())
447 CBlockIndex* pindex = (*mi).second;
448 if (!pindex || !pindex->IsInMainChain())
451 return pindexBest->nHeight - pindex->nHeight + 1;
460 bool CTransaction::CheckTransaction() const
462 // Basic checks that don't depend on any context
464 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
466 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
468 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
469 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
471 // Check for negative or overflow output values
473 for (unsigned int i = 0; i < vout.size(); i++)
475 const CTxOut& txout = vout[i];
476 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
477 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
479 // NovaCoin: enforce minimum output amount for user transactions
480 // (and for all transactions until 20 Sep 2013)
481 if ((!IsCoinBase() || nTime < CHAINCHECKS_SWITCH_TIME)
482 && (!txout.IsEmpty()) && txout.nValue < MIN_TXOUT_AMOUNT)
483 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
485 if (txout.nValue > MAX_MONEY)
486 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
487 nValueOut += txout.nValue;
488 if (!MoneyRange(nValueOut))
489 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
492 // Check for duplicate inputs
493 set<COutPoint> vInOutPoints;
494 BOOST_FOREACH(const CTxIn& txin, vin)
496 if (vInOutPoints.count(txin.prevout))
498 vInOutPoints.insert(txin.prevout);
503 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
504 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
508 BOOST_FOREACH(const CTxIn& txin, vin)
509 if (txin.prevout.IsNull())
510 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
516 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
517 enum GetMinFee_mode mode) const
519 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
520 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
522 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
523 unsigned int nNewBlockSize = nBlockSize + nBytes;
524 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
526 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
527 if (nMinFee < nBaseFee)
529 BOOST_FOREACH(const CTxOut& txout, vout)
530 if (txout.nValue < CENT)
534 // Raise the price as the block approaches full
535 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
537 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
539 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
542 if (!MoneyRange(nMinFee))
548 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
549 bool* pfMissingInputs)
552 *pfMissingInputs = false;
554 if (!tx.CheckTransaction())
555 return error("CTxMemPool::accept() : CheckTransaction failed");
557 // Coinbase is only valid in a block, not as a loose transaction
559 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
561 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
562 if (tx.IsCoinStake())
563 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
565 // To help v0.1.5 clients who would see it as a negative number
566 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
567 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
569 // Rather not work on nonstandard transactions (unless -testnet)
570 if (!fTestNet && !tx.IsStandard())
571 return error("CTxMemPool::accept() : nonstandard transaction type");
573 // Do we already have it?
574 uint256 hash = tx.GetHash();
577 if (mapTx.count(hash))
581 if (txdb.ContainsTx(hash))
584 // Check for conflicts with in-memory transactions
585 CTransaction* ptxOld = NULL;
586 for (unsigned int i = 0; i < tx.vin.size(); i++)
588 COutPoint outpoint = tx.vin[i].prevout;
589 if (mapNextTx.count(outpoint))
591 // Disable replacement feature for now
594 // Allow replacing with a newer version of the same transaction
597 ptxOld = mapNextTx[outpoint].ptx;
598 if (ptxOld->IsFinal())
600 if (!tx.IsNewerThan(*ptxOld))
602 for (unsigned int i = 0; i < tx.vin.size(); i++)
604 COutPoint outpoint = tx.vin[i].prevout;
605 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
615 map<uint256, CTxIndex> mapUnused;
616 bool fInvalid = false;
617 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
620 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
622 *pfMissingInputs = true;
626 // Check for non-standard pay-to-script-hash in inputs
627 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
628 return error("CTxMemPool::accept() : nonstandard transaction input");
630 // Note: if you modify this code to accept non-standard transactions, then
631 // you should add code here to check that the transaction does a
632 // reasonable number of ECDSA signature verifications.
634 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
635 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
637 // Don't accept it if it can't get into a block
638 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY);
639 if (nFees < txMinFee)
640 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
641 hash.ToString().c_str(),
644 // Continuously rate-limit free transactions
645 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
646 // be annoying or make others' transactions take longer to confirm.
647 if (nFees < MIN_RELAY_TX_FEE)
649 static CCriticalSection cs;
650 static double dFreeCount;
651 static int64 nLastTime;
652 int64 nNow = GetTime();
656 // Use an exponentially decaying ~10-minute window:
657 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
659 // -limitfreerelay unit is thousand-bytes-per-minute
660 // At default rate it would take over a month to fill 1GB
661 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
662 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
664 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
669 // Check against previous transactions
670 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
671 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
673 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
677 // Store transaction in memory
682 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
685 addUnchecked(hash, tx);
688 ///// are we sure this is ok when loading transactions or restoring block txes
689 // If updated, erase old tx from wallet
691 EraseFromWallets(ptxOld->GetHash());
693 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
694 hash.ToString().substr(0,10).c_str(),
699 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
701 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
704 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
706 // Add to memory pool without checking anything. Don't call this directly,
707 // call CTxMemPool::accept to properly check the transaction first.
710 for (unsigned int i = 0; i < tx.vin.size(); i++)
711 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
712 nTransactionsUpdated++;
718 bool CTxMemPool::remove(CTransaction &tx)
720 // Remove transaction from memory pool
723 uint256 hash = tx.GetHash();
724 if (mapTx.count(hash))
726 BOOST_FOREACH(const CTxIn& txin, tx.vin)
727 mapNextTx.erase(txin.prevout);
729 nTransactionsUpdated++;
735 void CTxMemPool::clear()
740 ++nTransactionsUpdated;
743 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
748 vtxid.reserve(mapTx.size());
749 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
750 vtxid.push_back((*mi).first);
756 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
758 if (hashBlock == 0 || nIndex == -1)
761 // Find the block it claims to be in
762 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
763 if (mi == mapBlockIndex.end())
765 CBlockIndex* pindex = (*mi).second;
766 if (!pindex || !pindex->IsInMainChain())
769 // Make sure the merkle branch connects to this block
770 if (!fMerkleVerified)
772 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
774 fMerkleVerified = true;
778 return pindexBest->nHeight - pindex->nHeight + 1;
782 int CMerkleTx::GetBlocksToMaturity() const
784 if (!(IsCoinBase() || IsCoinStake()))
786 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
790 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
794 if (!IsInMainChain() && !ClientConnectInputs())
796 return CTransaction::AcceptToMemoryPool(txdb, false);
800 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
804 bool CMerkleTx::AcceptToMemoryPool()
807 return AcceptToMemoryPool(txdb);
812 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
817 // Add previous supporting transactions first
818 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
820 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
822 uint256 hash = tx.GetHash();
823 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
824 tx.AcceptToMemoryPool(txdb, fCheckInputs);
827 return AcceptToMemoryPool(txdb, fCheckInputs);
832 bool CWalletTx::AcceptWalletTransaction()
835 return AcceptWalletTransaction(txdb);
838 int CTxIndex::GetDepthInMainChain() const
842 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
844 // Find the block in the index
845 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
846 if (mi == mapBlockIndex.end())
848 CBlockIndex* pindex = (*mi).second;
849 if (!pindex || !pindex->IsInMainChain())
851 return 1 + nBestHeight - pindex->nHeight;
854 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
855 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
861 if (mempool.exists(hash))
863 tx = mempool.lookup(hash);
869 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
872 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
873 hashBlock = block.GetHash();
887 //////////////////////////////////////////////////////////////////////////////
889 // CBlock and CBlockIndex
892 static CBlockIndex* pblockindexFBBHLast;
893 CBlockIndex* FindBlockByHeight(int nHeight)
895 CBlockIndex *pblockindex;
896 if (nHeight < nBestHeight / 2)
897 pblockindex = pindexGenesisBlock;
899 pblockindex = pindexBest;
900 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
901 pblockindex = pblockindexFBBHLast;
902 while (pblockindex->nHeight > nHeight)
903 pblockindex = pblockindex->pprev;
904 while (pblockindex->nHeight < nHeight)
905 pblockindex = pblockindex->pnext;
906 pblockindexFBBHLast = pblockindex;
910 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
912 if (!fReadTransactions)
914 *this = pindex->GetBlockHeader();
917 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
919 if (GetHash() != pindex->GetBlockHash())
920 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
924 uint256 static GetOrphanRoot(const CBlock* pblock)
926 // Work back to the first block in the orphan chain
927 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
928 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
929 return pblock->GetHash();
932 // ppcoin: find block wanted by given orphan block
933 uint256 WantedByOrphan(const CBlock* pblockOrphan)
935 // Work back to the first block in the orphan chain
936 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
937 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
938 return pblockOrphan->hashPrevBlock;
941 // select stake target limit according to hard-coded conditions
942 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
944 if(fTestNet) // separate proof of stake target limit for testnet
945 return bnProofOfStakeLimit;
946 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
947 return bnProofOfStakeLimit;
948 if(nHeight + 1 > 15000) // 24 bits since block 15000
949 return bnProofOfStakeLegacyLimit;
950 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
951 return bnProofOfStakeHardLimit;
953 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
956 // miner's coin base reward based on nBits
957 int64 GetProofOfWorkReward(unsigned int nBits)
959 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
962 bnTarget.SetCompact(nBits);
963 CBigNum bnTargetLimit = bnProofOfWorkLimit;
964 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
966 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
967 // A reasonably continuous curve is used to avoid shock to market
968 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
970 // Human readable form:
972 // nSubsidy = 100 / (diff ^ 1/6)
973 CBigNum bnLowerBound = CENT;
974 CBigNum bnUpperBound = bnSubsidyLimit;
975 while (bnLowerBound + CENT <= bnUpperBound)
977 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
978 if (fDebug && GetBoolArg("-printcreation"))
979 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
980 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
981 bnUpperBound = bnMidValue;
983 bnLowerBound = bnMidValue;
986 int64 nSubsidy = bnUpperBound.getuint64();
988 nSubsidy = (nSubsidy / CENT) * CENT;
989 if (fDebug && GetBoolArg("-printcreation"))
990 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
992 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
995 // miner's coin stake reward based on nBits and coin age spent (coin-days)
996 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
998 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1000 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1002 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1004 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1006 bnTarget.SetCompact(nBits);
1007 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1008 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1010 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1012 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1013 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1014 bnMidPart, bnRewardPart;
1016 while (bnLowerBound + CENT <= bnUpperBound)
1018 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1019 if (fDebug && GetBoolArg("-printcreation"))
1020 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1022 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1025 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1027 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1029 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1032 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1033 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1038 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1040 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1042 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1045 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1046 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1049 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1050 bnUpperBound = bnMidValue;
1052 bnLowerBound = bnMidValue;
1055 nRewardCoinYear = bnUpperBound.getuint64();
1056 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1060 // Old creation amount per coin-year, 5% fixed stake mint rate
1061 nRewardCoinYear = 5 * CENT;
1065 return nRewardCoinYear;
1067 // Fix problem with proof-of-stake rewards calculation since 20 Sep 2013
1068 if(nTime < CHAINCHECKS_SWITCH_TIME)
1069 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
1071 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1073 // Set reasonable reward limit for large inputs since 20 Oct 2013
1075 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1076 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1078 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1079 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1081 nSubsidy = min(nSubsidy, nSubsidyLimit);
1084 if (fDebug && GetBoolArg("-printcreation"))
1085 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1089 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1091 // get proof of work blocks max spacing according to hard-coded conditions
1092 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1094 if(nTime > TARGETS_SWITCH_TIME)
1095 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1098 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1100 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1104 // maximum nBits value could possible be required nTime after
1106 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1109 bnResult.SetCompact(nBase);
1111 while (nTime > 0 && bnResult < bnTargetLimit)
1113 // Maximum 200% adjustment per day...
1115 nTime -= 24 * 60 * 60;
1117 if (bnResult > bnTargetLimit)
1118 bnResult = bnTargetLimit;
1119 return bnResult.GetCompact();
1123 // minimum amount of work that could possibly be required nTime after
1124 // minimum proof-of-work required was nBase
1126 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1128 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1132 // minimum amount of stake that could possibly be required nTime after
1133 // minimum proof-of-stake required was nBase
1135 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1137 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1141 // ppcoin: find last block index up to pindex
1142 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1144 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1145 pindex = pindex->pprev;
1149 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1151 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1153 if (pindexLast == NULL)
1154 return bnTargetLimit.GetCompact(); // genesis block
1156 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1157 if (pindexPrev->pprev == NULL)
1158 return bnTargetLimit.GetCompact(); // first block
1159 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1160 if (pindexPrevPrev->pprev == NULL)
1161 return bnTargetLimit.GetCompact(); // second block
1163 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1165 // ppcoin: target change every block
1166 // ppcoin: retarget with exponential moving toward target spacing
1168 bnNew.SetCompact(pindexPrev->nBits);
1169 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1170 int64 nInterval = nTargetTimespan / nTargetSpacing;
1171 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1172 bnNew /= ((nInterval + 1) * nTargetSpacing);
1174 if (bnNew > bnTargetLimit)
1175 bnNew = bnTargetLimit;
1177 return bnNew.GetCompact();
1180 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1183 bnTarget.SetCompact(nBits);
1186 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1187 return error("CheckProofOfWork() : nBits below minimum work");
1189 // Check proof of work matches claimed amount
1190 if (hash > bnTarget.getuint256())
1191 return error("CheckProofOfWork() : hash doesn't match nBits");
1196 // Return maximum amount of blocks that other nodes claim to have
1197 int GetNumBlocksOfPeers()
1199 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1202 bool IsInitialBlockDownload()
1204 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1206 static int64 nLastUpdate;
1207 static CBlockIndex* pindexLastBest;
1208 if (pindexBest != pindexLastBest)
1210 pindexLastBest = pindexBest;
1211 nLastUpdate = GetTime();
1213 return (GetTime() - nLastUpdate < 10 &&
1214 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1217 void static InvalidChainFound(CBlockIndex* pindexNew)
1219 if (pindexNew->nChainTrust > nBestInvalidTrust)
1221 nBestInvalidTrust = pindexNew->nChainTrust;
1222 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1223 uiInterface.NotifyBlocksChanged();
1226 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1227 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1229 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1230 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1231 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1232 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1233 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1234 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1235 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1236 nBestBlockTrust.Get64(),
1237 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1241 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1243 nTime = max(GetBlockTime(), GetAdjustedTime());
1256 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1258 // Relinquish previous transactions' spent pointers
1261 BOOST_FOREACH(const CTxIn& txin, vin)
1263 COutPoint prevout = txin.prevout;
1265 // Get prev txindex from disk
1267 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1268 return error("DisconnectInputs() : ReadTxIndex failed");
1270 if (prevout.n >= txindex.vSpent.size())
1271 return error("DisconnectInputs() : prevout.n out of range");
1273 // Mark outpoint as not spent
1274 txindex.vSpent[prevout.n].SetNull();
1277 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1278 return error("DisconnectInputs() : UpdateTxIndex failed");
1282 // Remove transaction from index
1283 // This can fail if a duplicate of this transaction was in a chain that got
1284 // reorganized away. This is only possible if this transaction was completely
1285 // spent, so erasing it would be a no-op anyway.
1286 txdb.EraseTxIndex(*this);
1292 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1293 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1295 // FetchInputs can return false either because we just haven't seen some inputs
1296 // (in which case the transaction should be stored as an orphan)
1297 // or because the transaction is malformed (in which case the transaction should
1298 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1302 return true; // Coinbase transactions have no inputs to fetch.
1304 for (unsigned int i = 0; i < vin.size(); i++)
1306 COutPoint prevout = vin[i].prevout;
1307 if (inputsRet.count(prevout.hash))
1308 continue; // Got it already
1311 CTxIndex& txindex = inputsRet[prevout.hash].first;
1313 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1315 // Get txindex from current proposed changes
1316 txindex = mapTestPool.find(prevout.hash)->second;
1320 // Read txindex from txdb
1321 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1323 if (!fFound && (fBlock || fMiner))
1324 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());
1327 CTransaction& txPrev = inputsRet[prevout.hash].second;
1328 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1330 // Get prev tx from single transactions in memory
1333 if (!mempool.exists(prevout.hash))
1334 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());
1335 txPrev = mempool.lookup(prevout.hash);
1338 txindex.vSpent.resize(txPrev.vout.size());
1342 // Get prev tx from disk
1343 if (!txPrev.ReadFromDisk(txindex.pos))
1344 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1348 // Make sure all prevout.n indexes are valid:
1349 for (unsigned int i = 0; i < vin.size(); i++)
1351 const COutPoint prevout = vin[i].prevout;
1352 assert(inputsRet.count(prevout.hash) != 0);
1353 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1354 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1355 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1357 // Revisit this if/when transaction replacement is implemented and allows
1360 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()));
1367 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1369 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1370 if (mi == inputs.end())
1371 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1373 const CTransaction& txPrev = (mi->second).second;
1374 if (input.prevout.n >= txPrev.vout.size())
1375 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1377 return txPrev.vout[input.prevout.n];
1380 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1386 for (unsigned int i = 0; i < vin.size(); i++)
1388 nResult += GetOutputFor(vin[i], inputs).nValue;
1394 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1399 unsigned int nSigOps = 0;
1400 for (unsigned int i = 0; i < vin.size(); i++)
1402 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1403 if (prevout.scriptPubKey.IsPayToScriptHash())
1404 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1409 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
1410 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1411 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1413 // Take over previous transactions' spent pointers
1414 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1415 // fMiner is true when called from the internal bitcoin miner
1416 // ... both are false when called from CTransaction::AcceptToMemoryPool
1421 for (unsigned int i = 0; i < vin.size(); i++)
1423 COutPoint prevout = vin[i].prevout;
1424 assert(inputs.count(prevout.hash) > 0);
1425 CTxIndex& txindex = inputs[prevout.hash].first;
1426 CTransaction& txPrev = inputs[prevout.hash].second;
1428 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1429 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()));
1431 // If prev is coinbase or coinstake, check that it's matured
1432 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1433 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1434 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1435 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1437 // ppcoin: check transaction timestamp
1438 if (txPrev.nTime > nTime)
1439 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1441 // Check for negative or overflow input values
1442 nValueIn += txPrev.vout[prevout.n].nValue;
1443 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1444 return DoS(100, error("ConnectInputs() : txin values out of range"));
1447 // The first loop above does all the inexpensive checks.
1448 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1449 // Helps prevent CPU exhaustion attacks.
1450 for (unsigned int i = 0; i < vin.size(); i++)
1452 COutPoint prevout = vin[i].prevout;
1453 assert(inputs.count(prevout.hash) > 0);
1454 CTxIndex& txindex = inputs[prevout.hash].first;
1455 CTransaction& txPrev = inputs[prevout.hash].second;
1457 // Check for conflicts (double-spend)
1458 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1459 // for an attacker to attempt to split the network.
1460 if (!txindex.vSpent[prevout.n].IsNull())
1461 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());
1463 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1464 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1465 // still computed and checked, and any change will be caught at the next checkpoint.
1466 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1469 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1471 // only during transition phase for P2SH: do not invoke anti-DoS code for
1472 // potentially old clients relaying bad P2SH transactions
1473 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1474 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1476 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1480 // Mark outpoints as spent
1481 txindex.vSpent[prevout.n] = posThisTx;
1484 if (fBlock || fMiner)
1486 mapTestPool[prevout.hash] = txindex;
1492 // ppcoin: coin stake tx earns reward instead of paying fee
1494 if (!GetCoinAge(txdb, nCoinAge))
1495 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1497 int64 nStakeReward = GetValueOut() - nValueIn;
1498 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1500 if (nStakeReward > nCalculatedStakeReward)
1501 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1505 if (nValueIn < GetValueOut())
1506 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1508 // Tally transaction fees
1509 int64 nTxFee = nValueIn - GetValueOut();
1511 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1512 // ppcoin: enforce transaction fees for every block
1513 if (nTxFee < GetMinFee())
1514 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;
1517 if (!MoneyRange(nFees))
1518 return DoS(100, error("ConnectInputs() : nFees out of range"));
1526 bool CTransaction::ClientConnectInputs()
1531 // Take over previous transactions' spent pointers
1535 for (unsigned int i = 0; i < vin.size(); i++)
1537 // Get prev tx from single transactions in memory
1538 COutPoint prevout = vin[i].prevout;
1539 if (!mempool.exists(prevout.hash))
1541 CTransaction& txPrev = mempool.lookup(prevout.hash);
1543 if (prevout.n >= txPrev.vout.size())
1547 if (!VerifySignature(txPrev, *this, i, true, 0))
1548 return error("ConnectInputs() : VerifySignature failed");
1550 ///// this is redundant with the mempool.mapNextTx stuff,
1551 ///// not sure which I want to get rid of
1552 ///// this has to go away now that posNext is gone
1553 // // Check for conflicts
1554 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1555 // return error("ConnectInputs() : prev tx already used");
1557 // // Flag outpoints as used
1558 // txPrev.vout[prevout.n].posNext = posThisTx;
1560 nValueIn += txPrev.vout[prevout.n].nValue;
1562 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1563 return error("ClientConnectInputs() : txin values out of range");
1565 if (GetValueOut() > nValueIn)
1575 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1577 // Disconnect in reverse order
1578 for (int i = vtx.size()-1; i >= 0; i--)
1579 if (!vtx[i].DisconnectInputs(txdb))
1582 // Update block index on disk without changing it in memory.
1583 // The memory index structure will be changed after the db commits.
1586 CDiskBlockIndex blockindexPrev(pindex->pprev);
1587 blockindexPrev.hashNext = 0;
1588 if (!txdb.WriteBlockIndex(blockindexPrev))
1589 return error("DisconnectBlock() : WriteBlockIndex failed");
1592 // ppcoin: clean up wallet after disconnecting coinstake
1593 BOOST_FOREACH(CTransaction& tx, vtx)
1594 SyncWithWallets(tx, this, false, false);
1599 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1601 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1602 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1605 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1606 // unless those are already completely spent.
1607 // If such overwrites are allowed, coinbases and transactions depending upon those
1608 // can be duplicated to remove the ability to spend the first instance -- even after
1609 // being sent to another address.
1610 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1611 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1612 // already refuses previously-known transaction ids entirely.
1613 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1614 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1615 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1616 // initial block download.
1617 bool fEnforceBIP30 = true; // Always active in NovaCoin
1618 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1620 //// issue here: it doesn't know the version
1621 unsigned int nTxPos;
1623 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1624 // 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
1627 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1629 map<uint256, CTxIndex> mapQueuedChanges;
1632 int64 nValueOut = 0;
1633 unsigned int nSigOps = 0;
1634 BOOST_FOREACH(CTransaction& tx, vtx)
1636 uint256 hashTx = tx.GetHash();
1638 if (fEnforceBIP30) {
1639 CTxIndex txindexOld;
1640 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1641 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1647 nSigOps += tx.GetLegacySigOpCount();
1648 if (nSigOps > MAX_BLOCK_SIGOPS)
1649 return DoS(100, error("ConnectBlock() : too many sigops"));
1651 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1653 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1655 MapPrevTx mapInputs;
1656 if (tx.IsCoinBase())
1657 nValueOut += tx.GetValueOut();
1661 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1664 if (fStrictPayToScriptHash)
1666 // Add in sigops done by pay-to-script-hash inputs;
1667 // this is to prevent a "rogue miner" from creating
1668 // an incredibly-expensive-to-validate block.
1669 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1670 if (nSigOps > MAX_BLOCK_SIGOPS)
1671 return DoS(100, error("ConnectBlock() : too many sigops"));
1674 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1675 int64 nTxValueOut = tx.GetValueOut();
1676 nValueIn += nTxValueIn;
1677 nValueOut += nTxValueOut;
1678 if (!tx.IsCoinStake())
1679 nFees += nTxValueIn - nTxValueOut;
1681 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1685 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1688 // ppcoin: track money supply and mint amount info
1689 pindex->nMint = nValueOut - nValueIn + nFees;
1690 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1691 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1692 return error("Connect() : WriteBlockIndex for pindex failed");
1694 // ppcoin: fees are not collected by miners as in bitcoin
1695 // ppcoin: fees are destroyed to compensate the entire network
1696 if (fDebug && GetBoolArg("-printcreation"))
1697 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1702 // Write queued txindex changes
1703 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1705 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1706 return error("ConnectBlock() : UpdateTxIndex failed");
1709 // Update block index on disk without changing it in memory.
1710 // The memory index structure will be changed after the db commits.
1713 CDiskBlockIndex blockindexPrev(pindex->pprev);
1714 blockindexPrev.hashNext = pindex->GetBlockHash();
1715 if (!txdb.WriteBlockIndex(blockindexPrev))
1716 return error("ConnectBlock() : WriteBlockIndex failed");
1719 // Watch for transactions paying to me
1720 BOOST_FOREACH(CTransaction& tx, vtx)
1721 SyncWithWallets(tx, this, true);
1726 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1728 printf("REORGANIZE\n");
1731 CBlockIndex* pfork = pindexBest;
1732 CBlockIndex* plonger = pindexNew;
1733 while (pfork != plonger)
1735 while (plonger->nHeight > pfork->nHeight)
1736 if (!(plonger = plonger->pprev))
1737 return error("Reorganize() : plonger->pprev is null");
1738 if (pfork == plonger)
1740 if (!(pfork = pfork->pprev))
1741 return error("Reorganize() : pfork->pprev is null");
1744 // List of what to disconnect
1745 vector<CBlockIndex*> vDisconnect;
1746 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1747 vDisconnect.push_back(pindex);
1749 // List of what to connect
1750 vector<CBlockIndex*> vConnect;
1751 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1752 vConnect.push_back(pindex);
1753 reverse(vConnect.begin(), vConnect.end());
1755 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());
1756 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());
1758 // Disconnect shorter branch
1759 vector<CTransaction> vResurrect;
1760 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1763 if (!block.ReadFromDisk(pindex))
1764 return error("Reorganize() : ReadFromDisk for disconnect failed");
1765 if (!block.DisconnectBlock(txdb, pindex))
1766 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1768 // Queue memory transactions to resurrect
1769 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1770 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1771 vResurrect.push_back(tx);
1774 // Connect longer branch
1775 vector<CTransaction> vDelete;
1776 for (unsigned int i = 0; i < vConnect.size(); i++)
1778 CBlockIndex* pindex = vConnect[i];
1780 if (!block.ReadFromDisk(pindex))
1781 return error("Reorganize() : ReadFromDisk for connect failed");
1782 if (!block.ConnectBlock(txdb, pindex))
1785 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1788 // Queue memory transactions to delete
1789 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1790 vDelete.push_back(tx);
1792 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1793 return error("Reorganize() : WriteHashBestChain failed");
1795 // Make sure it's successfully written to disk before changing memory structure
1796 if (!txdb.TxnCommit())
1797 return error("Reorganize() : TxnCommit failed");
1799 // Disconnect shorter branch
1800 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1802 pindex->pprev->pnext = NULL;
1804 // Connect longer branch
1805 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1807 pindex->pprev->pnext = pindex;
1809 // Resurrect memory transactions that were in the disconnected branch
1810 BOOST_FOREACH(CTransaction& tx, vResurrect)
1811 tx.AcceptToMemoryPool(txdb, false);
1813 // Delete redundant memory transactions that are in the connected branch
1814 BOOST_FOREACH(CTransaction& tx, vDelete)
1817 printf("REORGANIZE: done\n");
1823 // Called from inside SetBestChain: attaches a block to the new best chain being built
1824 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1826 uint256 hash = GetHash();
1828 // Adding to current best branch
1829 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1832 InvalidChainFound(pindexNew);
1835 if (!txdb.TxnCommit())
1836 return error("SetBestChain() : TxnCommit failed");
1838 // Add to current best branch
1839 pindexNew->pprev->pnext = pindexNew;
1841 // Delete redundant memory transactions
1842 BOOST_FOREACH(CTransaction& tx, vtx)
1848 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1850 uint256 hash = GetHash();
1852 if (!txdb.TxnBegin())
1853 return error("SetBestChain() : TxnBegin failed");
1855 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1857 txdb.WriteHashBestChain(hash);
1858 if (!txdb.TxnCommit())
1859 return error("SetBestChain() : TxnCommit failed");
1860 pindexGenesisBlock = pindexNew;
1862 else if (hashPrevBlock == hashBestChain)
1864 if (!SetBestChainInner(txdb, pindexNew))
1865 return error("SetBestChain() : SetBestChainInner failed");
1869 // the first block in the new chain that will cause it to become the new best chain
1870 CBlockIndex *pindexIntermediate = pindexNew;
1872 // list of blocks that need to be connected afterwards
1873 std::vector<CBlockIndex*> vpindexSecondary;
1875 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1876 // Try to limit how much needs to be done inside
1877 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1879 vpindexSecondary.push_back(pindexIntermediate);
1880 pindexIntermediate = pindexIntermediate->pprev;
1883 if (!vpindexSecondary.empty())
1884 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1886 // Switch to new best branch
1887 if (!Reorganize(txdb, pindexIntermediate))
1890 InvalidChainFound(pindexNew);
1891 return error("SetBestChain() : Reorganize failed");
1894 // Connect further blocks
1895 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1898 if (!block.ReadFromDisk(pindex))
1900 printf("SetBestChain() : ReadFromDisk failed\n");
1903 if (!txdb.TxnBegin()) {
1904 printf("SetBestChain() : TxnBegin 2 failed\n");
1907 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1908 if (!block.SetBestChainInner(txdb, pindex))
1913 // Update best block in wallet (so we can detect restored wallets)
1914 bool fIsInitialDownload = IsInitialBlockDownload();
1915 if (!fIsInitialDownload)
1917 const CBlockLocator locator(pindexNew);
1918 ::SetBestChain(locator);
1922 hashBestChain = hash;
1923 pindexBest = pindexNew;
1924 pblockindexFBBHLast = NULL;
1925 nBestHeight = pindexBest->nHeight;
1926 nBestChainTrust = pindexNew->nChainTrust;
1927 nTimeBestReceived = GetTime();
1928 nTransactionsUpdated++;
1930 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1932 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1933 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1934 CBigNum(nBestChainTrust).ToString().c_str(),
1935 nBestBlockTrust.Get64(),
1936 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1938 // Check the version of the last 100 blocks to see if we need to upgrade:
1939 if (!fIsInitialDownload)
1942 const CBlockIndex* pindex = pindexBest;
1943 for (int i = 0; i < 100 && pindex != NULL; i++)
1945 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1947 pindex = pindex->pprev;
1950 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1951 if (nUpgraded > 100/2)
1952 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1953 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1956 std::string strCmd = GetArg("-blocknotify", "");
1958 if (!fIsInitialDownload && !strCmd.empty())
1960 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1961 boost::thread t(runCommand, strCmd); // thread runs free
1967 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1968 // Only those coins meeting minimum age requirement counts. As those
1969 // transactions not in main chain are not currently indexed so we
1970 // might not find out about their coin age. Older transactions are
1971 // guaranteed to be in main chain by sync-checkpoint. This rule is
1972 // introduced to help nodes establish a consistent view of the coin
1973 // age (trust score) of competing branches.
1974 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1976 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1982 BOOST_FOREACH(const CTxIn& txin, vin)
1984 // First try finding the previous transaction in database
1985 CTransaction txPrev;
1987 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1988 continue; // previous transaction not in main chain
1989 if (nTime < txPrev.nTime)
1990 return false; // Transaction timestamp violation
1992 // Read block header
1994 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1995 return false; // unable to read block of previous transaction
1996 if (block.GetBlockTime() + nStakeMinAge > nTime)
1997 continue; // only count coins meeting min age requirement
1999 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2000 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2002 if (fDebug && GetBoolArg("-printcoinage"))
2003 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2006 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2007 if (fDebug && GetBoolArg("-printcoinage"))
2008 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2009 nCoinAge = bnCoinDay.getuint64();
2013 // ppcoin: total coin age spent in block, in the unit of coin-days.
2014 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2019 BOOST_FOREACH(const CTransaction& tx, vtx)
2022 if (tx.GetCoinAge(txdb, nTxCoinAge))
2023 nCoinAge += nTxCoinAge;
2028 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2030 if (fDebug && GetBoolArg("-printcoinage"))
2031 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2035 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2037 // Check for duplicate
2038 uint256 hash = GetHash();
2039 if (mapBlockIndex.count(hash))
2040 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2042 // Construct new block index object
2043 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2045 return error("AddToBlockIndex() : new CBlockIndex failed");
2046 pindexNew->phashBlock = &hash;
2047 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2048 if (miPrev != mapBlockIndex.end())
2050 pindexNew->pprev = (*miPrev).second;
2051 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2054 // ppcoin: compute chain trust score
2055 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2057 // ppcoin: compute stake entropy bit for stake modifier
2058 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2059 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2061 // ppcoin: record proof-of-stake hash value
2062 if (pindexNew->IsProofOfStake())
2064 if (!mapProofOfStake.count(hash))
2065 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2066 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2069 // ppcoin: compute stake modifier
2070 uint64 nStakeModifier = 0;
2071 bool fGeneratedStakeModifier = false;
2072 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2073 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2074 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2075 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2076 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2077 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2079 // Add to mapBlockIndex
2080 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2081 if (pindexNew->IsProofOfStake())
2082 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2083 pindexNew->phashBlock = &((*mi).first);
2085 // Write to disk block index
2087 if (!txdb.TxnBegin())
2089 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2090 if (!txdb.TxnCommit())
2094 if (pindexNew->nChainTrust > nBestChainTrust)
2095 if (!SetBestChain(txdb, pindexNew))
2100 if (pindexNew == pindexBest)
2102 // Notify UI to display prev block's coinbase if it was ours
2103 static uint256 hashPrevBestCoinBase;
2104 UpdatedTransaction(hashPrevBestCoinBase);
2105 hashPrevBestCoinBase = vtx[0].GetHash();
2108 uiInterface.NotifyBlocksChanged();
2115 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2117 // These are checks that are independent of context
2118 // that can be verified before saving an orphan block.
2121 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2122 return DoS(100, error("CheckBlock() : size limits failed"));
2124 // Check proof of work matches claimed amount
2125 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2126 return DoS(50, error("CheckBlock() : proof of work failed"));
2129 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
2130 return error("CheckBlock() : block timestamp too far in the future");
2132 // First transaction must be coinbase, the rest must not be
2133 if (vtx.empty() || !vtx[0].IsCoinBase())
2134 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2135 for (unsigned int i = 1; i < vtx.size(); i++)
2136 if (vtx[i].IsCoinBase())
2137 return DoS(100, error("CheckBlock() : more than one coinbase"));
2139 // Check coinbase timestamp
2140 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
2141 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2143 if (IsProofOfStake())
2145 // Coinbase output should be empty if proof-of-stake block
2146 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2147 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2149 // Second transaction must be coinstake, the rest must not be
2150 if (vtx.empty() || !vtx[1].IsCoinStake())
2151 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2152 for (unsigned int i = 2; i < vtx.size(); i++)
2153 if (vtx[i].IsCoinStake())
2154 return DoS(100, error("CheckBlock() : more than one coinstake"));
2156 // Check coinstake timestamp
2157 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2158 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2160 // NovaCoin: check proof-of-stake block signature
2161 if (fCheckSig && !CheckBlockSignature(true))
2162 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2166 // Coinbase fee paid until 20 Sep 2013
2167 int64 nFee = GetBlockTime() < CHAINCHECKS_SWITCH_TIME ? vtx[0].GetMinFee() - MIN_TX_FEE : 0;
2169 // Check coinbase reward
2170 if (vtx[0].GetValueOut() > (GetProofOfWorkReward(nBits) - nFee))
2171 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2172 vtx[0].GetValueOut(),
2173 GetProofOfWorkReward(nBits) - nFee));
2175 // Should we check proof-of-work block signature or not?
2177 // * Always skip on TestNet
2178 // * Perform checking for the first 9689 blocks
2179 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2181 if(!fTestNet && fCheckSig)
2183 bool isAfterCheckpoint = (GetBlockTime() > Checkpoints::GetLastCheckpointTime());
2184 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2185 bool checkPoWSig = (isAfterCheckpoint && GetBlockTime() < CHAINCHECKS_SWITCH_TIME);
2187 // NovaCoin: check proof-of-work block signature
2188 if ((checkEntropySig || checkPoWSig) && !CheckBlockSignature(false))
2189 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2193 // Check transactions
2194 BOOST_FOREACH(const CTransaction& tx, vtx)
2196 if (!tx.CheckTransaction())
2197 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2199 // ppcoin: check transaction timestamp
2200 if (GetBlockTime() < (int64)tx.nTime)
2201 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2204 // Check for duplicate txids. This is caught by ConnectInputs(),
2205 // but catching it earlier avoids a potential DoS attack:
2206 set<uint256> uniqueTx;
2207 BOOST_FOREACH(const CTransaction& tx, vtx)
2209 uniqueTx.insert(tx.GetHash());
2211 if (uniqueTx.size() != vtx.size())
2212 return DoS(100, error("CheckBlock() : duplicate transaction"));
2214 unsigned int nSigOps = 0;
2215 BOOST_FOREACH(const CTransaction& tx, vtx)
2217 nSigOps += tx.GetLegacySigOpCount();
2219 if (nSigOps > MAX_BLOCK_SIGOPS)
2220 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2222 // Check merkle root
2223 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2224 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2230 bool CBlock::AcceptBlock()
2232 // Check for duplicate
2233 uint256 hash = GetHash();
2234 if (mapBlockIndex.count(hash))
2235 return error("AcceptBlock() : block already in mapBlockIndex");
2237 // Get prev block index
2238 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2239 if (mi == mapBlockIndex.end())
2240 return DoS(10, error("AcceptBlock() : prev block not found"));
2241 CBlockIndex* pindexPrev = (*mi).second;
2242 int nHeight = pindexPrev->nHeight+1;
2244 // Check proof-of-work or proof-of-stake
2245 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2246 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2248 // Check timestamp against prev
2249 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
2250 return error("AcceptBlock() : block's timestamp is too early");
2252 // Check that all transactions are finalized
2253 BOOST_FOREACH(const CTransaction& tx, vtx)
2254 if (!tx.IsFinal(nHeight, GetBlockTime()))
2255 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2257 // Check that the block chain matches the known block chain up to a checkpoint
2258 if (!Checkpoints::CheckHardened(nHeight, hash))
2259 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2261 // Check that the block satisfies synchronized checkpoint
2262 if (!GetBoolArg("-nosynccheckpoints", false) && !Checkpoints::CheckSync(hash, pindexPrev))
2263 return error("AcceptBlock() : rejected by synchronized checkpoint");
2265 // Enforce rule that the coinbase starts with serialized block height
2266 CScript expect = CScript() << nHeight;
2267 if (!std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2268 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2270 // Write block to history file
2271 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2272 return error("AcceptBlock() : out of disk space");
2273 unsigned int nFile = -1;
2274 unsigned int nBlockPos = 0;
2275 if (!WriteToDisk(nFile, nBlockPos))
2276 return error("AcceptBlock() : WriteToDisk failed");
2277 if (!AddToBlockIndex(nFile, nBlockPos))
2278 return error("AcceptBlock() : AddToBlockIndex failed");
2280 // Relay inventory, but don't relay old inventory during initial block download
2281 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2282 if (hashBestChain == hash)
2285 BOOST_FOREACH(CNode* pnode, vNodes)
2286 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2287 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2290 // ppcoin: check pending sync-checkpoint
2291 Checkpoints::AcceptPendingSyncCheckpoint();
2296 uint256 CBlockIndex::GetBlockTrust() const
2299 bnTarget.SetCompact(nBits);
2304 /* Old protocol, will be removed later */
2305 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2306 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2310 // Calculate work amount for block
2311 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2313 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2314 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2316 // Return nPoWTrust for the first 12 blocks
2317 if (pprev == NULL || pprev->nHeight < 12)
2320 const CBlockIndex* currentIndex = pprev;
2322 if(IsProofOfStake())
2324 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2326 // Return 1/3 of score if parent block is not the PoW block
2327 if (!pprev->IsProofOfWork())
2328 return (bnNewTrust / 3).getuint256();
2332 // Check last 12 blocks type
2333 while (pprev->nHeight - currentIndex->nHeight < 12)
2335 if (currentIndex->IsProofOfWork())
2337 currentIndex = currentIndex->pprev;
2340 // Return 1/3 of score if less than 3 PoW blocks found
2342 return (bnNewTrust / 3).getuint256();
2344 return bnNewTrust.getuint256();
2348 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2350 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2351 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2352 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2356 // Check last 12 blocks type
2357 while (pprev->nHeight - currentIndex->nHeight < 12)
2359 if (currentIndex->IsProofOfStake())
2361 currentIndex = currentIndex->pprev;
2364 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2366 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2368 bnTarget.SetCompact(pprev->nBits);
2373 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2375 // Return nPoWTrust + full trust score for previous block nBits
2376 return nPoWTrust + bnNewTrust.getuint256();
2380 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2382 unsigned int nFound = 0;
2383 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2385 if (pstart->nVersion >= minVersion)
2387 pstart = pstart->pprev;
2389 return (nFound >= nRequired);
2392 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2394 // Check for duplicate
2395 uint256 hash = pblock->GetHash();
2396 if (mapBlockIndex.count(hash))
2397 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2398 if (mapOrphanBlocks.count(hash))
2399 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2401 // ppcoin: check proof-of-stake
2402 // Limited duplicity on stake: prevents block flood attack
2403 // Duplicate stake allowed only when there is orphan child block
2404 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2405 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());
2407 // Preliminary checks
2408 if (!pblock->CheckBlock())
2409 return error("ProcessBlock() : CheckBlock FAILED");
2411 // ppcoin: verify hash target and signature of coinstake tx
2412 if (pblock->IsProofOfStake())
2414 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2415 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2417 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2418 return false; // do not error here as we expect this during initial block download
2420 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2421 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2424 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2425 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2427 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2428 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2430 bnNewBlock.SetCompact(pblock->nBits);
2433 if (pblock->IsProofOfStake())
2434 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2436 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2438 if (bnNewBlock > bnRequired)
2441 pfrom->Misbehaving(100);
2442 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2446 // ppcoin: ask for pending sync-checkpoint if any
2447 if (!IsInitialBlockDownload())
2448 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2450 // If don't already have its previous block, shunt it off to holding area until we get it
2451 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2453 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2454 CBlock* pblock2 = new CBlock(*pblock);
2455 // ppcoin: check proof-of-stake
2456 if (pblock2->IsProofOfStake())
2458 // Limited duplicity on stake: prevents block flood attack
2459 // Duplicate stake allowed only when there is orphan child block
2460 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2461 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());
2463 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2465 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2466 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2468 // Ask this guy to fill in what we're missing
2471 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2472 // ppcoin: getblocks may not obtain the ancestor block rejected
2473 // earlier by duplicate-stake check so we ask for it again directly
2474 if (!IsInitialBlockDownload())
2475 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2481 if (!pblock->AcceptBlock())
2482 return error("ProcessBlock() : AcceptBlock FAILED");
2484 // Recursively process any orphan blocks that depended on this one
2485 vector<uint256> vWorkQueue;
2486 vWorkQueue.push_back(hash);
2487 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2489 uint256 hashPrev = vWorkQueue[i];
2490 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2491 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2494 CBlock* pblockOrphan = (*mi).second;
2495 if (pblockOrphan->AcceptBlock())
2496 vWorkQueue.push_back(pblockOrphan->GetHash());
2497 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2498 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2499 delete pblockOrphan;
2501 mapOrphanBlocksByPrev.erase(hashPrev);
2504 printf("ProcessBlock: ACCEPTED\n");
2506 // ppcoin: if responsible for sync-checkpoint send it
2507 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2508 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2513 // ppcoin: sign block
2514 bool CBlock::SignBlock(const CKeyStore& keystore)
2516 vector<valtype> vSolutions;
2517 txnouttype whichType;
2519 if(!IsProofOfStake())
2521 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2523 const CTxOut& txout = vtx[0].vout[i];
2525 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2528 if (whichType == TX_PUBKEY)
2531 valtype& vchPubKey = vSolutions[0];
2534 if (!keystore.GetKey(Hash160(vchPubKey), key))
2536 if (key.GetPubKey() != vchPubKey)
2538 if(!key.Sign(GetHash(), vchBlockSig))
2547 const CTxOut& txout = vtx[1].vout[1];
2549 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2552 if (whichType == TX_PUBKEY)
2555 valtype& vchPubKey = vSolutions[0];
2558 if (!keystore.GetKey(Hash160(vchPubKey), key))
2560 if (key.GetPubKey() != vchPubKey)
2563 return key.Sign(GetHash(), vchBlockSig);
2567 printf("Sign failed\n");
2571 // ppcoin: check block signature
2572 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2574 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2575 return vchBlockSig.empty();
2577 vector<valtype> vSolutions;
2578 txnouttype whichType;
2582 const CTxOut& txout = vtx[1].vout[1];
2584 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2586 if (whichType == TX_PUBKEY)
2588 valtype& vchPubKey = vSolutions[0];
2590 if (!key.SetPubKey(vchPubKey))
2592 if (vchBlockSig.empty())
2594 return key.Verify(GetHash(), vchBlockSig);
2599 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2601 const CTxOut& txout = vtx[0].vout[i];
2603 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2606 if (whichType == TX_PUBKEY)
2609 valtype& vchPubKey = vSolutions[0];
2611 if (!key.SetPubKey(vchPubKey))
2613 if (vchBlockSig.empty())
2615 if(!key.Verify(GetHash(), vchBlockSig))
2625 bool CheckDiskSpace(uint64 nAdditionalBytes)
2627 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2629 // Check for nMinDiskSpace bytes (currently 50MB)
2630 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2633 string strMessage = _("Warning: Disk space is low!");
2634 strMiscWarning = strMessage;
2635 printf("*** %s\n", strMessage.c_str());
2636 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2643 static filesystem::path BlockFilePath(unsigned int nFile)
2645 string strBlockFn = strprintf("blk%04u.dat", nFile);
2646 return GetDataDir() / strBlockFn;
2649 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2651 if ((nFile < 1) || (nFile == (unsigned int) -1))
2653 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2656 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2658 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2667 static unsigned int nCurrentBlockFile = 1;
2669 FILE* AppendBlockFile(unsigned int& nFileRet)
2674 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2677 if (fseek(file, 0, SEEK_END) != 0)
2679 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2680 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2682 nFileRet = nCurrentBlockFile;
2686 nCurrentBlockFile++;
2690 bool LoadBlockIndex(bool fAllowNew)
2694 pchMessageStart[0] = 0xcd;
2695 pchMessageStart[1] = 0xf2;
2696 pchMessageStart[2] = 0xc0;
2697 pchMessageStart[3] = 0xef;
2699 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2700 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2701 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2702 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2703 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2710 if (!txdb.LoadBlockIndex())
2715 // Init with genesis block
2717 if (mapBlockIndex.empty())
2726 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2727 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2728 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2730 // vMerkleTree: 4cb33b3b6a
2734 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2735 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2736 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2738 // vMerkleTree: 4cb33b3b6a
2740 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2742 txNew.nTime = 1360105017;
2743 txNew.vin.resize(1);
2744 txNew.vout.resize(1);
2745 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2746 txNew.vout[0].SetEmpty();
2748 block.vtx.push_back(txNew);
2749 block.hashPrevBlock = 0;
2750 block.hashMerkleRoot = block.BuildMerkleTree();
2752 block.nTime = 1360105017;
2753 block.nBits = bnProofOfWorkLimit.GetCompact();
2754 block.nNonce = !fTestNet ? 1575379 : 46534;
2757 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2759 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2760 assert(block.CheckBlock());
2762 // Start new block file
2764 unsigned int nBlockPos;
2765 if (!block.WriteToDisk(nFile, nBlockPos))
2766 return error("LoadBlockIndex() : writing genesis block to disk failed");
2767 if (!block.AddToBlockIndex(nFile, nBlockPos))
2768 return error("LoadBlockIndex() : genesis block not accepted");
2770 // ppcoin: initialize synchronized checkpoint
2771 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2772 return error("LoadBlockIndex() : failed to init sync checkpoint");
2775 // ppcoin: if checkpoint master key changed must reset sync-checkpoint
2778 string strPubKey = "";
2779 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2781 // write checkpoint master key to db
2783 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2784 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2785 if (!txdb.TxnCommit())
2786 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2787 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2788 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2798 void PrintBlockTree()
2800 // pre-compute tree structure
2801 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2802 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2804 CBlockIndex* pindex = (*mi).second;
2805 mapNext[pindex->pprev].push_back(pindex);
2807 //while (rand() % 3 == 0)
2808 // mapNext[pindex->pprev].push_back(pindex);
2811 vector<pair<int, CBlockIndex*> > vStack;
2812 vStack.push_back(make_pair(0, pindexGenesisBlock));
2815 while (!vStack.empty())
2817 int nCol = vStack.back().first;
2818 CBlockIndex* pindex = vStack.back().second;
2821 // print split or gap
2822 if (nCol > nPrevCol)
2824 for (int i = 0; i < nCol-1; i++)
2828 else if (nCol < nPrevCol)
2830 for (int i = 0; i < nCol; i++)
2837 for (int i = 0; i < nCol; i++)
2842 block.ReadFromDisk(pindex);
2843 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2847 block.GetHash().ToString().c_str(),
2849 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2850 FormatMoney(pindex->nMint).c_str(),
2853 PrintWallets(block);
2855 // put the main time-chain first
2856 vector<CBlockIndex*>& vNext = mapNext[pindex];
2857 for (unsigned int i = 0; i < vNext.size(); i++)
2859 if (vNext[i]->pnext)
2861 swap(vNext[0], vNext[i]);
2867 for (unsigned int i = 0; i < vNext.size(); i++)
2868 vStack.push_back(make_pair(nCol+i, vNext[i]));
2872 bool LoadExternalBlockFile(FILE* fileIn)
2874 int64 nStart = GetTimeMillis();
2880 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2881 unsigned int nPos = 0;
2882 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2884 unsigned char pchData[65536];
2886 fseek(blkdat, nPos, SEEK_SET);
2887 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2890 nPos = (unsigned int)-1;
2893 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2896 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2898 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2901 nPos += ((unsigned char*)nFind - pchData) + 1;
2904 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2905 } while(!fRequestShutdown);
2906 if (nPos == (unsigned int)-1)
2908 fseek(blkdat, nPos, SEEK_SET);
2911 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2915 if (ProcessBlock(NULL,&block))
2923 catch (std::exception &e) {
2924 printf("%s() : Deserialize or I/O error caught during load\n",
2925 __PRETTY_FUNCTION__);
2928 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2940 //////////////////////////////////////////////////////////////////////////////
2945 extern map<uint256, CAlert> mapAlerts;
2946 extern CCriticalSection cs_mapAlerts;
2948 static string strMintMessage = "Info: Minting suspended due to locked wallet.";
2949 static string strMintWarning;
2951 string GetWarnings(string strFor)
2954 string strStatusBar;
2957 if (GetBoolArg("-testsafemode"))
2960 // ppcoin: wallet lock warning for minting
2961 if (strMintWarning != "")
2964 strStatusBar = strMintWarning;
2967 // Misc warnings like out of disk space and clock is wrong
2968 if (strMiscWarning != "")
2971 strStatusBar = strMiscWarning;
2974 // * Should not enter safe mode for longer invalid chain
2975 // * If sync-checkpoint is too old do not enter safe mode
2976 // * Do not display warning if -nosynccheckpoints specified
2977 if (!GetBoolArg("-nosynccheckpoints", false) && Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) && !fTestNet && !IsInitialBlockDownload())
2980 strStatusBar = "WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.";
2983 // ppcoin: if detected invalid checkpoint enter safe mode
2984 if (Checkpoints::hashInvalidCheckpoint != 0)
2987 strStatusBar = strRPC = "WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.";
2993 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2995 const CAlert& alert = item.second;
2996 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2998 nPriority = alert.nPriority;
2999 strStatusBar = alert.strStatusBar;
3000 if (nPriority > 1000)
3001 strRPC = strStatusBar;
3006 if (strFor == "statusbar")
3007 return strStatusBar;
3008 else if (strFor == "rpc")
3010 assert(!"GetWarnings() : invalid parameter");
3021 //////////////////////////////////////////////////////////////////////////////
3027 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3033 bool txInMap = false;
3036 txInMap = (mempool.exists(inv.hash));
3039 mapOrphanTransactions.count(inv.hash) ||
3040 txdb.ContainsTx(inv.hash);
3044 return mapBlockIndex.count(inv.hash) ||
3045 mapOrphanBlocks.count(inv.hash);
3047 // Don't know what it is, just say we already got one
3054 // The message start string is designed to be unlikely to occur in normal data.
3055 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3056 // a large 4-byte int at any alignment.
3057 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3059 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3061 static map<CService, CPubKey> mapReuseKey;
3062 RandAddSeedPerfmon();
3064 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3065 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3067 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3075 if (strCommand == "version")
3077 // Each connection can only send one version message
3078 if (pfrom->nVersion != 0)
3080 pfrom->Misbehaving(1);
3088 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3089 if (pfrom->nVersion < MIN_PROTO_VERSION)
3091 // Since February 20, 2012, the protocol is initiated at version 209,
3092 // and earlier versions are no longer supported
3093 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3094 pfrom->fDisconnect = true;
3098 if (pfrom->nVersion == 10300)
3099 pfrom->nVersion = 300;
3101 vRecv >> addrFrom >> nNonce;
3103 vRecv >> pfrom->strSubVer;
3105 vRecv >> pfrom->nStartingHeight;
3107 if (pfrom->fInbound && addrMe.IsRoutable())
3109 pfrom->addrLocal = addrMe;
3113 // Disconnect if we connected to ourself
3114 if (nNonce == nLocalHostNonce && nNonce > 1)
3116 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3117 pfrom->fDisconnect = true;
3121 // ppcoin: record my external IP reported by peer
3122 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3123 addrSeenByPeer = addrMe;
3125 // Be shy and don't send version until we hear
3126 if (pfrom->fInbound)
3127 pfrom->PushVersion();
3129 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3131 AddTimeData(pfrom->addr, nTime);
3134 pfrom->PushMessage("verack");
3135 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3137 if (!pfrom->fInbound)
3139 // Advertise our address
3140 if (!fNoListen && !IsInitialBlockDownload())
3142 CAddress addr = GetLocalAddress(&pfrom->addr);
3143 if (addr.IsRoutable())
3144 pfrom->PushAddress(addr);
3147 // Get recent addresses
3148 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3150 pfrom->PushMessage("getaddr");
3151 pfrom->fGetAddr = true;
3153 addrman.Good(pfrom->addr);
3155 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3157 addrman.Add(addrFrom, addrFrom);
3158 addrman.Good(addrFrom);
3162 // Ask the first connected node for block updates
3163 static int nAskedForBlocks = 0;
3164 if (!pfrom->fClient && !pfrom->fOneShot &&
3165 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3166 (pfrom->nVersion < NOBLKS_VERSION_START ||
3167 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3168 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3171 pfrom->PushGetBlocks(pindexBest, uint256(0));
3177 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3178 item.second.RelayTo(pfrom);
3181 // ppcoin: relay sync-checkpoint
3183 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3184 if (!Checkpoints::checkpointMessage.IsNull())
3185 Checkpoints::checkpointMessage.RelayTo(pfrom);
3188 pfrom->fSuccessfullyConnected = true;
3190 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());
3192 cPeerBlockCounts.input(pfrom->nStartingHeight);
3194 // ppcoin: ask for pending sync-checkpoint if any
3195 if (!IsInitialBlockDownload())
3196 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3200 else if (pfrom->nVersion == 0)
3202 // Must have a version message before anything else
3203 pfrom->Misbehaving(1);
3208 else if (strCommand == "verack")
3210 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3214 else if (strCommand == "addr")
3216 vector<CAddress> vAddr;
3219 // Don't want addr from older versions unless seeding
3220 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3222 if (vAddr.size() > 1000)
3224 pfrom->Misbehaving(20);
3225 return error("message addr size() = %"PRIszu"", vAddr.size());
3228 // Store the new addresses
3229 vector<CAddress> vAddrOk;
3230 int64 nNow = GetAdjustedTime();
3231 int64 nSince = nNow - 10 * 60;
3232 BOOST_FOREACH(CAddress& addr, vAddr)
3236 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3237 addr.nTime = nNow - 5 * 24 * 60 * 60;
3238 pfrom->AddAddressKnown(addr);
3239 bool fReachable = IsReachable(addr);
3240 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3242 // Relay to a limited number of other nodes
3245 // Use deterministic randomness to send to the same nodes for 24 hours
3246 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3247 static uint256 hashSalt;
3249 hashSalt = GetRandHash();
3250 uint64 hashAddr = addr.GetHash();
3251 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3252 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3253 multimap<uint256, CNode*> mapMix;
3254 BOOST_FOREACH(CNode* pnode, vNodes)
3256 if (pnode->nVersion < CADDR_TIME_VERSION)
3258 unsigned int nPointer;
3259 memcpy(&nPointer, &pnode, sizeof(nPointer));
3260 uint256 hashKey = hashRand ^ nPointer;
3261 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3262 mapMix.insert(make_pair(hashKey, pnode));
3264 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3265 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3266 ((*mi).second)->PushAddress(addr);
3269 // Do not store addresses outside our network
3271 vAddrOk.push_back(addr);
3273 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3274 if (vAddr.size() < 1000)
3275 pfrom->fGetAddr = false;
3276 if (pfrom->fOneShot)
3277 pfrom->fDisconnect = true;
3281 else if (strCommand == "inv")
3285 if (vInv.size() > MAX_INV_SZ)
3287 pfrom->Misbehaving(20);
3288 return error("message inv size() = %"PRIszu"", vInv.size());
3291 // find last block in inv vector
3292 unsigned int nLastBlock = (unsigned int)(-1);
3293 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3294 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3295 nLastBlock = vInv.size() - 1 - nInv;
3300 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3302 const CInv &inv = vInv[nInv];
3306 pfrom->AddInventoryKnown(inv);
3308 bool fAlreadyHave = AlreadyHave(txdb, inv);
3310 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3314 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3315 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3316 } else if (nInv == nLastBlock) {
3317 // In case we are on a very long side-chain, it is possible that we already have
3318 // the last block in an inv bundle sent in response to getblocks. Try to detect
3319 // this situation and push another getblocks to continue.
3320 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3322 printf("force request: %s\n", inv.ToString().c_str());
3325 // Track requests for our stuff
3326 Inventory(inv.hash);
3331 else if (strCommand == "getdata")
3335 if (vInv.size() > MAX_INV_SZ)
3337 pfrom->Misbehaving(20);
3338 return error("message getdata size() = %"PRIszu"", vInv.size());
3341 if (fDebugNet || (vInv.size() != 1))
3342 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3344 BOOST_FOREACH(const CInv& inv, vInv)
3348 if (fDebugNet || (vInv.size() == 1))
3349 printf("received getdata for: %s\n", inv.ToString().c_str());
3351 if (inv.type == MSG_BLOCK)
3353 // Send block from disk
3354 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3355 if (mi != mapBlockIndex.end())
3358 block.ReadFromDisk((*mi).second);
3359 pfrom->PushMessage("block", block);
3361 // Trigger them to send a getblocks request for the next batch of inventory
3362 if (inv.hash == pfrom->hashContinue)
3364 // ppcoin: send latest proof-of-work block to allow the
3365 // download node to accept as orphan (proof-of-stake
3366 // block might be rejected by stake connection check)
3368 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3369 pfrom->PushMessage("inv", vInv);
3370 pfrom->hashContinue = 0;
3374 else if (inv.IsKnownType())
3376 // Send stream from relay memory
3377 bool pushed = false;
3380 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3381 if (mi != mapRelay.end()) {
3382 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3386 if (!pushed && inv.type == MSG_TX) {
3388 if (mempool.exists(inv.hash)) {
3389 CTransaction tx = mempool.lookup(inv.hash);
3390 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3393 pfrom->PushMessage("tx", ss);
3398 // Track requests for our stuff
3399 Inventory(inv.hash);
3404 else if (strCommand == "getblocks")
3406 CBlockLocator locator;
3408 vRecv >> locator >> hashStop;
3410 // Find the last block the caller has in the main chain
3411 CBlockIndex* pindex = locator.GetBlockIndex();
3413 // Send the rest of the chain
3415 pindex = pindex->pnext;
3417 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3418 for (; pindex; pindex = pindex->pnext)
3420 if (pindex->GetBlockHash() == hashStop)
3422 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3423 // ppcoin: tell downloading node about the latest block if it's
3424 // without risk being rejected due to stake connection check
3425 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3426 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3429 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3432 // When this block is requested, we'll send an inv that'll make them
3433 // getblocks the next batch of inventory.
3434 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3435 pfrom->hashContinue = pindex->GetBlockHash();
3440 else if (strCommand == "checkpoint")
3442 CSyncCheckpoint checkpoint;
3443 vRecv >> checkpoint;
3445 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3448 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3450 BOOST_FOREACH(CNode* pnode, vNodes)
3451 checkpoint.RelayTo(pnode);
3455 else if (strCommand == "getheaders")
3457 CBlockLocator locator;
3459 vRecv >> locator >> hashStop;
3461 CBlockIndex* pindex = NULL;
3462 if (locator.IsNull())
3464 // If locator is null, return the hashStop block
3465 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3466 if (mi == mapBlockIndex.end())
3468 pindex = (*mi).second;
3472 // Find the last block the caller has in the main chain
3473 pindex = locator.GetBlockIndex();
3475 pindex = pindex->pnext;
3478 vector<CBlock> vHeaders;
3480 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3481 for (; pindex; pindex = pindex->pnext)
3483 vHeaders.push_back(pindex->GetBlockHeader());
3484 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3487 pfrom->PushMessage("headers", vHeaders);
3491 else if (strCommand == "tx")
3493 vector<uint256> vWorkQueue;
3494 vector<uint256> vEraseQueue;
3495 CDataStream vMsg(vRecv);
3500 CInv inv(MSG_TX, tx.GetHash());
3501 pfrom->AddInventoryKnown(inv);
3503 // Truncate messages to the size of the tx in them
3504 unsigned int nSize = ::GetSerializeSize(tx,SER_NETWORK, PROTOCOL_VERSION);
3505 if (nSize < vMsg.size()){
3509 bool fMissingInputs = false;
3510 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3512 SyncWithWallets(tx, NULL, true);
3513 RelayMessage(inv, vMsg);
3514 mapAlreadyAskedFor.erase(inv);
3515 vWorkQueue.push_back(inv.hash);
3516 vEraseQueue.push_back(inv.hash);
3518 // Recursively process any orphan transactions that depended on this one
3519 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3521 uint256 hashPrev = vWorkQueue[i];
3522 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3523 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3526 const CDataStream& vMsg = *((*mi).second);
3528 CDataStream(vMsg) >> tx;
3529 CInv inv(MSG_TX, tx.GetHash());
3530 bool fMissingInputs2 = false;
3532 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3534 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3535 SyncWithWallets(tx, NULL, true);
3536 RelayMessage(inv, vMsg);
3537 mapAlreadyAskedFor.erase(inv);
3538 vWorkQueue.push_back(inv.hash);
3539 vEraseQueue.push_back(inv.hash);
3541 else if (!fMissingInputs2)
3544 vEraseQueue.push_back(inv.hash);
3545 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3550 BOOST_FOREACH(uint256 hash, vEraseQueue)
3551 EraseOrphanTx(hash);
3553 else if (fMissingInputs)
3557 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3558 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3560 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3562 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3566 else if (strCommand == "block")
3571 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
3574 CInv inv(MSG_BLOCK, block.GetHash());
3575 pfrom->AddInventoryKnown(inv);
3577 if (ProcessBlock(pfrom, &block))
3578 mapAlreadyAskedFor.erase(inv);
3579 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3583 else if (strCommand == "getaddr")
3585 // Don't return addresses older than nCutOff timestamp
3586 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3587 pfrom->vAddrToSend.clear();
3588 vector<CAddress> vAddr = addrman.GetAddr();
3589 BOOST_FOREACH(const CAddress &addr, vAddr)
3590 if(addr.nTime > nCutOff)
3591 pfrom->PushAddress(addr);
3595 else if (strCommand == "mempool")
3597 std::vector<uint256> vtxid;
3598 mempool.queryHashes(vtxid);
3600 for (unsigned int i = 0; i < vtxid.size(); i++) {
3601 CInv inv(MSG_TX, vtxid[i]);
3602 vInv.push_back(inv);
3603 if (i == (MAX_INV_SZ - 1))
3606 if (vInv.size() > 0)
3607 pfrom->PushMessage("inv", vInv);
3611 else if (strCommand == "checkorder")
3616 if (!GetBoolArg("-allowreceivebyip"))
3618 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3625 /// we have a chance to check the order here
3627 // Keep giving the same key to the same ip until they use it
3628 if (!mapReuseKey.count(pfrom->addr))
3629 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3631 // Send back approval of order and pubkey to use
3632 CScript scriptPubKey;
3633 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3634 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3638 else if (strCommand == "reply")
3643 CRequestTracker tracker;
3645 LOCK(pfrom->cs_mapRequests);
3646 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3647 if (mi != pfrom->mapRequests.end())
3649 tracker = (*mi).second;
3650 pfrom->mapRequests.erase(mi);
3653 if (!tracker.IsNull())
3654 tracker.fn(tracker.param1, vRecv);
3658 else if (strCommand == "ping")
3660 if (pfrom->nVersion > BIP0031_VERSION)
3664 // Echo the message back with the nonce. This allows for two useful features:
3666 // 1) A remote node can quickly check if the connection is operational
3667 // 2) Remote nodes can measure the latency of the network thread. If this node
3668 // is overloaded it won't respond to pings quickly and the remote node can
3669 // avoid sending us more work, like chain download requests.
3671 // The nonce stops the remote getting confused between different pings: without
3672 // it, if the remote node sends a ping once per second and this node takes 5
3673 // seconds to respond to each, the 5th ping the remote sends would appear to
3674 // return very quickly.
3675 pfrom->PushMessage("pong", nonce);
3680 else if (strCommand == "alert")
3685 uint256 alertHash = alert.GetHash();
3686 if (pfrom->setKnown.count(alertHash) == 0)
3688 if (alert.ProcessAlert())
3691 pfrom->setKnown.insert(alertHash);
3694 BOOST_FOREACH(CNode* pnode, vNodes)
3695 alert.RelayTo(pnode);
3699 // Small DoS penalty so peers that send us lots of
3700 // duplicate/expired/invalid-signature/whatever alerts
3701 // eventually get banned.
3702 // This isn't a Misbehaving(100) (immediate ban) because the
3703 // peer might be an older or different implementation with
3704 // a different signature key, etc.
3705 pfrom->Misbehaving(10);
3713 // Ignore unknown commands for extensibility
3717 // Update the last seen time for this node's address
3718 if (pfrom->fNetworkNode)
3719 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3720 AddressCurrentlyConnected(pfrom->addr);
3726 bool ProcessMessages(CNode* pfrom)
3728 CDataStream& vRecv = pfrom->vRecv;
3732 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3736 // (4) message start
3745 // Don't bother if send buffer is too full to respond anyway
3746 if (pfrom->vSend.size() >= SendBufferSize())
3749 // Scan for message start
3750 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3751 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3752 if (vRecv.end() - pstart < nHeaderSize)
3754 if ((int)vRecv.size() > nHeaderSize)
3756 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3757 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3761 if (pstart - vRecv.begin() > 0)
3762 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3763 vRecv.erase(vRecv.begin(), pstart);
3766 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3771 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3774 string strCommand = hdr.GetCommand();
3777 unsigned int nMessageSize = hdr.nMessageSize;
3778 if (nMessageSize > MAX_SIZE)
3780 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3783 if (nMessageSize > vRecv.size())
3785 // Rewind and wait for rest of message
3786 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3791 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3792 unsigned int nChecksum = 0;
3793 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3794 if (nChecksum != hdr.nChecksum)
3796 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3797 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3801 // Copy message to its own buffer
3802 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3803 vRecv.ignore(nMessageSize);
3811 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3816 catch (std::ios_base::failure& e)
3818 if (strstr(e.what(), "end of data"))
3820 // Allow exceptions from under-length message on vRecv
3821 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());
3823 else if (strstr(e.what(), "size too large"))
3825 // Allow exceptions from over-long size
3826 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3830 PrintExceptionContinue(&e, "ProcessMessages()");
3833 catch (std::exception& e) {
3834 PrintExceptionContinue(&e, "ProcessMessages()");
3836 PrintExceptionContinue(NULL, "ProcessMessages()");
3840 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3848 bool SendMessages(CNode* pto, bool fSendTrickle)
3850 TRY_LOCK(cs_main, lockMain);
3852 // Don't send anything until we get their version message
3853 if (pto->nVersion == 0)
3856 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3858 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3860 if (pto->nVersion > BIP0031_VERSION)
3861 pto->PushMessage("ping", nonce);
3863 pto->PushMessage("ping");
3866 // Resend wallet transactions that haven't gotten in a block yet
3867 ResendWalletTransactions();
3869 // Address refresh broadcast
3870 static int64 nLastRebroadcast;
3871 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3875 BOOST_FOREACH(CNode* pnode, vNodes)
3877 // Periodically clear setAddrKnown to allow refresh broadcasts
3878 if (nLastRebroadcast)
3879 pnode->setAddrKnown.clear();
3881 // Rebroadcast our address
3884 CAddress addr = GetLocalAddress(&pnode->addr);
3885 if (addr.IsRoutable())
3886 pnode->PushAddress(addr);
3890 nLastRebroadcast = GetTime();
3898 vector<CAddress> vAddr;
3899 vAddr.reserve(pto->vAddrToSend.size());
3900 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3902 // returns true if wasn't already contained in the set
3903 if (pto->setAddrKnown.insert(addr).second)
3905 vAddr.push_back(addr);
3906 // receiver rejects addr messages larger than 1000
3907 if (vAddr.size() >= 1000)
3909 pto->PushMessage("addr", vAddr);
3914 pto->vAddrToSend.clear();
3916 pto->PushMessage("addr", vAddr);
3921 // Message: inventory
3924 vector<CInv> vInvWait;
3926 LOCK(pto->cs_inventory);
3927 vInv.reserve(pto->vInventoryToSend.size());
3928 vInvWait.reserve(pto->vInventoryToSend.size());
3929 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3931 if (pto->setInventoryKnown.count(inv))
3934 // trickle out tx inv to protect privacy
3935 if (inv.type == MSG_TX && !fSendTrickle)
3937 // 1/4 of tx invs blast to all immediately
3938 static uint256 hashSalt;
3940 hashSalt = GetRandHash();
3941 uint256 hashRand = inv.hash ^ hashSalt;
3942 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3943 bool fTrickleWait = ((hashRand & 3) != 0);
3945 // always trickle our own transactions
3949 if (GetTransaction(inv.hash, wtx))
3951 fTrickleWait = true;
3956 vInvWait.push_back(inv);
3961 // returns true if wasn't already contained in the set
3962 if (pto->setInventoryKnown.insert(inv).second)
3964 vInv.push_back(inv);
3965 if (vInv.size() >= 1000)
3967 pto->PushMessage("inv", vInv);
3972 pto->vInventoryToSend = vInvWait;
3975 pto->PushMessage("inv", vInv);
3981 vector<CInv> vGetData;
3982 int64 nNow = GetTime() * 1000000;
3984 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3986 const CInv& inv = (*pto->mapAskFor.begin()).second;
3987 if (!AlreadyHave(txdb, inv))
3990 printf("sending getdata: %s\n", inv.ToString().c_str());
3991 vGetData.push_back(inv);
3992 if (vGetData.size() >= 1000)
3994 pto->PushMessage("getdata", vGetData);
3997 mapAlreadyAskedFor[inv] = nNow;
3999 pto->mapAskFor.erase(pto->mapAskFor.begin());
4001 if (!vGetData.empty())
4002 pto->PushMessage("getdata", vGetData);
4021 //////////////////////////////////////////////////////////////////////////////
4026 int static FormatHashBlocks(void* pbuffer, unsigned int len)
4028 unsigned char* pdata = (unsigned char*)pbuffer;
4029 unsigned int blocks = 1 + ((len + 8) / 64);
4030 unsigned char* pend = pdata + 64 * blocks;
4031 memset(pdata + len, 0, 64 * blocks - len);
4033 unsigned int bits = len * 8;
4034 pend[-1] = (bits >> 0) & 0xff;
4035 pend[-2] = (bits >> 8) & 0xff;
4036 pend[-3] = (bits >> 16) & 0xff;
4037 pend[-4] = (bits >> 24) & 0xff;
4041 static const unsigned int pSHA256InitState[8] =
4042 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
4044 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
4047 unsigned char data[64];
4051 for (int i = 0; i < 16; i++)
4052 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
4054 for (int i = 0; i < 8; i++)
4055 ctx.h[i] = ((uint32_t*)pinit)[i];
4057 SHA256_Update(&ctx, data, sizeof(data));
4058 for (int i = 0; i < 8; i++)
4059 ((uint32_t*)pstate)[i] = ctx.h[i];
4062 // Some explaining would be appreciated
4067 set<uint256> setDependsOn;
4071 COrphan(CTransaction* ptxIn)
4074 dPriority = dFeePerKb = 0;
4079 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
4080 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
4081 BOOST_FOREACH(uint256 hash, setDependsOn)
4082 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
4087 uint64 nLastBlockTx = 0;
4088 uint64 nLastBlockSize = 0;
4089 int64 nLastCoinStakeSearchInterval = 0;
4091 // We want to sort transactions by priority and fee, so:
4092 typedef boost::tuple<double, double, CTransaction*> TxPriority;
4093 class TxPriorityCompare
4097 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
4098 bool operator()(const TxPriority& a, const TxPriority& b)
4102 if (a.get<1>() == b.get<1>())
4103 return a.get<0>() < b.get<0>();
4104 return a.get<1>() < b.get<1>();
4108 if (a.get<0>() == b.get<0>())
4109 return a.get<1>() < b.get<1>();
4110 return a.get<0>() < b.get<0>();
4116 // fProofOfStake: try (best effort) to make a proof-of-stake block
4117 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
4120 auto_ptr<CBlock> pblock(new CBlock());
4124 // Create coinbase tx
4126 txNew.vin.resize(1);
4127 txNew.vin[0].prevout.SetNull();
4128 txNew.vout.resize(1);
4132 CReserveKey reservekey(pwallet);
4133 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
4136 txNew.vout[0].SetEmpty();
4138 // Add our coinbase tx as first transaction
4139 pblock->vtx.push_back(txNew);
4141 // Largest block you're willing to create:
4142 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
4143 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
4144 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
4146 // How much of the block should be dedicated to high-priority transactions,
4147 // included regardless of the fees they pay
4148 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
4149 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
4151 // Minimum block size you want to create; block will be filled with free transactions
4152 // until there are no more or the block reaches this size:
4153 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
4154 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
4156 // Fee-per-kilobyte amount considered the same as "free"
4157 // Be careful setting this: if you set it to zero then
4158 // a transaction spammer can cheaply fill blocks using
4159 // 1-satoshi-fee transactions. It should be set above the real
4160 // cost to you of processing a transaction.
4161 int64 nMinTxFee = MIN_TX_FEE;
4162 if (mapArgs.count("-mintxfee"))
4163 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
4165 // ppcoin: if coinstake available add coinstake tx
4166 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // only initialized at startup
4167 CBlockIndex* pindexPrev = pindexBest;
4169 if (fProofOfStake) // attempt to find a coinstake
4171 pblock->nBits = GetNextTargetRequired(pindexPrev, true);
4172 CTransaction txCoinStake;
4173 int64 nSearchTime = txCoinStake.nTime; // search to current time
4174 if (nSearchTime > nLastCoinStakeSearchTime)
4176 if (pwallet->CreateCoinStake(*pwallet, pblock->nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake))
4178 if (txCoinStake.nTime >= max(pindexPrev->GetMedianTimePast()+1, pindexPrev->GetBlockTime() - nMaxClockDrift))
4179 { // make sure coinstake would meet timestamp protocol
4180 // as it would be the same as the block timestamp
4181 pblock->vtx[0].nTime = txCoinStake.nTime;
4182 pblock->vtx.push_back(txCoinStake);
4185 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
4186 nLastCoinStakeSearchTime = nSearchTime;
4190 pblock->nBits = GetNextTargetRequired(pindexPrev, pblock->IsProofOfStake());
4192 // Collect memory pool transactions into the block
4195 LOCK2(cs_main, mempool.cs);
4196 CBlockIndex* pindexPrev = pindexBest;
4199 // Priority order to process transactions
4200 list<COrphan> vOrphan; // list memory doesn't move
4201 map<uint256, vector<COrphan*> > mapDependers;
4203 // This vector will be sorted into a priority queue:
4204 vector<TxPriority> vecPriority;
4205 vecPriority.reserve(mempool.mapTx.size());
4206 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
4208 CTransaction& tx = (*mi).second;
4209 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
4212 COrphan* porphan = NULL;
4213 double dPriority = 0;
4215 bool fMissingInputs = false;
4216 BOOST_FOREACH(const CTxIn& txin, tx.vin)
4218 // Read prev transaction
4219 CTransaction txPrev;
4221 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
4223 // This should never happen; all transactions in the memory
4224 // pool should connect to either transactions in the chain
4225 // or other transactions in the memory pool.
4226 if (!mempool.mapTx.count(txin.prevout.hash))
4228 printf("ERROR: mempool transaction missing input\n");
4229 if (fDebug) assert("mempool transaction missing input" == 0);
4230 fMissingInputs = true;
4236 // Has to wait for dependencies
4239 // Use list for automatic deletion
4240 vOrphan.push_back(COrphan(&tx));
4241 porphan = &vOrphan.back();
4243 mapDependers[txin.prevout.hash].push_back(porphan);
4244 porphan->setDependsOn.insert(txin.prevout.hash);
4245 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
4248 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
4249 nTotalIn += nValueIn;
4251 int nConf = txindex.GetDepthInMainChain();
4252 dPriority += (double)nValueIn * nConf;
4254 if (fMissingInputs) continue;
4256 // Priority is sum(valuein * age) / txsize
4257 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4258 dPriority /= nTxSize;
4260 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
4261 // client code rounds up the size to the nearest 1K. That's good, because it gives an
4262 // incentive to create smaller transactions.
4263 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
4267 porphan->dPriority = dPriority;
4268 porphan->dFeePerKb = dFeePerKb;
4271 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
4274 // Collect transactions into block
4275 map<uint256, CTxIndex> mapTestPool;
4276 uint64 nBlockSize = 1000;
4277 uint64 nBlockTx = 0;
4278 int nBlockSigOps = 100;
4279 bool fSortedByFee = (nBlockPrioritySize <= 0);
4281 TxPriorityCompare comparer(fSortedByFee);
4282 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4284 while (!vecPriority.empty())
4286 // Take highest priority transaction off the priority queue:
4287 double dPriority = vecPriority.front().get<0>();
4288 double dFeePerKb = vecPriority.front().get<1>();
4289 CTransaction& tx = *(vecPriority.front().get<2>());
4291 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
4292 vecPriority.pop_back();
4295 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4296 if (nBlockSize + nTxSize >= nBlockMaxSize)
4299 // Legacy limits on sigOps:
4300 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
4301 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4305 if (tx.nTime > GetAdjustedTime() || (pblock->IsProofOfStake() && tx.nTime > pblock->vtx[1].nTime))
4308 // ppcoin: simplify transaction fee - allow free = false
4309 int64 nMinFee = tx.GetMinFee(nBlockSize, false, GMF_BLOCK);
4311 // Skip free transactions if we're past the minimum block size:
4312 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
4315 // Prioritize by fee once past the priority size or we run out of high-priority
4317 if (!fSortedByFee &&
4318 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
4320 fSortedByFee = true;
4321 comparer = TxPriorityCompare(fSortedByFee);
4322 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4325 // Connecting shouldn't fail due to dependency on other memory pool transactions
4326 // because we're already processing them in order of dependency
4327 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
4328 MapPrevTx mapInputs;
4330 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
4333 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
4334 if (nTxFees < nMinFee)
4337 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
4338 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4341 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
4343 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
4344 swap(mapTestPool, mapTestPoolTmp);
4347 pblock->vtx.push_back(tx);
4348 nBlockSize += nTxSize;
4350 nBlockSigOps += nTxSigOps;
4353 if (fDebug && GetBoolArg("-printpriority"))
4355 printf("priority %.1f feeperkb %.1f txid %s\n",
4356 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
4359 // Add transactions that depend on this one to the priority queue
4360 uint256 hash = tx.GetHash();
4361 if (mapDependers.count(hash))
4363 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
4365 if (!porphan->setDependsOn.empty())
4367 porphan->setDependsOn.erase(hash);
4368 if (porphan->setDependsOn.empty())
4370 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
4371 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
4378 nLastBlockTx = nBlockTx;
4379 nLastBlockSize = nBlockSize;
4381 if (fDebug && GetBoolArg("-printpriority"))
4382 printf("CreateNewBlock(): total size %"PRI64u"\n", nBlockSize);
4384 if (pblock->IsProofOfWork())
4385 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
4388 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
4389 if (pblock->IsProofOfStake())
4390 pblock->nTime = pblock->vtx[1].nTime; //same as coinstake timestamp
4391 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
4392 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
4393 if (pblock->IsProofOfWork())
4394 pblock->UpdateTime(pindexPrev);
4398 return pblock.release();
4402 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
4404 // Update nExtraNonce
4405 static uint256 hashPrevBlock;
4406 if (hashPrevBlock != pblock->hashPrevBlock)
4409 hashPrevBlock = pblock->hashPrevBlock;
4412 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
4413 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
4414 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
4416 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
4420 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
4423 // Pre-build hash buffers
4430 uint256 hashPrevBlock;
4431 uint256 hashMerkleRoot;
4434 unsigned int nNonce;
4437 unsigned char pchPadding0[64];
4439 unsigned char pchPadding1[64];
4442 memset(&tmp, 0, sizeof(tmp));
4444 tmp.block.nVersion = pblock->nVersion;
4445 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
4446 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
4447 tmp.block.nTime = pblock->nTime;
4448 tmp.block.nBits = pblock->nBits;
4449 tmp.block.nNonce = pblock->nNonce;
4451 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
4452 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
4454 // Byte swap all the input buffer
4455 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
4456 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
4458 // Precalc the first half of the first hash, which stays constant
4459 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
4461 memcpy(pdata, &tmp.block, 128);
4462 memcpy(phash1, &tmp.hash1, 64);
4466 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
4468 uint256 hash = pblock->GetHash();
4469 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
4471 if(!pblock->IsProofOfWork())
4472 return error("CheckWork() : %s is not a proof-of-work block", hash.GetHex().c_str());
4474 if (hash > hashTarget)
4475 return error("CheckWork() : proof-of-work not meeting target");
4478 printf("CheckWork() : new proof-of-stake block found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
4480 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
4485 if (pblock->hashPrevBlock != hashBestChain)
4486 return error("CheckWork() : generated block is stale");
4488 // Remove key from key pool
4489 reservekey.KeepKey();
4491 // Track how many getdata requests this block gets
4493 LOCK(wallet.cs_wallet);
4494 wallet.mapRequestCount[pblock->GetHash()] = 0;
4497 // Process this block the same as if we had received it from another node
4498 if (!ProcessBlock(NULL, pblock))
4499 return error("CheckWork() : ProcessBlock, block not accepted");
4505 bool CheckStake(CBlock* pblock, CWallet& wallet)
4507 uint256 proofHash = 0, hashTarget = 0;
4508 uint256 hash = pblock->GetHash();
4510 if(!pblock->IsProofOfStake())
4511 return error("CheckStake() : %s is not a proof-of-stake block", hash.GetHex().c_str());
4513 // verify hash target and signature of coinstake tx
4514 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, proofHash, hashTarget))
4515 return error("CheckStake() : proof-of-stake checking failed");
4518 printf("CheckStake() : new proof-of-stake block found \n hash: %s \nproofhash: %s \ntarget: %s\n", hash.GetHex().c_str(), proofHash.GetHex().c_str(), hashTarget.GetHex().c_str());
4520 printf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()).c_str());
4525 if (pblock->hashPrevBlock != hashBestChain)
4526 return error("CheckStake() : generated block is stale");
4528 // Track how many getdata requests this block gets
4530 LOCK(wallet.cs_wallet);
4531 wallet.mapRequestCount[pblock->GetHash()] = 0;
4534 // Process this block the same as if we had received it from another node
4535 if (!ProcessBlock(NULL, pblock))
4536 return error("CheckStake() : ProcessBlock, block not accepted");
4542 void StakeMiner(CWallet *pwallet)
4544 SetThreadPriority(THREAD_PRIORITY_LOWEST);
4546 // Make this thread recognisable as the mining thread
4547 RenameThread("novacoin-miner");
4549 // Each thread has its own counter
4550 unsigned int nExtraNonce = 0;
4556 while (vNodes.empty() || IsInitialBlockDownload())
4563 while (pwallet->IsLocked())
4565 strMintWarning = strMintMessage;
4568 strMintWarning = "";
4573 CBlockIndex* pindexPrev = pindexBest;
4575 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, true));
4578 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
4580 if(pblock->IsProofOfStake())
4582 // Trying to sign a block
4583 if (!pblock->SignBlock(*pwalletMain))
4585 strMintWarning = strMintMessage;
4589 strMintWarning = "";
4590 SetThreadPriority(THREAD_PRIORITY_NORMAL);
4591 CheckStake(pblock.get(), *pwalletMain);
4592 SetThreadPriority(THREAD_PRIORITY_LOWEST);