crypto-aio 0.0.3 → 0.1.0

package/dist/adapters/utxo/esplora.js

@@ -0,0 +1,451 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EsploraClient = exports.isHash = exports.MAX_MONEY = exports.PREVIOUS_TX_CACHE = void 0;
+exports.malformed = malformed;
+exports.isNotFound = isNotFound;
+exports.parseHeight = parseHeight;
+exports.parseHash = parseHash;
+exports.parseStatus = parseStatus;
+exports.parseTx = parseTx;
+exports.parseOutspend = parseOutspend;
+exports.parseFeeEstimates = parseFeeEstimates;
+/**
+ * The Esplora REST API, sent directly over the core transport. Every call carries the
+ * calling driver method's tags and a `route` template with no identifiers in it, which
+ * events and logs show instead of the path. Answers are validated strictly: a malformed
+ * one is a retryable `ProviderError('PROVIDER_UNAVAILABLE')`, a missing or ill-typed
+ * field is malformed and never a default, an answer for another id than the one asked for is
+ * refused, and a 404 is `null`. Chain data is read as the chain allows it, never bounded by
+ * what this library builds (lenient readers). Chain reads use the `rpc` transport; address
+ * reads use the `indexer`. Only raw transaction hex is decoded, by the strict linear
+ * reader (`rawtx.ts`), to bind it to its txid.
+ */
+const error_1 = require("../../core/errors/error");
+const codec_1 = require("./codec");
+const HEX64 = /^[0-9a-f]{64}$/;
+/**
+ * The previous transactions one client keeps, by count and by bytes without the
+ * witness (a larger one is not kept). A typical one is a few hundred bytes.
+ */
+exports.PREVIOUS_TX_CACHE = Object.freeze({ entries: 1_000, bytes: 8_000_000 });
+/** Bitcoin Core's `MAX_MONEY`: no output, and no balance, is larger. */
+exports.MAX_MONEY = 2100000000000000n;
+/**
+ * Lowercase hex of whole bytes. A flat character class, not `([0-9a-f]{2})+`: that pattern
+ * overflows V8's regexp stack on the hex of a transaction of about 3.5 MB, which is valid.
+ */
+const isHex = (value) => value.length % 2 === 0 && /^[0-9a-f]*$/.test(value);
+function malformed(what) {
+    return new error_1.ProviderError('PROVIDER_UNAVAILABLE', `malformed Esplora answer: ${what}`);
+}
+/** A definitive 404 (not an ambiguous or retried failure): the resource is not there. */
+function isNotFound(error) {
+    return ((0, error_1.isCryptoAioError)(error, 'RPC_ERROR') &&
+        !error.ambiguous &&
+        error.details?.status === 404);
+}
+const record = (value, what) => {
+    if (value === null || typeof value !== 'object' || Array.isArray(value))
+        throw malformed(what);
+    return value;
+};
+const hash = (value, what) => {
+    if (typeof value !== 'string' || !HEX64.test(value))
+        throw malformed(what);
+    return value;
+};
+const integer = (value, what, max = Number.MAX_SAFE_INTEGER) => {
+    if (!Number.isSafeInteger(value) || value < 0 || value > max) {
+        throw malformed(what);
+    }
+    return value;
+};
+const sats = (value, what) => BigInt(integer(value, what, Number(exports.MAX_MONEY)));
+const u32 = (value, what) => integer(value, what, 0xffffffff);
+/**
+ * A transaction's 32-bit version, which Esplora servers print signed or unsigned, as one
+ * signed value (`v | 0`), so both printings agree. Chain data: any version a block holds is
+ * read, whatever this library builds (version 2).
+ */
+const txVersion = (value) => {
+    if (!Number.isSafeInteger(value) ||
+        value < -0x80000000 ||
+        value > 0xffffffff) {
+        throw malformed('tx.version');
+    }
+    return value | 0;
+};
+/**
+ * A cumulative total of an address (every output it ever received or spent), read exactly
+ * (`exactIntegers`): a busy address's totals exceed 21 million bitcoin, and may exceed 2^53.
+ */
+const total = (value, what) => {
+    if (typeof value === 'bigint') {
+        if (value < 0n)
+            throw malformed(what);
+        return value;
+    }
+    return BigInt(integer(value, what));
+};
+function parseHeight(text) {
+    if (typeof text !== 'string' || !/^(0|[1-9][0-9]{0,9})$/.test(text.trim())) {
+        throw malformed('block height');
+    }
+    return BigInt(text.trim());
+}
+function parseHash(text) {
+    return hash(typeof text === 'string' ? text.trim() : text, 'block hash');
+}
+function parseStatus(value) {
+    const status = record(value, 'status');
+    if (typeof status.confirmed !== 'boolean')
+        throw malformed('status.confirmed');
+    if (!status.confirmed)
+        return { confirmed: false };
+    return {
+        confirmed: true,
+        blockHeight: BigInt(integer(status.block_height, 'status.block_height')),
+        blockHash: hash(status.block_hash, 'status.block_hash'),
+        ...(status.block_time !== undefined && status.block_time !== null
+            ? { blockTime: integer(status.block_time, 'status.block_time') }
+            : {}),
+    };
+}
+function parseOutput(value) {
+    const output = record(value, 'vout');
+    if (typeof output.scriptpubkey !== 'string' || !isHex(output.scriptpubkey)) {
+        throw malformed('vout.scriptpubkey');
+    }
+    if (typeof output.scriptpubkey_type !== 'string')
+        throw malformed('vout.scriptpubkey_type');
+    const address = output.scriptpubkey_address;
+    if (address !== undefined && address !== null && typeof address !== 'string') {
+        throw malformed('vout.scriptpubkey_address');
+    }
+    return {
+        script: output.scriptpubkey,
+        type: output.scriptpubkey_type,
+        ...(typeof address === 'string' ? { address } : {}),
+        value: sats(output.value, 'vout.value'),
+    };
+}
+function parseInput(value) {
+    const input = record(value, 'vin');
+    // It decides whether the input has a previous output and the transaction a fee.
+    if (typeof input.is_coinbase !== 'boolean')
+        throw malformed('vin.is_coinbase');
+    const coinbase = input.is_coinbase;
+    return {
+        txid: hash(input.txid, 'vin.txid'),
+        vout: u32(input.vout, 'vin.vout'),
+        coinbase,
+        sequence: u32(input.sequence, 'vin.sequence'),
+        ...(coinbase ? {} : { prevout: parseOutput(input.prevout) }),
+    };
+}
+function parseTx(value) {
+    const tx = record(value, 'tx');
+    if (!Array.isArray(tx.vin) || !Array.isArray(tx.vout))
+        throw malformed('tx.vin/vout');
+    return {
+        txid: hash(tx.txid, 'tx.txid'),
+        version: txVersion(tx.version),
+        locktime: u32(tx.locktime, 'tx.locktime'),
+        weight: integer(tx.weight, 'tx.weight'),
+        // Esplora answers `fee` for every transaction (0 for a coinbase): missing is malformed.
+        fee: sats(tx.fee, 'tx.fee'),
+        vin: tx.vin.map(parseInput),
+        vout: tx.vout.map(parseOutput),
+        status: parseStatus(tx.status),
+    };
+}
+function parseBlock(value) {
+    const block = record(value, 'block');
+    const height = BigInt(integer(block.height, 'block.height'));
+    return {
+        hash: hash(block.id, 'block.id'),
+        height,
+        parentHash: height === 0n && block.previousblockhash === null
+            ? '0'.repeat(64)
+            : hash(block.previousblockhash, 'block.previousblockhash'),
+        timestamp: integer(block.timestamp, 'block.timestamp'),
+        txCount: integer(block.tx_count, 'block.tx_count'),
+    };
+}
+function parseOutspend(value) {
+    const spend = record(value, 'outspend');
+    if (typeof spend.spent !== 'boolean')
+        throw malformed('outspend.spent');
+    if (!spend.spent)
+        return { spent: false };
+    return {
+        spent: true,
+        txid: hash(spend.txid, 'outspend.txid'),
+        vin: u32(spend.vin, 'outspend.vin'),
+        status: parseStatus(spend.status),
+    };
+}
+function parseUtxo(value) {
+    const utxo = record(value, 'utxo');
+    return {
+        txid: hash(utxo.txid, 'utxo.txid'),
+        vout: u32(utxo.vout, 'utxo.vout'),
+        value: sats(utxo.value, 'utxo.value'),
+        status: parseStatus(utxo.status),
+    };
+}
+function list(value, what, parse) {
+    if (!Array.isArray(value))
+        throw malformed(what);
+    return value.map(parse);
+}
+/** Esplora's `/fee-estimates`: confirmation target (blocks) → sat/vB (a float). */
+function parseFeeEstimates(value) {
+    const estimates = record(value, 'fee-estimates');
+    const out = new Map();
+    for (const [target, rate] of Object.entries(estimates)) {
+        if (!/^[1-9][0-9]{0,3}$/.test(target))
+            throw malformed('fee-estimates target');
+        if (typeof rate !== 'number' || !Number.isFinite(rate) || rate < 0 || rate > 1e7) {
+            throw malformed('fee-estimates rate');
+        }
+        out.set(Number(target), rate);
+    }
+    return out;
+}
+/** Whether a caller's id is a txid or block hash (64 lowercase hex characters). */
+const isHash = (value) => typeof value === 'string' && HEX64.test(value);
+exports.isHash = isHash;
+/**
+ * A URL path segment from a caller must be exactly an id or an address, so no `..`, `/`
+ * or query can reach another route. The reader maps a malformed id to "not found" first.
+ */
+function segment(value, kind) {
+    if (kind === 'id' && !(0, exports.isHash)(value)) {
+        throw new error_1.ValidationError('INVALID_INTENT', 'a transaction or block id must be 64 lowercase hex digits');
+    }
+    if (kind === 'address' && !/^[0-9A-Za-z]{1,90}$/.test(value)) {
+        throw new error_1.ValidationError('INVALID_ADDRESS', 'invalid Bitcoin address');
+    }
+    return value;
+}
+/** The txid of strictly decoded transaction hex, or `undefined`. */
+function txidOf(hex) {
+    try {
+        return { txid: (0, codec_1.txidOfHex)(hex) };
+    }
+    catch {
+        return undefined;
+    }
+}
+/** Transactions kept per txid, oldest out first, by count and by bytes without witness. */
+class TxCache {
+    bounds;
+    #txs = new Map();
+    #bytes = 0;
+    constructor(bounds) {
+        this.bounds = bounds;
+    }
+    has(txid) {
+        return this.#txs.has(txid);
+    }
+    /** The transaction, now the most recently used, or `undefined`. */
+    get(txid) {
+        const tx = this.#txs.get(txid);
+        if (tx) {
+            this.#txs.delete(txid);
+            this.#txs.set(txid, tx);
+        }
+        return tx;
+    }
+    set(tx) {
+        if (tx.bytes.length > this.bounds.bytes)
+            return;
+        const old = this.#txs.get(tx.txid);
+        if (old) {
+            this.#txs.delete(tx.txid);
+            this.#bytes -= old.bytes.length;
+        }
+        this.#txs.set(tx.txid, tx);
+        this.#bytes += tx.bytes.length;
+        // The oldest go first (a Map iterates in insertion order).
+        for (const [id, entry] of this.#txs) {
+            if (this.#txs.size <= this.bounds.entries && this.#bytes <= this.bounds.bytes)
+                break;
+            this.#txs.delete(id);
+            this.#bytes -= entry.bytes.length;
+        }
+    }
+}
+/** One Esplora endpoint family (the `rpc` transport) and its address index (`indexer`). */
+class EsploraClient {
+    chain;
+    indexer;
+    cache;
+    #previous;
+    #own;
+    constructor(chain, indexer, cache = exports.PREVIOUS_TX_CACHE) {
+        this.chain = chain;
+        this.indexer = indexer;
+        this.cache = cache;
+        this.#previous = new TxCache(cache);
+        this.#own = new TxCache(cache);
+    }
+    #get(transport, path, route, tags, responseType = 'json', exactIntegers = false) {
+        const request = { method: 'GET', path, route, responseType };
+        return transport.http(request, exactIntegers ? { ...tags, exactIntegers } : tags);
+    }
+    async #orNull(work) {
+        try {
+            return await work();
+        }
+        catch (error) {
+            if (isNotFound(error))
+                return null;
+            throw error;
+        }
+    }
+    async tipHeight(tags) {
+        return parseHeight(await this.#get(this.chain, '/blocks/tip/height', '/blocks/tip/height', tags, 'text'));
+    }
+    /** The hash of the block at `height` on this endpoint's best chain, or `null` above its tip. */
+    blockHashAt(height, tags) {
+        return this.#orNull(async () => parseHash(await this.#get(this.chain, `/block-height/${height}`, '/block-height/:height', tags, 'text')));
+    }
+    block(blockHash, tags) {
+        return this.#orNull(async () => {
+            const block = parseBlock(await this.#get(this.chain, `/block/${segment(blockHash, 'id')}`, '/block/:hash', tags));
+            // The answer must be the block asked for.
+            if (block.hash !== blockHash)
+                throw malformed('block.id');
+            return block;
+        });
+    }
+    async blockTxids(blockHash, tags) {
+        const ids = await this.#get(this.chain, `/block/${segment(blockHash, 'id')}/txids`, '/block/:hash/txids', tags);
+        return list(ids, 'txids', (id) => hash(id, 'txid'));
+    }
+    /** Up to 25 transactions of a block from `start` (a multiple of 25). */
+    async blockTxs(blockHash, start, tags) {
+        const txs = await this.#get(this.chain, `/block/${segment(blockHash, 'id')}/txs/${start}`, '/block/:hash/txs/:start', tags);
+        return list(txs, 'block txs', parseTx);
+    }
+    tx(txid, tags) {
+        return this.#orNull(async () => {
+            const tx = parseTx(await this.#get(this.chain, `/tx/${segment(txid, 'id')}`, '/tx/:txid', tags));
+            // The answer must be the transaction asked for.
+            if (tx.txid !== txid)
+                throw malformed('tx.txid');
+            return tx;
+        });
+    }
+    /**
+     * `/tx/:txid/hex`, decoded strictly once and bound to `txid`: bytes that do not decode are
+     * malformed, and the bytes of another transaction are a retryable `PROVIDER_INCONSISTENT`,
+     * so a garbled answer is never taken for the caller's error. The decoder's cap is the
+     * largest transaction a block can hold, never what this library builds. Under
+     * a quorum, each endpoint's answer is keyed on the txid its bytes hash to, and the answer
+     * the quorum returns is not decoded again.
+     */
+    async #rawTx(txid, tags, decode) {
+        const decoded = new Map();
+        const read = (answer) => {
+            const hex = typeof answer === 'string' ? answer.trim() : '';
+            if (!decoded.has(hex)) {
+                decoded.set(hex, hex.length > 0 && isHex(hex) ? decode(hex) : undefined);
+            }
+            return { hex, tx: decoded.get(hex) };
+        };
+        const keyed = tags.quorum === undefined
+            ? tags
+            : {
+                ...tags,
+                // A throwing key counts as a disagreement.
+                quorumKey: (answer) => {
+                    const { tx } = read(answer);
+                    if (!tx)
+                        throw malformed('tx hex');
+                    return tx.txid;
+                },
+            };
+        const answer = await this.#get(this.chain, `/tx/${segment(txid, 'id')}/hex`, '/tx/:txid/hex', keyed, 'text');
+        const { hex, tx } = read(answer);
+        if (!tx)
+            throw malformed('tx hex');
+        if (tx.txid !== txid) {
+            throw new error_1.ProviderError('PROVIDER_INCONSISTENT', 'the transaction bytes do not hash to the id asked for', { retryable: true });
+        }
+        return { hex, tx };
+    }
+    /** The raw transaction, as hex, bound to `txid` (see `#rawTx`). */
+    txHex(txid, tags) {
+        return this.#orNull(async () => (await this.#rawTx(txid, tags, txidOf)).hex);
+    }
+    /**
+     * An input's previous transaction, decoded once and bound to `txid` (see
+     * `#rawTx`). Its bytes authenticate themselves, so it is kept per txid, whatever endpoint
+     * served it, in a bounded cache: a replacement's inputs are read once per client.
+     */
+    async previousTx(txid, tags) {
+        const known = this.#own.get(txid) ?? this.#previous.get(txid);
+        if (known)
+            return known;
+        const found = await this.#orNull(async () => (await this.#rawTx(txid, tags, codec_1.previousTxOf)).tx);
+        if (found)
+            this.#previous.set(found);
+        return found;
+    }
+    /**
+     * A transaction this client sent for an Attempt and a node took. Its bytes are
+     * known here, so its outputs are not an indexer's word even before a block holds it, and
+     * under `minInputConfirmations: 0` they may be spent unconfirmed. Kept like the cache.
+     */
+    rememberOwn(tx) {
+        this.#own.set(tx);
+    }
+    isOwn(txid) {
+        return this.#own.has(txid);
+    }
+    async outspend(txid, vout, tags) {
+        return parseOutspend(await this.#get(this.chain, `/tx/${segment(txid, 'id')}/outspend/${vout}`, '/tx/:txid/outspend/:vout', tags));
+    }
+    async feeEstimates(tags) {
+        return parseFeeEstimates(await this.#get(this.chain, '/fee-estimates', '/fee-estimates', tags));
+    }
+    /** `POST /tx`: the node's txid on success; a node refusal is the transport's `RPC_ERROR`. */
+    async broadcast(hex, tags) {
+        const answer = await this.chain.http({ method: 'POST', path: '/tx', route: '/tx', body: hex, responseType: 'text' }, tags);
+        if (typeof answer !== 'string' || !HEX64.test(answer.trim())) {
+            // The node answered 2xx, so the bytes may have been accepted.
+            throw new error_1.ProviderError('PROVIDER_UNAVAILABLE', 'malformed Esplora answer: broadcast txid', {
+                ambiguous: true,
+            });
+        }
+        return answer.trim();
+    }
+    async addressUtxos(address, tags) {
+        const utxos = await this.#get(this.indexer, `/address/${segment(address, 'address')}/utxo`, '/address/:address/utxo', tags);
+        return list(utxos, 'utxo list', parseUtxo);
+    }
+    async addressStats(address, tags) {
+        const info = record(await this.#get(this.indexer, `/address/${segment(address, 'address')}`, '/address/:address', tags, 'json', true), 'address');
+        const chain = record(info.chain_stats, 'chain_stats');
+        const funded = total(chain.funded_txo_sum, 'funded_txo_sum');
+        const spent = total(chain.spent_txo_sum, 'spent_txo_sum');
+        // The totals are unbounded; the balance is the chain's: 0 to 21 million bitcoin.
+        if (spent > funded || funded - spent > exports.MAX_MONEY)
+            throw malformed('address balance');
+        return { funded, spent };
+    }
+    /** Confirmed history, newest first, 25 per page, after `lastSeen` when given. */
+    async addressTxs(address, lastSeen, tags) {
+        const base = `/address/${segment(address, 'address')}/txs/chain`;
+        const path = lastSeen ? `${base}/${segment(lastSeen, 'id')}` : base;
+        const route = lastSeen
+            ? '/address/:address/txs/chain/:last_seen_txid'
+            : '/address/:address/txs/chain';
+        return list(await this.#get(this.indexer, path, route, tags), 'address txs', parseTx);
+    }
+}
+exports.EsploraClient = EsploraClient;
+//# sourceMappingURL=esplora.js.map

package/dist/adapters/utxo/esplora.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"esplora.js","sourceRoot":"","sources":["../../../src/adapters/utxo/esplora.ts"],"names":[],"mappings":";;;AAgDA,8BAEC;AAGD,gCAMC;AA+CD,kCAKC;AAED,8BAEC;AAED,kCAYC;AAmCD,0BAcC;AAiBD,sCAUC;AAkBD,8CAWC;AA1OD;;;;;;;;;;GAUG;AACH,mDAIiC;AAEjC,mCAAmE;AAenE,MAAM,KAAK,GAAG,gBAAgB,CAAC;AAC/B;;;GAGG;AACU,QAAA,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;AACrF,wEAAwE;AAC3D,QAAA,SAAS,GAAG,iBAAsB,CAAC;AAEhD;;;GAGG;AACH,MAAM,KAAK,GAAG,CAAC,KAAa,EAAW,EAAE,CACvC,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAEtD,SAAgB,SAAS,CAAC,IAAY;IACpC,OAAO,IAAI,qBAAa,CAAC,sBAAsB,EAAE,6BAA6B,IAAI,EAAE,CAAC,CAAC;AACxF,CAAC;AAED,yFAAyF;AACzF,SAAgB,UAAU,CAAC,KAAc;IACvC,OAAO,CACL,IAAA,wBAAgB,EAAC,KAAK,EAAE,WAAW,CAAC;QACpC,CAAC,KAAK,CAAC,SAAS;QAChB,KAAK,CAAC,OAAO,EAAE,MAAM,KAAK,GAAG,CAC9B,CAAC;AACJ,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,KAAc,EAAE,IAAY,EAAQ,EAAE;IACpD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACrE,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;IACxB,OAAO,KAAa,CAAC;AACvB,CAAC,CAAC;AACF,MAAM,IAAI,GAAG,CAAC,KAAc,EAAE,IAAY,EAAU,EAAE;IACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;IAC3E,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,KAAc,EAAE,IAAY,EAAE,GAAG,GAAG,MAAM,CAAC,gBAAgB,EAAU,EAAE;IACtF,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAK,KAAgB,GAAG,CAAC,IAAK,KAAgB,GAAG,GAAG,EAAE,CAAC;QACrF,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,KAAe,CAAC;AACzB,CAAC,CAAC;AACF,MAAM,IAAI,GAAG,CAAC,KAAc,EAAE,IAAY,EAAU,EAAE,CACpD,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,iBAAS,CAAC,CAAC,CAAC,CAAC;AAClD,MAAM,GAAG,GAAG,CAAC,KAAc,EAAE,IAAY,EAAU,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACvF;;;;GAIG;AACH,MAAM,SAAS,GAAG,CAAC,KAAc,EAAU,EAAE;IAC3C,IACE,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC;QAC3B,KAAgB,GAAG,CAAC,UAAU;QAC9B,KAAgB,GAAG,UAAU,EAC9B,CAAC;QACD,MAAM,SAAS,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IACD,OAAQ,KAAgB,GAAG,CAAC,CAAC;AAC/B,CAAC,CAAC;AACF;;;GAGG;AACH,MAAM,KAAK,GAAG,CAAC,KAAc,EAAE,IAAY,EAAU,EAAE;IACrD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,EAAE;YAAE,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AACtC,CAAC,CAAC;AAEF,SAAgB,WAAW,CAAC,IAAa;IACvC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAC3E,MAAM,SAAS,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,SAAgB,SAAS,CAAC,IAAa;IACrC,OAAO,IAAI,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;AAC3E,CAAC;AAED,SAAgB,WAAW,CAAC,KAAc;IACxC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACvC,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,SAAS;QAAE,MAAM,SAAS,CAAC,kBAAkB,CAAC,CAAC;IAC/E,IAAI,CAAC,MAAM,CAAC,SAAS;QAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACnD,OAAO;QACL,SAAS,EAAE,IAAI;QACf,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,qBAAqB,CAAC,CAAC;QACxE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC;QACvD,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI;YAC/D,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC,EAAE;YAChE,CAAC,CAAC,EAAE,CAAC;KACR,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACrC,IAAI,OAAO,MAAM,CAAC,YAAY,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;QAC3E,MAAM,SAAS,CAAC,mBAAmB,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,OAAO,MAAM,CAAC,iBAAiB,KAAK,QAAQ;QAC9C,MAAM,SAAS,CAAC,wBAAwB,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC;IAC5C,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAC7E,MAAM,SAAS,CAAC,2BAA2B,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO;QACL,MAAM,EAAE,MAAM,CAAC,YAAY;QAC3B,IAAI,EAAE,MAAM,CAAC,iBAAiB;QAC9B,GAAG,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC;KACxC,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,KAAc;IAChC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,gFAAgF;IAChF,IAAI,OAAO,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,MAAM,SAAS,CAAC,iBAAiB,CAAC,CAAC;IAC/E,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC;IACnC,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC;QAClC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC;QACjC,QAAQ;QACR,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,cAAc,CAAC;QAC7C,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;KAC7D,CAAC;AACJ,CAAC;AAED,SAAgB,OAAO,CAAC,KAAc;IACpC,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC;QAAE,MAAM,SAAS,CAAC,aAAa,CAAC,CAAC;IACtF,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;QAC9B,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,OAAO,CAAC;QAC9B,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,aAAa,CAAC;QACzC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QACvC,wFAAwF;QACxF,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC;QAC3B,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC;QAC3B,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;QAC9B,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC,MAAM,CAAC;KAC/B,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,KAAc;IAChC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;IAC7D,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC;QAChC,MAAM;QACN,UAAU,EACR,MAAM,KAAK,EAAE,IAAI,KAAK,CAAC,iBAAiB,KAAK,IAAI;YAC/C,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAChB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,yBAAyB,CAAC;QAC9D,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,iBAAiB,CAAC;QACtD,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,gBAAgB,CAAC;KACnD,CAAC;AACJ,CAAC;AAED,SAAgB,aAAa,CAAC,KAAc;IAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACxC,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,MAAM,SAAS,CAAC,gBAAgB,CAAC,CAAC;IACxE,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1C,OAAO;QACL,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,eAAe,CAAC;QACvC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,cAAc,CAAC;QACnC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC;KAClC,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,KAAc;IAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACnC,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC;QAClC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC;QACjC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC;QACrC,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;KACjC,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAI,KAAc,EAAE,IAAY,EAAE,KAA2B;IACxE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED,mFAAmF;AACnF,SAAgB,iBAAiB,CAAC,KAAc;IAC9C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACvD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,MAAM,SAAS,CAAC,sBAAsB,CAAC,CAAC;QAC/E,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;YACjF,MAAM,SAAS,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mFAAmF;AAC5E,MAAM,MAAM,GAAG,CAAC,KAAc,EAAmB,EAAE,CACxD,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AADpC,QAAA,MAAM,UAC8B;AAEjD;;;GAGG;AACH,SAAS,OAAO,CAAC,KAAa,EAAE,IAAsB;IACpD,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAA,cAAM,EAAC,KAAK,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,uBAAe,CACvB,gBAAgB,EAChB,2DAA2D,CAC5D,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,uBAAe,CAAC,iBAAiB,EAAE,yBAAyB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,oEAAoE;AACpE,SAAS,MAAM,CAAC,GAAW;IACzB,IAAI,CAAC;QACH,OAAO,EAAE,IAAI,EAAE,IAAA,iBAAS,EAAC,GAAG,CAAC,EAAE,CAAC;IAClC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,MAAM,OAAO;IAKQ;IAJV,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC9C,MAAM,GAAG,CAAC,CAAC;IAEX,YACmB,MAA4D;QAA5D,WAAM,GAAN,MAAM,CAAsD;IAC5E,CAAC;IAEJ,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,mEAAmE;IACnE,GAAG,CAAC,IAAY;QACd,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,GAAG,CAAC,EAAc;QAChB,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK;YAAE,OAAO;QAChD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC;QAC/B,2DAA2D;QAC3D,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK;gBAC3E,MAAM;YACR,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrB,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC;IACH,CAAC;CACF;AAED,2FAA2F;AAC3F,MAAa,aAAa;IAKL;IACA;IACA;IANV,SAAS,CAAU;IACnB,IAAI,CAAU;IAEvB,YACmB,KAAgB,EAChB,OAAkB,EAClB,QAGb,yBAAiB;QALJ,UAAK,GAAL,KAAK,CAAW;QAChB,YAAO,GAAP,OAAO,CAAW;QAClB,UAAK,GAAL,KAAK,CAGD;QAErB,IAAI,CAAC,SAAS,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CACF,SAAoB,EACpB,IAAY,EACZ,KAAa,EACb,IAAkB,EAClB,eAAgC,MAAM,EACtC,aAAa,GAAG,KAAK;QAErB,MAAM,OAAO,GAAgB,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;QAC1E,OAAO,SAAS,CAAC,IAAI,CAAI,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACvF,CAAC;IAED,KAAK,CAAC,OAAO,CAAI,IAAsB;QACrC,IAAI,CAAC;YACH,OAAO,MAAM,IAAI,EAAE,CAAC;QACtB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,UAAU,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,IAAkB;QAChC,OAAO,WAAW,CAChB,MAAM,IAAI,CAAC,IAAI,CACb,IAAI,CAAC,KAAK,EACV,oBAAoB,EACpB,oBAAoB,EACpB,IAAI,EACJ,MAAM,CACP,CACF,CAAC;IACJ,CAAC;IAED,gGAAgG;IAChG,WAAW,CAAC,MAAc,EAAE,IAAkB;QAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAC7B,SAAS,CACP,MAAM,IAAI,CAAC,IAAI,CACb,IAAI,CAAC,KAAK,EACV,iBAAiB,MAAM,EAAE,EACzB,uBAAuB,EACvB,IAAI,EACJ,MAAM,CACP,CACF,CACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,SAAiB,EAAE,IAAkB;QACzC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;YAC7B,MAAM,KAAK,GAAG,UAAU,CACtB,MAAM,IAAI,CAAC,IAAI,CACb,IAAI,CAAC,KAAK,EACV,UAAU,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,EACpC,cAAc,EACd,IAAI,CACL,CACF,CAAC;YACF,0CAA0C;YAC1C,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,MAAM,SAAS,CAAC,UAAU,CAAC,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,SAAiB,EAAE,IAAkB;QACpD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CACzB,IAAI,CAAC,KAAK,EACV,UAAU,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,EAC1C,oBAAoB,EACpB,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,wEAAwE;IACxE,KAAK,CAAC,QAAQ,CACZ,SAAiB,EACjB,KAAa,EACb,IAAkB;QAElB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CACzB,IAAI,CAAC,KAAK,EACV,UAAU,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,KAAK,EAAE,EACjD,yBAAyB,EACzB,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,GAAG,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,EAAE,CAAC,IAAY,EAAE,IAAkB;QACjC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;YAC7B,MAAM,EAAE,GAAG,OAAO,CAChB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,CAC7E,CAAC;YACF,gDAAgD;YAChD,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI;gBAAE,MAAM,SAAS,CAAC,SAAS,CAAC,CAAC;YACjD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CACV,IAAY,EACZ,IAAkB,EAClB,MAAsC;QAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;QACjD,MAAM,IAAI,GAAG,CAAC,MAAe,EAAsC,EAAE;YACnE,MAAM,GAAG,GAAG,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAC3E,CAAC;YACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,CAAC,CAAC;QACF,MAAM,KAAK,GACT,IAAI,CAAC,MAAM,KAAK,SAAS;YACvB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC;gBACE,GAAG,IAAI;gBACP,2CAA2C;gBAC3C,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE;oBACpB,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC5B,IAAI,CAAC,EAAE;wBAAE,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAC;oBACnC,OAAO,EAAE,CAAC,IAAI,CAAC;gBACjB,CAAC;aACF,CAAC;QACR,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAC5B,IAAI,CAAC,KAAK,EACV,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAChC,eAAe,EACf,KAAK,EACL,MAAM,CACP,CAAC;QACF,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE;YAAE,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,qBAAa,CACrB,uBAAuB,EACvB,uDAAuD,EACvD,EAAE,SAAS,EAAE,IAAI,EAAE,CACpB,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;IACrB,CAAC;IAED,mEAAmE;IACnE,KAAK,CAAC,IAAY,EAAE,IAAkB;QACpC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/E,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,UAAU,CAAC,IAAY,EAAE,IAAkB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAC9B,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,oBAAY,CAAC,CAAC,CAAC,EAAE,CAC7D,CAAC;QACF,IAAI,KAAK;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,EAAc;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,QAAQ,CACZ,IAAY,EACZ,IAAY,EACZ,IAAkB;QAElB,OAAO,aAAa,CAClB,MAAM,IAAI,CAAC,IAAI,CACb,IAAI,CAAC,KAAK,EACV,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,IAAI,EAAE,EAC7C,0BAA0B,EAC1B,IAAI,CACL,CACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,IAAkB;QACnC,OAAO,iBAAiB,CACtB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,IAAI,CAAC,CACtE,CAAC;IACJ,CAAC;IAED,6FAA6F;IAC7F,KAAK,CAAC,SAAS,CAAC,GAAW,EAAE,IAAkB;QAC7C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAClC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,EAC9E,IAAI,CACL,CAAC;QACF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YAC7D,8DAA8D;YAC9D,MAAM,IAAI,qBAAa,CACrB,sBAAsB,EACtB,0CAA0C,EAC1C;gBACE,SAAS,EAAE,IAAI;aAChB,CACF,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,OAAe,EAAE,IAAkB;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAC3B,IAAI,CAAC,OAAO,EACZ,YAAY,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,EAC9C,wBAAwB,EACxB,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,OAAe,EAAE,IAAkB;QACpD,MAAM,IAAI,GAAG,MAAM,CACjB,MAAM,IAAI,CAAC,IAAI,CACb,IAAI,CAAC,OAAO,EACZ,YAAY,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,EACzC,mBAAmB,EACnB,IAAI,EACJ,MAAM,EACN,IAAI,CACL,EACD,SAAS,CACV,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,eAAe,CAAC,CAAC;QAC1D,iFAAiF;QACjF,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,iBAAS;YAAE,MAAM,SAAS,CAAC,iBAAiB,CAAC,CAAC;QACrF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,iFAAiF;IACjF,KAAK,CAAC,UAAU,CACd,OAAe,EACf,QAA4B,EAC5B,IAAkB;QAElB,MAAM,IAAI,GAAG,YAAY,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,YAAY,CAAC;QACjE,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACpE,MAAM,KAAK,GAAG,QAAQ;YACpB,CAAC,CAAC,6CAA6C;YAC/C,CAAC,CAAC,6BAA6B,CAAC;QAClC,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;IACxF,CAAC;CACF;AA5RD,sCA4RC","sourcesContent":["/**\n * The Esplora REST API, sent directly over the core transport. Every call carries the\n * calling driver method's tags and a `route` template with no identifiers in it, which\n * events and logs show instead of the path. Answers are validated strictly: a malformed\n * one is a retryable `ProviderError('PROVIDER_UNAVAILABLE')`, a missing or ill-typed\n * field is malformed and never a default, an answer for another id than the one asked for is\n * refused, and a 404 is `null`. Chain data is read as the chain allows it, never bounded by\n * what this library builds (lenient readers). Chain reads use the `rpc` transport; address\n * reads use the `indexer`. Only raw transaction hex is decoded, by the strict linear\n * reader (`rawtx.ts`), to bind it to its txid.\n */\nimport {\n  ProviderError,\n  ValidationError,\n  isCryptoAioError,\n} from '../../core/errors/error';\nimport type { HttpRequest, Transport } from '../../core/transport/types';\nimport { previousTxOf, txidOfHex, type PreviousTx } from './codec';\nimport type {\n  EsploraAddressStats,\n  EsploraBlock,\n  EsploraInput,\n  EsploraOutput,\n  EsploraOutspend,\n  EsploraStatus,\n  EsploraTx,\n  EsploraUtxo,\n  UtxoCallTags,\n} from './types';\n\ntype Json = Readonly<Record<string, unknown>>;\n\nconst HEX64 = /^[0-9a-f]{64}$/;\n/**\n * The previous transactions one client keeps, by count and by bytes without the\n * witness (a larger one is not kept). A typical one is a few hundred bytes.\n */\nexport const PREVIOUS_TX_CACHE = Object.freeze({ entries: 1_000, bytes: 8_000_000 });\n/** Bitcoin Core's `MAX_MONEY`: no output, and no balance, is larger. */\nexport const MAX_MONEY = 2_100_000_000_000_000n;\n\n/**\n * Lowercase hex of whole bytes. A flat character class, not `([0-9a-f]{2})+`: that pattern\n * overflows V8's regexp stack on the hex of a transaction of about 3.5 MB, which is valid.\n */\nconst isHex = (value: string): boolean =>\n  value.length % 2 === 0 && /^[0-9a-f]*$/.test(value);\n\nexport function malformed(what: string): ProviderError {\n  return new ProviderError('PROVIDER_UNAVAILABLE', `malformed Esplora answer: ${what}`);\n}\n\n/** A definitive 404 (not an ambiguous or retried failure): the resource is not there. */\nexport function isNotFound(error: unknown): boolean {\n  return (\n    isCryptoAioError(error, 'RPC_ERROR') &&\n    !error.ambiguous &&\n    error.details?.status === 404\n  );\n}\n\nconst record = (value: unknown, what: string): Json => {\n  if (value === null || typeof value !== 'object' || Array.isArray(value))\n    throw malformed(what);\n  return value as Json;\n};\nconst hash = (value: unknown, what: string): string => {\n  if (typeof value !== 'string' || !HEX64.test(value)) throw malformed(what);\n  return value;\n};\nconst integer = (value: unknown, what: string, max = Number.MAX_SAFE_INTEGER): number => {\n  if (!Number.isSafeInteger(value) || (value as number) < 0 || (value as number) > max) {\n    throw malformed(what);\n  }\n  return value as number;\n};\nconst sats = (value: unknown, what: string): bigint =>\n  BigInt(integer(value, what, Number(MAX_MONEY)));\nconst u32 = (value: unknown, what: string): number => integer(value, what, 0xffffffff);\n/**\n * A transaction's 32-bit version, which Esplora servers print signed or unsigned, as one\n * signed value (`v | 0`), so both printings agree. Chain data: any version a block holds is\n * read, whatever this library builds (version 2).\n */\nconst txVersion = (value: unknown): number => {\n  if (\n    !Number.isSafeInteger(value) ||\n    (value as number) < -0x80000000 ||\n    (value as number) > 0xffffffff\n  ) {\n    throw malformed('tx.version');\n  }\n  return (value as number) | 0;\n};\n/**\n * A cumulative total of an address (every output it ever received or spent), read exactly\n * (`exactIntegers`): a busy address's totals exceed 21 million bitcoin, and may exceed 2^53.\n */\nconst total = (value: unknown, what: string): bigint => {\n  if (typeof value === 'bigint') {\n    if (value < 0n) throw malformed(what);\n    return value;\n  }\n  return BigInt(integer(value, what));\n};\n\nexport function parseHeight(text: unknown): bigint {\n  if (typeof text !== 'string' || !/^(0|[1-9][0-9]{0,9})$/.test(text.trim())) {\n    throw malformed('block height');\n  }\n  return BigInt(text.trim());\n}\n\nexport function parseHash(text: unknown): string {\n  return hash(typeof text === 'string' ? text.trim() : text, 'block hash');\n}\n\nexport function parseStatus(value: unknown): EsploraStatus {\n  const status = record(value, 'status');\n  if (typeof status.confirmed !== 'boolean') throw malformed('status.confirmed');\n  if (!status.confirmed) return { confirmed: false };\n  return {\n    confirmed: true,\n    blockHeight: BigInt(integer(status.block_height, 'status.block_height')),\n    blockHash: hash(status.block_hash, 'status.block_hash'),\n    ...(status.block_time !== undefined && status.block_time !== null\n      ? { blockTime: integer(status.block_time, 'status.block_time') }\n      : {}),\n  };\n}\n\nfunction parseOutput(value: unknown): EsploraOutput {\n  const output = record(value, 'vout');\n  if (typeof output.scriptpubkey !== 'string' || !isHex(output.scriptpubkey)) {\n    throw malformed('vout.scriptpubkey');\n  }\n  if (typeof output.scriptpubkey_type !== 'string')\n    throw malformed('vout.scriptpubkey_type');\n  const address = output.scriptpubkey_address;\n  if (address !== undefined && address !== null && typeof address !== 'string') {\n    throw malformed('vout.scriptpubkey_address');\n  }\n  return {\n    script: output.scriptpubkey,\n    type: output.scriptpubkey_type,\n    ...(typeof address === 'string' ? { address } : {}),\n    value: sats(output.value, 'vout.value'),\n  };\n}\n\nfunction parseInput(value: unknown): EsploraInput {\n  const input = record(value, 'vin');\n  // It decides whether the input has a previous output and the transaction a fee.\n  if (typeof input.is_coinbase !== 'boolean') throw malformed('vin.is_coinbase');\n  const coinbase = input.is_coinbase;\n  return {\n    txid: hash(input.txid, 'vin.txid'),\n    vout: u32(input.vout, 'vin.vout'),\n    coinbase,\n    sequence: u32(input.sequence, 'vin.sequence'),\n    ...(coinbase ? {} : { prevout: parseOutput(input.prevout) }),\n  };\n}\n\nexport function parseTx(value: unknown): EsploraTx {\n  const tx = record(value, 'tx');\n  if (!Array.isArray(tx.vin) || !Array.isArray(tx.vout)) throw malformed('tx.vin/vout');\n  return {\n    txid: hash(tx.txid, 'tx.txid'),\n    version: txVersion(tx.version),\n    locktime: u32(tx.locktime, 'tx.locktime'),\n    weight: integer(tx.weight, 'tx.weight'),\n    // Esplora answers `fee` for every transaction (0 for a coinbase): missing is malformed.\n    fee: sats(tx.fee, 'tx.fee'),\n    vin: tx.vin.map(parseInput),\n    vout: tx.vout.map(parseOutput),\n    status: parseStatus(tx.status),\n  };\n}\n\nfunction parseBlock(value: unknown): EsploraBlock {\n  const block = record(value, 'block');\n  const height = BigInt(integer(block.height, 'block.height'));\n  return {\n    hash: hash(block.id, 'block.id'),\n    height,\n    parentHash:\n      height === 0n && block.previousblockhash === null\n        ? '0'.repeat(64)\n        : hash(block.previousblockhash, 'block.previousblockhash'),\n    timestamp: integer(block.timestamp, 'block.timestamp'),\n    txCount: integer(block.tx_count, 'block.tx_count'),\n  };\n}\n\nexport function parseOutspend(value: unknown): EsploraOutspend {\n  const spend = record(value, 'outspend');\n  if (typeof spend.spent !== 'boolean') throw malformed('outspend.spent');\n  if (!spend.spent) return { spent: false };\n  return {\n    spent: true,\n    txid: hash(spend.txid, 'outspend.txid'),\n    vin: u32(spend.vin, 'outspend.vin'),\n    status: parseStatus(spend.status),\n  };\n}\n\nfunction parseUtxo(value: unknown): EsploraUtxo {\n  const utxo = record(value, 'utxo');\n  return {\n    txid: hash(utxo.txid, 'utxo.txid'),\n    vout: u32(utxo.vout, 'utxo.vout'),\n    value: sats(utxo.value, 'utxo.value'),\n    status: parseStatus(utxo.status),\n  };\n}\n\nfunction list<T>(value: unknown, what: string, parse: (item: unknown) => T): T[] {\n  if (!Array.isArray(value)) throw malformed(what);\n  return value.map(parse);\n}\n\n/** Esplora's `/fee-estimates`: confirmation target (blocks) → sat/vB (a float). */\nexport function parseFeeEstimates(value: unknown): ReadonlyMap<number, number> {\n  const estimates = record(value, 'fee-estimates');\n  const out = new Map<number, number>();\n  for (const [target, rate] of Object.entries(estimates)) {\n    if (!/^[1-9][0-9]{0,3}$/.test(target)) throw malformed('fee-estimates target');\n    if (typeof rate !== 'number' || !Number.isFinite(rate) || rate < 0 || rate > 1e7) {\n      throw malformed('fee-estimates rate');\n    }\n    out.set(Number(target), rate);\n  }\n  return out;\n}\n\n/** Whether a caller's id is a txid or block hash (64 lowercase hex characters). */\nexport const isHash = (value: unknown): value is string =>\n  typeof value === 'string' && HEX64.test(value);\n\n/**\n * A URL path segment from a caller must be exactly an id or an address, so no `..`, `/`\n * or query can reach another route. The reader maps a malformed id to \"not found\" first.\n */\nfunction segment(value: string, kind: 'id' | 'address'): string {\n  if (kind === 'id' && !isHash(value)) {\n    throw new ValidationError(\n      'INVALID_INTENT',\n      'a transaction or block id must be 64 lowercase hex digits',\n    );\n  }\n  if (kind === 'address' && !/^[0-9A-Za-z]{1,90}$/.test(value)) {\n    throw new ValidationError('INVALID_ADDRESS', 'invalid Bitcoin address');\n  }\n  return value;\n}\n\n/** The txid of strictly decoded transaction hex, or `undefined`. */\nfunction txidOf(hex: string): { readonly txid: string } | undefined {\n  try {\n    return { txid: txidOfHex(hex) };\n  } catch {\n    return undefined;\n  }\n}\n\n/** Transactions kept per txid, oldest out first, by count and by bytes without witness. */\nclass TxCache {\n  readonly #txs = new Map<string, PreviousTx>();\n  #bytes = 0;\n\n  constructor(\n    private readonly bounds: { readonly entries: number; readonly bytes: number },\n  ) {}\n\n  has(txid: string): boolean {\n    return this.#txs.has(txid);\n  }\n\n  /** The transaction, now the most recently used, or `undefined`. */\n  get(txid: string): PreviousTx | undefined {\n    const tx = this.#txs.get(txid);\n    if (tx) {\n      this.#txs.delete(txid);\n      this.#txs.set(txid, tx);\n    }\n    return tx;\n  }\n\n  set(tx: PreviousTx): void {\n    if (tx.bytes.length > this.bounds.bytes) return;\n    const old = this.#txs.get(tx.txid);\n    if (old) {\n      this.#txs.delete(tx.txid);\n      this.#bytes -= old.bytes.length;\n    }\n    this.#txs.set(tx.txid, tx);\n    this.#bytes += tx.bytes.length;\n    // The oldest go first (a Map iterates in insertion order).\n    for (const [id, entry] of this.#txs) {\n      if (this.#txs.size <= this.bounds.entries && this.#bytes <= this.bounds.bytes)\n        break;\n      this.#txs.delete(id);\n      this.#bytes -= entry.bytes.length;\n    }\n  }\n}\n\n/** One Esplora endpoint family (the `rpc` transport) and its address index (`indexer`). */\nexport class EsploraClient {\n  readonly #previous: TxCache;\n  readonly #own: TxCache;\n\n  constructor(\n    private readonly chain: Transport,\n    private readonly indexer: Transport,\n    private readonly cache: {\n      readonly entries: number;\n      readonly bytes: number;\n    } = PREVIOUS_TX_CACHE,\n  ) {\n    this.#previous = new TxCache(cache);\n    this.#own = new TxCache(cache);\n  }\n\n  #get<T>(\n    transport: Transport,\n    path: string,\n    route: string,\n    tags: UtxoCallTags,\n    responseType: 'json' | 'text' = 'json',\n    exactIntegers = false,\n  ): Promise<T> {\n    const request: HttpRequest = { method: 'GET', path, route, responseType };\n    return transport.http<T>(request, exactIntegers ? { ...tags, exactIntegers } : tags);\n  }\n\n  async #orNull<T>(work: () => Promise<T>): Promise<T | null> {\n    try {\n      return await work();\n    } catch (error) {\n      if (isNotFound(error)) return null;\n      throw error;\n    }\n  }\n\n  async tipHeight(tags: UtxoCallTags): Promise<bigint> {\n    return parseHeight(\n      await this.#get(\n        this.chain,\n        '/blocks/tip/height',\n        '/blocks/tip/height',\n        tags,\n        'text',\n      ),\n    );\n  }\n\n  /** The hash of the block at `height` on this endpoint's best chain, or `null` above its tip. */\n  blockHashAt(height: bigint, tags: UtxoCallTags): Promise<string | null> {\n    return this.#orNull(async () =>\n      parseHash(\n        await this.#get(\n          this.chain,\n          `/block-height/${height}`,\n          '/block-height/:height',\n          tags,\n          'text',\n        ),\n      ),\n    );\n  }\n\n  block(blockHash: string, tags: UtxoCallTags): Promise<EsploraBlock | null> {\n    return this.#orNull(async () => {\n      const block = parseBlock(\n        await this.#get(\n          this.chain,\n          `/block/${segment(blockHash, 'id')}`,\n          '/block/:hash',\n          tags,\n        ),\n      );\n      // The answer must be the block asked for.\n      if (block.hash !== blockHash) throw malformed('block.id');\n      return block;\n    });\n  }\n\n  async blockTxids(blockHash: string, tags: UtxoCallTags): Promise<string[]> {\n    const ids = await this.#get(\n      this.chain,\n      `/block/${segment(blockHash, 'id')}/txids`,\n      '/block/:hash/txids',\n      tags,\n    );\n    return list(ids, 'txids', (id) => hash(id, 'txid'));\n  }\n\n  /** Up to 25 transactions of a block from `start` (a multiple of 25). */\n  async blockTxs(\n    blockHash: string,\n    start: number,\n    tags: UtxoCallTags,\n  ): Promise<EsploraTx[]> {\n    const txs = await this.#get(\n      this.chain,\n      `/block/${segment(blockHash, 'id')}/txs/${start}`,\n      '/block/:hash/txs/:start',\n      tags,\n    );\n    return list(txs, 'block txs', parseTx);\n  }\n\n  tx(txid: string, tags: UtxoCallTags): Promise<EsploraTx | null> {\n    return this.#orNull(async () => {\n      const tx = parseTx(\n        await this.#get(this.chain, `/tx/${segment(txid, 'id')}`, '/tx/:txid', tags),\n      );\n      // The answer must be the transaction asked for.\n      if (tx.txid !== txid) throw malformed('tx.txid');\n      return tx;\n    });\n  }\n\n  /**\n   * `/tx/:txid/hex`, decoded strictly once and bound to `txid`: bytes that do not decode are\n   * malformed, and the bytes of another transaction are a retryable `PROVIDER_INCONSISTENT`,\n   * so a garbled answer is never taken for the caller's error. The decoder's cap is the\n   * largest transaction a block can hold, never what this library builds. Under\n   * a quorum, each endpoint's answer is keyed on the txid its bytes hash to, and the answer\n   * the quorum returns is not decoded again.\n   */\n  async #rawTx<T extends { readonly txid: string }>(\n    txid: string,\n    tags: UtxoCallTags,\n    decode: (hex: string) => T | undefined,\n  ): Promise<{ readonly hex: string; readonly tx: T }> {\n    const decoded = new Map<string, T | undefined>();\n    const read = (answer: unknown): { hex: string; tx: T | undefined } => {\n      const hex = typeof answer === 'string' ? answer.trim() : '';\n      if (!decoded.has(hex)) {\n        decoded.set(hex, hex.length > 0 && isHex(hex) ? decode(hex) : undefined);\n      }\n      return { hex, tx: decoded.get(hex) };\n    };\n    const keyed: UtxoCallTags =\n      tags.quorum === undefined\n        ? tags\n        : {\n            ...tags,\n            // A throwing key counts as a disagreement.\n            quorumKey: (answer) => {\n              const { tx } = read(answer);\n              if (!tx) throw malformed('tx hex');\n              return tx.txid;\n            },\n          };\n    const answer = await this.#get(\n      this.chain,\n      `/tx/${segment(txid, 'id')}/hex`,\n      '/tx/:txid/hex',\n      keyed,\n      'text',\n    );\n    const { hex, tx } = read(answer);\n    if (!tx) throw malformed('tx hex');\n    if (tx.txid !== txid) {\n      throw new ProviderError(\n        'PROVIDER_INCONSISTENT',\n        'the transaction bytes do not hash to the id asked for',\n        { retryable: true },\n      );\n    }\n    return { hex, tx };\n  }\n\n  /** The raw transaction, as hex, bound to `txid` (see `#rawTx`). */\n  txHex(txid: string, tags: UtxoCallTags): Promise<string | null> {\n    return this.#orNull(async () => (await this.#rawTx(txid, tags, txidOf)).hex);\n  }\n\n  /**\n   * An input's previous transaction, decoded once and bound to `txid` (see\n   * `#rawTx`). Its bytes authenticate themselves, so it is kept per txid, whatever endpoint\n   * served it, in a bounded cache: a replacement's inputs are read once per client.\n   */\n  async previousTx(txid: string, tags: UtxoCallTags): Promise<PreviousTx | null> {\n    const known = this.#own.get(txid) ?? this.#previous.get(txid);\n    if (known) return known;\n    const found = await this.#orNull(\n      async () => (await this.#rawTx(txid, tags, previousTxOf)).tx,\n    );\n    if (found) this.#previous.set(found);\n    return found;\n  }\n\n  /**\n   * A transaction this client sent for an Attempt and a node took. Its bytes are\n   * known here, so its outputs are not an indexer's word even before a block holds it, and\n   * under `minInputConfirmations: 0` they may be spent unconfirmed. Kept like the cache.\n   */\n  rememberOwn(tx: PreviousTx): void {\n    this.#own.set(tx);\n  }\n\n  isOwn(txid: string): boolean {\n    return this.#own.has(txid);\n  }\n\n  async outspend(\n    txid: string,\n    vout: number,\n    tags: UtxoCallTags,\n  ): Promise<EsploraOutspend> {\n    return parseOutspend(\n      await this.#get(\n        this.chain,\n        `/tx/${segment(txid, 'id')}/outspend/${vout}`,\n        '/tx/:txid/outspend/:vout',\n        tags,\n      ),\n    );\n  }\n\n  async feeEstimates(tags: UtxoCallTags): Promise<ReadonlyMap<number, number>> {\n    return parseFeeEstimates(\n      await this.#get(this.chain, '/fee-estimates', '/fee-estimates', tags),\n    );\n  }\n\n  /** `POST /tx`: the node's txid on success; a node refusal is the transport's `RPC_ERROR`. */\n  async broadcast(hex: string, tags: UtxoCallTags): Promise<string> {\n    const answer = await this.chain.http<string>(\n      { method: 'POST', path: '/tx', route: '/tx', body: hex, responseType: 'text' },\n      tags,\n    );\n    if (typeof answer !== 'string' || !HEX64.test(answer.trim())) {\n      // The node answered 2xx, so the bytes may have been accepted.\n      throw new ProviderError(\n        'PROVIDER_UNAVAILABLE',\n        'malformed Esplora answer: broadcast txid',\n        {\n          ambiguous: true,\n        },\n      );\n    }\n    return answer.trim();\n  }\n\n  async addressUtxos(address: string, tags: UtxoCallTags): Promise<EsploraUtxo[]> {\n    const utxos = await this.#get(\n      this.indexer,\n      `/address/${segment(address, 'address')}/utxo`,\n      '/address/:address/utxo',\n      tags,\n    );\n    return list(utxos, 'utxo list', parseUtxo);\n  }\n\n  async addressStats(address: string, tags: UtxoCallTags): Promise<EsploraAddressStats> {\n    const info = record(\n      await this.#get(\n        this.indexer,\n        `/address/${segment(address, 'address')}`,\n        '/address/:address',\n        tags,\n        'json',\n        true,\n      ),\n      'address',\n    );\n    const chain = record(info.chain_stats, 'chain_stats');\n    const funded = total(chain.funded_txo_sum, 'funded_txo_sum');\n    const spent = total(chain.spent_txo_sum, 'spent_txo_sum');\n    // The totals are unbounded; the balance is the chain's: 0 to 21 million bitcoin.\n    if (spent > funded || funded - spent > MAX_MONEY) throw malformed('address balance');\n    return { funded, spent };\n  }\n\n  /** Confirmed history, newest first, 25 per page, after `lastSeen` when given. */\n  async addressTxs(\n    address: string,\n    lastSeen: string | undefined,\n    tags: UtxoCallTags,\n  ): Promise<EsploraTx[]> {\n    const base = `/address/${segment(address, 'address')}/txs/chain`;\n    const path = lastSeen ? `${base}/${segment(lastSeen, 'id')}` : base;\n    const route = lastSeen\n      ? '/address/:address/txs/chain/:last_seen_txid'\n      : '/address/:address/txs/chain';\n    return list(await this.#get(this.indexer, path, route, tags), 'address txs', parseTx);\n  }\n}\n"]}

package/dist/adapters/utxo/fees.d.ts

@@ -0,0 +1,41 @@
+import type { FeeOverride, FeeSpeed } from '../../core/model/fee';
+import type { UtxoNetworkConfig } from './network';
+/** Confirmation targets (blocks) per speed: library policy, not a network fact. */
+export declare const SPEED_TARGETS: Readonly<Record<FeeSpeed, number>>;
+type FeePolicy = Pick<UtxoNetworkConfig, 'minRelayFee' | 'feeFallback' | 'maxFeeRate' | 'maxFee' | 'maxEstimatedFeeRate'>;
+/** Esplora's sat/vB float as sat/kvB, rounded up after removing float noise. */
+export declare function satPerKvB(satPerVByte: number): bigint;
+/**
+ * The rate for a speed: the estimate at its target, else at the nearest faster target the
+ * endpoint has; never below the minimum relay fee. With no usable estimate, a test
+ * network's `feeFallback`, else a retryable `PROVIDER_UNAVAILABLE` (nothing is guessed).
+ * The relay floor clamps the fallback too: it is registry data, never checked against
+ * `minRelayFee`.
+ */
+export declare function rateForSpeed(estimates: ReadonlyMap<number, number>, speed: FeeSpeed, policy: FeePolicy): bigint;
+/** `{ satPerVByte }` as sat/kvB. `INVALID_INTENT` when malformed, `FEE_TOO_LOW` below relay. */
+export declare function rateFromOverride(override: FeeOverride, policy: FeePolicy): bigint;
+/** Bitcoin Core's `CFeeRate::GetFee`: `rate × vsize / 1000`, rounded up. */
+export declare function feeAt(rate: bigint, vsize: number): bigint;
+/**
+ * The absurd-fee guard (a burn of funds by a fee bug or a fat-fingered override): refuses
+ * a fee above `maxFee` or a rate above `maxFeeRate` before anything is signed.
+ */
+export declare function assertSaneFee(fee: bigint, vsize: number, policy: FeePolicy): void;
+export interface PaidFee {
+    readonly fee: bigint;
+    /** Estimated with worst-case signatures (an upper bound of the real size). */
+    readonly vsize: number;
+    /**
+     * A lower bound of the real size: a signature can be shorter than the worst case the
+     * estimate assumes. Default `vsize`.
+     */
+    readonly minVsize?: number;
+}
+/**
+ * The least fee a replacement of `vsize` may pay over `previous` (rules 3, 4 and 6). It does
+ * not count descendants of the replaced transaction (a recipient's CPFP): a node then refuses
+ * with `FEE_TOO_LOW`, and a higher explicit fee resolves it.
+ */
+export declare function replacementFloor(previous: PaidFee, vsize: number, incrementalRelayFee: bigint): bigint;
+export {};