@babylonlabs-io/ts-sdk 3.1.2 → 3.2.1

package/dist/{registration-records-CKLAv3gw.js.map → registration-records-BBOz21Dm.js.map}

@@ -1 +1 @@
-{"version":3,"file":"registration-records-CKLAv3gw.js","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/legacy.js","../src/tbv/core/clients/eth/onChainBtcPubkey.ts","../src/tbv/core/clients/eth/payout-script.ts","../src/tbv/core/clients/eth/pegin-transaction.ts","../src/tbv/core/clients/eth/claimable-event-error.ts","../src/tbv/core/clients/eth/protocol-params-validation.ts","../src/tbv/core/clients/eth/registration-logs-error.ts","../src/tbv/core/clients/eth/registration-records.ts"],"sourcesContent":["/**\n\nSHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.\nDon't use them in a new protocol. What \"weak\" means:\n\n- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.\n- No practical pre-image attacks (only theoretical, 2^123.4)\n- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151\n * @module\n */\nimport { Chi, HashMD, Maj } from \"./_md.js\";\nimport { clean, createHasher, rotl } from \"./utils.js\";\n/** Initial SHA1 state */\nconst SHA1_IV = /* @__PURE__ */ Uint32Array.from([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Reusable temporary buffer\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\n/** Internal SHA1 legacy hash class. */\nexport class _SHA1 extends HashMD {\n    A = SHA1_IV[0] | 0;\n    B = SHA1_IV[1] | 0;\n    C = SHA1_IV[2] | 0;\n    D = SHA1_IV[3] | 0;\n    E = SHA1_IV[4] | 0;\n    constructor() {\n        super(64, 20, 8, false);\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        clean(SHA1_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */\nexport const sha1 = /* @__PURE__ */ createHasher(() => new _SHA1());\n/** Per-round constants */\nconst p32 = /* @__PURE__ */ Math.pow(2, 32);\nconst K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) => Math.floor(p32 * Math.abs(Math.sin(i + 1))));\n/** md5 initial state: same as sha1, but 4 u32 instead of 5. */\nconst MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);\n// Reusable temporary buffer\nconst MD5_W = /* @__PURE__ */ new Uint32Array(16);\n/** Internal MD5 legacy hash class. */\nexport class _MD5 extends HashMD {\n    A = MD5_IV[0] | 0;\n    B = MD5_IV[1] | 0;\n    C = MD5_IV[2] | 0;\n    D = MD5_IV[3] | 0;\n    constructor() {\n        super(64, 16, 8, true);\n    }\n    get() {\n        const { A, B, C, D } = this;\n        return [A, B, C, D];\n    }\n    set(A, B, C, D) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            MD5_W[i] = view.getUint32(offset, true);\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D } = this;\n        for (let i = 0; i < 64; i++) {\n            let F, g, s;\n            if (i < 16) {\n                F = Chi(B, C, D);\n                g = i;\n                s = [7, 12, 17, 22];\n            }\n            else if (i < 32) {\n                F = Chi(D, B, C);\n                g = (5 * i + 1) % 16;\n                s = [5, 9, 14, 20];\n            }\n            else if (i < 48) {\n                F = B ^ C ^ D;\n                g = (3 * i + 5) % 16;\n                s = [4, 11, 16, 23];\n            }\n            else {\n                F = C ^ (B | ~D);\n                g = (7 * i) % 16;\n                s = [6, 10, 15, 21];\n            }\n            F = F + A + K[i] + MD5_W[g];\n            A = D;\n            D = C;\n            C = B;\n            B = B + rotl(F, s[i % 4]);\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        this.set(A, B, C, D);\n    }\n    roundClean() {\n        clean(MD5_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/**\n * MD5 (RFC 1321) legacy hash function. It was cryptographically broken.\n * MD5 architecture is similar to SHA1, with some differences:\n * - Reduced output length: 16 bytes (128 bit) instead of 20\n * - 64 rounds, instead of 80\n * - Little-endian: could be faster, but will require more code\n * - Non-linear index selection: huge speed-up for unroll\n * - Per round constants: more memory accesses, additional speed-up for unroll\n */\nexport const md5 = /* @__PURE__ */ createHasher(() => new _MD5());\n// RIPEMD-160\nconst Rho160 = /* @__PURE__ */ Uint8Array.from([\n    7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n]);\nconst Id160 = /* @__PURE__ */ (() => Uint8Array.from(new Array(16).fill(0).map((_, i) => i)))();\nconst Pi160 = /* @__PURE__ */ (() => Id160.map((i) => (9 * i + 5) % 16))();\nconst idxLR = /* @__PURE__ */ (() => {\n    const L = [Id160];\n    const R = [Pi160];\n    const res = [L, R];\n    for (let i = 0; i < 4; i++)\n        for (let j of res)\n            j.push(j[i].map((k) => Rho160[k]));\n    return res;\n})();\nconst idxL = /* @__PURE__ */ (() => idxLR[0])();\nconst idxR = /* @__PURE__ */ (() => idxLR[1])();\n// const [idxL, idxR] = idxLR;\nconst shifts160 = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => Uint8Array.from(i));\nconst shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst Kl160 = /* @__PURE__ */ Uint32Array.from([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr160 = /* @__PURE__ */ Uint32Array.from([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction ripemd_f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    if (group === 1)\n        return (x & y) | (~x & z);\n    if (group === 2)\n        return (x | ~y) ^ z;\n    if (group === 3)\n        return (x & z) | (y & ~z);\n    return x ^ (y | ~z);\n}\n// Reusable temporary buffer\nconst BUF_160 = /* @__PURE__ */ new Uint32Array(16);\nexport class _RIPEMD160 extends HashMD {\n    h0 = 0x67452301 | 0;\n    h1 = 0xefcdab89 | 0;\n    h2 = 0x98badcfe | 0;\n    h3 = 0x10325476 | 0;\n    h4 = 0xc3d2e1f0 | 0;\n    constructor() {\n        super(64, 20, 8, true);\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF_160[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl160[group], hbr = Kr160[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL160[group], sr = shiftsR160[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        clean(BUF_160);\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a legacy hash function from 1990s.\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\n */\nexport const ripemd160 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());\n//# sourceMappingURL=legacy.js.map","/**\n * The single validator that mints {@link OnChainBtcPubkey}.\n *\n * Extracted from `ViemVaultRegistryReader.getVaultProviderGenesisBtcPubKey` so that\n * RFC-006 operation-key resolution can produce branded keys through exactly\n * the same checks, rather than casting past the brand. Every producer of an\n * `OnChainBtcPubkey` must go through here.\n */\n\nimport type { Hex } from \"viem\";\n\nimport type { OnChainBtcPubkey } from \"./types\";\n\n/** secp256k1's base-field prime, `2^256 - 2^32 - 977`. */\nconst SECP256K1_FIELD_PRIME =\n  0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn;\n\n/** secp256k1's curve coefficient `b`, from `y^2 = x^3 + b`. */\nconst SECP256K1_CURVE_B = 7n;\n\n/** Modular exponentiation without a crypto-library dependency. */\nfunction modPow(base: bigint, exponent: bigint, modulus: bigint): bigint {\n  let result = 1n;\n  let factor = base % modulus;\n  let remaining = exponent;\n\n  while (remaining > 0n) {\n    if ((remaining & 1n) === 1n) {\n      result = (result * factor) % modulus;\n    }\n    factor = (factor * factor) % modulus;\n    remaining >>= 1n;\n  }\n\n  return result;\n}\n\n/**\n * secp256k1's field prime is congruent to 3 mod 4, so an x-coordinate is on\n * the curve iff `(x^3 + 7)^((p + 1) / 4)` squares back to `x^3 + 7` modulo\n * p. This is the same curve-membership condition used by x-only key parsers;\n * it deliberately does not merely validate length/range.\n * `x^3 + 7` cannot be zero because `-7` is not a cubic residue in this field,\n * so the zero square-root edge case is unreachable.\n */\nfunction isSecp256k1XCoordinate(value: string): boolean {\n  const x = BigInt(`0x${value}`);\n  if (x >= SECP256K1_FIELD_PRIME) return false;\n\n  const xCubed =\n    (((x * x) % SECP256K1_FIELD_PRIME) * x) % SECP256K1_FIELD_PRIME;\n  const curveValue = (xCubed + SECP256K1_CURVE_B) % SECP256K1_FIELD_PRIME;\n  const y = modPow(\n    curveValue,\n    (SECP256K1_FIELD_PRIME + 1n) >> 2n,\n    SECP256K1_FIELD_PRIME,\n  );\n\n  return (y * y) % SECP256K1_FIELD_PRIME === curveValue;\n}\n\n/**\n * Validate a registry-returned `bytes32` as an x-only BTC pubkey and mint the\n * brand. Checks length, hex form, and secp256k1 curve membership. Returns\n * 64-char lowercase hex without the `0x` prefix.\n *\n * `label` identifies the read site in error messages (e.g.\n * `getOperationBtcKeyAtEpoch (vp=0x…, epoch=0)`), so a failure names which\n * participant and which getter produced it.\n *\n * A zero hash fails the curve check, so an unregistered operator or an epoch\n * with no bonded key surfaces as an error rather than a silent all-zero key.\n */\nexport function assertOnChainBtcPubkey(\n  value: Hex,\n  label: string,\n): OnChainBtcPubkey {\n  const lowered = value.toLowerCase();\n  if (!/^0x[0-9a-f]{64}$/.test(lowered)) {\n    throw new Error(\n      `${label} returned an unexpected value (length ${lowered.length}, prefix \"${lowered.slice(0, 2)}\")`,\n    );\n  }\n  const stripped = lowered.slice(2);\n  if (!isSecp256k1XCoordinate(stripped)) {\n    throw new Error(\n      `${label} returned a value that is not on the secp256k1 curve`,\n    );\n  }\n  return stripped as OnChainBtcPubkey;\n}\n","import { schnorr, secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { ripemd160 } from \"@noble/hashes/legacy.js\";\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport { bytesToHex, hexToBytes } from \"@noble/hashes/utils.js\";\nimport type { Hex } from \"viem\";\n\nimport { MAX_PAYOUT_SCRIPT_LEN } from \"../../primitives/psbt/constants\";\nimport { assertOnChainBtcPubkey } from \"./onChainBtcPubkey\";\n\nconst P2TR_SCRIPT_PREFIX = \"5120\";\nconst P2WPKH_SCRIPT_PREFIX = \"0014\";\nconst HASH160_BYTES = 20;\nconst COMPRESSED_PUBKEY_BYTES = 33;\nconst UNCOMPRESSED_PUBKEY_BYTES = 65;\nconst SEC1_EVEN_Y_PREFIX = 0x02;\nconst SEC1_ODD_Y_PREFIX = 0x03;\nconst SEC1_UNCOMPRESSED_PREFIX = 0x04;\n\nfunction normalizeHex(value: string, label: string): Hex {\n  const body =\n    value.startsWith(\"0x\") || value.startsWith(\"0X\") ? value.slice(2) : value;\n  if (!/^(?:[0-9a-fA-F]{2})+$/.test(body)) {\n    throw new Error(`${label} must be non-empty, even-length hex`);\n  }\n  return `0x${body.toLowerCase()}`;\n}\n\n/**\n * The BIP-86 key-path P2TR scriptPubKey of an x-only key (bare lowercase\n * hex): the internal key tweaked with no script tree, matching Rust\n * `Bip86KeyConnector` (btc-vault `connectors/mod.rs:237-268` @ ac4954e7).\n *\n * @internal\n */\nexport function deriveP2trScript(xOnlyPubkey: string): Hex {\n  const pubkeyBytes = hexToBytes(xOnlyPubkey);\n  const internalKey = schnorr.utils.lift_x(BigInt(`0x${xOnlyPubkey}`));\n  const tweak = schnorr.utils.bytesToNumberBE(\n    schnorr.utils.taggedHash(\"TapTweak\", pubkeyBytes),\n  );\n  if (tweak >= secp256k1.CURVE.n) {\n    throw new Error(\"Proof of possession BTC pubkey has an invalid TapTweak\");\n  }\n  const outputKey =\n    tweak === 0n\n      ? internalKey\n      : internalKey.add(schnorr.Point.BASE.multiply(tweak));\n  return `0x${P2TR_SCRIPT_PREFIX}${bytesToHex(\n    schnorr.utils.pointToBytes(outputKey),\n  )}`;\n}\n\nfunction normalizePayoutPubkey(value: string): {\n  xOnlyPubkey: string;\n  compressedPubkey?: Uint8Array;\n} {\n  const normalized = normalizeHex(value, \"depositorBtcPubkeyRaw\");\n  const pubkey = hexToBytes(normalized.slice(2));\n  if (pubkey.length === 32) {\n    return {\n      xOnlyPubkey: assertOnChainBtcPubkey(normalized, \"Payout BTC pubkey\"),\n    };\n  }\n  const isCompressed =\n    pubkey.length === COMPRESSED_PUBKEY_BYTES &&\n    (pubkey[0] === SEC1_EVEN_Y_PREFIX || pubkey[0] === SEC1_ODD_Y_PREFIX);\n  const isUncompressed =\n    pubkey.length === UNCOMPRESSED_PUBKEY_BYTES &&\n    pubkey[0] === SEC1_UNCOMPRESSED_PREFIX;\n  if (!isCompressed && !isUncompressed) {\n    throw new Error(\n      \"depositorBtcPubkeyRaw must be x-only, compressed, or uncompressed\",\n    );\n  }\n  try {\n    secp256k1.Point.fromBytes(pubkey);\n  } catch {\n    throw new Error(\"depositorBtcPubkeyRaw is not a valid BTC pubkey\");\n  }\n  return {\n    xOnlyPubkey: bytesToHex(pubkey.subarray(1, COMPRESSED_PUBKEY_BYTES)),\n    compressedPubkey: isCompressed ? pubkey : undefined,\n  };\n}\n\nfunction deriveP2wpkhScript(pubkey: Uint8Array): Hex {\n  return `0x${P2WPKH_SCRIPT_PREFIX}${bytesToHex(ripemd160(sha256(pubkey)))}`;\n}\n\n/** Verify the irreversible payout script at the final submission boundary. */\nexport function assertPayoutScriptMatchesPopKey(\n  scriptPubKey: string,\n  depositorBtcPubkey: string,\n  depositorBtcPubkeyRaw: string,\n): Hex {\n  const payoutScript = normalizeHex(\n    scriptPubKey,\n    \"depositorPayoutScriptPubKey\",\n  );\n  if ((payoutScript.length - 2) / 2 > MAX_PAYOUT_SCRIPT_LEN) {\n    throw new Error(\n      `depositorPayoutScriptPubKey exceeds ${MAX_PAYOUT_SCRIPT_LEN} bytes`,\n    );\n  }\n  const keyBody =\n    depositorBtcPubkey.startsWith(\"0x\") || depositorBtcPubkey.startsWith(\"0X\")\n      ? depositorBtcPubkey.slice(2)\n      : depositorBtcPubkey;\n  const xOnlyPubkey = assertOnChainBtcPubkey(\n    `0x${keyBody}` as Hex,\n    \"Proof of possession BTC pubkey\",\n  );\n  const payoutPubkey = normalizePayoutPubkey(depositorBtcPubkeyRaw);\n  if (payoutPubkey.xOnlyPubkey !== xOnlyPubkey) {\n    throw new Error(\n      \"depositorBtcPubkeyRaw does not match the proof of possession BTC pubkey\",\n    );\n  }\n\n  if (payoutScript === deriveP2trScript(xOnlyPubkey)) {\n    return payoutScript;\n  }\n  if (\n    payoutScript.startsWith(`0x${P2WPKH_SCRIPT_PREFIX}`) &&\n    payoutScript.length ===\n      2 + P2WPKH_SCRIPT_PREFIX.length + HASH160_BYTES * 2\n  ) {\n    if (!payoutPubkey.compressedPubkey) {\n      throw new Error(\"A P2WPKH payout requires a compressed BTC pubkey\");\n    }\n    if (payoutScript === deriveP2wpkhScript(payoutPubkey.compressedPubkey)) {\n      return payoutScript;\n    }\n  }\n  throw new Error(\n    \"depositorPayoutScriptPubKey does not match the proof of possession BTC pubkey\",\n  );\n}\n","/**\n * Dependency-free Bitcoin txid and vault-ID helpers for Ethereum-only clients.\n * Transaction hex and vault-ID inputs accept an optional `0x` prefix.\n * Depositor addresses use strict EIP-55 validation.\n * Txids use a `0x` prefix. Vault IDs use no prefix. Both use lowercase hex.\n */\n\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport {\n  encodeAbiParameters,\n  isAddress,\n  keccak256,\n  type Address,\n  type Hex,\n} from \"viem\";\n\n/** Decode an optional-prefixed, even-length hex string. */\nfunction decodeHex(value: string, label: string): Uint8Array {\n  const clean = value.startsWith(\"0x\") ? value.slice(2) : value;\n  if (clean.length === 0 || clean.length % 2 !== 0) {\n    throw new Error(`${label} must be non-empty, even-length hex`);\n  }\n  if (!/^[0-9a-fA-F]+$/.test(clean)) {\n    throw new Error(`${label} contains non-hex characters`);\n  }\n\n  const bytes = new Uint8Array(clean.length / 2);\n  for (let i = 0; i < bytes.length; i++) {\n    bytes[i] = Number.parseInt(clean.slice(i * 2, i * 2 + 2), 16);\n  }\n  return bytes;\n}\n\n/** Encode bytes as lowercase hex without a prefix. */\nfunction encodeHex(bytes: Uint8Array): string {\n  return Array.from(bytes, (byte) => byte.toString(16).padStart(2, \"0\")).join(\n    \"\",\n  );\n}\n\n/** Concatenate byte chunks without a buffer dependency. */\nfunction concatBytes(chunks: readonly Uint8Array[]): Uint8Array {\n  const result = new Uint8Array(\n    chunks.reduce((length, chunk) => length + chunk.length, 0),\n  );\n  let offset = 0;\n  for (const chunk of chunks) {\n    result.set(chunk, offset);\n    offset += chunk.length;\n  }\n  return result;\n}\n\n/**\n * Parse enough of Bitcoin's consensus transaction encoding to serialize the\n * no-witness form used for txid calculation. Every length is bounds-checked;\n * malformed/trailing data is rejected rather than hashed as an opaque blob.\n */\nfunction serializeWithoutWitness(transaction: Uint8Array): Uint8Array {\n  let offset = 0;\n\n  const take = (length: number, label: string): Uint8Array => {\n    if (!Number.isSafeInteger(length) || length < 0) {\n      throw new Error(`Invalid ${label} length ${length}`);\n    }\n    if (offset + length > transaction.length) {\n      throw new Error(`Truncated Bitcoin transaction while reading ${label}`);\n    }\n    const value = transaction.slice(offset, offset + length);\n    offset += length;\n    return value;\n  };\n\n  const readLittleEndian = (length: number, label: string): bigint => {\n    const bytes = take(length, label);\n    let value = 0n;\n    for (let i = bytes.length - 1; i >= 0; i--) {\n      value = (value << 8n) | BigInt(bytes[i]);\n    }\n    return value;\n  };\n\n  const readCompactSize = (\n    label: string,\n  ): { encoded: Uint8Array; value: number } => {\n    const start = offset;\n    const prefix = take(1, label)[0];\n    let value: bigint;\n    if (prefix < 0xfd) {\n      value = BigInt(prefix);\n    } else if (prefix === 0xfd) {\n      value = readLittleEndian(2, label);\n      if (value < 0xfdn) throw new Error(`Non-canonical ${label}`);\n    } else if (prefix === 0xfe) {\n      value = readLittleEndian(4, label);\n      if (value <= 0xffffn) throw new Error(`Non-canonical ${label}`);\n    } else {\n      value = readLittleEndian(8, label);\n      if (value <= 0xffffffffn) throw new Error(`Non-canonical ${label}`);\n    }\n    if (value > BigInt(Number.MAX_SAFE_INTEGER)) {\n      throw new Error(`${label} exceeds JavaScript's safe integer range`);\n    }\n    return {\n      encoded: transaction.slice(start, offset),\n      value: Number(value),\n    };\n  };\n\n  const version = take(4, \"version\");\n  const hasWitness =\n    transaction[offset] === 0x00 && transaction[offset + 1] === 0x01;\n  if (hasWitness) offset += 2;\n\n  const inputCount = readCompactSize(\"input count\");\n  const inputs: Uint8Array[] = [];\n  for (let i = 0; i < inputCount.value; i++) {\n    const start = offset;\n    take(32, `input ${i} previous transaction hash`);\n    take(4, `input ${i} previous output index`);\n    const scriptLength = readCompactSize(`input ${i} script length`);\n    take(scriptLength.value, `input ${i} script`);\n    take(4, `input ${i} sequence`);\n    inputs.push(transaction.slice(start, offset));\n  }\n\n  const outputCount = readCompactSize(\"output count\");\n  const outputs: Uint8Array[] = [];\n  for (let i = 0; i < outputCount.value; i++) {\n    const start = offset;\n    take(8, `output ${i} value`);\n    const scriptLength = readCompactSize(`output ${i} script length`);\n    take(scriptLength.value, `output ${i} script`);\n    outputs.push(transaction.slice(start, offset));\n  }\n\n  if (hasWitness) {\n    let hasWitnessData = false;\n    for (let i = 0; i < inputCount.value; i++) {\n      const itemCount = readCompactSize(`input ${i} witness item count`);\n      hasWitnessData ||= itemCount.value > 0;\n      for (let j = 0; j < itemCount.value; j++) {\n        const itemLength = readCompactSize(\n          `input ${i} witness item ${j} length`,\n        );\n        take(itemLength.value, `input ${i} witness item ${j}`);\n      }\n    }\n    if (!hasWitnessData) {\n      throw new Error(\"Bitcoin transaction has superfluous witness marker\");\n    }\n  }\n\n  const locktime = take(4, \"locktime\");\n  if (offset !== transaction.length) {\n    throw new Error(\n      `Bitcoin transaction has ${transaction.length - offset} trailing byte(s)`,\n    );\n  }\n\n  return concatBytes([\n    version,\n    inputCount.encoded,\n    ...inputs,\n    outputCount.encoded,\n    ...outputs,\n    locktime,\n  ]);\n}\n\n/** Calculate a Bitcoin txid without importing bitcoinjs-lib. */\nexport function calculateBtcTxHash(transactionHex: string): Hex {\n  const serialized = serializeWithoutWitness(\n    decodeHex(transactionHex, \"transactionHex\"),\n  );\n  const digest = sha256(sha256(serialized));\n  digest.reverse();\n  return `0x${encodeHex(digest)}`;\n}\n\n/**\n * Derive the Solidity vault ID without loading the Rust/WASM package.\n *\n * Inputs accept an optional `0x` prefix to match the current PeginManager\n * call sites. Address validation stays strict: lowercase and valid EIP-55\n * addresses pass, while uppercase and incorrectly checksummed mixed-case\n * addresses fail. The synchronous result is lowercase hex without a prefix,\n * matching the WASM helper that this function replaces.\n */\nexport function derivePeginVaultId(\n  peginTxHash: string,\n  depositor: string,\n): string {\n  const normalizedPeginTxHash = peginTxHash.startsWith(\"0x\")\n    ? peginTxHash\n    : `0x${peginTxHash}`;\n  if (!/^0x[0-9a-fA-F]{64}$/.test(normalizedPeginTxHash)) {\n    throw new Error(\"peginTxHash must be a 32-byte hex value\");\n  }\n  const normalizedDepositor = depositor.startsWith(\"0x\")\n    ? depositor\n    : `0x${depositor}`;\n  if (!isAddress(normalizedDepositor, { strict: true })) {\n    throw new Error(`Invalid depositor Ethereum address: ${depositor}`);\n  }\n  return keccak256(\n    encodeAbiParameters(\n      [{ type: \"bytes32\" }, { type: \"address\" }],\n      [normalizedPeginTxHash as Hex, normalizedDepositor as Address],\n    ),\n  ).slice(2);\n}\n","/**\n * Typed absence of a vault's `VaultClaimableBy` log for a claimer key.\n *\n * Distinct from a transport failure: the scan covered the whole range and\n * found nothing. That is what a not-yet-redeemed vault looks like, and it is\n * also what a load-balanced public node that lacks the block answers, so a\n * caller that knows the vault is redeemed may retry. Name-matchable across\n * module instances like `RegistrationLogsUnavailableError`.\n *\n * @module clients/eth/claimable-event-error\n */\n\nimport type { Hex } from \"viem\";\n\n/** The `name` this error carries, so a foreign module instance still matches. */\nexport const VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME =\n  \"VaultClaimableByNotFoundError\";\n\n/** @experimental */\nexport class VaultClaimableByNotFoundError extends Error {\n  constructor(\n    readonly vaultId: Hex,\n    readonly claimerPk: Hex,\n    readonly fromBlock: bigint,\n    readonly toBlock: bigint,\n    detail = \"the vault has not been redeemed for this key, or the node did not serve the block. Redeem first, or try again.\",\n    options?: ErrorOptions,\n  ) {\n    super(\n      `No VaultClaimableBy log for vault ${vaultId} and claimer ${claimerPk} in blocks ` +\n        `${fromBlock}..${toBlock}: ${detail}`,\n      options,\n    );\n    this.name = VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME;\n  }\n}\n\n/** Matches `instanceof` OR the documented `name` (dual module instances). @experimental */\nexport function isVaultClaimableByNotFoundError(\n  err: unknown,\n): err is VaultClaimableByNotFoundError {\n  if (err instanceof VaultClaimableByNotFoundError) return true;\n  if (typeof err !== \"object\" || err === null) return false;\n  return (\n    (err as { name?: unknown }).name === VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME\n  );\n}\n","/**\n * Validation for protocol parameters fetched from the ProtocolParams contract.\n *\n * These values feed Bitcoin script construction and deposit validation.\n * Invalid params must be caught before they reach transaction-building code,\n * since errors after wallet signing prompts are unrecoverable.\n *\n * The {@link ViemProtocolParamsReader} runs these on every read; consumers\n * implementing their own reader against the same `ProtocolParamsReader`\n * interface should call them too.\n */\n\nimport { assertValidVaultCoreVersion } from \"../../primitives/vaultCoreVersion\";\n\nimport type {\n  PegInConfiguration,\n  TBVProtocolParams,\n  VersionedOffchainParams,\n} from \"./types\";\n\n/**\n * Maximum value for a Solidity uint16. btc-vault carries the PegIn timelock as\n * a `NonZeroU16` (`transactions/pegin.rs:33` @ ac4954e7).\n */\nconst UINT16_MAX = 65535;\n\n/** Maximum valid value for basis points (100%) */\nconst MAX_BASIS_POINTS = 10000;\n\n/** Maximum value for a Solidity uint32. */\nconst UINT32_MAX = 4_294_967_295;\n\n/** Maximum valid value for a uint8 (e.g. maxHtlcOutputCount). */\nconst UINT8_MAX = 255;\n\n/**\n * Validate an `offchainParamsVersion` value sourced from a contract read.\n * `Number()` on a malformed payload yields `NaN` or a non-integer; both\n * silently break consumers that loop `1..version` or use the value as a\n * map key. Used by reader entry points that surface the version to JS.\n */\nexport function assertValidOffchainParamsVersion(version: number): void {\n  if (\n    !Number.isInteger(version) ||\n    version < 0 ||\n    version > UINT32_MAX\n  ) {\n    throw new Error(\n      `Invalid offchainParamsVersion from contract: must be a uint32, got ${version}`,\n    );\n  }\n}\n\n/**\n * Validate offchain params consistency and bounds.\n * @throws Error on invalid values to prevent constructing invalid Bitcoin scripts.\n */\nexport function validateOffchainParams(params: VersionedOffchainParams): void {\n  const errors: string[] = [];\n\n  if (params.timelockAssert <= 0n) {\n    errors.push(\n      `timelockAssert must be positive, got ${params.timelockAssert}`,\n    );\n  }\n  if (params.timelockAssert > BigInt(UINT16_MAX)) {\n    errors.push(\n      `timelockAssert ${params.timelockAssert} exceeds uint16 max (${UINT16_MAX})`,\n    );\n  }\n\n  if (params.timelockChallengeAssert <= 0n) {\n    errors.push(\n      `timelockChallengeAssert must be positive, got ${params.timelockChallengeAssert}`,\n    );\n  }\n\n  if (params.tRefund <= 0) {\n    errors.push(`tRefund must be positive, got ${params.tRefund}`);\n  }\n\n  if (params.tStale <= 0) {\n    errors.push(`tStale must be positive, got ${params.tStale}`);\n  }\n\n  if (params.securityCouncilKeys.length === 0) {\n    errors.push(\"securityCouncilKeys must not be empty\");\n  }\n\n  if (params.councilQuorum <= 0) {\n    errors.push(`councilQuorum must be positive, got ${params.councilQuorum}`);\n  }\n  if (params.councilQuorum > params.securityCouncilKeys.length) {\n    errors.push(\n      `councilQuorum (${params.councilQuorum}) exceeds securityCouncilKeys count (${params.securityCouncilKeys.length})`,\n    );\n  }\n\n  if (params.feeRate <= 0n) {\n    errors.push(`feeRate must be positive, got ${params.feeRate}`);\n  }\n\n  if (params.minPeginFeeRate <= 0n) {\n    errors.push(\n      `minPeginFeeRate must be positive, got ${params.minPeginFeeRate}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.proverCircuitVersion) ||\n    params.proverCircuitVersion < 0 ||\n    params.proverCircuitVersion > UINT16_MAX\n  ) {\n    errors.push(\n      `proverCircuitVersion must be a uint16, got ${params.proverCircuitVersion}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.minPrepeginDepth) ||\n    params.minPrepeginDepth <= 0 ||\n    params.minPrepeginDepth > UINT32_MAX\n  ) {\n    errors.push(\n      `minPrepeginDepth must be a uint32 in [1, ${UINT32_MAX}], got ${params.minPrepeginDepth}`,\n    );\n  }\n\n  if (params.babeTotalInstances <= 0) {\n    errors.push(\n      `babeTotalInstances must be positive, got ${params.babeTotalInstances}`,\n    );\n  }\n  if (params.babeInstancesToFinalize <= 0) {\n    errors.push(\n      `babeInstancesToFinalize must be positive, got ${params.babeInstancesToFinalize}`,\n    );\n  }\n  if (params.babeInstancesToFinalize > params.babeTotalInstances) {\n    errors.push(\n      `babeInstancesToFinalize (${params.babeInstancesToFinalize}) exceeds babeTotalInstances (${params.babeTotalInstances})`,\n    );\n  }\n\n  if (\n    params.minVpCommissionBps < 0 ||\n    params.minVpCommissionBps > MAX_BASIS_POINTS\n  ) {\n    errors.push(\n      `minVpCommissionBps must be in [0, ${MAX_BASIS_POINTS}], got ${params.minVpCommissionBps}`,\n    );\n  }\n\n  if (errors.length > 0) {\n    throw new Error(\n      `Invalid offchain protocol parameters: ${errors.join(\"; \")}`,\n    );\n  }\n}\n\n/**\n * Validate TBV protocol params returned from the contract.\n * @throws Error on invalid amounts or out-of-range bounded fields.\n */\nexport function validateTBVProtocolParams(params: TBVProtocolParams): void {\n  const errors: string[] = [];\n\n  if (params.minimumPegInAmount <= 0n) {\n    errors.push(\n      `minimumPegInAmount must be positive, got ${params.minimumPegInAmount}`,\n    );\n  }\n\n  if (params.maxPegInAmount < params.minimumPegInAmount) {\n    errors.push(\n      `maxPegInAmount (${params.maxPegInAmount}) must be >= minimumPegInAmount (${params.minimumPegInAmount})`,\n    );\n  }\n\n  if (params.pegInAckTimeout <= 0n) {\n    errors.push(\n      `pegInAckTimeout must be positive, got ${params.pegInAckTimeout}`,\n    );\n  }\n\n  if (params.pegInActivationTimeout <= 0n) {\n    errors.push(\n      `pegInActivationTimeout must be positive, got ${params.pegInActivationTimeout}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.maxHtlcOutputCount) ||\n    params.maxHtlcOutputCount <= 0 ||\n    params.maxHtlcOutputCount > UINT8_MAX\n  ) {\n    errors.push(\n      `maxHtlcOutputCount must be an integer in [1, ${UINT8_MAX}], got ${params.maxHtlcOutputCount}`,\n    );\n  }\n\n  if (\n    typeof params.expiredPegInGraceBlocks !== \"bigint\" ||\n    params.expiredPegInGraceBlocks <= 0n\n  ) {\n    errors.push(\n      `expiredPegInGraceBlocks must be a positive bigint, got ${params.expiredPegInGraceBlocks}`,\n    );\n  }\n\n  if (errors.length > 0) {\n    throw new Error(`Invalid TBV protocol parameters: ${errors.join(\"; \")}`);\n  }\n}\n\n/**\n * Validate the full peg-in configuration after assembly.\n * Checks both TBV params and offchain params consistency, and the\n * top-level `offchainParamsVersion` (which originates from a separate\n * multicall result and so must be range-checked alongside the params it\n * names).\n */\nexport function validatePegInConfiguration(config: PegInConfiguration): void {\n  validateTBVProtocolParams(config);\n  validateOffchainParams(config.offchainParams);\n\n  if (\n    !Number.isInteger(config.offchainParamsVersion) ||\n    config.offchainParamsVersion < 0 ||\n    config.offchainParamsVersion > UINT32_MAX\n  ) {\n    throw new Error(\n      `Invalid peg-in configuration: offchainParamsVersion must be a uint32, got ${config.offchainParamsVersion}`,\n    );\n  }\n\n  // The contract enforces ≥ 1 (setter rejects 0); a 0 here means a\n  // mis-decoded read or a pre-vaultCoreVersion contract — fail closed.\n  assertValidVaultCoreVersion(\n    config.activeVaultCoreVersion,\n    \"ProtocolParams.activeVaultCoreVersion()\",\n  );\n}\n","/**\n * Transient failure of a registration-log read.\n *\n * Every registered vault has its `PegInSubmitted` log in its `createdAt`\n * block, so an Ethereum node answering that block's registration-log query\n * with no logs at all did not serve the block — load-balanced public RPCs\n * answer `[]` for a block a backend lacks instead of erroring, which viem's\n * transport retry cannot see (it retries errors only). Callers may retry.\n *\n * The same holds for an answer that is merely incomplete: the registry emits\n * `PegInSubmitted` and `PegInSubmittedV2` together on every submission\n * (vault-contracts-aave-v4 `PeginLogic.sol:144-147` @ c559f5c2), so a block\n * answer carrying only some of them is a partial answer as readily as it is\n * an old registry. Those shapes carry their own message.\n *\n * @module clients/eth/registration-logs-error\n */\n\n/** The `name` this error carries, so a foreign module instance still matches. */\nexport const REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME =\n  \"RegistrationLogsUnavailableError\";\n\nexport class RegistrationLogsUnavailableError extends Error {\n  readonly blockNumber: bigint;\n\n  /**\n   * `message` replaces the empty-answer wording for the partial-answer shapes\n   * that are not \"no logs at all\"; the caller names which logs it did get.\n   */\n  constructor(blockNumber: bigint, message?: string) {\n    super(\n      message ??\n        `The Ethereum node returned no registration logs for block ${blockNumber}, ` +\n          `which holds a vault registration; the node may not have indexed that ` +\n          `block yet. Try again.`,\n    );\n    this.name = REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME;\n    this.blockNumber = blockNumber;\n  }\n}\n\n/** Matches `instanceof` OR the documented `name` (dual module instances). */\nexport function isRegistrationLogsUnavailableError(\n  err: unknown,\n): err is RegistrationLogsUnavailableError {\n  if (err instanceof RegistrationLogsUnavailableError) return true;\n  if (typeof err !== \"object\" || err === null) return false;\n  return (\n    (err as { name?: unknown }).name ===\n    REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME\n  );\n}\n","/**\n * Pure helpers over {@link PeginRegistrationRecord}.\n *\n * The reader decodes a whole block leniently; the strict per-record checks\n * live here and run only on the records a caller selects, so a stranger's\n * malformed registration in the same block cannot fail an unrelated read (the\n * vault app's deposit resume reads its commission ceiling through the same\n * block). That leniency stops at duplicates: a vault registers once, so two\n * logs for any vault id are an inconsistent node and the reader fails the\n * whole block's read closed by design.\n *\n * @module clients/eth/registration-records\n */\n\nimport type { Hex } from \"viem\";\n\nimport { MAX_PAYOUT_SCRIPT_LEN } from \"../../primitives/psbt/constants\";\nimport { calculateBtcTxHash } from \"./pegin-transaction\";\nimport { RegistrationLogsUnavailableError } from \"./registration-logs-error\";\nimport type { PeginRegistrationRecord } from \"./types\";\n\nconst HEX_PREFIX_LEN = 2;\n\n/**\n * The record of `vaultId` among a block's registrations.\n *\n * @throws {RegistrationLogsUnavailableError} (transient, retry) when the\n * block's registration logs do not include the vault: the registry emits a\n * `PegInSubmittedV2` on every submission, so an answer without the target's\n * is as readily a node's partial answer as a vault registered elsewhere.\n * @experimental\n */\nexport function findRegistrationRecord(\n  records: readonly PeginRegistrationRecord[],\n  vaultId: Hex,\n  createdAt: bigint,\n): PeginRegistrationRecord {\n  const wanted = vaultId.toLowerCase();\n  const record = records.find((r) => r.vaultId === wanted);\n  if (record === undefined) {\n    // Both shapes are emitted together on every submission\n    // (vault-contracts-aave-v4 `PeginLogic.sol:144-147` @ c559f5c2).\n    throw new RegistrationLogsUnavailableError(\n      createdAt,\n      `Vault ${vaultId} has no PegInSubmittedV2 registration log at its on-chain registration ` +\n        `block ${createdAt}: either the node served a partial answer for block ${createdAt} ` +\n        `(retry, preferably another node) or the vault was not registered in this block`,\n    );\n  }\n  return record;\n}\n\n/**\n * Txid of the record's `unsignedPrePeginTx`, `0x`-prefixed display order —\n * what the vault record stores as `prePeginTxHash`.\n *\n * @throws When the log's transaction does not parse.\n * @experimental\n */\nexport function registrationPrePeginTxHash(\n  record: PeginRegistrationRecord,\n): Hex {\n  return calculateBtcTxHash(record.unsignedPrePeginTx);\n}\n\n/**\n * The bound `assertPayoutScriptMatchesPopKey` enforces before a registration\n * is submitted (payout-script.ts); a log outside it is not a script the SDK\n * ever registered.\n *\n * @experimental\n */\nexport function assertRegisteredPayoutScriptBounds(\n  record: PeginRegistrationRecord,\n): void {\n  const bytes =\n    (record.depositorPayoutScriptPubKey.length - HEX_PREFIX_LEN) / 2;\n  if (bytes === 0 || bytes > MAX_PAYOUT_SCRIPT_LEN) {\n    throw new Error(\n      `PegInSubmittedV2 log for vault ${record.vaultId} carries a ${bytes}-byte ` +\n        `depositorPayoutBtcAddress; expected 1..${MAX_PAYOUT_SCRIPT_LEN} bytes`,\n    );\n  }\n}\n"],"names":["Rho160","Id160","_","i","Pi160","idxLR","res","j","k","idxL","idxR","shifts160","shiftsL160","idx","shiftsR160","Kl160","Kr160","ripemd_f","group","x","y","z","BUF_160","_RIPEMD160","HashMD","__publicField","h0","h1","h2","h3","h4","view","offset","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","rotl","tr","clean","ripemd160","createHasher","SECP256K1_FIELD_PRIME","SECP256K1_CURVE_B","modPow","base","exponent","modulus","result","factor","remaining","isSecp256k1XCoordinate","value","curveValue","assertOnChainBtcPubkey","label","lowered","stripped","P2TR_SCRIPT_PREFIX","P2WPKH_SCRIPT_PREFIX","HASH160_BYTES","COMPRESSED_PUBKEY_BYTES","UNCOMPRESSED_PUBKEY_BYTES","SEC1_EVEN_Y_PREFIX","SEC1_ODD_Y_PREFIX","SEC1_UNCOMPRESSED_PREFIX","normalizeHex","body","deriveP2trScript","xOnlyPubkey","pubkeyBytes","hexToBytes","internalKey","schnorr","tweak","secp256k1","outputKey","bytesToHex","normalizePayoutPubkey","normalized","pubkey","isCompressed","isUncompressed","deriveP2wpkhScript","sha256","assertPayoutScriptMatchesPopKey","scriptPubKey","depositorBtcPubkey","depositorBtcPubkeyRaw","payoutScript","MAX_PAYOUT_SCRIPT_LEN","keyBody","payoutPubkey","decodeHex","bytes","encodeHex","byte","concatBytes","chunks","length","chunk","serializeWithoutWitness","transaction","take","readLittleEndian","readCompactSize","start","prefix","version","hasWitness","inputCount","inputs","scriptLength","outputCount","outputs","hasWitnessData","itemCount","itemLength","locktime","calculateBtcTxHash","transactionHex","serialized","digest","derivePeginVaultId","peginTxHash","depositor","normalizedPeginTxHash","normalizedDepositor","isAddress","keccak256","encodeAbiParameters","VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME","VaultClaimableByNotFoundError","vaultId","claimerPk","fromBlock","toBlock","detail","options","isVaultClaimableByNotFoundError","err","UINT16_MAX","MAX_BASIS_POINTS","UINT32_MAX","UINT8_MAX","assertValidOffchainParamsVersion","validateOffchainParams","params","errors","validateTBVProtocolParams","validatePegInConfiguration","config","assertValidVaultCoreVersion","REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME","RegistrationLogsUnavailableError","blockNumber","message","isRegistrationLogsUnavailableError","HEX_PREFIX_LEN","findRegistrationRecord","records","createdAt","wanted","record","r","registrationPrePeginTxHash","assertRegisteredPayoutScriptBounds"],"mappings":";;;;;;;AA8KA,MAAMA,KAAyB,2BAAW,KAAK;AAAA,EAC3C;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AACvD,CAAC,GACKC,IAA+B,WAAW,KAAK,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAACC,GAAGC,MAAMA,CAAC,CAAC,GACrFC,KAA+BH,EAAM,IAAI,CAACE,OAAO,IAAIA,IAAI,KAAK,EAAE,GAChEE,IAAyB,uBAAM;AAGjC,QAAMC,IAAM,CAFF,CAACL,CAAK,GACN,CAACG,EAAK,CACC;AACjB,WAASD,IAAI,GAAGA,IAAI,GAAGA;AACnB,aAASI,KAAKD;AACV,MAAAC,EAAE,KAAKA,EAAEJ,CAAC,EAAE,IAAI,CAACK,MAAMR,GAAOQ,CAAC,CAAC,CAAC;AACzC,SAAOF;AACX,GAAC,GACKG,IAA8BJ,EAAM,CAAC,GACrCK,IAA8BL,EAAM,CAAC,GAErCM,IAA4B;AAAA,EAC9B,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAC3D,EAAE,IAAI,CAACR,MAAM,WAAW,KAAKA,CAAC,CAAC,GACzBS,KAA6B,gBAAAH,EAAK,IAAI,CAACI,GAAKV,MAAMU,EAAI,IAAI,CAACN,MAAMI,EAAUR,CAAC,EAAEI,CAAC,CAAC,CAAC,GACjFO,KAA6B,gBAAAJ,EAAK,IAAI,CAACG,GAAKV,MAAMU,EAAI,IAAI,CAACN,MAAMI,EAAUR,CAAC,EAAEI,CAAC,CAAC,CAAC,GACjFQ,KAAwB,4BAAY,KAAK;AAAA,EAC3C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC,GACKC,KAAwB,4BAAY,KAAK;AAAA,EAC3C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC;AAED,SAASC,EAASC,GAAOC,GAAGC,GAAGC,GAAG;AAC9B,SAAIH,MAAU,IACHC,IAAIC,IAAIC,IACfH,MAAU,IACFC,IAAIC,IAAM,CAACD,IAAIE,IACvBH,MAAU,KACFC,IAAI,CAACC,KAAKC,IAClBH,MAAU,IACFC,IAAIE,IAAMD,IAAI,CAACC,IACpBF,KAAKC,IAAI,CAACC;AACrB;AAEA,MAAMC,IAA0B,oBAAI,YAAY,EAAE;AAC3C,MAAMC,WAAmBC,GAAO;AAAA,EAMnC,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAI;AANzB,IAAAC,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AAAA,EAGL;AAAA,EACA,MAAM;AACF,UAAM,EAAE,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAE,IAAK;AAC/B,WAAO,CAACJ,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC9B;AAAA,EACA,IAAIJ,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AACpB,SAAK,KAAKJ,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EACnB;AAAA,EACA,QAAQC,GAAMC,GAAQ;AAClB,aAAS7B,IAAI,GAAGA,IAAI,IAAIA,KAAK6B,KAAU;AACnC,MAAAV,EAAQnB,CAAC,IAAI4B,EAAK,UAAUC,GAAQ,EAAI;AAE5C,QAAIC,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD;AAGvI,aAASvB,IAAQ,GAAGA,IAAQ,GAAGA,KAAS;AACpC,YAAMyB,IAAS,IAAIzB,GACb0B,IAAM7B,GAAMG,CAAK,GAAG2B,IAAM7B,GAAME,CAAK,GACrC4B,IAAKrC,EAAKS,CAAK,GAAG6B,IAAKrC,EAAKQ,CAAK,GACjC8B,IAAKpC,GAAWM,CAAK,GAAG+B,IAAKnC,GAAWI,CAAK;AACnD,eAASf,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAM+C,IAAMC,EAAKlB,IAAKhB,EAASC,GAAOiB,GAAIE,GAAIE,CAAE,IAAIjB,EAAQwB,EAAG3C,CAAC,CAAC,IAAIyC,GAAKI,EAAG7C,CAAC,CAAC,IAAIsC,IAAM;AACzF,QAAAR,IAAKQ,GAAIA,IAAKF,GAAIA,IAAKY,EAAKd,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKe;AAAA,MAC3D;AAEA,eAAS/C,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMiD,IAAMD,EAAKjB,IAAKjB,EAAS0B,GAAQP,GAAIE,GAAIE,CAAE,IAAIlB,EAAQyB,EAAG5C,CAAC,CAAC,IAAI0C,GAAKI,EAAG9C,CAAC,CAAC,IAAIuC,IAAM;AAC1F,QAAAR,IAAKQ,GAAIA,IAAKF,GAAIA,IAAKW,EAAKb,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKgB;AAAA,MAC3D;AAAA,IACJ;AAEA,SAAK,IAAK,KAAK,KAAKf,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKP,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,CAAC;AAAA,EACxI;AAAA,EACA,aAAa;AACT,IAAAe,EAAM/B,CAAO;AAAA,EACjB;AAAA,EACA,UAAU;AACN,SAAK,YAAY,IACjB+B,EAAM,KAAK,MAAM,GACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC1B;AACJ;AAMY,MAACC,KAA4B,gBAAAC,GAAa,MAAM,IAAIhC,GAAU,CAAE,GCzQtEiC,IACJ,qEAGIC,KAAoB;AAG1B,SAASC,GAAOC,GAAcC,GAAkBC,GAAyB;AACvE,MAAIC,IAAS,IACTC,IAASJ,IAAOE,GAChBG,IAAYJ;AAEhB,SAAOI,IAAY;AACjB,KAAKA,IAAY,QAAQ,OACvBF,IAAUA,IAASC,IAAUF,IAE/BE,IAAUA,IAASA,IAAUF,GAC7BG,MAAc;AAGhB,SAAOF;AACT;AAUA,SAASG,GAAuBC,GAAwB;AACtD,QAAM/C,IAAI,OAAO,KAAK+C,CAAK,EAAE;AAC7B,MAAI/C,KAAKqC,EAAuB,QAAO;AAIvC,QAAMW,KADDhD,IAAIA,IAAKqC,IAAyBrC,IAAKqC,IACfC,MAAqBD,GAC5CpC,IAAIsC;AAAA,IACRS;AAAA,IACCX,IAAwB,MAAO;AAAA,IAChCA;AAAA,EAAA;AAGF,SAAQpC,IAAIA,IAAKoC,MAA0BW;AAC7C;AAcO,SAASC,EACdF,GACAG,GACkB;AAClB,QAAMC,IAAUJ,EAAM,YAAA;AACtB,MAAI,CAAC,mBAAmB,KAAKI,CAAO;AAClC,UAAM,IAAI;AAAA,MACR,GAAGD,CAAK,yCAAyCC,EAAQ,MAAM,aAAaA,EAAQ,MAAM,GAAG,CAAC,CAAC;AAAA,IAAA;AAGnG,QAAMC,IAAWD,EAAQ,MAAM,CAAC;AAChC,MAAI,CAACL,GAAuBM,CAAQ;AAClC,UAAM,IAAI;AAAA,MACR,GAAGF,CAAK;AAAA,IAAA;AAGZ,SAAOE;AACT;ACjFA,MAAMC,KAAqB,QACrBC,IAAuB,QACvBC,KAAgB,IAChBC,IAA0B,IAC1BC,KAA4B,IAC5BC,KAAqB,GACrBC,KAAoB,GACpBC,KAA2B;AAEjC,SAASC,EAAad,GAAeG,GAAoB;AACvD,QAAMY,IACJf,EAAM,WAAW,IAAI,KAAKA,EAAM,WAAW,IAAI,IAAIA,EAAM,MAAM,CAAC,IAAIA;AACtE,MAAI,CAAC,wBAAwB,KAAKe,CAAI;AACpC,UAAM,IAAI,MAAM,GAAGZ,CAAK,qCAAqC;AAE/D,SAAO,KAAKY,EAAK,YAAA,CAAa;AAChC;AASO,SAASC,GAAiBC,GAA0B;AACzD,QAAMC,IAAcC,EAAWF,CAAW,GACpCG,IAAcC,EAAQ,MAAM,OAAO,OAAO,KAAKJ,CAAW,EAAE,CAAC,GAC7DK,IAAQD,EAAQ,MAAM;AAAA,IAC1BA,EAAQ,MAAM,WAAW,YAAYH,CAAW;AAAA,EAAA;AAElD,MAAII,KAASC,EAAU,MAAM;AAC3B,UAAM,IAAI,MAAM,wDAAwD;AAE1E,QAAMC,IACJF,MAAU,KACNF,IACAA,EAAY,IAAIC,EAAQ,MAAM,KAAK,SAASC,CAAK,CAAC;AACxD,SAAO,KAAKhB,EAAkB,GAAGmB;AAAA,IAC/BJ,EAAQ,MAAM,aAAaG,CAAS;AAAA,EAAA,CACrC;AACH;AAEA,SAASE,GAAsB1B,GAG7B;AACA,QAAM2B,IAAab,EAAad,GAAO,uBAAuB,GACxD4B,IAAST,EAAWQ,EAAW,MAAM,CAAC,CAAC;AAC7C,MAAIC,EAAO,WAAW;AACpB,WAAO;AAAA,MACL,aAAa1B,EAAuByB,GAAY,mBAAmB;AAAA,IAAA;AAGvE,QAAME,IACJD,EAAO,WAAWnB,MACjBmB,EAAO,CAAC,MAAMjB,MAAsBiB,EAAO,CAAC,MAAMhB,KAC/CkB,IACJF,EAAO,WAAWlB,MAClBkB,EAAO,CAAC,MAAMf;AAChB,MAAI,CAACgB,KAAgB,CAACC;AACpB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAGJ,MAAI;AACF,IAAAP,EAAU,MAAM,UAAUK,CAAM;AAAA,EAClC,QAAQ;AACN,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,SAAO;AAAA,IACL,aAAaH,EAAWG,EAAO,SAAS,GAAGnB,CAAuB,CAAC;AAAA,IACnE,kBAAkBoB,IAAeD,IAAS;AAAA,EAAA;AAE9C;AAEA,SAASG,GAAmBH,GAAyB;AACnD,SAAO,KAAKrB,CAAoB,GAAGkB,EAAWrC,GAAU4C,EAAOJ,CAAM,CAAC,CAAC,CAAC;AAC1E;AAGO,SAASK,GACdC,GACAC,GACAC,GACK;AACL,QAAMC,IAAevB;AAAA,IACnBoB;AAAA,IACA;AAAA,EAAA;AAEF,OAAKG,EAAa,SAAS,KAAK,IAAIC;AAClC,UAAM,IAAI;AAAA,MACR,uCAAuCA,CAAqB;AAAA,IAAA;AAGhE,QAAMC,IACJJ,EAAmB,WAAW,IAAI,KAAKA,EAAmB,WAAW,IAAI,IACrEA,EAAmB,MAAM,CAAC,IAC1BA,GACAlB,IAAcf;AAAA,IAClB,KAAKqC,CAAO;AAAA,IACZ;AAAA,EAAA,GAEIC,IAAed,GAAsBU,CAAqB;AAChE,MAAII,EAAa,gBAAgBvB;AAC/B,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAIJ,MAAIoB,MAAiBrB,GAAiBC,CAAW;AAC/C,WAAOoB;AAET,MACEA,EAAa,WAAW,KAAK9B,CAAoB,EAAE,KACnD8B,EAAa,WACX,IAAI9B,EAAqB,SAASC,KAAgB,GACpD;AACA,QAAI,CAACgC,EAAa;AAChB,YAAM,IAAI,MAAM,kDAAkD;AAEpE,QAAIH,MAAiBN,GAAmBS,EAAa,gBAAgB;AACnE,aAAOH;AAAA,EAEX;AACA,QAAM,IAAI;AAAA,IACR;AAAA,EAAA;AAEJ;ACxHA,SAASI,GAAUzC,GAAeG,GAA2B;AAC3D,QAAMhB,IAAQa,EAAM,WAAW,IAAI,IAAIA,EAAM,MAAM,CAAC,IAAIA;AACxD,MAAIb,EAAM,WAAW,KAAKA,EAAM,SAAS,MAAM;AAC7C,UAAM,IAAI,MAAM,GAAGgB,CAAK,qCAAqC;AAE/D,MAAI,CAAC,iBAAiB,KAAKhB,CAAK;AAC9B,UAAM,IAAI,MAAM,GAAGgB,CAAK,8BAA8B;AAGxD,QAAMuC,IAAQ,IAAI,WAAWvD,EAAM,SAAS,CAAC;AAC7C,WAAS,IAAI,GAAG,IAAIuD,EAAM,QAAQ;AAChC,IAAAA,EAAM,CAAC,IAAI,OAAO,SAASvD,EAAM,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;AAE9D,SAAOuD;AACT;AAGA,SAASC,GAAUD,GAA2B;AAC5C,SAAO,MAAM,KAAKA,GAAO,CAACE,MAASA,EAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AAAA,IACrE;AAAA,EAAA;AAEJ;AAGA,SAASC,GAAYC,GAA2C;AAC9D,QAAMlD,IAAS,IAAI;AAAA,IACjBkD,EAAO,OAAO,CAACC,GAAQC,MAAUD,IAASC,EAAM,QAAQ,CAAC;AAAA,EAAA;AAE3D,MAAIlF,IAAS;AACb,aAAWkF,KAASF;AAClB,IAAAlD,EAAO,IAAIoD,GAAOlF,CAAM,GACxBA,KAAUkF,EAAM;AAElB,SAAOpD;AACT;AAOA,SAASqD,GAAwBC,GAAqC;AACpE,MAAIpF,IAAS;AAEb,QAAMqF,IAAO,CAACJ,GAAgB5C,MAA8B;AAC1D,QAAI,CAAC,OAAO,cAAc4C,CAAM,KAAKA,IAAS;AAC5C,YAAM,IAAI,MAAM,WAAW5C,CAAK,WAAW4C,CAAM,EAAE;AAErD,QAAIjF,IAASiF,IAASG,EAAY;AAChC,YAAM,IAAI,MAAM,+CAA+C/C,CAAK,EAAE;AAExE,UAAMH,IAAQkD,EAAY,MAAMpF,GAAQA,IAASiF,CAAM;AACvD,WAAAjF,KAAUiF,GACH/C;AAAA,EACT,GAEMoD,IAAmB,CAACL,GAAgB5C,MAA0B;AAClE,UAAMuC,IAAQS,EAAKJ,GAAQ5C,CAAK;AAChC,QAAIH,IAAQ;AACZ,aAAS/D,IAAIyG,EAAM,SAAS,GAAGzG,KAAK,GAAGA;AACrC,MAAA+D,IAASA,KAAS,KAAM,OAAO0C,EAAMzG,CAAC,CAAC;AAEzC,WAAO+D;AAAA,EACT,GAEMqD,IAAkB,CACtBlD,MAC2C;AAC3C,UAAMmD,IAAQxF,GACRyF,IAASJ,EAAK,GAAGhD,CAAK,EAAE,CAAC;AAC/B,QAAIH;AACJ,QAAIuD,IAAS;AACX,MAAAvD,IAAQ,OAAOuD,CAAM;AAAA,aACZA,MAAW;AAEpB,UADAvD,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,IAAQ,MAAO,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAAA,eAClDoD,MAAW;AAEpB,UADAvD,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,KAAS,QAAS,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAAA,eAE9DH,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,KAAS,YAAa,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAEpE,QAAIH,IAAQ,OAAO,OAAO,gBAAgB;AACxC,YAAM,IAAI,MAAM,GAAGG,CAAK,0CAA0C;AAEpE,WAAO;AAAA,MACL,SAAS+C,EAAY,MAAMI,GAAOxF,CAAM;AAAA,MACxC,OAAO,OAAOkC,CAAK;AAAA,IAAA;AAAA,EAEvB,GAEMwD,IAAUL,EAAK,GAAG,SAAS,GAC3BM,IACJP,EAAYpF,CAAM,MAAM,KAAQoF,EAAYpF,IAAS,CAAC,MAAM;AAC9D,EAAI2F,MAAY3F,KAAU;AAE1B,QAAM4F,IAAaL,EAAgB,aAAa,GAC1CM,IAAuB,CAAA;AAC7B,WAAS1H,IAAI,GAAGA,IAAIyH,EAAW,OAAOzH,KAAK;AACzC,UAAMqH,IAAQxF;AACd,IAAAqF,EAAK,IAAI,SAASlH,CAAC,4BAA4B,GAC/CkH,EAAK,GAAG,SAASlH,CAAC,wBAAwB;AAC1C,UAAM2H,IAAeP,EAAgB,SAASpH,CAAC,gBAAgB;AAC/D,IAAAkH,EAAKS,EAAa,OAAO,SAAS3H,CAAC,SAAS,GAC5CkH,EAAK,GAAG,SAASlH,CAAC,WAAW,GAC7B0H,EAAO,KAAKT,EAAY,MAAMI,GAAOxF,CAAM,CAAC;AAAA,EAC9C;AAEA,QAAM+F,IAAcR,EAAgB,cAAc,GAC5CS,IAAwB,CAAA;AAC9B,WAAS7H,IAAI,GAAGA,IAAI4H,EAAY,OAAO5H,KAAK;AAC1C,UAAMqH,IAAQxF;AACd,IAAAqF,EAAK,GAAG,UAAUlH,CAAC,QAAQ;AAC3B,UAAM2H,IAAeP,EAAgB,UAAUpH,CAAC,gBAAgB;AAChE,IAAAkH,EAAKS,EAAa,OAAO,UAAU3H,CAAC,SAAS,GAC7C6H,EAAQ,KAAKZ,EAAY,MAAMI,GAAOxF,CAAM,CAAC;AAAA,EAC/C;AAEA,MAAI2F,GAAY;AACd,QAAIM,IAAiB;AACrB,aAAS9H,IAAI,GAAGA,IAAIyH,EAAW,OAAOzH,KAAK;AACzC,YAAM+H,IAAYX,EAAgB,SAASpH,CAAC,qBAAqB;AACjE,MAAA8H,UAAmBC,EAAU,QAAQ;AACrC,eAAS3H,IAAI,GAAGA,IAAI2H,EAAU,OAAO3H,KAAK;AACxC,cAAM4H,IAAaZ;AAAA,UACjB,SAASpH,CAAC,iBAAiBI,CAAC;AAAA,QAAA;AAE9B,QAAA8G,EAAKc,EAAW,OAAO,SAAShI,CAAC,iBAAiBI,CAAC,EAAE;AAAA,MACvD;AAAA,IACF;AACA,QAAI,CAAC0H;AACH,YAAM,IAAI,MAAM,oDAAoD;AAAA,EAExE;AAEA,QAAMG,IAAWf,EAAK,GAAG,UAAU;AACnC,MAAIrF,MAAWoF,EAAY;AACzB,UAAM,IAAI;AAAA,MACR,2BAA2BA,EAAY,SAASpF,CAAM;AAAA,IAAA;AAI1D,SAAO+E,GAAY;AAAA,IACjBW;AAAA,IACAE,EAAW;AAAA,IACX,GAAGC;AAAA,IACHE,EAAY;AAAA,IACZ,GAAGC;AAAA,IACHI;AAAA,EAAA,CACD;AACH;AAGO,SAASC,GAAmBC,GAA6B;AAC9D,QAAMC,IAAapB;AAAA,IACjBR,GAAU2B,GAAgB,gBAAgB;AAAA,EAAA,GAEtCE,IAAStC,EAAOA,EAAOqC,CAAU,CAAC;AACxC,SAAAC,EAAO,QAAA,GACA,KAAK3B,GAAU2B,CAAM,CAAC;AAC/B;AAWO,SAASC,GACdC,GACAC,GACQ;AACR,QAAMC,IAAwBF,EAAY,WAAW,IAAI,IACrDA,IACA,KAAKA,CAAW;AACpB,MAAI,CAAC,sBAAsB,KAAKE,CAAqB;AACnD,UAAM,IAAI,MAAM,yCAAyC;AAE3D,QAAMC,IAAsBF,EAAU,WAAW,IAAI,IACjDA,IACA,KAAKA,CAAS;AAClB,MAAI,CAACG,GAAUD,GAAqB,EAAE,QAAQ,GAAA,CAAM;AAClD,UAAM,IAAI,MAAM,uCAAuCF,CAAS,EAAE;AAEpE,SAAOI;AAAA,IACLC;AAAA,MACE,CAAC,EAAE,MAAM,UAAA,GAAa,EAAE,MAAM,WAAW;AAAA,MACzC,CAACJ,GAA8BC,CAA8B;AAAA,IAAA;AAAA,EAC/D,EACA,MAAM,CAAC;AACX;ACpMO,MAAMI,IACX;AAGK,MAAMC,WAAsC,MAAM;AAAA,EACvD,YACWC,GACAC,GACAC,GACAC,GACTC,IAAS,kHACTC,GACA;AACA;AAAA,MACE,qCAAqCL,CAAO,gBAAgBC,CAAS,cAChEC,CAAS,KAAKC,CAAO,KAAKC,CAAM;AAAA,MACrCC;AAAA,IAAA,GAVO,KAAA,UAAAL,GACA,KAAA,YAAAC,GACA,KAAA,YAAAC,GACA,KAAA,UAAAC,GAST,KAAK,OAAOL;AAAA,EACd;AACF;AAGO,SAASQ,GACdC,GACsC;AACtC,SAAIA,aAAeR,KAAsC,KACrD,OAAOQ,KAAQ,YAAYA,MAAQ,OAAa,KAEjDA,EAA2B,SAAST;AAEzC;ACtBA,MAAMU,IAAa,OAGbC,IAAmB,KAGnBC,IAAa,YAGbC,IAAY;AAQX,SAASC,GAAiCrC,GAAuB;AACtE,MACE,CAAC,OAAO,UAAUA,CAAO,KACzBA,IAAU,KACVA,IAAUmC;AAEV,UAAM,IAAI;AAAA,MACR,sEAAsEnC,CAAO;AAAA,IAAA;AAGnF;AAMO,SAASsC,GAAuBC,GAAuC;AAC5E,QAAMC,IAAmB,CAAA;AA+FzB,MA7FID,EAAO,kBAAkB,MAC3BC,EAAO;AAAA,IACL,wCAAwCD,EAAO,cAAc;AAAA,EAAA,GAG7DA,EAAO,iBAAiB,OAAON,CAAU,KAC3CO,EAAO;AAAA,IACL,kBAAkBD,EAAO,cAAc,wBAAwBN,CAAU;AAAA,EAAA,GAIzEM,EAAO,2BAA2B,MACpCC,EAAO;AAAA,IACL,iDAAiDD,EAAO,uBAAuB;AAAA,EAAA,GAI/EA,EAAO,WAAW,KACpBC,EAAO,KAAK,iCAAiCD,EAAO,OAAO,EAAE,GAG3DA,EAAO,UAAU,KACnBC,EAAO,KAAK,gCAAgCD,EAAO,MAAM,EAAE,GAGzDA,EAAO,oBAAoB,WAAW,KACxCC,EAAO,KAAK,uCAAuC,GAGjDD,EAAO,iBAAiB,KAC1BC,EAAO,KAAK,uCAAuCD,EAAO,aAAa,EAAE,GAEvEA,EAAO,gBAAgBA,EAAO,oBAAoB,UACpDC,EAAO;AAAA,IACL,kBAAkBD,EAAO,aAAa,wCAAwCA,EAAO,oBAAoB,MAAM;AAAA,EAAA,GAI/GA,EAAO,WAAW,MACpBC,EAAO,KAAK,iCAAiCD,EAAO,OAAO,EAAE,GAG3DA,EAAO,mBAAmB,MAC5BC,EAAO;AAAA,IACL,yCAAyCD,EAAO,eAAe;AAAA,EAAA,IAKjE,CAAC,OAAO,UAAUA,EAAO,oBAAoB,KAC7CA,EAAO,uBAAuB,KAC9BA,EAAO,uBAAuBN,MAE9BO,EAAO;AAAA,IACL,8CAA8CD,EAAO,oBAAoB;AAAA,EAAA,IAK3E,CAAC,OAAO,UAAUA,EAAO,gBAAgB,KACzCA,EAAO,oBAAoB,KAC3BA,EAAO,mBAAmBJ,MAE1BK,EAAO;AAAA,IACL,4CAA4CL,CAAU,UAAUI,EAAO,gBAAgB;AAAA,EAAA,GAIvFA,EAAO,sBAAsB,KAC/BC,EAAO;AAAA,IACL,4CAA4CD,EAAO,kBAAkB;AAAA,EAAA,GAGrEA,EAAO,2BAA2B,KACpCC,EAAO;AAAA,IACL,iDAAiDD,EAAO,uBAAuB;AAAA,EAAA,GAG/EA,EAAO,0BAA0BA,EAAO,sBAC1CC,EAAO;AAAA,IACL,4BAA4BD,EAAO,uBAAuB,iCAAiCA,EAAO,kBAAkB;AAAA,EAAA,IAKtHA,EAAO,qBAAqB,KAC5BA,EAAO,qBAAqBL,MAE5BM,EAAO;AAAA,IACL,qCAAqCN,CAAgB,UAAUK,EAAO,kBAAkB;AAAA,EAAA,GAIxFC,EAAO,SAAS;AAClB,UAAM,IAAI;AAAA,MACR,yCAAyCA,EAAO,KAAK,IAAI,CAAC;AAAA,IAAA;AAGhE;AAMO,SAASC,GAA0BF,GAAiC;AACzE,QAAMC,IAAmB,CAAA;AA6CzB,MA3CID,EAAO,sBAAsB,MAC/BC,EAAO;AAAA,IACL,4CAA4CD,EAAO,kBAAkB;AAAA,EAAA,GAIrEA,EAAO,iBAAiBA,EAAO,sBACjCC,EAAO;AAAA,IACL,mBAAmBD,EAAO,cAAc,oCAAoCA,EAAO,kBAAkB;AAAA,EAAA,GAIrGA,EAAO,mBAAmB,MAC5BC,EAAO;AAAA,IACL,yCAAyCD,EAAO,eAAe;AAAA,EAAA,GAI/DA,EAAO,0BAA0B,MACnCC,EAAO;AAAA,IACL,gDAAgDD,EAAO,sBAAsB;AAAA,EAAA,IAK/E,CAAC,OAAO,UAAUA,EAAO,kBAAkB,KAC3CA,EAAO,sBAAsB,KAC7BA,EAAO,qBAAqBH,MAE5BI,EAAO;AAAA,IACL,gDAAgDJ,CAAS,UAAUG,EAAO,kBAAkB;AAAA,EAAA,IAK9F,OAAOA,EAAO,2BAA4B,YAC1CA,EAAO,2BAA2B,OAElCC,EAAO;AAAA,IACL,0DAA0DD,EAAO,uBAAuB;AAAA,EAAA,GAIxFC,EAAO,SAAS;AAClB,UAAM,IAAI,MAAM,oCAAoCA,EAAO,KAAK,IAAI,CAAC,EAAE;AAE3E;AASO,SAASE,GAA2BC,GAAkC;AAI3E,MAHAF,GAA0BE,CAAM,GAChCL,GAAuBK,EAAO,cAAc,GAG1C,CAAC,OAAO,UAAUA,EAAO,qBAAqB,KAC9CA,EAAO,wBAAwB,KAC/BA,EAAO,wBAAwBR;AAE/B,UAAM,IAAI;AAAA,MACR,6EAA6EQ,EAAO,qBAAqB;AAAA,IAAA;AAM7G,EAAAC;AAAA,IACED,EAAO;AAAA,IACP;AAAA,EAAA;AAEJ;AC/NO,MAAME,IACX;AAEK,MAAMC,UAAyC,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,EAO1D,YAAYC,GAAqBC,GAAkB;AACjD;AAAA,MACEA,KACE,6DAA6DD,CAAW;AAAA,IAAA;AATrE,IAAAhJ,EAAA;AAaP,SAAK,OAAO8I,GACZ,KAAK,cAAcE;AAAA,EACrB;AACF;AAGO,SAASE,GACdjB,GACyC;AACzC,SAAIA,aAAec,IAAyC,KACxD,OAAOd,KAAQ,YAAYA,MAAQ,OAAa,KAEjDA,EAA2B,SAC5Ba;AAEJ;AC9BA,MAAMK,KAAiB;AAWhB,SAASC,GACdC,GACA3B,GACA4B,GACyB;AACzB,QAAMC,IAAS7B,EAAQ,YAAA,GACjB8B,IAASH,EAAQ,KAAK,CAACI,MAAMA,EAAE,YAAYF,CAAM;AACvD,MAAIC,MAAW;AAGb,UAAM,IAAIT;AAAA,MACRO;AAAA,MACA,SAAS5B,CAAO,gFACL4B,CAAS,uDAAuDA,CAAS;AAAA,IAAA;AAIxF,SAAOE;AACT;AASO,SAASE,GACdF,GACK;AACL,SAAO5C,GAAmB4C,EAAO,kBAAkB;AACrD;AASO,SAASG,GACdH,GACM;AACN,QAAMrE,KACHqE,EAAO,4BAA4B,SAASL,MAAkB;AACjE,MAAIhE,MAAU,KAAKA,IAAQJ;AACzB,UAAM,IAAI;AAAA,MACR,kCAAkCyE,EAAO,OAAO,cAAcrE,CAAK,gDACvBJ,CAAqB;AAAA,IAAA;AAGvE;","x_google_ignoreList":[0]}
+{"version":3,"file":"registration-records-BBOz21Dm.js","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/legacy.js","../src/tbv/core/clients/eth/onChainBtcPubkey.ts","../src/tbv/core/clients/eth/payout-script.ts","../src/tbv/core/clients/eth/pegin-transaction.ts","../src/tbv/core/clients/eth/claimable-event-error.ts","../src/tbv/core/clients/eth/protocol-params-validation.ts","../src/tbv/core/clients/eth/registration-logs-error.ts","../src/tbv/core/clients/eth/registration-records.ts"],"sourcesContent":["/**\n\nSHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.\nDon't use them in a new protocol. What \"weak\" means:\n\n- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.\n- No practical pre-image attacks (only theoretical, 2^123.4)\n- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151\n * @module\n */\nimport { Chi, HashMD, Maj } from \"./_md.js\";\nimport { clean, createHasher, rotl } from \"./utils.js\";\n/** Initial SHA1 state */\nconst SHA1_IV = /* @__PURE__ */ Uint32Array.from([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Reusable temporary buffer\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\n/** Internal SHA1 legacy hash class. */\nexport class _SHA1 extends HashMD {\n    A = SHA1_IV[0] | 0;\n    B = SHA1_IV[1] | 0;\n    C = SHA1_IV[2] | 0;\n    D = SHA1_IV[3] | 0;\n    E = SHA1_IV[4] | 0;\n    constructor() {\n        super(64, 20, 8, false);\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        clean(SHA1_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */\nexport const sha1 = /* @__PURE__ */ createHasher(() => new _SHA1());\n/** Per-round constants */\nconst p32 = /* @__PURE__ */ Math.pow(2, 32);\nconst K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) => Math.floor(p32 * Math.abs(Math.sin(i + 1))));\n/** md5 initial state: same as sha1, but 4 u32 instead of 5. */\nconst MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);\n// Reusable temporary buffer\nconst MD5_W = /* @__PURE__ */ new Uint32Array(16);\n/** Internal MD5 legacy hash class. */\nexport class _MD5 extends HashMD {\n    A = MD5_IV[0] | 0;\n    B = MD5_IV[1] | 0;\n    C = MD5_IV[2] | 0;\n    D = MD5_IV[3] | 0;\n    constructor() {\n        super(64, 16, 8, true);\n    }\n    get() {\n        const { A, B, C, D } = this;\n        return [A, B, C, D];\n    }\n    set(A, B, C, D) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            MD5_W[i] = view.getUint32(offset, true);\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D } = this;\n        for (let i = 0; i < 64; i++) {\n            let F, g, s;\n            if (i < 16) {\n                F = Chi(B, C, D);\n                g = i;\n                s = [7, 12, 17, 22];\n            }\n            else if (i < 32) {\n                F = Chi(D, B, C);\n                g = (5 * i + 1) % 16;\n                s = [5, 9, 14, 20];\n            }\n            else if (i < 48) {\n                F = B ^ C ^ D;\n                g = (3 * i + 5) % 16;\n                s = [4, 11, 16, 23];\n            }\n            else {\n                F = C ^ (B | ~D);\n                g = (7 * i) % 16;\n                s = [6, 10, 15, 21];\n            }\n            F = F + A + K[i] + MD5_W[g];\n            A = D;\n            D = C;\n            C = B;\n            B = B + rotl(F, s[i % 4]);\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        this.set(A, B, C, D);\n    }\n    roundClean() {\n        clean(MD5_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/**\n * MD5 (RFC 1321) legacy hash function. It was cryptographically broken.\n * MD5 architecture is similar to SHA1, with some differences:\n * - Reduced output length: 16 bytes (128 bit) instead of 20\n * - 64 rounds, instead of 80\n * - Little-endian: could be faster, but will require more code\n * - Non-linear index selection: huge speed-up for unroll\n * - Per round constants: more memory accesses, additional speed-up for unroll\n */\nexport const md5 = /* @__PURE__ */ createHasher(() => new _MD5());\n// RIPEMD-160\nconst Rho160 = /* @__PURE__ */ Uint8Array.from([\n    7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n]);\nconst Id160 = /* @__PURE__ */ (() => Uint8Array.from(new Array(16).fill(0).map((_, i) => i)))();\nconst Pi160 = /* @__PURE__ */ (() => Id160.map((i) => (9 * i + 5) % 16))();\nconst idxLR = /* @__PURE__ */ (() => {\n    const L = [Id160];\n    const R = [Pi160];\n    const res = [L, R];\n    for (let i = 0; i < 4; i++)\n        for (let j of res)\n            j.push(j[i].map((k) => Rho160[k]));\n    return res;\n})();\nconst idxL = /* @__PURE__ */ (() => idxLR[0])();\nconst idxR = /* @__PURE__ */ (() => idxLR[1])();\n// const [idxL, idxR] = idxLR;\nconst shifts160 = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => Uint8Array.from(i));\nconst shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst Kl160 = /* @__PURE__ */ Uint32Array.from([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr160 = /* @__PURE__ */ Uint32Array.from([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction ripemd_f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    if (group === 1)\n        return (x & y) | (~x & z);\n    if (group === 2)\n        return (x | ~y) ^ z;\n    if (group === 3)\n        return (x & z) | (y & ~z);\n    return x ^ (y | ~z);\n}\n// Reusable temporary buffer\nconst BUF_160 = /* @__PURE__ */ new Uint32Array(16);\nexport class _RIPEMD160 extends HashMD {\n    h0 = 0x67452301 | 0;\n    h1 = 0xefcdab89 | 0;\n    h2 = 0x98badcfe | 0;\n    h3 = 0x10325476 | 0;\n    h4 = 0xc3d2e1f0 | 0;\n    constructor() {\n        super(64, 20, 8, true);\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF_160[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl160[group], hbr = Kr160[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL160[group], sr = shiftsR160[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        clean(BUF_160);\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a legacy hash function from 1990s.\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\n */\nexport const ripemd160 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());\n//# sourceMappingURL=legacy.js.map","/**\n * The single validator that mints {@link OnChainBtcPubkey}.\n *\n * Extracted from `ViemVaultRegistryReader.getVaultProviderGenesisBtcPubKey` so that\n * RFC-006 operation-key resolution can produce branded keys through exactly\n * the same checks, rather than casting past the brand. Every producer of an\n * `OnChainBtcPubkey` must go through here.\n */\n\nimport type { Hex } from \"viem\";\n\nimport type { OnChainBtcPubkey } from \"./types\";\n\n/** secp256k1's base-field prime, `2^256 - 2^32 - 977`. */\nconst SECP256K1_FIELD_PRIME =\n  0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn;\n\n/** secp256k1's curve coefficient `b`, from `y^2 = x^3 + b`. */\nconst SECP256K1_CURVE_B = 7n;\n\n/** Modular exponentiation without a crypto-library dependency. */\nfunction modPow(base: bigint, exponent: bigint, modulus: bigint): bigint {\n  let result = 1n;\n  let factor = base % modulus;\n  let remaining = exponent;\n\n  while (remaining > 0n) {\n    if ((remaining & 1n) === 1n) {\n      result = (result * factor) % modulus;\n    }\n    factor = (factor * factor) % modulus;\n    remaining >>= 1n;\n  }\n\n  return result;\n}\n\n/**\n * secp256k1's field prime is congruent to 3 mod 4, so an x-coordinate is on\n * the curve iff `(x^3 + 7)^((p + 1) / 4)` squares back to `x^3 + 7` modulo\n * p. This is the same curve-membership condition used by x-only key parsers;\n * it deliberately does not merely validate length/range.\n * `x^3 + 7` cannot be zero because `-7` is not a cubic residue in this field,\n * so the zero square-root edge case is unreachable.\n */\nfunction isSecp256k1XCoordinate(value: string): boolean {\n  const x = BigInt(`0x${value}`);\n  if (x >= SECP256K1_FIELD_PRIME) return false;\n\n  const xCubed =\n    (((x * x) % SECP256K1_FIELD_PRIME) * x) % SECP256K1_FIELD_PRIME;\n  const curveValue = (xCubed + SECP256K1_CURVE_B) % SECP256K1_FIELD_PRIME;\n  const y = modPow(\n    curveValue,\n    (SECP256K1_FIELD_PRIME + 1n) >> 2n,\n    SECP256K1_FIELD_PRIME,\n  );\n\n  return (y * y) % SECP256K1_FIELD_PRIME === curveValue;\n}\n\n/**\n * Validate a registry-returned `bytes32` as an x-only BTC pubkey and mint the\n * brand. Checks length, hex form, and secp256k1 curve membership. Returns\n * 64-char lowercase hex without the `0x` prefix.\n *\n * `label` identifies the read site in error messages (e.g.\n * `getOperationBtcKeyAtEpoch (vp=0x…, epoch=0)`), so a failure names which\n * participant and which getter produced it.\n *\n * A zero hash fails the curve check, so an unregistered operator or an epoch\n * with no bonded key surfaces as an error rather than a silent all-zero key.\n */\nexport function assertOnChainBtcPubkey(\n  value: Hex,\n  label: string,\n): OnChainBtcPubkey {\n  const lowered = value.toLowerCase();\n  if (!/^0x[0-9a-f]{64}$/.test(lowered)) {\n    throw new Error(\n      `${label} returned an unexpected value (length ${lowered.length}, prefix \"${lowered.slice(0, 2)}\")`,\n    );\n  }\n  const stripped = lowered.slice(2);\n  if (!isSecp256k1XCoordinate(stripped)) {\n    throw new Error(\n      `${label} returned a value that is not on the secp256k1 curve`,\n    );\n  }\n  return stripped as OnChainBtcPubkey;\n}\n","import { schnorr, secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { ripemd160 } from \"@noble/hashes/legacy.js\";\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport { bytesToHex, hexToBytes } from \"@noble/hashes/utils.js\";\nimport type { Hex } from \"viem\";\n\nimport { MAX_PAYOUT_SCRIPT_LEN } from \"../../primitives/psbt/constants\";\nimport { assertOnChainBtcPubkey } from \"./onChainBtcPubkey\";\n\nconst P2TR_SCRIPT_PREFIX = \"5120\";\nconst P2WPKH_SCRIPT_PREFIX = \"0014\";\nconst HASH160_BYTES = 20;\nconst COMPRESSED_PUBKEY_BYTES = 33;\nconst UNCOMPRESSED_PUBKEY_BYTES = 65;\nconst SEC1_EVEN_Y_PREFIX = 0x02;\nconst SEC1_ODD_Y_PREFIX = 0x03;\nconst SEC1_UNCOMPRESSED_PREFIX = 0x04;\n\nfunction normalizeHex(value: string, label: string): Hex {\n  const body =\n    value.startsWith(\"0x\") || value.startsWith(\"0X\") ? value.slice(2) : value;\n  if (!/^(?:[0-9a-fA-F]{2})+$/.test(body)) {\n    throw new Error(`${label} must be non-empty, even-length hex`);\n  }\n  return `0x${body.toLowerCase()}`;\n}\n\n/**\n * The BIP-86 key-path P2TR scriptPubKey of an x-only key (bare lowercase\n * hex): the internal key tweaked with no script tree, matching Rust\n * `Bip86KeyConnector` (btc-vault `connectors/mod.rs:237-268` @ ac4954e7).\n *\n * @internal\n */\nexport function deriveP2trScript(xOnlyPubkey: string): Hex {\n  const pubkeyBytes = hexToBytes(xOnlyPubkey);\n  const internalKey = schnorr.utils.lift_x(BigInt(`0x${xOnlyPubkey}`));\n  const tweak = schnorr.utils.bytesToNumberBE(\n    schnorr.utils.taggedHash(\"TapTweak\", pubkeyBytes),\n  );\n  if (tweak >= secp256k1.CURVE.n) {\n    throw new Error(\"Proof of possession BTC pubkey has an invalid TapTweak\");\n  }\n  const outputKey =\n    tweak === 0n\n      ? internalKey\n      : internalKey.add(schnorr.Point.BASE.multiply(tweak));\n  return `0x${P2TR_SCRIPT_PREFIX}${bytesToHex(\n    schnorr.utils.pointToBytes(outputKey),\n  )}`;\n}\n\nfunction normalizePayoutPubkey(value: string): {\n  xOnlyPubkey: string;\n  compressedPubkey?: Uint8Array;\n} {\n  const normalized = normalizeHex(value, \"depositorBtcPubkeyRaw\");\n  const pubkey = hexToBytes(normalized.slice(2));\n  if (pubkey.length === 32) {\n    return {\n      xOnlyPubkey: assertOnChainBtcPubkey(normalized, \"Payout BTC pubkey\"),\n    };\n  }\n  const isCompressed =\n    pubkey.length === COMPRESSED_PUBKEY_BYTES &&\n    (pubkey[0] === SEC1_EVEN_Y_PREFIX || pubkey[0] === SEC1_ODD_Y_PREFIX);\n  const isUncompressed =\n    pubkey.length === UNCOMPRESSED_PUBKEY_BYTES &&\n    pubkey[0] === SEC1_UNCOMPRESSED_PREFIX;\n  if (!isCompressed && !isUncompressed) {\n    throw new Error(\n      \"depositorBtcPubkeyRaw must be x-only, compressed, or uncompressed\",\n    );\n  }\n  try {\n    secp256k1.Point.fromBytes(pubkey);\n  } catch {\n    throw new Error(\"depositorBtcPubkeyRaw is not a valid BTC pubkey\");\n  }\n  return {\n    xOnlyPubkey: bytesToHex(pubkey.subarray(1, COMPRESSED_PUBKEY_BYTES)),\n    compressedPubkey: isCompressed ? pubkey : undefined,\n  };\n}\n\nfunction deriveP2wpkhScript(pubkey: Uint8Array): Hex {\n  return `0x${P2WPKH_SCRIPT_PREFIX}${bytesToHex(ripemd160(sha256(pubkey)))}`;\n}\n\n/** Verify the irreversible payout script at the final submission boundary. */\nexport function assertPayoutScriptMatchesPopKey(\n  scriptPubKey: string,\n  depositorBtcPubkey: string,\n  depositorBtcPubkeyRaw: string,\n): Hex {\n  const payoutScript = normalizeHex(\n    scriptPubKey,\n    \"depositorPayoutScriptPubKey\",\n  );\n  if ((payoutScript.length - 2) / 2 > MAX_PAYOUT_SCRIPT_LEN) {\n    throw new Error(\n      `depositorPayoutScriptPubKey exceeds ${MAX_PAYOUT_SCRIPT_LEN} bytes`,\n    );\n  }\n  const keyBody =\n    depositorBtcPubkey.startsWith(\"0x\") || depositorBtcPubkey.startsWith(\"0X\")\n      ? depositorBtcPubkey.slice(2)\n      : depositorBtcPubkey;\n  const xOnlyPubkey = assertOnChainBtcPubkey(\n    `0x${keyBody}` as Hex,\n    \"Proof of possession BTC pubkey\",\n  );\n  const payoutPubkey = normalizePayoutPubkey(depositorBtcPubkeyRaw);\n  if (payoutPubkey.xOnlyPubkey !== xOnlyPubkey) {\n    throw new Error(\n      \"depositorBtcPubkeyRaw does not match the proof of possession BTC pubkey\",\n    );\n  }\n\n  if (payoutScript === deriveP2trScript(xOnlyPubkey)) {\n    return payoutScript;\n  }\n  if (\n    payoutScript.startsWith(`0x${P2WPKH_SCRIPT_PREFIX}`) &&\n    payoutScript.length ===\n      2 + P2WPKH_SCRIPT_PREFIX.length + HASH160_BYTES * 2\n  ) {\n    if (!payoutPubkey.compressedPubkey) {\n      throw new Error(\"A P2WPKH payout requires a compressed BTC pubkey\");\n    }\n    if (payoutScript === deriveP2wpkhScript(payoutPubkey.compressedPubkey)) {\n      return payoutScript;\n    }\n  }\n  throw new Error(\n    \"depositorPayoutScriptPubKey does not match the proof of possession BTC pubkey\",\n  );\n}\n","/**\n * Dependency-free Bitcoin txid and vault-ID helpers for Ethereum-only clients.\n * Transaction hex and vault-ID inputs accept an optional `0x` prefix.\n * Depositor addresses use strict EIP-55 validation.\n * Txids use a `0x` prefix. Vault IDs use no prefix. Both use lowercase hex.\n */\n\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport {\n  encodeAbiParameters,\n  isAddress,\n  keccak256,\n  type Address,\n  type Hex,\n} from \"viem\";\n\n/** Decode an optional-prefixed, even-length hex string. */\nfunction decodeHex(value: string, label: string): Uint8Array {\n  const clean = value.startsWith(\"0x\") ? value.slice(2) : value;\n  if (clean.length === 0 || clean.length % 2 !== 0) {\n    throw new Error(`${label} must be non-empty, even-length hex`);\n  }\n  if (!/^[0-9a-fA-F]+$/.test(clean)) {\n    throw new Error(`${label} contains non-hex characters`);\n  }\n\n  const bytes = new Uint8Array(clean.length / 2);\n  for (let i = 0; i < bytes.length; i++) {\n    bytes[i] = Number.parseInt(clean.slice(i * 2, i * 2 + 2), 16);\n  }\n  return bytes;\n}\n\n/** Encode bytes as lowercase hex without a prefix. */\nfunction encodeHex(bytes: Uint8Array): string {\n  return Array.from(bytes, (byte) => byte.toString(16).padStart(2, \"0\")).join(\n    \"\",\n  );\n}\n\n/** Concatenate byte chunks without a buffer dependency. */\nfunction concatBytes(chunks: readonly Uint8Array[]): Uint8Array {\n  const result = new Uint8Array(\n    chunks.reduce((length, chunk) => length + chunk.length, 0),\n  );\n  let offset = 0;\n  for (const chunk of chunks) {\n    result.set(chunk, offset);\n    offset += chunk.length;\n  }\n  return result;\n}\n\n/**\n * Parse enough of Bitcoin's consensus transaction encoding to serialize the\n * no-witness form used for txid calculation. Every length is bounds-checked;\n * malformed/trailing data is rejected rather than hashed as an opaque blob.\n */\nfunction serializeWithoutWitness(transaction: Uint8Array): Uint8Array {\n  let offset = 0;\n\n  const take = (length: number, label: string): Uint8Array => {\n    if (!Number.isSafeInteger(length) || length < 0) {\n      throw new Error(`Invalid ${label} length ${length}`);\n    }\n    if (offset + length > transaction.length) {\n      throw new Error(`Truncated Bitcoin transaction while reading ${label}`);\n    }\n    const value = transaction.slice(offset, offset + length);\n    offset += length;\n    return value;\n  };\n\n  const readLittleEndian = (length: number, label: string): bigint => {\n    const bytes = take(length, label);\n    let value = 0n;\n    for (let i = bytes.length - 1; i >= 0; i--) {\n      value = (value << 8n) | BigInt(bytes[i]);\n    }\n    return value;\n  };\n\n  const readCompactSize = (\n    label: string,\n  ): { encoded: Uint8Array; value: number } => {\n    const start = offset;\n    const prefix = take(1, label)[0];\n    let value: bigint;\n    if (prefix < 0xfd) {\n      value = BigInt(prefix);\n    } else if (prefix === 0xfd) {\n      value = readLittleEndian(2, label);\n      if (value < 0xfdn) throw new Error(`Non-canonical ${label}`);\n    } else if (prefix === 0xfe) {\n      value = readLittleEndian(4, label);\n      if (value <= 0xffffn) throw new Error(`Non-canonical ${label}`);\n    } else {\n      value = readLittleEndian(8, label);\n      if (value <= 0xffffffffn) throw new Error(`Non-canonical ${label}`);\n    }\n    if (value > BigInt(Number.MAX_SAFE_INTEGER)) {\n      throw new Error(`${label} exceeds JavaScript's safe integer range`);\n    }\n    return {\n      encoded: transaction.slice(start, offset),\n      value: Number(value),\n    };\n  };\n\n  const version = take(4, \"version\");\n  const hasWitness =\n    transaction[offset] === 0x00 && transaction[offset + 1] === 0x01;\n  if (hasWitness) offset += 2;\n\n  const inputCount = readCompactSize(\"input count\");\n  const inputs: Uint8Array[] = [];\n  for (let i = 0; i < inputCount.value; i++) {\n    const start = offset;\n    take(32, `input ${i} previous transaction hash`);\n    take(4, `input ${i} previous output index`);\n    const scriptLength = readCompactSize(`input ${i} script length`);\n    take(scriptLength.value, `input ${i} script`);\n    take(4, `input ${i} sequence`);\n    inputs.push(transaction.slice(start, offset));\n  }\n\n  const outputCount = readCompactSize(\"output count\");\n  const outputs: Uint8Array[] = [];\n  for (let i = 0; i < outputCount.value; i++) {\n    const start = offset;\n    take(8, `output ${i} value`);\n    const scriptLength = readCompactSize(`output ${i} script length`);\n    take(scriptLength.value, `output ${i} script`);\n    outputs.push(transaction.slice(start, offset));\n  }\n\n  if (hasWitness) {\n    let hasWitnessData = false;\n    for (let i = 0; i < inputCount.value; i++) {\n      const itemCount = readCompactSize(`input ${i} witness item count`);\n      hasWitnessData ||= itemCount.value > 0;\n      for (let j = 0; j < itemCount.value; j++) {\n        const itemLength = readCompactSize(\n          `input ${i} witness item ${j} length`,\n        );\n        take(itemLength.value, `input ${i} witness item ${j}`);\n      }\n    }\n    if (!hasWitnessData) {\n      throw new Error(\"Bitcoin transaction has superfluous witness marker\");\n    }\n  }\n\n  const locktime = take(4, \"locktime\");\n  if (offset !== transaction.length) {\n    throw new Error(\n      `Bitcoin transaction has ${transaction.length - offset} trailing byte(s)`,\n    );\n  }\n\n  return concatBytes([\n    version,\n    inputCount.encoded,\n    ...inputs,\n    outputCount.encoded,\n    ...outputs,\n    locktime,\n  ]);\n}\n\n/** Calculate a Bitcoin txid without importing bitcoinjs-lib. */\nexport function calculateBtcTxHash(transactionHex: string): Hex {\n  const serialized = serializeWithoutWitness(\n    decodeHex(transactionHex, \"transactionHex\"),\n  );\n  const digest = sha256(sha256(serialized));\n  digest.reverse();\n  return `0x${encodeHex(digest)}`;\n}\n\n/**\n * Derive the Solidity vault ID without loading the Rust/WASM package.\n *\n * Inputs accept an optional `0x` prefix to match the current PeginManager\n * call sites. Address validation stays strict: lowercase and valid EIP-55\n * addresses pass, while uppercase and incorrectly checksummed mixed-case\n * addresses fail. The synchronous result is lowercase hex without a prefix,\n * matching the WASM helper that this function replaces.\n */\nexport function derivePeginVaultId(\n  peginTxHash: string,\n  depositor: string,\n): string {\n  const normalizedPeginTxHash = peginTxHash.startsWith(\"0x\")\n    ? peginTxHash\n    : `0x${peginTxHash}`;\n  if (!/^0x[0-9a-fA-F]{64}$/.test(normalizedPeginTxHash)) {\n    throw new Error(\"peginTxHash must be a 32-byte hex value\");\n  }\n  const normalizedDepositor = depositor.startsWith(\"0x\")\n    ? depositor\n    : `0x${depositor}`;\n  if (!isAddress(normalizedDepositor, { strict: true })) {\n    throw new Error(`Invalid depositor Ethereum address: ${depositor}`);\n  }\n  return keccak256(\n    encodeAbiParameters(\n      [{ type: \"bytes32\" }, { type: \"address\" }],\n      [normalizedPeginTxHash as Hex, normalizedDepositor as Address],\n    ),\n  ).slice(2);\n}\n","/**\n * Typed absence of a vault's `VaultClaimableBy` log for a claimer key.\n *\n * Distinct from a transport failure: the scan covered the whole range and\n * found nothing. That is what a not-yet-redeemed vault looks like, and it is\n * also what a load-balanced public node that lacks the block answers, so a\n * caller that knows the vault is redeemed may retry. Name-matchable across\n * module instances like `RegistrationLogsUnavailableError`.\n *\n * @module clients/eth/claimable-event-error\n */\n\nimport type { Hex } from \"viem\";\n\n/** The `name` this error carries, so a foreign module instance still matches. */\nexport const VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME =\n  \"VaultClaimableByNotFoundError\";\n\n/** @experimental */\nexport class VaultClaimableByNotFoundError extends Error {\n  constructor(\n    readonly vaultId: Hex,\n    readonly claimerPk: Hex,\n    readonly fromBlock: bigint,\n    readonly toBlock: bigint,\n    detail = \"the vault has not been redeemed for this key, or the node did not serve the block. Redeem first, or try again.\",\n    options?: ErrorOptions,\n  ) {\n    super(\n      `No VaultClaimableBy log for vault ${vaultId} and claimer ${claimerPk} in blocks ` +\n        `${fromBlock}..${toBlock}: ${detail}`,\n      options,\n    );\n    this.name = VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME;\n  }\n}\n\n/** Matches `instanceof` OR the documented `name` (dual module instances). @experimental */\nexport function isVaultClaimableByNotFoundError(\n  err: unknown,\n): err is VaultClaimableByNotFoundError {\n  if (err instanceof VaultClaimableByNotFoundError) return true;\n  if (typeof err !== \"object\" || err === null) return false;\n  return (\n    (err as { name?: unknown }).name === VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME\n  );\n}\n","/**\n * Validation for protocol parameters fetched from the ProtocolParams contract.\n *\n * These values feed Bitcoin script construction and deposit validation.\n * Invalid params must be caught before they reach transaction-building code,\n * since errors after wallet signing prompts are unrecoverable.\n *\n * The {@link ViemProtocolParamsReader} runs these on every read; consumers\n * implementing their own reader against the same `ProtocolParamsReader`\n * interface should call them too.\n */\n\nimport { assertValidVaultCoreVersion } from \"../../primitives/vaultCoreVersion\";\n\nimport type {\n  PegInConfiguration,\n  TBVProtocolParams,\n  VersionedOffchainParams,\n} from \"./types\";\n\n/**\n * Maximum value for a Solidity uint16. btc-vault carries the PegIn timelock as\n * a `NonZeroU16` (`transactions/pegin.rs:33` @ ac4954e7).\n */\nconst UINT16_MAX = 65535;\n\n/** Maximum valid value for basis points (100%) */\nconst MAX_BASIS_POINTS = 10000;\n\n/** Maximum value for a Solidity uint32. */\nconst UINT32_MAX = 4_294_967_295;\n\n/** Maximum valid value for a uint8 (e.g. maxHtlcOutputCount). */\nconst UINT8_MAX = 255;\n\n/**\n * Validate an `offchainParamsVersion` value sourced from a contract read.\n * `Number()` on a malformed payload yields `NaN` or a non-integer; both\n * silently break consumers that loop `1..version` or use the value as a\n * map key. Used by reader entry points that surface the version to JS.\n */\nexport function assertValidOffchainParamsVersion(version: number): void {\n  if (\n    !Number.isInteger(version) ||\n    version < 0 ||\n    version > UINT32_MAX\n  ) {\n    throw new Error(\n      `Invalid offchainParamsVersion from contract: must be a uint32, got ${version}`,\n    );\n  }\n}\n\n/**\n * Validate offchain params consistency and bounds.\n * @throws Error on invalid values to prevent constructing invalid Bitcoin scripts.\n */\nexport function validateOffchainParams(params: VersionedOffchainParams): void {\n  const errors: string[] = [];\n\n  if (params.timelockAssert <= 0n) {\n    errors.push(\n      `timelockAssert must be positive, got ${params.timelockAssert}`,\n    );\n  }\n  if (params.timelockAssert > BigInt(UINT16_MAX)) {\n    errors.push(\n      `timelockAssert ${params.timelockAssert} exceeds uint16 max (${UINT16_MAX})`,\n    );\n  }\n\n  if (params.timelockChallengeAssert <= 0n) {\n    errors.push(\n      `timelockChallengeAssert must be positive, got ${params.timelockChallengeAssert}`,\n    );\n  }\n\n  if (params.tRefund <= 0) {\n    errors.push(`tRefund must be positive, got ${params.tRefund}`);\n  }\n\n  if (params.tStale <= 0) {\n    errors.push(`tStale must be positive, got ${params.tStale}`);\n  }\n\n  if (params.securityCouncilKeys.length === 0) {\n    errors.push(\"securityCouncilKeys must not be empty\");\n  }\n\n  if (params.councilQuorum <= 0) {\n    errors.push(`councilQuorum must be positive, got ${params.councilQuorum}`);\n  }\n  if (params.councilQuorum > params.securityCouncilKeys.length) {\n    errors.push(\n      `councilQuorum (${params.councilQuorum}) exceeds securityCouncilKeys count (${params.securityCouncilKeys.length})`,\n    );\n  }\n\n  if (params.feeRate <= 0n) {\n    errors.push(`feeRate must be positive, got ${params.feeRate}`);\n  }\n\n  if (params.minPeginFeeRate <= 0n) {\n    errors.push(\n      `minPeginFeeRate must be positive, got ${params.minPeginFeeRate}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.proverCircuitVersion) ||\n    params.proverCircuitVersion < 0 ||\n    params.proverCircuitVersion > UINT16_MAX\n  ) {\n    errors.push(\n      `proverCircuitVersion must be a uint16, got ${params.proverCircuitVersion}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.minPrepeginDepth) ||\n    params.minPrepeginDepth <= 0 ||\n    params.minPrepeginDepth > UINT32_MAX\n  ) {\n    errors.push(\n      `minPrepeginDepth must be a uint32 in [1, ${UINT32_MAX}], got ${params.minPrepeginDepth}`,\n    );\n  }\n\n  if (params.babeTotalInstances <= 0) {\n    errors.push(\n      `babeTotalInstances must be positive, got ${params.babeTotalInstances}`,\n    );\n  }\n  if (params.babeInstancesToFinalize <= 0) {\n    errors.push(\n      `babeInstancesToFinalize must be positive, got ${params.babeInstancesToFinalize}`,\n    );\n  }\n  if (params.babeInstancesToFinalize > params.babeTotalInstances) {\n    errors.push(\n      `babeInstancesToFinalize (${params.babeInstancesToFinalize}) exceeds babeTotalInstances (${params.babeTotalInstances})`,\n    );\n  }\n\n  if (\n    params.minVpCommissionBps < 0 ||\n    params.minVpCommissionBps > MAX_BASIS_POINTS\n  ) {\n    errors.push(\n      `minVpCommissionBps must be in [0, ${MAX_BASIS_POINTS}], got ${params.minVpCommissionBps}`,\n    );\n  }\n\n  if (errors.length > 0) {\n    throw new Error(\n      `Invalid offchain protocol parameters: ${errors.join(\"; \")}`,\n    );\n  }\n}\n\n/**\n * Validate TBV protocol params returned from the contract.\n * @throws Error on invalid amounts or out-of-range bounded fields.\n */\nexport function validateTBVProtocolParams(params: TBVProtocolParams): void {\n  const errors: string[] = [];\n\n  if (params.minimumPegInAmount <= 0n) {\n    errors.push(\n      `minimumPegInAmount must be positive, got ${params.minimumPegInAmount}`,\n    );\n  }\n\n  if (params.maxPegInAmount < params.minimumPegInAmount) {\n    errors.push(\n      `maxPegInAmount (${params.maxPegInAmount}) must be >= minimumPegInAmount (${params.minimumPegInAmount})`,\n    );\n  }\n\n  if (params.pegInAckTimeout <= 0n) {\n    errors.push(\n      `pegInAckTimeout must be positive, got ${params.pegInAckTimeout}`,\n    );\n  }\n\n  if (params.pegInActivationTimeout <= 0n) {\n    errors.push(\n      `pegInActivationTimeout must be positive, got ${params.pegInActivationTimeout}`,\n    );\n  }\n\n  if (\n    !Number.isInteger(params.maxHtlcOutputCount) ||\n    params.maxHtlcOutputCount <= 0 ||\n    params.maxHtlcOutputCount > UINT8_MAX\n  ) {\n    errors.push(\n      `maxHtlcOutputCount must be an integer in [1, ${UINT8_MAX}], got ${params.maxHtlcOutputCount}`,\n    );\n  }\n\n  if (\n    typeof params.expiredPegInGraceBlocks !== \"bigint\" ||\n    params.expiredPegInGraceBlocks <= 0n\n  ) {\n    errors.push(\n      `expiredPegInGraceBlocks must be a positive bigint, got ${params.expiredPegInGraceBlocks}`,\n    );\n  }\n\n  if (errors.length > 0) {\n    throw new Error(`Invalid TBV protocol parameters: ${errors.join(\"; \")}`);\n  }\n}\n\n/**\n * Validate the full peg-in configuration after assembly.\n * Checks both TBV params and offchain params consistency, and the\n * top-level `offchainParamsVersion` (which originates from a separate\n * multicall result and so must be range-checked alongside the params it\n * names).\n */\nexport function validatePegInConfiguration(config: PegInConfiguration): void {\n  validateTBVProtocolParams(config);\n  validateOffchainParams(config.offchainParams);\n\n  if (\n    !Number.isInteger(config.offchainParamsVersion) ||\n    config.offchainParamsVersion < 0 ||\n    config.offchainParamsVersion > UINT32_MAX\n  ) {\n    throw new Error(\n      `Invalid peg-in configuration: offchainParamsVersion must be a uint32, got ${config.offchainParamsVersion}`,\n    );\n  }\n\n  // The contract enforces ≥ 1 (setter rejects 0); a 0 here means a\n  // mis-decoded read or a pre-vaultCoreVersion contract — fail closed.\n  assertValidVaultCoreVersion(\n    config.activeVaultCoreVersion,\n    \"ProtocolParams.activeVaultCoreVersion()\",\n  );\n}\n","/**\n * Transient failure of a registration-log read.\n *\n * Every registered vault has its `PegInSubmitted` log in its `createdAt`\n * block, so an Ethereum node answering that block's registration-log query\n * with no logs at all did not serve the block — load-balanced public RPCs\n * answer `[]` for a block a backend lacks instead of erroring, which viem's\n * transport retry cannot see (it retries errors only). Callers may retry.\n *\n * The same holds for an answer that is merely incomplete: the registry emits\n * `PegInSubmitted` and `PegInSubmittedV2` together on every submission\n * (vault-contracts-aave-v4 `PeginLogic.sol:144-147` @ c559f5c2), so a block\n * answer carrying only some of them is a partial answer as readily as it is\n * an old registry. Those shapes carry their own message.\n *\n * @module clients/eth/registration-logs-error\n */\n\n/** The `name` this error carries, so a foreign module instance still matches. */\nexport const REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME =\n  \"RegistrationLogsUnavailableError\";\n\nexport class RegistrationLogsUnavailableError extends Error {\n  readonly blockNumber: bigint;\n\n  /**\n   * `message` replaces the empty-answer wording for the partial-answer shapes\n   * that are not \"no logs at all\"; the caller names which logs it did get.\n   */\n  constructor(blockNumber: bigint, message?: string) {\n    super(\n      message ??\n        `The Ethereum node returned no registration logs for block ${blockNumber}, ` +\n          `which holds a vault registration; the node may not have indexed that ` +\n          `block yet. Try again.`,\n    );\n    this.name = REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME;\n    this.blockNumber = blockNumber;\n  }\n}\n\n/** Matches `instanceof` OR the documented `name` (dual module instances). */\nexport function isRegistrationLogsUnavailableError(\n  err: unknown,\n): err is RegistrationLogsUnavailableError {\n  if (err instanceof RegistrationLogsUnavailableError) return true;\n  if (typeof err !== \"object\" || err === null) return false;\n  return (\n    (err as { name?: unknown }).name ===\n    REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME\n  );\n}\n","/**\n * Pure helpers over {@link PeginRegistrationRecord}.\n *\n * The reader decodes a whole block leniently; the strict per-record checks\n * live here and run only on the records a caller selects, so a stranger's\n * malformed registration in the same block cannot fail an unrelated read (the\n * vault app's deposit resume reads its commission ceiling through the same\n * block). That leniency stops at duplicates: a vault registers once, so two\n * logs for any vault id are an inconsistent node and the reader fails the\n * whole block's read closed by design.\n *\n * @module clients/eth/registration-records\n */\n\nimport type { Hex } from \"viem\";\n\nimport { MAX_PAYOUT_SCRIPT_LEN } from \"../../primitives/psbt/constants\";\nimport { calculateBtcTxHash } from \"./pegin-transaction\";\nimport { RegistrationLogsUnavailableError } from \"./registration-logs-error\";\nimport type { PeginRegistrationRecord } from \"./types\";\n\nconst HEX_PREFIX_LEN = 2;\n\n/**\n * The record of `vaultId` among a block's registrations.\n *\n * @throws {RegistrationLogsUnavailableError} (transient, retry) when the\n * block's registration logs do not include the vault: the registry emits a\n * `PegInSubmittedV2` on every submission, so an answer without the target's\n * is as readily a node's partial answer as a vault registered elsewhere.\n * @experimental\n */\nexport function findRegistrationRecord(\n  records: readonly PeginRegistrationRecord[],\n  vaultId: Hex,\n  createdAt: bigint,\n): PeginRegistrationRecord {\n  const wanted = vaultId.toLowerCase();\n  const record = records.find((r) => r.vaultId === wanted);\n  if (record === undefined) {\n    // Both shapes are emitted together on every submission\n    // (vault-contracts-aave-v4 `PeginLogic.sol:144-147` @ c559f5c2).\n    throw new RegistrationLogsUnavailableError(\n      createdAt,\n      `Vault ${vaultId} has no PegInSubmittedV2 registration log at its on-chain registration ` +\n        `block ${createdAt}: either the node served a partial answer for block ${createdAt} ` +\n        `(retry, preferably another node) or the vault was not registered in this block`,\n    );\n  }\n  return record;\n}\n\n/**\n * Txid of the record's `unsignedPrePeginTx`, `0x`-prefixed display order —\n * what the vault record stores as `prePeginTxHash`.\n *\n * @throws When the log's transaction does not parse.\n * @experimental\n */\nexport function registrationPrePeginTxHash(\n  record: PeginRegistrationRecord,\n): Hex {\n  return calculateBtcTxHash(record.unsignedPrePeginTx);\n}\n\n/**\n * The bound `assertPayoutScriptMatchesPopKey` enforces before a registration\n * is submitted (payout-script.ts); a log outside it is not a script the SDK\n * ever registered.\n *\n * @experimental\n */\nexport function assertRegisteredPayoutScriptBounds(\n  record: PeginRegistrationRecord,\n): void {\n  const bytes =\n    (record.depositorPayoutScriptPubKey.length - HEX_PREFIX_LEN) / 2;\n  if (bytes === 0 || bytes > MAX_PAYOUT_SCRIPT_LEN) {\n    throw new Error(\n      `PegInSubmittedV2 log for vault ${record.vaultId} carries a ${bytes}-byte ` +\n        `depositorPayoutBtcAddress; expected 1..${MAX_PAYOUT_SCRIPT_LEN} bytes`,\n    );\n  }\n}\n"],"names":["Rho160","Id160","_","i","Pi160","idxLR","res","j","k","idxL","idxR","shifts160","shiftsL160","idx","shiftsR160","Kl160","Kr160","ripemd_f","group","x","y","z","BUF_160","_RIPEMD160","HashMD","__publicField","h0","h1","h2","h3","h4","view","offset","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","rotl","tr","clean","ripemd160","createHasher","SECP256K1_FIELD_PRIME","SECP256K1_CURVE_B","modPow","base","exponent","modulus","result","factor","remaining","isSecp256k1XCoordinate","value","curveValue","assertOnChainBtcPubkey","label","lowered","stripped","P2TR_SCRIPT_PREFIX","P2WPKH_SCRIPT_PREFIX","HASH160_BYTES","COMPRESSED_PUBKEY_BYTES","UNCOMPRESSED_PUBKEY_BYTES","SEC1_EVEN_Y_PREFIX","SEC1_ODD_Y_PREFIX","SEC1_UNCOMPRESSED_PREFIX","normalizeHex","body","deriveP2trScript","xOnlyPubkey","pubkeyBytes","hexToBytes","internalKey","schnorr","tweak","secp256k1","outputKey","bytesToHex","normalizePayoutPubkey","normalized","pubkey","isCompressed","isUncompressed","deriveP2wpkhScript","sha256","assertPayoutScriptMatchesPopKey","scriptPubKey","depositorBtcPubkey","depositorBtcPubkeyRaw","payoutScript","MAX_PAYOUT_SCRIPT_LEN","keyBody","payoutPubkey","decodeHex","bytes","encodeHex","byte","concatBytes","chunks","length","chunk","serializeWithoutWitness","transaction","take","readLittleEndian","readCompactSize","start","prefix","version","hasWitness","inputCount","inputs","scriptLength","outputCount","outputs","hasWitnessData","itemCount","itemLength","locktime","calculateBtcTxHash","transactionHex","serialized","digest","derivePeginVaultId","peginTxHash","depositor","normalizedPeginTxHash","normalizedDepositor","isAddress","keccak256","encodeAbiParameters","VAULT_CLAIMABLE_BY_NOT_FOUND_ERROR_NAME","VaultClaimableByNotFoundError","vaultId","claimerPk","fromBlock","toBlock","detail","options","isVaultClaimableByNotFoundError","err","UINT16_MAX","MAX_BASIS_POINTS","UINT32_MAX","UINT8_MAX","assertValidOffchainParamsVersion","validateOffchainParams","params","errors","validateTBVProtocolParams","validatePegInConfiguration","config","assertValidVaultCoreVersion","REGISTRATION_LOGS_UNAVAILABLE_ERROR_NAME","RegistrationLogsUnavailableError","blockNumber","message","isRegistrationLogsUnavailableError","HEX_PREFIX_LEN","findRegistrationRecord","records","createdAt","wanted","record","r","registrationPrePeginTxHash","assertRegisteredPayoutScriptBounds"],"mappings":";;;;;;;AA8KA,MAAMA,KAAyB,2BAAW,KAAK;AAAA,EAC3C;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AACvD,CAAC,GACKC,IAA+B,WAAW,KAAK,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAACC,GAAGC,MAAMA,CAAC,CAAC,GACrFC,KAA+BH,EAAM,IAAI,CAACE,OAAO,IAAIA,IAAI,KAAK,EAAE,GAChEE,IAAyB,uBAAM;AAGjC,QAAMC,IAAM,CAFF,CAACL,CAAK,GACN,CAACG,EAAK,CACC;AACjB,WAASD,IAAI,GAAGA,IAAI,GAAGA;AACnB,aAASI,KAAKD;AACV,MAAAC,EAAE,KAAKA,EAAEJ,CAAC,EAAE,IAAI,CAACK,MAAMR,GAAOQ,CAAC,CAAC,CAAC;AACzC,SAAOF;AACX,GAAC,GACKG,IAA8BJ,EAAM,CAAC,GACrCK,IAA8BL,EAAM,CAAC,GAErCM,IAA4B;AAAA,EAC9B,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAC3D,EAAE,IAAI,CAACR,MAAM,WAAW,KAAKA,CAAC,CAAC,GACzBS,KAA6B,gBAAAH,EAAK,IAAI,CAACI,GAAKV,MAAMU,EAAI,IAAI,CAACN,MAAMI,EAAUR,CAAC,EAAEI,CAAC,CAAC,CAAC,GACjFO,KAA6B,gBAAAJ,EAAK,IAAI,CAACG,GAAKV,MAAMU,EAAI,IAAI,CAACN,MAAMI,EAAUR,CAAC,EAAEI,CAAC,CAAC,CAAC,GACjFQ,KAAwB,4BAAY,KAAK;AAAA,EAC3C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC,GACKC,KAAwB,4BAAY,KAAK;AAAA,EAC3C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC;AAED,SAASC,EAASC,GAAOC,GAAGC,GAAGC,GAAG;AAC9B,SAAIH,MAAU,IACHC,IAAIC,IAAIC,IACfH,MAAU,IACFC,IAAIC,IAAM,CAACD,IAAIE,IACvBH,MAAU,KACFC,IAAI,CAACC,KAAKC,IAClBH,MAAU,IACFC,IAAIE,IAAMD,IAAI,CAACC,IACpBF,KAAKC,IAAI,CAACC;AACrB;AAEA,MAAMC,IAA0B,oBAAI,YAAY,EAAE;AAC3C,MAAMC,WAAmBC,GAAO;AAAA,EAMnC,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAI;AANzB,IAAAC,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AACL,IAAAA,EAAA,YAAK;AAAA,EAGL;AAAA,EACA,MAAM;AACF,UAAM,EAAE,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAE,IAAK;AAC/B,WAAO,CAACJ,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC9B;AAAA,EACA,IAAIJ,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AACpB,SAAK,KAAKJ,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EACnB;AAAA,EACA,QAAQC,GAAMC,GAAQ;AAClB,aAAS7B,IAAI,GAAGA,IAAI,IAAIA,KAAK6B,KAAU;AACnC,MAAAV,EAAQnB,CAAC,IAAI4B,EAAK,UAAUC,GAAQ,EAAI;AAE5C,QAAIC,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD;AAGvI,aAASvB,IAAQ,GAAGA,IAAQ,GAAGA,KAAS;AACpC,YAAMyB,IAAS,IAAIzB,GACb0B,IAAM7B,GAAMG,CAAK,GAAG2B,IAAM7B,GAAME,CAAK,GACrC4B,IAAKrC,EAAKS,CAAK,GAAG6B,IAAKrC,EAAKQ,CAAK,GACjC8B,IAAKpC,GAAWM,CAAK,GAAG+B,IAAKnC,GAAWI,CAAK;AACnD,eAASf,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAM+C,IAAMC,EAAKlB,IAAKhB,EAASC,GAAOiB,GAAIE,GAAIE,CAAE,IAAIjB,EAAQwB,EAAG3C,CAAC,CAAC,IAAIyC,GAAKI,EAAG7C,CAAC,CAAC,IAAIsC,IAAM;AACzF,QAAAR,IAAKQ,GAAIA,IAAKF,GAAIA,IAAKY,EAAKd,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKe;AAAA,MAC3D;AAEA,eAAS/C,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMiD,IAAMD,EAAKjB,IAAKjB,EAAS0B,GAAQP,GAAIE,GAAIE,CAAE,IAAIlB,EAAQyB,EAAG5C,CAAC,CAAC,IAAI0C,GAAKI,EAAG9C,CAAC,CAAC,IAAIuC,IAAM;AAC1F,QAAAR,IAAKQ,GAAIA,IAAKF,GAAIA,IAAKW,EAAKb,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKgB;AAAA,MAC3D;AAAA,IACJ;AAEA,SAAK,IAAK,KAAK,KAAKf,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKP,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,CAAC;AAAA,EACxI;AAAA,EACA,aAAa;AACT,IAAAe,EAAM/B,CAAO;AAAA,EACjB;AAAA,EACA,UAAU;AACN,SAAK,YAAY,IACjB+B,EAAM,KAAK,MAAM,GACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC1B;AACJ;AAMY,MAACC,KAA4B,gBAAAC,GAAa,MAAM,IAAIhC,GAAU,CAAE,GCzQtEiC,IACJ,qEAGIC,KAAoB;AAG1B,SAASC,GAAOC,GAAcC,GAAkBC,GAAyB;AACvE,MAAIC,IAAS,IACTC,IAASJ,IAAOE,GAChBG,IAAYJ;AAEhB,SAAOI,IAAY;AACjB,KAAKA,IAAY,QAAQ,OACvBF,IAAUA,IAASC,IAAUF,IAE/BE,IAAUA,IAASA,IAAUF,GAC7BG,MAAc;AAGhB,SAAOF;AACT;AAUA,SAASG,GAAuBC,GAAwB;AACtD,QAAM/C,IAAI,OAAO,KAAK+C,CAAK,EAAE;AAC7B,MAAI/C,KAAKqC,EAAuB,QAAO;AAIvC,QAAMW,KADDhD,IAAIA,IAAKqC,IAAyBrC,IAAKqC,IACfC,MAAqBD,GAC5CpC,IAAIsC;AAAA,IACRS;AAAA,IACCX,IAAwB,MAAO;AAAA,IAChCA;AAAA,EAAA;AAGF,SAAQpC,IAAIA,IAAKoC,MAA0BW;AAC7C;AAcO,SAASC,EACdF,GACAG,GACkB;AAClB,QAAMC,IAAUJ,EAAM,YAAA;AACtB,MAAI,CAAC,mBAAmB,KAAKI,CAAO;AAClC,UAAM,IAAI;AAAA,MACR,GAAGD,CAAK,yCAAyCC,EAAQ,MAAM,aAAaA,EAAQ,MAAM,GAAG,CAAC,CAAC;AAAA,IAAA;AAGnG,QAAMC,IAAWD,EAAQ,MAAM,CAAC;AAChC,MAAI,CAACL,GAAuBM,CAAQ;AAClC,UAAM,IAAI;AAAA,MACR,GAAGF,CAAK;AAAA,IAAA;AAGZ,SAAOE;AACT;ACjFA,MAAMC,KAAqB,QACrBC,IAAuB,QACvBC,KAAgB,IAChBC,IAA0B,IAC1BC,KAA4B,IAC5BC,KAAqB,GACrBC,KAAoB,GACpBC,KAA2B;AAEjC,SAASC,EAAad,GAAeG,GAAoB;AACvD,QAAMY,IACJf,EAAM,WAAW,IAAI,KAAKA,EAAM,WAAW,IAAI,IAAIA,EAAM,MAAM,CAAC,IAAIA;AACtE,MAAI,CAAC,wBAAwB,KAAKe,CAAI;AACpC,UAAM,IAAI,MAAM,GAAGZ,CAAK,qCAAqC;AAE/D,SAAO,KAAKY,EAAK,YAAA,CAAa;AAChC;AASO,SAASC,GAAiBC,GAA0B;AACzD,QAAMC,IAAcC,EAAWF,CAAW,GACpCG,IAAcC,EAAQ,MAAM,OAAO,OAAO,KAAKJ,CAAW,EAAE,CAAC,GAC7DK,IAAQD,EAAQ,MAAM;AAAA,IAC1BA,EAAQ,MAAM,WAAW,YAAYH,CAAW;AAAA,EAAA;AAElD,MAAII,KAASC,EAAU,MAAM;AAC3B,UAAM,IAAI,MAAM,wDAAwD;AAE1E,QAAMC,IACJF,MAAU,KACNF,IACAA,EAAY,IAAIC,EAAQ,MAAM,KAAK,SAASC,CAAK,CAAC;AACxD,SAAO,KAAKhB,EAAkB,GAAGmB;AAAA,IAC/BJ,EAAQ,MAAM,aAAaG,CAAS;AAAA,EAAA,CACrC;AACH;AAEA,SAASE,GAAsB1B,GAG7B;AACA,QAAM2B,IAAab,EAAad,GAAO,uBAAuB,GACxD4B,IAAST,EAAWQ,EAAW,MAAM,CAAC,CAAC;AAC7C,MAAIC,EAAO,WAAW;AACpB,WAAO;AAAA,MACL,aAAa1B,EAAuByB,GAAY,mBAAmB;AAAA,IAAA;AAGvE,QAAME,IACJD,EAAO,WAAWnB,MACjBmB,EAAO,CAAC,MAAMjB,MAAsBiB,EAAO,CAAC,MAAMhB,KAC/CkB,IACJF,EAAO,WAAWlB,MAClBkB,EAAO,CAAC,MAAMf;AAChB,MAAI,CAACgB,KAAgB,CAACC;AACpB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAGJ,MAAI;AACF,IAAAP,EAAU,MAAM,UAAUK,CAAM;AAAA,EAClC,QAAQ;AACN,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,SAAO;AAAA,IACL,aAAaH,EAAWG,EAAO,SAAS,GAAGnB,CAAuB,CAAC;AAAA,IACnE,kBAAkBoB,IAAeD,IAAS;AAAA,EAAA;AAE9C;AAEA,SAASG,GAAmBH,GAAyB;AACnD,SAAO,KAAKrB,CAAoB,GAAGkB,EAAWrC,GAAU4C,EAAOJ,CAAM,CAAC,CAAC,CAAC;AAC1E;AAGO,SAASK,GACdC,GACAC,GACAC,GACK;AACL,QAAMC,IAAevB;AAAA,IACnBoB;AAAA,IACA;AAAA,EAAA;AAEF,OAAKG,EAAa,SAAS,KAAK,IAAIC;AAClC,UAAM,IAAI;AAAA,MACR,uCAAuCA,CAAqB;AAAA,IAAA;AAGhE,QAAMC,IACJJ,EAAmB,WAAW,IAAI,KAAKA,EAAmB,WAAW,IAAI,IACrEA,EAAmB,MAAM,CAAC,IAC1BA,GACAlB,IAAcf;AAAA,IAClB,KAAKqC,CAAO;AAAA,IACZ;AAAA,EAAA,GAEIC,IAAed,GAAsBU,CAAqB;AAChE,MAAII,EAAa,gBAAgBvB;AAC/B,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAIJ,MAAIoB,MAAiBrB,GAAiBC,CAAW;AAC/C,WAAOoB;AAET,MACEA,EAAa,WAAW,KAAK9B,CAAoB,EAAE,KACnD8B,EAAa,WACX,IAAI9B,EAAqB,SAASC,KAAgB,GACpD;AACA,QAAI,CAACgC,EAAa;AAChB,YAAM,IAAI,MAAM,kDAAkD;AAEpE,QAAIH,MAAiBN,GAAmBS,EAAa,gBAAgB;AACnE,aAAOH;AAAA,EAEX;AACA,QAAM,IAAI;AAAA,IACR;AAAA,EAAA;AAEJ;ACxHA,SAASI,GAAUzC,GAAeG,GAA2B;AAC3D,QAAMhB,IAAQa,EAAM,WAAW,IAAI,IAAIA,EAAM,MAAM,CAAC,IAAIA;AACxD,MAAIb,EAAM,WAAW,KAAKA,EAAM,SAAS,MAAM;AAC7C,UAAM,IAAI,MAAM,GAAGgB,CAAK,qCAAqC;AAE/D,MAAI,CAAC,iBAAiB,KAAKhB,CAAK;AAC9B,UAAM,IAAI,MAAM,GAAGgB,CAAK,8BAA8B;AAGxD,QAAMuC,IAAQ,IAAI,WAAWvD,EAAM,SAAS,CAAC;AAC7C,WAAS,IAAI,GAAG,IAAIuD,EAAM,QAAQ;AAChC,IAAAA,EAAM,CAAC,IAAI,OAAO,SAASvD,EAAM,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;AAE9D,SAAOuD;AACT;AAGA,SAASC,GAAUD,GAA2B;AAC5C,SAAO,MAAM,KAAKA,GAAO,CAACE,MAASA,EAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AAAA,IACrE;AAAA,EAAA;AAEJ;AAGA,SAASC,GAAYC,GAA2C;AAC9D,QAAMlD,IAAS,IAAI;AAAA,IACjBkD,EAAO,OAAO,CAACC,GAAQC,MAAUD,IAASC,EAAM,QAAQ,CAAC;AAAA,EAAA;AAE3D,MAAIlF,IAAS;AACb,aAAWkF,KAASF;AAClB,IAAAlD,EAAO,IAAIoD,GAAOlF,CAAM,GACxBA,KAAUkF,EAAM;AAElB,SAAOpD;AACT;AAOA,SAASqD,GAAwBC,GAAqC;AACpE,MAAIpF,IAAS;AAEb,QAAMqF,IAAO,CAACJ,GAAgB5C,MAA8B;AAC1D,QAAI,CAAC,OAAO,cAAc4C,CAAM,KAAKA,IAAS;AAC5C,YAAM,IAAI,MAAM,WAAW5C,CAAK,WAAW4C,CAAM,EAAE;AAErD,QAAIjF,IAASiF,IAASG,EAAY;AAChC,YAAM,IAAI,MAAM,+CAA+C/C,CAAK,EAAE;AAExE,UAAMH,IAAQkD,EAAY,MAAMpF,GAAQA,IAASiF,CAAM;AACvD,WAAAjF,KAAUiF,GACH/C;AAAA,EACT,GAEMoD,IAAmB,CAACL,GAAgB5C,MAA0B;AAClE,UAAMuC,IAAQS,EAAKJ,GAAQ5C,CAAK;AAChC,QAAIH,IAAQ;AACZ,aAAS/D,IAAIyG,EAAM,SAAS,GAAGzG,KAAK,GAAGA;AACrC,MAAA+D,IAASA,KAAS,KAAM,OAAO0C,EAAMzG,CAAC,CAAC;AAEzC,WAAO+D;AAAA,EACT,GAEMqD,IAAkB,CACtBlD,MAC2C;AAC3C,UAAMmD,IAAQxF,GACRyF,IAASJ,EAAK,GAAGhD,CAAK,EAAE,CAAC;AAC/B,QAAIH;AACJ,QAAIuD,IAAS;AACX,MAAAvD,IAAQ,OAAOuD,CAAM;AAAA,aACZA,MAAW;AAEpB,UADAvD,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,IAAQ,MAAO,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAAA,eAClDoD,MAAW;AAEpB,UADAvD,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,KAAS,QAAS,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAAA,eAE9DH,IAAQoD,EAAiB,GAAGjD,CAAK,GAC7BH,KAAS,YAAa,OAAM,IAAI,MAAM,iBAAiBG,CAAK,EAAE;AAEpE,QAAIH,IAAQ,OAAO,OAAO,gBAAgB;AACxC,YAAM,IAAI,MAAM,GAAGG,CAAK,0CAA0C;AAEpE,WAAO;AAAA,MACL,SAAS+C,EAAY,MAAMI,GAAOxF,CAAM;AAAA,MACxC,OAAO,OAAOkC,CAAK;AAAA,IAAA;AAAA,EAEvB,GAEMwD,IAAUL,EAAK,GAAG,SAAS,GAC3BM,IACJP,EAAYpF,CAAM,MAAM,KAAQoF,EAAYpF,IAAS,CAAC,MAAM;AAC9D,EAAI2F,MAAY3F,KAAU;AAE1B,QAAM4F,IAAaL,EAAgB,aAAa,GAC1CM,IAAuB,CAAA;AAC7B,WAAS1H,IAAI,GAAGA,IAAIyH,EAAW,OAAOzH,KAAK;AACzC,UAAMqH,IAAQxF;AACd,IAAAqF,EAAK,IAAI,SAASlH,CAAC,4BAA4B,GAC/CkH,EAAK,GAAG,SAASlH,CAAC,wBAAwB;AAC1C,UAAM2H,IAAeP,EAAgB,SAASpH,CAAC,gBAAgB;AAC/D,IAAAkH,EAAKS,EAAa,OAAO,SAAS3H,CAAC,SAAS,GAC5CkH,EAAK,GAAG,SAASlH,CAAC,WAAW,GAC7B0H,EAAO,KAAKT,EAAY,MAAMI,GAAOxF,CAAM,CAAC;AAAA,EAC9C;AAEA,QAAM+F,IAAcR,EAAgB,cAAc,GAC5CS,IAAwB,CAAA;AAC9B,WAAS7H,IAAI,GAAGA,IAAI4H,EAAY,OAAO5H,KAAK;AAC1C,UAAMqH,IAAQxF;AACd,IAAAqF,EAAK,GAAG,UAAUlH,CAAC,QAAQ;AAC3B,UAAM2H,IAAeP,EAAgB,UAAUpH,CAAC,gBAAgB;AAChE,IAAAkH,EAAKS,EAAa,OAAO,UAAU3H,CAAC,SAAS,GAC7C6H,EAAQ,KAAKZ,EAAY,MAAMI,GAAOxF,CAAM,CAAC;AAAA,EAC/C;AAEA,MAAI2F,GAAY;AACd,QAAIM,IAAiB;AACrB,aAAS9H,IAAI,GAAGA,IAAIyH,EAAW,OAAOzH,KAAK;AACzC,YAAM+H,IAAYX,EAAgB,SAASpH,CAAC,qBAAqB;AACjE,MAAA8H,UAAmBC,EAAU,QAAQ;AACrC,eAAS3H,IAAI,GAAGA,IAAI2H,EAAU,OAAO3H,KAAK;AACxC,cAAM4H,IAAaZ;AAAA,UACjB,SAASpH,CAAC,iBAAiBI,CAAC;AAAA,QAAA;AAE9B,QAAA8G,EAAKc,EAAW,OAAO,SAAShI,CAAC,iBAAiBI,CAAC,EAAE;AAAA,MACvD;AAAA,IACF;AACA,QAAI,CAAC0H;AACH,YAAM,IAAI,MAAM,oDAAoD;AAAA,EAExE;AAEA,QAAMG,IAAWf,EAAK,GAAG,UAAU;AACnC,MAAIrF,MAAWoF,EAAY;AACzB,UAAM,IAAI;AAAA,MACR,2BAA2BA,EAAY,SAASpF,CAAM;AAAA,IAAA;AAI1D,SAAO+E,GAAY;AAAA,IACjBW;AAAA,IACAE,EAAW;AAAA,IACX,GAAGC;AAAA,IACHE,EAAY;AAAA,IACZ,GAAGC;AAAA,IACHI;AAAA,EAAA,CACD;AACH;AAGO,SAASC,GAAmBC,GAA6B;AAC9D,QAAMC,IAAapB;AAAA,IACjBR,GAAU2B,GAAgB,gBAAgB;AAAA,EAAA,GAEtCE,IAAStC,EAAOA,EAAOqC,CAAU,CAAC;AACxC,SAAAC,EAAO,QAAA,GACA,KAAK3B,GAAU2B,CAAM,CAAC;AAC/B;AAWO,SAASC,GACdC,GACAC,GACQ;AACR,QAAMC,IAAwBF,EAAY,WAAW,IAAI,IACrDA,IACA,KAAKA,CAAW;AACpB,MAAI,CAAC,sBAAsB,KAAKE,CAAqB;AACnD,UAAM,IAAI,MAAM,yCAAyC;AAE3D,QAAMC,IAAsBF,EAAU,WAAW,IAAI,IACjDA,IACA,KAAKA,CAAS;AAClB,MAAI,CAACG,GAAUD,GAAqB,EAAE,QAAQ,GAAA,CAAM;AAClD,UAAM,IAAI,MAAM,uCAAuCF,CAAS,EAAE;AAEpE,SAAOI;AAAA,IACLC;AAAA,MACE,CAAC,EAAE,MAAM,UAAA,GAAa,EAAE,MAAM,WAAW;AAAA,MACzC,CAACJ,GAA8BC,CAA8B;AAAA,IAAA;AAAA,EAC/D,EACA,MAAM,CAAC;AACX;ACpMO,MAAMI,IACX;AAGK,MAAMC,WAAsC,MAAM;AAAA,EACvD,YACWC,GACAC,GACAC,GACAC,GACTC,IAAS,kHACTC,GACA;AACA;AAAA,MACE,qCAAqCL,CAAO,gBAAgBC,CAAS,cAChEC,CAAS,KAAKC,CAAO,KAAKC,CAAM;AAAA,MACrCC;AAAA,IAAA,GAVO,KAAA,UAAAL,GACA,KAAA,YAAAC,GACA,KAAA,YAAAC,GACA,KAAA,UAAAC,GAST,KAAK,OAAOL;AAAA,EACd;AACF;AAGO,SAASQ,GACdC,GACsC;AACtC,SAAIA,aAAeR,KAAsC,KACrD,OAAOQ,KAAQ,YAAYA,MAAQ,OAAa,KAEjDA,EAA2B,SAAST;AAEzC;ACtBA,MAAMU,IAAa,OAGbC,IAAmB,KAGnBC,IAAa,YAGbC,IAAY;AAQX,SAASC,GAAiCrC,GAAuB;AACtE,MACE,CAAC,OAAO,UAAUA,CAAO,KACzBA,IAAU,KACVA,IAAUmC;AAEV,UAAM,IAAI;AAAA,MACR,sEAAsEnC,CAAO;AAAA,IAAA;AAGnF;AAMO,SAASsC,GAAuBC,GAAuC;AAC5E,QAAMC,IAAmB,CAAA;AA+FzB,MA7FID,EAAO,kBAAkB,MAC3BC,EAAO;AAAA,IACL,wCAAwCD,EAAO,cAAc;AAAA,EAAA,GAG7DA,EAAO,iBAAiB,OAAON,CAAU,KAC3CO,EAAO;AAAA,IACL,kBAAkBD,EAAO,cAAc,wBAAwBN,CAAU;AAAA,EAAA,GAIzEM,EAAO,2BAA2B,MACpCC,EAAO;AAAA,IACL,iDAAiDD,EAAO,uBAAuB;AAAA,EAAA,GAI/EA,EAAO,WAAW,KACpBC,EAAO,KAAK,iCAAiCD,EAAO,OAAO,EAAE,GAG3DA,EAAO,UAAU,KACnBC,EAAO,KAAK,gCAAgCD,EAAO,MAAM,EAAE,GAGzDA,EAAO,oBAAoB,WAAW,KACxCC,EAAO,KAAK,uCAAuC,GAGjDD,EAAO,iBAAiB,KAC1BC,EAAO,KAAK,uCAAuCD,EAAO,aAAa,EAAE,GAEvEA,EAAO,gBAAgBA,EAAO,oBAAoB,UACpDC,EAAO;AAAA,IACL,kBAAkBD,EAAO,aAAa,wCAAwCA,EAAO,oBAAoB,MAAM;AAAA,EAAA,GAI/GA,EAAO,WAAW,MACpBC,EAAO,KAAK,iCAAiCD,EAAO,OAAO,EAAE,GAG3DA,EAAO,mBAAmB,MAC5BC,EAAO;AAAA,IACL,yCAAyCD,EAAO,eAAe;AAAA,EAAA,IAKjE,CAAC,OAAO,UAAUA,EAAO,oBAAoB,KAC7CA,EAAO,uBAAuB,KAC9BA,EAAO,uBAAuBN,MAE9BO,EAAO;AAAA,IACL,8CAA8CD,EAAO,oBAAoB;AAAA,EAAA,IAK3E,CAAC,OAAO,UAAUA,EAAO,gBAAgB,KACzCA,EAAO,oBAAoB,KAC3BA,EAAO,mBAAmBJ,MAE1BK,EAAO;AAAA,IACL,4CAA4CL,CAAU,UAAUI,EAAO,gBAAgB;AAAA,EAAA,GAIvFA,EAAO,sBAAsB,KAC/BC,EAAO;AAAA,IACL,4CAA4CD,EAAO,kBAAkB;AAAA,EAAA,GAGrEA,EAAO,2BAA2B,KACpCC,EAAO;AAAA,IACL,iDAAiDD,EAAO,uBAAuB;AAAA,EAAA,GAG/EA,EAAO,0BAA0BA,EAAO,sBAC1CC,EAAO;AAAA,IACL,4BAA4BD,EAAO,uBAAuB,iCAAiCA,EAAO,kBAAkB;AAAA,EAAA,IAKtHA,EAAO,qBAAqB,KAC5BA,EAAO,qBAAqBL,MAE5BM,EAAO;AAAA,IACL,qCAAqCN,CAAgB,UAAUK,EAAO,kBAAkB;AAAA,EAAA,GAIxFC,EAAO,SAAS;AAClB,UAAM,IAAI;AAAA,MACR,yCAAyCA,EAAO,KAAK,IAAI,CAAC;AAAA,IAAA;AAGhE;AAMO,SAASC,GAA0BF,GAAiC;AACzE,QAAMC,IAAmB,CAAA;AA6CzB,MA3CID,EAAO,sBAAsB,MAC/BC,EAAO;AAAA,IACL,4CAA4CD,EAAO,kBAAkB;AAAA,EAAA,GAIrEA,EAAO,iBAAiBA,EAAO,sBACjCC,EAAO;AAAA,IACL,mBAAmBD,EAAO,cAAc,oCAAoCA,EAAO,kBAAkB;AAAA,EAAA,GAIrGA,EAAO,mBAAmB,MAC5BC,EAAO;AAAA,IACL,yCAAyCD,EAAO,eAAe;AAAA,EAAA,GAI/DA,EAAO,0BAA0B,MACnCC,EAAO;AAAA,IACL,gDAAgDD,EAAO,sBAAsB;AAAA,EAAA,IAK/E,CAAC,OAAO,UAAUA,EAAO,kBAAkB,KAC3CA,EAAO,sBAAsB,KAC7BA,EAAO,qBAAqBH,MAE5BI,EAAO;AAAA,IACL,gDAAgDJ,CAAS,UAAUG,EAAO,kBAAkB;AAAA,EAAA,IAK9F,OAAOA,EAAO,2BAA4B,YAC1CA,EAAO,2BAA2B,OAElCC,EAAO;AAAA,IACL,0DAA0DD,EAAO,uBAAuB;AAAA,EAAA,GAIxFC,EAAO,SAAS;AAClB,UAAM,IAAI,MAAM,oCAAoCA,EAAO,KAAK,IAAI,CAAC,EAAE;AAE3E;AASO,SAASE,GAA2BC,GAAkC;AAI3E,MAHAF,GAA0BE,CAAM,GAChCL,GAAuBK,EAAO,cAAc,GAG1C,CAAC,OAAO,UAAUA,EAAO,qBAAqB,KAC9CA,EAAO,wBAAwB,KAC/BA,EAAO,wBAAwBR;AAE/B,UAAM,IAAI;AAAA,MACR,6EAA6EQ,EAAO,qBAAqB;AAAA,IAAA;AAM7G,EAAAC;AAAA,IACED,EAAO;AAAA,IACP;AAAA,EAAA;AAEJ;AC/NO,MAAME,IACX;AAEK,MAAMC,UAAyC,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,EAO1D,YAAYC,GAAqBC,GAAkB;AACjD;AAAA,MACEA,KACE,6DAA6DD,CAAW;AAAA,IAAA;AATrE,IAAAhJ,EAAA;AAaP,SAAK,OAAO8I,GACZ,KAAK,cAAcE;AAAA,EACrB;AACF;AAGO,SAASE,GACdjB,GACyC;AACzC,SAAIA,aAAec,IAAyC,KACxD,OAAOd,KAAQ,YAAYA,MAAQ,OAAa,KAEjDA,EAA2B,SAC5Ba;AAEJ;AC9BA,MAAMK,KAAiB;AAWhB,SAASC,GACdC,GACA3B,GACA4B,GACyB;AACzB,QAAMC,IAAS7B,EAAQ,YAAA,GACjB8B,IAASH,EAAQ,KAAK,CAACI,MAAMA,EAAE,YAAYF,CAAM;AACvD,MAAIC,MAAW;AAGb,UAAM,IAAIT;AAAA,MACRO;AAAA,MACA,SAAS5B,CAAO,gFACL4B,CAAS,uDAAuDA,CAAS;AAAA,IAAA;AAIxF,SAAOE;AACT;AASO,SAASE,GACdF,GACK;AACL,SAAO5C,GAAmB4C,EAAO,kBAAkB;AACrD;AASO,SAASG,GACdH,GACM;AACN,QAAMrE,KACHqE,EAAO,4BAA4B,SAASL,MAAkB;AACjE,MAAIhE,MAAU,KAAKA,IAAQJ;AACzB,UAAM,IAAI;AAAA,MACR,kCAAkCyE,EAAO,OAAO,cAAcrE,CAAK,gDACvBJ,CAAqB;AAAA,IAAA;AAGvE;","x_google_ignoreList":[0]}

package/dist/{registration-records-DFQgBaYi.cjs → registration-records-DaBufozs.cjs}

@@ -1,2 +1,2 @@
-"use strict";var tt=Object.defineProperty;var et=(t,e,n)=>e in t?tt(t,e,{enumerable:!0,configurable:!0,writable:!0,value:n}):t[e]=n;var y=(t,e,n)=>et(t,typeof e!="symbol"?e+"":e,n);const g=require("./secp256k1-DDHQ1_za.cjs"),l=require("./sha2-Ce6KewYx.cjs"),w=require("./constants-BwCg5K6R.cjs"),C=require("viem"),nt=Uint8Array.from([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),N=Uint8Array.from(new Array(16).fill(0).map((t,e)=>e)),ot=N.map(t=>(9*t+5)%16),U=(()=>{const n=[[N],[ot]];for(let o=0;o<4;o++)for(let i of n)i.push(i[o].map(u=>nt[u]));return n})(),L=U[0],O=U[1],F=[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map(t=>Uint8Array.from(t)),it=L.map((t,e)=>t.map(n=>F[e][n])),rt=O.map((t,e)=>t.map(n=>F[e][n])),st=Uint32Array.from([0,1518500249,1859775393,2400959708,2840853838]),ut=Uint32Array.from([1352829926,1548603684,1836072691,2053994217,0]);function R(t,e,n,o){return t===0?e^n^o:t===1?e&n|~e&o:t===2?(e|~n)^o:t===3?e&o|n&~o:e^(n|~o)}const x=new Uint32Array(16);class ct extends l.HashMD{constructor(){super(64,20,8,!0);y(this,"h0",1732584193);y(this,"h1",-271733879);y(this,"h2",-1732584194);y(this,"h3",271733878);y(this,"h4",-1009589776)}get(){const{h0:n,h1:o,h2:i,h3:u,h4:f}=this;return[n,o,i,u,f]}set(n,o,i,u,f){this.h0=n|0,this.h1=o|0,this.h2=i|0,this.h3=u|0,this.h4=f|0}process(n,o){for(let s=0;s<16;s++,o+=4)x[s]=n.getUint32(o,!0);let i=this.h0|0,u=i,f=this.h1|0,d=f,p=this.h2|0,b=p,m=this.h3|0,E=m,r=this.h4|0,c=r;for(let s=0;s<5;s++){const a=4-s,P=st[s],j=ut[s],q=L[s],Q=O[s],J=it[s],Z=rt[s];for(let h=0;h<16;h++){const v=l.rotl(i+R(s,f,p,m)+x[q[h]]+P,J[h])+r|0;i=r,r=m,m=l.rotl(p,10)|0,p=f,f=v}for(let h=0;h<16;h++){const v=l.rotl(u+R(a,d,b,E)+x[Q[h]]+j,Z[h])+c|0;u=c,c=E,E=l.rotl(b,10)|0,b=d,d=v}}this.set(this.h1+p+E|0,this.h2+m+c|0,this.h3+r+u|0,this.h4+i+d|0,this.h0+f+b|0)}roundClean(){l.clean(x)}destroy(){this.destroyed=!0,l.clean(this.buffer),this.set(0,0,0,0,0)}}const H=l.createHasher(()=>new ct),$=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,at=7n;function ft(t,e,n){let o=1n,i=t%n,u=e;for(;u>0n;)(u&1n)===1n&&(o=o*i%n),i=i*i%n,u>>=1n;return o}function lt(t){const e=BigInt(`0x${t}`);if(e>=$)return!1;const o=(e*e%$*e%$+at)%$,i=ft(o,$+1n>>2n,$);return i*i%$===o}function k(t,e){const n=t.toLowerCase();if(!/^0x[0-9a-f]{64}$/.test(n))throw new Error(`${e} returned an unexpected value (length ${n.length}, prefix "${n.slice(0,2)}")`);const o=n.slice(2);if(!lt(o))throw new Error(`${e} returned a value that is not on the secp256k1 curve`);return o}const ht="5120",A="0014",dt=20,_=33,pt=65,mt=2,gt=3,bt=4;function K(t,e){const n=t.startsWith("0x")||t.startsWith("0X")?t.slice(2):t;if(!/^(?:[0-9a-fA-F]{2})+$/.test(n))throw new Error(`${e} must be non-empty, even-length hex`);return`0x${n.toLowerCase()}`}function M(t){const e=l.hexToBytes(t),n=g.schnorr.utils.lift_x(BigInt(`0x${t}`)),o=g.schnorr.utils.bytesToNumberBE(g.schnorr.utils.taggedHash("TapTweak",e));if(o>=g.secp256k1.CURVE.n)throw new Error("Proof of possession BTC pubkey has an invalid TapTweak");const i=o===0n?n:n.add(g.schnorr.Point.BASE.multiply(o));return`0x${ht}${l.bytesToHex(g.schnorr.utils.pointToBytes(i))}`}function Pt(t){const e=K(t,"depositorBtcPubkeyRaw"),n=l.hexToBytes(e.slice(2));if(n.length===32)return{xOnlyPubkey:k(e,"Payout BTC pubkey")};const o=n.length===_&&(n[0]===mt||n[0]===gt),i=n.length===pt&&n[0]===bt;if(!o&&!i)throw new Error("depositorBtcPubkeyRaw must be x-only, compressed, or uncompressed");try{g.secp256k1.Point.fromBytes(n)}catch{throw new Error("depositorBtcPubkeyRaw is not a valid BTC pubkey")}return{xOnlyPubkey:l.bytesToHex(n.subarray(1,_)),compressedPubkey:o?n:void 0}}function yt(t){return`0x${A}${l.bytesToHex(H(l.sha256(t)))}`}function $t(t,e,n){const o=K(t,"depositorPayoutScriptPubKey");if((o.length-2)/2>w.MAX_PAYOUT_SCRIPT_LEN)throw new Error(`depositorPayoutScriptPubKey exceeds ${w.MAX_PAYOUT_SCRIPT_LEN} bytes`);const i=e.startsWith("0x")||e.startsWith("0X")?e.slice(2):e,u=k(`0x${i}`,"Proof of possession BTC pubkey"),f=Pt(n);if(f.xOnlyPubkey!==u)throw new Error("depositorBtcPubkeyRaw does not match the proof of possession BTC pubkey");if(o===M(u))return o;if(o.startsWith(`0x${A}`)&&o.length===2+A.length+dt*2){if(!f.compressedPubkey)throw new Error("A P2WPKH payout requires a compressed BTC pubkey");if(o===yt(f.compressedPubkey))return o}throw new Error("depositorPayoutScriptPubKey does not match the proof of possession BTC pubkey")}function Et(t,e){const n=t.startsWith("0x")?t.slice(2):t;if(n.length===0||n.length%2!==0)throw new Error(`${e} must be non-empty, even-length hex`);if(!/^[0-9a-fA-F]+$/.test(n))throw new Error(`${e} contains non-hex characters`);const o=new Uint8Array(n.length/2);for(let i=0;i<o.length;i++)o[i]=Number.parseInt(n.slice(i*2,i*2+2),16);return o}function xt(t){return Array.from(t,e=>e.toString(16).padStart(2,"0")).join("")}function wt(t){const e=new Uint8Array(t.reduce((o,i)=>o+i.length,0));let n=0;for(const o of t)e.set(o,n),n+=o.length;return e}function It(t){let e=0;const n=(r,c)=>{if(!Number.isSafeInteger(r)||r<0)throw new Error(`Invalid ${c} length ${r}`);if(e+r>t.length)throw new Error(`Truncated Bitcoin transaction while reading ${c}`);const s=t.slice(e,e+r);return e+=r,s},o=(r,c)=>{const s=n(r,c);let a=0n;for(let P=s.length-1;P>=0;P--)a=a<<8n|BigInt(s[P]);return a},i=r=>{const c=e,s=n(1,r)[0];let a;if(s<253)a=BigInt(s);else if(s===253){if(a=o(2,r),a<0xfdn)throw new Error(`Non-canonical ${r}`)}else if(s===254){if(a=o(4,r),a<=0xffffn)throw new Error(`Non-canonical ${r}`)}else if(a=o(8,r),a<=0xffffffffn)throw new Error(`Non-canonical ${r}`);if(a>BigInt(Number.MAX_SAFE_INTEGER))throw new Error(`${r} exceeds JavaScript's safe integer range`);return{encoded:t.slice(c,e),value:Number(a)}},u=n(4,"version"),f=t[e]===0&&t[e+1]===1;f&&(e+=2);const d=i("input count"),p=[];for(let r=0;r<d.value;r++){const c=e;n(32,`input ${r} previous transaction hash`),n(4,`input ${r} previous output index`);const s=i(`input ${r} script length`);n(s.value,`input ${r} script`),n(4,`input ${r} sequence`),p.push(t.slice(c,e))}const b=i("output count"),m=[];for(let r=0;r<b.value;r++){const c=e;n(8,`output ${r} value`);const s=i(`output ${r} script length`);n(s.value,`output ${r} script`),m.push(t.slice(c,e))}if(f){let r=!1;for(let c=0;c<d.value;c++){const s=i(`input ${c} witness item count`);r||(r=s.value>0);for(let a=0;a<s.value;a++){const P=i(`input ${c} witness item ${a} length`);n(P.value,`input ${c} witness item ${a}`)}}if(!r)throw new Error("Bitcoin transaction has superfluous witness marker")}const E=n(4,"locktime");if(e!==t.length)throw new Error(`Bitcoin transaction has ${t.length-e} trailing byte(s)`);return wt([u,d.encoded,...p,b.encoded,...m,E])}function X(t){const e=It(Et(t,"transactionHex")),n=l.sha256(l.sha256(e));return n.reverse(),`0x${xt(n)}`}function vt(t,e){const n=t.startsWith("0x")?t:`0x${t}`;if(!/^0x[0-9a-fA-F]{64}$/.test(n))throw new Error("peginTxHash must be a 32-byte hex value");const o=e.startsWith("0x")?e:`0x${e}`;if(!C.isAddress(o,{strict:!0}))throw new Error(`Invalid depositor Ethereum address: ${e}`);return C.keccak256(C.encodeAbiParameters([{type:"bytes32"},{type:"address"}],[n,o])).slice(2)}const D="VaultClaimableByNotFoundError";class W extends Error{constructor(e,n,o,i,u="the vault has not been redeemed for this key, or the node did not serve the block. Redeem first, or try again.",f){super(`No VaultClaimableBy log for vault ${e} and claimer ${n} in blocks ${o}..${i}: ${u}`,f),this.vaultId=e,this.claimerPk=n,this.fromBlock=o,this.toBlock=i,this.name=D}}function Ct(t){return t instanceof W?!0:typeof t!="object"||t===null?!1:t.name===D}const T=65535,S=1e4,I=4294967295,V=255;function Tt(t){if(!Number.isInteger(t)||t<0||t>I)throw new Error(`Invalid offchainParamsVersion from contract: must be a uint32, got ${t}`)}function Y(t){const e=[];if(t.timelockAssert<=0n&&e.push(`timelockAssert must be positive, got ${t.timelockAssert}`),t.timelockAssert>BigInt(T)&&e.push(`timelockAssert ${t.timelockAssert} exceeds uint16 max (${T})`),t.timelockChallengeAssert<=0n&&e.push(`timelockChallengeAssert must be positive, got ${t.timelockChallengeAssert}`),t.tRefund<=0&&e.push(`tRefund must be positive, got ${t.tRefund}`),t.tStale<=0&&e.push(`tStale must be positive, got ${t.tStale}`),t.securityCouncilKeys.length===0&&e.push("securityCouncilKeys must not be empty"),t.councilQuorum<=0&&e.push(`councilQuorum must be positive, got ${t.councilQuorum}`),t.councilQuorum>t.securityCouncilKeys.length&&e.push(`councilQuorum (${t.councilQuorum}) exceeds securityCouncilKeys count (${t.securityCouncilKeys.length})`),t.feeRate<=0n&&e.push(`feeRate must be positive, got ${t.feeRate}`),t.minPeginFeeRate<=0n&&e.push(`minPeginFeeRate must be positive, got ${t.minPeginFeeRate}`),(!Number.isInteger(t.proverCircuitVersion)||t.proverCircuitVersion<0||t.proverCircuitVersion>T)&&e.push(`proverCircuitVersion must be a uint16, got ${t.proverCircuitVersion}`),(!Number.isInteger(t.minPrepeginDepth)||t.minPrepeginDepth<=0||t.minPrepeginDepth>I)&&e.push(`minPrepeginDepth must be a uint32 in [1, ${I}], got ${t.minPrepeginDepth}`),t.babeTotalInstances<=0&&e.push(`babeTotalInstances must be positive, got ${t.babeTotalInstances}`),t.babeInstancesToFinalize<=0&&e.push(`babeInstancesToFinalize must be positive, got ${t.babeInstancesToFinalize}`),t.babeInstancesToFinalize>t.babeTotalInstances&&e.push(`babeInstancesToFinalize (${t.babeInstancesToFinalize}) exceeds babeTotalInstances (${t.babeTotalInstances})`),(t.minVpCommissionBps<0||t.minVpCommissionBps>S)&&e.push(`minVpCommissionBps must be in [0, ${S}], got ${t.minVpCommissionBps}`),e.length>0)throw new Error(`Invalid offchain protocol parameters: ${e.join("; ")}`)}function z(t){const e=[];if(t.minimumPegInAmount<=0n&&e.push(`minimumPegInAmount must be positive, got ${t.minimumPegInAmount}`),t.maxPegInAmount<t.minimumPegInAmount&&e.push(`maxPegInAmount (${t.maxPegInAmount}) must be >= minimumPegInAmount (${t.minimumPegInAmount})`),t.pegInAckTimeout<=0n&&e.push(`pegInAckTimeout must be positive, got ${t.pegInAckTimeout}`),t.pegInActivationTimeout<=0n&&e.push(`pegInActivationTimeout must be positive, got ${t.pegInActivationTimeout}`),(!Number.isInteger(t.maxHtlcOutputCount)||t.maxHtlcOutputCount<=0||t.maxHtlcOutputCount>V)&&e.push(`maxHtlcOutputCount must be an integer in [1, ${V}], got ${t.maxHtlcOutputCount}`),(typeof t.expiredPegInGraceBlocks!="bigint"||t.expiredPegInGraceBlocks<=0n)&&e.push(`expiredPegInGraceBlocks must be a positive bigint, got ${t.expiredPegInGraceBlocks}`),e.length>0)throw new Error(`Invalid TBV protocol parameters: ${e.join("; ")}`)}function At(t){if(z(t),Y(t.offchainParams),!Number.isInteger(t.offchainParamsVersion)||t.offchainParamsVersion<0||t.offchainParamsVersion>I)throw new Error(`Invalid peg-in configuration: offchainParamsVersion must be a uint32, got ${t.offchainParamsVersion}`);g.assertValidVaultCoreVersion(t.activeVaultCoreVersion,"ProtocolParams.activeVaultCoreVersion()")}const G="RegistrationLogsUnavailableError";class B extends Error{constructor(n,o){super(o??`The Ethereum node returned no registration logs for block ${n}, which holds a vault registration; the node may not have indexed that block yet. Try again.`);y(this,"blockNumber");this.name=G,this.blockNumber=n}}function kt(t){return t instanceof B?!0:typeof t!="object"||t===null?!1:t.name===G}const Bt=2;function Rt(t,e,n){const o=e.toLowerCase(),i=t.find(u=>u.vaultId===o);if(i===void 0)throw new B(n,`Vault ${e} has no PegInSubmittedV2 registration log at its on-chain registration block ${n}: either the node served a partial answer for block ${n} (retry, preferably another node) or the vault was not registered in this block`);return i}function _t(t){return X(t.unsignedPrePeginTx)}function St(t){const e=(t.depositorPayoutScriptPubKey.length-Bt)/2;if(e===0||e>w.MAX_PAYOUT_SCRIPT_LEN)throw new Error(`PegInSubmittedV2 log for vault ${t.vaultId} carries a ${e}-byte depositorPayoutBtcAddress; expected 1..${w.MAX_PAYOUT_SCRIPT_LEN} bytes`)}exports.RegistrationLogsUnavailableError=B;exports.VaultClaimableByNotFoundError=W;exports.assertOnChainBtcPubkey=k;exports.assertPayoutScriptMatchesPopKey=$t;exports.assertRegisteredPayoutScriptBounds=St;exports.assertValidOffchainParamsVersion=Tt;exports.calculateBtcTxHash=X;exports.deriveP2trScript=M;exports.derivePeginVaultId=vt;exports.findRegistrationRecord=Rt;exports.isRegistrationLogsUnavailableError=kt;exports.isVaultClaimableByNotFoundError=Ct;exports.registrationPrePeginTxHash=_t;exports.ripemd160=H;exports.validateOffchainParams=Y;exports.validatePegInConfiguration=At;exports.validateTBVProtocolParams=z;
-//# sourceMappingURL=registration-records-DFQgBaYi.cjs.map
+"use strict";var tt=Object.defineProperty;var et=(t,e,n)=>e in t?tt(t,e,{enumerable:!0,configurable:!0,writable:!0,value:n}):t[e]=n;var y=(t,e,n)=>et(t,typeof e!="symbol"?e+"":e,n);const g=require("./secp256k1-DDHQ1_za.cjs"),l=require("./sha2-Ce6KewYx.cjs"),w=require("./constants-CAm10Qwp.cjs"),C=require("viem"),nt=Uint8Array.from([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),N=Uint8Array.from(new Array(16).fill(0).map((t,e)=>e)),ot=N.map(t=>(9*t+5)%16),U=(()=>{const n=[[N],[ot]];for(let o=0;o<4;o++)for(let i of n)i.push(i[o].map(u=>nt[u]));return n})(),L=U[0],O=U[1],F=[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map(t=>Uint8Array.from(t)),it=L.map((t,e)=>t.map(n=>F[e][n])),rt=O.map((t,e)=>t.map(n=>F[e][n])),st=Uint32Array.from([0,1518500249,1859775393,2400959708,2840853838]),ut=Uint32Array.from([1352829926,1548603684,1836072691,2053994217,0]);function R(t,e,n,o){return t===0?e^n^o:t===1?e&n|~e&o:t===2?(e|~n)^o:t===3?e&o|n&~o:e^(n|~o)}const x=new Uint32Array(16);class ct extends l.HashMD{constructor(){super(64,20,8,!0);y(this,"h0",1732584193);y(this,"h1",-271733879);y(this,"h2",-1732584194);y(this,"h3",271733878);y(this,"h4",-1009589776)}get(){const{h0:n,h1:o,h2:i,h3:u,h4:f}=this;return[n,o,i,u,f]}set(n,o,i,u,f){this.h0=n|0,this.h1=o|0,this.h2=i|0,this.h3=u|0,this.h4=f|0}process(n,o){for(let s=0;s<16;s++,o+=4)x[s]=n.getUint32(o,!0);let i=this.h0|0,u=i,f=this.h1|0,d=f,p=this.h2|0,b=p,m=this.h3|0,E=m,r=this.h4|0,c=r;for(let s=0;s<5;s++){const a=4-s,P=st[s],j=ut[s],q=L[s],Q=O[s],J=it[s],Z=rt[s];for(let h=0;h<16;h++){const v=l.rotl(i+R(s,f,p,m)+x[q[h]]+P,J[h])+r|0;i=r,r=m,m=l.rotl(p,10)|0,p=f,f=v}for(let h=0;h<16;h++){const v=l.rotl(u+R(a,d,b,E)+x[Q[h]]+j,Z[h])+c|0;u=c,c=E,E=l.rotl(b,10)|0,b=d,d=v}}this.set(this.h1+p+E|0,this.h2+m+c|0,this.h3+r+u|0,this.h4+i+d|0,this.h0+f+b|0)}roundClean(){l.clean(x)}destroy(){this.destroyed=!0,l.clean(this.buffer),this.set(0,0,0,0,0)}}const H=l.createHasher(()=>new ct),$=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,at=7n;function ft(t,e,n){let o=1n,i=t%n,u=e;for(;u>0n;)(u&1n)===1n&&(o=o*i%n),i=i*i%n,u>>=1n;return o}function lt(t){const e=BigInt(`0x${t}`);if(e>=$)return!1;const o=(e*e%$*e%$+at)%$,i=ft(o,$+1n>>2n,$);return i*i%$===o}function k(t,e){const n=t.toLowerCase();if(!/^0x[0-9a-f]{64}$/.test(n))throw new Error(`${e} returned an unexpected value (length ${n.length}, prefix "${n.slice(0,2)}")`);const o=n.slice(2);if(!lt(o))throw new Error(`${e} returned a value that is not on the secp256k1 curve`);return o}const ht="5120",A="0014",dt=20,_=33,pt=65,mt=2,gt=3,bt=4;function K(t,e){const n=t.startsWith("0x")||t.startsWith("0X")?t.slice(2):t;if(!/^(?:[0-9a-fA-F]{2})+$/.test(n))throw new Error(`${e} must be non-empty, even-length hex`);return`0x${n.toLowerCase()}`}function M(t){const e=l.hexToBytes(t),n=g.schnorr.utils.lift_x(BigInt(`0x${t}`)),o=g.schnorr.utils.bytesToNumberBE(g.schnorr.utils.taggedHash("TapTweak",e));if(o>=g.secp256k1.CURVE.n)throw new Error("Proof of possession BTC pubkey has an invalid TapTweak");const i=o===0n?n:n.add(g.schnorr.Point.BASE.multiply(o));return`0x${ht}${l.bytesToHex(g.schnorr.utils.pointToBytes(i))}`}function Pt(t){const e=K(t,"depositorBtcPubkeyRaw"),n=l.hexToBytes(e.slice(2));if(n.length===32)return{xOnlyPubkey:k(e,"Payout BTC pubkey")};const o=n.length===_&&(n[0]===mt||n[0]===gt),i=n.length===pt&&n[0]===bt;if(!o&&!i)throw new Error("depositorBtcPubkeyRaw must be x-only, compressed, or uncompressed");try{g.secp256k1.Point.fromBytes(n)}catch{throw new Error("depositorBtcPubkeyRaw is not a valid BTC pubkey")}return{xOnlyPubkey:l.bytesToHex(n.subarray(1,_)),compressedPubkey:o?n:void 0}}function yt(t){return`0x${A}${l.bytesToHex(H(l.sha256(t)))}`}function $t(t,e,n){const o=K(t,"depositorPayoutScriptPubKey");if((o.length-2)/2>w.MAX_PAYOUT_SCRIPT_LEN)throw new Error(`depositorPayoutScriptPubKey exceeds ${w.MAX_PAYOUT_SCRIPT_LEN} bytes`);const i=e.startsWith("0x")||e.startsWith("0X")?e.slice(2):e,u=k(`0x${i}`,"Proof of possession BTC pubkey"),f=Pt(n);if(f.xOnlyPubkey!==u)throw new Error("depositorBtcPubkeyRaw does not match the proof of possession BTC pubkey");if(o===M(u))return o;if(o.startsWith(`0x${A}`)&&o.length===2+A.length+dt*2){if(!f.compressedPubkey)throw new Error("A P2WPKH payout requires a compressed BTC pubkey");if(o===yt(f.compressedPubkey))return o}throw new Error("depositorPayoutScriptPubKey does not match the proof of possession BTC pubkey")}function Et(t,e){const n=t.startsWith("0x")?t.slice(2):t;if(n.length===0||n.length%2!==0)throw new Error(`${e} must be non-empty, even-length hex`);if(!/^[0-9a-fA-F]+$/.test(n))throw new Error(`${e} contains non-hex characters`);const o=new Uint8Array(n.length/2);for(let i=0;i<o.length;i++)o[i]=Number.parseInt(n.slice(i*2,i*2+2),16);return o}function xt(t){return Array.from(t,e=>e.toString(16).padStart(2,"0")).join("")}function wt(t){const e=new Uint8Array(t.reduce((o,i)=>o+i.length,0));let n=0;for(const o of t)e.set(o,n),n+=o.length;return e}function It(t){let e=0;const n=(r,c)=>{if(!Number.isSafeInteger(r)||r<0)throw new Error(`Invalid ${c} length ${r}`);if(e+r>t.length)throw new Error(`Truncated Bitcoin transaction while reading ${c}`);const s=t.slice(e,e+r);return e+=r,s},o=(r,c)=>{const s=n(r,c);let a=0n;for(let P=s.length-1;P>=0;P--)a=a<<8n|BigInt(s[P]);return a},i=r=>{const c=e,s=n(1,r)[0];let a;if(s<253)a=BigInt(s);else if(s===253){if(a=o(2,r),a<0xfdn)throw new Error(`Non-canonical ${r}`)}else if(s===254){if(a=o(4,r),a<=0xffffn)throw new Error(`Non-canonical ${r}`)}else if(a=o(8,r),a<=0xffffffffn)throw new Error(`Non-canonical ${r}`);if(a>BigInt(Number.MAX_SAFE_INTEGER))throw new Error(`${r} exceeds JavaScript's safe integer range`);return{encoded:t.slice(c,e),value:Number(a)}},u=n(4,"version"),f=t[e]===0&&t[e+1]===1;f&&(e+=2);const d=i("input count"),p=[];for(let r=0;r<d.value;r++){const c=e;n(32,`input ${r} previous transaction hash`),n(4,`input ${r} previous output index`);const s=i(`input ${r} script length`);n(s.value,`input ${r} script`),n(4,`input ${r} sequence`),p.push(t.slice(c,e))}const b=i("output count"),m=[];for(let r=0;r<b.value;r++){const c=e;n(8,`output ${r} value`);const s=i(`output ${r} script length`);n(s.value,`output ${r} script`),m.push(t.slice(c,e))}if(f){let r=!1;for(let c=0;c<d.value;c++){const s=i(`input ${c} witness item count`);r||(r=s.value>0);for(let a=0;a<s.value;a++){const P=i(`input ${c} witness item ${a} length`);n(P.value,`input ${c} witness item ${a}`)}}if(!r)throw new Error("Bitcoin transaction has superfluous witness marker")}const E=n(4,"locktime");if(e!==t.length)throw new Error(`Bitcoin transaction has ${t.length-e} trailing byte(s)`);return wt([u,d.encoded,...p,b.encoded,...m,E])}function X(t){const e=It(Et(t,"transactionHex")),n=l.sha256(l.sha256(e));return n.reverse(),`0x${xt(n)}`}function vt(t,e){const n=t.startsWith("0x")?t:`0x${t}`;if(!/^0x[0-9a-fA-F]{64}$/.test(n))throw new Error("peginTxHash must be a 32-byte hex value");const o=e.startsWith("0x")?e:`0x${e}`;if(!C.isAddress(o,{strict:!0}))throw new Error(`Invalid depositor Ethereum address: ${e}`);return C.keccak256(C.encodeAbiParameters([{type:"bytes32"},{type:"address"}],[n,o])).slice(2)}const D="VaultClaimableByNotFoundError";class W extends Error{constructor(e,n,o,i,u="the vault has not been redeemed for this key, or the node did not serve the block. Redeem first, or try again.",f){super(`No VaultClaimableBy log for vault ${e} and claimer ${n} in blocks ${o}..${i}: ${u}`,f),this.vaultId=e,this.claimerPk=n,this.fromBlock=o,this.toBlock=i,this.name=D}}function Ct(t){return t instanceof W?!0:typeof t!="object"||t===null?!1:t.name===D}const T=65535,S=1e4,I=4294967295,V=255;function Tt(t){if(!Number.isInteger(t)||t<0||t>I)throw new Error(`Invalid offchainParamsVersion from contract: must be a uint32, got ${t}`)}function Y(t){const e=[];if(t.timelockAssert<=0n&&e.push(`timelockAssert must be positive, got ${t.timelockAssert}`),t.timelockAssert>BigInt(T)&&e.push(`timelockAssert ${t.timelockAssert} exceeds uint16 max (${T})`),t.timelockChallengeAssert<=0n&&e.push(`timelockChallengeAssert must be positive, got ${t.timelockChallengeAssert}`),t.tRefund<=0&&e.push(`tRefund must be positive, got ${t.tRefund}`),t.tStale<=0&&e.push(`tStale must be positive, got ${t.tStale}`),t.securityCouncilKeys.length===0&&e.push("securityCouncilKeys must not be empty"),t.councilQuorum<=0&&e.push(`councilQuorum must be positive, got ${t.councilQuorum}`),t.councilQuorum>t.securityCouncilKeys.length&&e.push(`councilQuorum (${t.councilQuorum}) exceeds securityCouncilKeys count (${t.securityCouncilKeys.length})`),t.feeRate<=0n&&e.push(`feeRate must be positive, got ${t.feeRate}`),t.minPeginFeeRate<=0n&&e.push(`minPeginFeeRate must be positive, got ${t.minPeginFeeRate}`),(!Number.isInteger(t.proverCircuitVersion)||t.proverCircuitVersion<0||t.proverCircuitVersion>T)&&e.push(`proverCircuitVersion must be a uint16, got ${t.proverCircuitVersion}`),(!Number.isInteger(t.minPrepeginDepth)||t.minPrepeginDepth<=0||t.minPrepeginDepth>I)&&e.push(`minPrepeginDepth must be a uint32 in [1, ${I}], got ${t.minPrepeginDepth}`),t.babeTotalInstances<=0&&e.push(`babeTotalInstances must be positive, got ${t.babeTotalInstances}`),t.babeInstancesToFinalize<=0&&e.push(`babeInstancesToFinalize must be positive, got ${t.babeInstancesToFinalize}`),t.babeInstancesToFinalize>t.babeTotalInstances&&e.push(`babeInstancesToFinalize (${t.babeInstancesToFinalize}) exceeds babeTotalInstances (${t.babeTotalInstances})`),(t.minVpCommissionBps<0||t.minVpCommissionBps>S)&&e.push(`minVpCommissionBps must be in [0, ${S}], got ${t.minVpCommissionBps}`),e.length>0)throw new Error(`Invalid offchain protocol parameters: ${e.join("; ")}`)}function z(t){const e=[];if(t.minimumPegInAmount<=0n&&e.push(`minimumPegInAmount must be positive, got ${t.minimumPegInAmount}`),t.maxPegInAmount<t.minimumPegInAmount&&e.push(`maxPegInAmount (${t.maxPegInAmount}) must be >= minimumPegInAmount (${t.minimumPegInAmount})`),t.pegInAckTimeout<=0n&&e.push(`pegInAckTimeout must be positive, got ${t.pegInAckTimeout}`),t.pegInActivationTimeout<=0n&&e.push(`pegInActivationTimeout must be positive, got ${t.pegInActivationTimeout}`),(!Number.isInteger(t.maxHtlcOutputCount)||t.maxHtlcOutputCount<=0||t.maxHtlcOutputCount>V)&&e.push(`maxHtlcOutputCount must be an integer in [1, ${V}], got ${t.maxHtlcOutputCount}`),(typeof t.expiredPegInGraceBlocks!="bigint"||t.expiredPegInGraceBlocks<=0n)&&e.push(`expiredPegInGraceBlocks must be a positive bigint, got ${t.expiredPegInGraceBlocks}`),e.length>0)throw new Error(`Invalid TBV protocol parameters: ${e.join("; ")}`)}function At(t){if(z(t),Y(t.offchainParams),!Number.isInteger(t.offchainParamsVersion)||t.offchainParamsVersion<0||t.offchainParamsVersion>I)throw new Error(`Invalid peg-in configuration: offchainParamsVersion must be a uint32, got ${t.offchainParamsVersion}`);g.assertValidVaultCoreVersion(t.activeVaultCoreVersion,"ProtocolParams.activeVaultCoreVersion()")}const G="RegistrationLogsUnavailableError";class B extends Error{constructor(n,o){super(o??`The Ethereum node returned no registration logs for block ${n}, which holds a vault registration; the node may not have indexed that block yet. Try again.`);y(this,"blockNumber");this.name=G,this.blockNumber=n}}function kt(t){return t instanceof B?!0:typeof t!="object"||t===null?!1:t.name===G}const Bt=2;function Rt(t,e,n){const o=e.toLowerCase(),i=t.find(u=>u.vaultId===o);if(i===void 0)throw new B(n,`Vault ${e} has no PegInSubmittedV2 registration log at its on-chain registration block ${n}: either the node served a partial answer for block ${n} (retry, preferably another node) or the vault was not registered in this block`);return i}function _t(t){return X(t.unsignedPrePeginTx)}function St(t){const e=(t.depositorPayoutScriptPubKey.length-Bt)/2;if(e===0||e>w.MAX_PAYOUT_SCRIPT_LEN)throw new Error(`PegInSubmittedV2 log for vault ${t.vaultId} carries a ${e}-byte depositorPayoutBtcAddress; expected 1..${w.MAX_PAYOUT_SCRIPT_LEN} bytes`)}exports.RegistrationLogsUnavailableError=B;exports.VaultClaimableByNotFoundError=W;exports.assertOnChainBtcPubkey=k;exports.assertPayoutScriptMatchesPopKey=$t;exports.assertRegisteredPayoutScriptBounds=St;exports.assertValidOffchainParamsVersion=Tt;exports.calculateBtcTxHash=X;exports.deriveP2trScript=M;exports.derivePeginVaultId=vt;exports.findRegistrationRecord=Rt;exports.isRegistrationLogsUnavailableError=kt;exports.isVaultClaimableByNotFoundError=Ct;exports.registrationPrePeginTxHash=_t;exports.ripemd160=H;exports.validateOffchainParams=Y;exports.validatePegInConfiguration=At;exports.validateTBVProtocolParams=z;
+//# sourceMappingURL=registration-records-DaBufozs.cjs.map