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"
12 #include "ui_interface.h"
14 #include "zerocoin/Zerocoin.h"
15 #include <boost/algorithm/string/replace.hpp>
16 #include <boost/filesystem.hpp>
17 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
27 CCriticalSection cs_setpwalletRegistered;
28 set<CWallet*> setpwalletRegistered;
30 CCriticalSection cs_main;
33 unsigned int nTransactionsUpdated = 0;
35 map<uint256, CBlockIndex*> mapBlockIndex;
36 set<pair<COutPoint, unsigned int> > setStakeSeen;
37 libzerocoin::Params* ZCParams;
39 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
40 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
41 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
42 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
43 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
45 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
47 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
48 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
49 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
50 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
52 int nCoinbaseMaturity = 500;
53 CBlockIndex* pindexGenesisBlock = NULL;
56 uint256 nBestChainTrust = 0;
57 uint256 nBestInvalidTrust = 0;
59 uint256 hashBestChain = 0;
60 CBlockIndex* pindexBest = NULL;
61 int64 nTimeBestReceived = 0;
63 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
65 map<uint256, CBlock*> mapOrphanBlocks;
66 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
67 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
68 map<uint256, uint256> mapProofOfStake;
70 map<uint256, CTransaction> mapOrphanTransactions;
71 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
73 // Constant stuff for coinbase transactions we create:
74 CScript COINBASE_FLAGS;
76 const string strMessageMagic = "NovaCoin Signed Message:\n";
79 int64 nTransactionFee = MIN_TX_FEE;
80 int64 nMinimumInputValue = MIN_TX_FEE;
82 extern enum Checkpoints::CPMode CheckpointsMode;
84 //////////////////////////////////////////////////////////////////////////////
86 // dispatching functions
89 // These functions dispatch to one or all registered wallets
92 void RegisterWallet(CWallet* pwalletIn)
95 LOCK(cs_setpwalletRegistered);
96 setpwalletRegistered.insert(pwalletIn);
100 void UnregisterWallet(CWallet* pwalletIn)
103 LOCK(cs_setpwalletRegistered);
104 setpwalletRegistered.erase(pwalletIn);
108 // check whether the passed transaction is from us
109 bool static IsFromMe(CTransaction& tx)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 if (pwallet->IsFromMe(tx))
117 // get the wallet transaction with the given hash (if it exists)
118 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 if (pwallet->GetTransaction(hashTx,wtx))
126 // erases transaction with the given hash from all wallets
127 void static EraseFromWallets(uint256 hash)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->EraseFromWallet(hash);
133 // make sure all wallets know about the given transaction, in the given block
134 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
138 // ppcoin: wallets need to refund inputs when disconnecting coinstake
139 if (tx.IsCoinStake())
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 if (pwallet->IsFromMe(tx))
143 pwallet->DisableTransaction(tx);
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
152 // notify wallets about a new best chain
153 void static SetBestChain(const CBlockLocator& loc)
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->SetBestChain(loc);
159 // notify wallets about an updated transaction
160 void static UpdatedTransaction(const uint256& hashTx)
162 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
163 pwallet->UpdatedTransaction(hashTx);
167 void static PrintWallets(const CBlock& block)
169 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
170 pwallet->PrintWallet(block);
173 // notify wallets about an incoming inventory (for request counts)
174 void static Inventory(const uint256& hash)
176 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
177 pwallet->Inventory(hash);
180 // ask wallets to resend their transactions
181 void ResendWalletTransactions()
183 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
184 pwallet->ResendWalletTransactions();
193 //////////////////////////////////////////////////////////////////////////////
195 // mapOrphanTransactions
198 bool AddOrphanTx(const CTransaction& tx)
200 uint256 hash = tx.GetHash();
201 if (mapOrphanTransactions.count(hash))
204 // Ignore big transactions, to avoid a
205 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
206 // large transaction with a missing parent then we assume
207 // it will rebroadcast it later, after the parent transaction(s)
208 // have been mined or received.
209 // 10,000 orphans, each of which is at most 5,000 bytes big is
210 // at most 500 megabytes of orphans:
212 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
216 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
220 mapOrphanTransactions[hash] = tx;
221 BOOST_FOREACH(const CTxIn& txin, tx.vin)
222 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
224 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
225 mapOrphanTransactions.size());
229 void static EraseOrphanTx(uint256 hash)
231 if (!mapOrphanTransactions.count(hash))
233 const CTransaction& tx = mapOrphanTransactions[hash];
234 BOOST_FOREACH(const CTxIn& txin, tx.vin)
236 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
237 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
238 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, CTransaction>::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())
312 if (fEnforceCanonical && !txin.scriptSig.HasCanonicalPushes()) {
316 BOOST_FOREACH(const CTxOut& txout, vout) {
317 if (!::IsStandard(txout.scriptPubKey))
319 if (txout.nValue == 0)
321 if (fEnforceCanonical && !txout.scriptPubKey.HasCanonicalPushes()) {
329 // Check transaction inputs, and make sure any
330 // pay-to-script-hash transactions are evaluating IsStandard scripts
332 // Why bother? To avoid denial-of-service attacks; an attacker
333 // can submit a standard HASH... OP_EQUAL transaction,
334 // which will get accepted into blocks. The redemption
335 // script can be anything; an attacker could use a very
336 // expensive-to-check-upon-redemption script like:
337 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
339 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
342 return true; // Coinbases don't use vin normally
344 for (unsigned int i = 0; i < vin.size(); i++)
346 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
348 vector<vector<unsigned char> > vSolutions;
349 txnouttype whichType;
350 // get the scriptPubKey corresponding to this input:
351 const CScript& prevScript = prev.scriptPubKey;
352 if (!Solver(prevScript, whichType, vSolutions))
354 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
355 if (nArgsExpected < 0)
358 // Transactions with extra stuff in their scriptSigs are
359 // non-standard. Note that this EvalScript() call will
360 // be quick, because if there are any operations
361 // beside "push data" in the scriptSig the
362 // IsStandard() call returns false
363 vector<vector<unsigned char> > stack;
364 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
367 if (whichType == TX_SCRIPTHASH)
371 CScript subscript(stack.back().begin(), stack.back().end());
372 vector<vector<unsigned char> > vSolutions2;
373 txnouttype whichType2;
374 if (!Solver(subscript, whichType2, vSolutions2))
376 if (whichType2 == TX_SCRIPTHASH)
380 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
383 nArgsExpected += tmpExpected;
386 if (stack.size() != (unsigned int)nArgsExpected)
394 CTransaction::GetLegacySigOpCount() const
396 unsigned int nSigOps = 0;
397 BOOST_FOREACH(const CTxIn& txin, vin)
399 nSigOps += txin.scriptSig.GetSigOpCount(false);
401 BOOST_FOREACH(const CTxOut& txout, vout)
403 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
409 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
421 // Load the block this tx is in
423 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
425 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
430 // Update the tx's hashBlock
431 hashBlock = pblock->GetHash();
433 // Locate the transaction
434 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
435 if (pblock->vtx[nIndex] == *(CTransaction*)this)
437 if (nIndex == (int)pblock->vtx.size())
439 vMerkleBranch.clear();
441 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
445 // Fill in merkle branch
446 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
449 // Is the tx in a block that's in the main chain
450 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
451 if (mi == mapBlockIndex.end())
453 CBlockIndex* pindex = (*mi).second;
454 if (!pindex || !pindex->IsInMainChain())
457 return pindexBest->nHeight - pindex->nHeight + 1;
466 bool CTransaction::CheckTransaction() const
468 // Basic checks that don't depend on any context
470 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
472 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
474 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
475 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
477 // Check for negative or overflow output values
479 for (unsigned int i = 0; i < vout.size(); i++)
481 const CTxOut& txout = vout[i];
482 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
483 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
485 if (txout.nValue < 0)
486 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
487 if (txout.nValue > MAX_MONEY)
488 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
489 nValueOut += txout.nValue;
490 if (!MoneyRange(nValueOut))
491 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
494 // Check for duplicate inputs
495 set<COutPoint> vInOutPoints;
496 BOOST_FOREACH(const CTxIn& txin, vin)
498 if (vInOutPoints.count(txin.prevout))
500 vInOutPoints.insert(txin.prevout);
505 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
506 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
510 BOOST_FOREACH(const CTxIn& txin, vin)
511 if (txin.prevout.IsNull())
512 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
518 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
520 // Use new fees approach if we are on test network or
521 // switch date has been reached
522 bool fNewApproach = fTestNet || nTime > FEE_SWITCH_TIME;
524 int64 nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
526 if(!fNewApproach || IsCoinStake())
528 // Enforce 0.01 as minimum fee for old approach or coinstake
530 nMinRelayTxFee = CENT;
533 // Base fee is either nMinTxFee or nMinRelayTxFee
534 int64 nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
536 unsigned int nNewBlockSize = nBlockSize + nBytes;
537 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
545 // Transactions under 1K are free
551 // Free transaction area
552 if (nNewBlockSize < 27000)
557 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
558 // each non empty output which is less than 0.01
560 // It's safe to ignore empty outputs here, because these inputs are allowed
561 // only for coinbase and coinstake transactions.
562 BOOST_FOREACH(const CTxOut& txout, vout)
563 if (txout.nValue < CENT && !txout.IsEmpty())
566 else if (nMinFee < nBaseFee)
568 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if
569 // any output is less than 0.01
570 BOOST_FOREACH(const CTxOut& txout, vout)
571 if (txout.nValue < CENT)
575 // Raise the price as the block approaches full
576 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
578 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
580 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
583 if (!MoneyRange(nMinFee))
590 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
591 bool* pfMissingInputs)
594 *pfMissingInputs = false;
596 if (!tx.CheckTransaction())
597 return error("CTxMemPool::accept() : CheckTransaction failed");
599 // Coinbase is only valid in a block, not as a loose transaction
601 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
603 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
604 if (tx.IsCoinStake())
605 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
607 // To help v0.1.5 clients who would see it as a negative number
608 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
609 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
611 // Rather not work on nonstandard transactions (unless -testnet)
612 if (!fTestNet && !tx.IsStandard())
613 return error("CTxMemPool::accept() : nonstandard transaction type");
615 // Do we already have it?
616 uint256 hash = tx.GetHash();
619 if (mapTx.count(hash))
623 if (txdb.ContainsTx(hash))
626 // Check for conflicts with in-memory transactions
627 CTransaction* ptxOld = NULL;
628 for (unsigned int i = 0; i < tx.vin.size(); i++)
630 COutPoint outpoint = tx.vin[i].prevout;
631 if (mapNextTx.count(outpoint))
633 // Disable replacement feature for now
636 // Allow replacing with a newer version of the same transaction
639 ptxOld = mapNextTx[outpoint].ptx;
640 if (ptxOld->IsFinal())
642 if (!tx.IsNewerThan(*ptxOld))
644 for (unsigned int i = 0; i < tx.vin.size(); i++)
646 COutPoint outpoint = tx.vin[i].prevout;
647 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
657 map<uint256, CTxIndex> mapUnused;
658 bool fInvalid = false;
659 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
662 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
664 *pfMissingInputs = true;
668 // Check for non-standard pay-to-script-hash in inputs
669 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
670 return error("CTxMemPool::accept() : nonstandard transaction input");
672 // Note: if you modify this code to accept non-standard transactions, then
673 // you should add code here to check that the transaction does a
674 // reasonable number of ECDSA signature verifications.
676 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
677 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
679 // Don't accept it if it can't get into a block
680 int64 txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
681 if (nFees < txMinFee)
682 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
683 hash.ToString().c_str(),
686 // Continuously rate-limit free transactions
687 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
688 // be annoying or make others' transactions take longer to confirm.
689 if (nFees < MIN_RELAY_TX_FEE)
691 static CCriticalSection cs;
692 static double dFreeCount;
693 static int64 nLastTime;
694 int64 nNow = GetTime();
698 // Use an exponentially decaying ~10-minute window:
699 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
701 // -limitfreerelay unit is thousand-bytes-per-minute
702 // At default rate it would take over a month to fill 1GB
703 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
704 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
706 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
711 // Check against previous transactions
712 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
713 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
715 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
719 // Store transaction in memory
724 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
727 addUnchecked(hash, tx);
730 ///// are we sure this is ok when loading transactions or restoring block txes
731 // If updated, erase old tx from wallet
733 EraseFromWallets(ptxOld->GetHash());
735 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
736 hash.ToString().substr(0,10).c_str(),
741 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
743 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
746 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
748 // Add to memory pool without checking anything. Don't call this directly,
749 // call CTxMemPool::accept to properly check the transaction first.
752 for (unsigned int i = 0; i < tx.vin.size(); i++)
753 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
754 nTransactionsUpdated++;
760 bool CTxMemPool::remove(CTransaction &tx)
762 // Remove transaction from memory pool
765 uint256 hash = tx.GetHash();
766 if (mapTx.count(hash))
768 BOOST_FOREACH(const CTxIn& txin, tx.vin)
769 mapNextTx.erase(txin.prevout);
771 nTransactionsUpdated++;
777 void CTxMemPool::clear()
782 ++nTransactionsUpdated;
785 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
790 vtxid.reserve(mapTx.size());
791 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
792 vtxid.push_back((*mi).first);
798 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
800 if (hashBlock == 0 || nIndex == -1)
803 // Find the block it claims to be in
804 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
805 if (mi == mapBlockIndex.end())
807 CBlockIndex* pindex = (*mi).second;
808 if (!pindex || !pindex->IsInMainChain())
811 // Make sure the merkle branch connects to this block
812 if (!fMerkleVerified)
814 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
816 fMerkleVerified = true;
820 return pindexBest->nHeight - pindex->nHeight + 1;
824 int CMerkleTx::GetBlocksToMaturity() const
826 if (!(IsCoinBase() || IsCoinStake()))
828 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
832 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
836 if (!IsInMainChain() && !ClientConnectInputs())
838 return CTransaction::AcceptToMemoryPool(txdb, false);
842 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
846 bool CMerkleTx::AcceptToMemoryPool()
849 return AcceptToMemoryPool(txdb);
854 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
859 // Add previous supporting transactions first
860 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
862 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
864 uint256 hash = tx.GetHash();
865 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
866 tx.AcceptToMemoryPool(txdb, fCheckInputs);
869 return AcceptToMemoryPool(txdb, fCheckInputs);
874 bool CWalletTx::AcceptWalletTransaction()
877 return AcceptWalletTransaction(txdb);
880 int CTxIndex::GetDepthInMainChain() const
884 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
886 // Find the block in the index
887 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
888 if (mi == mapBlockIndex.end())
890 CBlockIndex* pindex = (*mi).second;
891 if (!pindex || !pindex->IsInMainChain())
893 return 1 + nBestHeight - pindex->nHeight;
896 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
897 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
903 if (mempool.exists(hash))
905 tx = mempool.lookup(hash);
911 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
914 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
915 hashBlock = block.GetHash();
929 //////////////////////////////////////////////////////////////////////////////
931 // CBlock and CBlockIndex
934 static CBlockIndex* pblockindexFBBHLast;
935 CBlockIndex* FindBlockByHeight(int nHeight)
937 CBlockIndex *pblockindex;
938 if (nHeight < nBestHeight / 2)
939 pblockindex = pindexGenesisBlock;
941 pblockindex = pindexBest;
942 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
943 pblockindex = pblockindexFBBHLast;
944 while (pblockindex->nHeight > nHeight)
945 pblockindex = pblockindex->pprev;
946 while (pblockindex->nHeight < nHeight)
947 pblockindex = pblockindex->pnext;
948 pblockindexFBBHLast = pblockindex;
952 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
954 if (!fReadTransactions)
956 *this = pindex->GetBlockHeader();
959 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
961 if (GetHash() != pindex->GetBlockHash())
962 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
966 uint256 static GetOrphanRoot(const CBlock* pblock)
968 // Work back to the first block in the orphan chain
969 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
970 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
971 return pblock->GetHash();
974 // ppcoin: find block wanted by given orphan block
975 uint256 WantedByOrphan(const CBlock* pblockOrphan)
977 // Work back to the first block in the orphan chain
978 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
979 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
980 return pblockOrphan->hashPrevBlock;
983 // select stake target limit according to hard-coded conditions
984 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
986 if(fTestNet) // separate proof of stake target limit for testnet
987 return bnProofOfStakeLimit;
988 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
989 return bnProofOfStakeLimit;
990 if(nHeight + 1 > 15000) // 24 bits since block 15000
991 return bnProofOfStakeLegacyLimit;
992 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
993 return bnProofOfStakeHardLimit;
995 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
998 // miner's coin base reward based on nBits
999 int64 GetProofOfWorkReward(unsigned int nBits)
1001 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1004 bnTarget.SetCompact(nBits);
1005 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1006 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1008 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1009 // A reasonably continuous curve is used to avoid shock to market
1010 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1012 // Human readable form:
1014 // nSubsidy = 100 / (diff ^ 1/6)
1015 CBigNum bnLowerBound = CENT;
1016 CBigNum bnUpperBound = bnSubsidyLimit;
1017 while (bnLowerBound + CENT <= bnUpperBound)
1019 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1020 if (fDebug && GetBoolArg("-printcreation"))
1021 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1022 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1023 bnUpperBound = bnMidValue;
1025 bnLowerBound = bnMidValue;
1028 int64 nSubsidy = bnUpperBound.getuint64();
1030 nSubsidy = (nSubsidy / CENT) * CENT;
1031 if (fDebug && GetBoolArg("-printcreation"))
1032 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1034 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
1037 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1038 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1040 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1042 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1044 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1046 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1048 bnTarget.SetCompact(nBits);
1049 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1050 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1052 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1054 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1055 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1056 bnMidPart, bnRewardPart;
1058 while (bnLowerBound + CENT <= bnUpperBound)
1060 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1061 if (fDebug && GetBoolArg("-printcreation"))
1062 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1064 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1067 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1069 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1071 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1074 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1075 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1080 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1082 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1084 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1087 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1088 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1091 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1092 bnUpperBound = bnMidValue;
1094 bnLowerBound = bnMidValue;
1097 nRewardCoinYear = bnUpperBound.getuint64();
1098 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1102 // Old creation amount per coin-year, 5% fixed stake mint rate
1103 nRewardCoinYear = 5 * CENT;
1107 return nRewardCoinYear;
1109 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1111 // Set reasonable reward limit for large inputs since 20 Oct 2013
1113 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1114 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1116 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1117 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1119 nSubsidy = min(nSubsidy, nSubsidyLimit);
1122 if (fDebug && GetBoolArg("-printcreation"))
1123 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1127 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1129 // get proof of work blocks max spacing according to hard-coded conditions
1130 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1132 if(nTime > TARGETS_SWITCH_TIME)
1133 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1136 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1138 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1142 // maximum nBits value could possible be required nTime after
1144 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1147 bnResult.SetCompact(nBase);
1149 while (nTime > 0 && bnResult < bnTargetLimit)
1151 // Maximum 200% adjustment per day...
1153 nTime -= 24 * 60 * 60;
1155 if (bnResult > bnTargetLimit)
1156 bnResult = bnTargetLimit;
1157 return bnResult.GetCompact();
1161 // minimum amount of work that could possibly be required nTime after
1162 // minimum proof-of-work required was nBase
1164 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1166 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1170 // minimum amount of stake that could possibly be required nTime after
1171 // minimum proof-of-stake required was nBase
1173 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1175 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1179 // ppcoin: find last block index up to pindex
1180 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1182 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1183 pindex = pindex->pprev;
1187 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1189 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1191 if (pindexLast == NULL)
1192 return bnTargetLimit.GetCompact(); // genesis block
1194 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1195 if (pindexPrev->pprev == NULL)
1196 return bnTargetLimit.GetCompact(); // first block
1197 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1198 if (pindexPrevPrev->pprev == NULL)
1199 return bnTargetLimit.GetCompact(); // second block
1201 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1203 // ppcoin: target change every block
1204 // ppcoin: retarget with exponential moving toward target spacing
1206 bnNew.SetCompact(pindexPrev->nBits);
1207 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1208 int64 nInterval = nTargetTimespan / nTargetSpacing;
1209 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1210 bnNew /= ((nInterval + 1) * nTargetSpacing);
1212 if (bnNew > bnTargetLimit)
1213 bnNew = bnTargetLimit;
1215 return bnNew.GetCompact();
1218 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1221 bnTarget.SetCompact(nBits);
1224 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1225 return error("CheckProofOfWork() : nBits below minimum work");
1227 // Check proof of work matches claimed amount
1228 if (hash > bnTarget.getuint256())
1229 return error("CheckProofOfWork() : hash doesn't match nBits");
1234 // Return maximum amount of blocks that other nodes claim to have
1235 int GetNumBlocksOfPeers()
1237 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1240 bool IsInitialBlockDownload()
1242 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1244 static int64 nLastUpdate;
1245 static CBlockIndex* pindexLastBest;
1246 if (pindexBest != pindexLastBest)
1248 pindexLastBest = pindexBest;
1249 nLastUpdate = GetTime();
1251 return (GetTime() - nLastUpdate < 10 &&
1252 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1255 void static InvalidChainFound(CBlockIndex* pindexNew)
1257 if (pindexNew->nChainTrust > nBestInvalidTrust)
1259 nBestInvalidTrust = pindexNew->nChainTrust;
1260 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1261 uiInterface.NotifyBlocksChanged();
1264 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1265 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1267 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1268 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1269 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1270 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1271 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1272 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1273 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1274 nBestBlockTrust.Get64(),
1275 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1279 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1281 nTime = max(GetBlockTime(), GetAdjustedTime());
1294 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1296 // Relinquish previous transactions' spent pointers
1299 BOOST_FOREACH(const CTxIn& txin, vin)
1301 COutPoint prevout = txin.prevout;
1303 // Get prev txindex from disk
1305 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1306 return error("DisconnectInputs() : ReadTxIndex failed");
1308 if (prevout.n >= txindex.vSpent.size())
1309 return error("DisconnectInputs() : prevout.n out of range");
1311 // Mark outpoint as not spent
1312 txindex.vSpent[prevout.n].SetNull();
1315 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1316 return error("DisconnectInputs() : UpdateTxIndex failed");
1320 // Remove transaction from index
1321 // This can fail if a duplicate of this transaction was in a chain that got
1322 // reorganized away. This is only possible if this transaction was completely
1323 // spent, so erasing it would be a no-op anyway.
1324 txdb.EraseTxIndex(*this);
1330 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1331 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1333 // FetchInputs can return false either because we just haven't seen some inputs
1334 // (in which case the transaction should be stored as an orphan)
1335 // or because the transaction is malformed (in which case the transaction should
1336 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1340 return true; // Coinbase transactions have no inputs to fetch.
1342 for (unsigned int i = 0; i < vin.size(); i++)
1344 COutPoint prevout = vin[i].prevout;
1345 if (inputsRet.count(prevout.hash))
1346 continue; // Got it already
1349 CTxIndex& txindex = inputsRet[prevout.hash].first;
1351 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1353 // Get txindex from current proposed changes
1354 txindex = mapTestPool.find(prevout.hash)->second;
1358 // Read txindex from txdb
1359 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1361 if (!fFound && (fBlock || fMiner))
1362 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());
1365 CTransaction& txPrev = inputsRet[prevout.hash].second;
1366 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1368 // Get prev tx from single transactions in memory
1371 if (!mempool.exists(prevout.hash))
1372 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());
1373 txPrev = mempool.lookup(prevout.hash);
1376 txindex.vSpent.resize(txPrev.vout.size());
1380 // Get prev tx from disk
1381 if (!txPrev.ReadFromDisk(txindex.pos))
1382 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1386 // Make sure all prevout.n indexes are valid:
1387 for (unsigned int i = 0; i < vin.size(); i++)
1389 const COutPoint prevout = vin[i].prevout;
1390 assert(inputsRet.count(prevout.hash) != 0);
1391 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1392 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1393 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1395 // Revisit this if/when transaction replacement is implemented and allows
1398 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()));
1405 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1407 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1408 if (mi == inputs.end())
1409 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1411 const CTransaction& txPrev = (mi->second).second;
1412 if (input.prevout.n >= txPrev.vout.size())
1413 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1415 return txPrev.vout[input.prevout.n];
1418 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1424 for (unsigned int i = 0; i < vin.size(); i++)
1426 nResult += GetOutputFor(vin[i], inputs).nValue;
1432 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1437 unsigned int nSigOps = 0;
1438 for (unsigned int i = 0; i < vin.size(); i++)
1440 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1441 if (prevout.scriptPubKey.IsPayToScriptHash())
1442 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1447 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1448 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1450 // Take over previous transactions' spent pointers
1451 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1452 // fMiner is true when called from the internal bitcoin miner
1453 // ... both are false when called from CTransaction::AcceptToMemoryPool
1458 for (unsigned int i = 0; i < vin.size(); i++)
1460 COutPoint prevout = vin[i].prevout;
1461 assert(inputs.count(prevout.hash) > 0);
1462 CTxIndex& txindex = inputs[prevout.hash].first;
1463 CTransaction& txPrev = inputs[prevout.hash].second;
1465 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1466 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()));
1468 // If prev is coinbase or coinstake, check that it's matured
1469 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1470 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1471 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1472 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1474 // ppcoin: check transaction timestamp
1475 if (txPrev.nTime > nTime)
1476 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1478 // Check for negative or overflow input values
1479 nValueIn += txPrev.vout[prevout.n].nValue;
1480 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1481 return DoS(100, error("ConnectInputs() : txin values out of range"));
1484 // The first loop above does all the inexpensive checks.
1485 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1486 // Helps prevent CPU exhaustion attacks.
1487 for (unsigned int i = 0; i < vin.size(); i++)
1489 COutPoint prevout = vin[i].prevout;
1490 assert(inputs.count(prevout.hash) > 0);
1491 CTxIndex& txindex = inputs[prevout.hash].first;
1492 CTransaction& txPrev = inputs[prevout.hash].second;
1494 // Check for conflicts (double-spend)
1495 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1496 // for an attacker to attempt to split the network.
1497 if (!txindex.vSpent[prevout.n].IsNull())
1498 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());
1500 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1501 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1502 // still computed and checked, and any change will be caught at the next checkpoint.
1503 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1506 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1508 // only during transition phase for P2SH: do not invoke anti-DoS code for
1509 // potentially old clients relaying bad P2SH transactions
1510 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1511 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1513 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1517 // Mark outpoints as spent
1518 txindex.vSpent[prevout.n] = posThisTx;
1521 if (fBlock || fMiner)
1523 mapTestPool[prevout.hash] = txindex;
1529 // ppcoin: coin stake tx earns reward instead of paying fee
1531 if (!GetCoinAge(txdb, nCoinAge))
1532 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1534 unsigned int nTxSize = (nTime > VALIDATION_SWITCH_TIME || fTestNet) ? GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION) : 0;
1536 int64 nReward = GetValueOut() - nValueIn;
1537 int64 nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1539 if (nReward > nCalculatedReward)
1540 return DoS(100, error("CheckInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nReward, nCalculatedReward));
1544 if (nValueIn < GetValueOut())
1545 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1547 // Tally transaction fees
1548 int64 nTxFee = nValueIn - GetValueOut();
1550 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1553 if (!MoneyRange(nFees))
1554 return DoS(100, error("ConnectInputs() : nFees out of range"));
1562 bool CTransaction::ClientConnectInputs()
1567 // Take over previous transactions' spent pointers
1571 for (unsigned int i = 0; i < vin.size(); i++)
1573 // Get prev tx from single transactions in memory
1574 COutPoint prevout = vin[i].prevout;
1575 if (!mempool.exists(prevout.hash))
1577 CTransaction& txPrev = mempool.lookup(prevout.hash);
1579 if (prevout.n >= txPrev.vout.size())
1583 if (!VerifySignature(txPrev, *this, i, true, 0))
1584 return error("ConnectInputs() : VerifySignature failed");
1586 ///// this is redundant with the mempool.mapNextTx stuff,
1587 ///// not sure which I want to get rid of
1588 ///// this has to go away now that posNext is gone
1589 // // Check for conflicts
1590 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1591 // return error("ConnectInputs() : prev tx already used");
1593 // // Flag outpoints as used
1594 // txPrev.vout[prevout.n].posNext = posThisTx;
1596 nValueIn += txPrev.vout[prevout.n].nValue;
1598 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1599 return error("ClientConnectInputs() : txin values out of range");
1601 if (GetValueOut() > nValueIn)
1611 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1613 // Disconnect in reverse order
1614 for (int i = vtx.size()-1; i >= 0; i--)
1615 if (!vtx[i].DisconnectInputs(txdb))
1618 // Update block index on disk without changing it in memory.
1619 // The memory index structure will be changed after the db commits.
1622 CDiskBlockIndex blockindexPrev(pindex->pprev);
1623 blockindexPrev.hashNext = 0;
1624 if (!txdb.WriteBlockIndex(blockindexPrev))
1625 return error("DisconnectBlock() : WriteBlockIndex failed");
1628 // ppcoin: clean up wallet after disconnecting coinstake
1629 BOOST_FOREACH(CTransaction& tx, vtx)
1630 SyncWithWallets(tx, this, false, false);
1635 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1637 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1638 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1641 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1642 // unless those are already completely spent.
1643 // If such overwrites are allowed, coinbases and transactions depending upon those
1644 // can be duplicated to remove the ability to spend the first instance -- even after
1645 // being sent to another address.
1646 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1647 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1648 // already refuses previously-known transaction ids entirely.
1649 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1650 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1651 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1652 // initial block download.
1653 bool fEnforceBIP30 = true; // Always active in NovaCoin
1654 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1656 //// issue here: it doesn't know the version
1657 unsigned int nTxPos;
1659 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1660 // 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
1663 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1665 map<uint256, CTxIndex> mapQueuedChanges;
1668 int64 nValueOut = 0;
1669 unsigned int nSigOps = 0;
1670 BOOST_FOREACH(CTransaction& tx, vtx)
1672 uint256 hashTx = tx.GetHash();
1674 if (fEnforceBIP30) {
1675 CTxIndex txindexOld;
1676 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1677 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1683 nSigOps += tx.GetLegacySigOpCount();
1684 if (nSigOps > MAX_BLOCK_SIGOPS)
1685 return DoS(100, error("ConnectBlock() : too many sigops"));
1687 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1689 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1691 MapPrevTx mapInputs;
1692 if (tx.IsCoinBase())
1693 nValueOut += tx.GetValueOut();
1697 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1700 if (fStrictPayToScriptHash)
1702 // Add in sigops done by pay-to-script-hash inputs;
1703 // this is to prevent a "rogue miner" from creating
1704 // an incredibly-expensive-to-validate block.
1705 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1706 if (nSigOps > MAX_BLOCK_SIGOPS)
1707 return DoS(100, error("ConnectBlock() : too many sigops"));
1710 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1711 int64 nTxValueOut = tx.GetValueOut();
1712 nValueIn += nTxValueIn;
1713 nValueOut += nTxValueOut;
1714 if (!tx.IsCoinStake())
1715 nFees += nTxValueIn - nTxValueOut;
1717 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1721 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1724 // ppcoin: track money supply and mint amount info
1725 pindex->nMint = nValueOut - nValueIn + nFees;
1726 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1727 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1728 return error("Connect() : WriteBlockIndex for pindex failed");
1730 // ppcoin: fees are not collected by miners as in bitcoin
1731 // ppcoin: fees are destroyed to compensate the entire network
1732 if (fDebug && GetBoolArg("-printcreation"))
1733 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1738 // Write queued txindex changes
1739 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1741 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1742 return error("ConnectBlock() : UpdateTxIndex failed");
1745 // Update block index on disk without changing it in memory.
1746 // The memory index structure will be changed after the db commits.
1749 CDiskBlockIndex blockindexPrev(pindex->pprev);
1750 blockindexPrev.hashNext = pindex->GetBlockHash();
1751 if (!txdb.WriteBlockIndex(blockindexPrev))
1752 return error("ConnectBlock() : WriteBlockIndex failed");
1755 // Watch for transactions paying to me
1756 BOOST_FOREACH(CTransaction& tx, vtx)
1757 SyncWithWallets(tx, this, true);
1762 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1764 printf("REORGANIZE\n");
1767 CBlockIndex* pfork = pindexBest;
1768 CBlockIndex* plonger = pindexNew;
1769 while (pfork != plonger)
1771 while (plonger->nHeight > pfork->nHeight)
1772 if (!(plonger = plonger->pprev))
1773 return error("Reorganize() : plonger->pprev is null");
1774 if (pfork == plonger)
1776 if (!(pfork = pfork->pprev))
1777 return error("Reorganize() : pfork->pprev is null");
1780 // List of what to disconnect
1781 vector<CBlockIndex*> vDisconnect;
1782 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1783 vDisconnect.push_back(pindex);
1785 // List of what to connect
1786 vector<CBlockIndex*> vConnect;
1787 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1788 vConnect.push_back(pindex);
1789 reverse(vConnect.begin(), vConnect.end());
1791 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());
1792 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());
1794 // Disconnect shorter branch
1795 vector<CTransaction> vResurrect;
1796 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1799 if (!block.ReadFromDisk(pindex))
1800 return error("Reorganize() : ReadFromDisk for disconnect failed");
1801 if (!block.DisconnectBlock(txdb, pindex))
1802 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1804 // Queue memory transactions to resurrect
1805 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1806 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1807 vResurrect.push_back(tx);
1810 // Connect longer branch
1811 vector<CTransaction> vDelete;
1812 for (unsigned int i = 0; i < vConnect.size(); i++)
1814 CBlockIndex* pindex = vConnect[i];
1816 if (!block.ReadFromDisk(pindex))
1817 return error("Reorganize() : ReadFromDisk for connect failed");
1818 if (!block.ConnectBlock(txdb, pindex))
1821 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1824 // Queue memory transactions to delete
1825 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1826 vDelete.push_back(tx);
1828 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1829 return error("Reorganize() : WriteHashBestChain failed");
1831 // Make sure it's successfully written to disk before changing memory structure
1832 if (!txdb.TxnCommit())
1833 return error("Reorganize() : TxnCommit failed");
1835 // Disconnect shorter branch
1836 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1838 pindex->pprev->pnext = NULL;
1840 // Connect longer branch
1841 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1843 pindex->pprev->pnext = pindex;
1845 // Resurrect memory transactions that were in the disconnected branch
1846 BOOST_FOREACH(CTransaction& tx, vResurrect)
1847 tx.AcceptToMemoryPool(txdb, false);
1849 // Delete redundant memory transactions that are in the connected branch
1850 BOOST_FOREACH(CTransaction& tx, vDelete)
1853 printf("REORGANIZE: done\n");
1859 // Called from inside SetBestChain: attaches a block to the new best chain being built
1860 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1862 uint256 hash = GetHash();
1864 // Adding to current best branch
1865 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1868 InvalidChainFound(pindexNew);
1871 if (!txdb.TxnCommit())
1872 return error("SetBestChain() : TxnCommit failed");
1874 // Add to current best branch
1875 pindexNew->pprev->pnext = pindexNew;
1877 // Delete redundant memory transactions
1878 BOOST_FOREACH(CTransaction& tx, vtx)
1884 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1886 uint256 hash = GetHash();
1888 if (!txdb.TxnBegin())
1889 return error("SetBestChain() : TxnBegin failed");
1891 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1893 txdb.WriteHashBestChain(hash);
1894 if (!txdb.TxnCommit())
1895 return error("SetBestChain() : TxnCommit failed");
1896 pindexGenesisBlock = pindexNew;
1898 else if (hashPrevBlock == hashBestChain)
1900 if (!SetBestChainInner(txdb, pindexNew))
1901 return error("SetBestChain() : SetBestChainInner failed");
1905 // the first block in the new chain that will cause it to become the new best chain
1906 CBlockIndex *pindexIntermediate = pindexNew;
1908 // list of blocks that need to be connected afterwards
1909 std::vector<CBlockIndex*> vpindexSecondary;
1911 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1912 // Try to limit how much needs to be done inside
1913 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1915 vpindexSecondary.push_back(pindexIntermediate);
1916 pindexIntermediate = pindexIntermediate->pprev;
1919 if (!vpindexSecondary.empty())
1920 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1922 // Switch to new best branch
1923 if (!Reorganize(txdb, pindexIntermediate))
1926 InvalidChainFound(pindexNew);
1927 return error("SetBestChain() : Reorganize failed");
1930 // Connect further blocks
1931 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1934 if (!block.ReadFromDisk(pindex))
1936 printf("SetBestChain() : ReadFromDisk failed\n");
1939 if (!txdb.TxnBegin()) {
1940 printf("SetBestChain() : TxnBegin 2 failed\n");
1943 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1944 if (!block.SetBestChainInner(txdb, pindex))
1949 // Update best block in wallet (so we can detect restored wallets)
1950 bool fIsInitialDownload = IsInitialBlockDownload();
1951 if (!fIsInitialDownload)
1953 const CBlockLocator locator(pindexNew);
1954 ::SetBestChain(locator);
1958 hashBestChain = hash;
1959 pindexBest = pindexNew;
1960 pblockindexFBBHLast = NULL;
1961 nBestHeight = pindexBest->nHeight;
1962 nBestChainTrust = pindexNew->nChainTrust;
1963 nTimeBestReceived = GetTime();
1964 nTransactionsUpdated++;
1966 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1968 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1969 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1970 CBigNum(nBestChainTrust).ToString().c_str(),
1971 nBestBlockTrust.Get64(),
1972 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1974 // Check the version of the last 100 blocks to see if we need to upgrade:
1975 if (!fIsInitialDownload)
1978 const CBlockIndex* pindex = pindexBest;
1979 for (int i = 0; i < 100 && pindex != NULL; i++)
1981 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1983 pindex = pindex->pprev;
1986 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1987 if (nUpgraded > 100/2)
1988 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1989 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1992 std::string strCmd = GetArg("-blocknotify", "");
1994 if (!fIsInitialDownload && !strCmd.empty())
1996 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1997 boost::thread t(runCommand, strCmd); // thread runs free
2003 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2004 // Only those coins meeting minimum age requirement counts. As those
2005 // transactions not in main chain are not currently indexed so we
2006 // might not find out about their coin age. Older transactions are
2007 // guaranteed to be in main chain by sync-checkpoint. This rule is
2008 // introduced to help nodes establish a consistent view of the coin
2009 // age (trust score) of competing branches.
2010 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
2012 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2018 BOOST_FOREACH(const CTxIn& txin, vin)
2020 // First try finding the previous transaction in database
2021 CTransaction txPrev;
2023 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2024 continue; // previous transaction not in main chain
2025 if (nTime < txPrev.nTime)
2026 return false; // Transaction timestamp violation
2028 // Read block header
2030 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2031 return false; // unable to read block of previous transaction
2032 if (block.GetBlockTime() + nStakeMinAge > nTime)
2033 continue; // only count coins meeting min age requirement
2035 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2036 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2038 if (fDebug && GetBoolArg("-printcoinage"))
2039 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2042 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2043 if (fDebug && GetBoolArg("-printcoinage"))
2044 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2045 nCoinAge = bnCoinDay.getuint64();
2049 // ppcoin: total coin age spent in block, in the unit of coin-days.
2050 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2055 BOOST_FOREACH(const CTransaction& tx, vtx)
2058 if (tx.GetCoinAge(txdb, nTxCoinAge))
2059 nCoinAge += nTxCoinAge;
2064 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2066 if (fDebug && GetBoolArg("-printcoinage"))
2067 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2071 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2073 // Check for duplicate
2074 uint256 hash = GetHash();
2075 if (mapBlockIndex.count(hash))
2076 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2078 // Construct new block index object
2079 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2081 return error("AddToBlockIndex() : new CBlockIndex failed");
2082 pindexNew->phashBlock = &hash;
2083 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2084 if (miPrev != mapBlockIndex.end())
2086 pindexNew->pprev = (*miPrev).second;
2087 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2090 // ppcoin: compute chain trust score
2091 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2093 // ppcoin: compute stake entropy bit for stake modifier
2094 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2095 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2097 // ppcoin: record proof-of-stake hash value
2098 if (pindexNew->IsProofOfStake())
2100 if (!mapProofOfStake.count(hash))
2101 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2102 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2105 // ppcoin: compute stake modifier
2106 uint64 nStakeModifier = 0;
2107 bool fGeneratedStakeModifier = false;
2108 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2109 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2110 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2111 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2112 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2113 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2115 // Add to mapBlockIndex
2116 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2117 if (pindexNew->IsProofOfStake())
2118 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2119 pindexNew->phashBlock = &((*mi).first);
2121 // Write to disk block index
2123 if (!txdb.TxnBegin())
2125 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2126 if (!txdb.TxnCommit())
2130 if (pindexNew->nChainTrust > nBestChainTrust)
2131 if (!SetBestChain(txdb, pindexNew))
2134 if (pindexNew == pindexBest)
2136 // Notify UI to display prev block's coinbase if it was ours
2137 static uint256 hashPrevBestCoinBase;
2138 UpdatedTransaction(hashPrevBestCoinBase);
2139 hashPrevBestCoinBase = vtx[0].GetHash();
2142 uiInterface.NotifyBlocksChanged();
2149 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2151 // These are checks that are independent of context
2152 // that can be verified before saving an orphan block.
2155 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2156 return DoS(100, error("CheckBlock() : size limits failed"));
2158 // Check proof of work matches claimed amount
2159 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2160 return DoS(50, error("CheckBlock() : proof of work failed"));
2163 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2164 return error("CheckBlock() : block timestamp too far in the future");
2166 // First transaction must be coinbase, the rest must not be
2167 if (vtx.empty() || !vtx[0].IsCoinBase())
2168 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2169 for (unsigned int i = 1; i < vtx.size(); i++)
2170 if (vtx[i].IsCoinBase())
2171 return DoS(100, error("CheckBlock() : more than one coinbase"));
2173 // Check coinbase timestamp
2174 if (GetBlockTime() > FutureDrift((int64)vtx[0].nTime))
2175 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2177 if (IsProofOfStake())
2179 // Coinbase output should be empty if proof-of-stake block
2180 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2181 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2183 // Second transaction must be coinstake, the rest must not be
2184 if (vtx.empty() || !vtx[1].IsCoinStake())
2185 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2186 for (unsigned int i = 2; i < vtx.size(); i++)
2187 if (vtx[i].IsCoinStake())
2188 return DoS(100, error("CheckBlock() : more than one coinstake"));
2190 // Check coinstake timestamp
2191 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2192 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2194 // NovaCoin: check proof-of-stake block signature
2195 if (fCheckSig && !CheckBlockSignature(true))
2196 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2200 int64 nReward = GetProofOfWorkReward(nBits);
2201 // Check coinbase reward
2202 if (vtx[0].GetValueOut() > nReward)
2203 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2204 vtx[0].GetValueOut(),
2207 // Should we check proof-of-work block signature or not?
2209 // * Always skip on TestNet
2210 // * Perform checking for the first 9689 blocks
2211 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2213 if(!fTestNet && fCheckSig)
2215 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2217 // NovaCoin: check proof-of-work block signature
2218 if (checkEntropySig && !CheckBlockSignature(false))
2219 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2223 // Check transactions
2224 BOOST_FOREACH(const CTransaction& tx, vtx)
2226 if (!tx.CheckTransaction())
2227 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2229 // ppcoin: check transaction timestamp
2230 if (GetBlockTime() < (int64)tx.nTime)
2231 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2234 // Check for duplicate txids. This is caught by ConnectInputs(),
2235 // but catching it earlier avoids a potential DoS attack:
2236 set<uint256> uniqueTx;
2237 BOOST_FOREACH(const CTransaction& tx, vtx)
2239 uniqueTx.insert(tx.GetHash());
2241 if (uniqueTx.size() != vtx.size())
2242 return DoS(100, error("CheckBlock() : duplicate transaction"));
2244 unsigned int nSigOps = 0;
2245 BOOST_FOREACH(const CTransaction& tx, vtx)
2247 nSigOps += tx.GetLegacySigOpCount();
2249 if (nSigOps > MAX_BLOCK_SIGOPS)
2250 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2252 // Check merkle root
2253 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2254 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2260 bool CBlock::AcceptBlock()
2262 // Check for duplicate
2263 uint256 hash = GetHash();
2264 if (mapBlockIndex.count(hash))
2265 return error("AcceptBlock() : block already in mapBlockIndex");
2267 // Get prev block index
2268 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2269 if (mi == mapBlockIndex.end())
2270 return DoS(10, error("AcceptBlock() : prev block not found"));
2271 CBlockIndex* pindexPrev = (*mi).second;
2272 int nHeight = pindexPrev->nHeight+1;
2274 // Check proof-of-work or proof-of-stake
2275 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2276 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2278 // Check timestamp against prev
2279 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2280 return error("AcceptBlock() : block's timestamp is too early");
2282 // Check that all transactions are finalized
2283 BOOST_FOREACH(const CTransaction& tx, vtx)
2284 if (!tx.IsFinal(nHeight, GetBlockTime()))
2285 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2287 // Check that the block chain matches the known block chain up to a checkpoint
2288 if (!Checkpoints::CheckHardened(nHeight, hash))
2289 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2291 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2293 // Check that the block satisfies synchronized checkpoint
2294 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2295 return error("AcceptBlock() : rejected by synchronized checkpoint");
2297 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2298 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2300 // Enforce rule that the coinbase starts with serialized block height
2301 CScript expect = CScript() << nHeight;
2302 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2303 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2304 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2306 // Write block to history file
2307 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2308 return error("AcceptBlock() : out of disk space");
2309 unsigned int nFile = -1;
2310 unsigned int nBlockPos = 0;
2311 if (!WriteToDisk(nFile, nBlockPos))
2312 return error("AcceptBlock() : WriteToDisk failed");
2313 if (!AddToBlockIndex(nFile, nBlockPos))
2314 return error("AcceptBlock() : AddToBlockIndex failed");
2316 // Relay inventory, but don't relay old inventory during initial block download
2317 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2318 if (hashBestChain == hash)
2321 BOOST_FOREACH(CNode* pnode, vNodes)
2322 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2323 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2326 // ppcoin: check pending sync-checkpoint
2327 Checkpoints::AcceptPendingSyncCheckpoint();
2332 uint256 CBlockIndex::GetBlockTrust() const
2335 bnTarget.SetCompact(nBits);
2341 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2342 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2346 // Calculate work amount for block
2347 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2349 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2350 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2352 // Return nPoWTrust for the first 12 blocks
2353 if (pprev == NULL || pprev->nHeight < 12)
2356 const CBlockIndex* currentIndex = pprev;
2358 if(IsProofOfStake())
2360 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2362 // Return 1/3 of score if parent block is not the PoW block
2363 if (!pprev->IsProofOfWork())
2364 return (bnNewTrust / 3).getuint256();
2368 // Check last 12 blocks type
2369 while (pprev->nHeight - currentIndex->nHeight < 12)
2371 if (currentIndex->IsProofOfWork())
2373 currentIndex = currentIndex->pprev;
2376 // Return 1/3 of score if less than 3 PoW blocks found
2378 return (bnNewTrust / 3).getuint256();
2380 return bnNewTrust.getuint256();
2384 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2386 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2387 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2388 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2392 // Check last 12 blocks type
2393 while (pprev->nHeight - currentIndex->nHeight < 12)
2395 if (currentIndex->IsProofOfStake())
2397 currentIndex = currentIndex->pprev;
2400 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2402 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2404 bnTarget.SetCompact(pprev->nBits);
2409 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2411 // Return nPoWTrust + full trust score for previous block nBits
2412 return nPoWTrust + bnNewTrust.getuint256();
2416 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2418 unsigned int nFound = 0;
2419 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2421 if (pstart->nVersion >= minVersion)
2423 pstart = pstart->pprev;
2425 return (nFound >= nRequired);
2428 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2430 // Check for duplicate
2431 uint256 hash = pblock->GetHash();
2432 if (mapBlockIndex.count(hash))
2433 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2434 if (mapOrphanBlocks.count(hash))
2435 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2437 // ppcoin: check proof-of-stake
2438 // Limited duplicity on stake: prevents block flood attack
2439 // Duplicate stake allowed only when there is orphan child block
2440 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2441 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());
2443 // Preliminary checks
2444 if (!pblock->CheckBlock())
2445 return error("ProcessBlock() : CheckBlock FAILED");
2447 // ppcoin: verify hash target and signature of coinstake tx
2448 if (pblock->IsProofOfStake())
2450 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2451 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2453 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2454 return false; // do not error here as we expect this during initial block download
2456 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2457 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2460 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2461 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2463 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2464 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2466 bnNewBlock.SetCompact(pblock->nBits);
2469 if (pblock->IsProofOfStake())
2470 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2472 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2474 if (bnNewBlock > bnRequired)
2477 pfrom->Misbehaving(100);
2478 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2482 // ppcoin: ask for pending sync-checkpoint if any
2483 if (!IsInitialBlockDownload())
2484 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2486 // If don't already have its previous block, shunt it off to holding area until we get it
2487 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2489 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2490 CBlock* pblock2 = new CBlock(*pblock);
2491 // ppcoin: check proof-of-stake
2492 if (pblock2->IsProofOfStake())
2494 // Limited duplicity on stake: prevents block flood attack
2495 // Duplicate stake allowed only when there is orphan child block
2496 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2497 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());
2499 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2501 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2502 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2504 // Ask this guy to fill in what we're missing
2507 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2508 // ppcoin: getblocks may not obtain the ancestor block rejected
2509 // earlier by duplicate-stake check so we ask for it again directly
2510 if (!IsInitialBlockDownload())
2511 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2517 if (!pblock->AcceptBlock())
2518 return error("ProcessBlock() : AcceptBlock FAILED");
2520 // Recursively process any orphan blocks that depended on this one
2521 vector<uint256> vWorkQueue;
2522 vWorkQueue.push_back(hash);
2523 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2525 uint256 hashPrev = vWorkQueue[i];
2526 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2527 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2530 CBlock* pblockOrphan = (*mi).second;
2531 if (pblockOrphan->AcceptBlock())
2532 vWorkQueue.push_back(pblockOrphan->GetHash());
2533 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2534 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2535 delete pblockOrphan;
2537 mapOrphanBlocksByPrev.erase(hashPrev);
2540 printf("ProcessBlock: ACCEPTED\n");
2542 // ppcoin: if responsible for sync-checkpoint send it
2543 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2544 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2549 // novacoin: attempt to generate suitable proof-of-stake
2550 bool CBlock::SignBlock(CWallet& wallet)
2552 // if we are trying to sign
2553 // something except proof-of-stake block template
2554 if (!vtx[0].vout[0].IsEmpty())
2557 // if we are trying to sign
2558 // a complete proof-of-stake block
2559 if (IsProofOfStake())
2562 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2565 CTransaction txCoinStake;
2566 int64 nSearchTime = txCoinStake.nTime; // search to current time
2568 if (nSearchTime > nLastCoinStakeSearchTime)
2570 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2572 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2574 // make sure coinstake would meet timestamp protocol
2575 // as it would be the same as the block timestamp
2576 vtx[0].nTime = nTime = txCoinStake.nTime;
2577 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2578 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2580 // we have to make sure that we have no future timestamps in
2581 // our transactions set
2582 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2583 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2585 vtx.insert(vtx.begin() + 1, txCoinStake);
2586 hashMerkleRoot = BuildMerkleTree();
2588 // append a signature to our block
2589 return key.Sign(GetHash(), vchBlockSig);
2592 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2593 nLastCoinStakeSearchTime = nSearchTime;
2599 // ppcoin: check block signature
2600 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2602 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2603 return vchBlockSig.empty();
2605 vector<valtype> vSolutions;
2606 txnouttype whichType;
2610 const CTxOut& txout = vtx[1].vout[1];
2612 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2614 if (whichType == TX_PUBKEY)
2616 valtype& vchPubKey = vSolutions[0];
2618 if (!key.SetPubKey(vchPubKey))
2620 if (vchBlockSig.empty())
2622 return key.Verify(GetHash(), vchBlockSig);
2627 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2629 const CTxOut& txout = vtx[0].vout[i];
2631 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2634 if (whichType == TX_PUBKEY)
2637 valtype& vchPubKey = vSolutions[0];
2639 if (!key.SetPubKey(vchPubKey))
2641 if (vchBlockSig.empty())
2643 if(!key.Verify(GetHash(), vchBlockSig))
2653 bool CheckDiskSpace(uint64 nAdditionalBytes)
2655 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2657 // Check for nMinDiskSpace bytes (currently 50MB)
2658 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2661 string strMessage = _("Warning: Disk space is low!");
2662 strMiscWarning = strMessage;
2663 printf("*** %s\n", strMessage.c_str());
2664 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2671 static filesystem::path BlockFilePath(unsigned int nFile)
2673 string strBlockFn = strprintf("blk%04u.dat", nFile);
2674 return GetDataDir() / strBlockFn;
2677 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2679 if ((nFile < 1) || (nFile == (unsigned int) -1))
2681 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2684 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2686 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2695 static unsigned int nCurrentBlockFile = 1;
2697 FILE* AppendBlockFile(unsigned int& nFileRet)
2702 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2705 if (fseek(file, 0, SEEK_END) != 0)
2707 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2708 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2710 nFileRet = nCurrentBlockFile;
2714 nCurrentBlockFile++;
2718 bool LoadBlockIndex(bool fAllowNew)
2720 CBigNum bnTrustedModulus;
2724 pchMessageStart[0] = 0xcd;
2725 pchMessageStart[1] = 0xf2;
2726 pchMessageStart[2] = 0xc0;
2727 pchMessageStart[3] = 0xef;
2729 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2730 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2731 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2732 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2733 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2734 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2738 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2741 // Set up the Zerocoin Params object
2742 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2748 if (!txdb.LoadBlockIndex())
2752 // Init with genesis block
2754 if (mapBlockIndex.empty())
2763 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2764 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2765 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2767 // vMerkleTree: 4cb33b3b6a
2771 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2772 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2773 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2775 // vMerkleTree: 4cb33b3b6a
2777 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2779 txNew.nTime = 1360105017;
2780 txNew.vin.resize(1);
2781 txNew.vout.resize(1);
2782 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2783 txNew.vout[0].SetEmpty();
2785 block.vtx.push_back(txNew);
2786 block.hashPrevBlock = 0;
2787 block.hashMerkleRoot = block.BuildMerkleTree();
2789 block.nTime = 1360105017;
2790 block.nBits = bnProofOfWorkLimit.GetCompact();
2791 block.nNonce = !fTestNet ? 1575379 : 46534;
2794 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2796 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2797 assert(block.CheckBlock());
2799 // Start new block file
2801 unsigned int nBlockPos;
2802 if (!block.WriteToDisk(nFile, nBlockPos))
2803 return error("LoadBlockIndex() : writing genesis block to disk failed");
2804 if (!block.AddToBlockIndex(nFile, nBlockPos))
2805 return error("LoadBlockIndex() : genesis block not accepted");
2807 // ppcoin: initialize synchronized checkpoint
2808 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2809 return error("LoadBlockIndex() : failed to init sync checkpoint");
2812 string strPubKey = "";
2814 // if checkpoint master key changed must reset sync-checkpoint
2815 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2817 // write checkpoint master key to db
2819 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2820 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2821 if (!txdb.TxnCommit())
2822 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2823 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2824 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2832 void PrintBlockTree()
2834 // pre-compute tree structure
2835 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2836 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2838 CBlockIndex* pindex = (*mi).second;
2839 mapNext[pindex->pprev].push_back(pindex);
2841 //while (rand() % 3 == 0)
2842 // mapNext[pindex->pprev].push_back(pindex);
2845 vector<pair<int, CBlockIndex*> > vStack;
2846 vStack.push_back(make_pair(0, pindexGenesisBlock));
2849 while (!vStack.empty())
2851 int nCol = vStack.back().first;
2852 CBlockIndex* pindex = vStack.back().second;
2855 // print split or gap
2856 if (nCol > nPrevCol)
2858 for (int i = 0; i < nCol-1; i++)
2862 else if (nCol < nPrevCol)
2864 for (int i = 0; i < nCol; i++)
2871 for (int i = 0; i < nCol; i++)
2876 block.ReadFromDisk(pindex);
2877 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2881 block.GetHash().ToString().c_str(),
2883 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2884 FormatMoney(pindex->nMint).c_str(),
2887 PrintWallets(block);
2889 // put the main time-chain first
2890 vector<CBlockIndex*>& vNext = mapNext[pindex];
2891 for (unsigned int i = 0; i < vNext.size(); i++)
2893 if (vNext[i]->pnext)
2895 swap(vNext[0], vNext[i]);
2901 for (unsigned int i = 0; i < vNext.size(); i++)
2902 vStack.push_back(make_pair(nCol+i, vNext[i]));
2906 bool LoadExternalBlockFile(FILE* fileIn)
2908 int64 nStart = GetTimeMillis();
2914 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2915 unsigned int nPos = 0;
2916 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2918 unsigned char pchData[65536];
2920 fseek(blkdat, nPos, SEEK_SET);
2921 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2924 nPos = (unsigned int)-1;
2927 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2930 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2932 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2935 nPos += ((unsigned char*)nFind - pchData) + 1;
2938 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2939 } while(!fRequestShutdown);
2940 if (nPos == (unsigned int)-1)
2942 fseek(blkdat, nPos, SEEK_SET);
2945 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2949 if (ProcessBlock(NULL,&block))
2957 catch (std::exception &e) {
2958 printf("%s() : Deserialize or I/O error caught during load\n",
2959 __PRETTY_FUNCTION__);
2962 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2966 //////////////////////////////////////////////////////////////////////////////
2971 extern map<uint256, CAlert> mapAlerts;
2972 extern CCriticalSection cs_mapAlerts;
2974 extern string strMintMessage;
2975 extern string strMintWarning;
2977 string GetWarnings(string strFor)
2980 string strStatusBar;
2983 if (GetBoolArg("-testsafemode"))
2986 // wallet lock warning for minting
2987 if (strMintWarning != "")
2990 strStatusBar = strMintWarning;
2993 // Misc warnings like out of disk space and clock is wrong
2994 if (strMiscWarning != "")
2997 strStatusBar = strMiscWarning;
3000 // if detected invalid checkpoint enter safe mode
3001 if (Checkpoints::hashInvalidCheckpoint != 0)
3004 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3010 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3012 const CAlert& alert = item.second;
3013 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3015 nPriority = alert.nPriority;
3016 strStatusBar = alert.strStatusBar;
3017 if (nPriority > 1000)
3018 strRPC = strStatusBar;
3023 if (strFor == "statusbar")
3024 return strStatusBar;
3025 else if (strFor == "rpc")
3027 assert(!"GetWarnings() : invalid parameter");
3038 //////////////////////////////////////////////////////////////////////////////
3044 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3050 bool txInMap = false;
3053 txInMap = (mempool.exists(inv.hash));
3056 mapOrphanTransactions.count(inv.hash) ||
3057 txdb.ContainsTx(inv.hash);
3061 return mapBlockIndex.count(inv.hash) ||
3062 mapOrphanBlocks.count(inv.hash);
3064 // Don't know what it is, just say we already got one
3071 // The message start string is designed to be unlikely to occur in normal data.
3072 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3073 // a large 4-byte int at any alignment.
3074 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3076 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3078 static map<CService, CPubKey> mapReuseKey;
3079 RandAddSeedPerfmon();
3081 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3082 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3084 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3088 if (strCommand == "version")
3090 // Each connection can only send one version message
3091 if (pfrom->nVersion != 0)
3093 pfrom->Misbehaving(1);
3101 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3102 if (pfrom->nVersion < MIN_PROTO_VERSION)
3104 // Since February 20, 2012, the protocol is initiated at version 209,
3105 // and earlier versions are no longer supported
3106 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3107 pfrom->fDisconnect = true;
3111 if (pfrom->nVersion == 10300)
3112 pfrom->nVersion = 300;
3114 vRecv >> addrFrom >> nNonce;
3116 vRecv >> pfrom->strSubVer;
3118 vRecv >> pfrom->nStartingHeight;
3120 if (pfrom->fInbound && addrMe.IsRoutable())
3122 pfrom->addrLocal = addrMe;
3126 // Disconnect if we connected to ourself
3127 if (nNonce == nLocalHostNonce && nNonce > 1)
3129 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3130 pfrom->fDisconnect = true;
3134 if (pfrom->nVersion < 60010)
3136 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3137 pfrom->fDisconnect = true;
3141 // record my external IP reported by peer
3142 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3143 addrSeenByPeer = addrMe;
3145 // Be shy and don't send version until we hear
3146 if (pfrom->fInbound)
3147 pfrom->PushVersion();
3149 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3151 AddTimeData(pfrom->addr, nTime);
3154 pfrom->PushMessage("verack");
3155 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3157 if (!pfrom->fInbound)
3159 // Advertise our address
3160 if (!fNoListen && !IsInitialBlockDownload())
3162 CAddress addr = GetLocalAddress(&pfrom->addr);
3163 if (addr.IsRoutable())
3164 pfrom->PushAddress(addr);
3167 // Get recent addresses
3168 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3170 pfrom->PushMessage("getaddr");
3171 pfrom->fGetAddr = true;
3173 addrman.Good(pfrom->addr);
3175 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3177 addrman.Add(addrFrom, addrFrom);
3178 addrman.Good(addrFrom);
3182 // Ask the first connected node for block updates
3183 static int nAskedForBlocks = 0;
3184 if (!pfrom->fClient && !pfrom->fOneShot &&
3185 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3186 (pfrom->nVersion < NOBLKS_VERSION_START ||
3187 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3188 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3191 pfrom->PushGetBlocks(pindexBest, uint256(0));
3197 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3198 item.second.RelayTo(pfrom);
3201 // Relay sync-checkpoint
3203 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3204 if (!Checkpoints::checkpointMessage.IsNull())
3205 Checkpoints::checkpointMessage.RelayTo(pfrom);
3208 pfrom->fSuccessfullyConnected = true;
3210 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());
3212 cPeerBlockCounts.input(pfrom->nStartingHeight);
3214 // ppcoin: ask for pending sync-checkpoint if any
3215 if (!IsInitialBlockDownload())
3216 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3220 else if (pfrom->nVersion == 0)
3222 // Must have a version message before anything else
3223 pfrom->Misbehaving(1);
3228 else if (strCommand == "verack")
3230 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3234 else if (strCommand == "addr")
3236 vector<CAddress> vAddr;
3239 // Don't want addr from older versions unless seeding
3240 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3242 if (vAddr.size() > 1000)
3244 pfrom->Misbehaving(20);
3245 return error("message addr size() = %"PRIszu"", vAddr.size());
3248 // Store the new addresses
3249 vector<CAddress> vAddrOk;
3250 int64 nNow = GetAdjustedTime();
3251 int64 nSince = nNow - 10 * 60;
3252 BOOST_FOREACH(CAddress& addr, vAddr)
3256 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3257 addr.nTime = nNow - 5 * 24 * 60 * 60;
3258 pfrom->AddAddressKnown(addr);
3259 bool fReachable = IsReachable(addr);
3260 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3262 // Relay to a limited number of other nodes
3265 // Use deterministic randomness to send to the same nodes for 24 hours
3266 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3267 static uint256 hashSalt;
3269 hashSalt = GetRandHash();
3270 uint64 hashAddr = addr.GetHash();
3271 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3272 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3273 multimap<uint256, CNode*> mapMix;
3274 BOOST_FOREACH(CNode* pnode, vNodes)
3276 if (pnode->nVersion < CADDR_TIME_VERSION)
3278 unsigned int nPointer;
3279 memcpy(&nPointer, &pnode, sizeof(nPointer));
3280 uint256 hashKey = hashRand ^ nPointer;
3281 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3282 mapMix.insert(make_pair(hashKey, pnode));
3284 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3285 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3286 ((*mi).second)->PushAddress(addr);
3289 // Do not store addresses outside our network
3291 vAddrOk.push_back(addr);
3293 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3294 if (vAddr.size() < 1000)
3295 pfrom->fGetAddr = false;
3296 if (pfrom->fOneShot)
3297 pfrom->fDisconnect = true;
3300 else if (strCommand == "inv")
3304 if (vInv.size() > MAX_INV_SZ)
3306 pfrom->Misbehaving(20);
3307 return error("message inv size() = %"PRIszu"", vInv.size());
3310 // find last block in inv vector
3311 unsigned int nLastBlock = (unsigned int)(-1);
3312 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3313 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3314 nLastBlock = vInv.size() - 1 - nInv;
3319 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3321 const CInv &inv = vInv[nInv];
3325 pfrom->AddInventoryKnown(inv);
3327 bool fAlreadyHave = AlreadyHave(txdb, inv);
3329 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3333 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3334 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3335 } else if (nInv == nLastBlock) {
3336 // In case we are on a very long side-chain, it is possible that we already have
3337 // the last block in an inv bundle sent in response to getblocks. Try to detect
3338 // this situation and push another getblocks to continue.
3339 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3341 printf("force request: %s\n", inv.ToString().c_str());
3344 // Track requests for our stuff
3345 Inventory(inv.hash);
3350 else if (strCommand == "getdata")
3354 if (vInv.size() > MAX_INV_SZ)
3356 pfrom->Misbehaving(20);
3357 return error("message getdata size() = %"PRIszu"", vInv.size());
3360 if (fDebugNet || (vInv.size() != 1))
3361 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3363 BOOST_FOREACH(const CInv& inv, vInv)
3367 if (fDebugNet || (vInv.size() == 1))
3368 printf("received getdata for: %s\n", inv.ToString().c_str());
3370 if (inv.type == MSG_BLOCK)
3372 // Send block from disk
3373 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3374 if (mi != mapBlockIndex.end())
3377 block.ReadFromDisk((*mi).second);
3378 pfrom->PushMessage("block", block);
3380 // Trigger them to send a getblocks request for the next batch of inventory
3381 if (inv.hash == pfrom->hashContinue)
3383 // ppcoin: send latest proof-of-work block to allow the
3384 // download node to accept as orphan (proof-of-stake
3385 // block might be rejected by stake connection check)
3387 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3388 pfrom->PushMessage("inv", vInv);
3389 pfrom->hashContinue = 0;
3393 else if (inv.IsKnownType())
3395 // Send stream from relay memory
3396 bool pushed = false;
3399 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3400 if (mi != mapRelay.end()) {
3401 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3405 if (!pushed && inv.type == MSG_TX) {
3407 if (mempool.exists(inv.hash)) {
3408 CTransaction tx = mempool.lookup(inv.hash);
3409 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3412 pfrom->PushMessage("tx", ss);
3417 // Track requests for our stuff
3418 Inventory(inv.hash);
3423 else if (strCommand == "getblocks")
3425 CBlockLocator locator;
3427 vRecv >> locator >> hashStop;
3429 // Find the last block the caller has in the main chain
3430 CBlockIndex* pindex = locator.GetBlockIndex();
3432 // Send the rest of the chain
3434 pindex = pindex->pnext;
3436 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3437 for (; pindex; pindex = pindex->pnext)
3439 if (pindex->GetBlockHash() == hashStop)
3441 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3442 // ppcoin: tell downloading node about the latest block if it's
3443 // without risk being rejected due to stake connection check
3444 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3445 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3448 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3451 // When this block is requested, we'll send an inv that'll make them
3452 // getblocks the next batch of inventory.
3453 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3454 pfrom->hashContinue = pindex->GetBlockHash();
3459 else if (strCommand == "checkpoint")
3461 CSyncCheckpoint checkpoint;
3462 vRecv >> checkpoint;
3464 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3467 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3469 BOOST_FOREACH(CNode* pnode, vNodes)
3470 checkpoint.RelayTo(pnode);
3474 else if (strCommand == "getheaders")
3476 CBlockLocator locator;
3478 vRecv >> locator >> hashStop;
3480 CBlockIndex* pindex = NULL;
3481 if (locator.IsNull())
3483 // If locator is null, return the hashStop block
3484 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3485 if (mi == mapBlockIndex.end())
3487 pindex = (*mi).second;
3491 // Find the last block the caller has in the main chain
3492 pindex = locator.GetBlockIndex();
3494 pindex = pindex->pnext;
3497 vector<CBlock> vHeaders;
3499 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3500 for (; pindex; pindex = pindex->pnext)
3502 vHeaders.push_back(pindex->GetBlockHeader());
3503 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3506 pfrom->PushMessage("headers", vHeaders);
3510 else if (strCommand == "tx")
3512 vector<uint256> vWorkQueue;
3513 vector<uint256> vEraseQueue;
3514 CDataStream vMsg(vRecv);
3519 CInv inv(MSG_TX, tx.GetHash());
3520 pfrom->AddInventoryKnown(inv);
3522 bool fMissingInputs = false;
3523 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3525 SyncWithWallets(tx, NULL, true);
3526 RelayTransaction(tx, inv.hash);
3527 mapAlreadyAskedFor.erase(inv);
3528 vWorkQueue.push_back(inv.hash);
3529 vEraseQueue.push_back(inv.hash);
3531 // Recursively process any orphan transactions that depended on this one
3532 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3534 uint256 hashPrev = vWorkQueue[i];
3535 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3536 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3539 const uint256& orphanTxHash = *mi;
3540 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3541 bool fMissingInputs2 = false;
3543 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3545 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3546 SyncWithWallets(tx, NULL, true);
3547 RelayTransaction(orphanTx, orphanTxHash);
3548 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3549 vWorkQueue.push_back(orphanTxHash);
3550 vEraseQueue.push_back(orphanTxHash);
3552 else if (!fMissingInputs2)
3555 vEraseQueue.push_back(orphanTxHash);
3556 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3561 BOOST_FOREACH(uint256 hash, vEraseQueue)
3562 EraseOrphanTx(hash);
3564 else if (fMissingInputs)
3568 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3569 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3571 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3573 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3577 else if (strCommand == "block")
3581 uint256 hashBlock = block.GetHash();
3583 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3586 CInv inv(MSG_BLOCK, hashBlock);
3587 pfrom->AddInventoryKnown(inv);
3589 if (ProcessBlock(pfrom, &block))
3590 mapAlreadyAskedFor.erase(inv);
3591 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3595 else if (strCommand == "getaddr")
3597 // Don't return addresses older than nCutOff timestamp
3598 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3599 pfrom->vAddrToSend.clear();
3600 vector<CAddress> vAddr = addrman.GetAddr();
3601 BOOST_FOREACH(const CAddress &addr, vAddr)
3602 if(addr.nTime > nCutOff)
3603 pfrom->PushAddress(addr);
3607 else if (strCommand == "mempool")
3609 std::vector<uint256> vtxid;
3610 mempool.queryHashes(vtxid);
3612 for (unsigned int i = 0; i < vtxid.size(); i++) {
3613 CInv inv(MSG_TX, vtxid[i]);
3614 vInv.push_back(inv);
3615 if (i == (MAX_INV_SZ - 1))
3618 if (vInv.size() > 0)
3619 pfrom->PushMessage("inv", vInv);
3623 else if (strCommand == "checkorder")
3628 if (!GetBoolArg("-allowreceivebyip"))
3630 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3637 /// we have a chance to check the order here
3639 // Keep giving the same key to the same ip until they use it
3640 if (!mapReuseKey.count(pfrom->addr))
3641 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3643 // Send back approval of order and pubkey to use
3644 CScript scriptPubKey;
3645 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3646 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3650 else if (strCommand == "reply")
3655 CRequestTracker tracker;
3657 LOCK(pfrom->cs_mapRequests);
3658 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3659 if (mi != pfrom->mapRequests.end())
3661 tracker = (*mi).second;
3662 pfrom->mapRequests.erase(mi);
3665 if (!tracker.IsNull())
3666 tracker.fn(tracker.param1, vRecv);
3670 else if (strCommand == "ping")
3672 if (pfrom->nVersion > BIP0031_VERSION)
3676 // Echo the message back with the nonce. This allows for two useful features:
3678 // 1) A remote node can quickly check if the connection is operational
3679 // 2) Remote nodes can measure the latency of the network thread. If this node
3680 // is overloaded it won't respond to pings quickly and the remote node can
3681 // avoid sending us more work, like chain download requests.
3683 // The nonce stops the remote getting confused between different pings: without
3684 // it, if the remote node sends a ping once per second and this node takes 5
3685 // seconds to respond to each, the 5th ping the remote sends would appear to
3686 // return very quickly.
3687 pfrom->PushMessage("pong", nonce);
3692 else if (strCommand == "alert")
3697 uint256 alertHash = alert.GetHash();
3698 if (pfrom->setKnown.count(alertHash) == 0)
3700 if (alert.ProcessAlert())
3703 pfrom->setKnown.insert(alertHash);
3706 BOOST_FOREACH(CNode* pnode, vNodes)
3707 alert.RelayTo(pnode);
3711 // Small DoS penalty so peers that send us lots of
3712 // duplicate/expired/invalid-signature/whatever alerts
3713 // eventually get banned.
3714 // This isn't a Misbehaving(100) (immediate ban) because the
3715 // peer might be an older or different implementation with
3716 // a different signature key, etc.
3717 pfrom->Misbehaving(10);
3725 // Ignore unknown commands for extensibility
3729 // Update the last seen time for this node's address
3730 if (pfrom->fNetworkNode)
3731 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3732 AddressCurrentlyConnected(pfrom->addr);
3738 bool ProcessMessages(CNode* pfrom)
3740 CDataStream& vRecv = pfrom->vRecv;
3744 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3748 // (4) message start
3757 // Don't bother if send buffer is too full to respond anyway
3758 if (pfrom->vSend.size() >= SendBufferSize())
3761 // Scan for message start
3762 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3763 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3764 if (vRecv.end() - pstart < nHeaderSize)
3766 if ((int)vRecv.size() > nHeaderSize)
3768 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3769 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3773 if (pstart - vRecv.begin() > 0)
3774 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3775 vRecv.erase(vRecv.begin(), pstart);
3778 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3783 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3786 string strCommand = hdr.GetCommand();
3789 unsigned int nMessageSize = hdr.nMessageSize;
3790 if (nMessageSize > MAX_SIZE)
3792 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3795 if (nMessageSize > vRecv.size())
3797 // Rewind and wait for rest of message
3798 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3803 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3804 unsigned int nChecksum = 0;
3805 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3806 if (nChecksum != hdr.nChecksum)
3808 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3809 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3813 // Copy message to its own buffer
3814 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3815 vRecv.ignore(nMessageSize);
3823 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3828 catch (std::ios_base::failure& e)
3830 if (strstr(e.what(), "end of data"))
3832 // Allow exceptions from under-length message on vRecv
3833 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
3835 else if (strstr(e.what(), "size too large"))
3837 // Allow exceptions from over-long size
3838 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3842 PrintExceptionContinue(&e, "ProcessMessages()");
3845 catch (std::exception& e) {
3846 PrintExceptionContinue(&e, "ProcessMessages()");
3848 PrintExceptionContinue(NULL, "ProcessMessages()");
3852 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3860 bool SendMessages(CNode* pto, bool fSendTrickle)
3862 TRY_LOCK(cs_main, lockMain);
3864 // Don't send anything until we get their version message
3865 if (pto->nVersion == 0)
3868 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3870 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3872 if (pto->nVersion > BIP0031_VERSION)
3873 pto->PushMessage("ping", nonce);
3875 pto->PushMessage("ping");
3878 // Resend wallet transactions that haven't gotten in a block yet
3879 ResendWalletTransactions();
3881 // Address refresh broadcast
3882 static int64 nLastRebroadcast;
3883 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3887 BOOST_FOREACH(CNode* pnode, vNodes)
3889 // Periodically clear setAddrKnown to allow refresh broadcasts
3890 if (nLastRebroadcast)
3891 pnode->setAddrKnown.clear();
3893 // Rebroadcast our address
3896 CAddress addr = GetLocalAddress(&pnode->addr);
3897 if (addr.IsRoutable())
3898 pnode->PushAddress(addr);
3902 nLastRebroadcast = GetTime();
3910 vector<CAddress> vAddr;
3911 vAddr.reserve(pto->vAddrToSend.size());
3912 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3914 // returns true if wasn't already contained in the set
3915 if (pto->setAddrKnown.insert(addr).second)
3917 vAddr.push_back(addr);
3918 // receiver rejects addr messages larger than 1000
3919 if (vAddr.size() >= 1000)
3921 pto->PushMessage("addr", vAddr);
3926 pto->vAddrToSend.clear();
3928 pto->PushMessage("addr", vAddr);
3933 // Message: inventory
3936 vector<CInv> vInvWait;
3938 LOCK(pto->cs_inventory);
3939 vInv.reserve(pto->vInventoryToSend.size());
3940 vInvWait.reserve(pto->vInventoryToSend.size());
3941 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3943 if (pto->setInventoryKnown.count(inv))
3946 // trickle out tx inv to protect privacy
3947 if (inv.type == MSG_TX && !fSendTrickle)
3949 // 1/4 of tx invs blast to all immediately
3950 static uint256 hashSalt;
3952 hashSalt = GetRandHash();
3953 uint256 hashRand = inv.hash ^ hashSalt;
3954 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3955 bool fTrickleWait = ((hashRand & 3) != 0);
3957 // always trickle our own transactions
3961 if (GetTransaction(inv.hash, wtx))
3963 fTrickleWait = true;
3968 vInvWait.push_back(inv);
3973 // returns true if wasn't already contained in the set
3974 if (pto->setInventoryKnown.insert(inv).second)
3976 vInv.push_back(inv);
3977 if (vInv.size() >= 1000)
3979 pto->PushMessage("inv", vInv);
3984 pto->vInventoryToSend = vInvWait;
3987 pto->PushMessage("inv", vInv);
3993 vector<CInv> vGetData;
3994 int64 nNow = GetTime() * 1000000;
3996 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3998 const CInv& inv = (*pto->mapAskFor.begin()).second;
3999 if (!AlreadyHave(txdb, inv))
4002 printf("sending getdata: %s\n", inv.ToString().c_str());
4003 vGetData.push_back(inv);
4004 if (vGetData.size() >= 1000)
4006 pto->PushMessage("getdata", vGetData);
4009 mapAlreadyAskedFor[inv] = nNow;
4011 pto->mapAskFor.erase(pto->mapAskFor.begin());
4013 if (!vGetData.empty())
4014 pto->PushMessage("getdata", vGetData);