@ickb/sdk 1000.0.82 → 9000.0.1

package/dist/order/cells.js

@@ -0,0 +1,427 @@
+import { OrderData } from "./order_data.js";
+// The resolver's own group, keyed by its order cell: matching and transactions use this
+// parse, so a caller's own wrapper is only ever a key into it.
+const resolvedOrderGroups = new WeakMap();
+/**
+ * Represents a parsed order cell on the blockchain.
+ *
+ * Implements `ValueComponents` to expose the cell's raw data and its
+ * value breakdown (CKB and UDT).
+ */
+export class OrderCell {
+    /** Raw live cell that carries the order lock and UDT type. */
+    cell;
+    /** Decoded order payload from `cell.outputData`. */
+    data;
+    /** CKB capacity available for matching after occupied capacity is reserved. */
+    ckbUnoccupied;
+    /** Absolute total order value in the order's comparison units. */
+    absTotal;
+    /** Absolute matched progress in the order's comparison units. */
+    absProgress;
+    constructor({ cell, data, ckbUnoccupied, absTotal, absProgress, }) {
+        this.cell = cell;
+        this.data = data;
+        this.ckbUnoccupied = ckbUnoccupied;
+        this.absTotal = absTotal;
+        this.absProgress = absProgress;
+    }
+    /**
+     * Gets the order CKB amount.
+     *
+     * @returns The CKB amount as a `ccc.FixedPoint`.
+     */
+    get ckbValue() {
+        return this.cell.cellOutput.capacity;
+    }
+    /**
+     * Gets the order UDT amount.
+     *
+     * @returns The UDT amount as a `ccc.FixedPoint`.
+     */
+    get udtValue() {
+        return this.data.udtValue;
+    }
+    /**
+     * Attempts to parse an OrderCell from a raw cell.
+     *
+     * Returns `undefined` if parsing or validation fails.
+     *
+     * @param cell - The raw chain cell to convert.
+     * @returns An `OrderCell` instance or `undefined`.
+     */
+    static tryFrom(cell) {
+        try {
+            return OrderCell.mustFrom(cell);
+        }
+        catch {
+            return undefined;
+        }
+    }
+    /**
+     * Parses and validates a raw cell as OrderCell.
+     *
+     * Throws if the cell is invalid or data validation fails.
+     *
+     * @param cell - The raw chain cell to convert.
+     * @returns A new `OrderCell` instance.
+     * @throws When decoding or validation fails.
+     */
+    static mustFrom(cell) {
+        let data;
+        try {
+            data = OrderData.decode(cell.outputData);
+            data.validate();
+        }
+        catch (error) {
+            throw new Error(`Invalid order payload at ${cell.outPoint.toHex()}`, {
+                cause: error,
+            });
+        }
+        const udtValue = data.udtValue;
+        const ckbUnoccupied = cell.capacityFree;
+        const { ckbToUdt, udtToCkb } = data.info;
+        const isCkb2Udt = data.info.isCkb2Udt();
+        const isUdt2Ckb = data.info.isUdt2Ckb();
+        const isDualRatio = isCkb2Udt && isUdt2Ckb;
+        // Compute total values in base units
+        const ckb2UdtValue = isCkb2Udt
+            ? ckbUnoccupied * ckbToUdt.ckbScale + udtValue * ckbToUdt.udtScale
+            : 0n;
+        const udt2CkbValue = isUdt2Ckb
+            ? ckbUnoccupied * udtToCkb.ckbScale + udtValue * udtToCkb.udtScale
+            : 0n;
+        const absTotal = absoluteOrderTotal(ckb2UdtValue, udt2CkbValue, data.info);
+        const absProgress = absoluteOrderProgress({
+            absTotal,
+            ckbUnoccupied,
+            isCkb2Udt,
+            isDualRatio,
+            udtScale: ckbToUdt.udtScale,
+            udtValue,
+            udtToCkbCkbScale: udtToCkb.ckbScale,
+        });
+        return new OrderCell({ cell, data, ckbUnoccupied, absTotal, absProgress });
+    }
+    /**
+     * Checks whether the CKB-to-UDT side is enabled and has nonzero inventory.
+     *
+     * @remarks Executable-match checks for fee, minimum output, and ratio bounds happen during matching.
+     */
+    isCkb2UdtMatchable() {
+        return this.data.info.isCkb2Udt() && this.ckbUnoccupied > 0n;
+    }
+    /**
+     * Checks whether the UDT-to-CKB side is enabled and has nonzero inventory.
+     *
+     * @remarks Executable-match checks for fee, minimum output, and ratio bounds happen during matching.
+     */
+    isUdt2CkbMatchable() {
+        return this.data.info.isUdt2Ckb() && this.data.udtValue > 0n;
+    }
+    /** Returns true when either side is enabled and has nonzero inventory. */
+    isMatchable() {
+        return this.isCkb2UdtMatchable() || this.isUdt2CkbMatchable();
+    }
+    /**
+     * Checks if the order is fulfilled.
+     *
+     * @returns True if the order is fulfilled (not matchable), otherwise false.
+     */
+    isFulfilled() {
+        return !this.isMatchable();
+    }
+    /**
+     * Retrieves the master out point of the order.
+     * @returns The master out point associated with the order.
+     */
+    getMaster() {
+        return this.data.getMaster(this.cell.outPoint);
+    }
+    /**
+     * Validates a descendant order against this origin order.
+     *
+     * @remarks
+     * This confusion-attack guard requires the same order script, UDT type,
+     * master, and info, while forbidding lower total value or lower progress.
+     * See {@link https://github.com/ickb/whitepaper/issues/19}.
+     */
+    validate(descendant) {
+        if (!this.data.isMint()) {
+            throw new Error("Origin is not a mint order");
+        }
+        if (!this.cell.cellOutput.lock.eq(descendant.cell.cellOutput.lock)) {
+            throw new Error("Order script different");
+        }
+        const udt = this.cell.cellOutput.type;
+        if (udt === undefined || descendant.cell.cellOutput.type?.eq(udt) !== true) {
+            throw new Error("UDT type is different");
+        }
+        if (!descendant.getMaster().eq(this.getMaster())) {
+            throw new Error("Master is different");
+        }
+        if (!this.data.info.eq(descendant.data.info)) {
+            throw new Error("Info is different");
+        }
+        if (this.absTotal > descendant.absTotal) {
+            throw new Error("Total value is lower than the original one");
+        }
+        if (this.absProgress > descendant.absProgress) {
+            throw new Error("Progress is lower than the original one");
+        }
+    }
+    /**
+     * Checks if the descendant order is valid against this order.
+     * @param descendant - The descendant order to validate.
+     * @returns True if the descendant is valid, otherwise false.
+     */
+    isValid(descendant) {
+        try {
+            this.validate(descendant);
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    /**
+     * Resolves the best valid descendant order.
+     *
+     * @remarks
+     * The genuine mint origin is the immutable validation baseline. Resolution
+     * prefers greater progress and then greater total value; candidate identity is
+     * irrelevant. Equal-score non-mint candidates are ambiguous, while the mint
+     * origin wins an equal-score tie when it is still live.
+     */
+    resolve(descendants) {
+        let resolution;
+        for (const descendant of descendants) {
+            if (!this.isValid(descendant)) {
+                continue;
+            }
+            resolution = betterOrderResolution(resolution, descendant);
+        }
+        if (resolution?.isAmbiguous === true) {
+            return undefined;
+        }
+        return resolution?.order;
+    }
+}
+function absoluteOrderTotal(ckb2UdtValue, udt2CkbValue, info) {
+    if (ckb2UdtValue === 0n) {
+        return udt2CkbValue;
+    }
+    if (udt2CkbValue === 0n) {
+        return ckb2UdtValue;
+    }
+    const { ckbToUdt, udtToCkb } = info;
+    return ((ckb2UdtValue * udtToCkb.ckbScale * udtToCkb.udtScale +
+        udt2CkbValue * ckbToUdt.ckbScale * ckbToUdt.udtScale) >>
+        1n);
+}
+function absoluteOrderProgress(options) {
+    if (options.isDualRatio) {
+        return options.absTotal;
+    }
+    if (options.isCkb2Udt) {
+        return options.udtValue * options.udtScale;
+    }
+    return options.ckbUnoccupied * options.udtToCkbCkbScale;
+}
+function betterOrderResolution(current, candidate) {
+    if (current === undefined || compareOrderScore(current.order, candidate) < 0) {
+        return { isAmbiguous: false, order: candidate };
+    }
+    if (compareOrderScore(current.order, candidate) > 0) {
+        return current;
+    }
+    if (current.order.cell.outPoint.eq(candidate.cell.outPoint)) {
+        return current;
+    }
+    if (candidate.data.isMint() && !current.order.data.isMint()) {
+        return { isAmbiguous: false, order: candidate };
+    }
+    if (!candidate.data.isMint() && current.order.data.isMint()) {
+        return current;
+    }
+    return { ...current, isAmbiguous: true };
+}
+function compareOrderScore(left, right) {
+    if (left.absProgress !== right.absProgress) {
+        return left.absProgress < right.absProgress ? -1 : 1;
+    }
+    if (left.absTotal !== right.absTotal) {
+        return left.absTotal < right.absTotal ? -1 : 1;
+    }
+    return 0;
+}
+/**
+ * Represents a master cell
+ */
+export class MasterCell {
+    /** Raw live master cell that anchors an order group. */
+    cell;
+    /**
+     * Gets the UDT value of the cell.
+     *
+     * For a Master Cell, the UDT amount is always zero.
+     *
+     * @returns The UDT amount as a `ccc.FixedPoint` (0n).
+     */
+    udtValue = 0n;
+    /**
+     * Creates an instance of MasterCell.
+     * @param cell - The ccc.Cell instance to be wrapped by the MasterCell.
+     */
+    constructor(cell) {
+        this.cell = cell;
+    }
+    /**
+     * Gets the CKB value of the cell.
+     *
+     * @returns The total CKB amount as a `ccc.FixedPoint`.
+     */
+    get ckbValue() {
+        return this.cell.cellOutput.capacity;
+    }
+    /**
+     * Validates the MasterCell against an OrderCell.
+     * @param order - The OrderCell to validate against.
+     * @throws Error if the order script is different or if the master is different.
+     */
+    validate(order) {
+        if (this.cell.cellOutput.type?.eq(order.cell.cellOutput.lock) !== true) {
+            throw new Error("Order script different");
+        }
+        if (!order.getMaster().eq(this.cell.outPoint)) {
+            throw new Error("Master is different");
+        }
+    }
+}
+/**
+ * Represents a group of orders associated with a master cell.
+ */
+export class OrderGroup {
+    /** Master cell that authorizes and anchors the current order. */
+    master;
+    /** Current resolved order cell. */
+    order;
+    /** Origin order used to validate descendant progress and identity. */
+    origin;
+    /** The block that committed the origin, when known: how long the order has been on the book. */
+    blockNumber;
+    /**
+     * Creates an instance of OrderGroup.
+     * @param master - The master cell associated with the order group.
+     * @param order - The order within the group.
+     * @param origin - The original order associated with the group.
+     * @param blockNumber - The block that committed the origin, if committed.
+     */
+    constructor(master, order, origin, blockNumber) {
+        this.master = master;
+        this.order = order;
+        this.origin = origin;
+        this.blockNumber = blockNumber;
+    }
+    /**
+     * Gets the CKB value of the group.
+     *
+     * @returns The total CKB amount as a `ccc.FixedPoint`, which is the sum of the CKB values of the order cell and the master cell.
+     */
+    get ckbValue() {
+        return this.order.cell.cellOutput.capacity + this.master.cell.cellOutput.capacity;
+    }
+    /**
+     * Gets the UDT value of the group.
+     *
+     * @returns The UDT amount as a `ccc.FixedPoint`, derived from the order cell.
+     */
+    get udtValue() {
+        return this.order.data.udtValue;
+    }
+    /**
+     * Tries to create an OrderGroup from the provided parameters.
+     * @param master - The master cell.
+     * @param order - The order within the group.
+     * @param origin - The original order.
+     * @returns An OrderGroup instance or undefined if creation fails.
+     */
+    static tryFrom(master, order, origin, blockNumber) {
+        const og = new OrderGroup(master, order, origin, blockNumber);
+        if (og.isValid()) {
+            return og;
+        }
+        return undefined;
+    }
+    /**
+     * Validates the order group against its master and origin orders.
+     * @throws Will throw an error if validation fails.
+     */
+    validate() {
+        this.master.validate(this.origin);
+        this.master.validate(this.order);
+        this.origin.validate(this.order);
+    }
+    /**
+     * Checks if the order group is valid.
+     * @returns True if the order group is valid, otherwise false.
+     */
+    isValid() {
+        try {
+            this.validate();
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    /**
+     * Checks if the specified lock is the owner of the master cell.
+     *
+     * @param locks - The locks to check ownership against.
+     * @returns True if the lock is the owner, otherwise false.
+     */
+    isOwner(...locks) {
+        const lock = this.master.cell.cellOutput.lock;
+        return locks.some((l) => lock.eq(l));
+    }
+}
+/**
+ * Records canonical resolver output without exposing forgeable provenance data. The
+ * group and its parsed parts are frozen, since matching and transactions build on them.
+ */
+export function attestResolvedOrderGroup(group) {
+    group.validate();
+    for (const order of [group.order, group.origin]) {
+        const { info } = order.data;
+        for (const part of [
+            order,
+            order.data,
+            order.data.master,
+            info,
+            info.ckbToUdt,
+            info.udtToCkb,
+        ]) {
+            Object.freeze(part);
+        }
+    }
+    Object.freeze(group.master);
+    resolvedOrderGroups.set(group.order.cell, Object.freeze(group));
+    return group;
+}
+/** Returns the resolver's group at a matching or transaction boundary. */
+export function validatedOrderGroup(group) {
+    if (!(group instanceof OrderGroup)) {
+        throw new TypeError("Matching requires resolved OrderGroups from findOrders()");
+    }
+    const attested = resolvedOrderGroups.get(group.order.cell);
+    if (attested === undefined) {
+        throw new TypeError("OrderGroup was not produced by the order resolver");
+    }
+    if (group.master.cell !== attested.master.cell ||
+        group.origin.cell !== attested.origin.cell) {
+        throw new TypeError("OrderGroup does not match its resolver attestation");
+    }
+    return attested;
+}
+//# sourceMappingURL=cells.js.map

package/dist/order/cells.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cells.js","sourceRoot":"","sources":["../../src/order/cells.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C,wFAAwF;AACxF,+DAA+D;AAC/D,MAAM,mBAAmB,GAAG,IAAI,OAAO,EAAwB,CAAC;AAEhE;;;;;GAKG;AACH,MAAM,OAAO,SAAS;IACpB,8DAA8D;IAC9C,IAAI,CAAW;IAC/B,oDAAoD;IACpC,IAAI,CAAY;IAChC,+EAA+E;IAC/D,aAAa,CAAiB;IAC9C,kEAAkE;IAClD,QAAQ,CAAU;IAClC,iEAAiE;IACjD,WAAW,CAAU;IAErC,YAAY,EACV,IAAI,EACJ,IAAI,EACJ,aAAa,EACb,QAAQ,EACR,WAAW,GAOZ;QACC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,OAAO,CAAC,IAAc;QAClC,IAAI,CAAC;YACH,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAc;QACnC,IAAI,IAAe,CAAC;QACpB,IAAI,CAAC;YACH,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,EAAE;gBACnE,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACxC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,WAAW,GAAG,SAAS,IAAI,SAAS,CAAC;QAE3C,qCAAqC;QACrC,MAAM,YAAY,GAAG,SAAS;YAC5B,CAAC,CAAC,aAAa,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC,QAAQ;YAClE,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,YAAY,GAAG,SAAS;YAC5B,CAAC,CAAC,aAAa,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC,QAAQ;YAClE,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,QAAQ,GAAG,kBAAkB,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3E,MAAM,WAAW,GAAG,qBAAqB,CAAC;YACxC,QAAQ;YACR,aAAa;YACb,SAAS;YACT,WAAW;YACX,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,QAAQ;YACR,gBAAgB,EAAE,QAAQ,CAAC,QAAQ;SACpC,CAAC,CAAC;QAEH,OAAO,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED;;;;OAIG;IACI,kBAAkB;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACI,kBAAkB;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IAC/D,CAAC;IAED,0EAA0E;IACnE,WAAW;QAChB,OAAO,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAChE,CAAC;IAED;;;;OAIG;IACI,WAAW;QAChB,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACI,SAAS;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED;;;;;;;OAOG;IACI,QAAQ,CAAC,UAAqB;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACnE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QACtC,IAAI,GAAG,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;YAC3E,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;YACjD,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACvC,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,UAAqB;QAClC,IAAI,CAAC;YACH,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACI,OAAO,CAAC,WAAwB;QACrC,IAAI,UAAuC,CAAC;QAC5C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9B,SAAS;YACX,CAAC;YAED,UAAU,GAAG,qBAAqB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,UAAU,EAAE,WAAW,KAAK,IAAI,EAAE,CAAC;YACrC,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,UAAU,EAAE,KAAK,CAAC;IAC3B,CAAC;CACF;AAOD,SAAS,kBAAkB,CACzB,YAAoB,EACpB,YAAoB,EACpB,IAAuB;IAEvB,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACxB,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACxB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACpC,OAAO,CACL,CAAC,YAAY,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ;QACnD,YAAY,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACvD,EAAE,CACH,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,OAQ9B;IACC,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QACxB,OAAO,OAAO,CAAC,QAAQ,CAAC;IAC1B,CAAC;IACD,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACtB,OAAO,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IAC7C,CAAC;IACD,OAAO,OAAO,CAAC,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAAC;AAC1D,CAAC;AAED,SAAS,qBAAqB,CAC5B,OAAoC,EACpC,SAAoB;IAEpB,IAAI,OAAO,KAAK,SAAS,IAAI,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7E,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5D,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5D,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5D,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAe,EAAE,KAAgB;IAC1D,IAAI,IAAI,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,UAAU;IACrB,wDAAwD;IACxC,IAAI,CAAW;IAE/B;;;;;;OAMG;IACa,QAAQ,GAAG,EAAE,CAAC;IAE9B;;;OAGG;IACH,YAAY,IAAc;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAgB;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACvE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5C,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAU;IACrB,iEAAiE;IACjD,MAAM,CAAa;IACnC,mCAAmC;IACnB,KAAK,CAAY;IACjC,sEAAsE;IACtD,MAAM,CAAY;IAClC,gGAAgG;IAChF,WAAW,CAAsB;IAEjD;;;;;;OAMG;IACH,YACE,MAAkB,EAClB,KAAgB,EAChB,MAAiB,EACjB,WAAqB;QAErB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;IACpF,CAAC;IAED;;;;OAIG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;IAClC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,OAAO,CACnB,MAAkB,EAClB,KAAgB,EAChB,MAAiB,EACjB,WAAqB;QAErB,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9D,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;YACjB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,QAAQ;QACb,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACI,OAAO;QACZ,IAAI,CAAC;YACH,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,OAAO,CAAC,GAAG,KAAmB;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAiB;IACxD,KAAK,CAAC,QAAQ,EAAE,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QAChD,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI;YACjB,KAAK;YACL,KAAK,CAAC,IAAI;YACV,KAAK,CAAC,IAAI,CAAC,MAAM;YACjB,IAAI;YACJ,IAAI,CAAC,QAAQ;YACb,IAAI,CAAC,QAAQ;SACd,EAAE,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5B,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAChE,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,mBAAmB,CAAC,KAAiB;IACnD,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,SAAS,CAAC,0DAA0D,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,SAAS,CAAC,mDAAmD,CAAC,CAAC;IAC3E,CAAC;IACD,IACE,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI;QAC1C,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,EAC1C,CAAC;QACD,MAAM,IAAI,SAAS,CAAC,oDAAoD,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/order/conversion.d.ts

@@ -0,0 +1,43 @@
+import { ccc } from "@ckb-ccc/core";
+import { type ExchangeRatio, type ValueComponents } from "../utils/utils.js";
+import { Info } from "./info.js";
+import { Ratio } from "./ratio.js";
+/**
+ * Error thrown when an exact quote cannot be represented by the order ratio format.
+ */
+export declare class OrderConversionRepresentabilityError extends Error {
+    /** Creates a representability error with the default public conversion message. */
+    constructor(message?: string, options?: ErrorOptions);
+}
+/**
+ * Quotes a new order: the output-side amount, the CKB fee, and the order info.
+ *
+ * @remarks
+ * The returned `Info` preserves the quoted amount after fee adjustment so the
+ * minted order records the executable limit price.
+ */
+export declare function quoteConversion(isCkb2Udt: boolean, midpoint: ExchangeRatio, amounts: ValueComponents, options?: {
+    fee?: ccc.Num;
+    feeBase?: ccc.Num;
+}): {
+    convertedAmount: ccc.FixedPoint;
+    ckbFee: ccc.FixedPoint;
+    info: Info;
+};
+/**
+ * The ratio that reproduces the quote exactly: the greatest Uint64 fraction at most
+ * `quotedOutput / inputAmount`, which must still round the input up to the quoted output.
+ */
+export declare function quotePreservingRatio(inputAmount: ccc.FixedPoint, quotedOutput: ccc.FixedPoint, isCkb2Udt: boolean): Ratio;
+/**
+ * The greatest fraction at most `numerator / denominator` whose terms are at most
+ * `maxTerm`, reduced. It walks the continued fraction's convergents while they fit; the
+ * first that does not is replaced by the largest semiconvergent the bound allows, which
+ * is closer to the target than the last fitting convergent on the same side of it. Every
+ * other convergent lands above the target and is skipped.
+ */
+export declare function greatestBoundedFractionAtMost(numerator: bigint, denominator: bigint, maxTerm: bigint): {
+    numerator: bigint;
+    denominator: bigint;
+};
+//# sourceMappingURL=conversion.d.ts.map

package/dist/order/conversion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conversion.d.ts","sourceRoot":"","sources":["../../src/order/conversion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAGL,KAAK,aAAa,EAClB,KAAK,eAAe,EACrB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAInC;;GAEG;AACH,qBAAa,oCAAqC,SAAQ,KAAK;IAC7D,mFAAmF;IACnF,YACE,OAAO,SAAiE,EACxE,OAAO,CAAC,EAAE,YAAY,EAIvB;CACF;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,OAAO,EAClB,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,eAAe,EACxB,OAAO,CAAC,EAAE;IACR,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;IACd,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;CACnB,GACA;IAAE,eAAe,EAAE,GAAG,CAAC,UAAU,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAwBzE;AAgCD;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,GAAG,CAAC,UAAU,EAC3B,YAAY,EAAE,GAAG,CAAC,UAAU,EAC5B,SAAS,EAAE,OAAO,GACjB,KAAK,CAuBP;AAED;;;;;;GAMG;AACH,wBAAgB,6BAA6B,CAC3C,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,MAAM,GACd;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CA+B5C"}

package/dist/order/conversion.js

@@ -0,0 +1,123 @@
+import { ccc } from "@ckb-ccc/core";
+import { ceilDiv, minBigInt, } from "../utils/utils.js";
+import { Info } from "./info.js";
+import { Ratio } from "./ratio.js";
+const maxUint64 = (1n << 64n) - 1n;
+/**
+ * Error thrown when an exact quote cannot be represented by the order ratio format.
+ */
+export class OrderConversionRepresentabilityError extends Error {
+    /** Creates a representability error with the default public conversion message. */
+    constructor(message = "Order conversion quote cannot be represented as Uint64 ratio", options) {
+        super(message, options);
+        this.name = "OrderConversionRepresentabilityError";
+    }
+}
+/**
+ * Quotes a new order: the output-side amount, the CKB fee, and the order info.
+ *
+ * @remarks
+ * The returned `Info` preserves the quoted amount after fee adjustment so the
+ * minted order records the executable limit price.
+ */
+export function quoteConversion(isCkb2Udt, midpoint, amounts, options) {
+    const fee = options?.fee ?? 0n;
+    // Generic denominator for callers that pass a fee without a scale; Stack's
+    // own default pair is owned publicly by the SDK, not by this entity.
+    const feeBase = options?.feeBase ?? 100000n;
+    const base = Ratio.from(midpoint);
+    const amount = isCkb2Udt ? amounts.ckbValue : amounts.udtValue;
+    const { aScale, bScale } = feeAdjustedScales(base, isCkb2Udt, fee, feeBase);
+    const convertedAmount = ceilDiv(amount * aScale, bScale);
+    let ckbFee = 0n;
+    if (amount > 0n && fee !== 0n) {
+        ckbFee = isCkb2Udt
+            ? amount - base.convert(false, convertedAmount, false)
+            : base.convert(false, amount, false) - convertedAmount;
+    }
+    // Every order this SDK creates carries the default minimum match, the one the bot's
+    // remainder rule is sized to.
+    const info = Info.create(isCkb2Udt, quotePreservingRatio(amount, convertedAmount, isCkb2Udt));
+    return { convertedAmount, ckbFee, info };
+}
+/** The direction's scales with the fee taken out of the output side, reduced. */
+function feeAdjustedScales(ratio, isCkb2Udt, fee, feeBase) {
+    if (fee < 0n) {
+        throw new Error("Fee cannot be negative");
+    }
+    if (feeBase <= 0n) {
+        throw new Error("Fee base must be positive");
+    }
+    if (fee >= feeBase) {
+        throw new Error("Fee too big relative to feeBase");
+    }
+    if (!ratio.isPopulated()) {
+        throw new Error("Invalid ExchangeRatio");
+    }
+    let { ckbScale: aScale, udtScale: bScale } = ratio;
+    if (!isCkb2Udt) {
+        [aScale, bScale] = [bScale, aScale];
+    }
+    aScale *= feeBase - fee;
+    bScale *= feeBase;
+    const divisor = ccc.gcd(aScale, bScale);
+    return { aScale: aScale / divisor, bScale: bScale / divisor };
+}
+/**
+ * The ratio that reproduces the quote exactly: the greatest Uint64 fraction at most
+ * `quotedOutput / inputAmount`, which must still round the input up to the quoted output.
+ */
+export function quotePreservingRatio(inputAmount, quotedOutput, isCkb2Udt) {
+    if (inputAmount < 0n || quotedOutput < 0n) {
+        throw new Error("Order conversion amounts cannot be negative");
+    }
+    if (inputAmount === 0n || quotedOutput === 0n) {
+        throw new OrderConversionRepresentabilityError("Order conversion quote must have positive input and output");
+    }
+    const { numerator, denominator } = greatestBoundedFractionAtMost(quotedOutput, inputAmount, maxUint64);
+    if (numerator <= 0n || (quotedOutput - 1n) * denominator >= inputAmount * numerator) {
+        throw new OrderConversionRepresentabilityError();
+    }
+    return Ratio.from({
+        ckbScale: isCkb2Udt ? numerator : denominator,
+        udtScale: isCkb2Udt ? denominator : numerator,
+    });
+}
+/**
+ * The greatest fraction at most `numerator / denominator` whose terms are at most
+ * `maxTerm`, reduced. It walks the continued fraction's convergents while they fit; the
+ * first that does not is replaced by the largest semiconvergent the bound allows, which
+ * is closer to the target than the last fitting convergent on the same side of it. Every
+ * other convergent lands above the target and is skipped.
+ */
+export function greatestBoundedFractionAtMost(numerator, denominator, maxTerm) {
+    let best = { numerator: 0n, denominator: 1n };
+    let [previousP, previousQ, p, q] = [0n, 1n, 1n, 0n];
+    let [n, d] = [numerator, denominator];
+    while (d !== 0n) {
+        const quotient = n / d;
+        let term = quotient;
+        if (p !== 0n) {
+            term = minBigInt(term, (maxTerm - previousP) / p);
+        }
+        if (q !== 0n) {
+            term = minBigInt(term, (maxTerm - previousQ) / q);
+        }
+        const candidate = {
+            numerator: term * p + previousP,
+            denominator: term * q + previousQ,
+        };
+        if (candidate.denominator > 0n &&
+            candidate.numerator * denominator <= candidate.denominator * numerator &&
+            candidate.numerator * best.denominator > best.numerator * candidate.denominator) {
+            best = candidate;
+        }
+        if (term < quotient) {
+            break;
+        }
+        [previousP, previousQ, p, q] = [p, q, candidate.numerator, candidate.denominator];
+        [n, d] = [d, n % d];
+    }
+    return best;
+}
+//# sourceMappingURL=conversion.js.map

package/dist/order/conversion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conversion.js","sourceRoot":"","sources":["../../src/order/conversion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EACL,OAAO,EACP,SAAS,GAGV,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,MAAM,SAAS,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAEnC;;GAEG;AACH,MAAM,OAAO,oCAAqC,SAAQ,KAAK;IAC7D,mFAAmF;IACnF,YACE,OAAO,GAAG,8DAA8D,EACxE,OAAsB;QAEtB,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,sCAAsC,CAAC;IACrD,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAkB,EAClB,QAAuB,EACvB,OAAwB,EACxB,OAGC;IAED,MAAM,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,EAAE,CAAC;IAC/B,2EAA2E;IAC3E,qEAAqE;IACrE,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,OAAO,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/D,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC5E,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,CAAC,CAAC;IACzD,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,IAAI,MAAM,GAAG,EAAE,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QAC9B,MAAM,GAAG,SAAS;YAChB,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,CAAC;YACtD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,eAAe,CAAC;IAC3D,CAAC;IAED,oFAAoF;IACpF,8BAA8B;IAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CACtB,SAAS,EACT,oBAAoB,CAAC,MAAM,EAAE,eAAe,EAAE,SAAS,CAAC,CACzD,CAAC;IACF,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED,iFAAiF;AACjF,SAAS,iBAAiB,CACxB,KAAY,EACZ,SAAkB,EAClB,GAAY,EACZ,OAAgB;IAEhB,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,OAAO,IAAI,EAAE,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACrD,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACnD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,IAAI,OAAO,GAAG,GAAG,CAAC;IACxB,MAAM,IAAI,OAAO,CAAC;IAClB,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,EAAE,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,WAA2B,EAC3B,YAA4B,EAC5B,SAAkB;IAElB,IAAI,WAAW,GAAG,EAAE,IAAI,YAAY,GAAG,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,WAAW,KAAK,EAAE,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,oCAAoC,CAC5C,4DAA4D,CAC7D,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,6BAA6B,CAC9D,YAAY,EACZ,WAAW,EACX,SAAS,CACV,CAAC;IACF,IAAI,SAAS,IAAI,EAAE,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC,GAAG,WAAW,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;QACpF,MAAM,IAAI,oCAAoC,EAAE,CAAC;IACnD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC;QAChB,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW;QAC7C,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;KAC9C,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,6BAA6B,CAC3C,SAAiB,EACjB,WAAmB,EACnB,OAAe;IAEf,IAAI,IAAI,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;IAC9C,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACtC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACb,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACb,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,SAAS,GAAG;YAChB,SAAS,EAAE,IAAI,GAAG,CAAC,GAAG,SAAS;YAC/B,WAAW,EAAE,IAAI,GAAG,CAAC,GAAG,SAAS;SAClC,CAAC;QACF,IACE,SAAS,CAAC,WAAW,GAAG,EAAE;YAC1B,SAAS,CAAC,SAAS,GAAG,WAAW,IAAI,SAAS,CAAC,WAAW,GAAG,SAAS;YACtE,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,WAAW,EAC/E,CAAC;YACD,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YACpB,MAAM;QACR,CAAC;QACD,CAAC,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,SAAS,EAAE,SAAS,CAAC,WAAW,CAAC,CAAC;QAClF,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/order/fee.d.ts

@@ -0,0 +1,9 @@
+import { ccc } from "@ckb-ccc/core";
+import type { OrderGroup } from "./cells.js";
+/**
+ * The mining fee one more matched order adds to a prepared transaction at the fee rate
+ * (shannons per thousand bytes): its input, its replacement output with data, and its
+ * empty witness, sized for the largest order of the pool.
+ */
+export declare function partialOrderFee(orderPool: OrderGroup[], feeRate: ccc.Num): bigint;
+//# sourceMappingURL=fee.d.ts.map

package/dist/order/fee.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fee.d.ts","sourceRoot":"","sources":["../../src/order/fee.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAe7C;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,GAAG,GAAG,MAAM,CAOjF"}

package/dist/order/fee.js

@@ -0,0 +1,24 @@
+import { ccc } from "@ckb-ccc/core";
+import { ceilDiv } from "../utils/utils.js";
+const CELL_INPUT_SERIALIZED_SIZE = 44;
+// CellOutput table/script wrappers plus DynVec offset; output data Bytes plus offset.
+const CELL_OUTPUT_SERIALIZATION_OVERHEAD = 60;
+const OUTPUT_DATA_SERIALIZATION_OVERHEAD = 8;
+// The supported SDK completion prepares a later signer witness, inserting one
+// empty witness-vector entry for each preceding order input.
+const EMPTY_WITNESS_SERIALIZATION_SIZE = 8;
+const PREPARED_PARTIAL_SERIALIZATION_OVERHEAD = CELL_INPUT_SERIALIZED_SIZE +
+    CELL_OUTPUT_SERIALIZATION_OVERHEAD +
+    OUTPUT_DATA_SERIALIZATION_OVERHEAD +
+    EMPTY_WITNESS_SERIALIZATION_SIZE;
+/**
+ * The mining fee one more matched order adds to a prepared transaction at the fee rate
+ * (shannons per thousand bytes): its input, its replacement output with data, and its
+ * empty witness, sized for the largest order of the pool.
+ */
+export function partialOrderFee(orderPool, feeRate) {
+    const orderSize = orderPool.reduce((largest, group) => Math.max(largest, group.order.cell.occupiedSize), 0);
+    const bytes = ccc.numFrom(orderSize + PREPARED_PARTIAL_SERIALIZATION_OVERHEAD);
+    return ceilDiv(bytes * feeRate, 1000n);
+}
+//# sourceMappingURL=fee.js.map

package/dist/order/fee.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fee.js","sourceRoot":"","sources":["../../src/order/fee.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAG5C,MAAM,0BAA0B,GAAG,EAAE,CAAC;AACtC,sFAAsF;AACtF,MAAM,kCAAkC,GAAG,EAAE,CAAC;AAC9C,MAAM,kCAAkC,GAAG,CAAC,CAAC;AAC7C,8EAA8E;AAC9E,6DAA6D;AAC7D,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAC3C,MAAM,uCAAuC,GAC3C,0BAA0B;IAC1B,kCAAkC;IAClC,kCAAkC;IAClC,gCAAgC,CAAC;AAEnC;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,SAAuB,EAAE,OAAgB;IACvE,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAChC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,EACpE,CAAC,CACF,CAAC;IACF,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,GAAG,uCAAuC,CAAC,CAAC;IAC/E,OAAO,OAAO,CAAC,KAAK,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC;AACzC,CAAC"}