X-Git-Url: https://git.novaco.in/?a=blobdiff_plain;f=Novacoin%2FCBlock.cs;h=fba13877e372eeedd545f282fdda1dec5e5f5ba2;hb=1e2160be4bf5122f8bbea1c493df9a26be91e4cf;hp=4c878064eb6e135ca829288501bd60519560dc2d;hpb=be9d844557911f95165d2c9875c4f5b2822cfc92;p=NovacoinLibrary.git diff --git a/Novacoin/CBlock.cs b/Novacoin/CBlock.cs index 4c87806..fba1387 100644 --- a/Novacoin/CBlock.cs +++ b/Novacoin/CBlock.cs @@ -20,6 +20,7 @@ using System; using System.Text; using System.Collections.Generic; using System.Diagnostics.Contracts; +using System.IO; namespace Novacoin { @@ -46,6 +47,16 @@ namespace Novacoin /// public class CBlock { + /// + /// Maximum block size is 1Mb. + /// + public const uint nMaxBlockSize = 1000000; + + /// + /// Sanity threshold for amount of sigops. + /// + public const uint nMaxSigOps = 20000; + /// /// Block header. /// @@ -87,16 +98,19 @@ namespace Novacoin { try { - ByteQueue wBytes = new ByteQueue(ref blockBytes); + var stream = new MemoryStream(blockBytes); + var reader = new BinaryReader(stream); // Fill the block header fields - header = new CBlockHeader(wBytes.Get(80)); + header = new CBlockHeader(ref reader); // Parse transactions list - vtx = CTransaction.ReadTransactionsList(ref wBytes); + vtx = CTransaction.ReadTransactionsList(ref reader); // Read block signature - signature = wBytes.Get((int)wBytes.GetVarInt()); + signature = reader.ReadBytes((int)VarInt.ReadVarInt(ref reader)); + + reader.Close(); } catch (Exception e) { @@ -114,11 +128,11 @@ namespace Novacoin public bool CheckBlock(bool fCheckPOW = true, bool fCheckMerkleRoot = true, bool fCheckSig = true) { - var uniqueTX = new List(); // tx hashes + var uniqueTX = new List(); // tx hashes uint nSigOps = 0; // total sigops // Basic sanity checkings - if (vtx.Length == 0 || Size > 1000000) + if (vtx.Length == 0 || Size > nMaxBlockSize) { return false; } @@ -150,7 +164,7 @@ namespace Novacoin return false; } - // Coinbase output should be empty if proof-of-stake block + // Coinbase output must be empty if proof-of-stake block if (vtx[0].vout.Length != 1 || !vtx[0].vout[0].IsEmpty) { return false; @@ -165,7 +179,7 @@ namespace Novacoin // Check proof-of-stake block signature if (fCheckSig && !SignatureOK) { - return false; + return false; // Proof-of-Stake signature checking failure. } if (!vtx[1].CheckTransaction()) @@ -185,13 +199,13 @@ namespace Novacoin } // Check timestamp - if (header.nTime > NetUtils.FutureDrift(NetUtils.GetAdjustedTime())) + if (header.nTime > NetInfo.FutureDrift(NetInfo.GetAdjustedTime())) { return false; } // Check coinbase timestamp - if (header.nTime < NetUtils.PastDrift(vtx[0].nTime)) + if (header.nTime < NetInfo.PastDrift(vtx[0].nTime)) { return false; } @@ -241,7 +255,7 @@ namespace Novacoin } // Reject block if validation would consume too much resources. - if (nSigOps > 50000) + if (nSigOps > nMaxSigOps) { return false; } @@ -255,9 +269,24 @@ namespace Novacoin return true; } - private bool CheckProofOfWork(ScryptHash256 hash, uint nBits) + private static bool CheckProofOfWork(uint256 hash, uint nBits) { - // TODO: stub! + uint256 nTarget = new uint256(); + nTarget.Compact = nBits; + + // Check range + if (nTarget > NetInfo.nProofOfWorkLimit) + { + // nBits below minimum work + return false; + } + + // Check proof of work matches claimed amount + if (hash > nTarget) + { + // hash doesn't match nBits + return false; + } return true; } @@ -328,37 +357,42 @@ namespace Novacoin /// Byte sequence public static implicit operator byte[] (CBlock b) { - var r = new List(); + var stream = new MemoryStream(); + var writer = new BinaryWriter(stream); - r.AddRange((byte[])b.header); - r.AddRange(VarInt.EncodeVarInt(b.vtx.LongLength)); // transactions count + writer.Write(b.header); + writer.Write(VarInt.EncodeVarInt(b.vtx.LongLength)); foreach (var tx in b.vtx) { - r.AddRange((byte[])tx); + writer.Write(tx); } - r.AddRange(VarInt.EncodeVarInt(b.signature.LongLength)); - r.AddRange(b.signature); + writer.Write(VarInt.EncodeVarInt(b.signature.LongLength)); + writer.Write(b.signature); + + var resultBytes = stream.ToArray(); - return r.ToArray(); + writer.Close(); + + return resultBytes; } /// /// Serialized size /// - public int Size + public uint Size { get { - int nSize = 80 + VarInt.GetEncodedSize(vtx.Length); // CBlockHeader + NumTx + uint nSize = 80 + VarInt.GetEncodedSize(vtx.Length); // CBlockHeader + NumTx foreach (var tx in vtx) { nSize += tx.Size; } - nSize += VarInt.GetEncodedSize(signature.Length) + signature.Length; + nSize += VarInt.GetEncodedSize(signature.Length) + (uint)signature.Length; return nSize; } @@ -369,11 +403,11 @@ namespace Novacoin /// /// Transaction index. /// Offset in bytes from the beginning of block header. - public int GetTxOffset(int nTx) + public uint GetTxOffset(int nTx) { Contract.Requires(nTx >= 0 && nTx < vtx.Length, "Transaction index you've specified is incorrect."); - int nOffset = 80 + VarInt.GetEncodedSize(vtx.Length); // CBlockHeader + NumTx + uint nOffset = 80 + VarInt.GetEncodedSize(vtx.Length); // CBlockHeader + NumTx for (int i = 0; i < nTx; i++) { @@ -386,7 +420,7 @@ namespace Novacoin /// /// Merkle root /// - public Hash256 hashMerkleRoot + public uint256 hashMerkleRoot { get { @@ -394,7 +428,7 @@ namespace Novacoin foreach (var tx in vtx) { - merkleTree.AddRange(Hash256.ComputeRaw256(tx)); + merkleTree.AddRange(CryptoUtils.ComputeHash256(tx)); } int levelOffset = 0; @@ -407,12 +441,12 @@ namespace Novacoin var left = merkleTree.GetRange((levelOffset + nLeft) * 32, 32).ToArray(); var right = merkleTree.GetRange((levelOffset + nRight) * 32, 32).ToArray(); - merkleTree.AddRange(Hash256.ComputeRaw256(ref left, ref right)); + merkleTree.AddRange(CryptoUtils.ComputeHash256(ref left, ref right)); } levelOffset += nLevelSize; } - return (merkleTree.Count == 0) ? new Hash256() : new Hash256(merkleTree.GetRange(merkleTree.Count-32, 32).ToArray()); + return (merkleTree.Count == 0) ? 0 : (uint256)merkleTree.GetRange(merkleTree.Count-32, 32).ToArray(); } } @@ -436,6 +470,130 @@ namespace Novacoin return sb.ToString(); } - } + + /// + /// Calculate proof-of-work reward. + /// + /// Packed difficulty representation. + /// Amount of fees. + /// Reward value. + public static ulong GetProofOfWorkReward(uint nBits, ulong nFees) + { + // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty + // A reasonably continuous curve is used to avoid shock to market + // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget + // + // Human readable form: + // + // nSubsidy = 100 / (diff ^ 1/6) + // + // Please note that we're using bisection to find an approximate solutuion + + + uint256 nTarget = 0; + nTarget.Compact = nBits; + + BigNum bnTarget = nTarget; + BigNum bnTargetLimit = NetInfo.nProofOfWorkLimit; + + BigNum bnSubsidyLimit = NetInfo.nMaxMintProofOfWork; + BigNum bnLowerBound = CTransaction.nCent; + BigNum bnUpperBound = bnSubsidyLimit; + + while (bnLowerBound + CTransaction.nCent <= bnUpperBound) + { + BigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2; + if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget) + bnUpperBound = bnMidValue; + else + bnLowerBound = bnMidValue; + } + + ulong nSubsidy = bnUpperBound; + nSubsidy = (nSubsidy / CTransaction.nCent) * CTransaction.nCent; + + return Math.Min(nSubsidy, NetInfo.nMaxMintProofOfWork) + nFees; + } + + public static ulong GetProofOfStakeReward(ulong nCoinAge, uint nBits, uint nTime) + { + ulong nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * CTransaction.nCoin; + + if (nTime > NetInfo.nDynamicStakeRewardTime) + { + // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013. + + BigNum bnRewardCoinYearLimit = NetInfo.nMaxMintProofOfStake; // Base stake mint rate, 100% year interest + + uint256 nTarget = 0; + nTarget.Compact = nBits; + + BigNum bnTarget = nTarget; + BigNum bnTargetLimit = NetInfo.GetProofOfStakeLimit(0, nTime); + + // NovaCoin: A reasonably continuous curve is used to avoid shock to market + + BigNum bnLowerBound = CTransaction.nCent, // Lower interest bound is 1% per year + bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year + bnMidPart, bnRewardPart; + + while (bnLowerBound + CTransaction.nCent <= bnUpperBound) + { + BigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2; + if (nTime < NetInfo.nStakeCurveSwitchTime) + { + // + // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty + // + // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget + // + // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6) + // + + bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue; + bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit; + } + else + { + // + // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty + // + // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget + // + // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3) + // + + bnMidPart = bnMidValue * bnMidValue * bnMidValue; + bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit; + } + + if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget) + bnUpperBound = bnMidValue; + else + bnLowerBound = bnMidValue; + } + + nRewardCoinYear = bnUpperBound; + nRewardCoinYear = Math.Min((nRewardCoinYear / CTransaction.nCent) * CTransaction.nCent, NetInfo.nMaxMintProofOfStake); + } + else + { + // Old creation amount per coin-year, 5% fixed stake mint rate + nRewardCoinYear = 5 * CTransaction.nCent; + } + + nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8); + + // Set reasonable reward limit for large inputs since 20 Oct 2013 + // + // This will stimulate large holders to use smaller inputs, that's good for the network protection + if (NetInfo.nStakeCurveSwitchTime < nTime) + { + nSubsidy = Math.Min(nSubsidy, nSubsidyLimit); + } + + return nSubsidy; + } + } }