@ickb/sdk 9000.0.1 → 9001.0.0

package/dist/utils/chain.js

@@ -1,20 +1,2 @@
-/** The immutable canonical identity of each supported chain. */
-export const chainIdentities = Object.freeze({
-    mainnet: Object.freeze({
-        chain: "mainnet",
-        networkName: "ckb",
-        genesisHash: "0x92b197aa1fba0f63633922c61c92375c9c074a93e85963554f5499fe1450d0e5",
-        genesisMessage: "lina 0x18e020f6b1237a3d06b75121f25a7efa0550e4b3f44f974822f471902424c104",
-        genesisSource: "https://raw.githubusercontent.com/nervosnetwork/ckb/develop/resource/specs/mainnet.toml",
-        addressPrefix: "ckb",
-    }),
-    testnet: Object.freeze({
-        chain: "testnet",
-        networkName: "ckb_testnet",
-        genesisHash: "0x10639e0895502b5688a6be8cf69460d76541bfa4821629d86d62ba0aae3f9606",
-        genesisMessage: "aggron-v4",
-        genesisSource: "https://raw.githubusercontent.com/nervosnetwork/ckb/develop/resource/specs/testnet.toml",
-        addressPrefix: "ckt",
-    }),
-});
+export {};
 //# sourceMappingURL=chain.js.map

package/dist/utils/chain.js.map

@@ -1 +1 @@
-{"version":3,"file":"chain.js","sourceRoot":"","sources":["../../src/utils/chain.ts"],"names":[],"mappings":"AAqBA,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3C,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;QACrB,KAAK,EAAE,SAAS;QAChB,WAAW,EAAE,KAAK;QAClB,WAAW,EAAE,oEAAoE;QACjF,cAAc,EACZ,yEAAyE;QAC3E,aAAa,EACX,yFAAyF;QAC3F,aAAa,EAAE,KAAK;KACrB,CAAC;IACF,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;QACrB,KAAK,EAAE,SAAS;QAChB,WAAW,EAAE,aAAa;QAC1B,WAAW,EAAE,oEAAoE;QACjF,cAAc,EAAE,WAAW;QAC3B,aAAa,EACX,yFAAyF;QAC3F,aAAa,EAAE,KAAK;KACrB,CAAC;CACsD,CAAC,CAAC"}
+{"version":3,"file":"chain.js","sourceRoot":"","sources":["../../src/utils/chain.ts"],"names":[],"mappings":""}

package/dist/utils/codec.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../src/utils/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;GAOG;AACH,eAAO,MAAM,cAAc,qCAmBzB,CAAC;AAEH,iDAAiD;AACjD,eAAO,MAAM,YAAY,qCAAmB,CAAC;AAE7C,gEAAgE;AAChE,eAAO,MAAM,eAAe,qCAAmB,CAAC;AAEhD,gEAAgE;AAChE,eAAO,MAAM,eAAe,qCAAmB,CAAC;AAEhD,iEAAiE;AACjE,eAAO,MAAM,gBAAgB,qCAAoB,CAAC"}
+{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../src/utils/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;GAOG;AACH,eAAO,MAAM,cAAc,qCAmBzB,CAAC;AAMH,iDAAiD;AACjD,eAAO,MAAM,YAAY,qCAAmB,CAAC;AAE7C,gEAAgE;AAChE,eAAO,MAAM,eAAe,qCAAmB,CAAC;AAEhD,gEAAgE;AAChE,eAAO,MAAM,eAAe,qCAAmB,CAAC;AAEhD,iEAAiE;AACjE,eAAO,MAAM,gBAAgB,qCAAoB,CAAC"}

package/dist/utils/codec.js

@@ -24,6 +24,9 @@ export const CheckedInt32LE = ccc.Codec.from({
         return new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength).getInt32(0, true);
     },
 });
+// CCC's unsigned codecs throw on overflow but encode a negative as its two's complement
+// without a word, and `Ratio.toBytes()` is public and skips `validate`, so these checked
+// codecs keep "never encode a negative" in one place; CCC has no signed Int32 codec at all.
 /** Checked codec for 8-bit unsigned integers. */
 export const CheckedUint8 = checkedUintLE(1);
 /** Checked codec for little-endian 32-bit unsigned integers. */

package/dist/utils/codec.js.map

@@ -1 +1 @@
-{"version":3,"file":"codec.js","sourceRoot":"","sources":["../../src/utils/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAsB;IAChE,UAAU,EAAE,CAAC;IACb,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE;QAClB,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,UAAU,GAAG,CAAC,WAAW,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACvC,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,QAAQ,CAC5E,CAAC,EACD,IAAI,CACL,CAAC;IACJ,CAAC;CACF,CAAC,CAAC;AAEH,iDAAiD;AACjD,MAAM,CAAC,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAE7C,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAEhD,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAEhD,iEAAiE;AACjE,MAAM,CAAC,MAAM,gBAAgB,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;AAElD,SAAS,aAAa,CAAC,UAAkB;IACvC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,CAAC,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC;IACnC,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QACpB,UAAU;QACV,MAAM,EAAE,CAAC,OAAoB,EAAE,EAAE;YAC/B,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,GAAG,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,sBAAsB,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACpE,CAAC;YACD,OAAO,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC3C,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,YAAY;KACzB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAoB;IAC5C,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,SAAS,CAAC,uCAAuC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,IAAI,CAAC;QACH,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC"}
+{"version":3,"file":"codec.js","sourceRoot":"","sources":["../../src/utils/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAsB;IAChE,UAAU,EAAE,CAAC;IACb,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE;QAClB,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,UAAU,GAAG,CAAC,WAAW,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACvC,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,QAAQ,CAC5E,CAAC,EACD,IAAI,CACL,CAAC;IACJ,CAAC;CACF,CAAC,CAAC;AAEH,wFAAwF;AACxF,yFAAyF;AACzF,4FAA4F;AAE5F,iDAAiD;AACjD,MAAM,CAAC,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAE7C,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAEhD,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAEhD,iEAAiE;AACjE,MAAM,CAAC,MAAM,gBAAgB,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;AAElD,SAAS,aAAa,CAAC,UAAkB;IACvC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,CAAC,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC;IACnC,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QACpB,UAAU;QACV,MAAM,EAAE,CAAC,OAAoB,EAAE,EAAE;YAC/B,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,GAAG,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,sBAAsB,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACpE,CAAC;YACD,OAAO,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC3C,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,YAAY;KACzB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAoB;IAC5C,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,SAAS,CAAC,uCAAuC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,IAAI,CAAC;QACH,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC"}

package/dist/utils/utils.d.ts

@@ -7,28 +7,25 @@ import { ccc } from "@ckb-ccc/core";
  */
 export declare const defaultCellPageSize = 400;
 /**
- * Reads every committed cell matching the key, page by page, without touching
- * CCC's cell cache. The scan ends on the first short page.
- *
- * @remarks A full page must advance the cursor; otherwise the read throws so a faulty
- * endpoint in the app's public node pool cannot keep the scan looping forever.
- * The cursor continues ordering, not a coherent snapshot. There is no aggregate budget:
- * a large book costs a slower read rather than a partial result.
+ * A CCC client cache sized for a whole pool: 4096 headers and 4096 transaction bodies,
+ * where CCC's defaults keep 128 and 256 (SDK README, Account state). An LRU fills only as
+ * far as the book and pool need.
  */
-export declare function findCells(client: ccc.Client, keyLike: ccc.ClientIndexerSearchKeyLike): Promise<ccc.Cell[]>;
+export declare function clientCache(): ccc.ClientCacheMemory;
+/** A committed cell and the block the node names for its creating transaction. */
+export interface ScannedCell {
+    cell: ccc.Cell;
+    blockNumber: ccc.Num;
+}
 /**
- * Local transaction inclusion metadata.
+ * Reads every committed cell matching the key with the block the node names for it, page
+ * by page through the raw requestor (CCC's typed scan drops the block), bypassing CCC's
+ * cell cache. A full page whose cursor does not advance throws. Why: SDK README, Account
+ * state.
  */
-export interface TransactionHeader {
-    /**
-     * The block header used for inclusion-dependent calculations.
-     */
-    header: ccc.ClientBlockHeader;
-    /**
-     * The transaction hash when the caller has resolved it for the header.
-     */
-    txHash?: ccc.Hex;
-}
+export declare function findCells(client: ccc.Client, keyLike: ccc.ClientIndexerSearchKeyLike): Promise<ScannedCell[]>;
+/** The headers of a batch of block numbers, each read once; every block must exist. */
+export declare function headersByNumber(client: ccc.Client, blockNumbers: Iterable<ccc.Num>): Promise<Map<ccc.Num, ccc.ClientBlockHeader>>;
 /**
  * CKB and UDT amounts carried by a cell, order, or planned value.
  */
@@ -73,36 +70,12 @@ export interface ScriptDeps {
  */
 export declare function isPlainCapacityCell(cell: ccc.Cell): boolean;
 /**
- * Performs asynchronously a binary search to find the smallest index `i` in the range [0, n)
- * such that the function `f(i)` returns true. It is assumed that for the range
- * [0, n), if `f(i)` is true, then `f(i+1)` is also true. This means that there
- * is a prefix of the input range where `f` is false, followed by a suffix where
- * `f` is true. If no such index exists, the function returns `n`.
- *
- * The function `f` is only called for indices in the range [0, n).
- *
- * @param n - The non-negative integer upper bound of the search range (exclusive).
- * @param f - An async function that takes an index `i` and returns a boolean value.
- * @returns The smallest index `i` such that `f(i)` is true, or `n` if no such index exists.
- *
- * @remarks Adapted from Go's standard library search implementation:
- * {@link https://go.dev/src/sort/search.go}
- */
-export declare function asyncBinarySearch(n: number, f: (i: number) => Promise<boolean>): Promise<number>;
-/**
- * The client's JSON-RPC requestor, when it has one. The connector hands the interface a
+ * The client's JSON-RPC requestor, which the SDK's raw reads need: scans with block
+ * numbers, status polls and transaction proofs. The connector hands the interface a
  * composition proxy over the public client (`ClientWithFeeRate`, a `ccc.Client` but not a
  * `ccc.ClientJsonRpc`), so `instanceof` misses it; the proxy forwards the property.
  */
-export declare function jsonRpcRequestor(client: ccc.Client): ccc.RequestorJsonRpc | undefined;
-/** A node's raw `get_transaction` status record (verbosity 1), the fields the stack reads. */
-export declare function rawTransactionStatus(response: unknown): {
-    status: string | undefined;
-    reason: string | undefined;
-    blockNumber: ccc.Num | undefined;
-};
-export declare function minBigInt(left: bigint, right: bigint): bigint;
-export declare function maxBigInt(left: bigint, right: bigint): bigint;
+export declare function jsonRpcRequestor(client: ccc.Client): ccc.RequestorJsonRpc;
 /** `numerator / denominator` rounded up; the denominator is positive. */
 export declare function ceilDiv(numerator: bigint, denominator: bigint): bigint;
 /**

package/dist/utils/utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/utils/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC;;;;;;;;GAQG;AACH,wBAAsB,SAAS,CAC7B,MAAM,EAAE,GAAG,CAAC,MAAM,EAClB,OAAO,EAAE,GAAG,CAAC,0BAA0B,GACtC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAoBrB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,MAAM,EAAE,GAAG,CAAC,iBAAiB,CAAC;IAE9B;;OAEG;IACH,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,6CAA6C;IAC7C,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;IAEzB,6CAA6C;IAC7C,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;CAC1B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,2CAA2C;IAC3C,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC;IAElB,2CAA2C;IAC3C,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC;IAEnB;;OAEG;IACH,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,OAAO,CAE3D;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAsB,iBAAiB,CACrC,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,OAAO,CAAC,GACjC,OAAO,CAAC,MAAM,CAAC,CAejB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,gBAAgB,GAAG,SAAS,CAMrF;AAED,8FAA8F;AAC9F,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,OAAO,GAAG;IACvD,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,WAAW,EAAE,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC;CAClC,CAmBA;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,yEAAyE;AACzE,wBAAgB,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAEtE;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUjE;AAED;;;;;;;;;;GAUG;AACH,wBAAiB,MAAM,CAAC,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAS9E"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/utils/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAGpC;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC;;;;GAIG;AACH,wBAAgB,WAAW,IAAI,GAAG,CAAC,iBAAiB,CAEnD;AAED,kFAAkF;AAClF,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC;IACf,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC;CACtB;AAED;;;;;GAKG;AACH,wBAAsB,SAAS,CAC7B,MAAM,EAAE,GAAG,CAAC,MAAM,EAClB,OAAO,EAAE,GAAG,CAAC,0BAA0B,GACtC,OAAO,CAAC,WAAW,EAAE,CAAC,CA+BxB;AAED,uFAAuF;AACvF,wBAAsB,eAAe,CACnC,MAAM,EAAE,GAAG,CAAC,MAAM,EAClB,YAAY,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAc9C;AAaD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,6CAA6C;IAC7C,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;IAEzB,6CAA6C;IAC7C,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;CAC1B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,2CAA2C;IAC3C,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC;IAElB,2CAA2C;IAC3C,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC;IAEnB;;OAEG;IACH,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,OAAO,CAE3D;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAMzE;AAED,yEAAyE;AACzE,wBAAgB,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAEtE;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUjE;AAED;;;;;;;;;;GAUG;AACH,wBAAiB,MAAM,CAAC,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAS9E"}

package/dist/utils/utils.js

@@ -1,4 +1,5 @@
 import { ccc } from "@ckb-ccc/core";
+import { cccA } from "@ckb-ccc/core/advanced";
 /**
  * The default page size used when querying cells from the chain.
  *
@@ -7,30 +8,63 @@ import { ccc } from "@ckb-ccc/core";
  */
 export const defaultCellPageSize = 400;
 /**
- * Reads every committed cell matching the key, page by page, without touching
- * CCC's cell cache. The scan ends on the first short page.
- *
- * @remarks A full page must advance the cursor; otherwise the read throws so a faulty
- * endpoint in the app's public node pool cannot keep the scan looping forever.
- * The cursor continues ordering, not a coherent snapshot. There is no aggregate budget:
- * a large book costs a slower read rather than a partial result.
+ * A CCC client cache sized for a whole pool: 4096 headers and 4096 transaction bodies,
+ * where CCC's defaults keep 128 and 256 (SDK README, Account state). An LRU fills only as
+ * far as the book and pool need.
+ */
+export function clientCache() {
+    return new ccc.ClientCacheMemory(512, 4096, 4096);
+}
+/**
+ * Reads every committed cell matching the key with the block the node names for it, page
+ * by page through the raw requestor (CCC's typed scan drops the block), bypassing CCC's
+ * cell cache. A full page whose cursor does not advance throws. Why: SDK README, Account
+ * state.
  */
 export async function findCells(client, keyLike) {
-    const key = ccc.ClientIndexerSearchKey.from(keyLike);
+    const requestor = jsonRpcRequestor(client);
+    const key = cccA.JsonRpcTransformers.indexerSearchKeyFrom(keyLike);
     const cells = [];
     let after;
     for (;;) {
-        const page = await client.findCellsPagedNoCache(key, "asc", defaultCellPageSize, after);
-        cells.push(...page.cells);
-        if (page.cells.length < defaultCellPageSize) {
+        // eslint-disable-next-line @typescript-eslint/no-unsafe-type-assertion, no-restricted-syntax -- the node's indexer answer, parsed field by field below as CCC's own transformer does.
+        const page = (await requestor.request("get_cells", [
+            key,
+            "asc",
+            ccc.numToHex(defaultCellPageSize),
+            after,
+        ]));
+        for (const object of page.objects) {
+            cells.push({
+                cell: ccc.Cell.from({
+                    outPoint: cccA.JsonRpcTransformers.outPointTo(object.out_point),
+                    cellOutput: cccA.JsonRpcTransformers.cellOutputTo(object.output),
+                    outputData: object.output_data ?? "0x",
+                }),
+                blockNumber: ccc.numFrom(object.block_number),
+            });
+        }
+        if (page.objects.length < defaultCellPageSize) {
             return cells;
         }
-        if (page.lastCursor === after) {
+        if (page.last_cursor === after) {
             throw new Error("Cell scan cursor did not advance");
         }
-        after = page.lastCursor;
+        after = page.last_cursor;
     }
 }
+/** The headers of a batch of block numbers, each read once; every block must exist. */
+export async function headersByNumber(client, blockNumbers) {
+    const distinct = [...new Set(blockNumbers)];
+    const headers = await Promise.all(distinct.map(async (blockNumber) => client.getHeaderByNumber(blockNumber)));
+    return new Map(distinct.map((blockNumber, index) => {
+        const header = headers[index];
+        if (header === undefined) {
+            throw new Error(`Header not found for block number ${String(blockNumber)}`);
+        }
+        return [blockNumber, header];
+    }));
+}
 /**
  * True when a cell has no type script and no data payload.
  *
@@ -42,72 +76,17 @@ export function isPlainCapacityCell(cell) {
     return cell.cellOutput.type === undefined && cell.outputData === "0x";
 }
 /**
- * Performs asynchronously a binary search to find the smallest index `i` in the range [0, n)
- * such that the function `f(i)` returns true. It is assumed that for the range
- * [0, n), if `f(i)` is true, then `f(i+1)` is also true. This means that there
- * is a prefix of the input range where `f` is false, followed by a suffix where
- * `f` is true. If no such index exists, the function returns `n`.
- *
- * The function `f` is only called for indices in the range [0, n).
- *
- * @param n - The non-negative integer upper bound of the search range (exclusive).
- * @param f - An async function that takes an index `i` and returns a boolean value.
- * @returns The smallest index `i` such that `f(i)` is true, or `n` if no such index exists.
- *
- * @remarks Adapted from Go's standard library search implementation:
- * {@link https://go.dev/src/sort/search.go}
- */
-export async function asyncBinarySearch(n, f) {
-    // Define f(-1) == false and f(n) == true.
-    // Invariant: f(i-1) == false, f(j) == true.
-    let [i, j] = [0, n];
-    while (i < j) {
-        const h = Math.trunc((i + j) / 2);
-        // i ≤ h < j
-        if (!(await f(h))) {
-            i = h + 1; // preserves f(i-1) == false
-        }
-        else {
-            j = h; // preserves f(j) == true
-        }
-    }
-    // i == j, f(i-1) == false, and f(j) (= f(i)) == true  =>  answer is i.
-    return i;
-}
-/**
- * The client's JSON-RPC requestor, when it has one. The connector hands the interface a
+ * The client's JSON-RPC requestor, which the SDK's raw reads need: scans with block
+ * numbers, status polls and transaction proofs. The connector hands the interface a
  * composition proxy over the public client (`ClientWithFeeRate`, a `ccc.Client` but not a
  * `ccc.ClientJsonRpc`), so `instanceof` misses it; the proxy forwards the property.
  */
 export function jsonRpcRequestor(client) {
-    if (!("requestor" in client)) {
-        return undefined;
+    const requestor = "requestor" in client ? client.requestor : undefined;
+    if (!(requestor instanceof ccc.RequestorJsonRpc)) {
+        throw new TypeError("The SDK needs a JSON-RPC client");
     }
-    const { requestor } = client;
-    return requestor instanceof ccc.RequestorJsonRpc ? requestor : undefined;
-}
-/** A node's raw `get_transaction` status record (verbosity 1), the fields the stack reads. */
-export function rawTransactionStatus(response) {
-    const record = typeof response === "object" &&
-        response !== null &&
-        "tx_status" in response &&
-        typeof response.tx_status === "object" &&
-        response.tx_status !== null
-        ? response.tx_status
-        : {};
-    return {
-        status: "status" in record && typeof record.status === "string" ? record.status : undefined,
-        reason: "reason" in record && typeof record.reason === "string" ? record.reason : undefined,
-        blockNumber: "block_number" in record && typeof record.block_number === "string"
-            ? ccc.numFrom(record.block_number)
-            : undefined,
-    };
-}
-export function minBigInt(left, right) {
-    return left < right ? left : right;
-}
-export function maxBigInt(left, right) {
-    return left > right ? left : right;
+    return requestor;
 }
 /** `numerator / denominator` rounded up; the denominator is positive. */
 export function ceilDiv(numerator, denominator) {

package/dist/utils/utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/utils/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,MAAkB,EAClB,OAAuC;IAEvC,MAAM,GAAG,GAAG,GAAG,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,KAAyB,CAAC;IAC9B,SAAS,CAAC;QACR,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,qBAAqB,CAC7C,GAAG,EACH,KAAK,EACL,mBAAmB,EACnB,KAAK,CACN,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC1B,CAAC;AACH,CAAC;AA0DD;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAc;IAChD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC;AACxE,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,CAAS,EACT,CAAkC;IAElC,0CAA0C;IAC1C,4CAA4C;IAC5C,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,YAAY;QACZ,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QACzC,CAAC;aAAM,CAAC;YACN,CAAC,GAAG,CAAC,CAAC,CAAC,yBAAyB;QAClC,CAAC;IACH,CAAC;IACD,uEAAuE;IACvE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAkB;IACjD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;IAC7B,OAAO,SAAS,YAAY,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3E,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,oBAAoB,CAAC,QAAiB;IAKpD,MAAM,MAAM,GACV,OAAO,QAAQ,KAAK,QAAQ;QAC5B,QAAQ,KAAK,IAAI;QACjB,WAAW,IAAI,QAAQ;QACvB,OAAO,QAAQ,CAAC,SAAS,KAAK,QAAQ;QACtC,QAAQ,CAAC,SAAS,KAAK,IAAI;QACzB,CAAC,CAAC,QAAQ,CAAC,SAAS;QACpB,CAAC,CAAC,EAAE,CAAC;IACT,OAAO;QACL,MAAM,EACJ,QAAQ,IAAI,MAAM,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;QACrF,MAAM,EACJ,QAAQ,IAAI,MAAM,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;QACrF,WAAW,EACT,cAAc,IAAI,MAAM,IAAI,OAAO,MAAM,CAAC,YAAY,KAAK,QAAQ;YACjE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC;YAClC,CAAC,CAAC,SAAS;KAChB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa;IACnD,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa;IACnD,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACrC,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,OAAO,CAAC,SAAiB,EAAE,WAAmB;IAC5D,OAAO,CAAC,SAAS,GAAG,WAAW,GAAG,EAAE,CAAC,GAAG,WAAW,CAAC;AACtD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,KAAa;IACvD,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,SAAS,CAAC,CAAC,MAAM,CAAuB,KAAkB;IAC9D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,CAAC,CAAC;QACV,CAAC;IACH,CAAC;AACH,CAAC"}
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/utils/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAE9C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;;;GAIG;AACH,MAAM,UAAU,WAAW;IACzB,OAAO,IAAI,GAAG,CAAC,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACpD,CAAC;AAQD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,MAAkB,EAClB,OAAuC;IAEvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,mBAAmB,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;IACnE,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,IAAI,KAAyB,CAAC;IAC9B,SAAS,CAAC;QACR,sLAAsL;QACtL,MAAM,IAAI,GAAG,CAAC,MAAM,SAAS,CAAC,OAAO,CAAC,WAAW,EAAE;YACjD,GAAG;YACH,KAAK;YACL,GAAG,CAAC,QAAQ,CAAC,mBAAmB,CAAC;YACjC,KAAK;SACN,CAAC,CAAiB,CAAC;QACpB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;oBAClB,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC;oBAC/D,UAAU,EAAE,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;oBAChE,UAAU,EAAE,MAAM,CAAC,WAAW,IAAI,IAAI;iBACvC,CAAC;gBACF,WAAW,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,uFAAuF;AACvF,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAkB,EAClB,YAA+B;IAE/B,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC,CAC3E,CAAC;IACF,OAAO,IAAI,GAAG,CACZ,QAAQ,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC,CAAC,CACH,CAAC;AACJ,CAAC;AAsDD;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAc;IAChD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC;AACxE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAkB;IACjD,MAAM,SAAS,GAAG,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IACvE,IAAI,CAAC,CAAC,SAAS,YAAY,GAAG,CAAC,gBAAgB,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,OAAO,CAAC,SAAiB,EAAE,WAAmB;IAC5D,OAAO,CAAC,SAAS,GAAG,WAAW,GAAG,EAAE,CAAC,GAAG,WAAW,CAAC;AACtD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,KAAa;IACvD,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,SAAS,CAAC,CAAC,MAAM,CAAuB,KAAkB;IAC9D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,CAAC,CAAC;QACV,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/utils/verified_client.d.ts

@@ -0,0 +1,19 @@
+import { ccc } from "@ckb-ccc/core";
+/**
+ * Wraps `inner` into a client that checks the reads the SDK makes: every header it hands
+ * out against the header's own hash, a header read by number against the number asked
+ * for, a transaction read by hash against the hash of its body, and a cell against the
+ * body of its creating transaction. Other reads pass through unchecked; the cell
+ * beside `getCellWithHeader`'s header is one, since the SDK reads only its header.
+ *
+ * @remarks It wraps the client, not the SDK's readers, because CCC's own DAO valuation
+ * (`Cell.getNervosDaoInfo`, in the send) reads headers through the client it is given.
+ * Why each check exists: SDK README, Account state.
+ */
+export declare function verifiedClient(inner: ccc.Client): ccc.Client;
+/**
+ * The hash of a header as the chain computes it: blake2b over the header struct, each
+ * number little-endian, in declaration order, the nonce last.
+ */
+export declare function headerHash(header: ccc.ClientBlockHeader): ccc.Hex;
+//# sourceMappingURL=verified_client.d.ts.map

package/dist/utils/verified_client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verified_client.d.ts","sourceRoot":"","sources":["../../src/utils/verified_client.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAE5D;AAqGD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,iBAAiB,GAAG,GAAG,CAAC,GAAG,CAejE"}

package/dist/utils/verified_client.js

@@ -0,0 +1,92 @@
+import { ccc } from "@ckb-ccc/core";
+/**
+ * Wraps `inner` into a client that checks the reads the SDK makes: every header it hands
+ * out against the header's own hash, a header read by number against the number asked
+ * for, a transaction read by hash against the hash of its body, and a cell against the
+ * body of its creating transaction. Other reads pass through unchecked; the cell
+ * beside `getCellWithHeader`'s header is one, since the SDK reads only its header.
+ *
+ * @remarks It wraps the client, not the SDK's readers, because CCC's own DAO valuation
+ * (`Cell.getNervosDaoInfo`, in the send) reads headers through the client it is given.
+ * Why each check exists: SDK README, Account state.
+ */
+export function verifiedClient(inner) {
+    return new VerifiedClient(inner);
+}
+// @ts-expect-error TS2655: the abstract members are forwarded by the proxy at runtime, as in CCC's own connector.
+class VerifiedClient extends ccc.Proxy.Base(ccc.Client) {
+    static [ccc.Proxy.localKeys] = ["bodies"];
+    /** Creating transactions `getCell` read, so concurrent reads of one share a request. */
+    bodies = new Map();
+    async getTipHeader() {
+        return verified(await this[ccc.Proxy.inner].getTipHeader());
+    }
+    async getHeaderByNumber(...args) {
+        const header = ccc.apply(verified, await this[ccc.Proxy.inner].getHeaderByNumber(...args));
+        const number = ccc.numFrom(args[0]);
+        if (header !== undefined && header.number !== number) {
+            throw new Error(`Header ${header.hash} answers for block ${number.toString()}`);
+        }
+        return header;
+    }
+    async getTransaction(...args) {
+        return verifiedBody(await this[ccc.Proxy.inner].getTransaction(...args), args[0]);
+    }
+    /**
+     * The output of the verified creating transaction, cache first: CCC keys cached
+     * transactions by their body's hash, and its own `getCell` would build the cell from a
+     * read this wrapper never sees, then cache it.
+     */
+    async getCell(...args) {
+        const outPoint = ccc.OutPoint.from(args[0]);
+        const { txHash } = outPoint;
+        let body = this.bodies.get(txHash);
+        if (body === undefined) {
+            body = this.readBody(txHash);
+            this.bodies.set(txHash, body);
+        }
+        const output = (await body)?.transaction.getOutput(outPoint.index);
+        return output === undefined
+            ? undefined
+            : ccc.Cell.from({
+                outPoint,
+                cellOutput: output.cellOutput,
+                outputData: output.outputData,
+            });
+    }
+    async readBody(txHash) {
+        // CCC's own cache keys bodies by their hash, but a consumer's cache need not.
+        return (verifiedBody(await this.cache.getTransactionResponse(txHash), txHash) ??
+            (await this.getTransaction(txHash)));
+    }
+    async getCellWithHeader(...args) {
+        const result = await this[ccc.Proxy.inner].getCellWithHeader(...args);
+        ccc.apply(verified, result?.header);
+        return result;
+    }
+}
+/** The response when its body hashes to the hash asked for, else throws. */
+function verifiedBody(response, txHash) {
+    const asked = ccc.hexFrom(txHash);
+    if (response !== undefined && response.transaction.hash() !== asked) {
+        throw new Error(`Transaction ${asked} was answered with a body of another hash`);
+    }
+    return response;
+}
+/** The header when its fields hash to the hash it carries, else throws. */
+function verified(header) {
+    const computed = headerHash(header);
+    if (computed !== header.hash) {
+        throw new Error(`Header ${header.hash} carries the fields of ${computed}`);
+    }
+    return header;
+}
+/**
+ * The hash of a header as the chain computes it: blake2b over the header struct, each
+ * number little-endian, in declaration order, the nonce last.
+ */
+export function headerHash(header) {
+    const { dao } = header;
+    return ccc.hashCkb(ccc.numLeToBytes(header.version, 4), ccc.numLeToBytes(header.compactTarget, 4), ccc.numLeToBytes(header.timestamp, 8), ccc.numLeToBytes(header.number, 8), ccc.numLeToBytes(header.epoch.toNum(), 8), header.parentHash, header.transactionsRoot, header.proposalsHash, header.extraHash, ...[dao.c, dao.ar, dao.s, dao.u].map((field) => ccc.numLeToBytes(field, 8)), ccc.numLeToBytes(header.nonce, 16));
+}
+//# sourceMappingURL=verified_client.js.map

package/dist/utils/verified_client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verified_client.js","sourceRoot":"","sources":["../../src/utils/verified_client.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,KAAiB;IAC9C,OAAO,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,kHAAkH;AAClH,MAAM,cAAe,SAAQ,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IAC9C,MAAM,CAAU,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAE1D,wFAAwF;IACvE,MAAM,GAAG,IAAI,GAAG,EAG9B,CAAC;IAEY,KAAK,CAAC,YAAY;QAChC,OAAO,QAAQ,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9D,CAAC;IAEe,KAAK,CAAC,iBAAiB,CACrC,GAAG,IAAiD;QAEpD,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CACtB,QAAQ,EACR,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,CACvD,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEe,KAAK,CAAC,cAAc,CAClC,GAAG,IAA8C;QAEjD,OAAO,YAAY,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;IAED;;;;OAIG;IACa,KAAK,CAAC,OAAO,CAC3B,GAAG,IAAuC;QAE1C,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnE,OAAO,MAAM,KAAK,SAAS;YACzB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBACZ,QAAQ;gBACR,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;aAC9B,CAAC,CAAC;IACT,CAAC;IAEO,KAAK,CAAC,QAAQ,CACpB,MAAe;QAEf,8EAA8E;QAC9E,OAAO,CACL,YAAY,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;YACrE,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CACpC,CAAC;IACJ,CAAC;IAEe,KAAK,CAAC,iBAAiB,CACrC,GAAG,IAAiD;QAEpD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,CAAC;QACtE,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,4EAA4E;AAC5E,SAAS,YAAY,CACnB,QAAmD,EACnD,MAAmB;IAEnB,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;QACpE,MAAM,IAAI,KAAK,CAAC,eAAe,KAAK,2CAA2C,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,2EAA2E;AAC3E,SAAS,QAAQ,CAAC,MAA6B;IAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,QAAQ,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,CAAC,IAAI,0BAA0B,QAAQ,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,MAA6B;IACtD,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;IACvB,OAAO,GAAG,CAAC,OAAO,CAChB,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,EACnC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,EACzC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,EACrC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAClC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EACzC,MAAM,CAAC,UAAU,EACjB,MAAM,CAAC,gBAAgB,EACvB,MAAM,CAAC,aAAa,EACpB,MAAM,CAAC,SAAS,EAChB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAC3E,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CACnC,CAAC;AACJ,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ickb/sdk",
-  "version": "9000.0.1",
+  "version": "9001.0.0",
   "description": "iCKB SDK built on top of CCC",
   "keywords": [
     "ickb",
@@ -42,7 +42,7 @@
     "@ckb-ccc/core": "^1.23.0"
   },
   "devDependencies": {
-    "@ickb/testkit": "9000.0.0",
+    "@ickb/testkit": "9001.0.0",
     "@typescript/native-preview": "7.0.0-dev.20260707.2"
   },
   "scripts": {

package/src/constants.ts

@@ -41,31 +41,18 @@ const ORDER = ccc.Script.from({
   args: "0x",
 });
 
-/** Each network's code cells, given as direct code deps, and the dep group of the rest. */
+/**
+ * Each network's iCKB dep group: it carries every iCKB script's code cell, xUDT's and
+ * iCKB Logic's included, so one group dep resolves them all.
+ */
 const DEPLOYMENTS = {
   mainnet: {
-    udtCode: {
-      txHash: "0xc07844ce21b38e4b071dd0e1ee3b0e27afd8d7532491327f39b786343f558ab7",
-      index: 0,
-    },
-    logicCode: {
-      txHash: "0xd7309191381f5a8a2904b8a79958a9be2752dbba6871fa193dab6aeb29dc8f44",
-      index: 0,
-    },
     depGroup: {
       txHash: "0x621a6f38de3b9f453016780edac3b26bfcbfa3e2ecb47c2da275471a5d3ed165",
       index: 0,
     },
   },
   testnet: {
-    udtCode: {
-      txHash: "0xbf6fb538763efec2a70a6a3dcb7242787087e1030c4e7d86585bc63a9d337f5f",
-      index: 0,
-    },
-    logicCode: {
-      txHash: "0x9ac989b3355764f76cdce02c69dedb819fdfbcbda49a7db1a2c9facdfdb9a7fe",
-      index: 0,
-    },
     depGroup: {
       txHash: "0xf7ece4fb33d8378344cab11fcd6a4c6f382fd4207ac921cf5821f30712dcd311",
       index: 0,
@@ -73,11 +60,6 @@ const DEPLOYMENTS = {
   },
 } as const;
 
-/**
- * Plain CKB the bot keeps for its own cells and fees: its sizing line for matches and deposits.
- */
-export const CKB_RESERVE = ccc.fixedPointFrom(1000);
-
 /**
  * The managers of one network's iCKB deployment.
  *
@@ -89,13 +71,12 @@ export function getConfig(chain: SupportedChain): SdkManagers {
   if (!Object.hasOwn(DEPLOYMENTS, chain)) {
     throw new TypeError("unsupported iCKB network");
   }
-  const { udtCode, logicCode, depGroup } = DEPLOYMENTS[chain];
+  const { depGroup } = DEPLOYMENTS[chain];
   const cellDeps = [ccc.CellDep.from({ outPoint: depGroup, depType: "depGroup" })];
   const dao = { script: DAO, cellDeps };
   const ickbUdt = new IckbUdt({
-    code: udtCode,
     script: IckbUdt.typeScriptFrom(UDT, ICKB_LOGIC),
-    logicCode,
+    cellDeps,
     logicScript: ICKB_LOGIC,
     daoScript: DAO,
   });

package/src/conversion/estimate.ts

@@ -46,9 +46,7 @@ export function estimateConversionOrder(
  * This conservative proxy stays separate from partialOrderFee: the quote has no built
  * order whose serialized size could supply that fee yet.
  */
-export function estimateMaturityFeeThreshold(
-  system: Pick<SystemState, "feeRate">,
-): bigint {
+function estimateMaturityFeeThreshold(system: Pick<SystemState, "feeRate">): bigint {
   return 10n * system.feeRate;
 }
 

package/src/conversion/maturity.ts

@@ -4,12 +4,12 @@ import type { IckbDepositCell } from "../logic.ts";
 import type { OrderGroup } from "../order/cells.ts";
 import { fillsWhole } from "../order/fill.ts";
 import type { Info } from "../order/info.ts";
-import { convert, ICKB_DEPOSIT_CAP } from "../udt.ts";
-import { compareBigInt, type ValueComponents } from "../utils/utils.ts";
+import { ckbFromUdt, ICKB_DEPOSIT_CAP } from "../udt.ts";
+import { ceilDiv, compareBigInt, type ValueComponents } from "../utils/utils.ts";
 import type { MaturityOrderInput, SystemState } from "./types.ts";
 
 /**
- * Assumed turn duration, allowing for restart delay, confirmation and slow reads.
+ * Assumed turn duration: the bot's turns start ten minutes apart.
  * This is a modeling interval, not a bound on the runtime; see sdk/docs/pool_maturity_estimates.md.
  */
 export const BOT_TURN_MS = 10n * 60n * 1000n;
@@ -74,8 +74,8 @@ function ckbToIckbOrderMaturity(
     (udt, group) => udt + group.udtValue,
     0n,
   );
-  const demand = amount + buyersAhead - convert(false, sellers, system.exchangeRatio);
-  const capCkb = convert(false, ICKB_DEPOSIT_CAP, system.exchangeRatio);
+  const demand = amount + buyersAhead - ckbFromUdt(sellers, system.exchangeRatio);
+  const capCkb = ckbFromUdt(ICKB_DEPOSIT_CAP, system.exchangeRatio);
   const turns = demand > 0n ? 1n + demand / capCkb : 1n;
   return system.tip.timestamp + BOT_TURN_MS * turns;
 }
@@ -100,14 +100,14 @@ function ickbToCkbOrderMaturity(
   // The CKB an order has already received belongs to its earlier fills; what it still
   // needs is the remaining iCKB at its price.
   const needed =
-    info.udtToCkb.convert(false, amount, true) +
-    convert(false, sellersAhead, system.exchangeRatio);
+    ceilDiv(amount * info.udtToCkb.udtScale, info.udtToCkb.ckbScale) +
+    ckbFromUdt(sellersAhead, system.exchangeRatio);
   const taken = new Set(takenDeposits.map((deposit) => deposit.cell.outPoint.toHex()));
   const steps = [
     {
       ckbValue: sellers.some((group) => sits(group, system))
         ? 0n
-        : convert(false, ICKB_DEPOSIT_CAP, system.exchangeRatio),
+        : ckbFromUdt(ICKB_DEPOSIT_CAP, system.exchangeRatio),
       at: system.tip.timestamp,
     },
     // A claim the bot can no longer request in time rolls a cycle: the bot's rule, not the
@@ -148,12 +148,11 @@ function fillableOrders(
 }
 
 /**
- * Whether the order has been on the book for more than a turn, a twenty-fourth of an
- * epoch in blocks: the bot has seen it and left it. An uncommitted origin is fresh.
+ * Whether the order has been on the book for more than an eighth of an epoch in blocks,
+ * about three ten-minute turns: the bot has seen it and left it. A turn alone left no
+ * margin, since an order placed just after a turn waits a turn to be seen, and a failed
+ * turn adds the restart delay.
  */
 function sits(group: OrderGroup, { tip }: SystemState): boolean {
-  return (
-    group.blockNumber !== undefined &&
-    tip.number - group.blockNumber > tip.epoch.denominator / 24n
-  );
+  return tip.number - group.blockNumber > tip.epoch.denominator / 8n;
 }