2 * Novacoin classes library
3 * Copyright (C) 2015 Alex D. (balthazar.ad@gmail.com)
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU Affero General Public License as
7 * published by the Free Software Foundation, either version 3 of the
8 * License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU Affero General Public License for more details.
15 * You should have received a copy of the GNU Affero General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
22 using System.Collections.Concurrent;
25 using SQLite.Net.Interop;
26 using SQLite.Net.Platform.Generic;
27 using System.Collections.Generic;
29 using System.Diagnostics.Contracts;
34 public class CBlockStore : IDisposable
36 public const uint nMagicNumber = 0xe5e9e8e4;
38 private bool disposed = false;
39 private object LockObj = new object();
42 /// SQLite connection object.
44 private SQLiteConnection dbConn;
47 /// Current SQLite platform
49 private ISQLitePlatform dbPlatform;
54 private string strBlockFile;
57 /// Index database file.
59 private string strDbFile;
62 /// Map of block tree nodes.
64 /// blockHash => CBlockStoreItem
66 private ConcurrentDictionary<uint256, CBlockStoreItem> blockMap = new ConcurrentDictionary<uint256, CBlockStoreItem>();
69 /// Orphaned blocks map.
71 private ConcurrentDictionary<uint256, CBlock> orphanMap = new ConcurrentDictionary<uint256, CBlock>();
72 private ConcurrentDictionary<uint256, CBlock> orphanMapByPrev = new ConcurrentDictionary<uint256, CBlock>();
75 /// Unconfirmed transactions.
77 /// TxID => Transaction
79 private ConcurrentDictionary<uint256, CTransaction> mapUnconfirmedTx = new ConcurrentDictionary<uint256, CTransaction>();
82 /// Map of the proof-of-stake hashes. This is necessary for stake duplication checks.
84 private ConcurrentDictionary<uint256, uint256> mapProofOfStake = new ConcurrentDictionary<uint256, uint256>();
87 private ConcurrentDictionary<COutPoint, uint> mapStakeSeen = new ConcurrentDictionary<COutPoint, uint>();
88 private ConcurrentDictionary<COutPoint, uint> mapStakeSeenOrphan = new ConcurrentDictionary<COutPoint, uint>();
92 /// Copy of chain state object.
94 private ChainState ChainParams;
97 /// Cursor which is pointing us to the end of best chain.
99 private CBlockStoreItem bestBlockCursor = null;
102 /// Cursor which is always pointing us to genesis block.
104 private CBlockStoreItem genesisBlockCursor = null;
107 /// Current and the only instance of block storage manager. Should be a property with private setter though it's enough for the beginning.
109 public static CBlockStore Instance = null;
112 /// Block file stream with read/write access
114 private Stream fStreamReadWrite;
115 private uint nTimeBestReceived;
116 private int nTransactionsUpdated;
119 /// Init the block storage manager.
121 /// <param name="IndexDB">Path to index database</param>
122 /// <param name="BlockFile">Path to block file</param>
123 public CBlockStore(string IndexDB = "blockstore.dat", string BlockFile = "blk0001.dat")
126 strBlockFile = BlockFile;
128 bool firstInit = !File.Exists(strDbFile);
129 dbPlatform = new SQLitePlatformGeneric();
130 dbConn = new SQLiteConnection(dbPlatform, strDbFile);
132 fStreamReadWrite = File.Open(strBlockFile, FileMode.OpenOrCreate, FileAccess.ReadWrite);
141 dbConn.CreateTable<CBlockStoreItem>(CreateFlags.AutoIncPK);
142 dbConn.CreateTable<CMerkleNode>(CreateFlags.AutoIncPK);
143 dbConn.CreateTable<TxOutItem>(CreateFlags.ImplicitPK);
144 dbConn.CreateTable<ChainState>(CreateFlags.AutoIncPK);
146 ChainParams = new ChainState()
153 dbConn.Insert(ChainParams);
155 var genesisBlock = new CBlock(
157 "01000000" + // nVersion=1
158 "0000000000000000000000000000000000000000000000000000000000000000" + // prevhash is zero
159 "7b0502ad2f9f675528183f83d6385794fbcaa914e6d385c6cb1d866a3b3bb34c" + // merkle root
160 "398e1151" + // nTime=1360105017
161 "ffff0f1e" + // nBits=0x1e0fffff
162 "d3091800" + // nNonce=1575379
164 "01000000" + // nVersion=1
165 "398e1151" + // nTime=1360105017
167 "0000000000000000000000000000000000000000000000000000000000000000" + // input txid is zero
168 "ffffffff" + // n=uint.maxValue
169 "4d" + // scriptSigLen=77
170 "04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936" + // scriptSig
171 "ffffffff" + // nSequence=uint.maxValue
173 "0000000000000000" + // nValue=0
174 "00" + // scriptPubkeyLen=0
175 "00000000" + // nLockTime=0
179 // Write block to file.
180 var itemTemplate = new CBlockStoreItem()
185 itemTemplate.FillHeader(genesisBlock.header);
187 if (!AddItemToIndex(ref itemTemplate, ref genesisBlock))
189 throw new Exception("Unable to write genesis block");
195 var blockTreeItems = dbConn.Query<CBlockStoreItem>("select * from [BlockStorage] order by [ItemId] asc");
197 // Init list of block items
198 foreach (var item in blockTreeItems)
200 blockMap.TryAdd(item.Hash, item);
202 if (item.IsProofOfStake)
204 // build mapStakeSeen
205 mapStakeSeen.TryAdd(item.prevoutStake, item.nStakeTime);
209 // Load data about the top node.
210 ChainParams = dbConn.Table<ChainState>().First();
212 genesisBlockCursor = dbConn.Query<CBlockStoreItem>("select * from [BlockStorage] where [Hash] = ?", (byte[])NetInfo.nHashGenesisBlock).First();
213 bestBlockCursor = dbConn.Query<CBlockStoreItem>("select * from [BlockStorage] where [Hash] = ?", ChainParams.HashBestChain).First();
217 public bool GetTxOutCursor(COutPoint outpoint, ref TxOutItem txOutCursor)
219 var queryResults = dbConn.Query<TxOutItem>("select o.* from [Outputs] o left join [MerkleNodes] m on (m.nMerkleNodeID = o.nMerkleNodeID) where m.[TransactionHash] = ?", (byte[])outpoint.hash);
221 if (queryResults.Count == 1)
223 txOutCursor = queryResults[0];
233 public bool FetchInputs(CTransaction tx, ref Dictionary<COutPoint, TxOutItem> queued, ref Dictionary<COutPoint, TxOutItem> inputs, bool IsBlock, out bool Invalid)
239 // Coinbase transactions have no inputs to fetch.
243 StringBuilder queryBuilder = new StringBuilder();
245 queryBuilder.Append("select o.*, m.[TransactionHash] from [Outputs] o left join [MerkleNodes] m on (m.[nMerkleNodeID] = o.[nMerkleNodeID]) where ");
247 for (var i = 0; i < tx.vin.Length; i++)
249 queryBuilder.AppendFormat(" {0} (m.[TransactionHash] = x'{1}' and o.[OutputNumber] = x'{2}')",
250 (i > 0 ? "or" : string.Empty), Interop.ToHex(tx.vin[i].prevout.hash),
251 Interop.ToHex(VarInt.EncodeVarInt(tx.vin[i].prevout.n)
255 var queryResults = dbConn.Query<InputsJoin>(queryBuilder.ToString());
257 foreach (var item in queryResults)
261 return false; // Already spent
264 var inputsKey = new COutPoint(item.TransactionHash, item.nOut);
266 // Add output data to dictionary
267 inputs.Add(inputsKey, item.getTxOutItem());
270 if (queryResults.Count < tx.vin.Length)
274 // It seems that some transactions are being spent in the same block.
276 foreach (var txin in tx.vin)
278 var outPoint = txin.prevout;
280 if (inputs.ContainsKey(outPoint))
282 continue; // We have already seen this input.
285 if (!queued.ContainsKey(outPoint))
287 return false; // No such transaction
290 // Add output data to dictionary
291 inputs.Add(outPoint, queued[outPoint]);
293 // Mark output as spent
294 // queued[outPoint].IsSpent = true;
299 // Unconfirmed transaction
301 foreach (var txin in tx.vin)
303 var outPoint = txin.prevout;
306 if (!mapUnconfirmedTx.TryGetValue(outPoint.hash, out txPrev))
308 return false; // No such transaction
311 if (outPoint.n > txPrev.vout.Length)
315 return false; // nOut is out of range
318 // TODO: return inputs from map
319 throw new NotImplementedException();
330 private bool AddItemToIndex(ref CBlockStoreItem itemTemplate, ref CBlock block)
332 uint256 blockHash = itemTemplate.Hash;
334 if (blockMap.ContainsKey(blockHash))
336 // Already have this block.
341 dbConn.BeginTransaction();
343 // Compute chain trust score
344 itemTemplate.nChainTrust = (itemTemplate.prev != null ? itemTemplate.prev.nChainTrust : 0) + itemTemplate.nBlockTrust;
346 if (!itemTemplate.SetStakeEntropyBit(Entropy.GetStakeEntropyBit(itemTemplate.nHeight, blockHash)))
348 return false; // SetStakeEntropyBit() failed
351 // Save proof-of-stake hash value
352 if (itemTemplate.IsProofOfStake)
354 uint256 hashProofOfStake;
355 if (!GetProofOfStakeHash(blockHash, out hashProofOfStake))
357 return false; // hashProofOfStake not found
359 itemTemplate.hashProofOfStake = hashProofOfStake;
362 // compute stake modifier
363 long nStakeModifier = 0;
364 bool fGeneratedStakeModifier = false;
365 if (!StakeModifier.ComputeNextStakeModifier(itemTemplate, ref nStakeModifier, ref fGeneratedStakeModifier))
367 return false; // ComputeNextStakeModifier() failed
370 itemTemplate.SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
371 itemTemplate.nStakeModifierChecksum = StakeModifier.GetStakeModifierChecksum(itemTemplate);
373 // TODO: verify stake modifier checkpoints
376 if (block.IsProofOfStake)
378 itemTemplate.SetProofOfStake();
380 itemTemplate.prevoutStake = block.vtx[1].vin[0].prevout;
381 itemTemplate.nStakeTime = block.vtx[1].nTime;
384 if (!itemTemplate.WriteToFile(ref fStreamReadWrite, ref block))
389 if (dbConn.Insert(itemTemplate) == 0)
391 return false; // Insert failed
395 itemTemplate.ItemID = dbPlatform.SQLiteApi.LastInsertRowid(dbConn.Handle);
397 if (!blockMap.TryAdd(blockHash, itemTemplate))
399 return false; // blockMap add failed
402 if (itemTemplate.nChainTrust > ChainParams.nBestChainTrust)
406 if (!SetBestChain(ref itemTemplate))
408 return false; // SetBestChain failed.
412 // Commit transaction
418 private bool SetBestChain(ref CBlockStoreItem cursor)
420 uint256 hashBlock = cursor.Hash;
422 if (genesisBlockCursor == null && hashBlock == NetInfo.nHashGenesisBlock)
424 genesisBlockCursor = cursor;
426 else if (ChainParams.nHashBestChain == (uint256)cursor.prevHash)
428 if (!SetBestChainInner(cursor))
435 // the first block in the new chain that will cause it to become the new best chain
436 var cursorIntermediate = cursor;
438 // list of blocks that need to be connected afterwards
439 var secondary = new List<CBlockStoreItem>();
441 // Reorganize is costly in terms of db load, as it works in a single db transaction.
442 // Try to limit how much needs to be done inside
443 while (cursorIntermediate.prev != null && cursorIntermediate.prev.nChainTrust > bestBlockCursor.nChainTrust)
445 secondary.Add(cursorIntermediate);
446 cursorIntermediate = cursorIntermediate.prev;
449 // Switch to new best branch
450 if (!Reorganize(cursorIntermediate))
452 InvalidChainFound(cursor);
453 return false; // reorganize failed
456 // Connect further blocks
457 foreach (var currentCursor in secondary)
460 if (!currentCursor.ReadFromFile(ref fStreamReadWrite, out block))
462 // ReadFromDisk failed
466 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
467 if (!SetBestChainInner(currentCursor))
474 bestBlockCursor = cursor;
475 nTimeBestReceived = Interop.GetTime();
476 nTransactionsUpdated++;
478 if (!UpdateTopChain(cursor))
480 return false; // unable to set top chain node.
486 private void InvalidChainFound(CBlockStoreItem cursor)
488 throw new NotImplementedException();
491 private bool Reorganize(CBlockStoreItem cursorIntermediate)
494 var fork = bestBlockCursor;
495 var longer = cursorIntermediate;
497 while (fork.ItemID != longer.ItemID)
499 while (longer.nHeight > fork.nHeight)
501 if ((longer = longer.prev) == null)
503 return false; // longer.prev is null
507 if (fork.ItemID == longer.ItemID)
512 if ((fork = fork.prev) == null)
514 return false; // fork.prev is null
518 // List of what to disconnect
519 var disconnect = new List<CBlockStoreItem>();
520 for (var cursor = bestBlockCursor; cursor.ItemID != fork.ItemID; cursor = cursor.prev)
522 disconnect.Add(cursor);
525 // List of what to connect
526 var connect = new List<CBlockStoreItem>();
527 for (var cursor = cursorIntermediate; cursor.ItemID != fork.ItemID; cursor = cursor.prev)
533 // Disconnect shorter branch
534 var txResurrect = new List<CTransaction>();
535 foreach (var blockCursor in disconnect)
538 if (!blockCursor.ReadFromFile(ref fStreamReadWrite, out block))
540 return false; // ReadFromFile for disconnect failed.
542 if (!DisconnectBlock(blockCursor, ref block))
544 return false; // DisconnectBlock failed.
547 // Queue memory transactions to resurrect
548 foreach (var tx in block.vtx)
550 if (!tx.IsCoinBase && !tx.IsCoinStake)
558 // Connect longer branch
559 var txDelete = new List<CTransaction>();
560 foreach (var cursor in connect)
563 if (!cursor.ReadFromFile(ref fStreamReadWrite, out block))
565 return false; // ReadFromDisk for connect failed
568 if (!ConnectBlock(cursor, ref block))
571 return false; // ConnectBlock failed
574 // Queue memory transactions to delete
575 foreach (var tx in block.vtx)
581 if (!UpdateTopChain(cursorIntermediate))
583 return false; // UpdateTopChain failed
586 // Resurrect memory transactions that were in the disconnected branch
587 foreach (var tx in txResurrect)
589 mapUnconfirmedTx.TryAdd(tx.Hash, tx);
592 // Delete redundant memory transactions that are in the connected branch
593 foreach (var tx in txDelete)
596 mapUnconfirmedTx.TryRemove(tx.Hash, out dummy);
602 private bool DisconnectBlock(CBlockStoreItem blockCursor, ref CBlock block)
604 throw new NotImplementedException();
607 private bool SetBestChainInner(CBlockStoreItem cursor)
609 uint256 hash = cursor.Hash;
611 if (!cursor.ReadFromFile(ref fStreamReadWrite, out block))
613 return false; // Unable to read block from file.
616 // Adding to current best branch
617 if (!ConnectBlock(cursor, ref block) || !UpdateTopChain(cursor))
619 InvalidChainFound(cursor);
623 // Add to current best branch
624 var prevCursor = cursor.prev;
625 prevCursor.next = cursor;
627 if (!UpdateDBCursor(ref prevCursor))
629 return false; // unable to update
632 // Delete redundant memory transactions
633 foreach (var tx in block.vtx)
636 mapUnconfirmedTx.TryRemove(tx.Hash, out dummy);
642 private bool ConnectBlock(CBlockStoreItem cursor, ref CBlock block, bool fJustCheck = false)
644 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
645 if (!block.CheckBlock(!fJustCheck, !fJustCheck, false))
647 return false; // Invalid block found.
650 bool fScriptChecks = cursor.nHeight >= Checkpoints.TotalBlocksEstimate;
651 var scriptFlags = scriptflag.SCRIPT_VERIFY_NOCACHE | scriptflag.SCRIPT_VERIFY_P2SH;
658 var queuedMerkleNodes = new Dictionary<uint256, CMerkleNode>();
659 var queuedOutputs = new Dictionary<COutPoint, TxOutItem>();
661 for (var nTx = 0; nTx < block.vtx.Length; nTx++)
663 var tx = block.vtx[nTx];
664 var hashTx = tx.Hash;
666 if (!queuedMerkleNodes.ContainsKey(hashTx))
668 var nTxPos = cursor.nBlockPos + block.GetTxOffset(nTx);
669 var mNode = new CMerkleNode(cursor.ItemID, nTxPos, tx);
671 queuedMerkleNodes.Add(hashTx, mNode);
674 Dictionary<COutPoint, TxOutItem> txouts;
675 if (GetOutputs(hashTx, out txouts))
677 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
678 // unless those are already completely spent.
682 nSigOps += tx.LegacySigOpCount;
683 if (nSigOps > CBlock.nMaxSigOps)
685 return false; // too many sigops
688 var inputs = new Dictionary<COutPoint, TxOutItem>();
692 nValueOut += tx.nValueOut;
697 if (!FetchInputs(tx, ref queuedOutputs, ref inputs, true, out Invalid))
699 return false; // Unable to fetch some inputs.
702 // Add in sigops done by pay-to-script-hash inputs;
703 // this is to prevent a "rogue miner" from creating
704 // an incredibly-expensive-to-validate block.
705 nSigOps += tx.GetP2SHSigOpCount(ref inputs);
706 if (nSigOps > CBlock.nMaxSigOps)
708 return false; // too many sigops
711 ulong nTxValueIn = tx.GetValueIn(ref inputs);
712 ulong nTxValueOut = tx.nValueOut;
714 nValueIn += nTxValueIn;
715 nValueOut += nTxValueOut;
719 nFees += nTxValueIn - nTxValueOut;
722 if (!ConnectInputs(tx, ref inputs, ref queuedOutputs, ref cursor, true, fScriptChecks, scriptFlags))
728 for (var i = 0u; i < tx.vout.Length; i++)
730 var outKey = new COutPoint(hashTx, i);
731 var outData = new TxOutItem()
734 nValue = tx.vout[i].nValue,
735 scriptPubKey = tx.vout[i].scriptPubKey,
740 queuedOutputs.Add(outKey, outData);
744 if (!block.IsProofOfStake)
746 ulong nBlockReward = CBlock.GetProofOfWorkReward(cursor.nBits, nFees);
748 // Check coinbase reward
749 if (block.vtx[0].nValueOut > nBlockReward)
751 return false; // coinbase reward exceeded
755 cursor.nMint = (long)(nValueOut - nValueIn + nFees);
756 cursor.nMoneySupply = (cursor.prev != null ? cursor.prev.nMoneySupply : 0) + (long)nValueOut - (long)nValueIn;
758 if (!UpdateDBCursor(ref cursor))
760 return false; // Unable to commit changes
768 // Flush merkle nodes.
769 var savedMerkleNodes = new Dictionary<uint256, CMerkleNode>();
770 foreach (var merklePair in queuedMerkleNodes)
772 var merkleNode = merklePair.Value;
774 if (!SaveMerkleNode(ref merkleNode))
776 // Unable to save merkle tree cursor.
780 savedMerkleNodes.Add(merklePair.Key, merkleNode);
783 // Write queued transaction changes
784 var newOutpointItems = new List<TxOutItem>();
785 var updatedOutpointItems = new List<TxOutItem>();
786 foreach (var outPair in queuedOutputs)
788 var outItem = outPair.Value;
790 if (outItem.nMerkleNodeID == -1)
792 // This outpoint doesn't exist yet, adding to insert list.
794 outItem.nMerkleNodeID = savedMerkleNodes[outPair.Key.hash].nMerkleNodeID;
795 newOutpointItems.Add(outItem);
799 // This outpount already exists, adding to update list.
801 updatedOutpointItems.Add(outItem);
805 if (updatedOutpointItems.Count != 0 && !UpdateOutpoints(ref updatedOutpointItems))
807 return false; // Unable to update outpoints
810 if (newOutpointItems.Count != 0 && !InsertOutpoints(ref newOutpointItems))
812 return false; // Unable to insert outpoints
819 /// Insert set of new outpoints
821 /// <param name="newOutpointItems">List of TxOutItem objects.</param>
822 /// <returns>Result</returns>
823 private bool InsertOutpoints(ref List<TxOutItem> newOutpointItems)
825 return (dbConn.InsertAll(newOutpointItems, false) != 0);
830 /// Update set of outpoints
832 /// <param name="queuedOutpointItems">List of TxOutItem objects.</param>
833 /// <returns>Result</returns>
834 private bool UpdateOutpoints(ref List<TxOutItem> updatedOutpointItems)
836 return (dbConn.UpdateAll(updatedOutpointItems, false) != 0);
840 /// Insert merkle node into db and set actual record id value.
842 /// <param name="merkleNode">Merkle node object reference.</param>
843 /// <returns>Result</returns>
844 private bool SaveMerkleNode(ref CMerkleNode merkleNode)
846 if (dbConn.Insert(merkleNode) == 0)
851 merkleNode.nMerkleNodeID = dbPlatform.SQLiteApi.LastInsertRowid(dbConn.Handle);
856 private bool ConnectInputs(CTransaction tx, ref Dictionary<COutPoint, TxOutItem> inputs, ref Dictionary<COutPoint, TxOutItem> queued, ref CBlockStoreItem cursorBlock, bool fBlock, bool fScriptChecks, scriptflag scriptFlags)
858 // Take over previous transactions' spent items
859 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
865 for (uint i = 0; i < tx.vin.Length; i++)
867 var prevout = tx.vin[i].prevout;
868 Contract.Assert(inputs.ContainsKey(prevout));
869 var input = inputs[prevout];
871 CBlockStoreItem parentBlockCursor;
873 if (input.nMerkleNodeID == -1)
875 // This input seems as is confirmed by the same block.
877 if (!queued.ContainsKey(prevout))
879 return false; // No such output has been queued by this block.
882 // TODO: Ensure that neither coinbase nor coinstake outputs are
883 // available for spending in the generation block.
887 // This input has been confirmed by one of the earlier accepted blocks.
889 var merkleItem = GetMerkleCursor(input, out parentBlockCursor);
891 if (merkleItem == null)
893 return false; // Unable to find merkle node
896 // If prev is coinbase or coinstake, check that it's matured
897 if (merkleItem.IsCoinBase || merkleItem.IsCoinStake)
899 if (cursorBlock.nHeight - parentBlockCursor.nHeight < NetInfo.nGeneratedMaturity)
901 return false; // tried to spend non-matured generation input.
905 // check transaction timestamp
906 if (merkleItem.nTime > tx.nTime)
908 return false; // transaction timestamp earlier than input transaction
912 // Check for negative or overflow input values
913 nValueIn += input.nValue;
914 if (!CTransaction.MoneyRange(input.nValue) || !CTransaction.MoneyRange(nValueIn))
916 return false; // txin values out of range
921 // The first loop above does all the inexpensive checks.
922 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
923 // Helps prevent CPU exhaustion attacks.
924 for (int i = 0; i < tx.vin.Length; i++)
926 var prevout = tx.vin[i].prevout;
927 Contract.Assert(inputs.ContainsKey(prevout));
928 var input = inputs[prevout];
930 // Check for conflicts (double-spend)
936 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
937 // before the last blockchain checkpoint. This is safe because block merkle hashes are
938 // still computed and checked, and any change will be caught at the next checkpoint.
942 if (!ScriptCode.VerifyScript(tx.vin[i].scriptSig, input.scriptPubKey, tx, i, (int)scriptflag.SCRIPT_VERIFY_P2SH, 0))
944 return false; // VerifyScript failed.
948 // Mark outpoint as spent
949 input.IsSpent = true;
950 inputs[prevout] = input;
955 if (input.nMerkleNodeID != -1)
957 // Input has been confirmed earlier.
958 queued.Add(prevout, input);
962 // Input has been confirmed by current block.
963 queued[prevout] = input;
970 // ppcoin: coin stake tx earns reward instead of paying fee
972 if (!tx.GetCoinAge(ref inputs, out nCoinAge))
974 return false; // unable to get coin age for coinstake
977 ulong nReward = tx.nValueOut - nValueIn;
979 ulong nCalculatedReward = CBlock.GetProofOfStakeReward(nCoinAge, cursorBlock.nBits, tx.nTime) - tx.GetMinFee(1, false, CTransaction.MinFeeMode.GMF_BLOCK) + CTransaction.nCent;
981 if (nReward > nCalculatedReward)
983 return false; // coinstake pays too much
988 if (nValueIn < tx.nValueOut)
990 return false; // value in < value out
993 // Tally transaction fees
994 ulong nTxFee = nValueIn - tx.nValueOut;
997 return false; // nTxFee < 0
1002 if (!CTransaction.MoneyRange(nFees))
1004 return false; // nFees out of range
1015 /// Set new top node or current best chain.
1017 /// <param name="cursor"></param>
1018 /// <returns></returns>
1019 private bool UpdateTopChain(CBlockStoreItem cursor)
1021 ChainParams.HashBestChain = cursor.Hash;
1022 ChainParams.nBestChainTrust = cursor.nChainTrust;
1023 ChainParams.nBestHeight = cursor.nHeight;
1025 return dbConn.Update(ChainParams) != 0;
1029 /// Try to find proof-of-stake hash in the map.
1031 /// <param name="blockHash">Block hash</param>
1032 /// <param name="hashProofOfStake">Proof-of-stake hash</param>
1033 /// <returns>Proof-of-Stake hash value</returns>
1034 private bool GetProofOfStakeHash(uint256 blockHash, out uint256 hashProofOfStake)
1036 return mapProofOfStake.TryGetValue(blockHash, out hashProofOfStake);
1039 public bool AcceptBlock(ref CBlock block)
1041 uint256 nHash = block.header.Hash;
1043 if (blockMap.ContainsKey(nHash))
1045 // Already have this block.
1049 CBlockStoreItem prevBlockCursor = null;
1050 if (!blockMap.TryGetValue(block.header.prevHash, out prevBlockCursor))
1052 // Unable to get the cursor.
1056 var prevBlockHeader = prevBlockCursor.BlockHeader;
1058 // TODO: proof-of-work/proof-of-stake verification
1059 uint nHeight = prevBlockCursor.nHeight + 1;
1061 // Check timestamp against prev
1062 if (NetInfo.FutureDrift(block.header.nTime) < prevBlockHeader.nTime)
1064 // block's timestamp is too early
1068 // Check that all transactions are finalized
1069 foreach (var tx in block.vtx)
1071 if (!tx.IsFinal(nHeight, block.header.nTime))
1077 // TODO: Enforce rule that the coinbase starts with serialized block height
1079 // Write block to file.
1080 var itemTemplate = new CBlockStoreItem()
1085 itemTemplate.FillHeader(block.header);
1087 if (!AddItemToIndex(ref itemTemplate, ref block))
1098 /// GEt block by hash.
1100 /// <param name="blockHash">Block hash</param>
1101 /// <param name="block">Block object reference</param>
1102 /// <param name="nBlockPos">Block position reference</param>
1103 /// <returns>Result</returns>
1104 public bool GetBlock(uint256 blockHash, ref CBlock block, ref long nBlockPos)
1106 CBlockStoreItem cursor;
1108 if (!blockMap.TryGetValue(blockHash, out cursor))
1110 return false; // Unable to fetch block cursor
1113 nBlockPos = cursor.nBlockPos;
1115 return cursor.ReadFromFile(ref fStreamReadWrite, out block);
1119 /// Get block and transaction by transaction hash.
1121 /// <param name="TxID">Transaction hash</param>
1122 /// <param name="block">Block reference</param>
1123 /// <param name="nBlockPos">Block position reference</param>
1124 /// <returns>Result of operation</returns>
1125 public bool GetBlockByTransactionID(uint256 TxID, out CBlock block, out long nBlockPos)
1130 var queryResult = dbConn.Query<CBlockStoreItem>("select b.* from [BlockStorage] b left join [MerkleNodes] m on (b.[ItemID] = m.[nParentBlockID]) where m.[TransactionHash] = ?", (byte[])TxID);
1132 if (queryResult.Count == 1)
1134 CBlockStoreItem blockCursor = queryResult[0];
1136 nBlockPos = blockCursor.nBlockPos;
1138 return blockCursor.ReadFromFile(ref fStreamReadWrite, out block);
1146 public bool GetOutputs(uint256 transactionHash, out Dictionary<COutPoint, TxOutItem> txouts, bool fUnspentOnly=true)
1150 var queryParams = new object[] { (byte[])transactionHash, fUnspentOnly ? OutputFlags.AVAILABLE : (OutputFlags.AVAILABLE | OutputFlags.SPENT) };
1151 var queryResult = dbConn.Query<TxOutItem>("select o.* from [Outputs] o left join [MerkleNodes] m on m.[nMerkleNodeID] = o.[nMerkleNodeID] where m.[TransactionHash] = ? and outputFlags = ?", queryParams);
1153 if (queryResult.Count != 0)
1155 txouts = new Dictionary<COutPoint, TxOutItem>();
1157 foreach (var o in queryResult)
1159 var outpointKey = new COutPoint(transactionHash, o.nOut);
1160 var outpointData = o;
1162 txouts.Add(outpointKey, outpointData);
1165 // There are some unspent inputs.
1169 // This transaction has been spent completely.
1174 /// Get block cursor from map.
1176 /// <param name="blockHash">block hash</param>
1177 /// <returns>Cursor or null</returns>
1178 public CBlockStoreItem GetMapCursor(uint256 blockHash)
1182 // Genesis block has zero prevHash and no parent.
1186 CBlockStoreItem cursor = null;
1187 blockMap.TryGetValue(blockHash, out cursor);
1193 /// Get merkle node cursor by output metadata.
1195 /// <param name="item">Output metadata object</param>
1196 /// <returns>Merkle node cursor or null</returns>
1197 public CMerkleNode GetMerkleCursor(TxOutItem item, out CBlockStoreItem blockCursor)
1201 // Trying to get cursor from the database.
1202 var QueryMerkleCursor = dbConn.Query<CMerkleNode>("select * from [MerkleNodes] where [nMerkleNodeID] = ?", item.nMerkleNodeID);
1204 if (QueryMerkleCursor.Count == 1)
1206 var merkleNode = QueryMerkleCursor[0];
1209 var results = blockMap.Where(x => x.Value.ItemID == merkleNode.nParentBlockID).Select(x => x.Value).ToArray();
1211 blockCursor = results[0];
1221 /// Load cursor from database.
1223 /// <param name="blockHash">Block hash</param>
1224 /// <returns>Block cursor object</returns>
1225 public CBlockStoreItem GetDBCursor(uint256 blockHash)
1227 // Trying to get cursor from the database.
1228 var QueryBlockCursor = dbConn.Query<CBlockStoreItem>("select * from [BlockStorage] where [Hash] = ?", (byte[])blockHash);
1230 if (QueryBlockCursor.Count == 1)
1232 return QueryBlockCursor[0];
1240 /// Update cursor in memory and on disk.
1242 /// <param name="cursor">Block cursor</param>
1243 /// <returns>Result</returns>
1244 public bool UpdateMapCursor(CBlockStoreItem cursor)
1246 var original = blockMap[cursor.Hash];
1247 return blockMap.TryUpdate(cursor.Hash, cursor, original);
1251 /// Update cursor record in database.
1253 /// <param name="cursor">Block cursor object</param>
1254 /// <returns>Result</returns>
1255 public bool UpdateDBCursor(ref CBlockStoreItem cursor)
1257 return dbConn.Update(cursor) != 0;
1260 public bool ProcessBlock(ref CBlock block)
1262 var blockHash = block.header.Hash;
1264 if (blockMap.ContainsKey(blockHash))
1266 // We already have this block.
1270 if (orphanMap.ContainsKey(blockHash))
1272 // We already have block in the list of orphans.
1276 // TODO: Limited duplicity on stake and reserialization of block signature
1278 if (!block.CheckBlock(true, true, true))
1280 // Preliminary checks failure.
1284 if (block.IsProofOfStake)
1286 if (!block.SignatureOK)
1288 // Proof-of-Stake signature validation failure.
1292 // TODO: proof-of-stake validation
1294 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
1295 if (!StakeModifier.CheckProofOfStake(block.vtx[1], block.header.nBits, out hashProofOfStake, out targetProofOfStake))
1297 return false; // do not error here as we expect this during initial block download
1299 if (!mapProofOfStake.ContainsKey(blockHash))
1301 // add to mapProofOfStake
1302 mapProofOfStake.TryAdd(blockHash, hashProofOfStake);
1307 // TODO: difficulty verification
1309 // If don't already have its previous block, shunt it off to holding area until we get it
1310 if (!blockMap.ContainsKey(block.header.prevHash))
1312 if (block.IsProofOfStake)
1314 // TODO: limit duplicity on stake
1317 var block2 = new CBlock(block);
1318 orphanMap.TryAdd(blockHash, block2);
1319 orphanMapByPrev.TryAdd(blockHash, block2);
1324 // Store block to disk
1325 if (!AcceptBlock(ref block))
1331 // Recursively process any orphan blocks that depended on this one
1332 var orphansQueue = new List<uint256>();
1333 orphansQueue.Add(blockHash);
1335 for (int i = 0; i < orphansQueue.Count; i++)
1337 var hashPrev = orphansQueue[i];
1339 foreach (var pair in orphanMap)
1341 var orphanBlock = pair.Value;
1343 if (orphanBlock.header.prevHash == blockHash)
1345 if (AcceptBlock(ref orphanBlock))
1347 orphansQueue.Add(pair.Key);
1351 orphanMap.TryRemove(pair.Key, out dummy1);
1356 orphanMap.TryRemove(hashPrev, out dummy2);
1362 public bool ParseBlockFile(string BlockFile = "bootstrap.dat")
1364 // TODO: Rewrite completely.
1368 var buffer = new byte[CBlock.nMaxBlockSize]; // Max block size is 1Mb
1369 var intBuffer = new byte[4];
1371 var fStream2 = File.OpenRead(BlockFile);
1373 fStream2.Seek(nOffset, SeekOrigin.Begin); // Seek to previous offset + previous block length
1375 while (fStream2.Read(buffer, 0, 4) == 4) // Read magic number
1377 var nMagic = BitConverter.ToUInt32(buffer, 0);
1378 if (nMagic != 0xe5e9e8e4)
1380 throw new Exception("Incorrect magic number.");
1383 var nBytesRead = fStream2.Read(buffer, 0, 4);
1384 if (nBytesRead != 4)
1386 throw new Exception("BLKSZ EOF");
1389 var nBlockSize = BitConverter.ToInt32(buffer, 0);
1391 nOffset = fStream2.Position;
1393 nBytesRead = fStream2.Read(buffer, 0, nBlockSize);
1395 if (nBytesRead == 0 || nBytesRead != nBlockSize)
1397 throw new Exception("BLK EOF");
1400 var block = new CBlock(buffer);
1401 var hash = block.header.Hash;
1403 if (blockMap.ContainsKey(hash))
1408 if (!ProcessBlock(ref block))
1410 throw new Exception("Invalid block: " + block.header.Hash);
1413 int nCount = blockMap.Count;
1414 Console.WriteLine("nCount={0}, Hash={1}, NumTx={2}, Time={3}", nCount, block.header.Hash, block.vtx.Length, DateTime.Now); // Commit on each 100th block
1417 if (nCount % 100 == 0 && nCount != 0)
1419 Console.WriteLine("Commit...");
1421 dbConn.BeginTransaction();
1433 public void Dispose()
1436 GC.SuppressFinalize(this);
1439 protected virtual void Dispose(bool disposing)
1445 // Free other state (managed objects).
1447 fStreamReadWrite.Dispose();