using System.Collections.Generic;
using System.Diagnostics.Contracts;
using System.IO;
-using System.Numerics;
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;
// Check proof-of-stake block signature
if (fCheckSig && !SignatureOK)
{
- return false;
+ return false; // Proof-of-Stake signature checking failure.
}
if (!vtx[1].CheckTransaction())
return true;
}
- private bool CheckProofOfWork(uint256 hash, uint nBits)
+ private static bool CheckProofOfWork(uint256 hash, uint nBits)
{
uint256 nTarget = new uint256();
nTarget.Compact = nBits;
/// <summary>
/// Serialized size
/// </summary>
- 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;
}
/// </summary>
/// <param name="nTx">Transaction index.</param>
/// <returns>Offset in bytes from the beginning of block header.</returns>
- public int GetTxOffset(int nTx)
+ public uint GetTxOffset(int nTx)
{
Contract.Requires<ArgumentException>(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++)
{
/// <param name="nBits">Packed difficulty representation.</param>
/// <param name="nFees">Amount of fees.</param>
/// <returns>Reward value.</returns>
- public static ulong GetProofOfWorkReward(uint nBits, ulong nFees)
+ public static long GetProofOfWorkReward(uint nBits, long nFees)
{
// NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
// A reasonably continuous curve is used to avoid shock to market
//
// Please note that we're using bisection to find an approximate solutuion
- BigInteger bnSubsidyLimit = NetInfo.nMaxMintProofOfWork;
uint256 nTarget = 0;
nTarget.Compact = nBits;
- BigInteger bnTarget = new BigInteger(nTarget);
- BigInteger bnTargetLimit = new BigInteger(NetInfo.nProofOfWorkLimit);
+ BigNum bnTarget = nTarget;
+ BigNum bnTargetLimit = NetInfo.nProofOfWorkLimit;
- BigInteger bnLowerBound = CTransaction.nCent;
- BigInteger bnUpperBound = bnSubsidyLimit;
+ BigNum bnSubsidyLimit = NetInfo.nMaxMintProofOfWork;
+ BigNum bnLowerBound = CTransaction.nCent;
+ BigNum bnUpperBound = bnSubsidyLimit;
while (bnLowerBound + CTransaction.nCent <= bnUpperBound)
{
- BigInteger bnMidValue = (bnLowerBound + bnUpperBound) / 2;
+ 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 = (ulong)bnUpperBound;
+ long nSubsidy = bnUpperBound;
nSubsidy = (nSubsidy / CTransaction.nCent) * CTransaction.nCent;
-
return Math.Min(nSubsidy, NetInfo.nMaxMintProofOfWork) + nFees;
}
- }
+
+ public static long GetProofOfStakeReward(long nCoinAge, uint nBits, uint nTime)
+ {
+ // Second stage of emission process is mostly PoS-based.
+
+ long nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * CTransaction.nCoin;
+ // Base stake mint rate, 100% year interest
+ BigNum bnRewardCoinYearLimit = NetInfo.nMaxMintProofOfStake;
+
+ uint256 nTarget = 0;
+ nTarget.Compact = nBits;
+
+ BigNum bnTarget = nTarget;
+ BigNum bnTargetLimit = NetInfo.GetProofOfStakeLimit(0, nTime);
+
+ // 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;
+
+ // 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);
+
+ nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
+
+ // Set reasonable reward limit for large inputs
+ // This will stimulate large holders to use smaller inputs, that's good
+ // for the network protection
+ return Math.Min(nSubsidy, nSubsidyLimit);
+ }
+
+ public Tuple<COutPoint, uint> ProofOfStake
+ {
+ get { return IsProofOfStake ? new Tuple<COutPoint, uint>(vtx[1].vin[0].prevout, vtx[1].nTime) : new Tuple<COutPoint, uint>(new COutPoint(), 0); }
+ }
+
+}
}