@babylonlabs-io/ts-sdk 0.34.0 → 0.36.0

package/dist/psbtInputFields-B1lrwYzH.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"psbtInputFields-B1lrwYzH.cjs","sources":["../src/tbv/core/utils/utxo/selectUtxos.ts","../src/tbv/core/utils/transaction/btcTxHash.ts","../src/tbv/core/utils/btc/scriptType.ts","../src/tbv/core/utils/btc/psbtInputFields.ts"],"sourcesContent":["/**\n * UTXO selection utilities for peg-in transactions.\n * Follows btc-staking-ts methodology with iterative fee calculation.\n */\n\nimport { script as bitcoinScript } from \"bitcoinjs-lib\";\nimport { Buffer } from \"buffer\";\n\nimport {\n  BTC_DUST_SAT,\n  DUST_THRESHOLD,\n  MAX_NON_LEGACY_OUTPUT_SIZE,\n  P2TR_INPUT_SIZE,\n  rateBasedTxBufferFee,\n  TX_BUFFER_SIZE_OVERHEAD,\n} from \"../fee/constants\";\n\n/**\n * Unspent Transaction Output (UTXO) for funding peg-in transactions.\n */\nexport interface UTXO {\n  /**\n   * Transaction ID of the UTXO (64-char hex without 0x prefix).\n   */\n  txid: string;\n\n  /**\n   * Output index within the transaction.\n   */\n  vout: number;\n\n  /**\n   * Value in satoshis.\n   */\n  value: number;\n\n  /**\n   * Script public key hex.\n   */\n  scriptPubKey: string;\n}\n\nexport interface UTXOSelectionResult {\n  selectedUTXOs: UTXO[];\n  totalValue: bigint;\n  fee: bigint;\n  changeAmount: bigint;\n}\n\n/**\n * Assert that no two UTXOs share the same txid:vout outpoint.\n * Duplicates from a buggy or compromised UTXO source would produce\n * an invalid Bitcoin transaction that double-spends the same outpoint.\n */\nfunction assertNoDuplicateUtxos(utxos: UTXO[]): void {\n  const seen = new Set<string>();\n  for (const utxo of utxos) {\n    const key = `${utxo.txid.toLowerCase()}:${utxo.vout}`;\n    if (seen.has(key)) {\n      throw new Error(\n        `Duplicate UTXO detected: ${utxo.txid}:${utxo.vout}. ` +\n          `This indicates a data integrity issue with the UTXO source.`,\n      );\n    }\n    seen.add(key);\n  }\n}\n\n/**\n * Selects UTXOs to fund a peg-in transaction with iterative fee calculation.\n *\n * This function implements the btc-staking-ts approach:\n * 1. Filter UTXOs for script validity (no minimum value filter)\n * 2. Sort by value (largest first) to minimize number of inputs\n * 3. Iteratively add UTXOs and recalculate fee until we have enough\n *\n * The fee recalculation is critical because:\n * - Each UTXO added increases transaction size → increases fee\n * - More fee needed might require another UTXO\n * - Change output detection affects fee (adds output size if needed)\n *\n * @param availableUTXOs - All available UTXOs from wallet\n * @param peginAmount - Amount to peg in (satoshis)\n * @param feeRate - Fee rate (sat/vbyte)\n * @param numOutputs - Number of outputs in the unfunded transaction (HTLC + CPFP anchor, before change)\n * @returns Selected UTXOs, total value, calculated fee, and change amount\n * @throws Error if insufficient funds or no valid UTXOs\n */\nexport function selectUtxosForPegin(\n  availableUTXOs: UTXO[],\n  peginAmount: bigint,\n  feeRate: number,\n  numOutputs: number,\n): UTXOSelectionResult {\n  if (!Number.isInteger(numOutputs) || numOutputs < 1) {\n    throw new Error(\n      `Invalid numOutputs: expected a positive integer, got ${numOutputs}`,\n    );\n  }\n\n  if (availableUTXOs.length === 0) {\n    throw new Error(\"Insufficient funds: no UTXOs available\");\n  }\n\n  assertNoDuplicateUtxos(availableUTXOs);\n\n  // Filter for script validity ONLY (matching btc-staking-ts approach)\n  // No minimum value filter - we accept any UTXO with valid script\n  const validUTXOs = availableUTXOs.filter((utxo) => {\n    const script = Buffer.from(utxo.scriptPubKey, \"hex\");\n    const decompiledScript = bitcoinScript.decompile(script);\n    return !!decompiledScript;\n  });\n\n  if (validUTXOs.length === 0) {\n    throw new Error(\n      \"Insufficient funds: no valid UTXOs available (all have invalid scripts)\",\n    );\n  }\n\n  // Sort by value: HIGHEST to LOWEST (use big UTXOs first)\n  // Use spread to avoid mutating the original array\n  const sortedUTXOs = [...validUTXOs].sort((a, b) => b.value - a.value);\n\n  const selectedUTXOs: UTXO[] = [];\n  let accumulatedValue = 0n;\n  let estimatedFee = 0n;\n\n  // Iteratively select UTXOs and recalculate fee\n  for (const utxo of sortedUTXOs) {\n    selectedUTXOs.push(utxo);\n    accumulatedValue += BigInt(utxo.value);\n\n    // Recalculate fee based on CURRENT number of inputs\n    const inputSize = selectedUTXOs.length * P2TR_INPUT_SIZE;\n    const outputSize = numOutputs * MAX_NON_LEGACY_OUTPUT_SIZE;\n    const baseTxSize = inputSize + outputSize + TX_BUFFER_SIZE_OVERHEAD;\n\n    // Calculate base fee with buffer\n    estimatedFee =\n      BigInt(Math.ceil(baseTxSize * feeRate)) +\n      BigInt(rateBasedTxBufferFee(feeRate));\n\n    // Check if there will be change left after pegin amount and fee\n    const changeAmount = accumulatedValue - peginAmount - estimatedFee;\n\n    // If change is above dust, add fee for change output\n    if (changeAmount > DUST_THRESHOLD) {\n      const changeOutputFee = BigInt(\n        Math.ceil(MAX_NON_LEGACY_OUTPUT_SIZE * feeRate),\n      );\n      estimatedFee += changeOutputFee;\n    }\n\n    // Check if we have enough to cover pegin amount + fees\n    if (accumulatedValue >= peginAmount + estimatedFee) {\n      // Success! We have enough funds\n      const finalChangeAmount = accumulatedValue - peginAmount - estimatedFee;\n\n      return {\n        selectedUTXOs,\n        totalValue: accumulatedValue,\n        fee: estimatedFee,\n        changeAmount: finalChangeAmount,\n      };\n    }\n  }\n\n  // If we get here, we don't have enough funds\n  throw new Error(\n    `Insufficient funds: need ${peginAmount + estimatedFee} sats (${peginAmount} pegin + ${estimatedFee} fee), have ${accumulatedValue} sats`,\n  );\n}\n\n/**\n * Checks if change amount is above dust threshold.\n *\n * @param changeAmount - Change amount in satoshis\n * @returns true if change should be added as output, false if it should go to miners\n */\nexport function shouldAddChangeOutput(changeAmount: bigint): boolean {\n  return changeAmount > DUST_THRESHOLD;\n}\n\n/**\n * Gets the dust threshold value.\n *\n * @returns Dust threshold in satoshis\n */\nexport function getDustThreshold(): number {\n  return BTC_DUST_SAT;\n}\n","/**\n * Bitcoin Transaction Hash Utilities\n *\n * Provides utilities for calculating Bitcoin transaction hashes in a way that matches\n * the contract's BtcUtils.hashBtcTx() implementation.\n */\n\nimport { Transaction } from \"bitcoinjs-lib\";\nimport type { Hex } from \"viem\";\n\n/**\n * Calculate Bitcoin transaction hash\n *\n * This matches the contract's BtcUtils.hashBtcTx() implementation:\n * 1. Double SHA256 the transaction bytes\n * 2. Reverse the byte order (Bitcoin convention)\n *\n * The resulting hash is used as the unique vault identifier in the BTCVaultRegistry contract.\n *\n * @param txHex - Transaction hex (with or without 0x prefix)\n * @returns The transaction hash as Hex (with 0x prefix)\n */\nexport function calculateBtcTxHash(txHex: string): Hex {\n  // Remove 0x prefix if present\n  const cleanHex = txHex.startsWith(\"0x\") ? txHex.slice(2) : txHex;\n\n  // Use bitcoinjs-lib to calculate transaction ID (already does double SHA256 + reverse)\n  const tx = Transaction.fromHex(cleanHex);\n  const txid = tx.getId();\n\n  // Return with 0x prefix to match Ethereum hex format\n  return `0x${txid}` as Hex;\n}\n","/**\n * Bitcoin Script Type Detection\n *\n * Utilities to detect Bitcoin script types for proper PSBT input construction.\n *\n * @module utils/btc/scriptType\n */\n\n/**\n * Bitcoin script types.\n */\nexport enum BitcoinScriptType {\n  P2PKH = \"P2PKH\",\n  P2SH = \"P2SH\",\n  P2WPKH = \"P2WPKH\",\n  P2WSH = \"P2WSH\",\n  P2TR = \"P2TR\",\n  UNKNOWN = \"UNKNOWN\",\n}\n\n/**\n * Detect the type of a Bitcoin script.\n *\n * @param scriptPubKey - The script public key buffer\n * @returns The detected script type\n *\n * @example\n * ```typescript\n * const scriptType = getScriptType(Buffer.from(scriptPubKeyHex, 'hex'));\n * if (scriptType === BitcoinScriptType.P2TR) {\n *   // Handle Taproot input\n * }\n * ```\n */\nexport function getScriptType(scriptPubKey: Buffer): BitcoinScriptType {\n  const length = scriptPubKey.length;\n\n  // P2PKH: OP_DUP OP_HASH160 <20 bytes> OP_EQUALVERIFY OP_CHECKSIG (25 bytes)\n  if (\n    length === 25 &&\n    scriptPubKey[0] === 0x76 && // OP_DUP\n    scriptPubKey[1] === 0xa9 && // OP_HASH160\n    scriptPubKey[2] === 0x14 && // Push 20 bytes\n    scriptPubKey[23] === 0x88 && // OP_EQUALVERIFY\n    scriptPubKey[24] === 0xac // OP_CHECKSIG\n  ) {\n    return BitcoinScriptType.P2PKH;\n  }\n\n  // P2SH: OP_HASH160 <20 bytes> OP_EQUAL (23 bytes)\n  if (\n    length === 23 &&\n    scriptPubKey[0] === 0xa9 && // OP_HASH160\n    scriptPubKey[1] === 0x14 && // Push 20 bytes\n    scriptPubKey[22] === 0x87 // OP_EQUAL\n  ) {\n    return BitcoinScriptType.P2SH;\n  }\n\n  // P2WPKH: OP_0 <20 bytes> (22 bytes)\n  if (\n    length === 22 &&\n    scriptPubKey[0] === 0x00 && // OP_0\n    scriptPubKey[1] === 0x14 // Push 20 bytes\n  ) {\n    return BitcoinScriptType.P2WPKH;\n  }\n\n  // P2WSH: OP_0 <32 bytes> (34 bytes)\n  if (\n    length === 34 &&\n    scriptPubKey[0] === 0x00 && // OP_0\n    scriptPubKey[1] === 0x20 // Push 32 bytes\n  ) {\n    return BitcoinScriptType.P2WSH;\n  }\n\n  // P2TR (Taproot): OP_1 <32 bytes> (34 bytes)\n  if (\n    length === 34 &&\n    scriptPubKey[0] === 0x51 && // OP_1\n    scriptPubKey[1] === 0x20 // Push 32 bytes\n  ) {\n    return BitcoinScriptType.P2TR;\n  }\n\n  return BitcoinScriptType.UNKNOWN;\n}\n\n","/**\n * PSBT Input Field Construction\n *\n * Constructs the correct PSBT input fields for a given UTXO based on its script type.\n *\n * @module utils/btc/psbtInputFields\n */\n\nimport { Buffer } from \"buffer\";\n\nimport { BitcoinScriptType, getScriptType } from \"./scriptType\";\n\n/**\n * PSBT input fields for supported script types (P2TR, P2WPKH, P2WSH).\n */\nexport interface PsbtInputFields {\n  witnessUtxo?: {\n    script: Buffer;\n    value: number;\n  };\n  witnessScript?: Buffer;\n  tapInternalKey?: Buffer;\n}\n\n/**\n * UTXO information for PSBT construction.\n *\n * Only supports Taproot (P2TR) and native SegWit (P2WPKH, P2WSH) script types.\n */\nexport interface UtxoForPsbt {\n  /** Transaction ID of the UTXO */\n  txid: string;\n  /** Output index (vout) of the UTXO */\n  vout: number;\n  /** Value of the UTXO in satoshis */\n  value: number;\n  /** ScriptPubKey of the UTXO (hex string) */\n  scriptPubKey: string;\n  /** Witness script (required for P2WSH) */\n  witnessScript?: string;\n}\n\n/**\n * Get PSBT input fields for a given UTXO based on its script type.\n *\n * Only supports Taproot (P2TR) and native SegWit (P2WPKH, P2WSH) script types.\n *\n * @param utxo - The unspent transaction output to process\n * @param publicKeyNoCoord - The x-only public key (32 bytes) for Taproot signing\n * @returns PSBT input fields object containing the necessary data\n * @throws Error if required input data is missing or unsupported script type\n */\nexport function getPsbtInputFields(\n  utxo: UtxoForPsbt,\n  publicKeyNoCoord?: Buffer,\n): PsbtInputFields {\n  const scriptPubKey = Buffer.from(utxo.scriptPubKey, \"hex\");\n  const type = getScriptType(scriptPubKey);\n\n  switch (type) {\n    case BitcoinScriptType.P2WPKH: {\n      return {\n        witnessUtxo: {\n          script: scriptPubKey,\n          value: utxo.value,\n        },\n      };\n    }\n\n    case BitcoinScriptType.P2WSH: {\n      if (!utxo.witnessScript) {\n        throw new Error(\"Missing witnessScript for P2WSH input\");\n      }\n      return {\n        witnessUtxo: {\n          script: scriptPubKey,\n          value: utxo.value,\n        },\n        witnessScript: Buffer.from(utxo.witnessScript, \"hex\"),\n      };\n    }\n\n    case BitcoinScriptType.P2TR: {\n      if (publicKeyNoCoord && publicKeyNoCoord.length !== 32) {\n        throw new Error(\n          `Invalid tapInternalKey length: expected 32 bytes, got ${publicKeyNoCoord.length}`,\n        );\n      }\n      return {\n        witnessUtxo: {\n          script: scriptPubKey,\n          value: utxo.value,\n        },\n        // tapInternalKey is needed for Taproot signing\n        ...(publicKeyNoCoord && { tapInternalKey: publicKeyNoCoord }),\n      };\n    }\n\n    default:\n      throw new Error(`Unsupported script type: ${type}`);\n  }\n}\n\n"],"names":["assertNoDuplicateUtxos","utxos","seen","utxo","key","selectUtxosForPegin","availableUTXOs","peginAmount","feeRate","numOutputs","validUTXOs","script","Buffer","bitcoinScript","sortedUTXOs","b","selectedUTXOs","accumulatedValue","estimatedFee","inputSize","P2TR_INPUT_SIZE","outputSize","MAX_NON_LEGACY_OUTPUT_SIZE","baseTxSize","TX_BUFFER_SIZE_OVERHEAD","rateBasedTxBufferFee","DUST_THRESHOLD","changeOutputFee","finalChangeAmount","shouldAddChangeOutput","changeAmount","getDustThreshold","BTC_DUST_SAT","calculateBtcTxHash","txHex","cleanHex","Transaction","BitcoinScriptType","getScriptType","scriptPubKey","length","getPsbtInputFields","publicKeyNoCoord","type"],"mappings":"mHAsDA,SAASA,EAAuBC,EAAqB,CACnD,MAAMC,MAAW,IACjB,UAAWC,KAAQF,EAAO,CACxB,MAAMG,EAAM,GAAGD,EAAK,KAAK,aAAa,IAAIA,EAAK,IAAI,GACnD,GAAID,EAAK,IAAIE,CAAG,EACd,MAAM,IAAI,MACR,4BAA4BD,EAAK,IAAI,IAAIA,EAAK,IAAI,+DAAA,EAItDD,EAAK,IAAIE,CAAG,CACd,CACF,CAsBO,SAASC,EACdC,EACAC,EACAC,EACAC,EACqB,CACrB,GAAI,CAAC,OAAO,UAAUA,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAI,MACR,wDAAwDA,CAAU,EAAA,EAItE,GAAIH,EAAe,SAAW,EAC5B,MAAM,IAAI,MAAM,wCAAwC,EAG1DN,EAAuBM,CAAc,EAIrC,MAAMI,EAAaJ,EAAe,OAAQH,GAAS,CACjD,MAAMQ,EAASC,EAAAA,OAAO,KAAKT,EAAK,aAAc,KAAK,EAEnD,MAAO,CAAC,CADiBU,EAAAA,OAAc,UAAUF,CAAM,CAEzD,CAAC,EAED,GAAID,EAAW,SAAW,EACxB,MAAM,IAAI,MACR,yEAAA,EAMJ,MAAMI,EAAc,CAAC,GAAGJ,CAAU,EAAE,KAAK,CAAC,EAAGK,IAAMA,EAAE,MAAQ,EAAE,KAAK,EAE9DC,EAAwB,CAAA,EAC9B,IAAIC,EAAmB,GACnBC,EAAe,GAGnB,UAAWf,KAAQW,EAAa,CAC9BE,EAAc,KAAKb,CAAI,EACvBc,GAAoB,OAAOd,EAAK,KAAK,EAGrC,MAAMgB,EAAYH,EAAc,OAASI,EAAAA,gBACnCC,EAAaZ,EAAaa,EAAAA,2BAC1BC,EAAaJ,EAAYE,EAAaG,EAAAA,wBAW5C,GARAN,EACE,OAAO,KAAK,KAAKK,EAAaf,CAAO,CAAC,EACtC,OAAOiB,uBAAqBjB,CAAO,CAAC,EAGjBS,EAAmBV,EAAcW,EAGnCQ,EAAAA,eAAgB,CACjC,MAAMC,EAAkB,OACtB,KAAK,KAAKL,EAAAA,2BAA6Bd,CAAO,CAAA,EAEhDU,GAAgBS,CAClB,CAGA,GAAIV,GAAoBV,EAAcW,EAAc,CAElD,MAAMU,EAAoBX,EAAmBV,EAAcW,EAE3D,MAAO,CACL,cAAAF,EACA,WAAYC,EACZ,IAAKC,EACL,aAAcU,CAAA,CAElB,CACF,CAGA,MAAM,IAAI,MACR,4BAA4BrB,EAAcW,CAAY,UAAUX,CAAW,YAAYW,CAAY,eAAeD,CAAgB,OAAA,CAEtI,CAQO,SAASY,EAAsBC,EAA+B,CACnE,OAAOA,EAAeJ,EAAAA,cACxB,CAOO,SAASK,GAA2B,CACzC,OAAOC,EAAAA,YACT,CCzKO,SAASC,EAAmBC,EAAoB,CAErD,MAAMC,EAAWD,EAAM,WAAW,IAAI,EAAIA,EAAM,MAAM,CAAC,EAAIA,EAO3D,MAAO,KAJIE,EAAAA,YAAY,QAAQD,CAAQ,EACvB,MAAA,CAGA,EAClB,CCrBO,IAAKE,GAAAA,IACVA,EAAA,MAAQ,QACRA,EAAA,KAAO,OACPA,EAAA,OAAS,SACTA,EAAA,MAAQ,QACRA,EAAA,KAAO,OACPA,EAAA,QAAU,UANAA,IAAAA,GAAA,CAAA,CAAA,EAuBL,SAASC,EAAcC,EAAyC,CACrE,MAAMC,EAASD,EAAa,OAG5B,OACEC,IAAW,IACXD,EAAa,CAAC,IAAM,KACpBA,EAAa,CAAC,IAAM,KACpBA,EAAa,CAAC,IAAM,IACpBA,EAAa,EAAE,IAAM,KACrBA,EAAa,EAAE,IAAM,IAEd,QAKPC,IAAW,IACXD,EAAa,CAAC,IAAM,KACpBA,EAAa,CAAC,IAAM,IACpBA,EAAa,EAAE,IAAM,IAEd,OAKPC,IAAW,IACXD,EAAa,CAAC,IAAM,GACpBA,EAAa,CAAC,IAAM,GAEb,SAKPC,IAAW,IACXD,EAAa,CAAC,IAAM,GACpBA,EAAa,CAAC,IAAM,GAEb,QAKPC,IAAW,IACXD,EAAa,CAAC,IAAM,IACpBA,EAAa,CAAC,IAAM,GAEb,OAGF,SACT,CCnCO,SAASE,EACdtC,EACAuC,EACiB,CACjB,MAAMH,EAAe3B,EAAAA,OAAO,KAAKT,EAAK,aAAc,KAAK,EACnDwC,EAAOL,EAAcC,CAAY,EAEvC,OAAQI,EAAA,CACN,KAAKN,EAAkB,OACrB,MAAO,CACL,YAAa,CACX,OAAQE,EACR,MAAOpC,EAAK,KAAA,CACd,EAIJ,KAAKkC,EAAkB,MAAO,CAC5B,GAAI,CAAClC,EAAK,cACR,MAAM,IAAI,MAAM,uCAAuC,EAEzD,MAAO,CACL,YAAa,CACX,OAAQoC,EACR,MAAOpC,EAAK,KAAA,EAEd,cAAeS,EAAAA,OAAO,KAAKT,EAAK,cAAe,KAAK,CAAA,CAExD,CAEA,KAAKkC,EAAkB,KAAM,CAC3B,GAAIK,GAAoBA,EAAiB,SAAW,GAClD,MAAM,IAAI,MACR,yDAAyDA,EAAiB,MAAM,EAAA,EAGpF,MAAO,CACL,YAAa,CACX,OAAQH,EACR,MAAOpC,EAAK,KAAA,EAGd,GAAIuC,GAAoB,CAAE,eAAgBA,CAAA,CAAiB,CAE/D,CAEA,QACE,MAAM,IAAI,MAAM,4BAA4BC,CAAI,EAAE,CAAA,CAExD"}

package/dist/sha2-6wN58S6R.js

@@ -1,280 +0,0 @@
-var U = Object.defineProperty;
-var B = (t, e, s) => e in t ? U(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;
-var a = (t, e, s) => B(t, typeof e != "symbol" ? e + "" : e, s);
-function I(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function E(t, e = "") {
-  if (!Number.isSafeInteger(t) || t < 0) {
-    const s = e && `"${e}" `;
-    throw new Error(`${s}expected integer >= 0, got ${t}`);
-  }
-}
-function m(t, e, s = "") {
-  const i = I(t), n = t == null ? void 0 : t.length, c = e !== void 0;
-  if (!i || c && n !== e) {
-    const o = s && `"${s}" `, f = c ? ` of length ${e}` : "", h = i ? `length=${n}` : `type=${typeof t}`;
-    throw new Error(o + "expected Uint8Array" + f + ", got " + h);
-  }
-  return t;
-}
-function N(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash must wrapped by utils.createHasher");
-  E(t.outputLen), E(t.blockLen);
-}
-function H(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function _(t, e) {
-  m(t, void 0, "digestInto() output");
-  const s = e.outputLen;
-  if (t.length < s)
-    throw new Error('"digestInto() output" expected to be of length >=' + s);
-}
-function T(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function L(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function w(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function x(t, e) {
-  return t << 32 - e | t >>> e;
-}
-function z(t, e) {
-  return t << e | t >>> 32 - e >>> 0;
-}
-const k = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function S(t) {
-  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-}
-function C(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = S(t[e]);
-  return t;
-}
-const K = k ? (t) => t : C;
-function D(t, e = {}) {
-  const s = (n, c) => t(c).update(n).digest(), i = t(void 0);
-  return s.outputLen = i.outputLen, s.blockLen = i.blockLen, s.create = (n) => t(n), Object.assign(s, e), Object.freeze(s);
-}
-const O = (t) => ({
-  oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
-});
-function $(t, e, s) {
-  return t & e ^ ~t & s;
-}
-function F(t, e, s) {
-  return t & e ^ t & s ^ e & s;
-}
-class G {
-  constructor(e, s, i, n) {
-    a(this, "blockLen");
-    a(this, "outputLen");
-    a(this, "padOffset");
-    a(this, "isLE");
-    // For partial updates less than block size
-    a(this, "buffer");
-    a(this, "view");
-    a(this, "finished", !1);
-    a(this, "length", 0);
-    a(this, "pos", 0);
-    a(this, "destroyed", !1);
-    this.blockLen = e, this.outputLen = s, this.padOffset = i, this.isLE = n, this.buffer = new Uint8Array(e), this.view = w(this.buffer);
-  }
-  update(e) {
-    H(this), m(e);
-    const { view: s, buffer: i, blockLen: n } = this, c = e.length;
-    for (let o = 0; o < c; ) {
-      const f = Math.min(n - this.pos, c - o);
-      if (f === n) {
-        const h = w(e);
-        for (; n <= c - o; o += n)
-          this.process(h, o);
-        continue;
-      }
-      i.set(e.subarray(o, o + f), this.pos), this.pos += f, o += f, this.pos === n && (this.process(s, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    H(this), _(e, this), this.finished = !0;
-    const { buffer: s, view: i, blockLen: n, isLE: c } = this;
-    let { pos: o } = this;
-    s[o++] = 128, L(this.buffer.subarray(o)), this.padOffset > n - o && (this.process(i, 0), o = 0);
-    for (let r = o; r < n; r++)
-      s[r] = 0;
-    i.setBigUint64(n - 8, BigInt(this.length * 8), c), this.process(i, 0);
-    const f = w(e), h = this.outputLen;
-    if (h % 4)
-      throw new Error("_sha2: outputLen must be aligned to 32bit");
-    const u = h / 4, b = this.get();
-    if (u > b.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let r = 0; r < u; r++)
-      f.setUint32(4 * r, b[r], c);
-  }
-  digest() {
-    const { buffer: e, outputLen: s } = this;
-    this.digestInto(e);
-    const i = e.slice(0, s);
-    return this.destroy(), i;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: s, buffer: i, length: n, finished: c, destroyed: o, pos: f } = this;
-    return e.destroyed = o, e.finished = c, e.length = n, e.pos = f, n % s && e.buffer.set(i), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-const d = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), V = /* @__PURE__ */ Uint32Array.from([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), p = /* @__PURE__ */ new Uint32Array(64);
-class M extends G {
-  constructor(e) {
-    super(64, e, 8, !1);
-  }
-  get() {
-    const { A: e, B: s, C: i, D: n, E: c, F: o, G: f, H: h } = this;
-    return [e, s, i, n, c, o, f, h];
-  }
-  // prettier-ignore
-  set(e, s, i, n, c, o, f, h) {
-    this.A = e | 0, this.B = s | 0, this.C = i | 0, this.D = n | 0, this.E = c | 0, this.F = o | 0, this.G = f | 0, this.H = h | 0;
-  }
-  process(e, s) {
-    for (let r = 0; r < 16; r++, s += 4)
-      p[r] = e.getUint32(s, !1);
-    for (let r = 16; r < 64; r++) {
-      const g = p[r - 15], l = p[r - 2], A = x(g, 7) ^ x(g, 18) ^ g >>> 3, y = x(l, 17) ^ x(l, 19) ^ l >>> 10;
-      p[r] = y + p[r - 7] + A + p[r - 16] | 0;
-    }
-    let { A: i, B: n, C: c, D: o, E: f, F: h, G: u, H: b } = this;
-    for (let r = 0; r < 64; r++) {
-      const g = x(f, 6) ^ x(f, 11) ^ x(f, 25), l = b + g + $(f, h, u) + V[r] + p[r] | 0, y = (x(i, 2) ^ x(i, 13) ^ x(i, 22)) + F(i, n, c) | 0;
-      b = u, u = h, h = f, f = o + l | 0, o = c, c = n, n = i, i = l + y | 0;
-    }
-    i = i + this.A | 0, n = n + this.B | 0, c = c + this.C | 0, o = o + this.D | 0, f = f + this.E | 0, h = h + this.F | 0, u = u + this.G | 0, b = b + this.H | 0, this.set(i, n, c, o, f, h, u, b);
-  }
-  roundClean() {
-    L(p);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), L(this.buffer);
-  }
-}
-class j extends M {
-  constructor() {
-    super(32);
-    // We cannot use array here since array allows indexing by variable
-    // which means optimizer/compiler cannot use registers.
-    a(this, "A", d[0] | 0);
-    a(this, "B", d[1] | 0);
-    a(this, "C", d[2] | 0);
-    a(this, "D", d[3] | 0);
-    a(this, "E", d[4] | 0);
-    a(this, "F", d[5] | 0);
-    a(this, "G", d[6] | 0);
-    a(this, "H", d[7] | 0);
-  }
-}
-const q = /* @__PURE__ */ D(
-  () => new j(),
-  /* @__PURE__ */ O(1)
-);
-export {
-  G as H,
-  N as a,
-  m as b,
-  L as c,
-  H as d,
-  E as e,
-  D as f,
-  K as g,
-  _ as h,
-  z as r,
-  q as s,
-  T as u
-};
-//# sourceMappingURL=sha2-6wN58S6R.js.map

package/dist/sha2-CsTynrfJ.cjs

@@ -1,2 +0,0 @@
-"use strict";var _=Object.defineProperty;var k=(t,e,s)=>e in t?_(t,e,{enumerable:!0,configurable:!0,writable:!0,value:s}):t[e]=s;var a=(t,e,s)=>k(t,typeof e!="symbol"?e+"":e,s);function D(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function A(t,e=""){if(!Number.isSafeInteger(t)||t<0){const s=e&&`"${e}" `;throw new Error(`${s}expected integer >= 0, got ${t}`)}}function H(t,e,s=""){const i=D(t),n=t==null?void 0:t.length,c=e!==void 0;if(!i||c&&n!==e){const o=s&&`"${s}" `,f=c?` of length ${e}`:"",h=i?`length=${n}`:`type=${typeof t}`;throw new Error(o+"expected Uint8Array"+f+", got "+h)}return t}function S(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash must wrapped by utils.createHasher");A(t.outputLen),A(t.blockLen)}function E(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function U(t,e){H(t,void 0,"digestInto() output");const s=e.outputLen;if(t.length<s)throw new Error('"digestInto() output" expected to be of length >='+s)}function C(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function y(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function x(t,e){return t<<32-e|t>>>e}function O(t,e){return t<<e|t>>>32-e>>>0}const $=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function F(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function G(t){for(let e=0;e<t.length;e++)t[e]=F(t[e]);return t}const M=$?t=>t:G;function B(t,e={}){const s=(n,c)=>t(c).update(n).digest(),i=t(void 0);return s.outputLen=i.outputLen,s.blockLen=i.blockLen,s.create=n=>t(n),Object.assign(s,e),Object.freeze(s)}const V=t=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,t])});function j(t,e,s){return t&e^~t&s}function W(t,e,s){return t&e^t&s^e&s}class I{constructor(e,s,i,n){a(this,"blockLen");a(this,"outputLen");a(this,"padOffset");a(this,"isLE");a(this,"buffer");a(this,"view");a(this,"finished",!1);a(this,"length",0);a(this,"pos",0);a(this,"destroyed",!1);this.blockLen=e,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(e),this.view=L(this.buffer)}update(e){E(this),H(e);const{view:s,buffer:i,blockLen:n}=this,c=e.length;for(let o=0;o<c;){const f=Math.min(n-this.pos,c-o);if(f===n){const h=L(e);for(;n<=c-o;o+=n)this.process(h,o);continue}i.set(e.subarray(o,o+f),this.pos),this.pos+=f,o+=f,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=e.length,this.roundClean(),this}digestInto(e){E(this),U(e,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:c}=this;let{pos:o}=this;s[o++]=128,y(this.buffer.subarray(o)),this.padOffset>n-o&&(this.process(i,0),o=0);for(let r=o;r<n;r++)s[r]=0;i.setBigUint64(n-8,BigInt(this.length*8),c),this.process(i,0);const f=L(e),h=this.outputLen;if(h%4)throw new Error("_sha2: outputLen must be aligned to 32bit");const u=h/4,b=this.get();if(u>b.length)throw new Error("_sha2: outputLen bigger than state");for(let r=0;r<u;r++)f.setUint32(4*r,b[r],c)}digest(){const{buffer:e,outputLen:s}=this;this.digestInto(e);const i=e.slice(0,s);return this.destroy(),i}_cloneInto(e){e||(e=new this.constructor),e.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:c,destroyed:o,pos:f}=this;return e.destroyed=o,e.finished=c,e.length=n,e.pos=f,n%s&&e.buffer.set(i),e}clone(){return this._cloneInto()}}const d=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),N=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),p=new Uint32Array(64);class T extends I{constructor(e){super(64,e,8,!1)}get(){const{A:e,B:s,C:i,D:n,E:c,F:o,G:f,H:h}=this;return[e,s,i,n,c,o,f,h]}set(e,s,i,n,c,o,f,h){this.A=e|0,this.B=s|0,this.C=i|0,this.D=n|0,this.E=c|0,this.F=o|0,this.G=f|0,this.H=h|0}process(e,s){for(let r=0;r<16;r++,s+=4)p[r]=e.getUint32(s,!1);for(let r=16;r<64;r++){const g=p[r-15],l=p[r-2],m=x(g,7)^x(g,18)^g>>>3,w=x(l,17)^x(l,19)^l>>>10;p[r]=w+p[r-7]+m+p[r-16]|0}let{A:i,B:n,C:c,D:o,E:f,F:h,G:u,H:b}=this;for(let r=0;r<64;r++){const g=x(f,6)^x(f,11)^x(f,25),l=b+g+j(f,h,u)+N[r]+p[r]|0,w=(x(i,2)^x(i,13)^x(i,22))+W(i,n,c)|0;b=u,u=h,h=f,f=o+l|0,o=c,c=n,n=i,i=l+w|0}i=i+this.A|0,n=n+this.B|0,c=c+this.C|0,o=o+this.D|0,f=f+this.E|0,h=h+this.F|0,u=u+this.G|0,b=b+this.H|0,this.set(i,n,c,o,f,h,u,b)}roundClean(){y(p)}destroy(){this.set(0,0,0,0,0,0,0,0),y(this.buffer)}}class z extends T{constructor(){super(32);a(this,"A",d[0]|0);a(this,"B",d[1]|0);a(this,"C",d[2]|0);a(this,"D",d[3]|0);a(this,"E",d[4]|0);a(this,"F",d[5]|0);a(this,"G",d[6]|0);a(this,"H",d[7]|0)}}const K=B(()=>new z,V(1));exports.HashMD=I;exports.abytes=H;exports.aexists=E;exports.ahash=S;exports.anumber=A;exports.aoutput=U;exports.clean=y;exports.createHasher=B;exports.rotl=O;exports.sha256=K;exports.swap32IfBE=M;exports.u32=C;
-//# sourceMappingURL=sha2-CsTynrfJ.cjs.map

package/dist/tbv/core/vault-secrets/__tests__/info.test.d.ts

@@ -1,8 +0,0 @@
-/**
- * Tests for the `info(label, ctx)` encoder per
- * `derive-vault-secrets.md` Appendix A.
- *
- * The golden hex strings below come from §4 "Label info encodings".
- */
-export {};
-//# sourceMappingURL=info.test.d.ts.map

package/dist/tbv/core/vault-secrets/__tests__/info.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"info.test.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/vault-secrets/__tests__/info.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/tbv/core/vault-secrets/expand.d.ts

@@ -1,58 +0,0 @@
-/**
- * HKDF-Expand-based vault-secret derivation per
- * `derive-vault-secrets.md` §2.2.
- *
- * Pure, synchronous expanders that derive three domain-separated
- * secrets from a 32-byte `root`. The root is spec-opaque — typically
- * obtained via `deriveVaultRoot(wallet, vaultContextInput)` (which
- * forwards to the wallet's `deriveContextHash`), but any 32-byte
- * pseudorandom source satisfies the contract.
- *
- * All expand calls use HKDF-Expand-SHA-256 with `root` directly as the
- * PRK (RFC 5869 §3.3: the Extract step is omitted when the input is
- * already a uniformly-distributed pseudorandom key of HashLen bytes).
- *
- * @module vault-secrets/expand
- */
-/**
- * Derive the 32-byte `authAnchor` shared across a single Pre-PegIn
- * transaction.
- *
- * `SHA256(authAnchor)` is committed as the OP_RETURN preimage hash in
- * the Pre-PegIn; the raw preimage is revealed to the vault provider's
- * `auth_createDepositorToken` RPC in exchange for a CWT bearer token.
- *
- * @stability frozen — on-chain-binding. Changing the HKDF info encoding
- * (label or argument order) rotates the anchor and invalidates the VP
- * bearer-token flow for existing deposits.
- */
-export declare function expandAuthAnchor(root: Uint8Array): Uint8Array;
-/**
- * Derive the 32-byte `hashlockSecret` for the HTLC at output index
- * `htlcVout`.
- *
- * `SHA256(hashlockSecret)` is committed as the HTLC taproot hashlock
- * at vout = `htlcVout` in the Pre-PegIn. The raw preimage is revealed
- * on Ethereum via `activateVaultWithSecret`.
- *
- * @stability frozen — on-chain-binding. Changing the HKDF info
- * encoding produces a different secret whose SHA-256 will not match
- * the on-chain hashlock; affected vaults can never be activated.
- */
-export declare function expandHashlockSecret(root: Uint8Array, htlcVout: number): Uint8Array;
-/**
- * Derive the 64-byte `wotsSeed` for the vault at output index
- * `htlcVout`.
- *
- * Fed into the per-vault WOTS block-keypair derivation. Only the
- * `keccak256` hash of the derived public keys appears on-chain
- * (committed as `depositorWotsPkHash`).
- *
- * @stability frozen — on-chain-binding. Changing the HKDF info
- * encoding (label or htlcVout serialization) rotates the seed and
- * therefore the WOTS keys; existing `depositorWotsPkHash` commitments
- * would no longer match. Per-vault domain separation depends on the
- * `i2osp4(htlcVout)` argument: do not change its encoding.
- */
-export declare function expandWotsSeed(root: Uint8Array, htlcVout: number): Uint8Array;
-//# sourceMappingURL=expand.d.ts.map

package/dist/tbv/core/vault-secrets/expand.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"expand.d.ts","sourceRoot":"","sources":["../../../../src/tbv/core/vault-secrets/expand.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AA0BH;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAQ7D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,MAAM,GACf,UAAU,CAQZ;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,UAAU,CAQ7E"}

package/dist/tbv/core/vault-secrets/info.d.ts

@@ -1,55 +0,0 @@
-/**
- * Info encoding for HKDF-Expand per `derive-vault-secrets.md` Appendix A.
- *
- * ```
- * info(label, ctx) :=
- *        "babylonbtcvault"        // fixed 15-byte ASCII domain tag
- *     || I2OSP(len(label), 1)     // 1-byte label length
- *     || label                    // ASCII bytes of the label
- *     || I2OSP(len(ctx),   2)     // 2-byte big-endian ctx length
- *     || ctx                      // opaque per-label context bytes
- * ```
- *
- * The fixed-width length prefixes make the encoding injective over the
- * set of legal `(label, ctx)` pairs, which is what lets distinct labels
- * produce computationally-independent HKDF-Expand outputs under the
- * HMAC-SHA-256 PRF assumption.
- *
- * @module vault-secrets/info
- */
-/**
- * @internal Label for the per-HTLC hashlock preimage (Appendix A §A.2).
- * Exported only so the spec-conformance tests can pin the literal value.
- */
-export declare const LABEL_HASHLOCK = "hashlock";
-/**
- * @internal Label for the per-Pre-PegIn shared auth-anchor (Appendix A §A.2).
- * Exported only so the spec-conformance tests can pin the literal value.
- */
-export declare const LABEL_AUTH_ANCHOR = "auth-anchor";
-/**
- * @internal Label for the per-HTLC WOTS block-derivation seed (Appendix A §A.2).
- * Exported only so the spec-conformance tests can pin the literal value.
- */
-export declare const LABEL_WOTS_SEED = "wots-seed";
-/**
- * Encode a 32-bit unsigned integer as 4 big-endian bytes (RFC 8017 §4.1,
- * `I2OSP(n, 4)`).
- *
- * @internal Helper used by `buildInfo` and the per-HTLC `expand*`
- * functions; consumed directly only by tests.
- *
- * @throws If `value` is not a non-negative integer ≤ `0xffffffff`.
- */
-export declare function i2osp4(value: number): Uint8Array;
-/**
- * Build the `info` byte-string for an HKDF-Expand invocation.
- *
- * @internal Used by the per-HTLC `expand*` functions; exposed for the
- * spec-conformance tests that pin the encoded byte layout.
- *
- * @param label - ASCII label tag. Length MUST be in `[1, 255]`.
- * @param ctx   - Optional opaque context bytes. Length MUST be in `[0, 65535]`.
- */
-export declare function buildInfo(label: string, ctx?: Uint8Array): Uint8Array;
-//# sourceMappingURL=info.d.ts.map

package/dist/tbv/core/vault-secrets/info.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"info.d.ts","sourceRoot":"","sources":["../../../../src/tbv/core/vault-secrets/info.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAaH;;;GAGG;AACH,eAAO,MAAM,cAAc,aAAa,CAAC;AAEzC;;;GAGG;AACH,eAAO,MAAM,iBAAiB,gBAAgB,CAAC;AAE/C;;;GAGG;AACH,eAAO,MAAM,eAAe,cAAc,CAAC;AAE3C;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAUhD;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,MAAM,EACb,GAAG,GAAE,UAA8B,GAClC,UAAU,CAyCZ"}