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<Tuple<COutPoint, uint>, uint256> mapStakeSeenOrphan = new ConcurrentDictionary<Tuple<COutPoint, uint>, uint256>();
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, out 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];
235 public bool FetchInputs(ref CTransaction tx, ref Dictionary<COutPoint, TxOutItem> queued, ref Dictionary<COutPoint, TxOutItem> inputs, bool IsBlock, out bool Invalid)
241 // Coinbase transactions have no inputs to fetch.
245 StringBuilder queryBuilder = new StringBuilder();
247 queryBuilder.Append("select o.*, m.[TransactionHash] from [Outputs] o left join [MerkleNodes] m on (m.[nMerkleNodeID] = o.[nMerkleNodeID]) where ");
249 for (var i = 0; i < tx.vin.Length; i++)
251 queryBuilder.AppendFormat(" {0} (m.[TransactionHash] = x'{1}' and o.[OutputNumber] = x'{2}')",
252 (i > 0 ? "or" : string.Empty), Interop.ToHex(tx.vin[i].prevout.hash),
253 Interop.ToHex(VarInt.EncodeVarInt(tx.vin[i].prevout.n)
257 var queryResults = dbConn.Query<InputsJoin>(queryBuilder.ToString());
259 foreach (var item in queryResults)
263 return false; // Already spent
266 var inputsKey = new COutPoint(item.TransactionHash, item.nOut);
268 // Add output data to dictionary
269 inputs.Add(inputsKey, item.getTxOutItem());
272 if (queryResults.Count < tx.vin.Length)
276 // It seems that some transactions are being spent in the same block.
278 foreach (var txin in tx.vin)
280 var outPoint = txin.prevout;
282 if (inputs.ContainsKey(outPoint))
284 continue; // We have already seen this input.
287 if (!queued.ContainsKey(outPoint))
289 return false; // No such transaction
292 // Add output data to dictionary
293 inputs.Add(outPoint, queued[outPoint]);
295 // Mark output as spent
296 // queued[outPoint].IsSpent = true;
301 // Unconfirmed transaction
303 foreach (var txin in tx.vin)
305 var outPoint = txin.prevout;
308 if (!mapUnconfirmedTx.TryGetValue(outPoint.hash, out txPrev))
310 return false; // No such transaction
313 if (outPoint.n > txPrev.vout.Length)
317 return false; // nOut is out of range
320 // TODO: return inputs from map
321 throw new NotImplementedException();
332 private bool AddItemToIndex(ref CBlockStoreItem itemTemplate, ref CBlock block)
334 uint256 blockHash = itemTemplate.Hash;
336 if (blockMap.ContainsKey(blockHash))
338 // Already have this block.
343 dbConn.BeginTransaction();
345 // Compute chain trust score
346 itemTemplate.nChainTrust = (itemTemplate.prev != null ? itemTemplate.prev.nChainTrust : 0) + itemTemplate.nBlockTrust;
348 if (!itemTemplate.SetStakeEntropyBit(Entropy.GetStakeEntropyBit(itemTemplate.nHeight, blockHash)))
350 return false; // SetStakeEntropyBit() failed
353 // compute stake modifier
354 long nStakeModifier = 0;
355 bool fGeneratedStakeModifier = false;
356 if (!StakeModifier.ComputeNextStakeModifier(itemTemplate, ref nStakeModifier, ref fGeneratedStakeModifier))
358 return false; // ComputeNextStakeModifier() failed
361 itemTemplate.SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
363 var nChecksum = StakeModifier.GetModifierChecksum(ref itemTemplate);
364 if (!ModifierCheckpoints.Verify(itemTemplate.nHeight, nChecksum))
366 return false; // Stake modifier checkpoints mismatch
370 if (block.IsProofOfStake)
372 itemTemplate.SetProofOfStake();
374 itemTemplate.prevoutStake = block.vtx[1].vin[0].prevout;
375 itemTemplate.nStakeTime = block.vtx[1].nTime;
377 // Save proof-of-stake hash value
378 uint256 hashProofOfStake;
379 if (!GetProofOfStakeHash(ref blockHash, out hashProofOfStake))
381 return false; // hashProofOfStake not found
383 itemTemplate.hashProofOfStake = hashProofOfStake;
386 if (!itemTemplate.WriteToFile(ref fStreamReadWrite, ref block))
391 if (dbConn.Insert(itemTemplate) == 0)
393 return false; // Insert failed
397 itemTemplate.ItemID = dbPlatform.SQLiteApi.LastInsertRowid(dbConn.Handle);
399 if (!blockMap.TryAdd(blockHash, itemTemplate))
401 return false; // blockMap add failed
404 if (itemTemplate.nChainTrust > ChainParams.nBestChainTrust)
408 if (!SetBestChain(ref itemTemplate))
410 return false; // SetBestChain failed.
414 // Commit transaction
420 private bool SetBestChain(ref CBlockStoreItem cursor)
422 uint256 hashBlock = cursor.Hash;
424 if (genesisBlockCursor == null && hashBlock == NetInfo.nHashGenesisBlock)
426 genesisBlockCursor = cursor;
428 else if (ChainParams.nHashBestChain == (uint256)cursor.prevHash)
430 if (!SetBestChainInner(cursor))
437 // the first block in the new chain that will cause it to become the new best chain
438 var cursorIntermediate = cursor;
440 // list of blocks that need to be connected afterwards
441 var secondary = new List<CBlockStoreItem>();
443 // Reorganize is costly in terms of db load, as it works in a single db transaction.
444 // Try to limit how much needs to be done inside
445 while (cursorIntermediate.prev != null && cursorIntermediate.prev.nChainTrust > bestBlockCursor.nChainTrust)
447 secondary.Add(cursorIntermediate);
448 cursorIntermediate = cursorIntermediate.prev;
451 // Switch to new best branch
452 if (!Reorganize(cursorIntermediate))
454 InvalidChainFound(cursor);
455 return false; // reorganize failed
458 // Connect further blocks
459 foreach (var currentCursor in secondary)
462 if (!currentCursor.ReadFromFile(ref fStreamReadWrite, out block))
464 // ReadFromDisk failed
468 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
469 if (!SetBestChainInner(currentCursor))
476 bestBlockCursor = cursor;
477 nTimeBestReceived = Interop.GetTime();
478 nTransactionsUpdated++;
480 if (!UpdateTopChain(cursor))
482 return false; // unable to set top chain node.
488 private void InvalidChainFound(CBlockStoreItem cursor)
490 throw new NotImplementedException();
493 private bool Reorganize(CBlockStoreItem cursorIntermediate)
496 var fork = bestBlockCursor;
497 var longer = cursorIntermediate;
499 while (fork.ItemID != longer.ItemID)
501 while (longer.nHeight > fork.nHeight)
503 if ((longer = longer.prev) == null)
505 return false; // longer.prev is null
509 if (fork.ItemID == longer.ItemID)
514 if ((fork = fork.prev) == null)
516 return false; // fork.prev is null
520 // List of what to disconnect
521 var disconnect = new List<CBlockStoreItem>();
522 for (var cursor = bestBlockCursor; cursor.ItemID != fork.ItemID; cursor = cursor.prev)
524 disconnect.Add(cursor);
527 // List of what to connect
528 var connect = new List<CBlockStoreItem>();
529 for (var cursor = cursorIntermediate; cursor.ItemID != fork.ItemID; cursor = cursor.prev)
535 // Disconnect shorter branch
536 var txResurrect = new List<CTransaction>();
537 foreach (var blockCursor in disconnect)
540 if (!blockCursor.ReadFromFile(ref fStreamReadWrite, out block))
542 return false; // ReadFromFile for disconnect failed.
544 if (!DisconnectBlock(blockCursor, ref block))
546 return false; // DisconnectBlock failed.
549 // Queue memory transactions to resurrect
550 foreach (var tx in block.vtx)
552 if (!tx.IsCoinBase && !tx.IsCoinStake)
559 // Connect longer branch
560 var txDelete = new List<CTransaction>();
561 foreach (var cursor in connect)
564 if (!cursor.ReadFromFile(ref fStreamReadWrite, out block))
566 return false; // ReadFromDisk for connect failed
569 if (!ConnectBlock(cursor, ref block))
572 return false; // ConnectBlock failed
575 // Queue memory transactions to delete
576 foreach (var tx in block.vtx)
582 if (!UpdateTopChain(cursorIntermediate))
584 return false; // UpdateTopChain failed
587 // Resurrect memory transactions that were in the disconnected branch
588 foreach (var tx in txResurrect)
590 mapUnconfirmedTx.TryAdd(tx.Hash, tx);
593 // Delete redundant memory transactions that are in the connected branch
594 foreach (var tx in txDelete)
597 mapUnconfirmedTx.TryRemove(tx.Hash, out dummy);
603 private bool DisconnectBlock(CBlockStoreItem blockCursor, ref CBlock block)
605 throw new NotImplementedException();
608 private bool SetBestChainInner(CBlockStoreItem cursor)
610 uint256 hash = cursor.Hash;
612 if (!cursor.ReadFromFile(ref fStreamReadWrite, out block))
614 return false; // Unable to read block from file.
617 // Adding to current best branch
618 if (!ConnectBlock(cursor, ref block) || !UpdateTopChain(cursor))
620 InvalidChainFound(cursor);
624 // Add to current best branch
625 var prevCursor = cursor.prev;
626 prevCursor.next = cursor;
628 if (!UpdateDBCursor(ref prevCursor))
630 return false; // unable to update
633 // Delete redundant memory transactions
634 foreach (var tx in block.vtx)
637 mapUnconfirmedTx.TryRemove(tx.Hash, out dummy);
643 private bool ConnectBlock(CBlockStoreItem cursor, ref CBlock block, bool fJustCheck = false)
645 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
646 if (!block.CheckBlock(!fJustCheck, !fJustCheck, false))
648 return false; // Invalid block found.
651 bool fScriptChecks = cursor.nHeight >= HashCheckpoints.TotalBlocksEstimate;
652 var scriptFlags = scriptflag.SCRIPT_VERIFY_NOCACHE | scriptflag.SCRIPT_VERIFY_P2SH;
659 var queuedMerkleNodes = new Dictionary<uint256, CMerkleNode>();
660 var queuedOutputs = new Dictionary<COutPoint, TxOutItem>();
662 for (var nTx = 0; nTx < block.vtx.Length; nTx++)
664 var tx = block.vtx[nTx];
665 var hashTx = tx.Hash;
667 if (!queuedMerkleNodes.ContainsKey(hashTx))
669 var nTxPos = cursor.nBlockPos + block.GetTxOffset(nTx);
670 var mNode = new CMerkleNode(cursor.ItemID, nTxPos, tx);
672 queuedMerkleNodes.Add(hashTx, mNode);
675 Dictionary<COutPoint, TxOutItem> txouts;
676 if (GetOutputs(hashTx, out txouts))
678 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
679 // unless those are already completely spent.
683 nSigOps += tx.LegacySigOpCount;
684 if (nSigOps > CBlock.nMaxSigOps)
686 return false; // too many sigops
689 var inputs = new Dictionary<COutPoint, TxOutItem>();
693 nValueOut += tx.nValueOut;
698 if (!FetchInputs(ref tx, ref queuedOutputs, ref inputs, true, out Invalid))
700 return false; // Unable to fetch some inputs.
703 // Add in sigops done by pay-to-script-hash inputs;
704 // this is to prevent a "rogue miner" from creating
705 // an incredibly-expensive-to-validate block.
706 nSigOps += tx.GetP2SHSigOpCount(ref inputs);
707 if (nSigOps > CBlock.nMaxSigOps)
709 return false; // too many sigops
712 long nTxValueIn = tx.GetValueIn(ref inputs);
713 long nTxValueOut = tx.nValueOut;
715 nValueIn += nTxValueIn;
716 nValueOut += nTxValueOut;
720 nFees += nTxValueIn - nTxValueOut;
723 if (!ConnectInputs(ref tx, ref inputs, ref queuedOutputs, ref cursor, true, fScriptChecks, scriptFlags))
729 for (var i = 0u; i < tx.vout.Length; i++)
731 var outKey = new COutPoint(hashTx, i);
732 var outData = new TxOutItem()
735 nValue = tx.vout[i].nValue,
736 scriptPubKey = tx.vout[i].scriptPubKey,
741 queuedOutputs.Add(outKey, outData);
745 if (!block.IsProofOfStake)
747 long nBlockReward = CBlock.GetProofOfWorkReward(cursor.nBits, nFees);
749 // Check coinbase reward
750 if (block.vtx[0].nValueOut > nBlockReward)
752 return false; // coinbase reward exceeded
756 cursor.nMint = nValueOut - nValueIn + nFees;
757 cursor.nMoneySupply = (cursor.prev != null ? cursor.prev.nMoneySupply : 0) + nValueOut - nValueIn;
759 if (!UpdateDBCursor(ref cursor))
761 return false; // Unable to commit changes
769 // Flush merkle nodes.
770 var savedMerkleNodes = new Dictionary<uint256, CMerkleNode>();
771 foreach (var merklePair in queuedMerkleNodes)
773 var merkleNode = merklePair.Value;
775 if (!SaveMerkleNode(ref merkleNode))
777 // Unable to save merkle tree cursor.
781 savedMerkleNodes.Add(merklePair.Key, merkleNode);
784 // Write queued transaction changes
785 var newOutpointItems = new List<TxOutItem>();
786 var updatedOutpointItems = new List<TxOutItem>();
787 foreach (var outPair in queuedOutputs)
789 var outItem = outPair.Value;
791 if (outItem.nMerkleNodeID == -1)
793 // This outpoint doesn't exist yet, adding to insert list.
795 outItem.nMerkleNodeID = savedMerkleNodes[outPair.Key.hash].nMerkleNodeID;
796 newOutpointItems.Add(outItem);
800 // This outpount already exists, adding to update list.
802 updatedOutpointItems.Add(outItem);
806 if (updatedOutpointItems.Count != 0 && !UpdateOutpoints(ref updatedOutpointItems))
808 return false; // Unable to update outpoints
811 if (newOutpointItems.Count != 0 && !InsertOutpoints(ref newOutpointItems))
813 return false; // Unable to insert outpoints
820 /// Insert set of new outpoints
822 /// <param name="newOutpointItems">List of TxOutItem objects.</param>
823 /// <returns>Result</returns>
824 private bool InsertOutpoints(ref List<TxOutItem> newOutpointItems)
826 return (dbConn.InsertAll(newOutpointItems, false) != 0);
831 /// Update set of outpoints
833 /// <param name="queuedOutpointItems">List of TxOutItem objects.</param>
834 /// <returns>Result</returns>
835 private bool UpdateOutpoints(ref List<TxOutItem> updatedOutpointItems)
837 return (dbConn.UpdateAll(updatedOutpointItems, false) != 0);
841 /// Insert merkle node into db and set actual record id value.
843 /// <param name="merkleNode">Merkle node object reference.</param>
844 /// <returns>Result</returns>
845 private bool SaveMerkleNode(ref CMerkleNode merkleNode)
847 if (dbConn.Insert(merkleNode) == 0)
852 merkleNode.nMerkleNodeID = dbPlatform.SQLiteApi.LastInsertRowid(dbConn.Handle);
857 private bool ConnectInputs(ref CTransaction tx, ref Dictionary<COutPoint, TxOutItem> inputs, ref Dictionary<COutPoint, TxOutItem> queued, ref CBlockStoreItem cursorBlock, bool fBlock, bool fScriptChecks, scriptflag scriptFlags)
859 // Take over previous transactions' spent items
860 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
866 for (uint i = 0; i < tx.vin.Length; i++)
868 var prevout = tx.vin[i].prevout;
869 Contract.Assert(inputs.ContainsKey(prevout));
870 var input = inputs[prevout];
872 CBlockStoreItem parentBlockCursor;
874 if (input.nMerkleNodeID == -1)
876 // This input seems as is confirmed by the same block.
878 if (!queued.ContainsKey(prevout))
880 return false; // No such output has been queued by this block.
883 // TODO: Ensure that neither coinbase nor coinstake outputs are
884 // available for spending in the generation block.
888 // This input has been confirmed by one of the earlier accepted blocks.
890 var merkleItem = GetMerkleCursor(input, out parentBlockCursor);
892 if (merkleItem == null)
894 return false; // Unable to find merkle node
897 // If prev is coinbase or coinstake, check that it's matured
898 if (merkleItem.IsCoinBase || merkleItem.IsCoinStake)
900 if (cursorBlock.nHeight - parentBlockCursor.nHeight < NetInfo.nGeneratedMaturity)
902 return false; // tried to spend non-matured generation input.
906 // check transaction timestamp
907 if (merkleItem.nTime > tx.nTime)
909 return false; // transaction timestamp earlier than input transaction
913 // Check for negative or overflow input values
914 nValueIn += input.nValue;
915 if (!CTransaction.MoneyRange(input.nValue) || !CTransaction.MoneyRange(nValueIn))
917 return false; // txin values out of range
922 // The first loop above does all the inexpensive checks.
923 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
924 // Helps prevent CPU exhaustion attacks.
925 for (int i = 0; i < tx.vin.Length; i++)
927 var prevout = tx.vin[i].prevout;
928 Contract.Assert(inputs.ContainsKey(prevout));
929 var input = inputs[prevout];
931 // Check for conflicts (double-spend)
937 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
938 // before the last blockchain checkpoint. This is safe because block merkle hashes are
939 // still computed and checked, and any change will be caught at the next checkpoint.
943 if (!ScriptCode.VerifyScript(tx.vin[i].scriptSig, input.scriptPubKey, tx, i, (int)scriptflag.SCRIPT_VERIFY_P2SH, 0))
945 return false; // VerifyScript failed.
949 // Mark outpoint as spent
950 input.IsSpent = true;
951 inputs[prevout] = input;
956 if (input.nMerkleNodeID != -1)
958 // Input has been confirmed earlier.
959 queued.Add(prevout, input);
963 // Input has been confirmed by current block.
964 queued[prevout] = input;
971 // Coin stake tx earns reward instead of paying fee
973 if (!tx.GetCoinAge(ref inputs, out nCoinAge))
975 return false; // unable to get coin age for coinstake
978 long nReward = tx.nValueOut - nValueIn;
980 long nCalculatedReward = CBlock.GetProofOfStakeReward(nCoinAge, cursorBlock.nBits, tx.nTime) - tx.GetMinFee(1, false, CTransaction.MinFeeMode.GMF_BLOCK) + CTransaction.nCent;
982 if (nReward > nCalculatedReward)
984 return false; // coinstake pays too much
989 if (nValueIn < tx.nValueOut)
991 return false; // value in < value out
994 // Tally transaction fees
995 long nTxFee = nValueIn - tx.nValueOut;
998 return false; // nTxFee < 0
1003 if (!CTransaction.MoneyRange(nFees))
1005 return false; // nFees out of range
1016 /// Set new top node or current best chain.
1018 /// <param name="cursor"></param>
1019 /// <returns></returns>
1020 private bool UpdateTopChain(CBlockStoreItem cursor)
1022 ChainParams.HashBestChain = cursor.Hash;
1023 ChainParams.nBestChainTrust = cursor.nChainTrust;
1024 ChainParams.nBestHeight = cursor.nHeight;
1026 return dbConn.Update(ChainParams) != 0;
1030 /// Try to find proof-of-stake hash in the map.
1032 /// <param name="blockHash">Block hash</param>
1033 /// <param name="hashProofOfStake">Proof-of-stake hash</param>
1034 /// <returns>Proof-of-Stake hash value</returns>
1035 private bool GetProofOfStakeHash(ref uint256 blockHash, out uint256 hashProofOfStake)
1037 return mapProofOfStake.TryGetValue(blockHash, out hashProofOfStake);
1040 public bool AcceptBlock(ref CBlock block)
1042 uint256 nHash = block.header.Hash;
1044 if (blockMap.ContainsKey(nHash))
1046 // Already have this block.
1050 CBlockStoreItem prevBlockCursor;
1051 if (!blockMap.TryGetValue(block.header.prevHash, out prevBlockCursor))
1053 // Unable to get the cursor.
1057 var prevBlockHeader = prevBlockCursor.BlockHeader;
1059 // TODO: proof-of-work/proof-of-stake verification
1060 uint nHeight = prevBlockCursor.nHeight + 1;
1062 // Check timestamp against prev
1063 if (NetInfo.FutureDrift(block.header.nTime) < prevBlockHeader.nTime)
1065 // block's timestamp is too early
1069 // Check that all transactions are finalized
1070 foreach (var tx in block.vtx)
1072 if (!tx.IsFinal(nHeight, block.header.nTime))
1078 // Check that the block chain matches the known block chain up to a checkpoint
1079 if (!HashCheckpoints.Verify(nHeight, nHash))
1081 return false; // rejected by checkpoint lock-in
1084 // TODO: Enforce rule that the coinbase starts with serialized block height
1086 // Write block to file.
1087 var itemTemplate = new CBlockStoreItem()
1092 itemTemplate.FillHeader(block.header);
1094 if (!AddItemToIndex(ref itemTemplate, ref block))
1105 /// Get block by hash.
1107 /// <param name="blockHash">Block hash</param>
1108 /// <param name="block">Block object reference</param>
1109 /// <param name="nBlockPos">Block position reference</param>
1110 /// <returns>Result</returns>
1111 public bool GetBlock(uint256 blockHash, ref CBlock block, ref long nBlockPos)
1113 CBlockStoreItem cursor;
1115 if (!blockMap.TryGetValue(blockHash, out cursor))
1117 return false; // Unable to fetch block cursor
1120 nBlockPos = cursor.nBlockPos;
1122 return cursor.ReadFromFile(ref fStreamReadWrite, out block);
1126 /// Get block and transaction by transaction hash.
1128 /// <param name="TxID">Transaction hash</param>
1129 /// <param name="block">Block reference</param>
1130 /// <param name="nBlockPos">Block position reference</param>
1131 /// <returns>Result of operation</returns>
1132 public bool GetBlockByTransactionID(uint256 TxID, out CBlock block, out long nBlockPos)
1137 var queryResult = dbConn.Query<CBlockStoreItem>("select b.* from [BlockStorage] b left join [MerkleNodes] m on (b.[ItemID] = m.[nParentBlockID]) where m.[TransactionHash] = ?", (byte[])TxID);
1139 if (queryResult.Count == 1)
1141 CBlockStoreItem blockCursor = queryResult[0];
1143 nBlockPos = blockCursor.nBlockPos;
1145 return blockCursor.ReadFromFile(ref fStreamReadWrite, out block);
1153 public bool GetOutputs(uint256 transactionHash, out Dictionary<COutPoint, TxOutItem> txouts, bool fUnspentOnly=true)
1157 var queryParams = new object[] { (byte[])transactionHash, fUnspentOnly ? OutputFlags.AVAILABLE : (OutputFlags.AVAILABLE | OutputFlags.SPENT) };
1158 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);
1160 if (queryResult.Count != 0)
1162 txouts = new Dictionary<COutPoint, TxOutItem>();
1164 foreach (var o in queryResult)
1166 var outpointKey = new COutPoint(transactionHash, o.nOut);
1167 var outpointData = o;
1169 txouts.Add(outpointKey, outpointData);
1172 // There are some unspent inputs.
1176 // This transaction has been spent completely.
1181 /// Get block cursor from map.
1183 /// <param name="blockHash">block hash</param>
1184 /// <returns>Cursor or null</returns>
1185 public CBlockStoreItem GetMapCursor(uint256 blockHash)
1189 // Genesis block has zero prevHash and no parent.
1193 CBlockStoreItem cursor = null;
1194 blockMap.TryGetValue(blockHash, out cursor);
1200 /// Get merkle node cursor by output metadata.
1202 /// <param name="item">Output metadata object</param>
1203 /// <returns>Merkle node cursor or null</returns>
1204 public CMerkleNode GetMerkleCursor(TxOutItem item, out CBlockStoreItem blockCursor)
1208 // Trying to get cursor from the database.
1209 var QueryMerkleCursor = dbConn.Query<CMerkleNode>("select * from [MerkleNodes] where [nMerkleNodeID] = ?", item.nMerkleNodeID);
1211 if (QueryMerkleCursor.Count == 1)
1213 var merkleNode = QueryMerkleCursor[0];
1216 var results = blockMap.Where(x => x.Value.ItemID == merkleNode.nParentBlockID).Select(x => x.Value).ToArray();
1218 blockCursor = results[0];
1228 /// Load cursor from database.
1230 /// <param name="blockHash">Block hash</param>
1231 /// <returns>Block cursor object</returns>
1232 public CBlockStoreItem GetDBCursor(uint256 blockHash)
1234 // Trying to get cursor from the database.
1235 var QueryBlockCursor = dbConn.Query<CBlockStoreItem>("select * from [BlockStorage] where [Hash] = ?", (byte[])blockHash);
1237 if (QueryBlockCursor.Count == 1)
1239 return QueryBlockCursor[0];
1247 /// Update cursor in memory and on disk.
1249 /// <param name="cursor">Block cursor</param>
1250 /// <returns>Result</returns>
1251 public bool UpdateMapCursor(CBlockStoreItem cursor)
1253 var original = blockMap[cursor.Hash];
1254 return blockMap.TryUpdate(cursor.Hash, cursor, original);
1258 /// Update cursor record in database.
1260 /// <param name="cursor">Block cursor object</param>
1261 /// <returns>Result</returns>
1262 public bool UpdateDBCursor(ref CBlockStoreItem cursor)
1264 return dbConn.Update(cursor) != 0;
1267 public bool ProcessBlock(ref CBlock block)
1269 var blockHash = block.header.Hash;
1271 if (blockMap.ContainsKey(blockHash))
1273 // We already have this block.
1277 if (orphanMap.ContainsKey(blockHash))
1279 // We already have block in the list of orphans.
1283 // TODO: Limited duplicity on stake and reserialization of block signature
1285 if (!block.CheckBlock(true, true, true))
1287 // Preliminary checks failure.
1291 if (block.IsProofOfStake)
1293 // TODO: proof-of-stake validation
1295 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
1296 if (!StakeModifier.CheckProofOfStake(block.vtx[1], block.header.nBits, out hashProofOfStake, out targetProofOfStake))
1298 return false; // do not error here as we expect this during initial block download
1300 if (!mapProofOfStake.ContainsKey(blockHash))
1302 // add to mapProofOfStake
1303 mapProofOfStake.TryAdd(blockHash, hashProofOfStake);
1308 // TODO: difficulty verification
1310 // If don't already have its previous block, shunt it off to holding area until we get it
1311 if (!blockMap.ContainsKey(block.header.prevHash))
1313 if (block.IsProofOfStake)
1315 var proof = block.ProofOfStake;
1317 // Limited duplicity on stake: prevents block flood attack
1318 // Duplicate stake allowed only when there is orphan child block
1319 if (mapStakeSeenOrphan.ContainsKey(proof) && !orphanMapByPrev.ContainsKey(blockHash))
1321 return false; // duplicate proof-of-stake
1325 mapStakeSeenOrphan.TryAdd(proof, blockHash);
1329 orphanMap.TryAdd(blockHash, block);
1330 orphanMapByPrev.TryAdd(blockHash, block);
1335 // Store block to disk
1336 if (!AcceptBlock(ref block))
1342 if (orphanMapByPrev.Count > 0)
1344 // Recursively process any orphan blocks that depended on this one
1346 var orphansQueue = new List<uint256>();
1347 orphansQueue.Add(blockHash);
1349 for (int i = 0; i < orphansQueue.Count; i++)
1351 var hashPrev = orphansQueue[i];
1353 foreach (var pair in orphanMapByPrev)
1355 var orphanBlock = pair.Value;
1357 if (orphanBlock.header.prevHash == blockHash)
1359 if (AcceptBlock(ref orphanBlock))
1361 orphansQueue.Add(pair.Key);
1365 orphanMap.TryRemove(pair.Key, out dummy1);
1368 mapStakeSeenOrphan.TryRemove(orphanBlock.ProofOfStake, out dummyHash);
1373 orphanMapByPrev.TryRemove(hashPrev, out dummy2);
1380 public bool ParseBlockFile(string BlockFile = "bootstrap.dat")
1382 // TODO: Rewrite completely.
1386 var buffer = new byte[CBlock.nMaxBlockSize]; // Max block size is 1Mb
1387 var intBuffer = new byte[4];
1389 var fStream2 = File.OpenRead(BlockFile);
1391 fStream2.Seek(nOffset, SeekOrigin.Begin); // Seek to previous offset + previous block length
1393 while (fStream2.Read(buffer, 0, 4) == 4) // Read magic number
1395 var nMagic = BitConverter.ToUInt32(buffer, 0);
1396 if (nMagic != 0xe5e9e8e4)
1398 throw new Exception("Incorrect magic number.");
1401 var nBytesRead = fStream2.Read(buffer, 0, 4);
1402 if (nBytesRead != 4)
1404 throw new Exception("BLKSZ EOF");
1407 var nBlockSize = BitConverter.ToInt32(buffer, 0);
1409 nOffset = fStream2.Position;
1411 nBytesRead = fStream2.Read(buffer, 0, nBlockSize);
1413 if (nBytesRead == 0 || nBytesRead != nBlockSize)
1415 throw new Exception("BLK EOF");
1418 var block = new CBlock(buffer);
1419 var hash = block.header.Hash;
1421 if (blockMap.ContainsKey(hash))
1426 if (!ProcessBlock(ref block))
1428 throw new Exception("Invalid block: " + block.header.Hash);
1431 int nCount = blockMap.Count;
1432 Console.WriteLine("nCount={0}, Hash={1}, NumTx={2}, Time={3}", nCount, block.header.Hash, block.vtx.Length, DateTime.Now);
1443 public void Dispose()
1446 GC.SuppressFinalize(this);
1449 protected virtual void Dispose(bool disposing)
1455 // Free other state (managed objects).
1457 fStreamReadWrite.Dispose();