792 lines
17 KiB
JavaScript
792 lines
17 KiB
JavaScript
/*!
|
|
* template.js - block template object for bcoin
|
|
* Copyright (c) 2014-2015, Fedor Indutny (MIT License)
|
|
* Copyright (c) 2014-2017, Christopher Jeffrey (MIT License).
|
|
* https://github.com/bcoin-org/bcoin
|
|
*/
|
|
|
|
'use strict';
|
|
|
|
const assert = require('assert');
|
|
const bio = require('bufio');
|
|
const hash256 = require('bcrypto/lib/hash256');
|
|
const merkle = require('bcrypto/lib/merkle');
|
|
const util = require('../utils/util');
|
|
const Address = require('../primitives/address');
|
|
const TX = require('../primitives/tx');
|
|
const Block = require('../primitives/block');
|
|
const Input = require('../primitives/input');
|
|
const Output = require('../primitives/output');
|
|
const consensus = require('../protocol/consensus');
|
|
const policy = require('../protocol/policy');
|
|
const CoinView = require('../coins/coinview');
|
|
const Script = require('../script/script');
|
|
const common = require('./common');
|
|
const {encoding} = bio;
|
|
const DUMMY = Buffer.alloc(0);
|
|
|
|
/**
|
|
* Block Template
|
|
* @alias module:mining.BlockTemplate
|
|
*/
|
|
|
|
class BlockTemplate {
|
|
/**
|
|
* Create a block template.
|
|
* @constructor
|
|
* @param {Object} options
|
|
*/
|
|
|
|
constructor(options) {
|
|
this.prevBlock = encoding.NULL_HASH;
|
|
this.version = 1;
|
|
this.height = 0;
|
|
this.time = 0;
|
|
this.bits = 0;
|
|
this.target = encoding.ZERO_HASH;
|
|
this.locktime = 0;
|
|
this.mtp = 0;
|
|
this.flags = 0;
|
|
this.coinbaseFlags = DUMMY;
|
|
this.witness = false;
|
|
this.address = new Address();
|
|
this.sigops = 400;
|
|
this.weight = 4000;
|
|
this.interval = 210000;
|
|
this.fees = 0;
|
|
this.tree = new MerkleTree();
|
|
this.commitment = encoding.ZERO_HASH;
|
|
this.left = DUMMY;
|
|
this.right = DUMMY;
|
|
this.items = [];
|
|
|
|
if (options)
|
|
this.fromOptions(options);
|
|
}
|
|
|
|
/**
|
|
* Inject properties from options.
|
|
* @private
|
|
* @param {Object} options
|
|
* @returns {BlockTemplate}
|
|
*/
|
|
|
|
fromOptions(options) {
|
|
assert(options);
|
|
|
|
if (options.prevBlock != null) {
|
|
assert(typeof options.prevBlock === 'string');
|
|
this.prevBlock = options.prevBlock;
|
|
}
|
|
|
|
if (options.version != null) {
|
|
assert(typeof options.version === 'number');
|
|
this.version = options.version;
|
|
}
|
|
|
|
if (options.height != null) {
|
|
assert(typeof options.height === 'number');
|
|
this.height = options.height;
|
|
}
|
|
|
|
if (options.time != null) {
|
|
assert(typeof options.time === 'number');
|
|
this.time = options.time;
|
|
}
|
|
|
|
if (options.bits != null)
|
|
this.setBits(options.bits);
|
|
|
|
if (options.target != null)
|
|
this.setTarget(options.target);
|
|
|
|
if (options.locktime != null) {
|
|
assert(typeof options.locktime === 'number');
|
|
this.locktime = options.locktime;
|
|
}
|
|
|
|
if (options.mtp != null) {
|
|
assert(typeof options.mtp === 'number');
|
|
this.mtp = options.mtp;
|
|
}
|
|
|
|
if (options.flags != null) {
|
|
assert(typeof options.flags === 'number');
|
|
this.flags = options.flags;
|
|
}
|
|
|
|
if (options.coinbaseFlags != null) {
|
|
assert(Buffer.isBuffer(options.coinbaseFlags));
|
|
this.coinbaseFlags = options.coinbaseFlags;
|
|
}
|
|
|
|
if (options.witness != null) {
|
|
assert(typeof options.witness === 'boolean');
|
|
this.witness = options.witness;
|
|
}
|
|
|
|
if (options.address != null)
|
|
this.address.fromOptions(options.address);
|
|
|
|
if (options.sigops != null) {
|
|
assert(typeof options.sigops === 'number');
|
|
this.sigops = options.sigops;
|
|
}
|
|
|
|
if (options.weight != null) {
|
|
assert(typeof options.weight === 'number');
|
|
this.weight = options.weight;
|
|
}
|
|
|
|
if (options.interval != null) {
|
|
assert(typeof options.interval === 'number');
|
|
this.interval = options.interval;
|
|
}
|
|
|
|
if (options.fees != null) {
|
|
assert(typeof options.fees === 'number');
|
|
this.fees = options.fees;
|
|
}
|
|
|
|
if (options.items != null) {
|
|
assert(Array.isArray(options.items));
|
|
this.items = options.items;
|
|
}
|
|
|
|
return this;
|
|
}
|
|
|
|
/**
|
|
* Instantiate block template from options.
|
|
* @param {Object} options
|
|
* @returns {BlockTemplate}
|
|
*/
|
|
|
|
static fromOptions(options) {
|
|
return new this().fromOptions(options);
|
|
}
|
|
|
|
/**
|
|
* Create witness commitment hash.
|
|
* @returns {Buffer}
|
|
*/
|
|
|
|
getWitnessHash() {
|
|
const nonce = encoding.ZERO_HASH;
|
|
const leaves = [];
|
|
|
|
leaves.push(encoding.ZERO_HASH);
|
|
|
|
for (const {tx} of this.items)
|
|
leaves.push(tx.witnessHash());
|
|
|
|
const [root, malleated] = merkle.createRoot(hash256, leaves);
|
|
|
|
assert(!malleated);
|
|
|
|
return hash256.root(root, nonce);
|
|
}
|
|
|
|
/**
|
|
* Create witness commitment script.
|
|
* @returns {Script}
|
|
*/
|
|
|
|
getWitnessScript() {
|
|
return Script.fromCommitment(this.commitment);
|
|
}
|
|
|
|
/**
|
|
* Set the target (bits).
|
|
* @param {Number} bits
|
|
*/
|
|
|
|
setBits(bits) {
|
|
assert(typeof bits === 'number');
|
|
this.bits = bits;
|
|
this.target = common.getTarget(bits);
|
|
}
|
|
|
|
/**
|
|
* Set the target (uint256le).
|
|
* @param {Buffer} target
|
|
*/
|
|
|
|
setTarget(target) {
|
|
assert(Buffer.isBuffer(target));
|
|
this.bits = common.getBits(target);
|
|
this.target = target;
|
|
}
|
|
|
|
/**
|
|
* Calculate the block reward.
|
|
* @returns {Amount}
|
|
*/
|
|
|
|
getReward() {
|
|
const reward = consensus.getReward(this.height, this.interval);
|
|
return reward + this.fees;
|
|
}
|
|
|
|
/**
|
|
* Initialize the default coinbase.
|
|
* @param {Buffer} hash - Witness commitment hash.
|
|
* @returns {TX}
|
|
*/
|
|
|
|
createCoinbase(hash) {
|
|
const scale = consensus.WITNESS_SCALE_FACTOR;
|
|
const cb = new TX();
|
|
|
|
// Coinbase input.
|
|
const input = new Input();
|
|
|
|
// Height (required in v2+ blocks)
|
|
input.script.pushInt(this.height);
|
|
|
|
// Coinbase flags.
|
|
input.script.pushData(Buffer.alloc(20, 0x00));
|
|
|
|
// Smaller nonce for good measure.
|
|
const nonce = Buffer.allocUnsafe(4);
|
|
nonce.writeUInt32LE(Math.random() * 0x100000000, 0, true);
|
|
input.script.pushData(nonce);
|
|
|
|
// Extra nonce: incremented when
|
|
// the nonce overflows.
|
|
input.script.pushData(Buffer.alloc(8, 0x00));
|
|
|
|
input.script.compile();
|
|
|
|
// Set up the witness nonce.
|
|
if (this.witness) {
|
|
input.witness.push(encoding.ZERO_HASH);
|
|
input.witness.compile();
|
|
}
|
|
|
|
cb.inputs.push(input);
|
|
|
|
// Reward output.
|
|
const output = new Output();
|
|
output.script.fromPubkeyhash(Buffer.alloc(20, 0x00));
|
|
output.value = this.getReward();
|
|
|
|
cb.outputs.push(output);
|
|
|
|
// If we're using segwit, we
|
|
// need to set up the commitment.
|
|
if (this.witness) {
|
|
// Commitment output.
|
|
const commit = new Output();
|
|
commit.script.fromCommitment(hash);
|
|
cb.outputs.push(commit);
|
|
}
|
|
|
|
// Padding for the CB height (constant size).
|
|
const op = input.script.get(0);
|
|
assert(op);
|
|
const padding = 5 - op.getSize();
|
|
assert(padding >= 0);
|
|
|
|
// Reserved size.
|
|
// Without segwit:
|
|
// CB weight = 500
|
|
// CB stripped size = 125
|
|
// CB size = 125
|
|
// Sigops cost = 4
|
|
// With segwit:
|
|
// CB weight = 724
|
|
// CB stripped size = 172
|
|
// CB size = 208
|
|
// Sigops cost = 4
|
|
if (!this.witness) {
|
|
assert.strictEqual(cb.getWeight() + padding * scale, 500);
|
|
assert.strictEqual(cb.getBaseSize() + padding, 125);
|
|
assert.strictEqual(cb.getSize() + padding, 125);
|
|
} else {
|
|
assert.strictEqual(cb.getWeight() + padding * scale, 724);
|
|
assert.strictEqual(cb.getBaseSize() + padding, 172);
|
|
assert.strictEqual(cb.getSize() + padding, 208);
|
|
}
|
|
|
|
// Setup coinbase flags (variable size).
|
|
input.script.setData(1, this.coinbaseFlags);
|
|
input.script.compile();
|
|
|
|
// Setup output script (variable size).
|
|
output.script.fromAddress(this.address);
|
|
|
|
cb.refresh();
|
|
|
|
assert(input.script.getSize() <= 100,
|
|
'Coinbase input script is too large!');
|
|
|
|
return cb;
|
|
}
|
|
|
|
/**
|
|
* Refresh the coinbase and merkle tree.
|
|
*/
|
|
|
|
refresh() {
|
|
const hash = this.getWitnessHash();
|
|
const cb = this.createCoinbase(hash);
|
|
const raw = cb.toNormal();
|
|
let size = 0;
|
|
|
|
size += 4; // version
|
|
size += 1; // varint inputs length
|
|
size += cb.inputs[0].getSize(); // input size
|
|
size -= 4 + 4 + 4; // -(nonce1 + nonce2 + sequence)
|
|
|
|
// Cut off right after the nonce
|
|
// push and before the sequence.
|
|
const left = raw.slice(0, size);
|
|
|
|
// Include the sequence.
|
|
size += 4 + 4; // nonce1 + nonce2
|
|
const right = raw.slice(size);
|
|
|
|
this.commitment = hash;
|
|
this.left = left;
|
|
this.right = right;
|
|
this.tree = MerkleTree.fromItems(this.items);
|
|
}
|
|
|
|
/**
|
|
* Get raw coinbase with desired nonces.
|
|
* @param {Number} nonce1
|
|
* @param {Number} nonce2
|
|
* @returns {Buffer}
|
|
*/
|
|
|
|
getRawCoinbase(nonce1, nonce2) {
|
|
let size = 0;
|
|
|
|
size += this.left.length;
|
|
size += 4 + 4;
|
|
size += this.right.length;
|
|
|
|
const bw = bio.write(size);
|
|
bw.writeBytes(this.left);
|
|
bw.writeU32BE(nonce1);
|
|
bw.writeU32BE(nonce2);
|
|
bw.writeBytes(this.right);
|
|
|
|
return bw.render();
|
|
}
|
|
|
|
/**
|
|
* Calculate the merkle root with given nonces.
|
|
* @param {Number} nonce1
|
|
* @param {Number} nonce2
|
|
* @returns {Buffer}
|
|
*/
|
|
|
|
getRoot(nonce1, nonce2) {
|
|
const raw = this.getRawCoinbase(nonce1, nonce2);
|
|
const hash = hash256.digest(raw);
|
|
return this.tree.withFirst(hash);
|
|
}
|
|
|
|
/**
|
|
* Create raw block header with given parameters.
|
|
* @param {Buffer} root
|
|
* @param {Number} time
|
|
* @param {Number} nonce
|
|
* @returns {Buffer}
|
|
*/
|
|
|
|
getHeader(root, time, nonce) {
|
|
const bw = bio.write(80);
|
|
|
|
bw.writeU32(this.version);
|
|
bw.writeHash(this.prevBlock);
|
|
bw.writeHash(root);
|
|
bw.writeU32(time);
|
|
bw.writeU32(this.bits);
|
|
bw.writeU32(nonce);
|
|
|
|
return bw.render();
|
|
}
|
|
|
|
/**
|
|
* Calculate proof with given parameters.
|
|
* @param {Number} nonce1
|
|
* @param {Number} nonce2
|
|
* @param {Number} time
|
|
* @param {Number} nonce
|
|
* @returns {BlockProof}
|
|
*/
|
|
|
|
getProof(nonce1, nonce2, time, nonce) {
|
|
const root = this.getRoot(nonce1, nonce2);
|
|
const data = this.getHeader(root, time, nonce);
|
|
const hash = hash256.digest(data);
|
|
return new BlockProof(hash, root, nonce1, nonce2, time, nonce);
|
|
}
|
|
|
|
/**
|
|
* Create coinbase from given parameters.
|
|
* @param {Number} nonce1
|
|
* @param {Number} nonce2
|
|
* @returns {TX}
|
|
*/
|
|
|
|
getCoinbase(nonce1, nonce2) {
|
|
const raw = this.getRawCoinbase(nonce1, nonce2);
|
|
const tx = TX.fromRaw(raw);
|
|
|
|
if (this.witness) {
|
|
const input = tx.inputs[0];
|
|
input.witness.push(encoding.ZERO_HASH);
|
|
input.witness.compile();
|
|
tx.refresh();
|
|
}
|
|
|
|
return tx;
|
|
}
|
|
|
|
/**
|
|
* Create block from calculated proof.
|
|
* @param {BlockProof} proof
|
|
* @returns {Block}
|
|
*/
|
|
|
|
commit(proof) {
|
|
const root = proof.root;
|
|
const n1 = proof.nonce1;
|
|
const n2 = proof.nonce2;
|
|
const time = proof.time;
|
|
const nonce = proof.nonce;
|
|
const block = new Block();
|
|
|
|
block.version = this.version;
|
|
block.prevBlock = this.prevBlock;
|
|
block.merkleRoot = root.toString('hex');
|
|
block.time = time;
|
|
block.bits = this.bits;
|
|
block.nonce = nonce;
|
|
|
|
const tx = this.getCoinbase(n1, n2);
|
|
|
|
block.txs.push(tx);
|
|
|
|
for (const item of this.items)
|
|
block.txs.push(item.tx);
|
|
|
|
return block;
|
|
}
|
|
|
|
/**
|
|
* Quick and dirty way to
|
|
* get a coinbase tx object.
|
|
* @returns {TX}
|
|
*/
|
|
|
|
toCoinbase() {
|
|
return this.getCoinbase(0, 0);
|
|
}
|
|
|
|
/**
|
|
* Quick and dirty way to get a block
|
|
* object (most likely to be an invalid one).
|
|
* @returns {Block}
|
|
*/
|
|
|
|
toBlock() {
|
|
const proof = this.getProof(0, 0, this.time, 0);
|
|
return this.commit(proof);
|
|
}
|
|
|
|
/**
|
|
* Calculate the target difficulty.
|
|
* @returns {Number}
|
|
*/
|
|
|
|
getDifficulty() {
|
|
return common.getDifficulty(this.target);
|
|
}
|
|
|
|
/**
|
|
* Set the reward output
|
|
* address and refresh.
|
|
* @param {Address} address
|
|
*/
|
|
|
|
setAddress(address) {
|
|
this.address = new Address(address);
|
|
this.refresh();
|
|
}
|
|
|
|
/**
|
|
* Add a transaction to the template.
|
|
* @param {TX} tx
|
|
* @param {CoinView} view
|
|
*/
|
|
|
|
addTX(tx, view) {
|
|
assert(!tx.mutable, 'Cannot add mutable TX to block.');
|
|
|
|
const item = BlockEntry.fromTX(tx, view, this);
|
|
const weight = item.tx.getWeight();
|
|
const sigops = item.sigops;
|
|
|
|
if (!tx.isFinal(this.height, this.locktime))
|
|
return false;
|
|
|
|
if (this.weight + weight > consensus.MAX_BLOCK_WEIGHT)
|
|
return false;
|
|
|
|
if (this.sigops + sigops > consensus.MAX_BLOCK_SIGOPS_COST)
|
|
return false;
|
|
|
|
if (!this.witness && tx.hasWitness())
|
|
return false;
|
|
|
|
this.weight += weight;
|
|
this.sigops += sigops;
|
|
this.fees += item.fee;
|
|
|
|
// Add the tx to our block
|
|
this.items.push(item);
|
|
|
|
return true;
|
|
}
|
|
|
|
/**
|
|
* Add a transaction to the template
|
|
* (less verification than addTX).
|
|
* @param {TX} tx
|
|
* @param {CoinView?} view
|
|
*/
|
|
|
|
pushTX(tx, view) {
|
|
assert(!tx.mutable, 'Cannot add mutable TX to block.');
|
|
|
|
if (!view)
|
|
view = new CoinView();
|
|
|
|
const item = BlockEntry.fromTX(tx, view, this);
|
|
const weight = item.tx.getWeight();
|
|
const sigops = item.sigops;
|
|
|
|
this.weight += weight;
|
|
this.sigops += sigops;
|
|
this.fees += item.fee;
|
|
|
|
// Add the tx to our block
|
|
this.items.push(item);
|
|
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Block Entry
|
|
* @alias module:mining.BlockEntry
|
|
* @property {TX} tx
|
|
* @property {Hash} hash
|
|
* @property {Amount} fee
|
|
* @property {Rate} rate
|
|
* @property {Number} priority
|
|
* @property {Boolean} free
|
|
* @property {Sigops} sigops
|
|
* @property {Number} depCount
|
|
*/
|
|
|
|
class BlockEntry {
|
|
/**
|
|
* Create a block entry.
|
|
* @constructor
|
|
* @param {TX} tx
|
|
*/
|
|
|
|
constructor(tx) {
|
|
this.tx = tx;
|
|
this.hash = tx.hash('hex');
|
|
this.fee = 0;
|
|
this.rate = 0;
|
|
this.priority = 0;
|
|
this.free = false;
|
|
this.sigops = 0;
|
|
this.descRate = 0;
|
|
this.depCount = 0;
|
|
}
|
|
|
|
/**
|
|
* Instantiate block entry from transaction.
|
|
* @param {TX} tx
|
|
* @param {CoinView} view
|
|
* @param {BlockTemplate} attempt
|
|
* @returns {BlockEntry}
|
|
*/
|
|
|
|
static fromTX(tx, view, attempt) {
|
|
const item = new this(tx);
|
|
item.fee = tx.getFee(view);
|
|
item.rate = tx.getRate(view);
|
|
item.priority = tx.getPriority(view, attempt.height);
|
|
item.free = false;
|
|
item.sigops = tx.getSigopsCost(view, attempt.flags);
|
|
item.descRate = item.rate;
|
|
return item;
|
|
}
|
|
|
|
/**
|
|
* Instantiate block entry from mempool entry.
|
|
* @param {MempoolEntry} entry
|
|
* @param {BlockTemplate} attempt
|
|
* @returns {BlockEntry}
|
|
*/
|
|
|
|
static fromEntry(entry, attempt) {
|
|
const item = new this(entry.tx);
|
|
item.fee = entry.getFee();
|
|
item.rate = entry.getDeltaRate();
|
|
item.priority = entry.getPriority(attempt.height);
|
|
item.free = entry.getDeltaFee() < policy.getMinFee(entry.size);
|
|
item.sigops = entry.sigops;
|
|
item.descRate = entry.getDescRate();
|
|
return item;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Block Proof
|
|
*/
|
|
|
|
class BlockProof {
|
|
/**
|
|
* Create a block proof.
|
|
* @constructor
|
|
* @param {Hash} hash
|
|
* @param {Hash} root
|
|
* @param {Number} nonce1
|
|
* @param {Number} nonce2
|
|
* @param {Number} time
|
|
* @param {Number} nonce
|
|
*/
|
|
|
|
constructor(hash, root, nonce1, nonce2, time, nonce) {
|
|
this.hash = hash;
|
|
this.root = root;
|
|
this.nonce1 = nonce1;
|
|
this.nonce2 = nonce2;
|
|
this.time = time;
|
|
this.nonce = nonce;
|
|
}
|
|
|
|
rhash() {
|
|
return util.revHex(this.hash.toString('hex'));
|
|
}
|
|
|
|
verify(target) {
|
|
return common.rcmp(this.hash, target) <= 0;
|
|
}
|
|
|
|
getDifficulty() {
|
|
return common.getDifficulty(this.hash);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Merkle Tree
|
|
* @property {Hash[]} steps
|
|
*/
|
|
|
|
class MerkleTree {
|
|
/**
|
|
* Create a merkle tree.
|
|
* @constructor
|
|
*/
|
|
|
|
constructor() {
|
|
this.steps = [];
|
|
}
|
|
|
|
withFirst(hash) {
|
|
for (const step of this.steps)
|
|
hash = hash256.root(hash, step);
|
|
return hash;
|
|
}
|
|
|
|
toJSON() {
|
|
const steps = [];
|
|
|
|
for (const step of this.steps)
|
|
steps.push(step.toString('hex'));
|
|
|
|
return steps;
|
|
}
|
|
|
|
fromItems(items) {
|
|
const leaves = [];
|
|
|
|
leaves.push(encoding.ZERO_HASH);
|
|
|
|
for (const item of items)
|
|
leaves.push(item.tx.hash());
|
|
|
|
return this.fromLeaves(leaves);
|
|
}
|
|
|
|
static fromItems(items) {
|
|
return new this().fromItems(items);
|
|
}
|
|
|
|
fromBlock(txs) {
|
|
const leaves = [];
|
|
|
|
leaves.push(encoding.ZERO_HASH);
|
|
|
|
for (let i = 1; i < txs.length; i++) {
|
|
const tx = txs[i];
|
|
leaves.push(tx.hash());
|
|
}
|
|
|
|
return this.fromLeaves(leaves);
|
|
}
|
|
|
|
static fromBlock(txs) {
|
|
return new this().fromBlock(txs);
|
|
}
|
|
|
|
fromLeaves(leaves) {
|
|
let len = leaves.length;
|
|
|
|
while (len > 1) {
|
|
const hashes = [encoding.ZERO_HASH];
|
|
|
|
this.steps.push(leaves[1]);
|
|
|
|
if (len % 2)
|
|
leaves.push(leaves[len - 1]);
|
|
|
|
for (let i = 2; i < len; i += 2) {
|
|
const hash = hash256.root(leaves[i], leaves[i + 1]);
|
|
hashes.push(hash);
|
|
}
|
|
|
|
leaves = hashes;
|
|
len = leaves.length;
|
|
}
|
|
|
|
return this;
|
|
}
|
|
|
|
static fromLeaves(leaves) {
|
|
return new this().fromLeaves(leaves);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Expose
|
|
*/
|
|
|
|
exports = BlockTemplate;
|
|
exports.BlockTemplate = BlockTemplate;
|
|
exports.BlockEntry = BlockEntry;
|
|
|
|
module.exports = exports;
|