mirror of https://github.com/bitcoin/bitcoin
This module is going to be responsible for managing everything related to transaction download, including txrequest, orphan transactions and package relay. It will be responsible for managing usage of the TxOrphanage and instructing PeerManager: - what tx or package-related messages to send to which peer - whether a tx or package-related message is allowed or useful - what transactions are available to try accepting to mempool Future commits will consolidate the interface and re-delegate interactions from PeerManager to TxDownloadManager.pull/30110/head
glozow
3 years ago
parent
5ea335a97f
commit
5f9004e155
@ -0,0 +1,53 @@
|
|||||||
|
// Copyright (c) 2024 The Bitcoin Core developers
|
||||||
|
// Distributed under the MIT software license, see the accompanying
|
||||||
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
||||||
|
|
||||||
|
#ifndef BITCOIN_NODE_TXDOWNLOADMAN_H
|
||||||
|
#define BITCOIN_NODE_TXDOWNLOADMAN_H
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <memory>
|
||||||
|
|
||||||
|
class TxOrphanage;
|
||||||
|
class TxRequestTracker;
|
||||||
|
class CRollingBloomFilter;
|
||||||
|
|
||||||
|
namespace node {
|
||||||
|
class TxDownloadManagerImpl;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Class responsible for deciding what transactions to request and, once
|
||||||
|
* downloaded, whether and how to validate them. It is also responsible for
|
||||||
|
* deciding what transaction packages to validate and how to resolve orphan
|
||||||
|
* transactions. Its data structures include TxRequestTracker for scheduling
|
||||||
|
* requests, rolling bloom filters for remembering transactions that have
|
||||||
|
* already been {accepted, rejected, confirmed}, an orphanage, and a registry of
|
||||||
|
* each peer's transaction relay-related information.
|
||||||
|
*
|
||||||
|
* Caller needs to interact with TxDownloadManager:
|
||||||
|
* - ValidationInterface callbacks.
|
||||||
|
* - When a potential transaction relay peer connects or disconnects.
|
||||||
|
* - When a transaction or package is accepted or rejected from mempool
|
||||||
|
* - When a inv, notfound, or tx message is received
|
||||||
|
* - To get instructions for which getdata messages to send
|
||||||
|
*
|
||||||
|
* This class is not thread-safe. Access must be synchronized using an
|
||||||
|
* external mutex.
|
||||||
|
*/
|
||||||
|
class TxDownloadManager {
|
||||||
|
const std::unique_ptr<TxDownloadManagerImpl> m_impl;
|
||||||
|
|
||||||
|
public:
|
||||||
|
explicit TxDownloadManager();
|
||||||
|
~TxDownloadManager();
|
||||||
|
|
||||||
|
// Get references to internal data structures. Outside access to these data structures should be
|
||||||
|
// temporary and removed later once logic has been moved internally.
|
||||||
|
TxOrphanage& GetOrphanageRef();
|
||||||
|
TxRequestTracker& GetTxRequestRef();
|
||||||
|
CRollingBloomFilter& RecentRejectsFilter();
|
||||||
|
CRollingBloomFilter& RecentRejectsReconsiderableFilter();
|
||||||
|
CRollingBloomFilter& RecentConfirmedTransactionsFilter();
|
||||||
|
};
|
||||||
|
} // namespace node
|
||||||
|
#endif // BITCOIN_NODE_TXDOWNLOADMAN_H
|
||||||
@ -0,0 +1,34 @@
|
|||||||
|
// Copyright (c) 2024
|
||||||
|
// Distributed under the MIT software license, see the accompanying
|
||||||
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
||||||
|
|
||||||
|
#include <node/txdownloadman_impl.h>
|
||||||
|
#include <node/txdownloadman.h>
|
||||||
|
|
||||||
|
namespace node {
|
||||||
|
TxDownloadManager::TxDownloadManager() :
|
||||||
|
m_impl{std::make_unique<TxDownloadManagerImpl>()}
|
||||||
|
{}
|
||||||
|
TxDownloadManager::~TxDownloadManager() = default;
|
||||||
|
|
||||||
|
TxOrphanage& TxDownloadManager::GetOrphanageRef()
|
||||||
|
{
|
||||||
|
return m_impl->m_orphanage;
|
||||||
|
}
|
||||||
|
TxRequestTracker& TxDownloadManager::GetTxRequestRef()
|
||||||
|
{
|
||||||
|
return m_impl->m_txrequest;
|
||||||
|
}
|
||||||
|
CRollingBloomFilter& TxDownloadManager::RecentRejectsFilter()
|
||||||
|
{
|
||||||
|
return m_impl->RecentRejectsFilter();
|
||||||
|
}
|
||||||
|
CRollingBloomFilter& TxDownloadManager::RecentRejectsReconsiderableFilter()
|
||||||
|
{
|
||||||
|
return m_impl->RecentRejectsReconsiderableFilter();
|
||||||
|
}
|
||||||
|
CRollingBloomFilter& TxDownloadManager::RecentConfirmedTransactionsFilter()
|
||||||
|
{
|
||||||
|
return m_impl->RecentConfirmedTransactionsFilter();
|
||||||
|
}
|
||||||
|
} // namespace node
|
||||||
@ -0,0 +1,127 @@
|
|||||||
|
// Copyright (c) 2024
|
||||||
|
// Distributed under the MIT software license, see the accompanying
|
||||||
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
||||||
|
#ifndef BITCOIN_NODE_TXDOWNLOADMAN_IMPL_H
|
||||||
|
#define BITCOIN_NODE_TXDOWNLOADMAN_IMPL_H
|
||||||
|
|
||||||
|
#include <node/txdownloadman.h>
|
||||||
|
|
||||||
|
#include <common/bloom.h>
|
||||||
|
#include <net.h>
|
||||||
|
#include <txorphanage.h>
|
||||||
|
#include <txrequest.h>
|
||||||
|
|
||||||
|
namespace node {
|
||||||
|
class TxDownloadManagerImpl {
|
||||||
|
public:
|
||||||
|
/** Manages unvalidated tx data (orphan transactions for which we are downloading ancestors). */
|
||||||
|
TxOrphanage m_orphanage;
|
||||||
|
/** Tracks candidates for requesting and downloading transaction data. */
|
||||||
|
TxRequestTracker m_txrequest;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Filter for transactions that were recently rejected by the mempool.
|
||||||
|
* These are not rerequested until the chain tip changes, at which point
|
||||||
|
* the entire filter is reset.
|
||||||
|
*
|
||||||
|
* Without this filter we'd be re-requesting txs from each of our peers,
|
||||||
|
* increasing bandwidth consumption considerably. For instance, with 100
|
||||||
|
* peers, half of which relay a tx we don't accept, that might be a 50x
|
||||||
|
* bandwidth increase. A flooding attacker attempting to roll-over the
|
||||||
|
* filter using minimum-sized, 60byte, transactions might manage to send
|
||||||
|
* 1000/sec if we have fast peers, so we pick 120,000 to give our peers a
|
||||||
|
* two minute window to send invs to us.
|
||||||
|
*
|
||||||
|
* Decreasing the false positive rate is fairly cheap, so we pick one in a
|
||||||
|
* million to make it highly unlikely for users to have issues with this
|
||||||
|
* filter.
|
||||||
|
*
|
||||||
|
* We typically only add wtxids to this filter. For non-segwit
|
||||||
|
* transactions, the txid == wtxid, so this only prevents us from
|
||||||
|
* re-downloading non-segwit transactions when communicating with
|
||||||
|
* non-wtxidrelay peers -- which is important for avoiding malleation
|
||||||
|
* attacks that could otherwise interfere with transaction relay from
|
||||||
|
* non-wtxidrelay peers. For communicating with wtxidrelay peers, having
|
||||||
|
* the reject filter store wtxids is exactly what we want to avoid
|
||||||
|
* redownload of a rejected transaction.
|
||||||
|
*
|
||||||
|
* In cases where we can tell that a segwit transaction will fail
|
||||||
|
* validation no matter the witness, we may add the txid of such
|
||||||
|
* transaction to the filter as well. This can be helpful when
|
||||||
|
* communicating with txid-relay peers or if we were to otherwise fetch a
|
||||||
|
* transaction via txid (eg in our orphan handling).
|
||||||
|
*
|
||||||
|
* Memory used: 1.3 MB
|
||||||
|
*/
|
||||||
|
std::unique_ptr<CRollingBloomFilter> m_lazy_recent_rejects{nullptr};
|
||||||
|
|
||||||
|
CRollingBloomFilter& RecentRejectsFilter()
|
||||||
|
{
|
||||||
|
if (!m_lazy_recent_rejects) {
|
||||||
|
m_lazy_recent_rejects = std::make_unique<CRollingBloomFilter>(120'000, 0.000'001);
|
||||||
|
}
|
||||||
|
|
||||||
|
return *m_lazy_recent_rejects;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Filter for:
|
||||||
|
* (1) wtxids of transactions that were recently rejected by the mempool but are
|
||||||
|
* eligible for reconsideration if submitted with other transactions.
|
||||||
|
* (2) packages (see GetPackageHash) we have already rejected before and should not retry.
|
||||||
|
*
|
||||||
|
* Similar to m_lazy_recent_rejects, this filter is used to save bandwidth when e.g. all of our peers
|
||||||
|
* have larger mempools and thus lower minimum feerates than us.
|
||||||
|
*
|
||||||
|
* When a transaction's error is TxValidationResult::TX_RECONSIDERABLE (in a package or by
|
||||||
|
* itself), add its wtxid to this filter. When a package fails for any reason, add the combined
|
||||||
|
* hash to this filter.
|
||||||
|
*
|
||||||
|
* Upon receiving an announcement for a transaction, if it exists in this filter, do not
|
||||||
|
* download the txdata. When considering packages, if it exists in this filter, drop it.
|
||||||
|
*
|
||||||
|
* Reset this filter when the chain tip changes.
|
||||||
|
*
|
||||||
|
* Parameters are picked to be the same as m_lazy_recent_rejects, with the same rationale.
|
||||||
|
*/
|
||||||
|
std::unique_ptr<CRollingBloomFilter> m_lazy_recent_rejects_reconsiderable{nullptr};
|
||||||
|
|
||||||
|
CRollingBloomFilter& RecentRejectsReconsiderableFilter()
|
||||||
|
{
|
||||||
|
if (!m_lazy_recent_rejects_reconsiderable) {
|
||||||
|
m_lazy_recent_rejects_reconsiderable = std::make_unique<CRollingBloomFilter>(120'000, 0.000'001);
|
||||||
|
}
|
||||||
|
|
||||||
|
return *m_lazy_recent_rejects_reconsiderable;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Filter for transactions that have been recently confirmed.
|
||||||
|
* We use this to avoid requesting transactions that have already been
|
||||||
|
* confirnmed.
|
||||||
|
*
|
||||||
|
* Blocks don't typically have more than 4000 transactions, so this should
|
||||||
|
* be at least six blocks (~1 hr) worth of transactions that we can store,
|
||||||
|
* inserting both a txid and wtxid for every observed transaction.
|
||||||
|
* If the number of transactions appearing in a block goes up, or if we are
|
||||||
|
* seeing getdata requests more than an hour after initial announcement, we
|
||||||
|
* can increase this number.
|
||||||
|
* The false positive rate of 1/1M should come out to less than 1
|
||||||
|
* transaction per day that would be inadvertently ignored (which is the
|
||||||
|
* same probability that we have in the reject filter).
|
||||||
|
*/
|
||||||
|
std::unique_ptr<CRollingBloomFilter> m_lazy_recent_confirmed_transactions{nullptr};
|
||||||
|
|
||||||
|
CRollingBloomFilter& RecentConfirmedTransactionsFilter()
|
||||||
|
{
|
||||||
|
if (!m_lazy_recent_confirmed_transactions) {
|
||||||
|
m_lazy_recent_confirmed_transactions = std::make_unique<CRollingBloomFilter>(48'000, 0.000'001);
|
||||||
|
}
|
||||||
|
|
||||||
|
return *m_lazy_recent_confirmed_transactions;
|
||||||
|
}
|
||||||
|
|
||||||
|
TxDownloadManagerImpl() = default;
|
||||||
|
};
|
||||||
|
} // namespace node
|
||||||
|
#endif // BITCOIN_NODE_TXDOWNLOADMAN_IMPL_H
|
||||||
Loading…
Reference in new issue