Struct Mempool 

pub struct Mempool(/* private fields */);

Cheaply cloneable: clones share one live mempool via Arc.

Implementations

impl Mempool

pub fn addr_state_hash(&self, addr: &AddrBytes) -> Option<u64>

Hash of the address’s mempool state, None if the address has no live mempool activity. Used as an ETag for address-keyed mempool responses. Route handlers may fall back to a 0 sentinel.

pub fn addr_stats(&self, addr: &AddrBytes) -> Option<AddrMempoolStats>

Per-address mempool stats. None if the address has no live mempool activity.

pub fn addr_txs(&self, addr: &AddrBytes, limit: usize) -> Vec<Transaction>

Live mempool txs touching addr, newest first by first_seen, capped at limit. Returns owned Transactions.

impl Mempool

pub fn next_block_hash(&self) -> NextBlockHash

pub fn block_template(&self) -> BlockTemplate

Full projected next block: Core’s getblocktemplate selection (block 0) with aggregate stats and full tx bodies in GBT order.

pub fn block_template_diff( &self, since: NextBlockHash, ) -> Option<BlockTemplateDiff>

Delta of the projected next block since since. None when since has aged out of the rebuilder’s history (server should 404 -> client falls back to block_template).

order walks the new template in template order. Each entry is either a Retained index into the prior template (which the client cached when it obtained since) or a New inline body. removed is the convenience list of txids that left.

impl Mempool

pub fn fees(&self) -> RecommendedFees

pub fn block_stats(&self) -> Vec<BlockStats>

pub fn live_effective_fee_rate(&self, prefix: &TxidPrefix) -> Option<FeeRate>

Effective fee rate for a live tx: snapshot’s linearized chunk rate. Falls back to fee/vsize for txs added since the latest snapshot was built (apply -> same-cycle tick gap).

pub fn graveyard_fee_rate(&self, txid: &Txid) -> Option<FeeRate>

Linearized chunk rate captured at burial - same value live_effective_fee_rate returned while the tx was alive, so an evicted RBF predecessor reports the package-effective rate it had in the mempool, not a misleading isolated fee/vsize.

impl Mempool

pub fn info(&self) -> MempoolInfo

pub fn live_eligible_histogram(&self) -> HistogramRaw

Snapshot of pre-bucketed round-dollar-eligible bins across all live mempool tx outputs. Maintained incrementally by TxStore on every insert/remove, so this hot path is O(NUM_BINS) regardless of pool size. Used by live_price to blend the mempool into the committed oracle without re-parsing scripts per request.

pub fn live_raw_histogram(&self) -> HistogramRaw

Snapshot of the raw histogram: every live mempool output binned by value with no payment filtering. Backs the histogram/raw/live endpoint.

impl Mempool

pub fn rbf_for_tx(&self, txid: &Txid) -> RbfForTx

Walk forward through Replaced { by } to the terminal replacer and return its full predecessor tree, plus the requested tx’s direct predecessors. Single read-lock window.

pub fn recent_rbf_trees( &self, full_rbf_only: bool, limit: usize, ) -> Vec<RbfNode>

Recent terminal-replacer trees, most-recent first, deduplicated by root, capped at limit. full_rbf_only drops trees with no non-signaling predecessor.

impl Mempool

pub fn contains_txid(&self, txid: &Txid) -> bool

pub fn with_tx<R>( &self, txid: &Txid, f: impl FnOnce(&Transaction) -> R, ) -> Option<R>

Apply f to the live tx body if present.

pub fn with_vanished_tx<R>( &self, txid: &Txid, f: impl FnOnce(&Transaction) -> R, ) -> Option<R>

Apply f to a Vanished tombstone’s tx body if present. Replaced tombstones return None because the tx will not confirm.

pub fn lookup_spender(&self, txid: &Txid, vout: Vout) -> Option<(Txid, Vin)>

Mempool tx spending (txid, vout), or None. The spender’s input list is walked to rule out TxidPrefix collisions.

pub fn txids(&self) -> Vec<Txid>

Snapshot of all live mempool txids.

Allocates 32 * len(mempool) bytes under the read guard. Sized for diagnostics. Route layers serving large pools should paginate at their boundary rather than calling this per request.

pub fn recent_txs(&self) -> Vec<MempoolRecentTx>

Snapshot of recent live txs.

pub fn transaction_times(&self, txids: &[Txid]) -> Vec<u64>

first_seen Unix-second timestamps for txids, in input order. Returns 0 for unknown txids. Vanished tombstones fall back to the buried entry’s first_seen to avoid flicker between drop and indexer catch-up.

impl Mempool

pub fn start(&self)

Infinite update loop with a 1s interval. Resolves confirmed-parent prevouts via the default getrawtransaction resolver. Requires bitcoind started with txindex=1. Discards per-cycle Cycle events - use Mempool::tick to consume them.

pub fn start_with<F>(&self, resolver: F)

where F: Fn(&[(Txid, Vout)]) -> FxHashMap<(Txid, Vout), TxOut> + Send,

Variant of start that uses a caller-supplied resolver for confirmed-parent prevouts (typically backed by an indexer).

Sleep is PERIOD - work_duration, so a 350ms cycle followed by a 100ms cycle still ticks roughly every PERIOD. When work overruns PERIOD, the next cycle starts immediately.

Panics

Panics if a driver is already running on this Mempool instance. One Mempool may host at most one driver. Spawn another instance for additional loops.

pub fn tick(&self) -> Result<Cycle>

One sync cycle: fetch, prepare, apply, fill prevouts, rebuild. Returns a Cycle reporting everything that changed. Uses the default getrawtransaction resolver for confirmed-parent prevouts (requires txindex=1).

Errors

Propagates any failure from the initial RPC fetch (network drop, auth, bitcoind error). Steps after Fetcher::fetch are infallible today. The resolver itself swallows its own errors and retries next cycle.

pub fn tick_with<F>(&self, resolver: F) -> Result<Cycle>

where F: Fn(&[(Txid, Vout)]) -> FxHashMap<(Txid, Vout), TxOut>,

Variant of Mempool::tick with a caller-supplied resolver for confirmed-parent prevouts. The resolver MUST resolve confirmed prevouts only. Mempool-to-mempool chains are wired internally and the resolver is never called for them.

Errors

Same as Mempool::tick: only the RPC fetch is fallible.

impl Mempool

pub fn cpfp_info(&self, prefix: &TxidPrefix) -> Option<CpfpInfo>

CPFP info for a live mempool tx. Returns None when the tx isn’t in the live pool, so callers can fall through to the confirmed path. The snapshot can lag state.txs by up to one cycle: if the seed is in the snapshot but no longer in live state we return None rather than a half-stale report.

impl Mempool

pub fn new(client: &Client) -> Self

pub fn snapshot(&self) -> Arc<Snapshot>

pub fn stats(&self) -> MempoolStats

One-shot diagnostic counters captured under a single read guard.

Trait Implementations

impl Clone for Mempool

fn clone(&self) -> Mempool

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl From<&Mempool> for MempoolStats

fn from(mempool: &Mempool) -> Self

Converts to this type from the input type.