Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright 2013 Google Inc.
* Copyright 2015 Andreas Schildbach
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.bitcoinj.params;
import java.math.BigInteger;
import java.util.concurrent.TimeUnit;
import org.bitcoinj.core.*;
import org.bitcoinj.utils.MonetaryFormat;
import org.bitcoinj.store.BlockStore;
import org.bitcoinj.store.BlockStoreException;
import org.bitcoinj.utils.MonetaryFormat;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import com.google.common.base.Stopwatch;
import static com.google.common.base.Preconditions.checkState;
/**
* Parameters for Bitcoin-like networks.
*/
public abstract class AbstractBitcoinNetParams extends NetworkParameters {
/**
* Scheme part for Bitcoin URIs.
*/
public static final String BITCOIN_SCHEME = "dash";
private static final Logger log = LoggerFactory.getLogger(AbstractBitcoinNetParams.class);
protected int powDGWHeight;
protected int powKGWHeight;
protected boolean powAllowMinimumDifficulty;
protected boolean powNoRetargeting;
public AbstractBitcoinNetParams() {
super();
}
/**
* Checks if we are at a difficulty transition point.
* @param storedPrev The previous stored block
* @return If this is a difficulty transition point
*/
protected boolean isDifficultyTransitionPoint(StoredBlock storedPrev) {
int height = storedPrev.getHeight();
return isDifficultyTransitionPoint(height);
}
protected boolean isDifficultyTransitionPoint(int height) {
return height >= powKGWHeight || height >= powDGWHeight ? true :
((height + 1) % this.getInterval()) == 0;
}
@Override
public void checkDifficultyTransitions(final StoredBlock storedPrev, final Block nextBlock,
final BlockStore blockStore) throws VerificationException, BlockStoreException {
int height = storedPrev.getHeight() + 1;
if(height >= powDGWHeight) {
DarkGravityWave(storedPrev, nextBlock, blockStore);
} else if(height >= powKGWHeight) {
KimotoGravityWell(storedPrev, nextBlock, blockStore);
} else {
checkDifficultyTransitions_BTC(storedPrev, nextBlock, blockStore);
}
}
public void checkDifficultyTransitions_BTC(final StoredBlock storedPrev, final Block nextBlock,
final BlockStore blockStore) throws VerificationException, BlockStoreException {
if(powNoRetargeting)
return;
Block prev = storedPrev.getHeader();
// Is this supposed to be a difficulty transition point?
if (!isDifficultyTransitionPoint(storedPrev)) {
if(powAllowMinimumDifficulty) {
// On non-difficulty transition points, easy
// blocks are allowed if there has been a span of 5 minutes without one.
final long timeDelta = nextBlock.getTimeSeconds() - prev.getTimeSeconds();
// There is an integer underflow bug in bitcoin-qt that means mindiff blocks are accepted when time
// goes backwards.
if (timeDelta <= NetworkParameters.TARGET_SPACING * 2) {
// Walk backwards until we find a block that doesn't have the easiest proof of work, then check
// that difficulty is equal to that one.
StoredBlock cursor = storedPrev;
while (!cursor.getHeader().equals(getGenesisBlock()) &&
cursor.getHeight() % getInterval() != 0 &&
cursor.getHeader().getDifficultyTargetAsInteger().equals(getMaxTarget()))
cursor = cursor.getPrev(blockStore);
BigInteger cursorTarget = cursor.getHeader().getDifficultyTargetAsInteger();
BigInteger newTarget = nextBlock.getDifficultyTargetAsInteger();
if (!cursorTarget.equals(newTarget))
throw new VerificationException("Testnet block transition that is not allowed: " +
Long.toHexString(cursor.getHeader().getDifficultyTarget()) + " vs " +
Long.toHexString(nextBlock.getDifficultyTarget()));
} else {
if(nextBlock.getDifficultyTarget() != Utils.encodeCompactBits(maxTarget))
throw new VerificationException("Unexpected change in difficulty at height " + storedPrev.getHeight() +
": " + Long.toHexString(Utils.encodeCompactBits(maxTarget)) + " vs " +
Long.toHexString(nextBlock.getDifficultyTarget()));
}
return;
}
// No ... so check the difficulty didn't actually change.
if (nextBlock.getDifficultyTarget() != prev.getDifficultyTarget())
throw new VerificationException("Unexpected change in difficulty at height " + storedPrev.getHeight() +
": " + Long.toHexString(nextBlock.getDifficultyTarget()) + " vs " +
Long.toHexString(prev.getDifficultyTarget()));
return;
}
// We need to find a block far back in the chain. It's OK that this is expensive because it only occurs every
// two weeks after the initial block chain download.
final Stopwatch watch = Stopwatch.createStarted();
StoredBlock cursor = null;
Sha256Hash hash = prev.getHash();
for (int i = 0; i < this.getInterval(); i++) {
cursor = blockStore.get(hash);
if (cursor == null) {
// This should never happen. If it does, it means we are following an incorrect or busted chain.
throw new VerificationException(
"Difficulty transition point but we did not find a way back to the last transition point. Not found: " + hash);
}
hash = cursor.getHeader().getPrevBlockHash();
}
checkState(cursor != null && isDifficultyTransitionPoint(cursor.getHeight() - 1),
"Didn't arrive at a transition point.");
watch.stop();
if (watch.elapsed(TimeUnit.MILLISECONDS) > 50)
log.info("Difficulty transition traversal took {}", watch);
Block blockIntervalAgo = cursor.getHeader();
int timespan = (int) (prev.getTimeSeconds() - blockIntervalAgo.getTimeSeconds());
// Limit the adjustment step.
final int targetTimespan = this.getTargetTimespan();
if (timespan < targetTimespan / 4)
timespan = targetTimespan / 4;
if (timespan > targetTimespan * 4)
timespan = targetTimespan * 4;
BigInteger newTarget = Utils.decodeCompactBits(prev.getDifficultyTarget());
newTarget = newTarget.multiply(BigInteger.valueOf(timespan));
newTarget = newTarget.divide(BigInteger.valueOf(targetTimespan));
verifyDifficulty(storedPrev, nextBlock, newTarget);
}
protected long calculateNextDifficulty(StoredBlock storedBlock, Block nextBlock, BigInteger newTarget) {
if (newTarget.compareTo(this.getMaxTarget()) > 0) {
newTarget = this.getMaxTarget();
}
int accuracyBytes = (int) (nextBlock.getDifficultyTarget() >>> 24) - 3;
// The calculated difficulty is to a higher precision than received, so reduce here.
BigInteger mask = BigInteger.valueOf(0xFFFFFFL).shiftLeft(accuracyBytes * 8);
newTarget = newTarget.and(mask);
return Utils.encodeCompactBits(newTarget);
}
protected void verifyDifficulty(StoredBlock storedPrev, Block nextBlock, BigInteger newTarget) throws VerificationException {
long newTargetCompact = calculateNextDifficulty(storedPrev, nextBlock, newTarget);
long receivedTargetCompact = nextBlock.getDifficultyTarget();
if (newTargetCompact != receivedTargetCompact)
throw new VerificationException("Network provided difficulty bits do not match what was calculated: " +
Long.toHexString(newTargetCompact) + " vs " + Long.toHexString(receivedTargetCompact));
}
public void DarkGravityWave(StoredBlock storedPrev, Block nextBlock,
final BlockStore blockStore) throws VerificationException {
/* current difficulty formula, darkcoin - DarkGravity v3, written by Evan Duffield - [email protected] */
long pastBlocks = 24;
if (storedPrev == null || storedPrev.getHeight() == 0 || storedPrev.getHeight() < pastBlocks) {
verifyDifficulty(storedPrev, nextBlock, getMaxTarget());
return;
}
if(powAllowMinimumDifficulty)
{
// recent block is more than 2 hours old
if (nextBlock.getTimeSeconds() > storedPrev.getHeader().getTimeSeconds() + 2 * 60 * 60) {
verifyDifficulty(storedPrev, nextBlock, getMaxTarget());
return;
}
// recent block is more than 10 minutes old
if (nextBlock.getTimeSeconds() > storedPrev.getHeader().getTimeSeconds() + NetworkParameters.TARGET_SPACING*4) {
BigInteger newTarget = storedPrev.getHeader().getDifficultyTargetAsInteger().multiply(BigInteger.valueOf(10));
verifyDifficulty(storedPrev, nextBlock, newTarget);
return;
}
}
StoredBlock cursor = storedPrev;
BigInteger pastTargetAverage = BigInteger.ZERO;
for(int countBlocks = 1; countBlocks <= pastBlocks; countBlocks++) {
BigInteger target = cursor.getHeader().getDifficultyTargetAsInteger();
if(countBlocks == 1) {
pastTargetAverage = target;
} else {
pastTargetAverage = pastTargetAverage.multiply(BigInteger.valueOf(countBlocks)).add(target).divide(BigInteger.valueOf(countBlocks+1));
}
if(countBlocks != pastBlocks) {
try {
cursor = cursor.getPrev(blockStore);
if(cursor == null) {
//when using checkpoints, the previous block will not exist until 24 blocks are in the store.
return;
}
} catch (BlockStoreException x) {
//when using checkpoints, the previous block will not exist until 24 blocks are in the store.
return;
}
}
}
BigInteger newTarget = pastTargetAverage;
long timespan = storedPrev.getHeader().getTimeSeconds() - cursor.getHeader().getTimeSeconds();
long targetTimespan = pastBlocks*TARGET_SPACING;
if (timespan < targetTimespan/3)
timespan = targetTimespan/3;
if (timespan > targetTimespan*3)
timespan = targetTimespan*3;
// Retarget
newTarget = newTarget.multiply(BigInteger.valueOf(timespan));
newTarget = newTarget.divide(BigInteger.valueOf(targetTimespan));
verifyDifficulty(storedPrev, nextBlock, newTarget);
}
protected void KimotoGravityWell(StoredBlock storedPrev, Block nextBlock, BlockStore blockStore)
throws BlockStoreException, VerificationException {
/* current difficulty formula, megacoin - kimoto gravity well */
StoredBlock BlockLastSolved = storedPrev;
StoredBlock BlockReading = storedPrev;
Block BlockCreating = nextBlock;
long PastBlocksMass = 0;
long PastRateActualSeconds = 0;
long PastRateTargetSeconds = 0;
double PastRateAdjustmentRatio = 1f;
BigInteger PastDifficultyAverage = BigInteger.ZERO;
BigInteger PastDifficultyAveragePrev = BigInteger.ZERO;;
double EventHorizonDeviation;
double EventHorizonDeviationFast;
double EventHorizonDeviationSlow;
long pastSecondsMin = (long)(targetTimespan * 0.025);
long pastSecondsMax = targetTimespan * 7;
long PastBlocksMin = pastSecondsMin / TARGET_SPACING;
long PastBlocksMax = pastSecondsMax / TARGET_SPACING;
if (BlockLastSolved == null || BlockLastSolved.getHeight() == 0 || (long)BlockLastSolved.getHeight() < PastBlocksMin)
{
verifyDifficulty(storedPrev, nextBlock, getMaxTarget());
}
for (int i = 1; BlockReading != null && BlockReading.getHeight() > 0; i++) {
if (PastBlocksMax > 0 && i > PastBlocksMax) { break; }
PastBlocksMass++;
if (i == 1) { PastDifficultyAverage = BlockReading.getHeader().getDifficultyTargetAsInteger(); }
else { PastDifficultyAverage = ((BlockReading.getHeader().getDifficultyTargetAsInteger().subtract(PastDifficultyAveragePrev)).divide(BigInteger.valueOf(i)).add(PastDifficultyAveragePrev)); }
PastDifficultyAveragePrev = PastDifficultyAverage;
PastRateActualSeconds = BlockLastSolved.getHeader().getTimeSeconds() - BlockReading.getHeader().getTimeSeconds();
PastRateTargetSeconds = TARGET_SPACING * PastBlocksMass;
PastRateAdjustmentRatio = 1.0f;
if (PastRateActualSeconds < 0) { PastRateActualSeconds = 0; }
if (PastRateActualSeconds != 0 && PastRateTargetSeconds != 0) {
PastRateAdjustmentRatio = (double)PastRateTargetSeconds / PastRateActualSeconds;
}
EventHorizonDeviation = 1 + (0.7084 * java.lang.Math.pow((Double.valueOf(PastBlocksMass)/Double.valueOf(28.2)), -1.228));
EventHorizonDeviationFast = EventHorizonDeviation;
EventHorizonDeviationSlow = 1 / EventHorizonDeviation;
if (PastBlocksMass >= PastBlocksMin) {
if ((PastRateAdjustmentRatio <= EventHorizonDeviationSlow) || (PastRateAdjustmentRatio >= EventHorizonDeviationFast))
{
break;
}
}
StoredBlock BlockReadingPrev = blockStore.get(BlockReading.getHeader().getPrevBlockHash());
if (BlockReadingPrev == null)
{
//Since we are using the checkpoint system, there may not be enough blocks to do this diff adjust,
//so skip until we do
return;
}
BlockReading = BlockReadingPrev;
}
BigInteger newDifficulty = PastDifficultyAverage;
if (PastRateActualSeconds != 0 && PastRateTargetSeconds != 0) {
newDifficulty = newDifficulty.multiply(BigInteger.valueOf(PastRateActualSeconds));
newDifficulty = newDifficulty.divide(BigInteger.valueOf(PastRateTargetSeconds));
}
if (newDifficulty.compareTo(getMaxTarget()) > 0) {
log.info("Difficulty hit proof of work limit: {}", newDifficulty.toString(16));
newDifficulty = getMaxTarget();
}
verifyDifficulty(storedPrev, nextBlock, newDifficulty);
}
@Override
public Coin getMaxMoney() {
return MAX_MONEY;
}
@Override
public Coin getMinNonDustOutput() {
return Transaction.MIN_NONDUST_OUTPUT;
}
@Override
public MonetaryFormat getMonetaryFormat() {
return new MonetaryFormat();
}
@Override
public int getProtocolVersionNum(final ProtocolVersion version) {
return version.getBitcoinProtocolVersion();
}
@Override
public BitcoinSerializer getSerializer(boolean parseRetain) {
return new BitcoinSerializer(this, parseRetain);
}
@Override
public BitcoinSerializer getSerializer(boolean parseRetain, int protocolVersion) {
return new BitcoinSerializer(this, parseRetain, protocolVersion);
}
@Override
public String getUriScheme() {
return BITCOIN_SCHEME;
}
@Override
public boolean hasMaxMoney() {
return true;
}
}
