@bsv/overlay 2.0.3 → 2.0.4

package/dist/cjs/src/Engine.js

@@ -5,7 +5,10 @@ const sdk_1 = require("@bsv/sdk");
 const gasp_1 = require("@bsv/gasp");
 const OverlayGASPRemote_js_1 = require("./GASP/OverlayGASPRemote.js");
 const OverlayGASPStorage_js_1 = require("./GASP/OverlayGASPStorage.js");
+const BASM_js_1 = require("./BASM.js");
+const BASMRemote_js_1 = require("./BASMRemote.js");
 const DEFAULT_GASP_SYNC_LIMIT = 10000;
+const DEFAULT_BASM_RANGE_LIMIT = 1024;
 /**
  * An engine for running BSV Overlay Services (topic managers and lookup services).
  */
@@ -28,8 +31,13 @@ class Engine {
      * @param {OverlayBroadcastFacilitator} overlayBroadcastFacilitator - Facilitator for propagation to other Overlay Services.
      * @param {typeof console} logger - The place where log entries are written.
      * @param {boolean} suppressDefaultSyncAdvertisements - Whether to suppress the default (SHIP/SLAP) sync advertisements.
+     * @param {TopicAnchorHeaderResolver} topicAnchorHeaderResolver - Resolves block hashes for BASM anchors.
+     * @param {boolean} basmSyncEnabled - Whether BASM sync should run automatically.
+     * @param {number} unprovenEvictionBlocks - Default block age for opt-in unproven state eviction.
      */
-    constructor(managers, lookupServices, storage, chainTracker, hostingURL, shipTrackers, slapTrackers, broadcaster, advertiser, syncConfiguration, logTime = false, logPrefix = '[OVERLAY_ENGINE] ', throwOnBroadcastFailure = false, overlayBroadcastFacilitator = new sdk_1.HTTPSOverlayBroadcastFacilitator(), logger = console, suppressDefaultSyncAdvertisements = true) {
+    constructor(managers, lookupServices, storage, chainTracker, hostingURL, shipTrackers, slapTrackers, broadcaster, advertiser, syncConfiguration, logTime = false, logPrefix = '[OVERLAY_ENGINE] ', throwOnBroadcastFailure = false, overlayBroadcastFacilitator = new sdk_1.HTTPSOverlayBroadcastFacilitator(), logger = console, suppressDefaultSyncAdvertisements = true, topicAnchorHeaderResolver, basmSyncEnabled = false, unprovenEvictionBlocks = 144) {
+        var _a;
+        var _b;
         this.managers = managers;
         this.lookupServices = lookupServices;
         this.storage = storage;
@@ -46,6 +54,9 @@ class Engine {
         this.overlayBroadcastFacilitator = overlayBroadcastFacilitator;
         this.logger = logger;
         this.suppressDefaultSyncAdvertisements = suppressDefaultSyncAdvertisements;
+        this.topicAnchorHeaderResolver = topicAnchorHeaderResolver;
+        this.basmSyncEnabled = basmSyncEnabled;
+        this.unprovenEvictionBlocks = unprovenEvictionBlocks;
         // To encourage synchronization of overlay services, the SHIP sync strategy is used by default for all overlay topics, except for 'tm_ship' and 'tm_slap'.
         // For these two topics, any existing trackers are combined with the provided shipTrackers and slapTrackers omitting any duplicates.
         if (syncConfiguration === undefined) {
@@ -73,9 +84,7 @@ class Engine {
             }
             else {
                 // Set undefined managers to 'SHIP' by default
-                if (this.syncConfiguration[managerName] === undefined) {
-                    this.syncConfiguration[managerName] = 'SHIP';
-                }
+                (_a = (_b = this.syncConfiguration)[managerName]) !== null && _a !== void 0 ? _a : (_b[managerName] = 'SHIP');
             }
         }
     }
@@ -90,6 +99,282 @@ class Engine {
             this.logger.timeEnd(`${this.logPrefix} ${label}`);
         }
     }
+    async currentHeightOrUndefined() {
+        if (this.chainTracker === 'scripts only') {
+            return undefined;
+        }
+        try {
+            return await this.chainTracker.currentHeight();
+        }
+        catch (error) {
+            this.logger.warn(`Unable to resolve current chain height for overlay metadata: ${error instanceof Error ? error.message : String(error)}`);
+            return undefined;
+        }
+    }
+    async resolveBlockHash(blockHeight, merkleRoot) {
+        var _a;
+        try {
+            const header = await ((_a = this.topicAnchorHeaderResolver) === null || _a === void 0 ? void 0 : _a.call(this, blockHeight));
+            if (header === undefined) {
+                return undefined;
+            }
+            if (header.merkleRoot !== undefined && merkleRoot !== undefined && header.merkleRoot !== merkleRoot) {
+                throw new Error(`Header merkle root ${header.merkleRoot} does not match proof root ${merkleRoot} at height ${blockHeight}`);
+            }
+            return header.blockHash;
+        }
+        catch (error) {
+            this.logger.warn(`Unable to resolve BASM block hash for height ${blockHeight}: ${error instanceof Error ? error.message : String(error)}`);
+            return undefined;
+        }
+    }
+    compactBEEFForStorage(tx, originalBEEF) {
+        return tx.merklePath === undefined ? originalBEEF : tx.toAtomicBEEF();
+    }
+    async recordTransactionData(tx, beef, blockHash) {
+        var _a;
+        if (typeof this.storage.upsertTransactionRecord !== 'function') {
+            return;
+        }
+        const txid = tx.id('hex');
+        const metadata = (0, BASM_js_1.extractMerkleProofMetadata)(txid, tx.merklePath);
+        await this.storage.upsertTransactionRecord({
+            txid,
+            beef: this.compactBEEFForStorage(tx, beef),
+            rawTx: Array.from(tx.toBinary()),
+            merklePath: (_a = tx.merklePath) === null || _a === void 0 ? void 0 : _a.toBinary(),
+            blockHeight: metadata === null || metadata === void 0 ? void 0 : metadata.blockHeight,
+            blockHash,
+            blockIndex: metadata === null || metadata === void 0 ? void 0 : metadata.blockIndex,
+            merkleRoot: metadata === null || metadata === void 0 ? void 0 : metadata.merkleRoot
+        });
+    }
+    async buildAppliedTransactionRecord(tx) {
+        const txid = tx.id('hex');
+        const metadata = (0, BASM_js_1.extractMerkleProofMetadata)(txid, tx.merklePath);
+        const [firstSeenHeight, blockHash] = await Promise.all([
+            this.currentHeightOrUndefined(),
+            metadata === undefined ? undefined : this.resolveBlockHash(metadata.blockHeight, metadata.merkleRoot)
+        ]);
+        return {
+            blockHeight: metadata === null || metadata === void 0 ? void 0 : metadata.blockHeight,
+            blockHash,
+            blockIndex: metadata === null || metadata === void 0 ? void 0 : metadata.blockIndex,
+            merkleRoot: metadata === null || metadata === void 0 ? void 0 : metadata.merkleRoot,
+            firstSeenHeight: firstSeenHeight !== null && firstSeenHeight !== void 0 ? firstSeenHeight : metadata === null || metadata === void 0 ? void 0 : metadata.blockHeight,
+            proven: metadata !== undefined
+        };
+    }
+    async recomputeTopicBlockAnchor(topic, blockHeight, blockHash) {
+        var _a, _b, _c;
+        if (typeof this.storage.findAdmittedTransactionsForBlock !== 'function' ||
+            typeof this.storage.upsertTopicBlockAnchor !== 'function' ||
+            typeof this.storage.findTopicBlockAnchor !== 'function') {
+            return undefined;
+        }
+        const anchorBlockHash = blockHash !== null && blockHash !== void 0 ? blockHash : (_a = (await this.storage.findTopicBlockAnchor(topic, blockHeight))) === null || _a === void 0 ? void 0 : _a.blockHash;
+        if (anchorBlockHash === undefined) {
+            return undefined;
+        }
+        // BRC-136 per-block completeness: establish the chain's genesis at the first
+        // admitted height, then keep every height from there to the tip contiguous so
+        // the cumulative TAC never resets across blocks with no admitted transactions.
+        // We rebuild [fromHeight, toHeight] rather than only the touched height so that
+        // an out-of-order proof (older height arriving after a newer one) can never
+        // leave a gap that silently breaks the chain.
+        const tip = await ((_c = (_b = this.storage).findTopicAnchorTip) === null || _c === void 0 ? void 0 : _c.call(_b, topic));
+        const tipHeight = tip !== undefined && tip.blockHeight >= 0 ? tip.blockHeight : undefined;
+        const fromHeight = tipHeight === undefined ? blockHeight : Math.min(blockHeight, tipHeight + 1);
+        const toHeight = tipHeight === undefined ? blockHeight : Math.max(blockHeight, tipHeight);
+        await this.rebuildTopicAnchorChain(topic, fromHeight, toHeight, new Map([[blockHeight, anchorBlockHash]]));
+        return await this.storage.findTopicBlockAnchor(topic, blockHeight);
+    }
+    /**
+     * Extends every configured topic's anchor chain forward with empty Topic Block
+     * Anchors (basmRoot = zero hash, admittedCount = 0) up to `toHeight`, so the
+     * cumulative TAC advances on every block even when a topic admits nothing —
+     * this is what lets a peer authoritatively confirm "this block contained no
+     * transactions for this topic". Chains with no first admission yet are left
+     * unstarted (genesis is the topic's first admitted height).
+     */
+    async advanceTopicAnchorChains(toHeight) {
+        if (typeof this.storage.findTopicAnchorTip !== 'function' ||
+            typeof this.storage.upsertTopicBlockAnchor !== 'function') {
+            return;
+        }
+        const targetHeight = toHeight !== null && toHeight !== void 0 ? toHeight : await this.currentHeightOrUndefined();
+        if (targetHeight === undefined) {
+            return;
+        }
+        for (const topic of Object.keys(this.managers)) {
+            const tip = await this.storage.findTopicAnchorTip(topic);
+            if (tip === undefined || tip.blockHeight < 0 || tip.blockHeight >= targetHeight) {
+                continue;
+            }
+            await this.rebuildTopicAnchorChain(topic, tip.blockHeight + 1, targetHeight);
+        }
+    }
+    /**
+     * Rebuilds a contiguous slice of a topic's anchor chain over [fromHeight,
+     * toHeight]. Each height uses its admitted transactions (empty -> zero basmRoot)
+     * and chains the cumulative TAC from the prior height. Missing heights are
+     * filled rather than skipped, so the chain stays gap-free. If a block hash
+     * cannot be resolved for some height the extension halts there to preserve
+     * contiguity instead of leaving a hole.
+     */
+    async rebuildTopicAnchorChain(topic, fromHeight, toHeight, blockHashHints = new Map(), forceResolve = false) {
+        var _a, _b, _c;
+        if (typeof this.storage.findAdmittedTransactionsForBlock !== 'function' ||
+            typeof this.storage.upsertTopicBlockAnchor !== 'function' ||
+            typeof this.storage.findTopicBlockAnchor !== 'function' ||
+            toHeight < fromHeight) {
+            return;
+        }
+        if (toHeight - fromHeight + 1 > DEFAULT_BASM_RANGE_LIMIT) {
+            // Bound the work per pass; the next trigger resumes from the new tip.
+            this.logger.warn(`[BASM] capping anchor chain extension for "${topic}" at ${DEFAULT_BASM_RANGE_LIMIT} blocks (requested ${fromHeight}..${toHeight}); will continue on the next pass`);
+            toHeight = fromHeight + DEFAULT_BASM_RANGE_LIMIT - 1;
+        }
+        const previousAnchor = fromHeight > 0
+            ? await this.storage.findTopicBlockAnchor(topic, fromHeight - 1)
+            : undefined;
+        let prevTac = (_a = previousAnchor === null || previousAnchor === void 0 ? void 0 : previousAnchor.tac) !== null && _a !== void 0 ? _a : BASM_js_1.BASM_ZERO_HASH;
+        for (let height = fromHeight; height <= toHeight; height++) {
+            const admitted = await this.storage.findAdmittedTransactionsForBlock(topic, height);
+            const existing = await this.storage.findTopicBlockAnchor(topic, height);
+            // On a reorg rebuild the existing anchor's block hash is stale, so force
+            // canonical re-resolution from the header resolver instead of reusing it.
+            const blockHash = (_c = (_b = blockHashHints.get(height)) !== null && _b !== void 0 ? _b : (forceResolve ? undefined : existing === null || existing === void 0 ? void 0 : existing.blockHash)) !== null && _c !== void 0 ? _c : await this.resolveBlockHash(height);
+            if (blockHash === undefined) {
+                this.logger.warn(`[BASM] unable to resolve block hash for "${topic}" at height ${height}; halting chain extension`);
+                return;
+            }
+            const basmRoot = (0, BASM_js_1.computeBasmRoot)(admitted);
+            const tac = (0, BASM_js_1.computeTac)(prevTac, blockHash, basmRoot);
+            await this.storage.upsertTopicBlockAnchor({
+                topic,
+                blockHeight: height,
+                blockHash,
+                basmRoot,
+                admittedCount: admitted.length,
+                tac
+            });
+            prevTac = tac;
+        }
+    }
+    /**
+     * Reconciles BASM anchors with a blockchain reorganization reported by the
+     * chain tracker (e.g. go-chaintracks `/v2/reorg/stream`). Proven topic
+     * transactions whose block was orphaned are demoted to unproven so they leave
+     * the admitted set, then every topic anchor chain intersecting the affected
+     * height range is rebuilt over the canonical block hashes. A reorg changes the
+     * canonical block hash for the affected heights, so topics with no demoted
+     * transaction are rebuilt too. Idempotent: a clean window demotes nothing and
+     * reproduces an identical TAC, so this is safe to invoke on every reorg event,
+     * SSE reconnect, and poll.
+     */
+    async handleReorg(input) {
+        var _a, _b;
+        const report = { perTopic: [] };
+        if (typeof this.storage.findProvenAppliedTransactionsByBlockHash !== 'function' ||
+            typeof this.storage.demoteAppliedTransactionToUnproven !== 'function' ||
+            typeof this.storage.findTopicBlockAnchors !== 'function' ||
+            typeof this.storage.upsertTopicBlockAnchor !== 'function') {
+            return report;
+        }
+        // 1) Demote proven admissions whose block was orphaned. Hashes are
+        //    normalized to lower-case display hex to match stored block hashes
+        //    (go-sdk chainhash.Hash marshals as reversed display hex).
+        const demotedByTopic = new Map();
+        for (const rawHash of input.orphanedBlockHashes) {
+            const blockHash = rawHash.toLowerCase();
+            const rows = await this.storage.findProvenAppliedTransactionsByBlockHash(blockHash);
+            for (const row of rows) {
+                await this.storage.demoteAppliedTransactionToUnproven(row.txid, row.topic);
+                const list = (_a = demotedByTopic.get(row.topic)) !== null && _a !== void 0 ? _a : [];
+                list.push(row.txid);
+                demotedByTopic.set(row.topic, list);
+            }
+        }
+        // 2) Rebuild every topic anchor chain that intersects the reorged range,
+        //    forcing canonical block-hash re-resolution so stale hashes are replaced.
+        for (const topic of Object.keys(this.managers)) {
+            const existing = await this.storage.findTopicBlockAnchors(topic, input.rebuildFromHeight, input.newTipHeight);
+            if (existing.length === 0) {
+                continue;
+            }
+            const startHeight = Math.min(...existing.map(anchor => anchor.blockHeight));
+            await this.rebuildTopicAnchorChain(topic, startHeight, input.newTipHeight, new Map(), true);
+            report.perTopic.push({
+                topic,
+                demotedTxids: (_b = demotedByTopic.get(topic)) !== null && _b !== void 0 ? _b : [],
+                rebuiltFrom: startHeight,
+                rebuiltTo: input.newTipHeight
+            });
+        }
+        return report;
+    }
+    /**
+     * Revalidation sweep: the reorg fallback for chain trackers without a reorg
+     * event stream, and the catch-up step on every reorg-SSE (re)connect (the
+     * go-chaintracks reorg stream carries no event ids, so a reconnect cannot
+     * replay events missed while disconnected). Scans proven applied transactions
+     * in `[tip - depth + 1, tip]`; any whose proof root no longer validates against
+     * the chain tracker, or whose block hash diverges from the canonical header, is
+     * treated as orphaned and reconciled via {@link handleReorg}.
+     */
+    async isProvenAnchorStale(row, chainTracker) {
+        var _a;
+        if (row.merkleRoot !== undefined) {
+            try {
+                if (!(await chainTracker.isValidRootForHeight(row.merkleRoot, row.blockHeight))) {
+                    return true;
+                }
+            }
+            catch (error) {
+                this.logger.warn(`[BASM] root validation failed for ${row.txid} at height ${row.blockHeight}: ${error instanceof Error ? error.message : String(error)}`);
+                return undefined;
+            }
+        }
+        const canonical = await this.resolveBlockHash(row.blockHeight);
+        return canonical !== undefined && canonical.toLowerCase() !== ((_a = row.blockHash) === null || _a === void 0 ? void 0 : _a.toLowerCase());
+    }
+    async revalidateRecentAnchors(depth = 3) {
+        const chainTracker = this.chainTracker;
+        if (chainTracker === 'scripts only') {
+            this.logger.warn('[BASM] revalidation sweep requires a ChainTracker; skipping');
+            return undefined;
+        }
+        if (typeof this.storage.findProvenAppliedTransactionsInRange !== 'function') {
+            return undefined;
+        }
+        const tip = await this.currentHeightOrUndefined();
+        if (tip === undefined) {
+            return undefined;
+        }
+        const fromHeight = Math.max(0, tip - depth + 1);
+        const rows = await this.storage.findProvenAppliedTransactionsInRange(fromHeight, tip);
+        const orphaned = new Set();
+        let minAffected = Number.POSITIVE_INFINITY;
+        for (const row of rows) {
+            if (row.blockHash === undefined) {
+                continue;
+            }
+            const stale = await this.isProvenAnchorStale(row, chainTracker);
+            if (stale === true) {
+                orphaned.add(row.blockHash.toLowerCase());
+                minAffected = Math.min(minAffected, row.blockHeight);
+            }
+        }
+        if (orphaned.size === 0) {
+            return { perTopic: [] };
+        }
+        return await this.handleReorg({
+            orphanedBlockHashes: Array.from(orphaned),
+            rebuildFromHeight: minAffected,
+            newTipHeight: tip
+        });
+    }
     /**
      * Submits a transaction for processing by Overlay Services.
      * @param {TaggedBEEF} taggedBEEF - The transaction to process
@@ -144,8 +429,8 @@ class Engine {
                 // Identify previous coins admitted to this specific topic
                 const previousCoins = [];
                 const outputPromises = tx.inputs.map(async (input, i) => {
-                    var _a;
-                    const previousTXID = input.sourceTXID !== undefined ? input.sourceTXID : (_a = input.sourceTransaction) === null || _a === void 0 ? void 0 : _a.id('hex');
+                    var _a, _b;
+                    const previousTXID = (_a = input.sourceTXID) !== null && _a !== void 0 ? _a : (_b = input.sourceTransaction) === null || _b === void 0 ? void 0 : _b.id('hex');
                     if (previousTXID !== undefined) {
                         // Check if the previous output was admitted to this specific topic
                         const output = await this.storage.findOutput(previousTXID, input.sourceOutputIndex, topic);
@@ -334,17 +619,17 @@ class Engine {
                     if (typeof previousTXID !== 'string')
                         continue;
                     const previousOutputIndex = tx.inputs[inputIndex].sourceOutputIndex;
-                    if (!admissibleOutputs.coinsToRetain.includes(inputIndex)) {
-                        outputsToMarkStale.push({
+                    if (admissibleOutputs.coinsToRetain.includes(inputIndex)) {
+                        outputsConsumed.push({
                             txid: previousTXID,
-                            previousOutputIndex,
-                            inputIndex
+                            outputIndex: previousOutputIndex
                         });
                     }
                     else {
-                        outputsConsumed.push({
+                        outputsToMarkStale.push({
                             txid: previousTXID,
-                            outputIndex: previousOutputIndex
+                            previousOutputIndex,
+                            inputIndex
                         });
                     }
                 }
@@ -362,6 +647,7 @@ class Engine {
                 // Handle admittance and notification of incoming UTXOs
                 const newUTXOs = [];
                 await Promise.all(outputsToAdmit.map(async (outputIndex) => {
+                    var _a;
                     if (typeof tx.outputs[outputIndex].satoshis !== 'number')
                         return;
                     this.startTime(`insertNewOutput_${txid.substring(0, 10)}`);
@@ -372,10 +658,11 @@ class Engine {
                         satoshis: tx.outputs[outputIndex].satoshis,
                         topic,
                         spent: false,
-                        beef: taggedBEEF.beef,
+                        beef: this.compactBEEFForStorage(tx, taggedBEEF.beef),
                         consumedBy: [],
                         outputsConsumed,
-                        score: Date.now()
+                        score: Date.now(),
+                        blockHeight: (_a = (0, BASM_js_1.extractMerkleProofMetadata)(txid, tx.merklePath)) === null || _a === void 0 ? void 0 : _a.blockHeight
                     });
                     this.endTime(`insertNewOutput_${txid.substring(0, 10)}`);
                     newUTXOs.push({ txid, outputIndex });
@@ -415,6 +702,8 @@ class Engine {
                 }));
                 this.startTime(`outputConsumed_${txid.substring(0, 10)}`);
                 // Update each output consumed to know who consumed it and insert applied transaction in parallel
+                const appliedRecord = await this.buildAppliedTransactionRecord(tx);
+                await this.recordTransactionData(tx, taggedBEEF.beef, appliedRecord.blockHash);
                 await Promise.all([
                     ...outputsConsumed.map(async (output) => {
                         const outputToUpdate = await this.storage.findOutput(output.txid, output.outputIndex, topic);
@@ -425,9 +714,13 @@ class Engine {
                     }),
                     this.storage.insertAppliedTransaction({
                         txid,
-                        topic
+                        topic,
+                        ...appliedRecord
                     })
                 ]);
+                if (appliedRecord.blockHeight !== undefined && appliedRecord.blockHash !== undefined) {
+                    await this.recomputeTopicBlockAnchor(topic, appliedRecord.blockHeight, appliedRecord.blockHash);
+                }
                 this.endTime(`outputConsumed_${txid.substring(0, 10)}`);
             }
             catch (error) {
@@ -723,7 +1016,7 @@ class Engine {
                             // Parse out the advertisements using the provided parser
                             const tx = sdk_1.Transaction.fromBEEF(output.beef);
                             const advertisement = (_a = this.advertiser) === null || _a === void 0 ? void 0 : _a.parseAdvertisement(tx.outputs[output.outputIndex].lockingScript);
-                            if (advertisement !== undefined && advertisement !== null && advertisement.protocol === 'SHIP') {
+                            if ((advertisement === null || advertisement === void 0 ? void 0 : advertisement.protocol) === 'SHIP') {
                                 endpointSet.add(advertisement.domain);
                             }
                         }
@@ -761,6 +1054,287 @@ class Engine {
             }
         }
     }
+    async resolveSyncEndpointsForTopic(topic) {
+        if (this.syncConfiguration === undefined) {
+            return [];
+        }
+        let syncEndpoints = this.syncConfiguration[topic];
+        if (syncEndpoints === false || syncEndpoints === undefined) {
+            return [];
+        }
+        if (syncEndpoints === 'SHIP') {
+            const resolverConfig = this.slapTrackers
+                ? { slapTrackers: this.slapTrackers }
+                : {};
+            const resolver = new sdk_1.LookupResolver(resolverConfig);
+            const lookupAnswer = await resolver.query({
+                service: 'ls_ship',
+                query: {
+                    topics: [topic]
+                }
+            });
+            const endpointSet = new Set();
+            if (lookupAnswer.type === 'output-list') {
+                lookupAnswer.outputs.forEach(output => {
+                    var _a;
+                    try {
+                        const tx = sdk_1.Transaction.fromBEEF(output.beef);
+                        const advertisement = (_a = this.advertiser) === null || _a === void 0 ? void 0 : _a.parseAdvertisement(tx.outputs[output.outputIndex].lockingScript);
+                        if ((advertisement === null || advertisement === void 0 ? void 0 : advertisement.protocol) === 'SHIP') {
+                            endpointSet.add(advertisement.domain);
+                        }
+                    }
+                    catch (error) {
+                        this.logger.error('Failed to parse BASM advertisement output:', error);
+                    }
+                });
+            }
+            syncEndpoints = Array.from(endpointSet);
+        }
+        if (!Array.isArray(syncEndpoints)) {
+            return [];
+        }
+        return syncEndpoints.filter(endpoint => endpoint !== this.hostingURL);
+    }
+    async provideTopicAnchorTip(topic) {
+        var _a, _b;
+        const tip = await ((_b = (_a = this.storage).findTopicAnchorTip) === null || _b === void 0 ? void 0 : _b.call(_a, topic));
+        return tip !== null && tip !== void 0 ? tip : {
+            topic,
+            blockHeight: -1,
+            tac: BASM_js_1.BASM_ZERO_HASH
+        };
+    }
+    async provideTopicAnchorRange(topic, fromHeight, toHeight) {
+        if (typeof this.storage.findTopicBlockAnchors !== 'function') {
+            throw new TypeError('Storage does not support BASM topic anchor ranges');
+        }
+        if (!Number.isInteger(fromHeight) || !Number.isInteger(toHeight) || fromHeight < 0 || toHeight < fromHeight) {
+            throw new Error('Invalid topic anchor range');
+        }
+        if (toHeight - fromHeight + 1 > DEFAULT_BASM_RANGE_LIMIT) {
+            throw new Error(`Topic anchor range is capped at ${DEFAULT_BASM_RANGE_LIMIT} heights`);
+        }
+        return {
+            topic,
+            anchors: await this.storage.findTopicBlockAnchors(topic, fromHeight, toHeight)
+        };
+    }
+    async provideAdmittedList(topic, blockHeight, blockHash) {
+        if (typeof this.storage.findAdmittedTransactionsForBlock !== 'function') {
+            throw new TypeError('Storage does not support BASM admitted lists');
+        }
+        return {
+            topic,
+            blockHeight,
+            blockHash,
+            admitted: await this.storage.findAdmittedTransactionsForBlock(topic, blockHeight, blockHash)
+        };
+    }
+    async provideCompoundMerklePath(topic, blockHeight, txids) {
+        var _a, _b;
+        if (typeof this.storage.findTransactionMerklePaths !== 'function') {
+            throw new TypeError('Storage does not support direct Merkle path lookup');
+        }
+        if (txids.length === 0) {
+            throw new Error('At least one txid is required');
+        }
+        const admitted = await ((_b = (_a = this.storage).findAdmittedTransactionsForBlock) === null || _b === void 0 ? void 0 : _b.call(_a, topic, blockHeight));
+        if (admitted !== undefined) {
+            const admittedSet = new Set(admitted.map(item => item.txid));
+            const missingAdmissions = txids.filter(txid => !admittedSet.has(txid));
+            if (missingAdmissions.length > 0) {
+                throw new Error(`Requested txids are not admitted to topic ${topic} at height ${blockHeight}: ${missingAdmissions.join(',')}`);
+            }
+        }
+        const proofs = await this.storage.findTransactionMerklePaths(txids);
+        const proofByTxid = new Map(proofs.map(proof => [proof.txid, proof]));
+        const missing = txids.filter(txid => !proofByTxid.has(txid));
+        if (missing.length > 0) {
+            throw new Error(`No direct Merkle path found for txids: ${missing.join(',')}`);
+        }
+        let compound;
+        for (const txid of txids) {
+            const proof = proofByTxid.get(txid);
+            if (proof === undefined)
+                continue;
+            const path = sdk_1.MerklePath.fromHex(proof.merklePath);
+            if (path.blockHeight !== blockHeight) {
+                throw new Error(`Merkle path for ${txid} is at height ${path.blockHeight}, expected ${blockHeight}`);
+            }
+            if (compound === undefined) {
+                compound = path;
+            }
+            else {
+                compound.combine(path);
+            }
+        }
+        if (compound === undefined) {
+            throw new Error('Unable to build compound Merkle path');
+        }
+        return {
+            topic,
+            blockHeight,
+            txids,
+            merklePath: compound.toHex()
+        };
+    }
+    async provideRawTransactions(txids) {
+        if (typeof this.storage.findRawTransactions !== 'function') {
+            throw new TypeError('Storage does not support raw transaction lookup');
+        }
+        const transactions = await this.storage.findRawTransactions(txids);
+        const found = new Set(transactions.map(tx => tx.txid));
+        return {
+            transactions,
+            missing: txids.filter(txid => !found.has(txid))
+        };
+    }
+    async startBASMSync() {
+        if (this.syncConfiguration === undefined) {
+            throw new Error('Overlay Service Engine not configured for topical synchronization!');
+        }
+        const reports = [];
+        for (const topic of Object.keys(this.syncConfiguration)) {
+            const endpoints = await this.resolveSyncEndpointsForTopic(topic);
+            for (const endpoint of endpoints) {
+                reports.push(await this.reconcileBASMWithPeer(topic, endpoint));
+            }
+        }
+        return reports;
+    }
+    async reconcileBASMWithPeer(topic, endpoint) {
+        const report = {
+            topic,
+            endpoint,
+            status: 'skipped',
+            checkedHeights: [],
+            missingTxids: [],
+            fetchedTxCount: 0
+        };
+        try {
+            const remote = new BASMRemote_js_1.BASMRemote(endpoint, topic);
+            const [localTip, remoteTip] = await Promise.all([
+                this.provideTopicAnchorTip(topic),
+                remote.requestTopicAnchorTip()
+            ]);
+            report.localTip = localTip;
+            report.remoteTip = remoteTip;
+            if (localTip.blockHeight >= remoteTip.blockHeight) {
+                report.status = localTip.tac === remoteTip.tac && localTip.blockHeight === remoteTip.blockHeight ? 'matched' : 'diverged';
+                report.message = report.status === 'matched'
+                    ? 'Topic anchor tips match'
+                    : 'Remote tip is not ahead; historical divergence needs manual or binary-search reconciliation';
+                return report;
+            }
+            const fromHeight = Math.max(localTip.blockHeight + 1, remoteTip.blockHeight - DEFAULT_BASM_RANGE_LIMIT + 1, 0);
+            const range = await remote.requestTopicAnchorRange(fromHeight, remoteTip.blockHeight);
+            for (const remoteAnchor of range.anchors) {
+                await this.reconcileRemoteAnchor(topic, remote, remoteAnchor, report);
+            }
+            const refreshedTip = await this.provideTopicAnchorTip(topic);
+            report.localTip = refreshedTip;
+            report.status = refreshedTip.blockHeight >= remoteTip.blockHeight && refreshedTip.tac === remoteTip.tac ? 'matched' : 'advanced';
+            return report;
+        }
+        catch (error) {
+            report.status = 'error';
+            report.message = error instanceof Error ? error.message : String(error);
+            this.logger.error(`[BASM SYNC] Sync failed for topic "${topic}" with peer "${endpoint}"`, error);
+            return report;
+        }
+    }
+    async reconcileRemoteAnchor(topic, remote, remoteAnchor, report) {
+        var _a, _b, _c, _d, _f;
+        report.checkedHeights.push(remoteAnchor.blockHeight);
+        const localAnchor = await ((_b = (_a = this.storage).findTopicBlockAnchor) === null || _b === void 0 ? void 0 : _b.call(_a, topic, remoteAnchor.blockHeight, remoteAnchor.blockHash));
+        if ((localAnchor === null || localAnchor === void 0 ? void 0 : localAnchor.tac) === remoteAnchor.tac) {
+            return;
+        }
+        const admittedResponse = await remote.requestAdmittedList(remoteAnchor.blockHeight, remoteAnchor.blockHash);
+        const remoteBasmRoot = (0, BASM_js_1.computeBasmRoot)(admittedResponse.admitted);
+        if (remoteBasmRoot !== remoteAnchor.basmRoot ||
+            admittedResponse.admitted.length !== remoteAnchor.admittedCount) {
+            throw new Error(`Peer ${report.endpoint} supplied an admitted list inconsistent with its anchor at height ${remoteAnchor.blockHeight}`);
+        }
+        const localAdmitted = (_f = await ((_d = (_c = this.storage).findAdmittedTransactionsForBlock) === null || _d === void 0 ? void 0 : _d.call(_c, topic, remoteAnchor.blockHeight, remoteAnchor.blockHash))) !== null && _f !== void 0 ? _f : [];
+        const localTxids = new Set(localAdmitted.map(item => item.txid));
+        const missingTxids = admittedResponse.admitted
+            .map(item => item.txid)
+            .filter(txid => !localTxids.has(txid));
+        report.missingTxids.push(...missingTxids);
+        if (missingTxids.length === 0) {
+            report.status = 'diverged';
+            return;
+        }
+        await this.fetchBASMMissingTransactions(remote, topic, remoteAnchor, missingTxids);
+        report.fetchedTxCount += missingTxids.length;
+    }
+    async fetchBASMMissingTransactions(remote, topic, anchor, txids) {
+        if (this.chainTracker === 'scripts only') {
+            throw new Error('BASM reconciliation requires a ChainTracker capable of validating BUMP proofs');
+        }
+        const proofResponse = await remote.requestCompoundMerklePath(anchor.blockHeight, txids);
+        const compoundPath = sdk_1.MerklePath.fromHex(proofResponse.merklePath);
+        for (const txid of txids) {
+            const valid = await compoundPath.verify(txid, this.chainTracker);
+            if (!valid) {
+                throw new Error(`Peer supplied invalid compound Merkle path for ${txid} at height ${anchor.blockHeight}`);
+            }
+        }
+        const rawResponse = await remote.requestRawTransactions(txids);
+        if (rawResponse.missing.length > 0) {
+            throw new Error(`Peer did not return raw transactions for txids: ${rawResponse.missing.join(',')}`);
+        }
+        for (const record of rawResponse.transactions) {
+            const tx = sdk_1.Transaction.fromHex(record.rawTx);
+            if (tx.id('hex') !== record.txid) {
+                throw new Error(`Raw transaction txid mismatch: expected ${record.txid}, got ${tx.id('hex')}`);
+            }
+            try {
+                tx.merklePath = compoundPath.extract([record.txid]);
+            }
+            catch {
+                tx.merklePath = compoundPath;
+            }
+            await this.submit({ beef: tx.toBEEF(), topics: [topic] }, undefined, 'historical-tx');
+        }
+    }
+    async evictUnprovenTransactions(options = {}) {
+        var _a, _b, _c;
+        if (typeof this.storage.findUnprovenAppliedTransactions !== 'function') {
+            throw new TypeError('Storage does not support unproven transaction eviction');
+        }
+        if (this.chainTracker === 'scripts only') {
+            throw new Error('Unproven eviction requires a ChainTracker to determine block age');
+        }
+        const thresholdBlocks = (_a = options.thresholdBlocks) !== null && _a !== void 0 ? _a : this.unprovenEvictionBlocks;
+        const currentHeight = await this.chainTracker.currentHeight();
+        const cutoffHeight = currentHeight - thresholdBlocks;
+        const candidates = await this.storage.findUnprovenAppliedTransactions(cutoffHeight, options.topic);
+        let evictedOutputs = 0;
+        for (const candidate of candidates) {
+            for (const output of candidate.outputs) {
+                for (const service of Object.values(this.lookupServices)) {
+                    try {
+                        await service.outputEvicted(output.txid, output.outputIndex);
+                    }
+                    catch (error) {
+                        this.logger.debug(`outputEvicted notification failed for ${output.txid}.${output.outputIndex}: ${error}`);
+                    }
+                }
+                await this.storage.deleteOutput(output.txid, output.outputIndex, candidate.topic);
+                evictedOutputs++;
+            }
+            await ((_c = (_b = this.storage).deleteAppliedTransaction) === null || _c === void 0 ? void 0 : _c.call(_b, candidate.txid, candidate.topic));
+        }
+        return {
+            cutoffHeight,
+            candidates: candidates.length,
+            evictedTransactions: candidates.length,
+            evictedOutputs
+        };
+    }
     /**
      * Given a GASP request, create an initial response.
      *
@@ -810,29 +1384,17 @@ class Engine {
                     // For each input, look it up and recurse.
                     for (const input of tx.inputs) {
                         // We should always have a source transaction
-                        if (input.sourceTransaction !== undefined) {
-                            searchInput(input.sourceTransaction);
+                        if (input.sourceTransaction === undefined) {
+                            throw new Error('Incomplete SPV data!');
                         }
                         else {
-                            throw new Error('Incomplete SPV data!');
+                            searchInput(input.sourceTransaction);
                         }
                     }
                 }
             };
             searchInput(rootTx);
-            if (correctTx !== undefined) {
-                const rawTx = correctTx.toHex();
-                const node = {
-                    rawTx,
-                    graphID,
-                    outputIndex
-                };
-                if (correctTx.merklePath !== undefined) {
-                    node.proof = correctTx.merklePath.toHex();
-                }
-                return node;
-            }
-            else {
+            if (correctTx === undefined) {
                 // Recursively try to find a matching output
                 let foundNode;
                 for (const currentOutput of output.outputsConsumed) {
@@ -842,6 +1404,8 @@ class Engine {
                         break;
                     }
                     catch (error) {
+                        // Best-effort: output may not be found or hydration fails for this candidate; try the next one
+                        this.logger.debug(`Unable to hydrate output ${currentOutput.txid}.${currentOutput.outputIndex}: ${error}`);
                         continue;
                     }
                 }
@@ -849,6 +1413,18 @@ class Engine {
                     return foundNode;
                 }
             }
+            else {
+                const rawTx = correctTx.toHex();
+                const node = {
+                    rawTx,
+                    graphID,
+                    outputIndex
+                };
+                if (correctTx.merklePath !== undefined) {
+                    node.proof = correctTx.merklePath.toHex();
+                }
+                return node;
+            }
             throw new Error('Unable to find output associated with your request!');
         };
         const [rootTxid, rootOutputIndex] = graphID.split('.');
@@ -872,7 +1448,7 @@ class Engine {
     */
     async getUTXOHistory(output, historySelector, currentDepth = 0, context = this.createUTXOHistoryHydrationContext()) {
         // If we have an output but no history selector, just return the output.
-        if (typeof historySelector === 'undefined') {
+        if (historySelector === undefined) {
             return output;
         }
         try {
@@ -912,7 +1488,10 @@ class Engine {
                     try {
                         await ((_a = l.outputNoLongerRetainedInHistory) === null || _a === void 0 ? void 0 : _a.call(l, output.txid, output.outputIndex, output.topic));
                     }
-                    catch (_) { }
+                    catch (e) {
+                        // Best-effort notification; lookup service failure must not abort UTXO deletion
+                        this.logger.debug(`outputNoLongerRetainedInHistory notification failed for ${output.txid}.${output.outputIndex}: ${e}`);
+                    }
                 }
             }
             // If there are no more consumed utxos, return
@@ -920,7 +1499,7 @@ class Engine {
                 return;
             }
             // Delete any stale outputs that were consumed as inputs
-            output.outputsConsumed.map(async (outputIdentifier) => {
+            await Promise.all(output.outputsConsumed.map(async (outputIdentifier) => {
                 const staleOutput = await this.storage.findOutput(outputIdentifier.txid, outputIdentifier.outputIndex, output.topic);
                 // Make sure an output was found
                 if (staleOutput === null || staleOutput === undefined) {
@@ -934,7 +1513,7 @@ class Engine {
                 }
                 // Find previousUTXO history
                 return await this.deleteUTXODeep(staleOutput);
-            });
+            }));
         }
         catch (error) {
             throw new Error(`Failed to delete all stale outputs: ${error} `);
@@ -1005,17 +1584,40 @@ class Engine {
      * @param blockHeight - The block height associated with the incoming merkle proof.
      */
     async handleNewMerkleProof(txid, proof, blockHeight) {
-        var _a, _b;
+        var _a, _b, _c, _d;
         const outputs = await this.storage.findOutputsForTransaction(txid, true);
         if (outputs === undefined || outputs.length === 0) {
             throw new Error('Could not find matching transaction outputs for proof ingest!');
         }
+        const proofMetadata = (0, BASM_js_1.extractMerkleProofMetadata)(txid, proof);
+        const resolvedBlockHeight = blockHeight !== null && blockHeight !== void 0 ? blockHeight : proofMetadata === null || proofMetadata === void 0 ? void 0 : proofMetadata.blockHeight;
+        const resolvedBlockHash = resolvedBlockHeight === undefined
+            ? undefined
+            : await this.resolveBlockHash(resolvedBlockHeight, proofMetadata === null || proofMetadata === void 0 ? void 0 : proofMetadata.merkleRoot);
         for (const output of outputs) {
             await this.updateMerkleProof(output, txid, proof);
             // Add the associated blockHeight
-            if (blockHeight !== undefined) {
-                output.blockHeight = blockHeight;
-                await ((_b = (_a = this.storage).updateOutputBlockHeight) === null || _b === void 0 ? void 0 : _b.call(_a, output.txid, output.outputIndex, output.topic, blockHeight));
+            if (resolvedBlockHeight !== undefined) {
+                output.blockHeight = resolvedBlockHeight;
+                await ((_b = (_a = this.storage).updateOutputBlockHeight) === null || _b === void 0 ? void 0 : _b.call(_a, output.txid, output.outputIndex, output.topic, resolvedBlockHeight));
+            }
+            if (output.beef !== undefined) {
+                const tx = sdk_1.Transaction.fromBEEF(output.beef);
+                this.updateInputProofs(tx, txid, proof);
+                await this.recordTransactionData(tx, tx.toBEEF(), resolvedBlockHash);
+            }
+            if (resolvedBlockHeight !== undefined) {
+                await ((_d = (_c = this.storage).updateAppliedTransactionProof) === null || _d === void 0 ? void 0 : _d.call(_c, {
+                    txid,
+                    topic: output.topic,
+                    blockHeight: resolvedBlockHeight,
+                    blockHash: resolvedBlockHash,
+                    blockIndex: proofMetadata === null || proofMetadata === void 0 ? void 0 : proofMetadata.blockIndex,
+                    merkleRoot: proofMetadata === null || proofMetadata === void 0 ? void 0 : proofMetadata.merkleRoot
+                }));
+            }
+            if (resolvedBlockHeight !== undefined && resolvedBlockHash !== undefined) {
+                await this.recomputeTopicBlockAnchor(output.topic, resolvedBlockHeight, resolvedBlockHash);
             }
         }
     }
@@ -1031,7 +1633,7 @@ class Engine {
                 result[t] = await this.managers[t].getMetaData();
             }
             catch (e) {
-                this.logger.warn(`Unable to get metadata for topic manager: ${t}`);
+                this.logger.warn(`Unable to get metadata for topic manager: ${t}: ${e}`);
                 result[t] = {
                     name: t,
                     shortDescription: 'No topical tagline.'
@@ -1052,7 +1654,7 @@ class Engine {
                 result[ls] = await this.lookupServices[ls].getMetaData();
             }
             catch (e) {
-                this.logger.warn(`Unable to get metadata for lookup service: ${ls}`);
+                this.logger.warn(`Unable to get metadata for lookup service: ${ls}: ${e}`);
                 result[ls] = {
                     name: ls,
                     shortDescription: 'No lookup service tagline.'
@@ -1069,7 +1671,7 @@ class Engine {
     async getDocumentationForTopicManager(manager) {
         var _a, _b;
         const documentation = await ((_b = (_a = this.managers[manager]) === null || _a === void 0 ? void 0 : _a.getDocumentation) === null || _b === void 0 ? void 0 : _b.call(_a));
-        return documentation !== undefined ? documentation : 'No documentation found!';
+        return documentation !== null && documentation !== void 0 ? documentation : 'No documentation found!';
     }
     /**
      * Run a query to get the documentation for a particular lookup service
@@ -1079,7 +1681,7 @@ class Engine {
     async getDocumentationForLookupServiceProvider(provider) {
         var _a, _b;
         const documentation = await ((_b = (_a = this.lookupServices[provider]) === null || _a === void 0 ? void 0 : _a.getDocumentation) === null || _b === void 0 ? void 0 : _b.call(_a));
-        return documentation !== undefined ? documentation : 'No documentation found!';
+        return documentation !== null && documentation !== void 0 ? documentation : 'No documentation found!';
     }
     /**
      * Validates a URL to ensure it does not match disallowed patterns:
@@ -1109,7 +1711,7 @@ class Engine {
                 /^127\.\d{1,3}\.\d{1,3}\.\d{1,3}$/, // Loopback IPs
                 /^10\.\d{1,3}\.\d{1,3}\.\d{1,3}$/, // 10.x.x.x private IPs
                 /^192\.168\.\d{1,3}\.\d{1,3}$/, // 192.168.x.x private IPs
-                /^172\.(1[6-9]|2[0-9]|3[0-1])\.\d{1,3}\.\d{1,3}$/, // 172.16.x.x to 172.31.x.x private IPs
+                /^172\.(1[6-9]|2\d|3[0-1])\.\d{1,3}\.\d{1,3}$/, // 172.16.x.x to 172.31.x.x private IPs
                 /^0\.0\.0\.0$/ // Non-routable address
             ];
             // Check for IPv4 matches
@@ -1123,8 +1725,8 @@ class Engine {
             // If none of the disallowed conditions matched, the URL is valid
             return true;
         }
-        catch (error) {
-            // If the input is not a valid URL, return false
+        catch (_e) {
+            // URL constructor throws on malformed input — not a valid URL, return false
             return false;
         }
     }