# Ppc:pow区块产出与其难度的关系

PPC:POW区块产出与其难度的关系

Code:
static const int64 MAX_MINT_PROOF_OF_WORK = 9999 * COIN;
CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;

``````// ppcoin: subsidy is cut in half every 16x multiply of difficulty
// A reasonably continuous curve is used to avoid shock to market
// (nSubsidyLimit / nSubsidy) ** 4 == bnProofOfWorkLimit / bnTarget
CBigNum bnLowerBound = CENT;
CBigNum bnUpperBound = bnSubsidyLimit;

while (bnLowerBound + CENT <= bnUpperBound)
{
// changes bnLowerBound and bnUpperBound to converge against bnMidValue
// exists when bnUpperBound is within 1 CENT of bnLowerBound
}

int64 nSubsidy = bnUpperBound.getuint64();
nSubsidy = (nSubsidy / CENT) * CENT;
``````

10 5,622
100 3,161
1K 1,778
10K 999.9
100K 562
1M 316
10M 177
100M 99.99
1G 56
10G 31
100G 17
（译者注：从上表可以看出，当PPC难度到达1亿时，区块产出将下降到2位数。）

# 结论：

1. 难度上升，产出下降。在BTC里，越来越多人涌入来争夺同一块蛋糕；但在PPC网络里，越来越多人进入去争夺一个越来越小的蛋糕。
2. PoW块与PoS块之间的竞争(但是，我还不清楚这种竞争如何实现的）如果你持币的话，PoS区块基本上是0成本。例如，如果我持有1，000 PPC长达30天，我在找到区块的优先度上就会领先其它30，000倍。（译者注：这句话可能理解得不准确。原文是：E.g. if I have 1000 PPC and use it after 30 days, that gives me an 30000x advantage in meeting difficulty）
Code:

if (CBigNum(Hash(ss.begin(), ss.end())) <= bnCoinDay * bnTargetPerCoinDay)
return true;

## 原帖地址：https://bitcointalk.org/index.php?topic=110039.msg1196846#msg1196846

（欢迎转载，转载时请保留以上信息，并注明出处）