crypto-aio 0.0.3 → 0.1.0

package/dist/core/model/transaction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../src/core/model/transaction.ts"],"names":[],"mappings":"","sourcesContent":["import type { ErrorCode } from '../errors/codes';\nimport type { SigningRequest } from '../signing/types';\nimport type { Address } from './address';\nimport type { Amount } from './amount';\nimport type { AssetInfo, AssetRef } from './asset';\nimport type { FeeEstimateDraft } from './fee';\nimport type { IntentSummary } from './intent';\nimport type { OrderingData } from './ordering';\n\n/** Protocol data only (bytes or protocol JSON), never SDK objects. */\nexport interface RawTx {\n  readonly encoding: 'hex' | 'base64' | 'json';\n  readonly data: string;\n}\n\nexport type AttemptIdKind = 'tx-hash' | 'txid' | 'signature' | 'message-hash';\n\n/** Identity of a signed payload. `canonical: false` = not the final protocol tx hash (TON). */\nexport interface AttemptRef {\n  readonly id: string;\n  readonly idKind: AttemptIdKind;\n  readonly canonical: boolean;\n}\n\nexport type TxState =\n  | 'unknown'\n  | 'pending'\n  | 'mempool'\n  | 'included'\n  | 'final'\n  | 'failed'\n  | 'dropped'\n  | 'replaced'\n  | 'expired'\n  | 'refused'\n  | 'rejected';\n\nexport type Evidence = 'observed' | 'proven';\nexport type Finality = 'none' | 'probabilistic' | 'final';\n\nexport interface TxStatus {\n  readonly state: TxState;\n  readonly evidence: Evidence;\n  readonly confirmations: number;\n  readonly txHash?: string;\n  readonly blockHash?: string;\n  readonly blockHeight?: bigint;\n  readonly finality: Finality;\n  /**\n   * Why the transaction did not go through. Present only with `failed`, `refused` or\n   * `rejected`. It is either a broadcast's refusal or rejection text, or the chain\n   * driver's text for an on-chain failure. It is a short, fixed text with no addresses,\n   * amounts or node detail. It is `sensitive` data, so it never appears in events\n   * or logs.\n   */\n  readonly reason?: string;\n  readonly replacedBy?: string;\n}\n\nexport interface BlockRef {\n  readonly height: bigint;\n  readonly hash: string;\n  readonly timestamp?: number;\n}\n\nexport interface Block {\n  readonly height: bigint;\n  readonly hash: string;\n  readonly parentHash: string;\n  readonly timestamp?: number;\n  readonly transactionIds?: readonly string[];\n}\n\nexport type TransferSource = 'native' | 'token-event' | 'internal';\n\ninterface TransferBase {\n  /** Deterministic: `${txId}:${locator}`. */\n  readonly id: string;\n  readonly from: readonly Address[];\n  readonly to: Address;\n  readonly source: TransferSource;\n  readonly memo?: string;\n}\n\n/** A transfer whose asset resolved on this chain and network. */\nexport interface ResolvedTransfer extends TransferBase {\n  readonly asset: AssetInfo;\n  readonly amount: Amount;\n  readonly unresolved?: undefined;\n}\n\n/**\n * A transfer whose asset could not be resolved, for example a token with unusable\n * metadata or a failing decimals call. It has no `asset` and no `amount`: without the\n * asset's decimals there is no `Amount`. `unresolved` keeps the chain's raw data instead,\n * and the transaction's `decoding` is `'partial'`. A read never fails on such a transfer;\n * only a retryable failure fails the read, so it can be retried.\n */\nexport interface UnresolvedTransfer extends TransferBase {\n  readonly asset?: undefined;\n  readonly amount?: undefined;\n  readonly unresolved: {\n    /** The asset as the chain names it. */\n    readonly asset: AssetRef;\n    /** The amount in base units, never scaled. */\n    readonly amount: bigint;\n    /** Why the asset did not resolve, e.g. `ASSET_RESOLUTION`. */\n    readonly code: ErrorCode;\n  };\n}\n\n/** Check `unresolved` (or `amount`) before using a transfer's `asset` and `amount`. */\nexport type Transfer = ResolvedTransfer | UnresolvedTransfer;\n\nexport type Decoding = 'complete' | 'partial' | 'none';\n\nexport interface Transaction {\n  readonly id: string;\n  readonly chain: string;\n  readonly network: string;\n  readonly status: TxStatus;\n  readonly block?: BlockRef;\n  readonly fee?: readonly Amount[];\n  readonly transfers: readonly Transfer[];\n  readonly decoding: Decoding;\n  readonly raw?: RawTx;\n  readonly details: Readonly<Record<string, unknown>>;\n}\n\nexport interface UnsignedTx {\n  readonly payload: RawTx;\n  /** Only when identity is fixed before signing (Tron; UTXO with witness-only inputs). */\n  readonly expectedRef?: AttemptRef;\n  readonly signingRequests: readonly SigningRequest[];\n  readonly ordering: OrderingData;\n  readonly fee: FeeEstimateDraft;\n  readonly summary: IntentSummary;\n}\n\nexport interface SignedTx {\n  readonly raw: RawTx;\n  readonly ref: AttemptRef;\n}\n"]}

package/dist/core/observe/scanner.d.ts

@@ -0,0 +1,135 @@
+import { type MappingContext } from '../blockchain/mapping';
+import type { BlockSource } from '../driver/types';
+import type { EventBus } from '../events/bus';
+import type { AssetRef } from '../model/asset';
+import type { Block, Transaction } from '../model/transaction';
+import type { CursorStore } from '../store/types';
+import { type StaleViewSource } from '../transport/stale-view';
+import type { Clock } from '../util/clock';
+export interface ScannerOptions {
+    /** Durable name of this consumer's position (namespaced per container, chain and network). */
+    readonly cursorKey: string;
+    /**
+     * Where a NEW cursor starts; ignored when a stored cursor exists. Default `'latest'`. The
+     * new cursor also retains the `reorgWindow` blocks below the start, so a rollback within
+     * the first window can name blocks that were never delivered, and the replay that follows
+     * can start below `from`.
+     */
+    readonly from?: 'latest' | bigint;
+    /**
+     * `'final'` emits finalized blocks only; a rollback can then still come from a provider
+     * inconsistency. `'head'` follows the tip and may roll back within the window.
+     * Default `'head'`. The mode is not stored with the cursor: resuming a head-mode cursor in
+     * final mode keeps the unfinalized blocks it already delivered.
+     */
+    readonly mode?: 'final' | 'head';
+    /** Passed to the driver's block source; each entry is resolved on this chain and network. */
+    readonly filter?: {
+        readonly addresses?: readonly string[];
+        readonly assets?: readonly (AssetRef | string)[];
+    };
+    /** Blocks retained for rollback detection (default: the network's reorgWindow). */
+    readonly reorgWindow?: number;
+    readonly pollIntervalMs?: number;
+    /**
+     * Stops the scan, also while it waits for new blocks. `iterator.return()` only takes effect
+     * once a pending `next()` settles, so an idle scanner is stopped with this signal.
+     */
+    readonly signal?: AbortSignal;
+}
+export interface Checkpoint {
+    readonly height: bigint;
+    readonly hash: string;
+}
+/** A scan event without its `ack()`: a delivered block, or a rollback to a checkpoint. */
+export type ScanEventBody = {
+    readonly type: 'block';
+    readonly block: Block;
+    readonly transactions: readonly Transaction[];
+} | {
+    readonly type: 'rollback';
+    readonly to: Checkpoint;
+    readonly removed: readonly Checkpoint[];
+};
+export type ScanEvent = ScanEventBody & {
+    ack(): Promise<void>;
+};
+export interface ScannerDeps {
+    readonly load: () => Promise<{
+        readonly mapping: MappingContext;
+        readonly blocks: BlockSource;
+        /** The verified height watermark and lag tolerance behind the stale-view guard. */
+        readonly transport: StaleViewSource;
+    }>;
+    readonly cursors: CursorStore;
+    readonly events: EventBus;
+    readonly clock: Clock;
+    readonly namespace: string;
+    readonly defaults: {
+        readonly reorgWindow: number;
+        readonly pollIntervalMs: number;
+    };
+}
+/**
+ * Reorg-aware, at-least-once block scanner. Each event's `ack()` commits the
+ * cursor (compare-and-set on its version, so two scanners sharing a `cursorKey` never both
+ * commit the same advance); asking for the next event first throws `INVALID_TRANSITION`.
+ * A view that cannot decide (stale, or missing a block) never causes a rollback: the
+ * scanner waits a poll interval and looks again, as it does after a retryable provider error.
+ *
+ * A cursor stopped by `SCANNER_REORG_TOO_DEEP` is reset explicitly: scan under a new
+ * `cursorKey`, or `put` a checkpoint `{ height, hash, recent }` for its key through the
+ * `CursorStore`. A checkpoint without `recent` is validated on its own block, and its
+ * window is then refilled from the chain below that block.
+ */
+export declare class Scanner implements AsyncIterable<ScanEvent> {
+    private readonly deps;
+    private readonly options;
+    constructor(deps: ScannerDeps, options: ScannerOptions);
+    [Symbol.asyncIterator](): AsyncIterator<ScanEvent>;
+    private run;
+    /** Normalizes the filter on this chain and network (the driver's codec and asset service). */
+    private scanFilter;
+    /**
+     * A new cursor sits just below the start height and retains the `window` blocks beneath
+     * it, so a reorg early in the scan is still resolvable. `undefined` (wait) while the
+     * chain's tip for this mode is below the start's parent, or its blocks are not visible
+     * as one consistent chain yet.
+     */
+    private initialCursor;
+    /**
+     * Up to `count` checkpoints ending at `height`, oldest first, read down the parent links;
+     * with `hash`, the block at `height` must have it. `undefined` (wait) when a block is not
+     * visible or the links do not hold.
+     */
+    private loadWindow;
+    /**
+     * Extends a window that a rollback trimmed back down to `window` entries from the chain,
+     * which is canonical at and below the common ancestor. `undefined` (wait) on a gap.
+     */
+    private refill;
+    private nextBlock;
+    /**
+     * Walks the retained window newest-first to the common ancestor with the canonical chain.
+     * Returns `'canonical'` when the cursor's own block still is, a rollback step when an older
+     * block is, and `undefined` when this view cannot decide: it is stale, or it does not show
+     * a block yet (absence is never divergence). Throws `SCANNER_REORG_TOO_DEEP` only when
+     * every retained block is visible and none is canonical. The rolled-back cursor's window
+     * is refilled from the chain below the ancestor. A rollback or TOO_DEEP verdict of this
+     * header walk stands only once the proof quorum confirms it, so one endpoint serving a
+     * fork never rolls a cursor back. Only verdicts are confirmed: a block's transactions
+     * are still read from the one endpoint that serves them.
+     */
+    private findRollback;
+    /**
+     * Whether the quorum-served hashes confirm a verdict: every `removed` block has been
+     * replaced at its height, and `ancestor` (when given) is still canonical. No block at a
+     * height decides nothing (`false`); a quorum that disagrees throws a retryable error,
+     * which the scan loop also treats as "look again later".
+     */
+    private confirmed;
+    /** The monitor's stale-view guard (`isStaleView`): a stale view decides nothing. */
+    private staleView;
+    /** Operational data only: never addresses, amounts or hashes. */
+    private emit;
+}

package/dist/core/observe/scanner.js

@@ -0,0 +1,355 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Scanner = void 0;
+const mapping_1 = require("../blockchain/mapping");
+const error_1 = require("../errors/error");
+const stale_view_1 = require("../transport/stale-view");
+const isAssetInput = (value) => typeof value === 'string'
+    ? value.length > 0
+    : typeof value === 'object' &&
+        value !== null &&
+        typeof value.standard === 'string' &&
+        typeof value.contract === 'string';
+function assertFilter(filter, invalid) {
+    if (filter === undefined)
+        return;
+    if (typeof filter !== 'object' || filter === null)
+        throw invalid('filter must be an object');
+    const { addresses, assets } = filter;
+    if (addresses !== undefined &&
+        (!Array.isArray(addresses) || !addresses.every((a) => typeof a === 'string')))
+        throw invalid('filter.addresses must be an array of address strings');
+    if (assets !== undefined && (!Array.isArray(assets) || !assets.every(isAssetInput)))
+        throw invalid('filter.assets must be an array of asset refs or asset ids');
+}
+function assertOptions(options) {
+    const invalid = (message) => new error_1.ConfigError('CONFIG_INVALID', `scanner ${message}`);
+    const { cursorKey, from, mode, reorgWindow, pollIntervalMs } = options;
+    assertFilter(options.filter, invalid);
+    if (typeof cursorKey !== 'string' || cursorKey.length === 0)
+        throw invalid('cursorKey must be a non-empty string');
+    if (from !== undefined && from !== 'latest' && (typeof from !== 'bigint' || from < 0n))
+        throw invalid("from must be 'latest' or a non-negative bigint height");
+    if (mode !== undefined && mode !== 'final' && mode !== 'head')
+        throw invalid("mode must be 'final' or 'head'");
+    if (reorgWindow !== undefined &&
+        (!Number.isSafeInteger(reorgWindow) || reorgWindow < 1))
+        throw invalid('reorgWindow must be a positive integer');
+    if (pollIntervalMs !== undefined &&
+        (typeof pollIntervalMs !== 'number' ||
+            !Number.isFinite(pollIntervalMs) ||
+            pollIntervalMs <= 0))
+        throw invalid('pollIntervalMs must be a finite number greater than 0');
+}
+/** The cursor's window; a reset checkpoint stored without one is its own window. */
+function windowOf(cursor) {
+    if (cursor.recent.length > 0 || cursor.height < 0n)
+        return cursor.recent;
+    return [{ height: cursor.height, hash: cursor.hash }];
+}
+function sameCursor(a, b) {
+    return (a.height === b.height &&
+        a.hash === b.hash &&
+        a.recent.length === b.recent.length &&
+        a.recent.every((r, i) => r.height === b.recent[i]?.height && r.hash === b.recent[i]?.hash));
+}
+/**
+ * Reorg-aware, at-least-once block scanner. Each event's `ack()` commits the
+ * cursor (compare-and-set on its version, so two scanners sharing a `cursorKey` never both
+ * commit the same advance); asking for the next event first throws `INVALID_TRANSITION`.
+ * A view that cannot decide (stale, or missing a block) never causes a rollback: the
+ * scanner waits a poll interval and looks again, as it does after a retryable provider error.
+ *
+ * A cursor stopped by `SCANNER_REORG_TOO_DEEP` is reset explicitly: scan under a new
+ * `cursorKey`, or `put` a checkpoint `{ height, hash, recent }` for its key through the
+ * `CursorStore`. A checkpoint without `recent` is validated on its own block, and its
+ * window is then refilled from the chain below that block.
+ */
+class Scanner {
+    deps;
+    options;
+    constructor(deps, options) {
+        this.deps = deps;
+        this.options = options;
+        assertOptions(options);
+    }
+    [Symbol.asyncIterator]() {
+        return this.run();
+    }
+    async *run() {
+        const { signal } = this.options;
+        const { mapping, blocks, transport } = await this.deps.load();
+        const reader = mapping.driver.reader;
+        const { chain, network } = mapping.selection;
+        const key = `${this.deps.namespace}:${chain.id}:${network.id}:${this.options.cursorKey}`;
+        const window = this.options.reorgWindow ?? this.deps.defaults.reorgWindow;
+        // Resolved inside the loop, so a transient failure resolving filter.assets is retried.
+        let source;
+        const poll = this.options.pollIntervalMs ?? this.deps.defaults.pollIntervalMs;
+        const tip = () => this.options.mode === 'final'
+            ? reader.getFinalizedHeight()
+            : reader.getBlockHeight();
+        const stored = await this.deps.cursors.get(key);
+        let version = stored?.version ?? null;
+        let cursor = stored?.cursor;
+        // A stored cursor is re-validated against the canonical chain before anything is emitted.
+        let validated = stored === null;
+        while (!signal?.aborted) {
+            let step;
+            try {
+                source ??= {
+                    mapping,
+                    blocks,
+                    transport,
+                    window,
+                    filter: await this.scanFilter(mapping),
+                };
+                cursor ??= await this.initialCursor(source, await tip());
+                if (cursor) {
+                    let verdict = validated ? 'canonical' : await this.findRollback(source, cursor);
+                    if (!validated && verdict === 'canonical') {
+                        // A short window (a reset checkpoint) is refilled from the chain below the
+                        // validated block, so a reorg within the window still rolls back.
+                        const recent = await this.refill(source, windowOf(cursor));
+                        if (recent)
+                            cursor = { ...cursor, recent };
+                        else
+                            verdict = undefined;
+                    }
+                    validated = verdict !== undefined;
+                    step =
+                        verdict === 'canonical'
+                            ? await this.nextBlock(source, cursor, await tip())
+                            : verdict;
+                }
+            }
+            catch (error) {
+                // Like `watch`: a transient provider failure is retried on the next poll.
+                if (signal?.aborted)
+                    return;
+                if (!(0, error_1.isCryptoAioError)(error) || !error.retryable)
+                    throw error;
+            }
+            if (signal?.aborted)
+                return;
+            if (!step) {
+                try {
+                    await this.deps.clock.sleep(poll, signal);
+                }
+                catch {
+                    return;
+                }
+                continue;
+            }
+            const { event, next } = step;
+            let acked = false;
+            let commit;
+            // Set once one of our puts for this event ended without a known outcome.
+            let uncertain = false;
+            const commitCursor = async () => {
+                try {
+                    version = await this.deps.cursors.put(key, next, version);
+                }
+                catch (error) {
+                    const conflict = (0, error_1.isCryptoAioError)(error, 'VERSION_CONFLICT');
+                    // A conflict may be our own put having landed only after one ended unseen (or when
+                    // the store says so); a first-try conflict is another scanner on this key.
+                    const recheck = conflict && (uncertain || error.ambiguous);
+                    const stored = recheck ? await this.deps.cursors.get(key) : null;
+                    if (!stored || !sameCursor(stored.cursor, next)) {
+                        if (!conflict)
+                            uncertain = true;
+                        throw error;
+                    }
+                    version = stored.version;
+                }
+                cursor = next;
+                acked = true;
+                this.emit(event);
+            };
+            yield {
+                ...event,
+                // Concurrent calls share one commit; a failed commit can be retried.
+                ack: () => (commit ??= commitCursor().catch((error) => {
+                    commit = undefined;
+                    throw error;
+                })),
+            };
+            if (!acked) {
+                throw new error_1.StateError('INVALID_TRANSITION', 'ack() the previous scan event before requesting the next one');
+            }
+        }
+    }
+    /** Normalizes the filter on this chain and network (the driver's codec and asset service). */
+    async scanFilter(mapping) {
+        const { addresses, assets } = this.options.filter ?? {};
+        if (addresses === undefined && assets === undefined)
+            return undefined;
+        const { selection, driver } = mapping;
+        return {
+            ...(addresses
+                ? { addresses: addresses.map((a) => driver.address.normalize(a).canonical) }
+                : {}),
+            ...(assets
+                ? {
+                    assets: await Promise.all(assets.map(async (a) => (await mapping.assets.resolve(selection, driver, a)).ref)),
+                }
+                : {}),
+        };
+    }
+    /**
+     * A new cursor sits just below the start height and retains the `window` blocks beneath
+     * it, so a reorg early in the scan is still resolvable. `undefined` (wait) while the
+     * chain's tip for this mode is below the start's parent, or its blocks are not visible
+     * as one consistent chain yet.
+     */
+    async initialCursor(source, tip) {
+        const from = this.options.from ?? 'latest';
+        const start = from === 'latest' ? tip : from;
+        if (start <= 0n)
+            return { height: -1n, hash: '', recent: [] };
+        if (start - 1n > tip)
+            return undefined;
+        const recent = await this.loadWindow(source, start - 1n, source.window);
+        const top = recent?.[recent.length - 1];
+        return recent && top && { height: top.height, hash: top.hash, recent };
+    }
+    /**
+     * Up to `count` checkpoints ending at `height`, oldest first, read down the parent links;
+     * with `hash`, the block at `height` must have it. `undefined` (wait) when a block is not
+     * visible or the links do not hold.
+     */
+    async loadWindow(source, height, count, hash) {
+        const loaded = [];
+        let expected = hash;
+        for (let h = height; h >= 0n && loaded.length < count; h--) {
+            const header = await source.blocks.header(h);
+            if (!header || (expected !== undefined && header.hash !== expected))
+                return undefined;
+            loaded.unshift({ height: header.height, hash: header.hash });
+            expected = header.parentHash;
+        }
+        return loaded;
+    }
+    /**
+     * Extends a window that a rollback trimmed back down to `window` entries from the chain,
+     * which is canonical at and below the common ancestor. `undefined` (wait) on a gap.
+     */
+    async refill(source, kept) {
+        const oldest = kept[0];
+        if (!oldest || kept.length >= source.window || oldest.height === 0n)
+            return kept;
+        const missing = source.window - kept.length;
+        const below = await this.loadWindow(source, oldest.height, missing + 1, oldest.hash);
+        return below && [...below.slice(0, -1), ...kept];
+    }
+    async nextBlock(source, cursor, tip) {
+        const height = cursor.height + 1n;
+        if (height > tip)
+            return undefined;
+        const header = await source.blocks.header(height);
+        if (!header)
+            return undefined;
+        if (cursor.height >= 0n && header.parentHash !== cursor.hash) {
+            const verdict = await this.findRollback(source, cursor);
+            // The cursor's block is still canonical, so the two reads disagreed: look again later.
+            return verdict === 'canonical' ? undefined : verdict;
+        }
+        const transactions = await source.blocks.transactions(header, source.filter);
+        const reader = source.mapping.driver.reader;
+        const [head, finalized] = await Promise.all([
+            reader.getBlockHeight(),
+            reader.getFinalizedHeight(),
+        ]);
+        const mapped = await Promise.all(transactions.map((tx) => (0, mapping_1.toTransaction)(source.mapping, tx, head, finalized)));
+        const checkpoint = { height: header.height, hash: header.hash };
+        return {
+            event: { type: 'block', block: (0, mapping_1.toBlock)(header), transactions: mapped },
+            next: {
+                ...checkpoint,
+                recent: [...windowOf(cursor), checkpoint].slice(-source.window),
+            },
+        };
+    }
+    /**
+     * Walks the retained window newest-first to the common ancestor with the canonical chain.
+     * Returns `'canonical'` when the cursor's own block still is, a rollback step when an older
+     * block is, and `undefined` when this view cannot decide: it is stale, or it does not show
+     * a block yet (absence is never divergence). Throws `SCANNER_REORG_TOO_DEEP` only when
+     * every retained block is visible and none is canonical. The rolled-back cursor's window
+     * is refilled from the chain below the ancestor. A rollback or TOO_DEEP verdict of this
+     * header walk stands only once the proof quorum confirms it, so one endpoint serving a
+     * fork never rolls a cursor back. Only verdicts are confirmed: a block's transactions
+     * are still read from the one endpoint that serves them.
+     */
+    async findRollback(source, cursor) {
+        if (cursor.height < 0n)
+            return 'canonical';
+        if (await this.staleView(source))
+            return undefined;
+        const window = windowOf(cursor);
+        const newestFirst = [...window].reverse();
+        for (const [i, entry] of newestFirst.entries()) {
+            const canonical = await source.blocks.header(entry.height);
+            if (!canonical)
+                return undefined;
+            if (canonical.hash !== entry.hash)
+                continue;
+            if (i === 0)
+                return 'canonical';
+            if (!(await this.confirmed(source, newestFirst.slice(0, i), entry)))
+                return undefined;
+            const recent = await this.refill(source, window.filter((r) => r.height <= entry.height));
+            if (!recent)
+                return undefined;
+            return {
+                event: { type: 'rollback', to: entry, removed: newestFirst.slice(0, i) },
+                next: { height: entry.height, hash: entry.hash, recent },
+            };
+        }
+        if (!(await this.confirmed(source, newestFirst)))
+            return undefined;
+        throw new error_1.StateError('SCANNER_REORG_TOO_DEEP', `the chain diverged deeper than the ${source.window}-block window of cursor '${this.options.cursorKey}'; reset the cursor explicitly`);
+    }
+    /**
+     * Whether the quorum-served hashes confirm a verdict: every `removed` block has been
+     * replaced at its height, and `ancestor` (when given) is still canonical. No block at a
+     * height decides nothing (`false`); a quorum that disagrees throws a retryable error,
+     * which the scan loop also treats as "look again later".
+     */
+    async confirmed(source, removed, ancestor) {
+        const { proofs } = source.mapping.driver;
+        for (const entry of removed) {
+            const hash = await proofs.blockHash(entry.height, 'latest');
+            if (hash === null || hash === entry.hash)
+                return false;
+        }
+        if (ancestor === undefined)
+            return true;
+        return (await proofs.blockHash(ancestor.height, 'latest')) === ancestor.hash;
+    }
+    /** The monitor's stale-view guard (`isStaleView`): a stale view decides nothing. */
+    async staleView(source) {
+        return (0, stale_view_1.isStaleView)(source.transport, await source.mapping.driver.reader.getBlockHeight());
+    }
+    /** Operational data only: never addresses, amounts or hashes. */
+    emit(event) {
+        if (event.type === 'block') {
+            this.deps.events.emit('scanner.block', {
+                namespace: this.deps.namespace,
+                cursorKey: this.options.cursorKey,
+                height: event.block.height.toString(),
+            });
+        }
+        else {
+            this.deps.events.emit('scanner.rollback', {
+                namespace: this.deps.namespace,
+                cursorKey: this.options.cursorKey,
+                toHeight: event.to.height.toString(),
+                removed: event.removed.length,
+            });
+        }
+    }
+}
+exports.Scanner = Scanner;
+//# sourceMappingURL=scanner.js.map

package/dist/core/observe/scanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scanner.js","sourceRoot":"","sources":["../../../src/core/observe/scanner.ts"],"names":[],"mappings":";;;AAAA,mDAAoF;AAEpF,2CAA4E;AAK5E,wDAA4E;AAmF5E,MAAM,YAAY,GAAG,CAAC,KAAc,EAAW,EAAE,CAC/C,OAAO,KAAK,KAAK,QAAQ;IACvB,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;IAClB,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAQ,KAAgC,CAAC,QAAQ,KAAK,QAAQ;QAC9D,OAAQ,KAAgC,CAAC,QAAQ,KAAK,QAAQ,CAAC;AAErE,SAAS,YAAY,CAAC,MAAgC,EAAE,OAA6B;IACnF,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO;IACjC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;QAC/C,MAAM,OAAO,CAAC,0BAA0B,CAAC,CAAC;IAC5C,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IACrC,IACE,SAAS,KAAK,SAAS;QACvB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;QAE7E,MAAM,OAAO,CAAC,sDAAsD,CAAC,CAAC;IACxE,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACjF,MAAM,OAAO,CAAC,2DAA2D,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,aAAa,CAAC,OAAuB;IAC5C,MAAM,OAAO,GAAG,CAAC,OAAe,EAAE,EAAE,CAClC,IAAI,mBAAW,CAAC,gBAAgB,EAAE,WAAW,OAAO,EAAE,CAAC,CAAC;IAC1D,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC;IACvE,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACtC,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QACzD,MAAM,OAAO,CAAC,sCAAsC,CAAC,CAAC;IACxD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,EAAE,CAAC;QACpF,MAAM,OAAO,CAAC,uDAAuD,CAAC,CAAC;IACzE,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,MAAM;QAC3D,MAAM,OAAO,CAAC,gCAAgC,CAAC,CAAC;IAClD,IACE,WAAW,KAAK,SAAS;QACzB,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,CAAC;QAEvD,MAAM,OAAO,CAAC,wCAAwC,CAAC,CAAC;IAC1D,IACE,cAAc,KAAK,SAAS;QAC5B,CAAC,OAAO,cAAc,KAAK,QAAQ;YACjC,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC;YAChC,cAAc,IAAI,CAAC,CAAC;QAEtB,MAAM,OAAO,CAAC,uDAAuD,CAAC,CAAC;AAC3E,CAAC;AAED,oFAAoF;AACpF,SAAS,QAAQ,CAAC,MAAkB;IAClC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC;IACzE,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,UAAU,CAAC,CAAa,EAAE,CAAa;IAC9C,OAAO,CACL,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACrB,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QACjB,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;QACnC,CAAC,CAAC,MAAM,CAAC,KAAK,CACZ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAC3E,CACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,OAAO;IAEC;IACA;IAFnB,YACmB,IAAiB,EACjB,OAAuB;QADvB,SAAI,GAAJ,IAAI,CAAa;QACjB,YAAO,GAAP,OAAO,CAAgB;QAExC,aAAa,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IAEO,KAAK,CAAC,CAAC,GAAG;QAChB,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QAChC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QACrC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACzF,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC1E,uFAAuF;QACvF,IAAI,MAA0B,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC;QAC9E,MAAM,GAAG,GAAG,GAAG,EAAE,CACf,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,OAAO;YAC3B,CAAC,CAAC,MAAM,CAAC,kBAAkB,EAAE;YAC7B,CAAC,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,OAAO,GAAG,MAAM,EAAE,OAAO,IAAI,IAAI,CAAC;QACtC,IAAI,MAAM,GAAG,MAAM,EAAE,MAAM,CAAC;QAC5B,0FAA0F;QAC1F,IAAI,SAAS,GAAG,MAAM,KAAK,IAAI,CAAC;QAChC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;YACxB,IAAI,IAAsB,CAAC;YAC3B,IAAI,CAAC;gBACH,MAAM,KAAK;oBACT,OAAO;oBACP,MAAM;oBACN,SAAS;oBACT,MAAM;oBACN,MAAM,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;iBACvC,CAAC;gBACF,MAAM,KAAK,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;gBACzD,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;oBAChF,IAAI,CAAC,SAAS,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;wBAC1C,2EAA2E;wBAC3E,kEAAkE;wBAClE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC3D,IAAI,MAAM;4BAAE,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,CAAC;;4BACtC,OAAO,GAAG,SAAS,CAAC;oBAC3B,CAAC;oBACD,SAAS,GAAG,OAAO,KAAK,SAAS,CAAC;oBAClC,IAAI;wBACF,OAAO,KAAK,WAAW;4BACrB,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;4BACnD,CAAC,CAAC,OAAO,CAAC;gBAChB,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,0EAA0E;gBAC1E,IAAI,MAAM,EAAE,OAAO;oBAAE,OAAO;gBAC5B,IAAI,CAAC,IAAA,wBAAgB,EAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;oBAAE,MAAM,KAAK,CAAC;YAChE,CAAC;YACD,IAAI,MAAM,EAAE,OAAO;gBAAE,OAAO;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC;gBAAC,MAAM,CAAC;oBACP,OAAO;gBACT,CAAC;gBACD,SAAS;YACX,CAAC;YACD,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;YAC7B,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,IAAI,MAAiC,CAAC;YACtC,yEAAyE;YACzE,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,YAAY,GAAG,KAAK,IAAmB,EAAE;gBAC7C,IAAI,CAAC;oBACH,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC5D,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,MAAM,QAAQ,GAAG,IAAA,wBAAgB,EAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;oBAC7D,mFAAmF;oBACnF,2EAA2E;oBAC3E,MAAM,OAAO,GAAG,QAAQ,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;oBAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBACjE,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBAChD,IAAI,CAAC,QAAQ;4BAAE,SAAS,GAAG,IAAI,CAAC;wBAChC,MAAM,KAAK,CAAC;oBACd,CAAC;oBACD,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;gBAC3B,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;gBACd,KAAK,GAAG,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC,CAAC;YACF,MAAM;gBACJ,GAAG,KAAK;gBACR,qEAAqE;gBACrE,GAAG,EAAE,GAAG,EAAE,CACR,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;oBAClD,MAAM,GAAG,SAAS,CAAC;oBACnB,MAAM,KAAK,CAAC;gBACd,CAAC,CAAC,CAAC;aACN,CAAC;YACF,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,kBAAU,CAClB,oBAAoB,EACpB,8DAA8D,CAC/D,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,8FAA8F;IACtF,KAAK,CAAC,UAAU,CAAC,OAAuB;QAC9C,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;QACxD,IAAI,SAAS,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACtE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QACtC,OAAO;YACL,GAAG,CAAC,SAAS;gBACX,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;gBAC5E,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,MAAM;gBACR,CAAC,CAAC;oBACE,MAAM,EAAE,MAAM,OAAO,CAAC,GAAG,CACvB,MAAM,CAAC,GAAG,CACR,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CACtE,CACF;iBACF;gBACH,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,aAAa,CACzB,MAAc,EACd,GAAW;QAEX,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,IAAI,KAAK,IAAI,EAAE;YAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC9D,IAAI,KAAK,GAAG,EAAE,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxE,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,OAAO,MAAM,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,UAAU,CACtB,MAAc,EACd,MAAc,EACd,KAAa,EACb,IAAa;QAEb,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3D,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;gBACjE,OAAO,SAAS,CAAC;YACnB,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,MAAM,CAClB,MAAc,EACd,IAA2B;QAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QACjF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACrF,OAAO,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;IACnD,CAAC;IAEO,KAAK,CAAC,SAAS,CACrB,MAAc,EACd,MAAkB,EAClB,GAAW;QAEX,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;QAClC,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QAC9B,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,UAAU,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACxD,uFAAuF;YACvF,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;QACvD,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7E,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC1C,MAAM,CAAC,cAAc,EAAE;YACvB,MAAM,CAAC,kBAAkB,EAAE;SAC5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAC9B,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAA,uBAAa,EAAC,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAC7E,CAAC;QACF,MAAM,UAAU,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO;YACL,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE;YACtE,IAAI,EAAE;gBACJ,GAAG,UAAU;gBACb,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;aAChE;SACF,CAAC;IACJ,CAAC;IAED;;;;;;;;;;OAUG;IACK,KAAK,CAAC,YAAY,CACxB,MAAc,EACd,MAAkB;QAElB,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;YAAE,OAAO,WAAW,CAAC;QAC3C,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YAAE,OAAO,SAAS,CAAC;QACnD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,WAAW,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS;gBAAE,OAAO,SAAS,CAAC;YACjC,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;gBAAE,SAAS;YAC5C,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,WAAW,CAAC;YAChC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACjE,OAAO,SAAS,CAAC;YACnB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAC9B,MAAM,EACN,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAC/C,CAAC;YACF,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,OAAO;gBACL,KAAK,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACxE,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE;aACzD,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACnE,MAAM,IAAI,kBAAU,CAClB,wBAAwB,EACxB,sCAAsC,MAAM,CAAC,MAAM,4BAA4B,IAAI,CAAC,OAAO,CAAC,SAAS,gCAAgC,CACtI,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,SAAS,CACrB,MAAc,EACd,OAA8B,EAC9B,QAAqB;QAErB,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC5D,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;QACzD,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACxC,OAAO,CAAC,MAAM,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC;IAC/E,CAAC;IAED,oFAAoF;IAC5E,KAAK,CAAC,SAAS,CAAC,MAAc;QACpC,OAAO,IAAA,wBAAW,EAChB,MAAM,CAAC,SAAS,EAChB,MAAM,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,CACpD,CAAC;IACJ,CAAC;IAED,iEAAiE;IACzD,IAAI,CAAC,KAAoB;QAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE;gBACrC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;gBAC9B,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;gBACjC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE;aACtC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE;gBACxC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;gBAC9B,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;gBACjC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;gBACpC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;aAC9B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF;AAxTD,0BAwTC","sourcesContent":["import { toBlock, toTransaction, type MappingContext } from '../blockchain/mapping';\nimport type { BlockSource, ScanFilter } from '../driver/types';\nimport { ConfigError, StateError, isCryptoAioError } from '../errors/error';\nimport type { EventBus } from '../events/bus';\nimport type { AssetRef } from '../model/asset';\nimport type { Block, Transaction } from '../model/transaction';\nimport type { CursorStore, ScanCursor } from '../store/types';\nimport { isStaleView, type StaleViewSource } from '../transport/stale-view';\nimport type { Clock } from '../util/clock';\n\nexport interface ScannerOptions {\n  /** Durable name of this consumer's position (namespaced per container, chain and network). */\n  readonly cursorKey: string;\n  /**\n   * Where a NEW cursor starts; ignored when a stored cursor exists. Default `'latest'`. The\n   * new cursor also retains the `reorgWindow` blocks below the start, so a rollback within\n   * the first window can name blocks that were never delivered, and the replay that follows\n   * can start below `from`.\n   */\n  readonly from?: 'latest' | bigint;\n  /**\n   * `'final'` emits finalized blocks only; a rollback can then still come from a provider\n   * inconsistency. `'head'` follows the tip and may roll back within the window.\n   * Default `'head'`. The mode is not stored with the cursor: resuming a head-mode cursor in\n   * final mode keeps the unfinalized blocks it already delivered.\n   */\n  readonly mode?: 'final' | 'head';\n  /** Passed to the driver's block source; each entry is resolved on this chain and network. */\n  readonly filter?: {\n    readonly addresses?: readonly string[];\n    readonly assets?: readonly (AssetRef | string)[];\n  };\n  /** Blocks retained for rollback detection (default: the network's reorgWindow). */\n  readonly reorgWindow?: number;\n  readonly pollIntervalMs?: number;\n  /**\n   * Stops the scan, also while it waits for new blocks. `iterator.return()` only takes effect\n   * once a pending `next()` settles, so an idle scanner is stopped with this signal.\n   */\n  readonly signal?: AbortSignal;\n}\n\nexport interface Checkpoint {\n  readonly height: bigint;\n  readonly hash: string;\n}\n\n/** A scan event without its `ack()`: a delivered block, or a rollback to a checkpoint. */\nexport type ScanEventBody =\n  | {\n      readonly type: 'block';\n      readonly block: Block;\n      readonly transactions: readonly Transaction[];\n    }\n  | {\n      readonly type: 'rollback';\n      readonly to: Checkpoint;\n      readonly removed: readonly Checkpoint[];\n    };\n\nexport type ScanEvent = ScanEventBody & { ack(): Promise<void> };\n\nexport interface ScannerDeps {\n  readonly load: () => Promise<{\n    readonly mapping: MappingContext;\n    readonly blocks: BlockSource;\n    /** The verified height watermark and lag tolerance behind the stale-view guard. */\n    readonly transport: StaleViewSource;\n  }>;\n  readonly cursors: CursorStore;\n  readonly events: EventBus;\n  readonly clock: Clock;\n  readonly namespace: string;\n  readonly defaults: { readonly reorgWindow: number; readonly pollIntervalMs: number };\n}\n\ninterface Step {\n  readonly event: ScanEventBody;\n  readonly next: ScanCursor;\n}\n\n/** What one iteration of a scan reads through. */\ninterface Source {\n  readonly mapping: MappingContext;\n  readonly blocks: BlockSource;\n  readonly transport: StaleViewSource;\n  readonly window: number;\n  readonly filter: ScanFilter | undefined;\n}\n\nconst isAssetInput = (value: unknown): boolean =>\n  typeof value === 'string'\n    ? value.length > 0\n    : typeof value === 'object' &&\n      value !== null &&\n      typeof (value as { standard?: unknown }).standard === 'string' &&\n      typeof (value as { contract?: unknown }).contract === 'string';\n\nfunction assertFilter(filter: ScannerOptions['filter'], invalid: (m: string) => Error) {\n  if (filter === undefined) return;\n  if (typeof filter !== 'object' || filter === null)\n    throw invalid('filter must be an object');\n  const { addresses, assets } = filter;\n  if (\n    addresses !== undefined &&\n    (!Array.isArray(addresses) || !addresses.every((a) => typeof a === 'string'))\n  )\n    throw invalid('filter.addresses must be an array of address strings');\n  if (assets !== undefined && (!Array.isArray(assets) || !assets.every(isAssetInput)))\n    throw invalid('filter.assets must be an array of asset refs or asset ids');\n}\n\nfunction assertOptions(options: ScannerOptions): void {\n  const invalid = (message: string) =>\n    new ConfigError('CONFIG_INVALID', `scanner ${message}`);\n  const { cursorKey, from, mode, reorgWindow, pollIntervalMs } = options;\n  assertFilter(options.filter, invalid);\n  if (typeof cursorKey !== 'string' || cursorKey.length === 0)\n    throw invalid('cursorKey must be a non-empty string');\n  if (from !== undefined && from !== 'latest' && (typeof from !== 'bigint' || from < 0n))\n    throw invalid(\"from must be 'latest' or a non-negative bigint height\");\n  if (mode !== undefined && mode !== 'final' && mode !== 'head')\n    throw invalid(\"mode must be 'final' or 'head'\");\n  if (\n    reorgWindow !== undefined &&\n    (!Number.isSafeInteger(reorgWindow) || reorgWindow < 1)\n  )\n    throw invalid('reorgWindow must be a positive integer');\n  if (\n    pollIntervalMs !== undefined &&\n    (typeof pollIntervalMs !== 'number' ||\n      !Number.isFinite(pollIntervalMs) ||\n      pollIntervalMs <= 0)\n  )\n    throw invalid('pollIntervalMs must be a finite number greater than 0');\n}\n\n/** The cursor's window; a reset checkpoint stored without one is its own window. */\nfunction windowOf(cursor: ScanCursor): readonly Checkpoint[] {\n  if (cursor.recent.length > 0 || cursor.height < 0n) return cursor.recent;\n  return [{ height: cursor.height, hash: cursor.hash }];\n}\n\nfunction sameCursor(a: ScanCursor, b: ScanCursor): boolean {\n  return (\n    a.height === b.height &&\n    a.hash === b.hash &&\n    a.recent.length === b.recent.length &&\n    a.recent.every(\n      (r, i) => r.height === b.recent[i]?.height && r.hash === b.recent[i]?.hash,\n    )\n  );\n}\n\n/**\n * Reorg-aware, at-least-once block scanner. Each event's `ack()` commits the\n * cursor (compare-and-set on its version, so two scanners sharing a `cursorKey` never both\n * commit the same advance); asking for the next event first throws `INVALID_TRANSITION`.\n * A view that cannot decide (stale, or missing a block) never causes a rollback: the\n * scanner waits a poll interval and looks again, as it does after a retryable provider error.\n *\n * A cursor stopped by `SCANNER_REORG_TOO_DEEP` is reset explicitly: scan under a new\n * `cursorKey`, or `put` a checkpoint `{ height, hash, recent }` for its key through the\n * `CursorStore`. A checkpoint without `recent` is validated on its own block, and its\n * window is then refilled from the chain below that block.\n */\nexport class Scanner implements AsyncIterable<ScanEvent> {\n  constructor(\n    private readonly deps: ScannerDeps,\n    private readonly options: ScannerOptions,\n  ) {\n    assertOptions(options);\n  }\n\n  [Symbol.asyncIterator](): AsyncIterator<ScanEvent> {\n    return this.run();\n  }\n\n  private async *run(): AsyncGenerator<ScanEvent> {\n    const { signal } = this.options;\n    const { mapping, blocks, transport } = await this.deps.load();\n    const reader = mapping.driver.reader;\n    const { chain, network } = mapping.selection;\n    const key = `${this.deps.namespace}:${chain.id}:${network.id}:${this.options.cursorKey}`;\n    const window = this.options.reorgWindow ?? this.deps.defaults.reorgWindow;\n    // Resolved inside the loop, so a transient failure resolving filter.assets is retried.\n    let source: Source | undefined;\n    const poll = this.options.pollIntervalMs ?? this.deps.defaults.pollIntervalMs;\n    const tip = () =>\n      this.options.mode === 'final'\n        ? reader.getFinalizedHeight()\n        : reader.getBlockHeight();\n    const stored = await this.deps.cursors.get(key);\n    let version = stored?.version ?? null;\n    let cursor = stored?.cursor;\n    // A stored cursor is re-validated against the canonical chain before anything is emitted.\n    let validated = stored === null;\n    while (!signal?.aborted) {\n      let step: Step | undefined;\n      try {\n        source ??= {\n          mapping,\n          blocks,\n          transport,\n          window,\n          filter: await this.scanFilter(mapping),\n        };\n        cursor ??= await this.initialCursor(source, await tip());\n        if (cursor) {\n          let verdict = validated ? 'canonical' : await this.findRollback(source, cursor);\n          if (!validated && verdict === 'canonical') {\n            // A short window (a reset checkpoint) is refilled from the chain below the\n            // validated block, so a reorg within the window still rolls back.\n            const recent = await this.refill(source, windowOf(cursor));\n            if (recent) cursor = { ...cursor, recent };\n            else verdict = undefined;\n          }\n          validated = verdict !== undefined;\n          step =\n            verdict === 'canonical'\n              ? await this.nextBlock(source, cursor, await tip())\n              : verdict;\n        }\n      } catch (error) {\n        // Like `watch`: a transient provider failure is retried on the next poll.\n        if (signal?.aborted) return;\n        if (!isCryptoAioError(error) || !error.retryable) throw error;\n      }\n      if (signal?.aborted) return;\n      if (!step) {\n        try {\n          await this.deps.clock.sleep(poll, signal);\n        } catch {\n          return;\n        }\n        continue;\n      }\n      const { event, next } = step;\n      let acked = false;\n      let commit: Promise<void> | undefined;\n      // Set once one of our puts for this event ended without a known outcome.\n      let uncertain = false;\n      const commitCursor = async (): Promise<void> => {\n        try {\n          version = await this.deps.cursors.put(key, next, version);\n        } catch (error) {\n          const conflict = isCryptoAioError(error, 'VERSION_CONFLICT');\n          // A conflict may be our own put having landed only after one ended unseen (or when\n          // the store says so); a first-try conflict is another scanner on this key.\n          const recheck = conflict && (uncertain || error.ambiguous);\n          const stored = recheck ? await this.deps.cursors.get(key) : null;\n          if (!stored || !sameCursor(stored.cursor, next)) {\n            if (!conflict) uncertain = true;\n            throw error;\n          }\n          version = stored.version;\n        }\n        cursor = next;\n        acked = true;\n        this.emit(event);\n      };\n      yield {\n        ...event,\n        // Concurrent calls share one commit; a failed commit can be retried.\n        ack: () =>\n          (commit ??= commitCursor().catch((error: unknown) => {\n            commit = undefined;\n            throw error;\n          })),\n      };\n      if (!acked) {\n        throw new StateError(\n          'INVALID_TRANSITION',\n          'ack() the previous scan event before requesting the next one',\n        );\n      }\n    }\n  }\n\n  /** Normalizes the filter on this chain and network (the driver's codec and asset service). */\n  private async scanFilter(mapping: MappingContext): Promise<ScanFilter | undefined> {\n    const { addresses, assets } = this.options.filter ?? {};\n    if (addresses === undefined && assets === undefined) return undefined;\n    const { selection, driver } = mapping;\n    return {\n      ...(addresses\n        ? { addresses: addresses.map((a) => driver.address.normalize(a).canonical) }\n        : {}),\n      ...(assets\n        ? {\n            assets: await Promise.all(\n              assets.map(\n                async (a) => (await mapping.assets.resolve(selection, driver, a)).ref,\n              ),\n            ),\n          }\n        : {}),\n    };\n  }\n\n  /**\n   * A new cursor sits just below the start height and retains the `window` blocks beneath\n   * it, so a reorg early in the scan is still resolvable. `undefined` (wait) while the\n   * chain's tip for this mode is below the start's parent, or its blocks are not visible\n   * as one consistent chain yet.\n   */\n  private async initialCursor(\n    source: Source,\n    tip: bigint,\n  ): Promise<ScanCursor | undefined> {\n    const from = this.options.from ?? 'latest';\n    const start = from === 'latest' ? tip : from;\n    if (start <= 0n) return { height: -1n, hash: '', recent: [] };\n    if (start - 1n > tip) return undefined;\n    const recent = await this.loadWindow(source, start - 1n, source.window);\n    const top = recent?.[recent.length - 1];\n    return recent && top && { height: top.height, hash: top.hash, recent };\n  }\n\n  /**\n   * Up to `count` checkpoints ending at `height`, oldest first, read down the parent links;\n   * with `hash`, the block at `height` must have it. `undefined` (wait) when a block is not\n   * visible or the links do not hold.\n   */\n  private async loadWindow(\n    source: Source,\n    height: bigint,\n    count: number,\n    hash?: string,\n  ): Promise<Checkpoint[] | undefined> {\n    const loaded: Checkpoint[] = [];\n    let expected = hash;\n    for (let h = height; h >= 0n && loaded.length < count; h--) {\n      const header = await source.blocks.header(h);\n      if (!header || (expected !== undefined && header.hash !== expected))\n        return undefined;\n      loaded.unshift({ height: header.height, hash: header.hash });\n      expected = header.parentHash;\n    }\n    return loaded;\n  }\n\n  /**\n   * Extends a window that a rollback trimmed back down to `window` entries from the chain,\n   * which is canonical at and below the common ancestor. `undefined` (wait) on a gap.\n   */\n  private async refill(\n    source: Source,\n    kept: readonly Checkpoint[],\n  ): Promise<readonly Checkpoint[] | undefined> {\n    const oldest = kept[0];\n    if (!oldest || kept.length >= source.window || oldest.height === 0n) return kept;\n    const missing = source.window - kept.length;\n    const below = await this.loadWindow(source, oldest.height, missing + 1, oldest.hash);\n    return below && [...below.slice(0, -1), ...kept];\n  }\n\n  private async nextBlock(\n    source: Source,\n    cursor: ScanCursor,\n    tip: bigint,\n  ): Promise<Step | undefined> {\n    const height = cursor.height + 1n;\n    if (height > tip) return undefined;\n    const header = await source.blocks.header(height);\n    if (!header) return undefined;\n    if (cursor.height >= 0n && header.parentHash !== cursor.hash) {\n      const verdict = await this.findRollback(source, cursor);\n      // The cursor's block is still canonical, so the two reads disagreed: look again later.\n      return verdict === 'canonical' ? undefined : verdict;\n    }\n    const transactions = await source.blocks.transactions(header, source.filter);\n    const reader = source.mapping.driver.reader;\n    const [head, finalized] = await Promise.all([\n      reader.getBlockHeight(),\n      reader.getFinalizedHeight(),\n    ]);\n    const mapped = await Promise.all(\n      transactions.map((tx) => toTransaction(source.mapping, tx, head, finalized)),\n    );\n    const checkpoint = { height: header.height, hash: header.hash };\n    return {\n      event: { type: 'block', block: toBlock(header), transactions: mapped },\n      next: {\n        ...checkpoint,\n        recent: [...windowOf(cursor), checkpoint].slice(-source.window),\n      },\n    };\n  }\n\n  /**\n   * Walks the retained window newest-first to the common ancestor with the canonical chain.\n   * Returns `'canonical'` when the cursor's own block still is, a rollback step when an older\n   * block is, and `undefined` when this view cannot decide: it is stale, or it does not show\n   * a block yet (absence is never divergence). Throws `SCANNER_REORG_TOO_DEEP` only when\n   * every retained block is visible and none is canonical. The rolled-back cursor's window\n   * is refilled from the chain below the ancestor. A rollback or TOO_DEEP verdict of this\n   * header walk stands only once the proof quorum confirms it, so one endpoint serving a\n   * fork never rolls a cursor back. Only verdicts are confirmed: a block's transactions\n   * are still read from the one endpoint that serves them.\n   */\n  private async findRollback(\n    source: Source,\n    cursor: ScanCursor,\n  ): Promise<Step | 'canonical' | undefined> {\n    if (cursor.height < 0n) return 'canonical';\n    if (await this.staleView(source)) return undefined;\n    const window = windowOf(cursor);\n    const newestFirst = [...window].reverse();\n    for (const [i, entry] of newestFirst.entries()) {\n      const canonical = await source.blocks.header(entry.height);\n      if (!canonical) return undefined;\n      if (canonical.hash !== entry.hash) continue;\n      if (i === 0) return 'canonical';\n      if (!(await this.confirmed(source, newestFirst.slice(0, i), entry)))\n        return undefined;\n      const recent = await this.refill(\n        source,\n        window.filter((r) => r.height <= entry.height),\n      );\n      if (!recent) return undefined;\n      return {\n        event: { type: 'rollback', to: entry, removed: newestFirst.slice(0, i) },\n        next: { height: entry.height, hash: entry.hash, recent },\n      };\n    }\n    if (!(await this.confirmed(source, newestFirst))) return undefined;\n    throw new StateError(\n      'SCANNER_REORG_TOO_DEEP',\n      `the chain diverged deeper than the ${source.window}-block window of cursor '${this.options.cursorKey}'; reset the cursor explicitly`,\n    );\n  }\n\n  /**\n   * Whether the quorum-served hashes confirm a verdict: every `removed` block has been\n   * replaced at its height, and `ancestor` (when given) is still canonical. No block at a\n   * height decides nothing (`false`); a quorum that disagrees throws a retryable error,\n   * which the scan loop also treats as \"look again later\".\n   */\n  private async confirmed(\n    source: Source,\n    removed: readonly Checkpoint[],\n    ancestor?: Checkpoint,\n  ): Promise<boolean> {\n    const { proofs } = source.mapping.driver;\n    for (const entry of removed) {\n      const hash = await proofs.blockHash(entry.height, 'latest');\n      if (hash === null || hash === entry.hash) return false;\n    }\n    if (ancestor === undefined) return true;\n    return (await proofs.blockHash(ancestor.height, 'latest')) === ancestor.hash;\n  }\n\n  /** The monitor's stale-view guard (`isStaleView`): a stale view decides nothing. */\n  private async staleView(source: Source): Promise<boolean> {\n    return isStaleView(\n      source.transport,\n      await source.mapping.driver.reader.getBlockHeight(),\n    );\n  }\n\n  /** Operational data only: never addresses, amounts or hashes. */\n  private emit(event: ScanEventBody): void {\n    if (event.type === 'block') {\n      this.deps.events.emit('scanner.block', {\n        namespace: this.deps.namespace,\n        cursorKey: this.options.cursorKey,\n        height: event.block.height.toString(),\n      });\n    } else {\n      this.deps.events.emit('scanner.rollback', {\n        namespace: this.deps.namespace,\n        cursorKey: this.options.cursorKey,\n        toHeight: event.to.height.toString(),\n        removed: event.removed.length,\n      });\n    }\n  }\n}\n"]}

package/dist/core/ordering/reservations.d.ts

@@ -0,0 +1,16 @@
+import { type OperationRecord } from '../store/types';
+/**
+ * Inputs held by live Operations: their reservation, unsigned payload and every Attempt.
+ * Coin selection excludes them, so two Operations of a wallet never pick the same coin.
+ */
+export declare function reservedInputs(operations: readonly OperationRecord[], exceptId?: string): string[];
+/** The live Operation that may still consume the wallet's current seqno (TON is strictly serial). */
+export declare function seqnoHolder(operations: readonly OperationRecord[], exceptId?: string): OperationRecord | undefined;
+/**
+ * The lowest nonce still reserved by a live, not-yet-included Operation. Included
+ * nonces are already consumed on chain, so counting them would mask a gap above them.
+ */
+export declare function lowestOutstandingNonce(operations: readonly OperationRecord[]): {
+    nonce: bigint;
+    operationId: string;
+} | undefined;

package/dist/core/ordering/reservations.js

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reservedInputs = reservedInputs;
+exports.seqnoHolder = seqnoHolder;
+exports.lowestOutstandingNonce = lowestOutstandingNonce;
+const types_1 = require("../store/types");
+/**
+ * Inputs held by live Operations: their reservation, unsigned payload and every Attempt.
+ * Coin selection excludes them, so two Operations of a wallet never pick the same coin.
+ */
+function reservedInputs(operations, exceptId) {
+    const inputs = new Set();
+    for (const op of operations) {
+        if (op.id === exceptId || (0, types_1.isTerminal)(op.state))
+            continue;
+        if (op.reservation?.kind === 'inputs')
+            for (const input of op.reservation.inputs)
+                inputs.add(input);
+        if (op.unsigned?.ordering.kind === 'inputs')
+            for (const input of op.unsigned.ordering.inputs)
+                inputs.add(input);
+        for (const attempt of op.attempts) {
+            if (attempt.ordering.kind === 'inputs')
+                for (const input of attempt.ordering.inputs)
+                    inputs.add(input);
+        }
+    }
+    return [...inputs].sort();
+}
+/** The live Operation that may still consume the wallet's current seqno (TON is strictly serial). */
+function seqnoHolder(operations, exceptId) {
+    return operations.find((op) => op.id !== exceptId &&
+        !(0, types_1.isTerminal)(op.state) &&
+        op.state !== 'included' &&
+        op.reservation?.kind === 'seqno');
+}
+/**
+ * The lowest nonce still reserved by a live, not-yet-included Operation. Included
+ * nonces are already consumed on chain, so counting them would mask a gap above them.
+ */
+function lowestOutstandingNonce(operations) {
+    let lowest;
+    for (const op of operations) {
+        if ((0, types_1.isTerminal)(op.state) || op.state === 'included')
+            continue;
+        if (op.reservation?.kind !== 'nonce')
+            continue;
+        if (!lowest || op.reservation.nonce < lowest.nonce)
+            lowest = { nonce: op.reservation.nonce, operationId: op.id };
+    }
+    return lowest;
+}
+//# sourceMappingURL=reservations.js.map