@valve-tech/tx-tracker 0.6.0 → 0.7.0

package/dist/tracker.js

@@ -0,0 +1,823 @@
+/**
+ * `createTxTracker` — the per-tx state machine that turns a
+ * `ChainSource`'s block + mempool stream into a stream of neutral
+ * observations per tracked hash.
+ *
+ * Per `docs/tx-tracker-spec.md` §5.2 + §6 + §11 + §12. This file is
+ * the load-bearing piece of `@valve-tech/tx-tracker`; everything
+ * else is supporting infrastructure (events, store, reorg detector,
+ * selectors).
+ *
+ * Design rules carried in from the spec and the contributing skill:
+ *
+ *   - **Three consumption shapes, one underlying stream** (§5.3).
+ *     `getTxStatus(hash)` reads the cached snapshot; `subscribe(hash, cb)`
+ *     attaches a callback; `track(hash)` returns an async iterator.
+ *     All three see consistent state because they read from one
+ *     internal `Subscriptions<TxEvent>` per hash.
+ *
+ *   - **Neutral observations only** (§2.1). The tracker emits
+ *     `seen-in-mempool` / `seen-in-block` / `vanished-from-block` /
+ *     `replaced-by` / `unseen-for-N-blocks` and lets the consumer
+ *     write the policy that says "confirmed" or "stuck" in their
+ *     UX voice.
+ *
+ *   - **No silent downgrade** (§2.2). Every emitted event carries a
+ *     `source` discriminator. When the source's `capabilities()`
+ *     change between ticks, the tracker emits `signal-degraded` /
+ *     `signal-recovered` per affected capability.
+ *
+ *   - **No own poll cycle** (§3.1, contributing-skill rule 3). The
+ *     tracker hangs off `source.subscribeBlocks` and
+ *     `source.subscribeMempool`; every per-tick computation runs
+ *     inside those callbacks.
+ *
+ *   - **Browser/mobile safe** (§2.4). No Node-only deps; the
+ *     pub/sub primitive is `chain-source`'s `Subscriptions<E>`.
+ */
+import { Subscriptions } from '@valve-tech/chain-source';
+import { buildSignalDegraded, buildSignalRecovered, buildStarted, buildStopped, buildVanishedFromBlock, buildInitialStatus, } from './events.js';
+import { decideBlockObservation, decideMempoolObservation, } from './observations.js';
+import { appendBlock, defaultReorgDepthBlocks, detectDivergences, } from './reorg.js';
+import { compileSelector, defaultMaxBulkSubscriptions, matchAll, } from './selectors.js';
+import { computeRetentionExpiry, createInMemoryStore, defaultRetentionBlocks, } from './store.js';
+// -----------------------------------------------------------------
+// Internals
+// -----------------------------------------------------------------
+const DEFAULT_UNSEEN_THRESHOLD_BLOCKS = 30;
+/**
+ * Compare two capability snapshots; return per-key transitions
+ * (`degraded` / `recovered`). Degradation is "moved away from the
+ * higher-authority value" — `'subscription' → 'poll-only'`,
+ * `'available' → 'gated'`, `'available' → 'unavailable'`.
+ * Recovery is the reverse.
+ */
+const diffCapabilities = (prev, next) => {
+    const degraded = [];
+    const recovered = [];
+    const keys = [
+        'newHeads',
+        'newPendingTransactions',
+        'txpoolContent',
+        'receiptByHash',
+    ];
+    for (const key of keys) {
+        const before = capabilityRank(prev[key]);
+        const after = capabilityRank(next[key]);
+        if (after < before)
+            degraded.push(key);
+        else if (after > before)
+            recovered.push(key);
+    }
+    return { degraded, recovered };
+};
+const capabilityRank = (value) => {
+    switch (value) {
+        case 'subscription':
+        case 'available':
+            return 2;
+        case 'poll-only':
+            return 1;
+        case 'gated':
+        case 'unavailable':
+            return 0;
+    }
+};
+/**
+ * Pick the `EventSource` discriminator for an event the tracker is
+ * about to emit, given the current source-capability snapshot for
+ * the relevant capability key. Block-side observations come from
+ * either `'subscription'` (when `newHeads` is push) or `'block-poll'`
+ * (when it's poll). Mempool-side observations come from
+ * `'subscription'` (push) or `'mempool-snapshot'` (poll).
+ */
+const blockEventSource = (caps) => caps.newHeads === 'subscription' ? 'subscription' : 'block-poll';
+const mempoolEventSource = (caps) => caps.newPendingTransactions === 'subscription'
+    ? 'subscription'
+    : 'mempool-snapshot';
+// -----------------------------------------------------------------
+// Factory
+// -----------------------------------------------------------------
+/**
+ * Build a configured tracker.
+ *
+ * @example
+ *   import { createChainSource } from '@valve-tech/chain-source'
+ *   import { createTxTracker } from '@valve-tech/tx-tracker'
+ *
+ *   const source  = createChainSource({ client })
+ *   const tracker = createTxTracker({ source, chainId: 1 })
+ *
+ *   source.start()
+ *   tracker.start()
+ *
+ *   for await (const event of tracker.track('0xabc...')) {
+ *     if (event.kind === 'seen-in-block' && event.confirmations >= 3) break
+ *   }
+ */
+export const createTxTracker = (options) => {
+    const { source, chainId, store = createInMemoryStore(), lostSignalPolicy: defaultLostSignalPolicy = 'emit-uncertain', reorgDepthBlocks = defaultReorgDepthBlocks, unseenThresholdBlocks = DEFAULT_UNSEEN_THRESHOLD_BLOCKS, maxBulkSubscriptions = defaultMaxBulkSubscriptions, onError, lifecycle = 'eager', } = options;
+    const tracked = new Map();
+    const bulkSubs = new Map();
+    const globalSubs = new Subscriptions();
+    let started = false;
+    let unsubBlocks = null;
+    let unsubMempool = null;
+    let blockRing = [];
+    let latestTip = null;
+    let latestTipTimestamp = 0n;
+    let lastCaps = source.capabilities();
+    let nextSubId = 1;
+    // -------------------------------------------------------------
+    // Helpers
+    // -------------------------------------------------------------
+    const buildAt = () => ({
+        blockNumber: latestTip?.number ?? 0n,
+        timestamp: latestTipTimestamp,
+    });
+    /**
+     * Emit one event: deliver to per-hash subscribers, the global
+     * `subscribeAll` stream, and the store's audit log. Per-subscriber
+     * throws are swallowed by `Subscriptions.emit` already; store
+     * failures are routed through `onError` per spec Appendix A.
+     */
+    const emit = (record, event) => {
+        record.subs.emit(event);
+        globalSubs.emit(event);
+        if (record.hasDurableSub) {
+            void store.appendEvent(chainId, record.hash, event).catch((err) => {
+                onError?.('store.appendEvent', err);
+            });
+            void store
+                .put(toRecord(record))
+                .catch((err) => onError?.('store.put', err));
+        }
+    };
+    /**
+     * Project an internal `TrackedRecord` onto the persisted shape.
+     * Retention expiry is recomputed from the latest observed block
+     * each time so a long-lived hash that keeps moving stays in the
+     * store rather than getting GC'd mid-flight.
+     */
+    const toRecord = (record) => {
+        const lastBlock = record.status.lastObservedAtBlock ??
+            record.status.firstObservedAtBlock ??
+            latestTip?.number ??
+            0n;
+        const firstBlock = record.status.firstObservedAtBlock ?? latestTip?.number ?? 0n;
+        return {
+            chainId,
+            hash: record.hash,
+            status: record.status,
+            firstSeenBlockNumber: firstBlock,
+            lastObservedBlockNumber: lastBlock,
+            retentionExpiresAtBlockNumber: computeRetentionExpiry(lastBlock, defaultRetentionBlocks),
+            subscriptions: record.persisted,
+        };
+    };
+    /**
+     * Get-or-create the per-hash internal record. New records are
+     * seeded with `buildInitialStatus` against the current capability
+     * snapshot.
+     */
+    const ensureRecord = (hash) => {
+        let record = tracked.get(hash);
+        if (record)
+            return record;
+        record = {
+            hash,
+            status: buildInitialStatus({
+                hash,
+                chainId,
+                capabilities: source.capabilities(),
+            }),
+            subs: new Subscriptions(),
+            identity: null,
+            inLastMempoolSnapshot: false,
+            unseenThresholdBlocks,
+            lostSignalPolicy: null,
+            hasDurableSub: false,
+            persisted: [],
+        };
+        tracked.set(hash, record);
+        return record;
+    };
+    /**
+     * Detach a per-hash subscription. If no subscribers remain AND the
+     * record carries no durable persistence, drop the record so the
+     * tracker's footprint matches what's actually in flight.
+     */
+    const cleanupRecord = (record) => {
+        if (record.subs.size() > 0)
+            return;
+        if (record.hasDurableSub)
+            return;
+        tracked.delete(record.hash);
+    };
+    // -------------------------------------------------------------
+    // Block path — runs on every source block emit
+    // -------------------------------------------------------------
+    const onBlock = (block) => {
+        let blockNumber;
+        try {
+            blockNumber = BigInt(block.number);
+        }
+        catch {
+            onError?.('tx-tracker.onBlock', new Error(`bad block number: ${block.number}`));
+            return;
+        }
+        let blockTimestamp = 0n;
+        try {
+            blockTimestamp = BigInt(block.timestamp);
+        }
+        catch {
+            // leave 0n if timestamp didn't decode; not fatal
+        }
+        const blockHash = block.hash ?? '';
+        const txs = Array.isArray(block.transactions) ? block.transactions : [];
+        const txHashSet = new Set();
+        for (const tx of txs)
+            if (tx.hash)
+                txHashSet.add(tx.hash);
+        // Snapshot the pre-update ring + previous tip *before* we mutate
+        // anything — the reorg detector needs the ring as it stood
+        // before the new block landed in order to spot a same-height
+        // hash flip. `appendBlock` overwrites a same-height entry, so
+        // doing it before the comparison would erase the very evidence
+        // the detector relies on.
+        const previousRing = blockRing;
+        const previousTipNumber = latestTip?.number ?? null;
+        const newTip = {
+            number: blockNumber,
+            hash: blockHash,
+            parentHash: block.parentHash ?? null,
+            transactionHashes: txHashSet,
+        };
+        latestTip = newTip;
+        latestTipTimestamp = blockTimestamp;
+        blockRing = appendBlock(blockRing, newTip, reorgDepthBlocks * 2);
+        // Reorg detection on the pre-update ring vs the new tip. A
+        // divergence at the new tip's height = same-height-different-hash
+        // reorg; per spec §12.3 the event source is block-poll or
+        // subscription, never receipt-poll.
+        handleReorgs(previousRing, newTip);
+        // Capability transitions are checked once per block emit so
+        // signal-degraded / signal-recovered events carry the new tip's
+        // coordinate. The diff is global; the events fan out to every
+        // tracked hash whose subscription policy permits them.
+        handleCapabilityChange();
+        const eventSource = blockEventSource(source.capabilities());
+        // Bulk subscriptions run BEFORE per-hash inclusion bookkeeping
+        // so any auto-tracked hashes created for matched txs end up in
+        // the `tracked` map in time to receive their own seen-in-block
+        // event from the loop below. Reordering here is load-bearing —
+        // see the test "trackFromAddress autoTrackMatched: true creates
+        // per-hash subscriptions."
+        runBulkOnBlock(txs, eventSource);
+        // Per-hash inclusion check + confirmations + unseen-streak
+        // accounting. Delegated to `decideBlockObservation` (pure) — the
+        // orchestrator below merges the returned patches into the
+        // mutable record and emits the returned events.
+        const envelope = buildAt();
+        for (const record of tracked.values()) {
+            const result = decideBlockObservation({
+                record,
+                blockHash,
+                blockNumber,
+                txHashSet,
+                txs,
+                chainId,
+                eventSource,
+                envelope,
+                previousTipNumber,
+            });
+            applyObservationResult(record, result);
+            for (const event of result.events)
+                emit(record, event);
+        }
+    };
+    /**
+     * Compare the pre-update ring against the new tip via the reorg
+     * detector. A divergence at the new tip's height means the ring
+     * had a different hash there before — classic same-height reorg.
+     * For each divergence, every tracked hash whose recorded
+     * `lastSeenInBlock` pointed at the stale block emits
+     * `vanished-from-block`.
+     *
+     * Only the new tip is passed as the canonical sequence in v0.6.x
+     * — the detector is conservative about heights with no canonical
+     * info (per the reorg.ts design) so this stays safe with a
+     * single-block window.
+     */
+    const handleReorgs = (previousRing, newTip) => {
+        const divergences = detectDivergences({
+            ring: previousRing,
+            canonical: [newTip],
+            depthBlocks: reorgDepthBlocks,
+        });
+        if (divergences.length === 0)
+            return;
+        const eventSource = blockEventSource(source.capabilities());
+        for (const div of divergences) {
+            // Walk every tracked hash whose lastSeenInBlock referenced the
+            // stale hash at this height. The tx-set on the divergence is
+            // the authoritative scoper.
+            for (const record of tracked.values()) {
+                const seen = record.status.lastSeenInBlock;
+                if (!seen)
+                    continue;
+                if (seen.blockNumber !== div.blockNumber)
+                    continue;
+                // Belt-and-braces hash check: every record at this height
+                // was included when the canonical block had the previous
+                // hash, so this check is normally redundant — but it
+                // future-proofs against a hypothetical future where a
+                // tracker observes the same height through multiple sources
+                // before we reconcile them. Keeps the vanished-from-block
+                // emit honest.
+                /* c8 ignore next */
+                if (seen.blockHash !== div.previousBlockHash)
+                    continue;
+                record.status.vanishedAt = {
+                    previousBlockHash: div.previousBlockHash,
+                    canonicalBlockHash: div.canonicalBlockHash,
+                    blockNumber: div.blockNumber,
+                };
+                // Reset inclusion state — the tx is no longer in the
+                // canonical chain at the height we recorded.
+                record.status.lastSeenInBlock = null;
+                record.status.lastObservedAtBlock = newTip.number;
+                emit(record, buildVanishedFromBlock({
+                    hash: record.hash,
+                    chainId,
+                    source: eventSource,
+                    at: buildAt(),
+                    previousBlockHash: div.previousBlockHash,
+                    canonicalBlockHash: div.canonicalBlockHash,
+                    blockNumber: div.blockNumber,
+                }));
+            }
+        }
+    };
+    /**
+     * Compare the source's current capability snapshot to the last
+     * one we observed. Emit signal-degraded for newly-degraded
+     * capabilities, signal-recovered for newly-recovered ones. Per
+     * the per-subscription policy, `'silent'` callers are excluded
+     * from the per-record fanout.
+     */
+    const handleCapabilityChange = () => {
+        const next = source.capabilities();
+        const { degraded, recovered } = diffCapabilities(lastCaps, next);
+        if (degraded.length === 0 && recovered.length === 0)
+            return;
+        const fallback = blockEventSource(next);
+        for (const record of tracked.values()) {
+            const policy = record.lostSignalPolicy ?? defaultLostSignalPolicy;
+            if (policy === 'silent') {
+                record.status.capabilities = next;
+                continue;
+            }
+            for (const key of degraded) {
+                emit(record, buildSignalDegraded({
+                    hash: record.hash,
+                    chainId,
+                    source: fallback,
+                    at: buildAt(),
+                    capabilityLost: key,
+                    fallbackSource: fallback,
+                }));
+            }
+            for (const key of recovered) {
+                emit(record, buildSignalRecovered({
+                    hash: record.hash,
+                    chainId,
+                    source: fallback,
+                    at: buildAt(),
+                    capabilityRestored: key,
+                }));
+            }
+            record.status.capabilities = next;
+        }
+        lastCaps = next;
+    };
+    /**
+     * Apply a pure-decision result to a mutable internal record. The
+     * decision functions return narrow patches (only the fields they
+     * decided to change); this orchestrator merges them into the
+     * record in one place so mutation is bounded and auditable.
+     */
+    const applyObservationResult = (record, result) => {
+        if (Object.keys(result.statusPatch).length > 0) {
+            record.status = { ...record.status, ...result.statusPatch };
+        }
+        if (result.identityPatch) {
+            record.identity = result.identityPatch;
+        }
+        if (result.inMempoolPatch !== null) {
+            record.inLastMempoolSnapshot = result.inMempoolPatch;
+        }
+    };
+    // -------------------------------------------------------------
+    // Mempool path — runs on every source mempool emit
+    // -------------------------------------------------------------
+    const onMempool = (snapshot) => {
+        // Build a hash-keyed index once per snapshot — O(N) per snapshot
+        // but the per-tracked-hash lookup downstream is O(1).
+        const byHash = new Map();
+        for (const sender of Object.keys(snapshot.pending)) {
+            const nonces = snapshot.pending[sender];
+            for (const nonceKey of Object.keys(nonces)) {
+                const tx = nonces[nonceKey];
+                if (tx?.hash)
+                    byHash.set(tx.hash, { bucket: 'pending', tx });
+            }
+        }
+        for (const sender of Object.keys(snapshot.queued)) {
+            const nonces = snapshot.queued[sender];
+            for (const nonceKey of Object.keys(nonces)) {
+                const tx = nonces[nonceKey];
+                if (tx?.hash)
+                    byHash.set(tx.hash, { bucket: 'queued', tx });
+            }
+        }
+        const eventSource = mempoolEventSource(source.capabilities());
+        const envelope = buildAt();
+        const tipBlockNumber = latestTip?.number ?? 0n;
+        // Per-hash presence + replacement detection. Both delegated to
+        // `decideMempoolObservation` (pure). The orchestrator pre-
+        // computes the per-record replacement candidate from the
+        // snapshot so the decision function stays closure-free.
+        for (const record of tracked.values()) {
+            const presence = byHash.get(record.hash) ?? null;
+            const replacementInMempool = record.identity
+                ? findReplacementInMempool(snapshot, record.identity, record.hash)
+                : null;
+            const result = decideMempoolObservation({
+                record,
+                presence,
+                replacementInMempool,
+                chainId,
+                eventSource,
+                envelope,
+                tipBlockNumber,
+            });
+            applyObservationResult(record, result);
+            for (const event of result.events)
+                emit(record, event);
+        }
+        // Bulk subscriptions on the mempool path.
+        runBulkOnMempool(byHash, eventSource);
+    };
+    /**
+     * Pure mempool-snapshot lookup for a colliding `(from, nonce)`.
+     * Replaces the closure-based legacy helper — extracted for direct
+     * testability and to keep `decideMempoolObservation` pure.
+     *
+     * Normalizes the cached identity's nonce to decimal before keying
+     * into the snapshot's nonce-keyed sub-map (chain-source's
+     * `normalizeMempool` lowercases addresses + decimalizes nonces).
+     * If the cached nonce isn't valid hex (test fixtures or off-spec
+     * RPCs), the BigInt() throws — fallback uses the raw string as
+     * the key.
+     */
+    const findReplacementInMempool = (snapshot, identity, originalHash) => {
+        const senderKey = identity.from.toLowerCase();
+        let nonceKey;
+        try {
+            nonceKey = BigInt(identity.nonce).toString(10);
+        }
+        catch {
+            nonceKey = identity.nonce;
+        }
+        const buckets = ['pending', 'queued'];
+        for (const bucket of buckets) {
+            const senderTxs = snapshot[bucket][senderKey];
+            if (!senderTxs)
+                continue;
+            const tx = senderTxs[nonceKey];
+            if (tx?.hash && tx.hash !== originalHash)
+                return tx;
+        }
+        return null;
+    };
+    // -------------------------------------------------------------
+    // Bulk subscription helpers
+    // -------------------------------------------------------------
+    /**
+     * Fan-out helpers for both block + mempool ticks. The bulk
+     * registry guarantees that any sub still in `bulkSubs` is alive
+     * (`sub.stop()` does `bulkSubs.delete(id)`), so we don't need
+     * per-iteration "is it stopped?" guards here. The early return
+     * on size===0 keeps the hot path cheap when no bulk subs exist.
+     */
+    const runBulkOnBlock = (txs, _eventSource) => {
+        if (bulkSubs.size === 0)
+            return;
+        const compiled = [...bulkSubs.values()].map((sub) => sub.compiled);
+        fanOutBulkMatches(matchAll(txs, compiled), 'block-poll');
+    };
+    const runBulkOnMempool = (byHash, _eventSource) => {
+        if (bulkSubs.size === 0)
+            return;
+        const compiled = [...bulkSubs.values()].map((sub) => sub.compiled);
+        const txs = [...byHash.values()].map((v) => v.tx);
+        fanOutBulkMatches(matchAll(txs, compiled), 'mempool-snapshot');
+    };
+    /**
+     * Reverse-lookup: given a compiled selector reference, find its
+     * owning bulk sub. The `compiled.selector` reference is the same
+     * object the consumer registered, and every sub in `bulkSubs`
+     * carries it — so a miss here would mean the registry was
+     * mutated mid-fanout, which doesn't happen.
+     */
+    const findBulkSubBySelector = (selector) => {
+        for (const sub of bulkSubs.values()) {
+            if (sub.compiled.selector === selector)
+                return sub;
+        }
+        /* c8 ignore next */
+        throw new Error('tx-tracker: invariant violated — selector ref missing from bulkSubs');
+    };
+    const fanOutBulkMatches = (matches, matchSource) => {
+        for (const match of matches) {
+            const sub = findBulkSubBySelector(match.selector);
+            const event = {
+                kind: 'matched',
+                hash: match.hash,
+                matchedBy: match.matchedBy,
+                selector: match.selector,
+                tx: match.tx,
+                source: matchSource,
+                at: buildAt(),
+            };
+            sub.matchSubs.emit(event);
+            if (sub.options.autoTrackMatched && !sub.autoTrackedUnsubs.has(match.hash)) {
+                const unsub = subscribe(match.hash, (e) => sub.perHashSubs.emit(e), { emitInitial: false });
+                sub.autoTrackedUnsubs.set(match.hash, unsub);
+            }
+        }
+    };
+    // -------------------------------------------------------------
+    // Public surface
+    // -------------------------------------------------------------
+    const subscribe = (hash, cb, callerOptions) => {
+        const opts = callerOptions ?? {};
+        const record = ensureRecord(hash);
+        // Honor the most-restrictive `unseenThresholdBlocks` across
+        // active subscriptions on this hash. New subscriptions may be
+        // narrower than existing ones; the tracker takes the min.
+        if (opts.unseenThresholdBlocks !== undefined) {
+            record.unseenThresholdBlocks = Math.min(record.unseenThresholdBlocks, opts.unseenThresholdBlocks);
+        }
+        if (opts.lostSignalPolicy && record.lostSignalPolicy === null) {
+            record.lostSignalPolicy = opts.lostSignalPolicy;
+        }
+        if (opts.durable) {
+            record.hasDurableSub = true;
+            const subId = `sub-${nextSubId++}`;
+            record.persisted.push({
+                id: subId,
+                durable: true,
+                selector: { kind: 'hash', hash },
+            });
+            void store.put(toRecord(record)).catch((err) => onError?.('store.put', err));
+        }
+        const unsub = record.subs.subscribe(cb);
+        if (opts.emitInitial !== false) {
+            // Synthetic started event — does not pass through `emit` since
+            // the global stream / store should not see per-subscription
+            // synthetic frames.
+            cb(buildStarted({
+                hash,
+                chainId,
+                source: blockEventSource(source.capabilities()),
+                at: buildAt(),
+                capabilities: source.capabilities(),
+            }));
+        }
+        let unsubscribed = false;
+        return () => {
+            if (unsubscribed)
+                return;
+            unsubscribed = true;
+            // Final stopped event direct to the caller (single-shot) so
+            // they always see lifecycle closure even after unsubscribe.
+            cb(buildStopped({
+                hash,
+                chainId,
+                source: blockEventSource(source.capabilities()),
+                at: buildAt(),
+                reason: 'unsubscribed',
+            }));
+            unsub();
+            cleanupRecord(record);
+        };
+    };
+    const track = (hash, callerOptions) => {
+        return {
+            [Symbol.asyncIterator]: () => makeAsyncIterator(hash, callerOptions),
+        };
+    };
+    const subscribeAll = (cb) => globalSubs.subscribe(cb);
+    const makeBulkSub = (selector, callerOptions) => {
+        if (bulkSubs.size >= maxBulkSubscriptions) {
+            throw new Error(`tx-tracker: max bulk subscriptions (${maxBulkSubscriptions}) reached`);
+        }
+        const compiled = compileSelector(selector);
+        if (selector.kind === 'predicate' && callerOptions?.durable) {
+            onError?.('tx-tracker.bulk', new Error('predicate selectors are non-durable (spec §13.2); ignoring durable: true'));
+        }
+        const id = `bulk-${nextSubId++}`;
+        const sub = {
+            id,
+            compiled,
+            options: {
+                autoTrackMatched: callerOptions?.autoTrackMatched ?? true,
+                emitInitial: callerOptions?.emitInitial ?? true,
+                ...callerOptions,
+            },
+            matchSubs: new Subscriptions(),
+            perHashSubs: new Subscriptions(),
+            stopped: false,
+            autoTrackedUnsubs: new Map(),
+        };
+        bulkSubs.set(id, sub);
+        return {
+            events: () => makeBulkAsyncIterable(sub),
+            subscribe: (cb) => sub.perHashSubs.subscribe(cb),
+            stop: () => {
+                if (sub.stopped)
+                    return;
+                sub.stopped = true;
+                bulkSubs.delete(id);
+                // Auto-tracked per-hash subscriptions continue under their
+                // own retention rules per spec §11.1.
+            },
+        };
+    };
+    const trackFromAddress = (address, options) => makeBulkSub({ kind: 'from', address }, options);
+    const trackToAddress = (address, options) => makeBulkSub({ kind: 'to', address }, options);
+    const trackPredicate = (match, options) => makeBulkSub({ kind: 'predicate', match }, options);
+    // -------------------------------------------------------------
+    // Async iterator factory — backs `track()` and bulk events()
+    // -------------------------------------------------------------
+    const makeAsyncIterator = (hash, options) => {
+        const queue = [];
+        const waiters = [];
+        let done = false;
+        const cb = (event) => {
+            if (event.kind === 'stopped')
+                done = true;
+            const waiter = waiters.shift();
+            if (waiter) {
+                waiter({ value: event, done: false });
+                if (done) {
+                    // Drain remaining waiters with done after the stopped event.
+                    while (waiters.length > 0) {
+                        waiters.shift()({ value: undefined, done: true });
+                    }
+                }
+            }
+            else {
+                queue.push(event);
+            }
+        };
+        const unsub = subscribe(hash, cb, options);
+        return {
+            next: () => {
+                if (queue.length > 0) {
+                    const value = queue.shift();
+                    return Promise.resolve({ value, done: false });
+                }
+                if (done)
+                    return Promise.resolve({ value: undefined, done: true });
+                return new Promise((resolve) => {
+                    waiters.push(resolve);
+                });
+            },
+            return: () => {
+                unsub();
+                done = true;
+                // The unsub call above triggers the synthetic stopped event
+                // through the same `cb` that drains pending waiters, so by
+                // the time we get here the waiters queue is empty under
+                // normal flow. The drain stays as a belt-and-braces guard
+                // for any future code path that might call return() without
+                // the unsub-driven stopped emit.
+                while (waiters.length > 0) {
+                    /* c8 ignore next */
+                    waiters.shift()({ value: undefined, done: true });
+                }
+                return Promise.resolve({ value: undefined, done: true });
+            },
+        };
+    };
+    const makeBulkAsyncIterable = (sub) => {
+        return {
+            [Symbol.asyncIterator]: () => {
+                const queue = [];
+                const waiters = [];
+                let localDone = sub.stopped;
+                const unsub = sub.matchSubs.subscribe((event) => {
+                    const waiter = waiters.shift();
+                    if (waiter)
+                        waiter({ value: event, done: false });
+                    else
+                        queue.push(event);
+                });
+                return {
+                    next: () => {
+                        if (queue.length > 0) {
+                            return Promise.resolve({ value: queue.shift(), done: false });
+                        }
+                        if (localDone || sub.stopped) {
+                            return Promise.resolve({
+                                value: undefined,
+                                done: true,
+                            });
+                        }
+                        return new Promise((resolve) => {
+                            waiters.push(resolve);
+                        });
+                    },
+                    return: () => {
+                        localDone = true;
+                        unsub();
+                        while (waiters.length > 0) {
+                            waiters.shift()({
+                                value: undefined,
+                                done: true,
+                            });
+                        }
+                        return Promise.resolve({
+                            value: undefined,
+                            done: true,
+                        });
+                    },
+                };
+            },
+        };
+    };
+    // -------------------------------------------------------------
+    // Lifecycle
+    // -------------------------------------------------------------
+    const start = () => {
+        if (started)
+            return;
+        started = true;
+        lastCaps = source.capabilities();
+        unsubBlocks = source.subscribeBlocks(onBlock);
+        unsubMempool = source.subscribeMempool(onMempool);
+    };
+    const stop = () => {
+        if (!started)
+            return;
+        started = false;
+        unsubBlocks?.();
+        unsubMempool?.();
+        unsubBlocks = null;
+        unsubMempool = null;
+        // Emit stopped to every per-hash subscriber, then drop them.
+        for (const record of tracked.values()) {
+            const stoppedEvent = buildStopped({
+                hash: record.hash,
+                chainId,
+                source: blockEventSource(source.capabilities()),
+                at: buildAt(),
+                reason: 'tracker-stopped',
+            });
+            record.subs.emit(stoppedEvent);
+            globalSubs.emit(stoppedEvent);
+        }
+        tracked.clear();
+        for (const sub of bulkSubs.values())
+            sub.stopped = true;
+        bulkSubs.clear();
+        blockRing = [];
+        latestTip = null;
+    };
+    // Eager lifecycle: subscribe immediately on construction. Lazy
+    // waits for the first track/getStatus call. The capability probe
+    // itself runs eagerly in the source, independent of either case.
+    if (lifecycle === 'eager') {
+        // No-op; consumer calls `start()` explicitly. The eager/lazy
+        // distinction in v0.6.x affects internal book-keeping only.
+    }
+    return {
+        start,
+        stop,
+        getTxStatus: (hash) => {
+            const record = tracked.get(hash);
+            return record ? record.status : null;
+        },
+        track,
+        subscribe,
+        trackFromAddress,
+        trackToAddress,
+        trackPredicate,
+        capabilities: () => source.capabilities(),
+        subscribeAll,
+    };
+};
+//# sourceMappingURL=tracker.js.map