mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-04-29 14:59:39 -04:00
Add waitNext() to BlockTemplate interface
This commit is contained in:
parent
785649f397
commit
d4020f502a
5 changed files with 157 additions and 11 deletions
|
@ -7,7 +7,7 @@
|
||||||
|
|
||||||
#include <consensus/amount.h> // for CAmount
|
#include <consensus/amount.h> // for CAmount
|
||||||
#include <interfaces/types.h> // for BlockRef
|
#include <interfaces/types.h> // for BlockRef
|
||||||
#include <node/types.h> // for BlockCreateOptions
|
#include <node/types.h> // for BlockCreateOptions, BlockWaitOptions
|
||||||
#include <primitives/block.h> // for CBlock, CBlockHeader
|
#include <primitives/block.h> // for CBlock, CBlockHeader
|
||||||
#include <primitives/transaction.h> // for CTransactionRef
|
#include <primitives/transaction.h> // for CTransactionRef
|
||||||
#include <stdint.h> // for int64_t
|
#include <stdint.h> // for int64_t
|
||||||
|
@ -56,6 +56,16 @@ public:
|
||||||
* @returns if the block was processed, independent of block validity
|
* @returns if the block was processed, independent of block validity
|
||||||
*/
|
*/
|
||||||
virtual bool submitSolution(uint32_t version, uint32_t timestamp, uint32_t nonce, CTransactionRef coinbase) = 0;
|
virtual bool submitSolution(uint32_t version, uint32_t timestamp, uint32_t nonce, CTransactionRef coinbase) = 0;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Waits for fees in the next block to rise, a new tip or the timeout.
|
||||||
|
*
|
||||||
|
* @param[in] options Control the timeout (default forever) and by how much total fees
|
||||||
|
* for the next block should rise (default infinite).
|
||||||
|
*
|
||||||
|
* @returns a new BlockTemplate or nothing if the timeout occurs.
|
||||||
|
*/
|
||||||
|
virtual std::unique_ptr<BlockTemplate> waitNext(const node::BlockWaitOptions options = {}) = 0;
|
||||||
};
|
};
|
||||||
|
|
||||||
//! Interface giving clients (RPC, Stratum v2 Template Provider in the future)
|
//! Interface giving clients (RPC, Stratum v2 Template Provider in the future)
|
||||||
|
|
|
@ -31,6 +31,7 @@ interface BlockTemplate $Proxy.wrap("interfaces::BlockTemplate") {
|
||||||
getWitnessCommitmentIndex @7 (context: Proxy.Context) -> (result: Int32);
|
getWitnessCommitmentIndex @7 (context: Proxy.Context) -> (result: Int32);
|
||||||
getCoinbaseMerklePath @8 (context: Proxy.Context) -> (result: List(Data));
|
getCoinbaseMerklePath @8 (context: Proxy.Context) -> (result: List(Data));
|
||||||
submitSolution @9 (context: Proxy.Context, version: UInt32, timestamp: UInt32, nonce: UInt32, coinbase :Data) -> (result: Bool);
|
submitSolution @9 (context: Proxy.Context, version: UInt32, timestamp: UInt32, nonce: UInt32, coinbase :Data) -> (result: Bool);
|
||||||
|
waitNext @10 (context: Proxy.Context, options: BlockWaitOptions) -> (result: BlockTemplate);
|
||||||
}
|
}
|
||||||
|
|
||||||
struct BlockCreateOptions $Proxy.wrap("node::BlockCreateOptions") {
|
struct BlockCreateOptions $Proxy.wrap("node::BlockCreateOptions") {
|
||||||
|
@ -39,6 +40,11 @@ struct BlockCreateOptions $Proxy.wrap("node::BlockCreateOptions") {
|
||||||
coinbaseOutputMaxAdditionalSigops @2 :UInt64 $Proxy.name("coinbase_output_max_additional_sigops");
|
coinbaseOutputMaxAdditionalSigops @2 :UInt64 $Proxy.name("coinbase_output_max_additional_sigops");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
struct BlockWaitOptions $Proxy.wrap("node::BlockWaitOptions") {
|
||||||
|
timeout @0 : Float64 $Proxy.name("timeout");
|
||||||
|
feeThreshold @1 : Int64 $Proxy.name("fee_threshold");
|
||||||
|
}
|
||||||
|
|
||||||
# Note: serialization of the BlockValidationState C++ type is somewhat fragile
|
# Note: serialization of the BlockValidationState C++ type is somewhat fragile
|
||||||
# and using the struct can be awkward. It would be good if testBlockValidity
|
# and using the struct can be awkward. It would be good if testBlockValidity
|
||||||
# method were changed to return validity information in a simpler format.
|
# method were changed to return validity information in a simpler format.
|
||||||
|
|
|
@ -82,6 +82,7 @@ using interfaces::Mining;
|
||||||
using interfaces::Node;
|
using interfaces::Node;
|
||||||
using interfaces::WalletLoader;
|
using interfaces::WalletLoader;
|
||||||
using node::BlockAssembler;
|
using node::BlockAssembler;
|
||||||
|
using node::BlockWaitOptions;
|
||||||
using util::Join;
|
using util::Join;
|
||||||
|
|
||||||
namespace node {
|
namespace node {
|
||||||
|
@ -877,7 +878,11 @@ public:
|
||||||
class BlockTemplateImpl : public BlockTemplate
|
class BlockTemplateImpl : public BlockTemplate
|
||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
explicit BlockTemplateImpl(std::unique_ptr<CBlockTemplate> block_template, NodeContext& node) : m_block_template(std::move(block_template)), m_node(node)
|
explicit BlockTemplateImpl(BlockAssembler::Options assemble_options,
|
||||||
|
std::unique_ptr<CBlockTemplate> block_template,
|
||||||
|
NodeContext& node) : m_assemble_options(std::move(assemble_options)),
|
||||||
|
m_block_template(std::move(block_template)),
|
||||||
|
m_node(node)
|
||||||
{
|
{
|
||||||
assert(m_block_template);
|
assert(m_block_template);
|
||||||
}
|
}
|
||||||
|
@ -942,9 +947,94 @@ public:
|
||||||
return chainman().ProcessNewBlock(block_ptr, /*force_processing=*/true, /*min_pow_checked=*/true, /*new_block=*/nullptr);
|
return chainman().ProcessNewBlock(block_ptr, /*force_processing=*/true, /*min_pow_checked=*/true, /*new_block=*/nullptr);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
std::unique_ptr<BlockTemplate> waitNext(BlockWaitOptions options) override
|
||||||
|
{
|
||||||
|
// Delay calculating the current template fees, just in case a new block
|
||||||
|
// comes in before the next tick.
|
||||||
|
CAmount current_fees = -1;
|
||||||
|
|
||||||
|
// Alternate waiting for a new tip and checking if fees have risen.
|
||||||
|
// The latter check is expensive so we only run it once per second.
|
||||||
|
auto now{NodeClock::now()};
|
||||||
|
const auto deadline = now + options.timeout;
|
||||||
|
const MillisecondsDouble tick{1000};
|
||||||
|
|
||||||
|
do {
|
||||||
|
bool tip_changed{false};
|
||||||
|
{
|
||||||
|
WAIT_LOCK(notifications().m_tip_block_mutex, lock);
|
||||||
|
// Note that wait_until() checks the predicate before waiting
|
||||||
|
notifications().m_tip_block_cv.wait_until(lock, std::min(now + tick, deadline), [&]() EXCLUSIVE_LOCKS_REQUIRED(notifications().m_tip_block_mutex) {
|
||||||
|
AssertLockHeld(notifications().m_tip_block_mutex);
|
||||||
|
const auto tip_block{notifications().TipBlock()};
|
||||||
|
// We assume tip_block is set, because this is an instance
|
||||||
|
// method on BlockTemplate and no template could have been
|
||||||
|
// generated before a tip exists.
|
||||||
|
tip_changed = Assume(tip_block) && tip_block != m_block_template->block.hashPrevBlock;
|
||||||
|
return tip_changed || chainman().m_interrupt;
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
if (chainman().m_interrupt) return nullptr;
|
||||||
|
// At this point the tip changed, a full tick went by or we reached
|
||||||
|
// the deadline.
|
||||||
|
|
||||||
|
// Must release m_tip_block_mutex before locking cs_main, to avoid deadlocks.
|
||||||
|
LOCK(::cs_main);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* We determine if fees increased compared to the previous template by generating
|
||||||
|
* a fresh template. There may be more efficient ways to determine how much
|
||||||
|
* (approximate) fees for the next block increased, perhaps more so after
|
||||||
|
* Cluster Mempool.
|
||||||
|
*
|
||||||
|
* We'll also create a new template if the tip changed during this iteration.
|
||||||
|
*/
|
||||||
|
if (options.fee_threshold < MAX_MONEY || tip_changed) {
|
||||||
|
auto tmpl{std::make_unique<BlockTemplateImpl>(m_assemble_options,
|
||||||
|
BlockAssembler{
|
||||||
|
chainman().ActiveChainstate(),
|
||||||
|
context()->mempool.get(),
|
||||||
|
m_assemble_options}
|
||||||
|
.CreateNewBlock(),
|
||||||
|
m_node)};
|
||||||
|
|
||||||
|
// If the tip changed, return the new template regardless of its fees.
|
||||||
|
if (tip_changed) return tmpl;
|
||||||
|
|
||||||
|
// Calculate the original template total fees if we haven't already
|
||||||
|
if (current_fees == -1) {
|
||||||
|
current_fees = 0;
|
||||||
|
for (CAmount fee : m_block_template->vTxFees) {
|
||||||
|
// Skip coinbase
|
||||||
|
if (fee < 0) continue;
|
||||||
|
current_fees += fee;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
CAmount new_fees = 0;
|
||||||
|
for (CAmount fee : tmpl->m_block_template->vTxFees) {
|
||||||
|
// Skip coinbase
|
||||||
|
if (fee < 0) continue;
|
||||||
|
new_fees += fee;
|
||||||
|
Assume(options.fee_threshold != MAX_MONEY);
|
||||||
|
if (new_fees >= current_fees + options.fee_threshold) return tmpl;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
now = NodeClock::now();
|
||||||
|
} while (now < deadline);
|
||||||
|
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
const BlockAssembler::Options m_assemble_options;
|
||||||
|
|
||||||
const std::unique_ptr<CBlockTemplate> m_block_template;
|
const std::unique_ptr<CBlockTemplate> m_block_template;
|
||||||
|
|
||||||
|
NodeContext* context() { return &m_node; }
|
||||||
ChainstateManager& chainman() { return *Assert(m_node.chainman); }
|
ChainstateManager& chainman() { return *Assert(m_node.chainman); }
|
||||||
|
KernelNotifications& notifications() { return *Assert(m_node.notifications); }
|
||||||
NodeContext& m_node;
|
NodeContext& m_node;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -991,7 +1081,7 @@ public:
|
||||||
{
|
{
|
||||||
BlockAssembler::Options assemble_options{options};
|
BlockAssembler::Options assemble_options{options};
|
||||||
ApplyArgsManOptions(*Assert(m_node.args), assemble_options);
|
ApplyArgsManOptions(*Assert(m_node.args), assemble_options);
|
||||||
return std::make_unique<BlockTemplateImpl>(BlockAssembler{chainman().ActiveChainstate(), context()->mempool.get(), assemble_options}.CreateNewBlock(), m_node);
|
return std::make_unique<BlockTemplateImpl>(assemble_options, BlockAssembler{chainman().ActiveChainstate(), context()->mempool.get(), assemble_options}.CreateNewBlock(), m_node);
|
||||||
}
|
}
|
||||||
|
|
||||||
NodeContext* context() override { return &m_node; }
|
NodeContext* context() override { return &m_node; }
|
||||||
|
|
|
@ -13,9 +13,11 @@
|
||||||
#ifndef BITCOIN_NODE_TYPES_H
|
#ifndef BITCOIN_NODE_TYPES_H
|
||||||
#define BITCOIN_NODE_TYPES_H
|
#define BITCOIN_NODE_TYPES_H
|
||||||
|
|
||||||
|
#include <consensus/amount.h>
|
||||||
#include <cstddef>
|
#include <cstddef>
|
||||||
#include <policy/policy.h>
|
#include <policy/policy.h>
|
||||||
#include <script/script.h>
|
#include <script/script.h>
|
||||||
|
#include <util/time.h>
|
||||||
|
|
||||||
namespace node {
|
namespace node {
|
||||||
enum class TransactionError {
|
enum class TransactionError {
|
||||||
|
@ -61,6 +63,28 @@ struct BlockCreateOptions {
|
||||||
*/
|
*/
|
||||||
CScript coinbase_output_script{CScript() << OP_TRUE};
|
CScript coinbase_output_script{CScript() << OP_TRUE};
|
||||||
};
|
};
|
||||||
|
|
||||||
|
struct BlockWaitOptions {
|
||||||
|
/**
|
||||||
|
* How long to wait before returning nullptr instead of a new template.
|
||||||
|
* Default is to wait forever.
|
||||||
|
*/
|
||||||
|
MillisecondsDouble timeout{MillisecondsDouble::max()};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The wait method will not return a new template unless it has fees at
|
||||||
|
* least fee_threshold sats higher than the current template, or unless
|
||||||
|
* the chain tip changes and the previous template is no longer valid.
|
||||||
|
*
|
||||||
|
* A caller may not be interested in templates with higher fees, and
|
||||||
|
* determining whether fee_threshold is reached is also expensive. So as
|
||||||
|
* an optimization, when fee_threshold is set to MAX_MONEY (default), the
|
||||||
|
* implementation is able to be much more efficient, skipping expensive
|
||||||
|
* checks and only returning new templates when the chain tip changes.
|
||||||
|
*/
|
||||||
|
CAmount fee_threshold{MAX_MONEY};
|
||||||
|
};
|
||||||
|
|
||||||
} // namespace node
|
} // namespace node
|
||||||
|
|
||||||
#endif // BITCOIN_NODE_TYPES_H
|
#endif // BITCOIN_NODE_TYPES_H
|
||||||
|
|
|
@ -180,8 +180,11 @@ void MinerTestingSetup::TestPackageSelection(const CScript& scriptPubKey, const
|
||||||
tx.vout[0].nValue = 5000000000LL - 1000 - 50000 - feeToUse;
|
tx.vout[0].nValue = 5000000000LL - 1000 - 50000 - feeToUse;
|
||||||
Txid hashLowFeeTx = tx.GetHash();
|
Txid hashLowFeeTx = tx.GetHash();
|
||||||
AddToMempool(tx_mempool, entry.Fee(feeToUse).FromTx(tx));
|
AddToMempool(tx_mempool, entry.Fee(feeToUse).FromTx(tx));
|
||||||
block_template = mining->createNewBlock(options);
|
|
||||||
BOOST_REQUIRE(block_template);
|
// waitNext() should return nullptr because there is no better template
|
||||||
|
auto should_be_nullptr = block_template->waitNext({.timeout = MillisecondsDouble{0}, .fee_threshold = 1});
|
||||||
|
BOOST_REQUIRE(should_be_nullptr == nullptr);
|
||||||
|
|
||||||
block = block_template->getBlock();
|
block = block_template->getBlock();
|
||||||
// Verify that the free tx and the low fee tx didn't get selected
|
// Verify that the free tx and the low fee tx didn't get selected
|
||||||
for (size_t i=0; i<block.vtx.size(); ++i) {
|
for (size_t i=0; i<block.vtx.size(); ++i) {
|
||||||
|
@ -196,7 +199,9 @@ void MinerTestingSetup::TestPackageSelection(const CScript& scriptPubKey, const
|
||||||
tx.vout[0].nValue -= 2; // Now we should be just over the min relay fee
|
tx.vout[0].nValue -= 2; // Now we should be just over the min relay fee
|
||||||
hashLowFeeTx = tx.GetHash();
|
hashLowFeeTx = tx.GetHash();
|
||||||
AddToMempool(tx_mempool, entry.Fee(feeToUse + 2).FromTx(tx));
|
AddToMempool(tx_mempool, entry.Fee(feeToUse + 2).FromTx(tx));
|
||||||
block_template = mining->createNewBlock(options);
|
|
||||||
|
// waitNext() should return if fees for the new template are at least 1 sat up
|
||||||
|
block_template = block_template->waitNext({.fee_threshold = 1});
|
||||||
BOOST_REQUIRE(block_template);
|
BOOST_REQUIRE(block_template);
|
||||||
block = block_template->getBlock();
|
block = block_template->getBlock();
|
||||||
BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
|
BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
|
||||||
|
@ -671,9 +676,15 @@ BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
|
||||||
for (const auto& bi : BLOCKINFO) {
|
for (const auto& bi : BLOCKINFO) {
|
||||||
const int current_height{mining->getTip()->height};
|
const int current_height{mining->getTip()->height};
|
||||||
|
|
||||||
// Simple block creation, nothing special yet:
|
/**
|
||||||
block_template = mining->createNewBlock(options);
|
* Simple block creation, nothing special yet.
|
||||||
BOOST_REQUIRE(block_template);
|
* If current_height is odd, block_template will have already been
|
||||||
|
* set at the end of the previous loop.
|
||||||
|
*/
|
||||||
|
if (current_height % 2 == 0) {
|
||||||
|
block_template = mining->createNewBlock(options);
|
||||||
|
BOOST_REQUIRE(block_template);
|
||||||
|
}
|
||||||
|
|
||||||
CBlock block{block_template->getBlock()};
|
CBlock block{block_template->getBlock()};
|
||||||
CMutableTransaction txCoinbase(*block.vtx[0]);
|
CMutableTransaction txCoinbase(*block.vtx[0]);
|
||||||
|
@ -709,8 +720,13 @@ BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
|
||||||
auto maybe_new_tip{Assert(m_node.chainman)->ActiveChain().Tip()};
|
auto maybe_new_tip{Assert(m_node.chainman)->ActiveChain().Tip()};
|
||||||
BOOST_REQUIRE_EQUAL(maybe_new_tip->GetBlockHash(), block.GetHash());
|
BOOST_REQUIRE_EQUAL(maybe_new_tip->GetBlockHash(), block.GetHash());
|
||||||
}
|
}
|
||||||
// This just adds coverage
|
if (current_height % 2 == 0) {
|
||||||
mining->waitTipChanged(block.hashPrevBlock);
|
block_template = block_template->waitNext();
|
||||||
|
BOOST_REQUIRE(block_template);
|
||||||
|
} else {
|
||||||
|
// This just adds coverage
|
||||||
|
mining->waitTipChanged(block.hashPrevBlock);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
LOCK(cs_main);
|
LOCK(cs_main);
|
||||||
|
|
Loading…
Add table
Reference in a new issue