crypto-aio 0.0.3 → 0.1.0

package/dist/adapters/avalanche/proofs.js

@@ -0,0 +1,270 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PEER_SKEW = void 0;
+exports.parseInput = parseInput;
+exports.attestedReads = attestedReads;
+exports.proofSource = proofSource;
+exports.blockSource = blockSource;
+const address_1 = require("./address");
+const api_1 = require("./api");
+const cb58_1 = require("./cb58");
+const codec_1 = require("./codec");
+const context_1 = require("./context");
+const decode_1 = require("./decode");
+const reader_1 = require("./reader");
+/** Blocks `finalizedHead` trails one endpoint's head by, so peers can attest it. */
+exports.PEER_SKEW = 1n;
+/** Transactions of one block read at once. */
+const TX_READS = 4;
+const MAX_HEIGHT = BigInt(Number.MAX_SAFE_INTEGER);
+const outOfRange = (height) => height < 0n || height > MAX_HEIGHT;
+/** A block as the proof quorum compares it: the consensus facts the verdicts use. */
+const blockKey = (answer) => {
+    const b = (0, api_1.parseBlock)(answer);
+    return `${b.height}:${b.id}:${b.parentId}:${b.txIds.join(',')}`;
+};
+/** Splits an `inputs` ordering entry (`txID:outputIndex`); malformed data decides nothing. */
+function parseInput(input) {
+    const match = /^([1-9A-HJ-NP-Za-km-z]{32,50}):(0|[1-9][0-9]{0,9})$/.exec(input);
+    if (!match || !(0, cb58_1.isId)(match[1]) || Number(match[2]) > 0xffffffff) {
+        throw (0, context_1.undecided)('malformed input in the ordering');
+    }
+    return { txId: match[1], outputIndex: Number(match[2]) };
+}
+/** The `utxoId`s (`txID:outputIndex`) in a page of `getUTXOs`. */
+function keysOfPage(answer) {
+    const utxos = answer?.utxos;
+    if (!Array.isArray(utxos))
+        return [];
+    return utxos.map((text) => (0, codec_1.utxoKeyOf)((0, api_1.decodeChecked)(text, 'utxo')));
+}
+/**
+ * The reads a proof attests under the proof quorum, each fact at its own height, which no
+ * endpoint proposes.
+ */
+function attestedReads(ctx) {
+    const { node, config } = ctx;
+    const depth = BigInt(config.confirmations) - 1n;
+    /** "I hold a block at `height`" (monotone in the head, so endpoints further ahead agree). */
+    const holds = async (height) => (await node.height({
+        ...context_1.PROOF,
+        quorumKey: (answer) => (0, api_1.parseHeight)(answer?.height) >= height,
+    })) >= height;
+    /** The block at `height` on the proof endpoints' chain. */
+    const blockAt = (height) => node.blockAt(height, { ...context_1.PROOF, quorumKey: blockKey });
+    /** Whether the block at `height` is final (N − 1 blocks above it on every proof endpoint). */
+    const final = (height) => holds(height + depth);
+    return { holds, blockAt, final };
+}
+function proofSource(ctx) {
+    const { node, config } = ctx;
+    const depth = BigInt(config.confirmations) - 1n;
+    const { holds, blockAt, final } = attestedReads(ctx);
+    /** Accepted, aborted (P-Chain) or not, as the proof endpoints agree. */
+    const acceptance = async (txId) => {
+        if (config.vm === 'avm') {
+            const tags = {
+                ...context_1.PROOF,
+                quorumKey: (answer) => answer?.tx,
+            };
+            return (await node.txBytes(txId, tags)) === null ? 'not' : 'accepted';
+        }
+        const status = await node.txStatus(txId, {
+            ...context_1.PROOF,
+            quorumKey: (answer) => {
+                const s = (0, api_1.parsePlatformStatus)(answer);
+                return s === 'Committed' || s === 'Aborted' ? s : 'not';
+            },
+        });
+        return status === 'Committed' ? 'accepted' : status === 'Aborted' ? 'aborted' : 'not';
+    };
+    /** Which of `inputs` the proof endpoints (or, at `latest`, one) still list for `from`. */
+    const unspentOf = async (from, inputs, level) => {
+        const wanted = new Set(inputs);
+        const tags = level === 'latest'
+            ? context_1.MONITOR
+            : {
+                ...context_1.PROOF,
+                quorumKey: (answer) => keysOfPage(answer)
+                    .filter((key) => wanted.has(key))
+                    .sort()
+                    .join(','),
+            };
+        const listed = await node.utxos((0, address_1.normalizeAddress)(from, config).canonical, tags);
+        const present = new Set();
+        for (const bytes of listed) {
+            const key = (0, codec_1.utxoKeyOf)(bytes);
+            if (wanted.has(key))
+                present.add(key);
+        }
+        return present;
+    };
+    const inputsOf = (ordering) => ordering.kind === 'inputs'
+        ? ordering.inputs.map((input) => {
+            const { txId, outputIndex } = parseInput(input);
+            return (0, codec_1.utxoKey)(txId, outputIndex);
+        })
+        : [];
+    const source = {
+        async finalizedHead() {
+            const anchor = (await node.height(context_1.MONITOR)) - exports.PEER_SKEW;
+            if (anchor < 0n || !(await holds(anchor))) {
+                throw (0, context_1.undecided)('the proof endpoints have not reached the head');
+            }
+            const height = anchor - depth < 0n ? 0n : anchor - depth;
+            const block = await blockAt(height);
+            if (!block)
+                throw (0, context_1.undecided)('the final block is not visible to the proof endpoints');
+            return {
+                height,
+                hash: block.id,
+                ...(block.timestamp !== undefined ? { timestamp: block.timestamp } : {}),
+            };
+        },
+        async includedFinal(ref, ordering, from) {
+            if (!(0, cb58_1.isId)(ref.id))
+                throw (0, context_1.undecided)('malformed transaction id');
+            const status = await acceptance(ref.id);
+            if (status !== 'not') {
+                const location = await (0, context_1.locate)(ctx, ref.id, context_1.MONITOR);
+                if (!location || location === 'no-block') {
+                    throw (0, context_1.undecided)('the block of the transaction is not located yet');
+                }
+                const block = await blockAt(location.height);
+                if (!block || block.id !== location.hash || !block.txIds.includes(ref.id)) {
+                    ctx.located.forget(ref.id);
+                    throw (0, context_1.contradiction)('the located block of the transaction is not on the chain');
+                }
+                if (!(await final(location.height))) {
+                    throw (0, context_1.undecided)('the transaction is not final yet');
+                }
+                return {
+                    included: true,
+                    success: status === 'accepted',
+                    blockHeight: location.height,
+                    blockHash: location.hash,
+                    txHash: ref.id,
+                    ...(status === 'aborted' ? { reason: 'the transaction was aborted' } : {}),
+                };
+            }
+            // Not accepted: only a spent input proves it never will be.
+            const inputs = inputsOf(ordering);
+            if (inputs.length === 0)
+                throw (0, context_1.undecided)('the transaction is not accepted yet');
+            const unspent = await unspentOf(from, inputs, 'finalized');
+            if (inputs.every((input) => unspent.has(input))) {
+                throw (0, context_1.undecided)('the transaction is not accepted yet');
+            }
+            // Read after the spend: had ours spent the input, it would be accepted by now.
+            if ((await acceptance(ref.id)) !== 'not') {
+                throw (0, context_1.undecided)('the transaction was accepted meanwhile');
+            }
+            return { included: false };
+        },
+        async slotConsumed(ordering, from, level) {
+            const inputs = inputsOf(ordering);
+            if (inputs.length === 0)
+                return false;
+            const unspent = await unspentOf(from, inputs, level);
+            return inputs.some((input) => !unspent.has(input));
+        },
+        expired: async () => false,
+        async blockHash(height, level) {
+            if (outOfRange(height))
+                return null;
+            if (level === 'finalized' && !(await final(height)))
+                return null;
+            return (await blockAt(height))?.id ?? null;
+        },
+    };
+    // Every read of every proof decides nothing on "not available here": only a definitive
+    // negative may answer "no" (`proofRead`).
+    return {
+        finalizedHead: () => (0, context_1.proofRead)(() => source.finalizedHead()),
+        includedFinal: (ref, ordering, from) => (0, context_1.proofRead)(() => source.includedFinal(ref, ordering, from)),
+        slotConsumed: (ordering, from, level) => (0, context_1.proofRead)(() => source.slotConsumed(ordering, from, level)),
+        expired: (ordering) => source.expired(ordering),
+        blockHash: (height, level) => (0, context_1.proofRead)(() => source.blockHash(height, level)),
+    };
+}
+/**
+ * Runs `work` on each item, at most `limit` at a time. After a failure the other runners
+ * stop at their next step, and the first failure is thrown.
+ */
+async function forEachBounded(items, limit, work) {
+    let next = 0;
+    let failed = false;
+    const runner = async () => {
+        while (!failed && next < items.length) {
+            const index = next++;
+            try {
+                await work(items[index], index);
+            }
+            catch (error) {
+                failed = true;
+                throw error;
+            }
+        }
+    };
+    await Promise.all(Array.from({ length: Math.min(limit, items.length) }, runner));
+}
+function blockSource(ctx) {
+    const { node, config } = ctx;
+    return {
+        async header(height) {
+            if (outOfRange(height))
+                return null;
+            const block = await node.blockAt(height, context_1.MONITOR);
+            return block ? (0, reader_1.toDriverBlock)(block) : null;
+        },
+        async transactions(block, filter) {
+            const inconsistent = () => (0, context_1.contradiction)(`block ${block.height} changed while scanning`);
+            const current = await node.blockAt(block.height, context_1.MONITOR);
+            if (!current || current.id !== block.hash)
+                throw inconsistent();
+            // `filter.assets` is a hint: a list without the native asset wants tokens only.
+            if (filter?.assets?.length && !filter.assets.includes('native'))
+                return [];
+            const txs = new Array(current.txIds.length);
+            await forEachBounded(current.txIds, TX_READS, async (txId, index) => {
+                const bytes = await node.txBytes(txId, context_1.MONITOR);
+                // An accepted block's transaction is accepted: a node without it is behind.
+                if (!bytes)
+                    throw inconsistent();
+                let success = true;
+                if (config.vm === 'pvm') {
+                    const status = await node.txStatus(txId, context_1.MONITOR);
+                    if (status !== 'Committed' && status !== 'Aborted')
+                        throw inconsistent();
+                    success = status === 'Committed';
+                }
+                txs[index] = (0, decode_1.decodeTransaction)(bytes, config, {
+                    seen: 'block',
+                    txHash: txId,
+                    blockHeight: current.height,
+                    blockHash: current.id,
+                    success,
+                    ...(success ? {} : { reason: 'the transaction was aborted' }),
+                });
+            });
+            // Checked after the reads, so a node that switched blocks meanwhile is caught.
+            if ((await node.blockAt(block.height, context_1.MONITOR))?.id !== block.hash) {
+                throw inconsistent();
+            }
+            const watched = new Set();
+            for (const address of filter?.addresses ?? []) {
+                try {
+                    watched.add((0, address_1.normalizeAddress)(address, config).canonical);
+                }
+                catch {
+                    // Not an address of this chain: it matches nothing.
+                }
+            }
+            if ((filter?.addresses?.length ?? 0) === 0)
+                return txs;
+            return txs.filter((tx) => tx.transfers.some((t) => watched.has(t.to)) ||
+                (tx.details.signers ?? []).some((s) => watched.has(s)));
+        },
+    };
+}
+//# sourceMappingURL=proofs.js.map

package/dist/adapters/avalanche/proofs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proofs.js","sourceRoot":"","sources":["../../../src/adapters/avalanche/proofs.ts"],"names":[],"mappings":";;;AAkEA,gCAMC;AAaD,sCAgBC;AAED,kCA8IC;AA2BD,kCA0DC;AA7SD,uCAA6C;AAC7C,+BAMe;AACf,iCAA8B;AAC9B,mCAA6C;AAC7C,uCAQmB;AACnB,qCAA6C;AAC7C,qCAAyC;AAGzC,oFAAoF;AACvE,QAAA,SAAS,GAAG,EAAE,CAAC;AAC5B,8CAA8C;AAC9C,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,UAAU,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,MAAM,GAAG,EAAE,IAAI,MAAM,GAAG,UAAU,CAAC;AAEnF,qFAAqF;AACrF,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAU,EAAE;IAC3C,MAAM,CAAC,GAAG,IAAA,gBAAU,EAAC,MAAM,CAAC,CAAC;IAC7B,OAAO,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AAClE,CAAC,CAAC;AAEF,8FAA8F;AAC9F,SAAgB,UAAU,CAAC,KAAa;IACtC,MAAM,KAAK,GAAG,qDAAqD,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChF,IAAI,CAAC,KAAK,IAAI,CAAC,IAAA,WAAI,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,EAAE,CAAC;QAC/D,MAAM,IAAA,mBAAS,EAAC,iCAAiC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACrE,CAAC;AAED,kEAAkE;AAClE,SAAS,UAAU,CAAC,MAAe;IACjC,MAAM,KAAK,GAAI,MAAqC,EAAE,KAAK,CAAC;IAC5D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,iBAAS,EAAC,IAAA,mBAAa,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,GAAqB;IACjD,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;IAChD,6FAA6F;IAC7F,MAAM,KAAK,GAAG,KAAK,EAAE,MAAc,EAAoB,EAAE,CACvD,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC;QACjB,GAAG,eAAK;QACR,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CACpB,IAAA,iBAAW,EAAE,MAAsC,EAAE,MAAM,CAAC,IAAI,MAAM;KACzE,CAAC,CAAC,IAAI,MAAM,CAAC;IAChB,2DAA2D;IAC3D,MAAM,OAAO,GAAG,CAAC,MAAc,EAA6B,EAAE,CAC5D,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,GAAG,eAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC1D,8FAA8F;IAC9F,MAAM,KAAK,GAAG,CAAC,MAAc,EAAoB,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC1E,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACnC,CAAC;AAED,SAAgB,WAAW,CAAC,GAAqB;IAC/C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;IAChD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAErD,wEAAwE;IACxE,MAAM,UAAU,GAAG,KAAK,EAAE,IAAY,EAA2C,EAAE;QACjF,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;YACxB,MAAM,IAAI,GAAsB;gBAC9B,GAAG,eAAK;gBACR,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAE,MAAkC,EAAE,EAAE;aAC/D,CAAC;YACF,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC;QACxE,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;YACvC,GAAG,eAAK;YACR,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE;gBACpB,MAAM,CAAC,GAAG,IAAA,yBAAmB,EAAC,MAAM,CAAC,CAAC;gBACtC,OAAO,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC1D,CAAC;SACF,CAAC,CAAC;QACH,OAAO,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;IACxF,CAAC,CAAC;IAEF,0FAA0F;IAC1F,MAAM,SAAS,GAAG,KAAK,EACrB,IAAY,EACZ,MAAyB,EACzB,KAAoB,EACE,EAAE;QACxB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,IAAI,GACR,KAAK,KAAK,QAAQ;YAChB,CAAC,CAAC,iBAAO;YACT,CAAC,CAAC;gBACE,GAAG,eAAK;gBACR,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CACpB,UAAU,CAAC,MAAM,CAAC;qBACf,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;qBAChC,IAAI,EAAE;qBACN,IAAI,CAAC,GAAG,CAAC;aACf,CAAC;QACR,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAA,0BAAgB,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAA,iBAAS,EAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,CAAC,QAAsB,EAAY,EAAE,CACpD,QAAQ,CAAC,IAAI,KAAK,QAAQ;QACxB,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC5B,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YAChD,OAAO,IAAA,eAAO,EAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QACpC,CAAC,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;IAET,MAAM,MAAM,GAAgB;QAC1B,KAAK,CAAC,aAAa;YACjB,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAO,CAAC,CAAC,GAAG,iBAAS,CAAC;YACxD,IAAI,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAA,mBAAS,EAAC,+CAA+C,CAAC,CAAC;YACnE,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;YACzD,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK;gBACR,MAAM,IAAA,mBAAS,EAAC,uDAAuD,CAAC,CAAC;YAC3E,OAAO;gBACL,MAAM;gBACN,IAAI,EAAE,KAAK,CAAC,EAAE;gBACd,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACzE,CAAC;QACJ,CAAC;QAED,KAAK,CAAC,aAAa,CAAC,GAAe,EAAE,QAAsB,EAAE,IAAY;YACvE,IAAI,CAAC,IAAA,WAAI,EAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAA,mBAAS,EAAC,0BAA0B,CAAC,CAAC;YAC/D,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,MAAM,QAAQ,GAAG,MAAM,IAAA,gBAAM,EAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,iBAAO,CAAC,CAAC;gBACpD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;oBACzC,MAAM,IAAA,mBAAS,EAAC,iDAAiD,CAAC,CAAC;gBACrE,CAAC;gBACD,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAC7C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,EAAE,KAAK,QAAQ,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1E,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC3B,MAAM,IAAA,uBAAa,EAAC,0DAA0D,CAAC,CAAC;gBAClF,CAAC;gBACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBACpC,MAAM,IAAA,mBAAS,EAAC,kCAAkC,CAAC,CAAC;gBACtD,CAAC;gBACD,OAAO;oBACL,QAAQ,EAAE,IAAI;oBACd,OAAO,EAAE,MAAM,KAAK,UAAU;oBAC9B,WAAW,EAAE,QAAQ,CAAC,MAAM;oBAC5B,SAAS,EAAE,QAAQ,CAAC,IAAI;oBACxB,MAAM,EAAE,GAAG,CAAC,EAAE;oBACd,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC3E,CAAC;YACJ,CAAC;YACD,4DAA4D;YAC5D,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAA,mBAAS,EAAC,qCAAqC,CAAC,CAAC;YAChF,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YAC3D,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAChD,MAAM,IAAA,mBAAS,EAAC,qCAAqC,CAAC,CAAC;YACzD,CAAC;YACD,+EAA+E;YAC/E,IAAI,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACzC,MAAM,IAAA,mBAAS,EAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC7B,CAAC;QAED,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK;YACtC,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtC,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACrD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC,KAAK;QAE1B,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK;YAC3B,IAAI,UAAU,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,IAAI,KAAK,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YACjE,OAAO,CAAC,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;QAC7C,CAAC;KACF,CAAC;IAEF,uFAAuF;IACvF,0CAA0C;IAC1C,OAAO;QACL,aAAa,EAAE,GAAG,EAAE,CAAC,IAAA,mBAAS,EAAC,GAAG,EAAE,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;QAC5D,aAAa,EAAE,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CACrC,IAAA,mBAAS,EAAC,GAAG,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC5D,YAAY,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CACtC,IAAA,mBAAS,EAAC,GAAG,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7D,OAAO,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC/C,SAAS,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,IAAA,mBAAS,EAAC,GAAG,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KAC/E,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAmB,EACnB,KAAa,EACb,IAA+C;IAE/C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,MAAM,MAAM,GAAG,KAAK,IAAmB,EAAE;QACvC,OAAO,CAAC,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAM,EAAE,KAAK,CAAC,CAAC;YACvC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;AACnF,CAAC;AAED,SAAgB,WAAW,CAAC,GAAqB;IAC/C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IAC7B,OAAO;QACL,KAAK,CAAC,MAAM,CAAC,MAAM;YACjB,IAAI,UAAU,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,iBAAO,CAAC,CAAC;YAClD,OAAO,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAa,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,CAAC;QAED,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM;YAC9B,MAAM,YAAY,GAAG,GAAG,EAAE,CACxB,IAAA,uBAAa,EAAC,SAAS,KAAK,CAAC,MAAM,yBAAyB,CAAC,CAAC;YAChE,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,iBAAO,CAAC,CAAC;YAC1D,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI;gBAAE,MAAM,YAAY,EAAE,CAAC;YAChE,gFAAgF;YAChF,IAAI,MAAM,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAAE,OAAO,EAAE,CAAC;YAC3E,MAAM,GAAG,GAAwB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACjE,MAAM,cAAc,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;gBAClE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,iBAAO,CAAC,CAAC;gBAChD,4EAA4E;gBAC5E,IAAI,CAAC,KAAK;oBAAE,MAAM,YAAY,EAAE,CAAC;gBACjC,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,iBAAO,CAAC,CAAC;oBAClD,IAAI,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,SAAS;wBAAE,MAAM,YAAY,EAAE,CAAC;oBACzE,OAAO,GAAG,MAAM,KAAK,WAAW,CAAC;gBACnC,CAAC;gBACD,GAAG,CAAC,KAAK,CAAC,GAAG,IAAA,0BAAiB,EAAC,KAAK,EAAE,MAAM,EAAE;oBAC5C,IAAI,EAAE,OAAO;oBACb,MAAM,EAAE,IAAI;oBACZ,WAAW,EAAE,OAAO,CAAC,MAAM;oBAC3B,SAAS,EAAE,OAAO,CAAC,EAAE;oBACrB,OAAO;oBACP,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC;iBAC9D,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YACH,+EAA+E;YAC/E,IAAI,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,iBAAO,CAAC,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBACnE,MAAM,YAAY,EAAE,CAAC;YACvB,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;gBAC9C,IAAI,CAAC;oBACH,OAAO,CAAC,GAAG,CAAC,IAAA,0BAAgB,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC;gBAC3D,CAAC;gBAAC,MAAM,CAAC;oBACP,oDAAoD;gBACtD,CAAC;YACH,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YACvD,OAAO,GAAG,CAAC,MAAM,CACf,CAAC,EAAE,EAAE,EAAE,CACL,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3C,CAAE,EAAE,CAAC,OAAO,CAAC,OAAyC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACvE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CACf,CACJ,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Proofs (the finalized-state checks behind `proven` verdicts) and the block source.\n *\n * Snowman never reverts an accepted block, so with the default policy (1 confirmation) an\n * accepted transaction is final. Every fact is read under the proof quorum (one\n * endpoint's word never decides), each at its own height with a monotone key, and no\n * endpoint proposes the height: \"block h is final\" is \"every proof endpoint holds a block\n * at h + N − 1\".\n *\n * - `includedFinal` answers \"included\" only when the proof endpoints agree the transaction\n *   is accepted and the block at its located height is the located block and holds it. It\n *   answers \"not included\" only when one of its inputs is gone from the sender's outputs on\n *   every proof endpoint and, read after that, the transaction is still not accepted: then\n *   another transaction spent the input, and ours can never be accepted. Every other case\n *   decides nothing (a retryable `ProviderError`).\n * - `slotConsumed` reads the sender's outputs: an input missing from them is spent.\n * - The block source reads blocks by height; their transactions are read by id from the\n *   node, as bytes that hash to that id. A P-Chain proposal transaction counts as failed\n *   when its proposal was aborted.\n */\nimport type {\n  BlockSource,\n  DriverBlock,\n  DriverTransaction,\n  FinalityLevel,\n  ProofSource,\n} from '../../core/driver/types';\nimport type { OrderingData } from '../../core/model/ordering';\nimport type { AttemptRef } from '../../core/model/transaction';\nimport { normalizeAddress } from './address';\nimport {\n  decodeChecked,\n  parseBlock,\n  parseHeight,\n  parsePlatformStatus,\n  type NodeBlock,\n} from './api';\nimport { isId } from './cb58';\nimport { utxoKey, utxoKeyOf } from './codec';\nimport {\n  MONITOR,\n  PROOF,\n  contradiction,\n  locate,\n  proofRead,\n  undecided,\n  type AvalancheContext,\n} from './context';\nimport { decodeTransaction } from './decode';\nimport { toDriverBlock } from './reader';\nimport type { AvalancheCallTags } from './types';\n\n/** Blocks `finalizedHead` trails one endpoint's head by, so peers can attest it. */\nexport const PEER_SKEW = 1n;\n/** Transactions of one block read at once. */\nconst TX_READS = 4;\nconst MAX_HEIGHT = BigInt(Number.MAX_SAFE_INTEGER);\nconst outOfRange = (height: bigint): boolean => height < 0n || height > MAX_HEIGHT;\n\n/** A block as the proof quorum compares it: the consensus facts the verdicts use. */\nconst blockKey = (answer: unknown): string => {\n  const b = parseBlock(answer);\n  return `${b.height}:${b.id}:${b.parentId}:${b.txIds.join(',')}`;\n};\n\n/** Splits an `inputs` ordering entry (`txID:outputIndex`); malformed data decides nothing. */\nexport function parseInput(input: string): { txId: string; outputIndex: number } {\n  const match = /^([1-9A-HJ-NP-Za-km-z]{32,50}):(0|[1-9][0-9]{0,9})$/.exec(input);\n  if (!match || !isId(match[1]) || Number(match[2]) > 0xffffffff) {\n    throw undecided('malformed input in the ordering');\n  }\n  return { txId: match[1] as string, outputIndex: Number(match[2]) };\n}\n\n/** The `utxoId`s (`txID:outputIndex`) in a page of `getUTXOs`. */\nfunction keysOfPage(answer: unknown): string[] {\n  const utxos = (answer as { utxos?: unknown } | null)?.utxos;\n  if (!Array.isArray(utxos)) return [];\n  return utxos.map((text) => utxoKeyOf(decodeChecked(text, 'utxo')));\n}\n\n/**\n * The reads a proof attests under the proof quorum, each fact at its own height, which no\n * endpoint proposes.\n */\nexport function attestedReads(ctx: AvalancheContext) {\n  const { node, config } = ctx;\n  const depth = BigInt(config.confirmations) - 1n;\n  /** \"I hold a block at `height`\" (monotone in the head, so endpoints further ahead agree). */\n  const holds = async (height: bigint): Promise<boolean> =>\n    (await node.height({\n      ...PROOF,\n      quorumKey: (answer) =>\n        parseHeight((answer as { height?: unknown } | null)?.height) >= height,\n    })) >= height;\n  /** The block at `height` on the proof endpoints' chain. */\n  const blockAt = (height: bigint): Promise<NodeBlock | null> =>\n    node.blockAt(height, { ...PROOF, quorumKey: blockKey });\n  /** Whether the block at `height` is final (N − 1 blocks above it on every proof endpoint). */\n  const final = (height: bigint): Promise<boolean> => holds(height + depth);\n  return { holds, blockAt, final };\n}\n\nexport function proofSource(ctx: AvalancheContext): ProofSource {\n  const { node, config } = ctx;\n  const depth = BigInt(config.confirmations) - 1n;\n  const { holds, blockAt, final } = attestedReads(ctx);\n\n  /** Accepted, aborted (P-Chain) or not, as the proof endpoints agree. */\n  const acceptance = async (txId: string): Promise<'accepted' | 'aborted' | 'not'> => {\n    if (config.vm === 'avm') {\n      const tags: AvalancheCallTags = {\n        ...PROOF,\n        quorumKey: (answer) => (answer as { tx?: unknown } | null)?.tx,\n      };\n      return (await node.txBytes(txId, tags)) === null ? 'not' : 'accepted';\n    }\n    const status = await node.txStatus(txId, {\n      ...PROOF,\n      quorumKey: (answer) => {\n        const s = parsePlatformStatus(answer);\n        return s === 'Committed' || s === 'Aborted' ? s : 'not';\n      },\n    });\n    return status === 'Committed' ? 'accepted' : status === 'Aborted' ? 'aborted' : 'not';\n  };\n\n  /** Which of `inputs` the proof endpoints (or, at `latest`, one) still list for `from`. */\n  const unspentOf = async (\n    from: string,\n    inputs: readonly string[],\n    level: FinalityLevel,\n  ): Promise<Set<string>> => {\n    const wanted = new Set(inputs);\n    const tags: AvalancheCallTags =\n      level === 'latest'\n        ? MONITOR\n        : {\n            ...PROOF,\n            quorumKey: (answer) =>\n              keysOfPage(answer)\n                .filter((key) => wanted.has(key))\n                .sort()\n                .join(','),\n          };\n    const listed = await node.utxos(normalizeAddress(from, config).canonical, tags);\n    const present = new Set<string>();\n    for (const bytes of listed) {\n      const key = utxoKeyOf(bytes);\n      if (wanted.has(key)) present.add(key);\n    }\n    return present;\n  };\n\n  const inputsOf = (ordering: OrderingData): string[] =>\n    ordering.kind === 'inputs'\n      ? ordering.inputs.map((input) => {\n          const { txId, outputIndex } = parseInput(input);\n          return utxoKey(txId, outputIndex);\n        })\n      : [];\n\n  const source: ProofSource = {\n    async finalizedHead() {\n      const anchor = (await node.height(MONITOR)) - PEER_SKEW;\n      if (anchor < 0n || !(await holds(anchor))) {\n        throw undecided('the proof endpoints have not reached the head');\n      }\n      const height = anchor - depth < 0n ? 0n : anchor - depth;\n      const block = await blockAt(height);\n      if (!block)\n        throw undecided('the final block is not visible to the proof endpoints');\n      return {\n        height,\n        hash: block.id,\n        ...(block.timestamp !== undefined ? { timestamp: block.timestamp } : {}),\n      };\n    },\n\n    async includedFinal(ref: AttemptRef, ordering: OrderingData, from: string) {\n      if (!isId(ref.id)) throw undecided('malformed transaction id');\n      const status = await acceptance(ref.id);\n      if (status !== 'not') {\n        const location = await locate(ctx, ref.id, MONITOR);\n        if (!location || location === 'no-block') {\n          throw undecided('the block of the transaction is not located yet');\n        }\n        const block = await blockAt(location.height);\n        if (!block || block.id !== location.hash || !block.txIds.includes(ref.id)) {\n          ctx.located.forget(ref.id);\n          throw contradiction('the located block of the transaction is not on the chain');\n        }\n        if (!(await final(location.height))) {\n          throw undecided('the transaction is not final yet');\n        }\n        return {\n          included: true,\n          success: status === 'accepted',\n          blockHeight: location.height,\n          blockHash: location.hash,\n          txHash: ref.id,\n          ...(status === 'aborted' ? { reason: 'the transaction was aborted' } : {}),\n        };\n      }\n      // Not accepted: only a spent input proves it never will be.\n      const inputs = inputsOf(ordering);\n      if (inputs.length === 0) throw undecided('the transaction is not accepted yet');\n      const unspent = await unspentOf(from, inputs, 'finalized');\n      if (inputs.every((input) => unspent.has(input))) {\n        throw undecided('the transaction is not accepted yet');\n      }\n      // Read after the spend: had ours spent the input, it would be accepted by now.\n      if ((await acceptance(ref.id)) !== 'not') {\n        throw undecided('the transaction was accepted meanwhile');\n      }\n      return { included: false };\n    },\n\n    async slotConsumed(ordering, from, level) {\n      const inputs = inputsOf(ordering);\n      if (inputs.length === 0) return false;\n      const unspent = await unspentOf(from, inputs, level);\n      return inputs.some((input) => !unspent.has(input));\n    },\n\n    expired: async () => false,\n\n    async blockHash(height, level) {\n      if (outOfRange(height)) return null;\n      if (level === 'finalized' && !(await final(height))) return null;\n      return (await blockAt(height))?.id ?? null;\n    },\n  };\n\n  // Every read of every proof decides nothing on \"not available here\": only a definitive\n  // negative may answer \"no\" (`proofRead`).\n  return {\n    finalizedHead: () => proofRead(() => source.finalizedHead()),\n    includedFinal: (ref, ordering, from) =>\n      proofRead(() => source.includedFinal(ref, ordering, from)),\n    slotConsumed: (ordering, from, level) =>\n      proofRead(() => source.slotConsumed(ordering, from, level)),\n    expired: (ordering) => source.expired(ordering),\n    blockHash: (height, level) => proofRead(() => source.blockHash(height, level)),\n  };\n}\n\n/**\n * Runs `work` on each item, at most `limit` at a time. After a failure the other runners\n * stop at their next step, and the first failure is thrown.\n */\nasync function forEachBounded<T>(\n  items: readonly T[],\n  limit: number,\n  work: (item: T, index: number) => Promise<void>,\n): Promise<void> {\n  let next = 0;\n  let failed = false;\n  const runner = async (): Promise<void> => {\n    while (!failed && next < items.length) {\n      const index = next++;\n      try {\n        await work(items[index] as T, index);\n      } catch (error) {\n        failed = true;\n        throw error;\n      }\n    }\n  };\n  await Promise.all(Array.from({ length: Math.min(limit, items.length) }, runner));\n}\n\nexport function blockSource(ctx: AvalancheContext): BlockSource {\n  const { node, config } = ctx;\n  return {\n    async header(height): Promise<DriverBlock | null> {\n      if (outOfRange(height)) return null;\n      const block = await node.blockAt(height, MONITOR);\n      return block ? toDriverBlock(block) : null;\n    },\n\n    async transactions(block, filter) {\n      const inconsistent = () =>\n        contradiction(`block ${block.height} changed while scanning`);\n      const current = await node.blockAt(block.height, MONITOR);\n      if (!current || current.id !== block.hash) throw inconsistent();\n      // `filter.assets` is a hint: a list without the native asset wants tokens only.\n      if (filter?.assets?.length && !filter.assets.includes('native')) return [];\n      const txs: DriverTransaction[] = new Array(current.txIds.length);\n      await forEachBounded(current.txIds, TX_READS, async (txId, index) => {\n        const bytes = await node.txBytes(txId, MONITOR);\n        // An accepted block's transaction is accepted: a node without it is behind.\n        if (!bytes) throw inconsistent();\n        let success = true;\n        if (config.vm === 'pvm') {\n          const status = await node.txStatus(txId, MONITOR);\n          if (status !== 'Committed' && status !== 'Aborted') throw inconsistent();\n          success = status === 'Committed';\n        }\n        txs[index] = decodeTransaction(bytes, config, {\n          seen: 'block',\n          txHash: txId,\n          blockHeight: current.height,\n          blockHash: current.id,\n          success,\n          ...(success ? {} : { reason: 'the transaction was aborted' }),\n        });\n      });\n      // Checked after the reads, so a node that switched blocks meanwhile is caught.\n      if ((await node.blockAt(block.height, MONITOR))?.id !== block.hash) {\n        throw inconsistent();\n      }\n      const watched = new Set<string>();\n      for (const address of filter?.addresses ?? []) {\n        try {\n          watched.add(normalizeAddress(address, config).canonical);\n        } catch {\n          // Not an address of this chain: it matches nothing.\n        }\n      }\n      if ((filter?.addresses?.length ?? 0) === 0) return txs;\n      return txs.filter(\n        (tx) =>\n          tx.transfers.some((t) => watched.has(t.to)) ||\n          ((tx.details.signers as readonly string[] | undefined) ?? []).some((s) =>\n            watched.has(s),\n          ),\n      );\n    },\n  };\n}\n"]}

package/dist/adapters/avalanche/reader.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Avalanche addresses, point reads, observation, address history and
+ * `ext.avalanche.listUnspent`. Every call carries the tags of the `ChainDriver` contract
+ * table: `read` for point queries, `monitor` for heights and observations.
+ *
+ * Observation: the X-Chain has no mempool view (its `getTxStatus` is deprecated and only
+ * reports accepted or unknown), so a transaction is in a block once the node holds it and
+ * unknown before. The P-Chain also reports its mempool (`Processing`) and an aborted
+ * proposal. An accepted transaction whose block is not located yet reads as `mempool`: it
+ * is known to the network, and the next look finds its block. An X-Chain transaction from
+ * before the linearization (April 2023) has no block and reads as not seen.
+ */
+import type { AddressCodec, AddressHistorySource, ChainReader, DriverBlock } from '../../core/driver/types';
+import type { AssetRef } from '../../core/model/asset';
+import type { NodeBlock } from './api';
+import { type ParsedUtxo } from './codec';
+import { type AvalancheContext } from './context';
+import type { AvalancheCallTags, AvalancheUnspent } from './types';
+export declare function assertNative(asset: AssetRef): void;
+export declare function addressCodec(ctx: AvalancheContext): AddressCodec;
+export declare const toDriverBlock: (block: NodeBlock) => DriverBlock;
+/** Every output `address` owns on this chain, parsed (the node's UTXO set). */
+export declare function ownedUtxos(ctx: AvalancheContext, address: string, tags: AvalancheCallTags): Promise<ParsedUtxo[]>;
+/**
+ * The outputs a transfer from `address` may spend, largest first (fewest inputs, so the
+ * lowest P-Chain fee), each id once; `exclude` leaves out those held by live Operations.
+ */
+export declare function spendable(ctx: AvalancheContext, address: string, exclude: readonly string[] | undefined, signal?: AbortSignal): Promise<ParsedUtxo[]>;
+/** `ext.avalanche.listUnspent`: every owned output, largest first. */
+export declare function listUnspent(ctx: AvalancheContext, address: string): Promise<AvalancheUnspent[]>;
+export declare function chainReader(ctx: AvalancheContext): ChainReader;
+/**
+ * Address history from the Data API, newest first; the cursor is its page token. Each
+ * transaction's bytes come from the node (they authenticate themselves by their id) and are
+ * decoded here; one that pays the address nothing and that it did not sign is left out
+ * (a server that dropped its filter never lists another address's), and
+ * every listed transaction counts toward `limit`, so paging stays bounded. An X-Chain
+ * transaction from before its linearization has no block, so it reads as not seen.
+ */
+export declare function addressHistory(ctx: AvalancheContext): AddressHistorySource;

package/dist/adapters/avalanche/reader.js

@@ -0,0 +1,231 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toDriverBlock = void 0;
+exports.assertNative = assertNative;
+exports.addressCodec = addressCodec;
+exports.ownedUtxos = ownedUtxos;
+exports.spendable = spendable;
+exports.listUnspent = listUnspent;
+exports.chainReader = chainReader;
+exports.addressHistory = addressHistory;
+const error_1 = require("../../core/errors/error");
+const address_1 = require("./address");
+const cb58_1 = require("./cb58");
+const codec_1 = require("./codec");
+const context_1 = require("./context");
+const decode_1 = require("./decode");
+/** The Data API serves at most 100 transactions per page. */
+const HISTORY_PAGE = 100;
+const PAGE_TOKEN = /^[A-Za-z0-9_-]{1,256}$/;
+const MAX_HEIGHT = BigInt(Number.MAX_SAFE_INTEGER);
+function assertNative(asset) {
+    if (asset !== 'native') {
+        throw new error_1.UnsupportedCapabilityError('UNSUPPORTED_CAPABILITY', 'only AVAX can be sent or read on the X-Chain and P-Chain here; Avalanche native tokens are not supported');
+    }
+}
+function addressCodec(ctx) {
+    const { config } = ctx;
+    return {
+        validate: (address) => {
+            try {
+                (0, address_1.decodeAddress)(address, config);
+                return true;
+            }
+            catch {
+                return false;
+            }
+        },
+        normalize: (address) => (0, address_1.normalizeAddress)(address, config),
+        fromPublicKey: (publicKey) => {
+            const canonical = (0, address_1.formatAddress)((0, address_1.addressBytesOf)(publicKey), config);
+            return { canonical, display: canonical };
+        },
+    };
+}
+const toDriverBlock = (block) => ({
+    height: block.height,
+    hash: block.id,
+    parentHash: block.parentId,
+    ...(block.timestamp !== undefined ? { timestamp: block.timestamp } : {}),
+    transactionIds: block.txIds,
+});
+exports.toDriverBlock = toDriverBlock;
+/** Every output `address` owns on this chain, parsed (the node's UTXO set). */
+async function ownedUtxos(ctx, address, tags) {
+    const canonical = (0, address_1.normalizeAddress)(address, ctx.config).canonical;
+    const listed = await ctx.node.utxos(canonical, tags);
+    return listed.map((bytes) => (0, codec_1.parseUtxo)(bytes, ctx.config));
+}
+/**
+ * The outputs a transfer from `address` may spend, largest first (fewest inputs, so the
+ * lowest P-Chain fee), each id once; `exclude` leaves out those held by live Operations.
+ */
+async function spendable(ctx, address, exclude, signal) {
+    const from = (0, address_1.decodeAddress)(address, ctx.config);
+    const held = new Set(exclude ?? []);
+    const owned = await ownedUtxos(ctx, address, (0, context_1.withSignal)(context_1.READ, signal));
+    return owned
+        .filter((utxo) => !held.has(utxo.utxoId) && (0, codec_1.spendableBy)(utxo, from, ctx.config))
+        .sort((a, b) => a.amount === b.amount
+        ? a.utxoId < b.utxoId
+            ? -1
+            : 1
+        : a.amount > b.amount
+            ? -1
+            : 1);
+}
+/** `ext.avalanche.listUnspent`: every owned output, largest first. */
+async function listUnspent(ctx, address) {
+    const from = (0, address_1.decodeAddress)(address, ctx.config);
+    const owned = await ownedUtxos(ctx, address, context_1.READ);
+    return owned
+        .map((utxo) => ({
+        utxoId: utxo.utxoId,
+        txId: utxo.txId,
+        outputIndex: utxo.outputIndex,
+        assetId: utxo.assetId,
+        amount: utxo.amount,
+        locktime: utxo.locktime,
+        threshold: utxo.threshold,
+        spendable: (0, codec_1.spendableBy)(utxo, from, ctx.config),
+    }))
+        .sort((a, b) => a.amount === b.amount
+        ? a.utxoId < b.utxoId
+            ? -1
+            : 1
+        : a.amount > b.amount
+            ? -1
+            : 1);
+}
+/** What a located, accepted transaction looks like to the core. */
+async function inBlock(ctx, txId, status, tags) {
+    const location = await (0, context_1.locate)(ctx, txId, tags);
+    // Accepted before the X-Chain had blocks: final, but there is no block to name.
+    if (location === 'no-block')
+        return { seen: 'none' };
+    if (!location)
+        return { seen: 'mempool', txHash: txId };
+    return {
+        seen: 'block',
+        txHash: txId,
+        blockHeight: location.height,
+        blockHash: location.hash,
+        success: status === 'accepted',
+        ...(status === 'aborted' ? { reason: 'the transaction was aborted' } : {}),
+    };
+}
+/**
+ * The node's view of `txId` and, once accepted, its block. X-Chain: accepted when the node
+ * holds it (`present`), else not seen. P-Chain: from `platform.getTxStatus`.
+ */
+async function observeId(ctx, txId, tags, present) {
+    if (ctx.config.vm === 'avm') {
+        const accepted = present ?? (await ctx.node.txBytes(txId, tags)) !== null;
+        return accepted ? inBlock(ctx, txId, 'accepted', tags) : { seen: 'none' };
+    }
+    const status = await ctx.node.txStatus(txId, tags);
+    switch (status) {
+        case 'Committed':
+            return inBlock(ctx, txId, 'accepted', tags);
+        case 'Aborted':
+            return inBlock(ctx, txId, 'aborted', tags);
+        case 'Processing':
+            return { seen: 'mempool', txHash: txId };
+        default:
+            // Dropped (the node's mempool refused it) or Unknown: not seen.
+            return { seen: 'none' };
+    }
+}
+function chainReader(ctx) {
+    const { node } = ctx;
+    return {
+        getBalance: async (address, asset) => {
+            assertNative(asset);
+            const utxos = await spendable(ctx, address, undefined);
+            return utxos.reduce((sum, utxo) => sum + utxo.amount, 0n);
+        },
+        getBlockHeight: () => node.height(context_1.MONITOR),
+        // Snowman: an accepted block is final; N confirmations trail the head by N − 1.
+        getFinalizedHeight: async () => {
+            const height = (await node.height(context_1.MONITOR)) - BigInt(ctx.config.confirmations) + 1n;
+            return height < 0n ? 0n : height;
+        },
+        getBlock: async (ref) => {
+            if (typeof ref === 'string') {
+                // A malformed id never reaches the node.
+                const block = (0, cb58_1.isId)(ref) ? await node.blockById(ref, context_1.READ) : null;
+                return block ? (0, exports.toDriverBlock)(block) : null;
+            }
+            if (ref < 0n || ref > MAX_HEIGHT)
+                return null;
+            const block = await node.blockAt(ref, context_1.READ);
+            return block ? (0, exports.toDriverBlock)(block) : null;
+        },
+        getTransaction: async (id) => {
+            if (!(0, cb58_1.isId)(id))
+                return null; // a malformed id never reaches the node
+            const bytes = await node.txBytes(id, context_1.READ);
+            if (!bytes)
+                return null;
+            const observation = await observeId(ctx, id, context_1.READ, true);
+            return (0, decode_1.decodeTransaction)(bytes, ctx.config, observation);
+        },
+        // As on a proof path, a refusal on any of these reads decides nothing (retryable).
+        observe: async (ref) => (0, cb58_1.isId)(ref.id) ? (0, context_1.proofRead)(() => observeId(ctx, ref.id, context_1.MONITOR)) : { seen: 'none' },
+    };
+}
+/**
+ * Address history from the Data API, newest first; the cursor is its page token. Each
+ * transaction's bytes come from the node (they authenticate themselves by their id) and are
+ * decoded here; one that pays the address nothing and that it did not sign is left out
+ * (a server that dropped its filter never lists another address's), and
+ * every listed transaction counts toward `limit`, so paging stays bounded. An X-Chain
+ * transaction from before its linearization has no block, so it reads as not seen.
+ */
+function addressHistory(ctx) {
+    return {
+        async list(address, { cursor, limit }) {
+            if (!Number.isSafeInteger(limit) || limit < 1) {
+                throw new error_1.ValidationError('INVALID_INTENT', 'limit must be a positive integer');
+            }
+            if (cursor !== undefined && !PAGE_TOKEN.test(cursor)) {
+                throw new error_1.ValidationError('INVALID_INTENT', 'malformed history cursor');
+            }
+            const canonical = (0, address_1.normalizeAddress)(address, ctx.config).canonical;
+            const items = [];
+            let served = 0;
+            let next = cursor;
+            do {
+                const page = await ctx.dataApi.history(canonical, {
+                    ...(next !== undefined ? { cursor: next } : {}),
+                    pageSize: Math.min(HISTORY_PAGE, limit - served),
+                }, context_1.READ);
+                for (const entry of page.items) {
+                    const bytes = await ctx.node.txBytes(entry.txId, context_1.READ);
+                    if (!bytes) {
+                        throw (0, context_1.contradiction)('the indexer lists a transaction the node does not have');
+                    }
+                    const observation = entry.location
+                        ? {
+                            seen: 'block',
+                            txHash: entry.txId,
+                            blockHeight: entry.location.height,
+                            blockHash: entry.location.hash,
+                            success: true,
+                        }
+                        : { seen: 'none' };
+                    const tx = (0, decode_1.decodeTransaction)(bytes, ctx.config, observation);
+                    const signers = tx.details.signers;
+                    const touches = tx.transfers.some((t) => t.to === canonical) ||
+                        (signers ?? []).includes(canonical);
+                    if (touches)
+                        items.push(tx);
+                    served++;
+                }
+                next = page.next;
+            } while (served < limit && next !== undefined);
+            return { items, ...(next !== undefined ? { next } : {}) };
+        },
+    };
+}
+//# sourceMappingURL=reader.js.map

package/dist/adapters/avalanche/reader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reader.js","sourceRoot":"","sources":["../../../src/adapters/avalanche/reader.ts"],"names":[],"mappings":";;;AAgDA,oCAOC;AAED,oCAiBC;AAWD,gCAQC;AAMD,8BAoBC;AAGD,kCA0BC;AAmDD,kCAmCC;AAUD,wCAiDC;AAjRD,mDAAsF;AAEtF,uCAKmB;AAEnB,iCAA8B;AAC9B,mCAAkE;AAClE,uCAQmB;AACnB,qCAA6C;AAG7C,6DAA6D;AAC7D,MAAM,YAAY,GAAG,GAAG,CAAC;AACzB,MAAM,UAAU,GAAG,wBAAwB,CAAC;AAC5C,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;AAEnD,SAAgB,YAAY,CAAC,KAAe;IAC1C,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvB,MAAM,IAAI,kCAA0B,CAClC,wBAAwB,EACxB,0GAA0G,CAC3G,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAAC,GAAqB;IAChD,MAAM,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IACvB,OAAO;QACL,QAAQ,EAAE,CAAC,OAAO,EAAE,EAAE;YACpB,IAAI,CAAC;gBACH,IAAA,uBAAa,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC/B,OAAO,IAAI,CAAC;YACd,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,SAAS,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,IAAA,0BAAgB,EAAC,OAAO,EAAE,MAAM,CAAC;QACzD,aAAa,EAAE,CAAC,SAAS,EAAE,EAAE;YAC3B,MAAM,SAAS,GAAG,IAAA,uBAAa,EAAC,IAAA,wBAAc,EAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC;YACnE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAC3C,CAAC;KACF,CAAC;AACJ,CAAC;AAEM,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAe,EAAE,CAAC,CAAC;IAC/D,MAAM,EAAE,KAAK,CAAC,MAAM;IACpB,IAAI,EAAE,KAAK,CAAC,EAAE;IACd,UAAU,EAAE,KAAK,CAAC,QAAQ;IAC1B,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACxE,cAAc,EAAE,KAAK,CAAC,KAAK;CAC5B,CAAC,CAAC;AANU,QAAA,aAAa,iBAMvB;AAEH,+EAA+E;AACxE,KAAK,UAAU,UAAU,CAC9B,GAAqB,EACrB,OAAe,EACf,IAAuB;IAEvB,MAAM,SAAS,GAAG,IAAA,0BAAgB,EAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC;IAClE,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,iBAAS,EAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;GAGG;AACI,KAAK,UAAU,SAAS,CAC7B,GAAqB,EACrB,OAAe,EACf,OAAsC,EACtC,MAAoB;IAEpB,MAAM,IAAI,GAAG,IAAA,uBAAa,EAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,OAAO,EAAE,IAAA,oBAAU,EAAC,cAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACvE,OAAO,KAAK;SACT,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAA,mBAAW,EAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;SAC/E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACb,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACnB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;YACnB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;YACnB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC,CACR,CAAC;AACN,CAAC;AAED,sEAAsE;AAC/D,KAAK,UAAU,WAAW,CAC/B,GAAqB,EACrB,OAAe;IAEf,MAAM,IAAI,GAAG,IAAA,uBAAa,EAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,OAAO,EAAE,cAAI,CAAC,CAAC;IACnD,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAA,mBAAW,EAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC;KAC/C,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACb,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACnB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;YACnB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;YACnB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC,CACR,CAAC;AACN,CAAC;AAED,mEAAmE;AACnE,KAAK,UAAU,OAAO,CACpB,GAAqB,EACrB,IAAY,EACZ,MAA8B,EAC9B,IAAuB;IAEvB,MAAM,QAAQ,GAAG,MAAM,IAAA,gBAAM,EAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/C,gFAAgF;IAChF,IAAI,QAAQ,KAAK,UAAU;QAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IACrD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACxD,OAAO;QACL,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,IAAI;QACZ,WAAW,EAAE,QAAQ,CAAC,MAAM;QAC5B,SAAS,EAAE,QAAQ,CAAC,IAAI;QACxB,OAAO,EAAE,MAAM,KAAK,UAAU;QAC9B,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,SAAS,CACtB,GAAqB,EACrB,IAAY,EACZ,IAAuB,EACvB,OAAiB;IAEjB,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC;QAC1E,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAC5E,CAAC;IACD,MAAM,MAAM,GAAmB,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACnE,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,WAAW;YACd,OAAO,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;QAC9C,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC7C,KAAK,YAAY;YACf,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC3C;YACE,gEAAgE;YAChE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,SAAgB,WAAW,CAAC,GAAqB;IAC/C,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;IACrB,OAAO;QACL,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;YACnC,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YACvD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,cAAc,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAO,CAAC;QAC1C,gFAAgF;QAChF,kBAAkB,EAAE,KAAK,IAAI,EAAE;YAC7B,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAO,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;YACpF,OAAO,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACtB,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;gBAC5B,yCAAyC;gBACzC,MAAM,KAAK,GAAG,IAAA,WAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,cAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACjE,OAAO,KAAK,CAAC,CAAC,CAAC,IAAA,qBAAa,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YACD,IAAI,GAAG,GAAG,EAAE,IAAI,GAAG,GAAG,UAAU;gBAAE,OAAO,IAAI,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,cAAI,CAAC,CAAC;YAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,IAAA,qBAAa,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,CAAC;QACD,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE;YAC3B,IAAI,CAAC,IAAA,WAAI,EAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC,CAAC,wCAAwC;YACpE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,cAAI,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC;YACxB,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,GAAG,EAAE,EAAE,EAAE,cAAI,EAAE,IAAI,CAAC,CAAC;YACzD,OAAO,IAAA,0BAAiB,EAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC3D,CAAC;QACD,mFAAmF;QACnF,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CACrB,IAAA,WAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAA,mBAAS,EAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,iBAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;KACrF,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,cAAc,CAAC,GAAqB;IAClD,OAAO;QACL,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE;YACnC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC9C,MAAM,IAAI,uBAAe,CAAC,gBAAgB,EAAE,kCAAkC,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrD,MAAM,IAAI,uBAAe,CAAC,gBAAgB,EAAE,0BAA0B,CAAC,CAAC;YAC1E,CAAC;YACD,MAAM,SAAS,GAAG,IAAA,0BAAgB,EAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC;YAClE,MAAM,KAAK,GAAwB,EAAE,CAAC;YACtC,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,GAAG,CAAC;gBACF,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,OAAO,CACpC,SAAS,EACT;oBACE,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/C,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,GAAG,MAAM,CAAC;iBACjD,EACD,cAAI,CACL,CAAC;gBACF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,cAAI,CAAC,CAAC;oBACvD,IAAI,CAAC,KAAK,EAAE,CAAC;wBACX,MAAM,IAAA,uBAAa,EAAC,wDAAwD,CAAC,CAAC;oBAChF,CAAC;oBACD,MAAM,WAAW,GAAwB,KAAK,CAAC,QAAQ;wBACrD,CAAC,CAAC;4BACE,IAAI,EAAE,OAAO;4BACb,MAAM,EAAE,KAAK,CAAC,IAAI;4BAClB,WAAW,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM;4BAClC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI;4BAC9B,OAAO,EAAE,IAAI;yBACd;wBACH,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;oBACrB,MAAM,EAAE,GAAG,IAAA,0BAAiB,EAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;oBAC7D,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,OAAwC,CAAC;oBACpE,MAAM,OAAO,GACX,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC;wBAC5C,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;oBACtC,IAAI,OAAO;wBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC5B,MAAM,EAAE,CAAC;gBACX,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC,QAAQ,MAAM,GAAG,KAAK,IAAI,IAAI,KAAK,SAAS,EAAE;YAC/C,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAC5D,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Avalanche addresses, point reads, observation, address history and\n * `ext.avalanche.listUnspent`. Every call carries the tags of the `ChainDriver` contract\n * table: `read` for point queries, `monitor` for heights and observations.\n *\n * Observation: the X-Chain has no mempool view (its `getTxStatus` is deprecated and only\n * reports accepted or unknown), so a transaction is in a block once the node holds it and\n * unknown before. The P-Chain also reports its mempool (`Processing`) and an aborted\n * proposal. An accepted transaction whose block is not located yet reads as `mempool`: it\n * is known to the network, and the next look finds its block. An X-Chain transaction from\n * before the linearization (April 2023) has no block and reads as not seen.\n */\nimport type {\n  AddressCodec,\n  AddressHistorySource,\n  ChainReader,\n  DriverBlock,\n  DriverTransaction,\n  DriverTxObservation,\n} from '../../core/driver/types';\nimport { UnsupportedCapabilityError, ValidationError } from '../../core/errors/error';\nimport type { AssetRef } from '../../core/model/asset';\nimport {\n  addressBytesOf,\n  decodeAddress,\n  formatAddress,\n  normalizeAddress,\n} from './address';\nimport type { NodeBlock, PlatformStatus } from './api';\nimport { isId } from './cb58';\nimport { parseUtxo, spendableBy, type ParsedUtxo } from './codec';\nimport {\n  MONITOR,\n  READ,\n  contradiction,\n  locate,\n  proofRead,\n  withSignal,\n  type AvalancheContext,\n} from './context';\nimport { decodeTransaction } from './decode';\nimport type { AvalancheCallTags, AvalancheUnspent } from './types';\n\n/** The Data API serves at most 100 transactions per page. */\nconst HISTORY_PAGE = 100;\nconst PAGE_TOKEN = /^[A-Za-z0-9_-]{1,256}$/;\nconst MAX_HEIGHT = BigInt(Number.MAX_SAFE_INTEGER);\n\nexport function assertNative(asset: AssetRef): void {\n  if (asset !== 'native') {\n    throw new UnsupportedCapabilityError(\n      'UNSUPPORTED_CAPABILITY',\n      'only AVAX can be sent or read on the X-Chain and P-Chain here; Avalanche native tokens are not supported',\n    );\n  }\n}\n\nexport function addressCodec(ctx: AvalancheContext): AddressCodec {\n  const { config } = ctx;\n  return {\n    validate: (address) => {\n      try {\n        decodeAddress(address, config);\n        return true;\n      } catch {\n        return false;\n      }\n    },\n    normalize: (address) => normalizeAddress(address, config),\n    fromPublicKey: (publicKey) => {\n      const canonical = formatAddress(addressBytesOf(publicKey), config);\n      return { canonical, display: canonical };\n    },\n  };\n}\n\nexport const toDriverBlock = (block: NodeBlock): DriverBlock => ({\n  height: block.height,\n  hash: block.id,\n  parentHash: block.parentId,\n  ...(block.timestamp !== undefined ? { timestamp: block.timestamp } : {}),\n  transactionIds: block.txIds,\n});\n\n/** Every output `address` owns on this chain, parsed (the node's UTXO set). */\nexport async function ownedUtxos(\n  ctx: AvalancheContext,\n  address: string,\n  tags: AvalancheCallTags,\n): Promise<ParsedUtxo[]> {\n  const canonical = normalizeAddress(address, ctx.config).canonical;\n  const listed = await ctx.node.utxos(canonical, tags);\n  return listed.map((bytes) => parseUtxo(bytes, ctx.config));\n}\n\n/**\n * The outputs a transfer from `address` may spend, largest first (fewest inputs, so the\n * lowest P-Chain fee), each id once; `exclude` leaves out those held by live Operations.\n */\nexport async function spendable(\n  ctx: AvalancheContext,\n  address: string,\n  exclude: readonly string[] | undefined,\n  signal?: AbortSignal,\n): Promise<ParsedUtxo[]> {\n  const from = decodeAddress(address, ctx.config);\n  const held = new Set(exclude ?? []);\n  const owned = await ownedUtxos(ctx, address, withSignal(READ, signal));\n  return owned\n    .filter((utxo) => !held.has(utxo.utxoId) && spendableBy(utxo, from, ctx.config))\n    .sort((a, b) =>\n      a.amount === b.amount\n        ? a.utxoId < b.utxoId\n          ? -1\n          : 1\n        : a.amount > b.amount\n          ? -1\n          : 1,\n    );\n}\n\n/** `ext.avalanche.listUnspent`: every owned output, largest first. */\nexport async function listUnspent(\n  ctx: AvalancheContext,\n  address: string,\n): Promise<AvalancheUnspent[]> {\n  const from = decodeAddress(address, ctx.config);\n  const owned = await ownedUtxos(ctx, address, READ);\n  return owned\n    .map((utxo) => ({\n      utxoId: utxo.utxoId,\n      txId: utxo.txId,\n      outputIndex: utxo.outputIndex,\n      assetId: utxo.assetId,\n      amount: utxo.amount,\n      locktime: utxo.locktime,\n      threshold: utxo.threshold,\n      spendable: spendableBy(utxo, from, ctx.config),\n    }))\n    .sort((a, b) =>\n      a.amount === b.amount\n        ? a.utxoId < b.utxoId\n          ? -1\n          : 1\n        : a.amount > b.amount\n          ? -1\n          : 1,\n    );\n}\n\n/** What a located, accepted transaction looks like to the core. */\nasync function inBlock(\n  ctx: AvalancheContext,\n  txId: string,\n  status: 'accepted' | 'aborted',\n  tags: AvalancheCallTags,\n): Promise<DriverTxObservation> {\n  const location = await locate(ctx, txId, tags);\n  // Accepted before the X-Chain had blocks: final, but there is no block to name.\n  if (location === 'no-block') return { seen: 'none' };\n  if (!location) return { seen: 'mempool', txHash: txId };\n  return {\n    seen: 'block',\n    txHash: txId,\n    blockHeight: location.height,\n    blockHash: location.hash,\n    success: status === 'accepted',\n    ...(status === 'aborted' ? { reason: 'the transaction was aborted' } : {}),\n  };\n}\n\n/**\n * The node's view of `txId` and, once accepted, its block. X-Chain: accepted when the node\n * holds it (`present`), else not seen. P-Chain: from `platform.getTxStatus`.\n */\nasync function observeId(\n  ctx: AvalancheContext,\n  txId: string,\n  tags: AvalancheCallTags,\n  present?: boolean,\n): Promise<DriverTxObservation> {\n  if (ctx.config.vm === 'avm') {\n    const accepted = present ?? (await ctx.node.txBytes(txId, tags)) !== null;\n    return accepted ? inBlock(ctx, txId, 'accepted', tags) : { seen: 'none' };\n  }\n  const status: PlatformStatus = await ctx.node.txStatus(txId, tags);\n  switch (status) {\n    case 'Committed':\n      return inBlock(ctx, txId, 'accepted', tags);\n    case 'Aborted':\n      return inBlock(ctx, txId, 'aborted', tags);\n    case 'Processing':\n      return { seen: 'mempool', txHash: txId };\n    default:\n      // Dropped (the node's mempool refused it) or Unknown: not seen.\n      return { seen: 'none' };\n  }\n}\n\nexport function chainReader(ctx: AvalancheContext): ChainReader {\n  const { node } = ctx;\n  return {\n    getBalance: async (address, asset) => {\n      assertNative(asset);\n      const utxos = await spendable(ctx, address, undefined);\n      return utxos.reduce((sum, utxo) => sum + utxo.amount, 0n);\n    },\n    getBlockHeight: () => node.height(MONITOR),\n    // Snowman: an accepted block is final; N confirmations trail the head by N − 1.\n    getFinalizedHeight: async () => {\n      const height = (await node.height(MONITOR)) - BigInt(ctx.config.confirmations) + 1n;\n      return height < 0n ? 0n : height;\n    },\n    getBlock: async (ref) => {\n      if (typeof ref === 'string') {\n        // A malformed id never reaches the node.\n        const block = isId(ref) ? await node.blockById(ref, READ) : null;\n        return block ? toDriverBlock(block) : null;\n      }\n      if (ref < 0n || ref > MAX_HEIGHT) return null;\n      const block = await node.blockAt(ref, READ);\n      return block ? toDriverBlock(block) : null;\n    },\n    getTransaction: async (id) => {\n      if (!isId(id)) return null; // a malformed id never reaches the node\n      const bytes = await node.txBytes(id, READ);\n      if (!bytes) return null;\n      const observation = await observeId(ctx, id, READ, true);\n      return decodeTransaction(bytes, ctx.config, observation);\n    },\n    // As on a proof path, a refusal on any of these reads decides nothing (retryable).\n    observe: async (ref) =>\n      isId(ref.id) ? proofRead(() => observeId(ctx, ref.id, MONITOR)) : { seen: 'none' },\n  };\n}\n\n/**\n * Address history from the Data API, newest first; the cursor is its page token. Each\n * transaction's bytes come from the node (they authenticate themselves by their id) and are\n * decoded here; one that pays the address nothing and that it did not sign is left out\n * (a server that dropped its filter never lists another address's), and\n * every listed transaction counts toward `limit`, so paging stays bounded. An X-Chain\n * transaction from before its linearization has no block, so it reads as not seen.\n */\nexport function addressHistory(ctx: AvalancheContext): AddressHistorySource {\n  return {\n    async list(address, { cursor, limit }) {\n      if (!Number.isSafeInteger(limit) || limit < 1) {\n        throw new ValidationError('INVALID_INTENT', 'limit must be a positive integer');\n      }\n      if (cursor !== undefined && !PAGE_TOKEN.test(cursor)) {\n        throw new ValidationError('INVALID_INTENT', 'malformed history cursor');\n      }\n      const canonical = normalizeAddress(address, ctx.config).canonical;\n      const items: DriverTransaction[] = [];\n      let served = 0;\n      let next = cursor;\n      do {\n        const page = await ctx.dataApi.history(\n          canonical,\n          {\n            ...(next !== undefined ? { cursor: next } : {}),\n            pageSize: Math.min(HISTORY_PAGE, limit - served),\n          },\n          READ,\n        );\n        for (const entry of page.items) {\n          const bytes = await ctx.node.txBytes(entry.txId, READ);\n          if (!bytes) {\n            throw contradiction('the indexer lists a transaction the node does not have');\n          }\n          const observation: DriverTxObservation = entry.location\n            ? {\n                seen: 'block',\n                txHash: entry.txId,\n                blockHeight: entry.location.height,\n                blockHash: entry.location.hash,\n                success: true,\n              }\n            : { seen: 'none' };\n          const tx = decodeTransaction(bytes, ctx.config, observation);\n          const signers = tx.details.signers as readonly string[] | undefined;\n          const touches =\n            tx.transfers.some((t) => t.to === canonical) ||\n            (signers ?? []).includes(canonical);\n          if (touches) items.push(tx);\n          served++;\n        }\n        next = page.next;\n      } while (served < limit && next !== undefined);\n      return { items, ...(next !== undefined ? { next } : {}) };\n    },\n  };\n}\n"]}