@babylonlabs-io/ts-sdk 3.0.2 → 3.1.0

package/dist/toRefundInputs-BZXvuOMY.cjs

@@ -0,0 +1,2 @@
+"use strict";var Pe=Object.defineProperty;var fe=(e,t,r)=>t in e?Pe(e,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):e[t]=r;var j=(e,t,r)=>fe(e,typeof t!="symbol"?t+"":t,r);const M=require("./registration-records-DFQgBaYi.cjs"),p=require("./bitcoin-D-O2GjbC.cjs"),N=require("./btcTxHash-CGb5BqFL.cjs"),O=require("bitcoinjs-lib"),ve=require("buffer"),be=require("./tbv/core/clients/mempool/index.cjs"),X=require("./validation-C6XTfZak.cjs"),C=require("viem"),Ee=require("./sha2-Ce6KewYx.cjs"),D=require("./PayoutManager-DOdsgcUR.cjs"),ee=require("./PeginManager-8EUlm10F.cjs"),v=require("./tbv/core/wasm/index.cjs"),xe=require("./deriveVaultRoot-C3uqnJto.cjs"),we=require("./parseFundingOutpoints-C_-PT9BT.cjs"),K=require("./verifyScriptPathSchnorrSignature-D2t1yACC.cjs"),Q=require("./fundPeginTransaction-54-Rwb2k.cjs"),ye=["vaultCoreVersion","offchainParamsVersion","appVaultKeepersVersion","universalChallengersVersion"],Ce=["applicationEntryPoint","vaultProvider"];function te(e,t){const r=t.depositor.toLowerCase(),n=M.registrationPrePeginTxHash(t).toLowerCase();return e.filter(o=>o.vaultId!==t.vaultId&&o.depositor.toLowerCase()===r&&M.registrationPrePeginTxHash(o).toLowerCase()===n)}function re(e,t){for(const r of t){for(const n of ye)if(r.vault.protocol[n]!==e.vault.protocol[n])throw new Error(`Sibling vaults of this Pre-PegIn disagree on ${n} (${r.vault.protocol[n]} vs ${e.vault.protocol[n]}); the batch cannot be described by one set of deposit terms.`);if(r.maxAcceptableCommissionBps!==e.maxAcceptableCommissionBps)throw new Error(`Sibling vaults of this Pre-PegIn disagree on maxAcceptableCommissionBps (${r.maxAcceptableCommissionBps} vs ${e.maxAcceptableCommissionBps}); the batch cannot be described by one set of deposit terms.`);for(const n of Ce)if(r.vault.basic[n].toLowerCase()!==e.vault.basic[n].toLowerCase())throw new Error(`Sibling vaults of this Pre-PegIn disagree on ${n} (${r.vault.basic[n]} vs ${e.vault.basic[n]}); the batch cannot be described by one set of deposit terms.`)}}function ne(e){const t=[...e].sort((r,n)=>r.vault.protocol.htlcVout-n.vault.protocol.htlcVout);return t.forEach((r,n)=>{if(r.vault.protocol.htlcVout!==n)throw new Error(`Sibling discovery produced a non-contiguous HTLC vector (${t.map(o=>o.vault.protocol.htlcVout).join(", ")}).`)}),t.map(r=>({hashlock:r.vault.protocol.hashlock,amount:r.vault.basic.amount}))}const L="DepositTermsRejectedError";class oe extends Error{constructor(r,n="device-envelope"){super(r);j(this,"reason");this.name=L,this.reason=n}}function Re(e){if(e instanceof oe)return!0;if(typeof e!="object"||e===null)return!1;const t=e;return t.name===L&&t.reason==="device-envelope"}async function se(e,t){const r=O.Transaction.fromHex(p.stripHexPrefix(e)),o=(await Promise.all(r.ins.map(i=>be.getUtxoInfo(ve.Buffer.from(i.hash).reverse().toString("hex"),i.index,t)))).reduce((i,a)=>i+BigInt(a.value),0n),u=r.outs.reduce((i,a)=>i+BigInt(a.value),0n),s=o-u;if(s<=0n)throw new Error(`The funded Pre-PegIn transaction's inputs do not cover its outputs plus a fee (computed fee: ${s} sats).`);if(s>X.MAX_REASONABLE_FEE_SATS)throw new Error(`The funded Pre-PegIn transaction's computed fee (${s} sats) exceeds the maximum reasonable fee (${X.MAX_REASONABLE_FEE_SATS} sats); the mempool API may have returned manipulated prevout data.`);return s}async function z(e){const t=e.siblings.length;if(t===0)throw new Error("rebuildDepositTermsCore: at least one sibling is required");for(const[l,E]of e.siblings.entries())if(E.amount<=0n)throw new Error(`rebuildDepositTermsCore: sibling[${l}] has non-positive on-chain pegin amount ${E.amount}; the chain-read vault record is invalid. Resume refused.`);if(e.prepeginMaxFee<=0n)throw new Error(`rebuildDepositTermsCore: prepeginMaxFee must be > 0, got ${e.prepeginMaxFee}`);const r=p.stripHexPrefix(e.prepeginTxid).toLowerCase(),n=p.stripHexPrefix(N.calculateBtcTxHash(e.fundedPrePeginTxHex)).toLowerCase();if(n!==r)throw new Error(`Funded Pre-PegIn tx hashes to ${n}, expected ${r} (on-chain prepeginTxid). Resume refused.`);const o=D.findAuthAnchorOpReturn(p.stripHexPrefix(e.fundedPrePeginTxHex));if(o===void 0)throw new Error("Funded Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN commitment — it either predates auth anchoring or is malformed. The intent resume path requires the anchor to prove sibling completeness. Resume refused.");if(o.vout!==t)throw new Error(`Auth-anchor OP_RETURN at vout ${o.vout} does not match the discovered sibling count ${t}; the discovered sibling set does not cover this transaction's HTLC outputs (a lagging index can cause this — retry later). Resume refused.`);const u=e.vaultKeeperBtcPubkeys.length,s=e.universalChallengerBtcPubkeys.length,i=await v.computeMinClaimValue(e.vaultCoreVersion,u,s,e.councilQuorum,e.councilSize,e.protocolFeeRate),a=await v.computeMinPeginFee(e.vaultCoreVersion,u,s,e.minPeginFeeRate),d=await v.peginP2aAnchorOutput(e.vaultCoreVersion),c=(d==null?void 0:d.value)??0n;if(i<=0n)throw new Error(`WASM returned non-positive depositorClaimValue ${i}; expected > 0. Resume refused.`);if(a<=0n)throw new Error(`WASM returned non-positive peginMaxFee ${a}; expected > 0. Resume refused.`);if(c<0n)throw new Error(`WASM returned negative P2A anchor value ${c}. Resume refused.`);const h=a+c,b=e.minPeginFeeRate*Q.MAX_REASONABLE_PEGIN_VBYTES;if(h<=0n||h>b)throw new Error(`WASM implied PegIn reserve ${h} sat is outside (0, ${b}] (minPeginFeeRate=${e.minPeginFeeRate} × ${Q.MAX_REASONABLE_PEGIN_VBYTES} vbytes). Resume refused.`);const w=e.siblings.map(l=>l.amount+i+a+c),R=await Promise.all(e.siblings.map(async l=>(await v.getPrePeginHtlcConnectorInfo({txGraphVersion:e.vaultCoreVersion,depositorPubkey:e.depositorBtcPubkey,vaultProviderPubkey:e.vaultProviderBtcPubkey,vaultKeeperPubkeys:[...e.vaultKeeperBtcPubkeys],universalChallengerPubkeys:[...e.universalChallengerBtcPubkeys],hashlock:p.stripHexPrefix(l.hashlock),timelockRefund:e.timelockRefund,network:e.network})).scriptPubKey)),y=O.Transaction.fromHex(p.stripHexPrefix(e.fundedPrePeginTxHex)).outs.map(l=>({value:l.value,script:l.script}));return K.assertEncodedHtlcOutputsMatch(y,w,R),ee.buildDepositTerms({vaultCoreVersion:e.vaultCoreVersion,protocolFeeRate:e.protocolFeeRate,timelockPegin:e.timelockPegin,timelockAssert:e.timelockAssert,timelockRefund:e.timelockRefund,prepeginTxid:e.prepeginTxid,prepeginMaxFee:e.prepeginMaxFee,vaultProviderBtcPubkey:e.vaultProviderBtcPubkey,vaultKeeperBtcPubkeys:e.vaultKeeperBtcPubkeys,universalChallengerBtcPubkeys:e.universalChallengerBtcPubkeys,maxAcceptableCommissionBps:e.maxAcceptableCommissionBps,peginAmounts:e.siblings.map(l=>l.amount),depositorClaimValue:i,peginMaxFee:a})}async function ke(e){const{read:t}=e,r=p.canonicalizeBtcPubkey(e.depositorBtcPubkey);if(r!==t.context.depositorBtcPubkey)throw new Error("Connected wallet key is not the vault's depositor key; select the account that made the deposit.");const n=p.stripHexPrefix(t.prePeginTxHash).toLowerCase(),o=p.stripHexPrefix(N.calculateBtcTxHash(e.fundedPrePeginTxHex)).toLowerCase();if(o!==n)throw new Error(`Funded Pre-PegIn tx hashes to ${o}, expected ${n} (on-chain prePeginTxHash).`);const u=await Promise.all(te(t.registrationRecords,t.registrationRecord).map(async d=>{const c=await e.siblingReader.getVaultData(d.vaultId);if(c.protocol.prePeginTxHash.toLowerCase()!==M.registrationPrePeginTxHash(d).toLowerCase())throw new Error(`Sibling ${d.vaultId} is registered against a different Pre-PegIn on chain than its registration log records; refusing an inconsistent node.`);return{vault:c,maxAcceptableCommissionBps:d.maxAcceptableCommissionBps}})),s={vault:t.vault,maxAcceptableCommissionBps:t.registrationRecord.maxAcceptableCommissionBps};re(s,u);const i=ne([s,...u]),a=await se(e.fundedPrePeginTxHex,e.mempoolApiUrl);return z({vaultCoreVersion:t.vault.protocol.vaultCoreVersion,siblings:i,fundedPrePeginTxHex:e.fundedPrePeginTxHex,depositorBtcPubkey:r,vaultProviderBtcPubkey:t.participantKeys.vaultProvider.operationBtcPubkey,vaultKeeperBtcPubkeys:t.participantKeys.vaultKeeperOperationKeysSorted,universalChallengerBtcPubkeys:t.participantKeys.universalChallengerOperationKeysSorted,protocolFeeRate:t.offchainParams.feeRate,minPeginFeeRate:t.offchainParams.minPeginFeeRate,councilQuorum:t.offchainParams.councilQuorum,councilSize:t.offchainParams.securityCouncilKeys.length,timelockPegin:t.context.timelockPegin,timelockAssert:t.context.timelockAssert,timelockRefund:t.offchainParams.tRefund,prepeginTxid:n,prepeginMaxFee:a,maxAcceptableCommissionBps:t.registrationRecord.maxAcceptableCommissionBps,network:e.network})}function Te(e){const t=(e instanceof Error?e.message:typeof e=="string"?e:"").toLowerCase();return t.includes("wots")&&t.includes("hash")&&t.includes("does not match")}const ie="TBV.PeginFingerprint.v1",ae=C.keccak256(C.toHex(ie)),W=65535,J=2n**64n-1n,Ae=2n**256n-1n,Ve=/^0x[0-9a-fA-F]{64}$/,Y=1;class P extends Error{constructor(t){super(t),this.name="PeginFingerprintInputError"}}function Ie(e){return e instanceof P||e instanceof Error&&e.name==="PeginFingerprintInputError"}function _(e,t,r,n){if(typeof t!="bigint")throw new P(`${e} must be a bigint (Solidity ${n}), got ${typeof t}`);if(t<0n||t>r)throw new P(`${e} must fit Solidity ${n} (0..${r}), got ${t}`)}function $(e,t){if(!Number.isInteger(t)||t<0||t>W)throw new P(`${e} must be an integer fitting Solidity uint16 (0..${W}), got ${t}`)}function $e(e,t){if(!Ve.test(t))throw new P(`${e} must be 32 bytes as 0x-prefixed hex (66 characters), got "${t}"`);return t.toLowerCase()}function Be(e){if(!C.isAddress(e,{strict:!1}))throw new P(`registryAddress must be a 20-byte 0x-prefixed address, got "${e}"`);const t=e.toLowerCase();if(t===C.zeroAddress)throw new P("registryAddress must not be the zero address; a zero here means the registry address was never resolved");return t}const Fe=[{name:"domain",type:"bytes32"},{name:"chainId",type:"uint256"},{name:"registry",type:"address"},{name:"vaultProviderBtcKey",type:"bytes32"},{name:"appKeeperKeyEpoch",type:"uint64"},{name:"ucKeyEpoch",type:"uint64"},{name:"appVaultKeepersVersion",type:"uint16"},{name:"universalChallengersVersion",type:"uint16"},{name:"offchainParamsVersion",type:"uint16"},{name:"vaultCoreVersion",type:"uint16"}];function ce(e){if(_("chainId",e.chainId,Ae,"uint256"),e.chainId===0n)throw new P("chainId must not be 0; a zero here means the chain id was never resolved");const t=Be(e.registryAddress),r=$e("vaultProviderBtcKey",e.vaultProviderBtcKey);if(_("appKeeperKeyEpoch",e.appKeeperKeyEpoch,J,"uint64"),_("ucKeyEpoch",e.ucKeyEpoch,J,"uint64"),$("appVaultKeepersVersion",e.appVaultKeepersVersion),$("universalChallengersVersion",e.universalChallengersVersion),$("offchainParamsVersion",e.offchainParamsVersion),$("vaultCoreVersion",e.vaultCoreVersion),e.vaultCoreVersion<Y)throw new P(`vaultCoreVersion must be at least ${Y}; ${e.vaultCoreVersion} means the version was never resolved`);return C.encodeAbiParameters(Fe,[ae,e.chainId,t,r,e.appKeeperKeyEpoch,e.ucKeyEpoch,e.appVaultKeepersVersion,e.universalChallengersVersion,e.offchainParamsVersion,e.vaultCoreVersion])}function Se(e){return C.keccak256(ce(e))}class ue extends Error{constructor(t,r){super(`Re-derived vault root does not match this Pre-PegIn: derived auth-anchor hash ${t}, transaction commits to ${r}. Connect the same wallet, on the same account and the same network, that created the deposit.`),this.derivedAuthAnchorHash=t,this.onChainAuthAnchorHash=r,this.name="VaultRootMismatchError"}}class F extends Error{constructor(t){super(t),this.name="UnanchoredPrePeginError"}}class le extends Error{constructor(t,r,n=[]){super(`No candidate parameter set reproduces this Pre-PegIn's HTLC outputs (${t} candidate(s) tried). `+(n.length>0?`${n.length} version(s) could not be resolved and may hold the answer: ${n.join(" | ")}. `:"")+`Sample rejections: ${r.join(" | ")}`),this.candidatesTried=t,this.sampleRejections=r,this.unresolvedLabels=n,this.name="PeginParamsNotFoundError"}}class he extends Error{constructor(t){super(`${t.length} candidate parameter sets reproduce this Pre-PegIn's HTLC outputs, so the vault's stamped versions cannot be determined: ${t.join(" | ")}. Reconstruction refused.`),this.survivorLabels=t,this.name="PeginParamsAmbiguousError"}}class de extends Error{constructor(t,r){super(`A candidate matched this Pre-PegIn (${t}), but ${r.length} version(s) could not be resolved, so the search space did not provably contain the true parameters: ${r.join(" | ")}. A version sharing the matched timelockRefund and participants is indistinguishable from the true one, so the match cannot be trusted. Reconstruction refused.`),this.matchedLabel=t,this.unresolvedLabels=r,this.name="PeginParamsIncompleteSpaceError"}}class V extends Error{constructor(t){super(`${t}. Reconstruction refused.`),this.name="PeginSizingIntegrityError"}}async function He(e){const{wallet:t,depositorBtcPubkey:r,fundedPrePeginTxHex:n}=e,o=p.stripHexPrefix(n),u=D.findAuthAnchorOpReturn(o);if(u===void 0)throw new F("Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN, so the number of HTLC outputs it funds cannot be determined. Legacy pre-anchor deposits are not recoverable by this path.");const s=u.vout;if(s===0)throw new F("Pre-PegIn's auth-anchor OP_RETURN is at vout 0, implying zero HTLC outputs; there is nothing to recover.");const i=we.parseFundingOutpointsFromTx(o),a=await xe.deriveVaultRoot(t,{depositorBtcPubkey:p.hexToUint8Array(p.processPublicKeyToXOnly(r)),fundingOutpoints:i});try{const c=await v.expandAuthAnchor(a);let h;try{h=p.uint8ArrayToHex(Ee.sha256(c))}finally{c.fill(0)}if(h!==u.hash)throw new ue(h,u.hash)}catch(c){throw a.fill(0),c}const{hashlocks:d}=await ee.expandPerVaultSecrets(a,s);return{vaultCount:s,hashlocks:d,authAnchorHash:u.hash}}function _e(e){const{vaultCoreVersion:t,offchainParams:r,participantKeySets:n}=e;if(!Number.isInteger(t)||t<1)throw new Error(`buildPeginParamsCandidates: vaultCoreVersion must be a positive integer, got ${t}`);if(r.length===0)throw new Error("buildPeginParamsCandidates: at least one offchain-params version is required");if(n.length===0)throw new Error("buildPeginParamsCandidates: at least one participant key set is required");const o=[];for(const u of r)for(const s of n)o.push({vaultCoreVersion:t,offchainParams:u,participants:s});return o}function pe(e){return`${e.axis} v${e.version} (${e.reason})`}function B(e){const{participants:t}=e;return`core=${e.vaultCoreVersion} offchain=${e.offchainParams.version} keepers=${t.appVaultKeepersVersion} challengers=${t.universalChallengersVersion} vp=${t.vaultProvider}`}const Z=5;function Me(e,t){return JSON.stringify({terms:e,peginAmounts:t},(r,n)=>typeof n=="bigint"?`${n}`:n)}function Ke(e){const{offchainParams:t,participants:r}=e;return[e.vaultCoreVersion,r.vaultKeeperBtcPubkeys.length,r.universalChallengerBtcPubkeys.length,t.councilQuorum,t.councilSize,t.protocolFeeRate,t.minPeginFeeRate].join("|")}async function Ne(e){const{offchainParams:t,participants:r}=e,n=r.vaultKeeperBtcPubkeys.length,o=r.universalChallengerBtcPubkeys.length,[u,s,i]=await Promise.all([v.computeMinClaimValue(e.vaultCoreVersion,n,o,t.councilQuorum,t.councilSize,t.protocolFeeRate),v.computeMinPeginFee(e.vaultCoreVersion,n,o,t.minPeginFeeRate),v.peginP2aAnchorOutput(e.vaultCoreVersion)]),a=(i==null?void 0:i.value)??0n;if(u<=0n)throw new V(`WASM returned non-positive depositorClaimValue ${u} for graph version ${e.vaultCoreVersion}`);if(s<=0n)throw new V(`WASM returned non-positive peginMaxFee ${s} for graph version ${e.vaultCoreVersion}`);if(a<0n)throw new V(`WASM returned negative P2A anchor value ${a} for graph version ${e.vaultCoreVersion}`);return{depositorClaimValue:u,peginMaxFee:s,p2aAnchorValue:a}}async function Oe(e){const{hashlocks:t,fundedPrePeginTxHex:r,depositorBtcPubkey:n,prepeginMaxFee:o,maxAcceptableCommissionBps:u,network:s,candidates:i,unresolvedVersions:a}=e;if(t.length===0)throw new Error("reconstructPeginParams: at least one hashlock is required");if(i.length===0)throw new Error("reconstructPeginParams: candidate space is empty");const d=p.processPublicKeyToXOnly(n),c=p.stripHexPrefix(r),h=D.findAuthAnchorOpReturn(c);if(h===void 0)throw new F("Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN; the sibling set cannot be proven complete. Reconstruction refused.");if(h.vout!==t.length)throw new Error(`reconstructPeginParams: ${t.length} hashlock(s) supplied but the auth-anchor OP_RETURN sits at vout ${h.vout}, so the transaction funds ${h.vout} HTLC output(s). Reconstruction refused.`);const b=O.Transaction.fromHex(c).outs,w=t.map((m,g)=>BigInt(b[g].value)),R=p.stripHexPrefix(N.calculateBtcTxHash(c)).toLowerCase(),y=new Map,l=[],E=[],S=[];let U=0;for(const m of i)try{const g=Ke(m);let f=y.get(g);f===void 0&&(f=await Ne(m),y.set(g,f));const k=f.depositorClaimValue+f.peginMaxFee+f.p2aAnchorValue,T=w.map(A=>A-k),I=T.findIndex(A=>A<=0n);if(I!==-1)throw new K.HtlcOutputMismatchError(`HTLC output[${I}] value ${w[I]} is not above this candidate's reserve ${k}, so it implies a non-positive pegin amount ${T[I]}.`);const{offchainParams:x,participants:H}=m,G=await z({vaultCoreVersion:m.vaultCoreVersion,siblings:t.map((A,ge)=>({hashlock:A,amount:T[ge]})),fundedPrePeginTxHex:c,depositorBtcPubkey:d,vaultProviderBtcPubkey:H.vaultProviderBtcPubkey,vaultKeeperBtcPubkeys:H.vaultKeeperBtcPubkeys,universalChallengerBtcPubkeys:H.universalChallengerBtcPubkeys,protocolFeeRate:x.protocolFeeRate,minPeginFeeRate:x.minPeginFeeRate,councilQuorum:x.councilQuorum,councilSize:x.councilSize,timelockPegin:x.timelockPegin,timelockAssert:x.timelockAssert,timelockRefund:x.timelockRefund,prepeginTxid:R,prepeginMaxFee:o,maxAcceptableCommissionBps:u,network:s});l.push({candidate:m,terms:G,peginAmounts:T,fingerprint:Me(G,T)})}catch(g){if(g instanceof V)throw g;const f=B(m),k=g instanceof Error?g.message:String(g);g instanceof K.HtlcOutputMismatchError?E.length<Z&&E.push(`[${f}] ${k}`):(U++,S.length<Z&&S.push(`${f} (${k})`))}const me=a.length+U,q=[...a.map(pe),...S];if(l.length===0)throw new le(i.length,E,q);if(new Set(l.map(m=>m.fingerprint)).size>1)throw new he(l.map(m=>B(m.candidate)));if(me>0)throw new de(B(l[0].candidate),q);return{candidate:l[0].candidate,terms:l[0].terms,peginAmounts:l[0].peginAmounts,authAnchorHash:h.hash,candidatesTried:i.length,matchedCandidates:l.map(m=>m.candidate)}}function De(e,t){const{htlcVout:r,depositorBtcPubkey:n,applicationEntryPoint:o,fundedPrePeginTxHex:u,hashlocks:s,network:i}=t,{candidate:a,peginAmounts:d}=e,{offchainParams:c,participants:h}=a;if(s.length!==d.length)throw new Error(`toRefundInputs: ${s.length} hashlock(s) but ${d.length} reconstructed amount(s); the reconstruction and the hashlock vector describe different transactions.`);if(!Number.isInteger(r)||r<0||r>=d.length)throw new Error(`toRefundInputs: htlcVout ${r} is outside the reconstructed batch of ${d.length} vault(s).`);const b=d.map((y,l)=>({hashlock:p.ensureHexPrefix(s[l]),amount:y,htlcVout:l})),w={vaultCoreVersion:a.vaultCoreVersion,hashlock:b[r].hashlock,htlcVout:r,offchainParamsVersion:c.version,appVaultKeepersVersion:h.appVaultKeepersVersion,universalChallengersVersion:h.universalChallengersVersion,vaultProvider:h.vaultProvider,applicationEntryPoint:o,amount:d[r],unsignedPrePeginTxHex:u,depositorBtcPubkey:n,batch:b},R={vaultProviderPubkey:h.vaultProviderBtcPubkey,vaultKeeperPubkeys:h.vaultKeeperBtcPubkeys,universalChallengerPubkeys:h.universalChallengerBtcPubkeys,timelockRefund:c.timelockRefund,feeRate:c.protocolFeeRate,minPeginFeeRate:c.minPeginFeeRate,numLocalChallengers:h.vaultKeeperBtcPubkeys.length,councilQuorum:c.councilQuorum,councilSize:c.councilSize,network:i};return{vault:w,context:R}}exports.DEPOSIT_TERMS_REJECTED_ERROR_NAME=L;exports.DepositTermsRejectedError=oe;exports.PEGIN_FINGERPRINT_DOMAIN=ae;exports.PEGIN_FINGERPRINT_DOMAIN_PREIMAGE=ie;exports.PeginFingerprintInputError=P;exports.PeginParamsAmbiguousError=he;exports.PeginParamsIncompleteSpaceError=de;exports.PeginParamsNotFoundError=le;exports.PeginSizingIntegrityError=V;exports.UnanchoredPrePeginError=F;exports.VaultRootMismatchError=ue;exports.assertClaimBatchHomogeneous=re;exports.buildPeginParamsCandidates=_e;exports.computeFundedPrePeginFee=se;exports.computePeginFingerprint=Se;exports.deriveHashlocksFromPrePegin=He;exports.describePeginParamsCandidate=B;exports.describeUnresolvedVersion=pe;exports.encodePeginFingerprintPreimage=ce;exports.isDepositTermsRejectedError=Re;exports.isPeginFingerprintInputError=Ie;exports.isWotsMismatchError=Te;exports.orderClaimBatchByHtlcVout=ne;exports.rebuildDepositTermsCore=z;exports.rebuildDepositTermsForClaim=ke;exports.reconstructPeginParams=Oe;exports.selectSiblingRegistrations=te;exports.toRefundInputs=De;
+//# sourceMappingURL=toRefundInputs-BZXvuOMY.cjs.map

package/dist/toRefundInputs-BZXvuOMY.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"toRefundInputs-BZXvuOMY.cjs","sources":["../src/tbv/core/deposit-terms/claimSiblings.ts","../src/tbv/core/deposit-terms/depositTermsErrors.ts","../src/tbv/core/deposit-terms/fundedPrePeginFee.ts","../src/tbv/core/deposit-terms/rebuildDepositTermsCore.ts","../src/tbv/core/deposit-terms/rebuildDepositTermsForClaim.ts","../src/tbv/core/wots/errors.ts","../src/tbv/core/pegin-fingerprint/peginFingerprint.ts","../src/tbv/core/recovery/recoveryErrors.ts","../src/tbv/core/recovery/deriveHashlocksFromPrePegin.ts","../src/tbv/core/recovery/peginParamsCandidates.ts","../src/tbv/core/recovery/reconstructPeginParams.ts","../src/tbv/core/recovery/toRefundInputs.ts"],"sourcesContent":["/**\n * Sibling discovery for the claim-time terms rebuild — pure, fail-closed.\n *\n * A batch deposit registers every sibling in one transaction, so the target's\n * registration block holds them all: the siblings are the block's other\n * registrations by the same depositor whose `unsignedPrePeginTx` is the same\n * transaction. Completeness is backstopped by the core's auth-anchor check.\n *\n * @module deposit-terms/claimSiblings\n */\n\nimport { registrationPrePeginTxHash } from \"../clients/eth/registration-records\";\nimport type { PeginRegistrationRecord, VaultData } from \"../clients/eth/types\";\nimport type { RebuildSibling } from \"./rebuildDepositTermsCore\";\n\n/**\n * One batch member: the chain record plus its registration-log ceiling.\n *\n * @experimental\n */\nexport interface ClaimBatchMember {\n  vault: VaultData;\n  maxAcceptableCommissionBps: number;\n}\n\n/**\n * Fields that must be uniform across the batch: each sibling is stamped by its\n * own `submitPeginRequest`, so governance changes between registrations can\n * stamp them differently — and Gate 1 cannot see fields not encoded in the\n * HTLC outputs (timelocks, commission).\n */\nconst STAMPED_PROTOCOL_FIELDS = [\n  \"vaultCoreVersion\",\n  \"offchainParamsVersion\",\n  \"appVaultKeepersVersion\",\n  \"universalChallengersVersion\",\n] as const;\nconst STAMPED_ADDRESS_FIELDS = [\n  \"applicationEntryPoint\",\n  \"vaultProvider\",\n] as const;\n\n/** @experimental */\nexport function selectSiblingRegistrations(\n  records: readonly PeginRegistrationRecord[],\n  target: PeginRegistrationRecord,\n): PeginRegistrationRecord[] {\n  const depositor = target.depositor.toLowerCase();\n  const prePeginTxHash = registrationPrePeginTxHash(target).toLowerCase();\n  // Depositor first, so only the depositor's own registrations are ever parsed.\n  return records.filter(\n    (r) =>\n      r.vaultId !== target.vaultId &&\n      r.depositor.toLowerCase() === depositor &&\n      registrationPrePeginTxHash(r).toLowerCase() === prePeginTxHash,\n  );\n}\n\n/** @experimental */\nexport function assertClaimBatchHomogeneous(\n  target: ClaimBatchMember,\n  siblings: readonly ClaimBatchMember[],\n): void {\n  for (const sibling of siblings) {\n    for (const field of STAMPED_PROTOCOL_FIELDS) {\n      if (sibling.vault.protocol[field] !== target.vault.protocol[field]) {\n        throw new Error(\n          `Sibling vaults of this Pre-PegIn disagree on ${field} ` +\n            `(${sibling.vault.protocol[field]} vs ${target.vault.protocol[field]}); ` +\n            `the batch cannot be described by one set of deposit terms.`,\n        );\n      }\n    }\n    if (\n      sibling.maxAcceptableCommissionBps !== target.maxAcceptableCommissionBps\n    ) {\n      throw new Error(\n        `Sibling vaults of this Pre-PegIn disagree on maxAcceptableCommissionBps ` +\n          `(${sibling.maxAcceptableCommissionBps} vs ${target.maxAcceptableCommissionBps}); ` +\n          `the batch cannot be described by one set of deposit terms.`,\n      );\n    }\n    for (const field of STAMPED_ADDRESS_FIELDS) {\n      if (\n        sibling.vault.basic[field].toLowerCase() !==\n        target.vault.basic[field].toLowerCase()\n      ) {\n        throw new Error(\n          `Sibling vaults of this Pre-PegIn disagree on ${field} ` +\n            `(${sibling.vault.basic[field]} vs ${target.vault.basic[field]}); ` +\n            `the batch cannot be described by one set of deposit terms.`,\n        );\n      }\n    }\n  }\n}\n\n/**\n * Sort by `htlcVout` and project into the core's sibling shape. htlcVout is\n * derived from array position downstream, so the vector must cover [0, N-1].\n *\n * @experimental\n */\nexport function orderClaimBatchByHtlcVout(\n  members: readonly ClaimBatchMember[],\n): RebuildSibling[] {\n  const ordered = [...members].sort(\n    (a, b) => a.vault.protocol.htlcVout - b.vault.protocol.htlcVout,\n  );\n  ordered.forEach((member, i) => {\n    if (member.vault.protocol.htlcVout !== i) {\n      throw new Error(\n        `Sibling discovery produced a non-contiguous HTLC vector ` +\n          `(${ordered.map((m) => m.vault.protocol.htlcVout).join(\", \")}).`,\n      );\n    }\n  });\n  return ordered.map((m) => ({\n    hashlock: m.vault.protocol.hashlock,\n    amount: m.vault.basic.amount,\n  }));\n}\n","/**\n * Typed rejection contract for deposit-terms approval. Providers cannot import\n * this class (no dependency edge between the packages), so the cross-package\n * contract is the error SHAPE on {@link DepositTermsApprover}. Consumers land\n * with the first provider (#2109) and its app error mapping (#2110).\n *\n * @module deposit-terms/depositTermsErrors\n */\n\n/** The `name` value providers must set on envelope rejections (the wire contract). */\nexport const DEPOSIT_TERMS_REJECTED_ERROR_NAME = \"DepositTermsRejectedError\";\n\n/** Why the terms were rejected before approval. */\nexport type DepositTermsRejectionReason = \"device-envelope\";\n\n/** SDK-owned typed rejection thrown when deposit terms fail pre-approval validation. */\nexport class DepositTermsRejectedError extends Error {\n  readonly reason: DepositTermsRejectionReason;\n\n  constructor(\n    message: string,\n    reason: DepositTermsRejectionReason = \"device-envelope\",\n  ) {\n    super(message);\n    this.name = DEPOSIT_TERMS_REJECTED_ERROR_NAME;\n    this.reason = reason;\n  }\n}\n\n/**\n * Guard for app-side error mapping. Matches `instanceof` OR the documented\n * `name` — providers and foreign realms throw structurally-conforming plain\n * errors that `instanceof` cannot see.\n */\nexport function isDepositTermsRejectedError(\n  err: unknown,\n): err is DepositTermsRejectedError {\n  if (err instanceof DepositTermsRejectedError) return true;\n  if (typeof err !== \"object\" || err === null) return false;\n  const shaped = err as { name?: unknown; reason?: unknown };\n  // The documented provider shape REQUIRES the reason; a name-only match is\n  // a contract violation and propagates unnormalized.\n  return (\n    shaped.name === DEPOSIT_TERMS_REJECTED_ERROR_NAME &&\n    shaped.reason === \"device-envelope\"\n  );\n}\n","/**\n * Fee of a funded Pre-PegIn: Σ prevouts − Σ outputs, prevouts resolved from\n * the mempool API by display-order txid. Becomes the device's\n * `prepegin_max_fee` bound. Mirrors the vault app's\n * `resolveFundedTxFeeAndUtxos`, without the UTXO record the broadcast reuses.\n *\n * @module deposit-terms/fundedPrePeginFee\n */\n\nimport { Transaction } from \"bitcoinjs-lib\";\nimport { Buffer } from \"buffer\";\n\nimport { getUtxoInfo } from \"../clients/mempool\";\nimport { stripHexPrefix } from \"../primitives/utils/bitcoin\";\nimport { MAX_REASONABLE_FEE_SATS } from \"../utils/validation\";\n\n/**\n * @throws When the inputs do not cover the outputs, or the fee exceeds\n *         `MAX_REASONABLE_FEE_SATS` (a manipulated prevout answer).\n * @experimental\n */\nexport async function computeFundedPrePeginFee(\n  fundedPrePeginTxHex: string,\n  mempoolApiUrl: string,\n): Promise<bigint> {\n  const tx = Transaction.fromHex(stripHexPrefix(fundedPrePeginTxHex));\n  const prevouts = await Promise.all(\n    tx.ins.map((input) =>\n      // Bitcoin stores the prev-txid in reverse (internal) byte order.\n      getUtxoInfo(\n        Buffer.from(input.hash).reverse().toString(\"hex\"),\n        input.index,\n        mempoolApiUrl,\n      ),\n    ),\n  );\n  const totalIn = prevouts.reduce((sum, u) => sum + BigInt(u.value), 0n);\n  const totalOut = tx.outs.reduce((sum, o) => sum + BigInt(o.value), 0n);\n  const fee = totalIn - totalOut;\n  if (fee <= 0n) {\n    throw new Error(\n      `The funded Pre-PegIn transaction's inputs do not cover its outputs plus a fee ` +\n        `(computed fee: ${fee} sats).`,\n    );\n  }\n  if (fee > MAX_REASONABLE_FEE_SATS) {\n    throw new Error(\n      `The funded Pre-PegIn transaction's computed fee (${fee} sats) exceeds the maximum ` +\n        `reasonable fee (${MAX_REASONABLE_FEE_SATS} sats); the mempool API may have ` +\n        `returned manipulated prevout data.`,\n    );\n  }\n  return fee;\n}\n","/**\n * Pure core of the resume-broadcast DepositTerms rebuild (#2220 Part 2).\n *\n * Takes plain chain-derived data (the app orchestrator does the chain reads +\n * sibling discovery) and: (1) asserts sibling completeness against the funded\n * tx's auth-anchor OP_RETURN, (2) recomputes the amount-independent sizing\n * (depositorClaimValue, peginMaxFee, anchor) via WASM, (3) byte-matches each\n * HTLC output's value + scriptPubKey against the funded tx (Gate 1), then (4)\n * projects into DepositTerms. No chain access, no browser state — unit-testable.\n *\n * btc-vault is the protocol source of truth (`compute_min_htlc_value`,\n * `derive_challengers_for`).\n */\n\nimport {\n  computeMinClaimValue,\n  computeMinPeginFee,\n  getPrePeginHtlcConnectorInfo,\n  peginP2aAnchorOutput,\n} from \"../wasm\";\nimport { Transaction } from \"bitcoinjs-lib\";\n\nimport { findAuthAnchorOpReturn } from \"../managers/pegin/assertAuthAnchorOpReturn\";\nimport { assertEncodedHtlcOutputsMatch } from \"../primitives/psbt/assertWasmPeginSizing\";\nimport { stripHexPrefix } from \"../primitives/utils/bitcoin\";\nimport { MAX_REASONABLE_PEGIN_VBYTES } from \"../utils/fee/constants\";\nimport { calculateBtcTxHash } from \"../utils/transaction/btcTxHash\";\n\nimport { buildDepositTerms } from \"./buildDepositTerms\";\nimport type { DepositTerms } from \"./depositTerms\";\n\n/** One HTLC in the shared Pre-PegIn tx, ordered by (and contiguous in) htlcVout. */\nexport interface RebuildSibling {\n  /** 32-byte hex hashlock (0x prefix optional), per-vault (feeds the HTLC scriptPubKey). */\n  hashlock: string;\n  /** btc-vault `pegin_amount` for this sibling (satoshis). */\n  amount: bigint;\n}\n\nexport interface RebuildDepositTermsCoreInput {\n  /** Stamped tx-graph version (NOT chain-active). */\n  vaultCoreVersion: number;\n  /** Sibling HTLCs ordered by htlcVout; index === htlcVout (asserted by the app). */\n  siblings: readonly RebuildSibling[];\n  /** Funded Pre-PegIn tx hex. Gate 0 (hash vs prepeginTxid) is SELF-verified below — callers need not pre-verify. */\n  fundedPrePeginTxHex: string;\n\n  // Stamped-version participant data (already resolved + sorted by the app).\n  depositorBtcPubkey: string;\n  vaultProviderBtcPubkey: string;\n  vaultKeeperBtcPubkeys: readonly string[];\n  universalChallengerBtcPubkeys: readonly string[];\n\n  // Version-locked scalars.\n  protocolFeeRate: bigint;\n  minPeginFeeRate: bigint;\n  councilQuorum: number;\n  councilSize: number;\n  timelockPegin: number;\n  timelockAssert: number;\n  timelockRefund: number;\n\n  // Pass-through into DepositTerms.\n  prepeginTxid: string;\n  /** Funded-tx fee (Σin − Σout), computed by the app; the device's `prepegin_max_fee` bound. */\n  prepeginMaxFee: bigint;\n  maxAcceptableCommissionBps: number;\n\n  /** WASM network descriptor for scriptPubKey derivation. */\n  network: Parameters<typeof getPrePeginHtlcConnectorInfo>[0][\"network\"];\n}\n\nexport async function rebuildDepositTermsCore(\n  input: RebuildDepositTermsCoreInput,\n): Promise<DepositTerms> {\n  const siblingCount = input.siblings.length;\n  if (siblingCount === 0) {\n    throw new Error(\n      \"rebuildDepositTermsCore: at least one sibling is required\",\n    );\n  }\n  for (const [i, sibling] of input.siblings.entries()) {\n    if (sibling.amount <= 0n) {\n      throw new Error(\n        `rebuildDepositTermsCore: sibling[${i}] has non-positive on-chain pegin ` +\n          `amount ${sibling.amount}; the chain-read vault record is invalid. Resume refused.`,\n      );\n    }\n  }\n  if (input.prepeginMaxFee <= 0n) {\n    throw new Error(\n      `rebuildDepositTermsCore: prepeginMaxFee must be > 0, got ${input.prepeginMaxFee}`,\n    );\n  }\n\n  // Gate 0, self-verified: everything below trusts these bytes, and a\n  // substituted tx replicating the HTLC outputs would pass Gate 1 with a\n  // different fee/txid.\n  const expectedTxid = stripHexPrefix(input.prepeginTxid).toLowerCase();\n  const actualTxid = stripHexPrefix(\n    calculateBtcTxHash(input.fundedPrePeginTxHex),\n  ).toLowerCase();\n  if (actualTxid !== expectedTxid) {\n    throw new Error(\n      `Funded Pre-PegIn tx hashes to ${actualTxid}, expected ${expectedTxid} ` +\n        `(on-chain prepeginTxid). Resume refused.`,\n    );\n  }\n\n  // Completeness anchor: the single auth-anchor OP_RETURN sits at vout === HTLC\n  // count — the only guard against an indexer-lagged partial sibling set.\n  const found = findAuthAnchorOpReturn(\n    stripHexPrefix(input.fundedPrePeginTxHex),\n  );\n  if (found === undefined) {\n    throw new Error(\n      `Funded Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN ` +\n        `commitment — it either predates auth anchoring or is malformed. The ` +\n        `intent resume path requires the anchor to prove sibling completeness. ` +\n        `Resume refused.`,\n    );\n  }\n  if (found.vout !== siblingCount) {\n    throw new Error(\n      `Auth-anchor OP_RETURN at vout ${found.vout} does not match the ` +\n        `discovered sibling count ${siblingCount}; the discovered sibling set ` +\n        `does not cover this transaction's HTLC outputs (a lagging index can ` +\n        `cause this — retry later). Resume refused.`,\n    );\n  }\n\n  // Amount-independent sizing. Depositor-as-claimer: numLocalChallengers ===\n  // numVks (VP excluded) — btc-vault graph.rs derive_challengers_for.\n  const numVks = input.vaultKeeperBtcPubkeys.length;\n  const numUcs = input.universalChallengerBtcPubkeys.length;\n  const depositorClaimValue = await computeMinClaimValue(\n    input.vaultCoreVersion,\n    numVks,\n    numUcs,\n    input.councilQuorum,\n    input.councilSize,\n    input.protocolFeeRate,\n  );\n  const peginMaxFee = await computeMinPeginFee(\n    input.vaultCoreVersion,\n    numVks,\n    numUcs,\n    input.minPeginFeeRate,\n  );\n  const anchor = await peginP2aAnchorOutput(input.vaultCoreVersion);\n  const anchorValue = anchor?.value ?? 0n;\n\n  // Independent bounds on the WASM outputs (mirrors assertWasmPeginSizing):\n  // Gate 1 only proves the DCV+fee+anchor SUM — these constrain the\n  // decomposition the device is shown.\n  if (depositorClaimValue <= 0n) {\n    throw new Error(\n      `WASM returned non-positive depositorClaimValue ${depositorClaimValue}; ` +\n        `expected > 0. Resume refused.`,\n    );\n  }\n  if (peginMaxFee <= 0n) {\n    throw new Error(\n      `WASM returned non-positive peginMaxFee ${peginMaxFee}; expected > 0. ` +\n        `Resume refused.`,\n    );\n  }\n  // Explicit anchor check: the sum bound alone would let a negative anchor\n  // offset an inflated peginMaxFee (kept local, not inherited from the facade).\n  if (anchorValue < 0n) {\n    throw new Error(\n      `WASM returned negative P2A anchor value ${anchorValue}. Resume refused.`,\n    );\n  }\n  const impliedReserve = peginMaxFee + anchorValue;\n  const maxImpliedReserve = input.minPeginFeeRate * MAX_REASONABLE_PEGIN_VBYTES;\n  if (impliedReserve <= 0n || impliedReserve > maxImpliedReserve) {\n    throw new Error(\n      `WASM implied PegIn reserve ${impliedReserve} sat is outside ` +\n        `(0, ${maxImpliedReserve}] (minPeginFeeRate=${input.minPeginFeeRate} × ` +\n        `${MAX_REASONABLE_PEGIN_VBYTES} vbytes). Resume refused.`,\n    );\n  }\n\n  // Gate 1: per sibling, value = amount + DCV + peginMaxFee + anchor (btc-vault\n  // compute_min_htlc_value) + scriptPubKey from the on-chain hashlock,\n  // byte-matched against outputs 0..N-1.\n  const expectedHtlcValues = input.siblings.map(\n    (s) => s.amount + depositorClaimValue + peginMaxFee + anchorValue,\n  );\n  const expectedHtlcScriptPubKeys = await Promise.all(\n    input.siblings.map(async (s) => {\n      const connector = await getPrePeginHtlcConnectorInfo({\n        txGraphVersion: input.vaultCoreVersion,\n        depositorPubkey: input.depositorBtcPubkey,\n        vaultProviderPubkey: input.vaultProviderBtcPubkey,\n        vaultKeeperPubkeys: [...input.vaultKeeperBtcPubkeys],\n        universalChallengerPubkeys: [...input.universalChallengerBtcPubkeys],\n        hashlock: stripHexPrefix(s.hashlock),\n        timelockRefund: input.timelockRefund,\n        network: input.network,\n      });\n      return connector.scriptPubKey;\n    }),\n  );\n  const fundedOutputs = Transaction.fromHex(\n    stripHexPrefix(input.fundedPrePeginTxHex),\n  ).outs.map((o) => ({ value: o.value, script: o.script }));\n  assertEncodedHtlcOutputsMatch(\n    fundedOutputs,\n    expectedHtlcValues,\n    expectedHtlcScriptPubKeys,\n  );\n\n  return buildDepositTerms({\n    vaultCoreVersion: input.vaultCoreVersion,\n    protocolFeeRate: input.protocolFeeRate,\n    timelockPegin: input.timelockPegin,\n    timelockAssert: input.timelockAssert,\n    timelockRefund: input.timelockRefund,\n    prepeginTxid: input.prepeginTxid,\n    prepeginMaxFee: input.prepeginMaxFee,\n    vaultProviderBtcPubkey: input.vaultProviderBtcPubkey,\n    vaultKeeperBtcPubkeys: input.vaultKeeperBtcPubkeys,\n    universalChallengerBtcPubkeys: input.universalChallengerBtcPubkeys,\n    maxAcceptableCommissionBps: input.maxAcceptableCommissionBps,\n    peginAmounts: input.siblings.map((s) => s.amount),\n    depositorClaimValue,\n    peginMaxFee,\n  });\n}\n","/**\n * Rebuild a {@link DepositTerms} at claim time, from chain and mempool only.\n *\n * The delegated claim can run months after the deposit, with no in-memory\n * terms and possibly no vault provider. An approval wallet still has to load\n * this vault's intent to sign the Assert and the depositor Payout, and the\n * device recomputes the PegIn txid from the intent, so every value here must\n * be the one the deposit was built with: the stamped versions and rosters,\n * the ceiling from the registration log, the siblings from the same log, the\n * funded fee from the transaction the chain saw.\n *\n * Takes the `readDelegatedClaimVaultContext` read rather than a vault id: that\n * read already fetched the vault record, the registration block, the\n * participant keys and the stamped params, and on a public RPC every repeat is\n * another chance of a spurious empty answer. Only the siblings still need a\n * reader.\n *\n * No lifecycle gate: the vault app's resume rebuild refuses non-PENDING\n * vaults and closed ack windows because it is about to finish a deposit; a\n * claimable vault is REDEEMED and long past both. The homogeneity and\n * contiguity checks are kept.\n *\n * @module deposit-terms/rebuildDepositTermsForClaim\n */\n\nimport { registrationPrePeginTxHash } from \"../clients/eth/registration-records\";\nimport type { VaultRegistryReader } from \"../clients/eth/types\";\nimport {\n  canonicalizeBtcPubkey,\n  stripHexPrefix,\n} from \"../primitives/utils/bitcoin\";\nimport type { DelegatedClaimVaultRead } from \"../services/delegated-claim/readDelegatedClaimVaultContext\";\nimport { calculateBtcTxHash } from \"../utils/transaction/btcTxHash\";\nimport {\n  assertClaimBatchHomogeneous,\n  orderClaimBatchByHtlcVout,\n  selectSiblingRegistrations,\n  type ClaimBatchMember,\n} from \"./claimSiblings\";\nimport type { DepositTerms } from \"./depositTerms\";\nimport { computeFundedPrePeginFee } from \"./fundedPrePeginFee\";\nimport {\n  rebuildDepositTermsCore,\n  type RebuildDepositTermsCoreInput,\n} from \"./rebuildDepositTermsCore\";\n\n/** @experimental */\nexport interface RebuildDepositTermsForClaimParams {\n  /** The vault read this rebuild reuses instead of re-reading the chain. */\n  read: DelegatedClaimVaultRead;\n  /**\n   * The connected wallet's own key (compressed or x-only): refused unless it\n   * is the vault's depositor. Passing the on-chain key here makes that check\n   * vacuous.\n   */\n  depositorBtcPubkey: string;\n  /**\n   * Funded Pre-PegIn hex, e.g. `getTxHex(prepeginTxid, mempoolApiUrl)`.\n   * Hash-checked against the vault's `prePeginTxHash` here before any mempool\n   * lookup, and again by the core (Gate 0).\n   */\n  fundedPrePeginTxHex: string;\n  /** Reads the sibling vaults of the batch; the target is already in `read`. */\n  siblingReader: Pick<VaultRegistryReader, \"getVaultData\">;\n  /** Mempool API base URL, for the prevouts the fee is computed from. */\n  mempoolApiUrl: string;\n  network: RebuildDepositTermsCoreInput[\"network\"];\n}\n\n/**\n * @throws When the wallet key is not the depositor's, the hex is not the\n *         vault's Pre-PegIn, a sibling is registered against a different\n *         Pre-PegIn than its log records, the siblings disagree on a stamped\n *         field or are non-contiguous, the fee is out of bounds, or the core\n *         refuses (see `rebuildDepositTermsCore`).\n *         A sibling registered in another block is missing from this read and\n *         surfaces as the core's auth-anchor refusal, whose message suggests a\n *         lagging index and a retry: on this path there is no index, and a\n *         retry cannot help — that sibling must be registered in the same block.\n * @experimental\n */\nexport async function rebuildDepositTermsForClaim(\n  params: RebuildDepositTermsForClaimParams,\n): Promise<DepositTerms> {\n  const { read } = params;\n  const connectedDepositor = canonicalizeBtcPubkey(params.depositorBtcPubkey);\n  if (connectedDepositor !== read.context.depositorBtcPubkey) {\n    throw new Error(\n      `Connected wallet key is not the vault's depositor key; select the account ` +\n        `that made the deposit.`,\n    );\n  }\n\n  const prepeginTxid = stripHexPrefix(read.prePeginTxHash).toLowerCase();\n  const actualTxid = stripHexPrefix(\n    calculateBtcTxHash(params.fundedPrePeginTxHex),\n  ).toLowerCase();\n  if (actualTxid !== prepeginTxid) {\n    throw new Error(\n      `Funded Pre-PegIn tx hashes to ${actualTxid}, expected ${prepeginTxid} (on-chain prePeginTxHash).`,\n    );\n  }\n\n  const siblingMembers: ClaimBatchMember[] = await Promise.all(\n    selectSiblingRegistrations(\n      read.registrationRecords,\n      read.registrationRecord,\n    ).map(async (record) => {\n      const vault = await params.siblingReader.getVaultData(record.vaultId);\n      if (\n        vault.protocol.prePeginTxHash.toLowerCase() !==\n        registrationPrePeginTxHash(record).toLowerCase()\n      ) {\n        throw new Error(\n          `Sibling ${record.vaultId} is registered against a different Pre-PegIn on chain ` +\n            `than its registration log records; refusing an inconsistent node.`,\n        );\n      }\n      return {\n        vault,\n        maxAcceptableCommissionBps: record.maxAcceptableCommissionBps,\n      };\n    }),\n  );\n  const targetMember: ClaimBatchMember = {\n    vault: read.vault,\n    maxAcceptableCommissionBps:\n      read.registrationRecord.maxAcceptableCommissionBps,\n  };\n  assertClaimBatchHomogeneous(targetMember, siblingMembers);\n  const siblings = orderClaimBatchByHtlcVout([targetMember, ...siblingMembers]);\n\n  const prepeginMaxFee = await computeFundedPrePeginFee(\n    params.fundedPrePeginTxHex,\n    params.mempoolApiUrl,\n  );\n\n  return rebuildDepositTermsCore({\n    vaultCoreVersion: read.vault.protocol.vaultCoreVersion,\n    siblings,\n    fundedPrePeginTxHex: params.fundedPrePeginTxHex,\n    depositorBtcPubkey: connectedDepositor,\n    vaultProviderBtcPubkey:\n      read.participantKeys.vaultProvider.operationBtcPubkey,\n    vaultKeeperBtcPubkeys: read.participantKeys.vaultKeeperOperationKeysSorted,\n    universalChallengerBtcPubkeys:\n      read.participantKeys.universalChallengerOperationKeysSorted,\n    protocolFeeRate: read.offchainParams.feeRate,\n    minPeginFeeRate: read.offchainParams.minPeginFeeRate,\n    councilQuorum: read.offchainParams.councilQuorum,\n    councilSize: read.offchainParams.securityCouncilKeys.length,\n    timelockPegin: read.context.timelockPegin,\n    timelockAssert: read.context.timelockAssert,\n    timelockRefund: read.offchainParams.tRefund,\n    prepeginTxid,\n    prepeginMaxFee,\n    // The submitted ceiling, verbatim: the device must see the terms the\n    // depositor originally approved.\n    maxAcceptableCommissionBps:\n      read.registrationRecord.maxAcceptableCommissionBps,\n    network: params.network,\n  });\n}\n","/**\n * Check whether an error from the vault provider indicates that the\n * submitted WOTS public key hash does not match the on-chain\n * commitment. This signals that the wrong wallet is connected (its\n * `deriveContextHash` produces a different vault root and therefore\n * different WOTS keys).\n */\nexport function isWotsMismatchError(error: unknown): boolean {\n  const msg = (\n    error instanceof Error\n      ? error.message\n      : typeof error === \"string\"\n        ? error\n        : \"\"\n  ).toLowerCase();\n\n  return (\n    msg.includes(\"wots\") &&\n    msg.includes(\"hash\") &&\n    msg.includes(\"does not match\")\n  );\n}\n","/**\n * Canonical peg-in configuration fingerprint: the commitment a depositor sends\n * with a peg-in registration so the registry can prove, at inclusion, that the\n * protocol state it is about to bond the vault to is the state the Bitcoin lock\n * was actually built from.\n *\n * ## Why it exists\n *\n * Seven values are resolved live when a peg-in request is included, and every\n * one of them changes the bytes a depositor must have built: the vault\n * provider's operation-BTC key, the vault-keeper and universal-challenger key\n * epochs, the two roster versions (which members are in the HTLC all-party leaf\n * at all), the off-chain params version (`tRefund` in the refund leaf,\n * `minPeginFeeRate` in the output value) and the vault core version (the PegIn\n * output count, so the P2A anchor term in the value). A rotation, roster change\n * or version bump landing between the depositor's build and inclusion would\n * bond the vault to bytes the funded HTLC does not commit to. The registry\n * recomputes this fingerprint and reverts with `PeginFingerprintChanged` rather\n * than accepting such a request.\n *\n * ## Reproducing the contract exactly\n *\n * The encoding is `abi.encode`, never `abi.encodePacked` — the two produce\n * completely different bytes. Under `abi.encode` every field here is static and\n * occupies one left-padded 32-byte word, so the declared integer *width* never\n * reaches the output: encoding the tuple with all-`uint256` slots yields a\n * byte-identical hash. Only the field ORDER, the field COUNT, and whether a\n * type is static or dynamic can change the result. The widths in\n * {@link PeginFingerprintInput} therefore document the contract's own\n * declarations and bound the accepted inputs; they are not what makes the bytes\n * come out right.\n *\n * Mirrors `_peginFingerprint` in `src/protocol/lib/PeginLogic.sol` of\n * `babylonlabs-io/vault-contracts-aave-v4`. Pinned byte-for-byte against that\n * repository's committed vectors — see\n * `__tests__/peginFingerprint.golden.test.ts`.\n *\n * @module pegin-fingerprint/peginFingerprint\n */\n\nimport {\n  encodeAbiParameters,\n  isAddress,\n  keccak256,\n  toHex,\n  zeroAddress,\n  type Address,\n  type Hex,\n} from \"viem\";\n\n/**\n * Domain-separation string hashed into every fingerprint, so the commitment\n * cannot be replayed as a different one. Matches the contract's\n * `PEGIN_FINGERPRINT_DOMAIN` preimage.\n */\nexport const PEGIN_FINGERPRINT_DOMAIN_PREIMAGE = \"TBV.PeginFingerprint.v1\";\n\n/**\n * `keccak256(\"TBV.PeginFingerprint.v1\")`, the first word of the encoded\n * preimage.\n *\n * Derived from {@link PEGIN_FINGERPRINT_DOMAIN_PREIMAGE} rather than pasted as\n * a hex literal, so the string that defines it stays visible. The golden test\n * pins the derived value against the constant the contract's vector file\n * publishes, so a change to either side is still caught.\n */\nexport const PEGIN_FINGERPRINT_DOMAIN: Hex = keccak256(\n  toHex(PEGIN_FINGERPRINT_DOMAIN_PREIMAGE),\n);\n\n/** Inclusive upper bound of Solidity `uint16`, the width of all four versions. */\nconst UINT16_MAX = 65_535;\n/** Inclusive upper bound of Solidity `uint64`, the width of both key epochs. */\nconst UINT64_MAX = 2n ** 64n - 1n;\n/** Inclusive upper bound of Solidity `uint256`, the width of `block.chainid`. */\nconst UINT256_MAX = 2n ** 256n - 1n;\n/** A `bytes32` value as viem accepts it: `0x` followed by 64 hex digits. */\nconst BYTES32_PATTERN = /^0x[0-9a-fA-F]{64}$/;\n/**\n * Lowest `vaultCoreVersion` any live contract reports: the setter on\n * `ProtocolParams` rejects 0, so a 0 can only be a mis-decoded read.\n *\n * Mirrors the bound `assertValidVaultCoreVersion` applies in\n * `primitives/vaultCoreVersion.ts`; the two must move together. That function\n * is not called here because it throws a bare `Error`, which would put a second\n * error type into a module whose whole validation surface is\n * {@link PeginFingerprintInputError}.\n */\nconst VAULT_CORE_VERSION_MIN = 1;\n\n/**\n * Protocol state a Pre-PegIn transaction commits to, one field per encoded\n * word.\n *\n * Declared in encoding order so the interface reads as the specification does.\n * Reordering these fields does not change the output — the encoder names each\n * one explicitly — but keeping them aligned makes a divergence from the\n * contract visible on sight.\n */\nexport interface PeginFingerprintInput {\n  /** `block.chainid` of the chain the registry is deployed on. */\n  chainId: bigint;\n  /**\n   * The `BTCVaultRegistry` address, which the contract encodes as\n   * `address(this)`. EIP-55 checksum casing is irrelevant to the encoded word\n   * and is not required here; see {@link encodePeginFingerprintPreimage}.\n   */\n  registryAddress: Address;\n  /**\n   * The vault provider's RESOLVED operation-BTC key, 32 bytes, `0x`-prefixed.\n   *\n   * The resolved key, not an epoch counter: the VP epoch is one registry-wide\n   * counter that ANY provider's key or payout append bumps, so committing to it\n   * would let any registered provider invalidate every in-flight Pre-PegIn\n   * protocol-wide. Only the chosen provider's key reaches the HTLC leaf, so\n   * that is what is committed.\n   *\n   * Note the SDK resolves this key as an x-only pubkey WITHOUT a `0x` prefix\n   * (`OnChainBtcPubkey`); callers add the prefix.\n   */\n  vaultProviderBtcKey: Hex;\n  /** Vault-keeper operation-key epoch for this application (`uint64`). */\n  appKeeperKeyEpoch: bigint;\n  /** Universal-challenger operation-key epoch (`uint64`). */\n  ucKeyEpoch: bigint;\n  /** Roster version selecting which vault keepers are in the leaf (`uint16`). */\n  appVaultKeepersVersion: number;\n  /** Roster version selecting which universal challengers are in the leaf (`uint16`). */\n  universalChallengersVersion: number;\n  /** Off-chain params version: `tRefund` and `minPeginFeeRate` (`uint16`). */\n  offchainParamsVersion: number;\n  /** Vault core (tx-graph) version: the PegIn output count (`uint16`). */\n  vaultCoreVersion: number;\n}\n\n/** An input field is missing, malformed, or outside the width the contract declares for it. */\nexport class PeginFingerprintInputError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"PeginFingerprintInputError\";\n  }\n}\n\n/**\n * Recognise the error above, including across a module boundary.\n *\n * Every message it carries names an internal field and the width it broke, so a\n * consumer needs to be able to catch it and substitute its own copy rather than\n * show the depositor what went wrong internally. `instanceof` alone fails\n * across duplicate module copies and test mocks, so the name is the fallback —\n * the same pattern the deposit-path drift guards use.\n */\nexport function isPeginFingerprintInputError(\n  err: unknown,\n): err is PeginFingerprintInputError {\n  return (\n    err instanceof PeginFingerprintInputError ||\n    (err instanceof Error && err.name === \"PeginFingerprintInputError\")\n  );\n}\n\n/**\n * The type is checked before the range, and deliberately so.\n *\n * A purely relational guard (`value < 0n || value > max`) is not a guard at\n * all for a non-bigint: every comparison against `undefined`, `null` and `NaN`\n * evaluates `false`, so all three slip through, and `\"7\"` and `true` slip\n * through AND then encode — as 7 and as 1 — producing a well-formed\n * fingerprint from a value nobody supplied. TypeScript does not close this;\n * a JS consumer, a snapshot object missing a key, or an unawaited read all\n * reach here.\n */\nfunction assertUnsignedRange(\n  field: string,\n  value: bigint,\n  max: bigint,\n  solidityType: string,\n): void {\n  if (typeof value !== \"bigint\") {\n    throw new PeginFingerprintInputError(\n      `${field} must be a bigint (Solidity ${solidityType}), got ${typeof value}`,\n    );\n  }\n  if (value < 0n || value > max) {\n    throw new PeginFingerprintInputError(\n      `${field} must fit Solidity ${solidityType} (0..${max}), got ${value}`,\n    );\n  }\n}\n\nfunction assertUint16(field: string, value: number): void {\n  if (!Number.isInteger(value) || value < 0 || value > UINT16_MAX) {\n    throw new PeginFingerprintInputError(\n      `${field} must be an integer fitting Solidity uint16 (0..${UINT16_MAX}), got ${value}`,\n    );\n  }\n}\n\n/**\n * Validate a `bytes32` field and return it lowercased.\n *\n * viem echoes the caller's hex casing straight into the encoded output, so an\n * upper-case key would yield a correct fingerprint (keccak hashes bytes, not\n * text) beside a preimage that no longer compares equal to the contract's.\n * That would defeat the one job {@link encodePeginFingerprintPreimage} has.\n */\nfunction normalizeBytes32(field: string, value: Hex): Hex {\n  if (!BYTES32_PATTERN.test(value)) {\n    throw new PeginFingerprintInputError(\n      `${field} must be 32 bytes as 0x-prefixed hex (66 characters), got \"${value}\"`,\n    );\n  }\n  return value.toLowerCase() as Hex;\n}\n\n/**\n * Validate the registry address and return it in the form the ABI word encodes.\n *\n * EIP-55 mixed-case is a display checksum over the same 20 bytes, and Solidity\n * never sees it. viem does: `encodeAbiParameters` rejects a mixed-case address\n * whose checksum does not verify, which would make legitimate inputs — the\n * contract's own `maximum_field_values` vector among them — fail to encode. So\n * the checksum is not enforced and the value is lowercased before encoding.\n *\n * This is normalisation, not a fallback: an address that is not 20 bytes of hex\n * is still rejected, loudly, before anything is encoded, as is the zero address\n * (the shape an unresolved contract-address read takes).\n */\nfunction normalizeRegistryAddress(registryAddress: Address): Address {\n  if (!isAddress(registryAddress, { strict: false })) {\n    throw new PeginFingerprintInputError(\n      `registryAddress must be a 20-byte 0x-prefixed address, got \"${registryAddress}\"`,\n    );\n  }\n  const normalized = registryAddress.toLowerCase() as Address;\n  if (normalized === zeroAddress) {\n    throw new PeginFingerprintInputError(\n      \"registryAddress must not be the zero address; a zero here means the registry address was never resolved\",\n    );\n  }\n  return normalized;\n}\n\n/**\n * The encoded tuple, as one list so the ordering lives in exactly one place.\n *\n * Not re-exported from the module barrel — this is internal, and exists in\n * this shape so the golden test can render it back into the type string the\n * contract's vector file publishes and compare the two. That comparison is a\n * second, independent check on the field order, one that does not depend on\n * the sample values in the vectors.\n */\nexport const PEGIN_FINGERPRINT_ABI_PARAMETERS = [\n  { name: \"domain\", type: \"bytes32\" },\n  { name: \"chainId\", type: \"uint256\" },\n  { name: \"registry\", type: \"address\" },\n  { name: \"vaultProviderBtcKey\", type: \"bytes32\" },\n  { name: \"appKeeperKeyEpoch\", type: \"uint64\" },\n  { name: \"ucKeyEpoch\", type: \"uint64\" },\n  { name: \"appVaultKeepersVersion\", type: \"uint16\" },\n  { name: \"universalChallengersVersion\", type: \"uint16\" },\n  { name: \"offchainParamsVersion\", type: \"uint16\" },\n  { name: \"vaultCoreVersion\", type: \"uint16\" },\n] as const;\n\n/**\n * The `abi.encode` preimage the contract hashes — ten 32-byte words, 320 bytes.\n *\n * Exposed alongside {@link computePeginFingerprint} because a fingerprint\n * mismatch is otherwise two opaque hashes: comparing preimages word by word\n * localises the disagreement to a field. The contract's vector file ships the\n * same preimage next to each hash for exactly that reason.\n *\n * Three fields are held to a tighter bound than the contract's own width — a\n * zero `chainId`, a zero `registryAddress`, and a `vaultCoreVersion` below 1 —\n * because for each of them a zero is unreachable on-chain and so can only mean\n * a read that failed or was mis-decoded. No chain has id 0, no registry lives\n * at the zero address, and\n * `activeVaultCoreVersion()` is documented `uint16 >= 1` with a setter that\n * rejects 0. Encoding any of them would produce a well-formed fingerprint that\n * cannot ever match, turning a local mistake into an opaque on-chain revert.\n *\n * The three roster and params versions are NOT tightened: 0 is a legitimate\n * value on those axes.\n *\n * @throws {PeginFingerprintInputError} If any field is missing, malformed, or\n *   outside the accepted range, naming the field and what was expected.\n */\nexport function encodePeginFingerprintPreimage(\n  input: PeginFingerprintInput,\n): Hex {\n  assertUnsignedRange(\"chainId\", input.chainId, UINT256_MAX, \"uint256\");\n  if (input.chainId === 0n) {\n    throw new PeginFingerprintInputError(\n      \"chainId must not be 0; a zero here means the chain id was never resolved\",\n    );\n  }\n  const registry = normalizeRegistryAddress(input.registryAddress);\n  const vaultProviderBtcKey = normalizeBytes32(\n    \"vaultProviderBtcKey\",\n    input.vaultProviderBtcKey,\n  );\n  assertUnsignedRange(\n    \"appKeeperKeyEpoch\",\n    input.appKeeperKeyEpoch,\n    UINT64_MAX,\n    \"uint64\",\n  );\n  assertUnsignedRange(\"ucKeyEpoch\", input.ucKeyEpoch, UINT64_MAX, \"uint64\");\n  assertUint16(\"appVaultKeepersVersion\", input.appVaultKeepersVersion);\n  assertUint16(\n    \"universalChallengersVersion\",\n    input.universalChallengersVersion,\n  );\n  assertUint16(\"offchainParamsVersion\", input.offchainParamsVersion);\n  assertUint16(\"vaultCoreVersion\", input.vaultCoreVersion);\n  if (input.vaultCoreVersion < VAULT_CORE_VERSION_MIN) {\n    throw new PeginFingerprintInputError(\n      `vaultCoreVersion must be at least ${VAULT_CORE_VERSION_MIN}; ` +\n        `${input.vaultCoreVersion} means the version was never resolved`,\n    );\n  }\n\n  // Field order is the whole specification. The parameter list, this value\n  // list, and the contract's `abi.encode(...)` call move together.\n  return encodeAbiParameters(PEGIN_FINGERPRINT_ABI_PARAMETERS, [\n    PEGIN_FINGERPRINT_DOMAIN,\n    input.chainId,\n    registry,\n    vaultProviderBtcKey,\n    input.appKeeperKeyEpoch,\n    input.ucKeyEpoch,\n    input.appVaultKeepersVersion,\n    input.universalChallengersVersion,\n    input.offchainParamsVersion,\n    input.vaultCoreVersion,\n  ]);\n}\n\n/**\n * The fingerprint to send as `expectedFingerprint` on a peg-in registration.\n *\n * Must equal what the registry recomputes at inclusion, byte for byte — the\n * comparison is exact equality, never \"no older than\", because resolving at a\n * superseded epoch would bond a new vault to a retired key.\n *\n * @throws {PeginFingerprintInputError} If any field is outside the width the\n *   contract declares for it.\n */\nexport function computePeginFingerprint(input: PeginFingerprintInput): Hex {\n  return keccak256(encodePeginFingerprintPreimage(input));\n}\n","/**\n * Typed failures for Pre-PegIn parameter recovery (#2203).\n *\n * Split by who can act on them. A root mismatch is user-fixable — wrong\n * wallet, wrong account or wrong network — and must be distinguishable from\n * a search that found nothing, which is ours. Without the split both look\n * identical to the caller.\n *\n * @module recovery/recoveryErrors\n */\n\n/**\n * The re-derived vault root does not match the funded Pre-PegIn's auth-anchor\n * OP_RETURN commitment.\n *\n * The root is bound to the wallet seed, the derivation account AND the\n * network (the wallet's `deriveContextHash` folds the connected pubkey and the\n * canonical network name into the HKDF `info`), so all three must match the\n * ones that created the deposit.\n */\nexport class VaultRootMismatchError extends Error {\n  constructor(\n    readonly derivedAuthAnchorHash: string,\n    readonly onChainAuthAnchorHash: string,\n  ) {\n    super(\n      `Re-derived vault root does not match this Pre-PegIn: derived ` +\n        `auth-anchor hash ${derivedAuthAnchorHash}, transaction commits to ` +\n        `${onChainAuthAnchorHash}. Connect the same wallet, on the same ` +\n        `account and the same network, that created the deposit.`,\n    );\n    this.name = \"VaultRootMismatchError\";\n  }\n}\n\n/**\n * The Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN.\n *\n * The anchor sits at `vout === htlcCount`, and it is the only structural\n * signal for how many HTLC outputs the transaction funds. Without it the\n * vault count would have to be guessed, so recovery refuses rather than\n * deriving the wrong number of hashlocks.\n */\nexport class UnanchoredPrePeginError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"UnanchoredPrePeginError\";\n  }\n}\n\n/**\n * No candidate parameter set reproduces the funded Pre-PegIn's HTLC outputs.\n *\n * Either the true parameters are outside the enumerated space — an operator\n * roster that rotated more than once has no chain-reachable historical read —\n * or the transaction is not one of ours.\n */\nexport class PeginParamsNotFoundError extends Error {\n  constructor(\n    readonly candidatesTried: number,\n    /** A bounded sample of per-candidate rejection reasons, for diagnosis. */\n    readonly sampleRejections: readonly string[],\n    /** Versions that could not be read, the likeliest reason for no match. */\n    readonly unresolvedLabels: readonly string[] = [],\n  ) {\n    super(\n      `No candidate parameter set reproduces this Pre-PegIn's HTLC outputs ` +\n        `(${candidatesTried} candidate(s) tried). ` +\n        (unresolvedLabels.length > 0\n          ? `${unresolvedLabels.length} version(s) could not be resolved and ` +\n            `may hold the answer: ${unresolvedLabels.join(\" | \")}. `\n          : \"\") +\n        `Sample rejections: ${sampleRejections.join(\" | \")}`,\n    );\n    this.name = \"PeginParamsNotFoundError\";\n  }\n}\n\n/**\n * More than one candidate reproduces the funded Pre-PegIn. Fail closed.\n *\n * Every survivor byte-matched the SAME funded outputs, so they agree on each\n * HTLC scriptPubKey and on the total value of each output, and would produce\n * the same refund transaction. What they disagree on is the SPLIT of that\n * value into `peginAmount` and reserve, and the version stamps that determine\n * it — neither of which the transaction carries any evidence of.\n */\nexport class PeginParamsAmbiguousError extends Error {\n  constructor(readonly survivorLabels: readonly string[]) {\n    super(\n      `${survivorLabels.length} candidate parameter sets reproduce this ` +\n        `Pre-PegIn's HTLC outputs, so the vault's stamped versions cannot be ` +\n        `determined: ${survivorLabels.join(\" | \")}. Reconstruction refused.`,\n    );\n    this.name = \"PeginParamsAmbiguousError\";\n  }\n}\n\n/**\n * Exactly one candidate matched, but the candidate space was known to be\n * incomplete. Fail closed.\n *\n * Uniqueness only detects a wrong answer when the right answer is ALSO in the\n * space. If the true version could not be read, a different version sharing\n * the same `timelockRefund` and participants matches the transaction just as\n * well — the search subtracts that candidate's reserve and the verifier adds\n * the same reserve back, so it survives — and the sole survivor would be\n * returned with the wrong version stamps and the wrong `peginAmount` split.\n *\n * Resolve the versions below and search again rather than trusting the match.\n */\nexport class PeginParamsIncompleteSpaceError extends Error {\n  constructor(\n    readonly matchedLabel: string,\n    readonly unresolvedLabels: readonly string[],\n  ) {\n    super(\n      `A candidate matched this Pre-PegIn (${matchedLabel}), but ` +\n        `${unresolvedLabels.length} version(s) could not be resolved, so the ` +\n        `search space did not provably contain the true parameters: ` +\n        `${unresolvedLabels.join(\" | \")}. A version sharing the matched ` +\n        `timelockRefund and participants is indistinguishable from the true ` +\n        `one, so the match cannot be trusted. Reconstruction refused.`,\n    );\n    this.name = \"PeginParamsIncompleteSpaceError\";\n  }\n}\n\n/**\n * A WASM sizing call returned a value no valid parameter set can produce.\n *\n * Raised before the value is consumed, and deliberately NOT treated as a\n * candidate rejection: it indicts the binary rather than the candidate, so it\n * escapes the search instead of being counted as one more parameter set that\n * did not match.\n */\nexport class PeginSizingIntegrityError extends Error {\n  constructor(message: string) {\n    super(`${message}. Reconstruction refused.`);\n    this.name = \"PeginSizingIntegrityError\";\n  }\n}\n","/**\n * Re-derive a stranded deposit's per-vault hashlocks from the wallet and the\n * funded Pre-PegIn transaction alone (#2203).\n *\n * An Ethereum reorg that drops the registration takes the vault row with it,\n * so the depositor pubkey, the HTLC vout and the hashlocks are gone. All three\n * are recoverable without a single `vaultId`-keyed read: the depositor pubkey\n * comes from the connected wallet, the vault count from the transaction's\n * auth-anchor OP_RETURN vout, and the hashlocks from the same HKDF pipeline the\n * deposit used.\n *\n * The parameter search that turns these hashlocks back into a refundable\n * template lives in `reconstructPeginParams` and needs no wallet.\n *\n * @module recovery/deriveHashlocksFromPrePegin\n */\n\nimport { sha256 } from \"@noble/hashes/sha2.js\";\n\nimport { findAuthAnchorOpReturn } from \"../managers/pegin/assertAuthAnchorOpReturn\";\nimport { expandPerVaultSecrets } from \"../managers/pegin/expandPerVaultSecrets\";\nimport {\n  hexToUint8Array,\n  processPublicKeyToXOnly,\n  stripHexPrefix,\n  uint8ArrayToHex,\n} from \"../primitives/utils/bitcoin\";\nimport {\n  deriveVaultRoot,\n  expandAuthAnchor,\n  parseFundingOutpointsFromTx,\n  type DeriveContextHashCapableWallet,\n} from \"../vault-secrets\";\n\nimport {\n  UnanchoredPrePeginError,\n  VaultRootMismatchError,\n} from \"./recoveryErrors\";\n\nexport interface DeriveHashlocksFromPrePeginInput {\n  /** Any wallet implementing `deriveContextHash` — the depositor's own. */\n  wallet: DeriveContextHashCapableWallet;\n  /**\n   * Depositor BTC public key, read from the CONNECTED WALLET. The reorg\n   * destroyed the row that would normally supply it, and taking it from any\n   * chain read would defeat the recovery.\n   *\n   * Accepted in whatever form the wallet hands back — x-only, 33-byte\n   * compressed or 65-byte uncompressed, `0x` optional — and narrowed to x-only\n   * here. Wallets return the compressed form from `getPublicKey`, so requiring\n   * x-only would make the common case an error.\n   */\n  depositorBtcPubkey: string;\n  /** Funded (broadcast) Pre-PegIn transaction hex, `0x` optional. */\n  fundedPrePeginTxHex: string;\n}\n\nexport interface DeriveHashlocksFromPrePeginResult {\n  /** Number of HTLC outputs the transaction funds, from the anchor's vout. */\n  vaultCount: number;\n  /** 32-byte hex hashlocks (no `0x`), indexed by `htlcVout`. */\n  hashlocks: readonly string[];\n  /** The transaction's auth-anchor commitment, `SHA256(authAnchor)` as hex. */\n  authAnchorHash: string;\n}\n\n/**\n * Derive the per-vault hashlocks committed by a funded Pre-PegIn.\n *\n * Validates the re-derived root against the transaction's auth-anchor\n * OP_RETURN before expanding anything else. That check costs one HKDF call,\n * needs zero protocol parameters, and is what separates \"wrong wallet,\n * account or network\" from \"right wallet, no candidate matched\" — otherwise\n * both surface as a fruitless parameter search.\n *\n * @throws {UnanchoredPrePeginError} If the transaction carries no single,\n *   unambiguous auth-anchor OP_RETURN.\n * @throws {VaultRootMismatchError} If the derived root does not commit to the\n *   transaction's anchor.\n */\nexport async function deriveHashlocksFromPrePegin(\n  input: DeriveHashlocksFromPrePeginInput,\n): Promise<DeriveHashlocksFromPrePeginResult> {\n  const { wallet, depositorBtcPubkey, fundedPrePeginTxHex } = input;\n\n  const cleanTxHex = stripHexPrefix(fundedPrePeginTxHex);\n  const anchor = findAuthAnchorOpReturn(cleanTxHex);\n  if (anchor === undefined) {\n    throw new UnanchoredPrePeginError(\n      `Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN, so the ` +\n        `number of HTLC outputs it funds cannot be determined. Legacy ` +\n        `pre-anchor deposits are not recoverable by this path.`,\n    );\n  }\n  // The anchor sits immediately after the HTLC outputs, so its vout IS the\n  // vault count. At vout 0 it would claim a Pre-PegIn that funds nothing.\n  const vaultCount = anchor.vout;\n  if (vaultCount === 0) {\n    throw new UnanchoredPrePeginError(\n      `Pre-PegIn's auth-anchor OP_RETURN is at vout 0, implying zero HTLC ` +\n        `outputs; there is nothing to recover.`,\n    );\n  }\n\n  const fundingOutpoints = parseFundingOutpointsFromTx(cleanTxHex);\n\n  const root = await deriveVaultRoot(wallet, {\n    // The vault context takes the 32-byte x-only key; a wallet's compressed\n    // key would otherwise fail a byte-length check deep in the encoder with\n    // nothing pointing back at the caller.\n    depositorBtcPubkey: hexToUint8Array(\n      processPublicKeyToXOnly(depositorBtcPubkey),\n    ),\n    fundingOutpoints,\n  });\n\n  // Ordering is load-bearing: `expandPerVaultSecrets` takes ownership of\n  // `root` and zeroes it, so the anchor expansion must run first. On any\n  // throw in this window nothing else will wipe the root, so wipe it here.\n  try {\n    const authAnchorBytes = await expandAuthAnchor(root);\n    let derivedAuthAnchorHash: string;\n    try {\n      derivedAuthAnchorHash = uint8ArrayToHex(sha256(authAnchorBytes));\n    } finally {\n      authAnchorBytes.fill(0);\n    }\n    if (derivedAuthAnchorHash !== anchor.hash) {\n      throw new VaultRootMismatchError(derivedAuthAnchorHash, anchor.hash);\n    }\n  } catch (err) {\n    root.fill(0);\n    throw err;\n  }\n\n  // Shares the deposit-time expansion rather than a hashlock-only variant, so\n  // the two can never drift. Its WOTS output is unused here and dropped with\n  // the result object; refunding spends the timelock leaf, not the preimage.\n  const { hashlocks } = await expandPerVaultSecrets(root, vaultCount);\n\n  return { vaultCount, hashlocks, authAnchorHash: anchor.hash };\n}\n","/**\n * The candidate parameter space `reconstructPeginParams` searches (#2203).\n *\n * A reorg destroys the vault row's version stamps but not the versioned data\n * they point at: `getOffchainParamsByVersion`, `getVaultKeepersByVersion` and\n * `getUniversalChallengersByVersion` are keyed by version, not by `vaultId`,\n * and survive. So the stamps are recoverable by enumeration.\n *\n * Two parameters are deliberately NOT axes here.\n *\n * `vaultCoreVersion` is supplied, not searched. The Pre-PegIn carries no\n * evidence of it: `getPrePeginHtlcConnectorInfo` produces a byte-identical\n * scriptPubKey for v1 and v2, and the version's only other effect on the\n * transaction is the size of the reserve folded into the HTLC value — which\n * the search inverts back out of that same value, so it matches by\n * construction. Enumerating it would guarantee an ambiguous result rather than\n * narrow one. See `__tests__/reconstructPeginParams.test.ts`, which pins the\n * identical-scriptPubKey fact so a future graph version that DOES change the\n * connector fails loudly here.\n *\n * The RFC-006 operation-key epochs are not enumerable at all. Every\n * epoch-keyed read needs `getVaultKeyEpochs(vaultId)` — the destroyed row —\n * and no ABI in this repo exposes an epoch history, a counter, or an event.\n * Only the genesis keys and the operators' current keys are reachable, which\n * is why {@link KeyEpochPolicy} has exactly two values and why they apply to\n * the whole participant set at once: a vault whose participants rotated more\n * than once since creation cannot be reconstructed.\n *\n * @module recovery/peginParamsCandidates\n */\n\nimport type { Address } from \"viem\";\n\n/** One versioned offchain-params snapshot, flattened to what a trial needs. */\nexport interface OffchainParamsCandidate {\n  /** `offchainParamsVersion` stamp this snapshot would restore. */\n  version: number;\n  /** `VersionedOffchainParams.feeRate`. */\n  protocolFeeRate: bigint;\n  minPeginFeeRate: bigint;\n  councilQuorum: number;\n  /** `VersionedOffchainParams.securityCouncilKeys.length`. */\n  councilSize: number;\n  /** `getTimelockPeginByVersion(version)` — not a field on the params struct. */\n  timelockPegin: number;\n  timelockAssert: number;\n  /** `VersionedOffchainParams.tRefund` — the only scalar here that reaches the HTLC scriptPubKey. */\n  timelockRefund: number;\n}\n\n/**\n * One participant key set: a vault provider plus the two rosters at the\n * versions the vault was stamped with.\n *\n * Every key here must be an RFC-006 **operation** key resolved at that\n * participant's own key epoch, and the two roster arrays must be sorted —\n * exactly what `resolveParticipantKeysAtEpochs` produces as\n * `vaultKeeperOperationKeysSorted` / `universalChallengerOperationKeysSorted`.\n * Registration keys are NOT interchangeable: they only coincide with operation\n * keys while nobody has rotated, so passing them yields a wrong script on every\n * candidate and a not-found that wrongly implies the true set was tried.\n *\n * The three epochs are stamped independently by three registries, so a mixed\n * state — the vault provider rotated before this deposit, a challenger after —\n * is ordinary rather than impossible. That is why epochs are resolved per\n * participant from the `PegInSubmitted` log rather than chosen as one\n * all-genesis or all-current policy.\n */\nexport interface ParticipantKeySetCandidate {\n  vaultProvider: Address;\n  /** x-only operation-key hex (no `0x`) at the vault's `vpKeyEpoch`. */\n  vaultProviderBtcPubkey: string;\n  appVaultKeepersVersion: number;\n  /** Sorted operation keys at the vault's `appKeeperKeyEpoch`. */\n  vaultKeeperBtcPubkeys: readonly string[];\n  universalChallengersVersion: number;\n  /** Sorted operation keys at the vault's `ucKeyEpoch`. */\n  universalChallengerBtcPubkeys: readonly string[];\n}\n\n/** A fully-determined parameter set to trial against the funded Pre-PegIn. */\nexport interface PeginParamsCandidate {\n  /**\n   * Stamped tx-graph version (NOT the chain-active one). Carried so the result\n   * describes itself, but constant across a candidate space — see the module\n   * note on why it cannot be searched.\n   */\n  vaultCoreVersion: number;\n  offchainParams: OffchainParamsCandidate;\n  participants: ParticipantKeySetCandidate;\n}\n\nexport interface BuildPeginParamsCandidatesInput {\n  /**\n   * The tx-graph version the stranded deposit was built with. A scalar, not a\n   * list: the transaction cannot discriminate it, so this is taken on trust.\n   * Read it from the orphaned `PegInSubmitted` log — `activeVaultCoreVersion()`\n   * is the current version and is wrong for any deposit that predates a bump.\n   */\n  vaultCoreVersion: number;\n  offchainParams: readonly OffchainParamsCandidate[];\n  participantKeySets: readonly ParticipantKeySetCandidate[];\n}\n\n/**\n * Expand the two searchable axes into the flat candidate list\n * `reconstructPeginParams` trials.\n *\n * With the parameters read from the `PegInSubmitted` log this is called with\n * one entry per axis and produces a single candidate to verify. The\n * multi-element form is the fallback search.\n */\nexport function buildPeginParamsCandidates(\n  input: BuildPeginParamsCandidatesInput,\n): PeginParamsCandidate[] {\n  const { vaultCoreVersion, offchainParams, participantKeySets } = input;\n  if (!Number.isInteger(vaultCoreVersion) || vaultCoreVersion < 1) {\n    throw new Error(\n      `buildPeginParamsCandidates: vaultCoreVersion must be a positive integer, got ${vaultCoreVersion}`,\n    );\n  }\n  if (offchainParams.length === 0) {\n    throw new Error(\n      \"buildPeginParamsCandidates: at least one offchain-params version is required\",\n    );\n  }\n  if (participantKeySets.length === 0) {\n    throw new Error(\n      \"buildPeginParamsCandidates: at least one participant key set is required\",\n    );\n  }\n\n  const candidates: PeginParamsCandidate[] = [];\n  for (const params of offchainParams) {\n    for (const participants of participantKeySets) {\n      candidates.push({\n        vaultCoreVersion,\n        offchainParams: params,\n        participants,\n      });\n    }\n  }\n  return candidates;\n}\n\n/** Which enumeration a version belongs to. */\nexport type CandidateAxis =\n  | \"offchainParams\"\n  | \"vaultKeepers\"\n  | \"universalChallengers\";\n\n/**\n * A version the caller enumerated over but could not resolve into candidate\n * data — dropped by `fetchAllOffchainParams`'s validation, or reported to a\n * roster loop's `onSkippedVersion` observer.\n *\n * Recorded rather than ignored because an unresolved version is UNRESOLVABLE,\n * not absent: it may be the very version that stamped the stranded vault, and\n * a search space missing its answer can still return a confident look-alike.\n */\nexport interface UnresolvedVersion {\n  axis: CandidateAxis;\n  version: number;\n  reason: string;\n}\n\n/** Compact identity of an unresolved version, for error messages. */\nexport function describeUnresolvedVersion(\n  unresolved: UnresolvedVersion,\n): string {\n  return `${unresolved.axis} v${unresolved.version} (${unresolved.reason})`;\n}\n\n/** Compact identity of a candidate, for error messages and result labels. */\nexport function describePeginParamsCandidate(\n  candidate: PeginParamsCandidate,\n): string {\n  const { participants } = candidate;\n  return (\n    `core=${candidate.vaultCoreVersion} ` +\n    `offchain=${candidate.offchainParams.version} ` +\n    `keepers=${participants.appVaultKeepersVersion} ` +\n    `challengers=${participants.universalChallengersVersion} ` +\n    `vp=${participants.vaultProvider}`\n  );\n}\n","/**\n * Recover a stranded deposit's destroyed protocol parameters by trialling an\n * enumerated candidate space against the funded Pre-PegIn transaction (#2203).\n *\n * This is a candidate enumerator plus a loop over an EXISTING verifier.\n * `rebuildDepositTermsCore` already answers \"do these parameters and this\n * funded transaction agree?\" — it rebuilds every HTLC scriptPubKey through the\n * WASM oracle and byte-matches script and value against the transaction, from\n * plain inputs with no chain access. Recovery reuses it verbatim so there is\n * exactly one implementation of that judgement in the codebase.\n *\n * No wallet, no `vaultId`, no browser: every input is either supplied by the\n * caller or read off the transaction. Hashlocks come from\n * `deriveHashlocksFromPrePegin`.\n *\n * @module recovery/reconstructPeginParams\n */\n\nimport type { Network } from \"@babylonlabs-io/babylon-tbv-rust-wasm\";\nimport { Transaction } from \"bitcoinjs-lib\";\n\nimport type { DepositTerms } from \"../deposit-terms/depositTerms\";\nimport { rebuildDepositTermsCore } from \"../deposit-terms/rebuildDepositTermsCore\";\nimport { findAuthAnchorOpReturn } from \"../managers/pegin/assertAuthAnchorOpReturn\";\nimport { HtlcOutputMismatchError } from \"../primitives/psbt/assertWasmPeginSizing\";\nimport {\n  processPublicKeyToXOnly,\n  stripHexPrefix,\n} from \"../primitives/utils/bitcoin\";\nimport { calculateBtcTxHash } from \"../utils/transaction/btcTxHash\";\nimport {\n  computeMinClaimValue,\n  computeMinPeginFee,\n  peginP2aAnchorOutput,\n} from \"../wasm\";\n\nimport {\n  describePeginParamsCandidate,\n  describeUnresolvedVersion,\n  type PeginParamsCandidate,\n  type UnresolvedVersion,\n} from \"./peginParamsCandidates\";\nimport {\n  PeginParamsAmbiguousError,\n  PeginParamsIncompleteSpaceError,\n  PeginParamsNotFoundError,\n  PeginSizingIntegrityError,\n  UnanchoredPrePeginError,\n} from \"./recoveryErrors\";\n\n/**\n * How many per-candidate reasons an error message carries, for rejections and\n * for unevaluated candidates alike. The full list is one line per candidate and\n * runs to hundreds; a handful is enough to tell \"wrong transaction\" from\n * \"roster not enumerated\". Only the message is capped — the counts that drive\n * the fail-closed decisions stay exact.\n */\nconst MAX_REPORTED_REJECTIONS = 5;\n\nexport interface ReconstructPeginParamsInput {\n  /** Hashlocks indexed by `htlcVout`, from `deriveHashlocksFromPrePegin`. */\n  hashlocks: readonly string[];\n  /** Funded (broadcast) Pre-PegIn transaction hex, `0x` optional. */\n  fundedPrePeginTxHex: string;\n  /** Depositor x-only BTC pubkey hex, from the connected wallet. */\n  depositorBtcPubkey: string;\n  /**\n   * Funded-transaction fee, `Σin − Σout`. Not derivable from the transaction\n   * alone — the input values live in the funding UTXOs — but those are\n   * Bitcoin-keyed reads, which a reorg on Ethereum leaves intact.\n   */\n  prepeginMaxFee: bigint;\n  /**\n   * Commission ceiling projected into the returned {@link DepositTerms}. Not a\n   * search axis: it never reaches the HTLC scriptPubKey or value, so the\n   * transaction carries no evidence of it and the caller must supply the bound\n   * it is willing to accept.\n   */\n  maxAcceptableCommissionBps: number;\n  network: Network;\n  /** The space to search, from `buildPeginParamsCandidates`. */\n  candidates: readonly PeginParamsCandidate[];\n  /**\n   * Versions the caller enumerated over but could not resolve. Required, and\n   * `[]` is the explicit claim that the enumeration was complete — so a caller\n   * cannot arrive at a trusted answer by forgetting to mention its gaps.\n   *\n   * A non-empty list turns a sole match into a\n   * {@link PeginParamsIncompleteSpaceError}: uniqueness only rules out a wrong\n   * answer when the right answer was in the space to begin with.\n   */\n  unresolvedVersions: readonly UnresolvedVersion[];\n}\n\nexport interface ReconstructPeginParamsResult {\n  /** The single candidate whose rebuild matched the funded transaction. */\n  candidate: PeginParamsCandidate;\n  /**\n   * Terms projected from the matched candidate.\n   *\n   * The transaction pins the participant keys, `timelockRefund`, and each\n   * HTLC's scriptPubKey and total value. It does NOT pin how that value splits\n   * into `peginAmount`, `depositorClaimValue` and `peginMaxFee` — that split\n   * follows from the matched candidate's fee-side parameters, which the\n   * transaction carries no evidence of.\n   */\n  terms: DepositTerms;\n  /**\n   * Per-vault `peginAmount`, inverted from the observed HTLC output values.\n   * Only as sound as the matched candidate's reserve — see {@link terms}.\n   */\n  peginAmounts: readonly bigint[];\n  /** The transaction's `SHA256(authAnchor)` commitment, for the refund rebuild. */\n  authAnchorHash: string;\n  /** Size of the space actually trialled, for the recovery record. */\n  candidatesTried: number;\n  /**\n   * Every candidate that matched and projected identical terms.\n   *\n   * More than one is normal rather than suspicious: candidates differing only\n   * in fields the transaction cannot express — version labels whose\n   * script- and value-relevant content is the same — are indistinguishable by\n   * construction and describe the same deposit. They are reported rather than\n   * refused; refusal is reserved for survivors whose terms actually differ.\n   */\n  matchedCandidates: readonly PeginParamsCandidate[];\n}\n\n/**\n * Canonical form of a match's observable content, for equality only.\n *\n * Two survivors agreeing here produce the same refund and the same reported\n * amounts, so the difference between them is a label with no consequence.\n */\nfunction matchFingerprint(\n  terms: DepositTerms,\n  peginAmounts: readonly bigint[],\n): string {\n  return JSON.stringify({ terms, peginAmounts }, (_key, value) =>\n    typeof value === \"bigint\" ? `${value}` : value,\n  );\n}\n\n/** Amount-independent per-HTLC reserve, recomputed exactly as the verifier does. */\ninterface PeginSizing {\n  depositorClaimValue: bigint;\n  peginMaxFee: bigint;\n  p2aAnchorValue: bigint;\n}\n\n/** Identity of the inputs that determine a candidate's reserve, for memoising it. */\nfunction sizingCacheKey(candidate: PeginParamsCandidate): string {\n  const { offchainParams: params, participants } = candidate;\n  return [\n    candidate.vaultCoreVersion,\n    participants.vaultKeeperBtcPubkeys.length,\n    participants.universalChallengerBtcPubkeys.length,\n    params.councilQuorum,\n    params.councilSize,\n    params.protocolFeeRate,\n    params.minPeginFeeRate,\n  ].join(\"|\");\n}\n\n/**\n * Compute the amount-independent reserve for one candidate, asserting the WASM\n * outputs before they are consumed (CLAUDE.md critical path 1).\n *\n * Only binary-integrity invariants are asserted here — a claim value or fee of\n * zero, or a negative anchor, is impossible for ANY valid parameter set, so it\n * indicts the binary rather than the candidate and must escape the search loop\n * instead of being counted as a rejection. The plausibility band on the implied\n * reserve is deliberately NOT duplicated: it depends on the candidate's own\n * `minPeginFeeRate`, so a candidate can legitimately fail it, and the verifier\n * applies it where it belongs — as a candidate filter.\n *\n * An absent anchor reads as `0n` because the facade returns `null` for graph\n * versions whose PegIn carries no anchor and never a zero-valued placeholder,\n * which is the same reading `rebuildDepositTermsCore` takes.\n */\nasync function computePeginSizing(\n  candidate: PeginParamsCandidate,\n): Promise<PeginSizing> {\n  const { offchainParams: params, participants } = candidate;\n  // Depositor-as-claimer: the local-challenger count is the keeper count\n  // (the vault provider is excluded) — btc-vault graph.rs derive_challengers_for.\n  const numVks = participants.vaultKeeperBtcPubkeys.length;\n  const numUcs = participants.universalChallengerBtcPubkeys.length;\n  const [depositorClaimValue, peginMaxFee, anchorOutput] = await Promise.all([\n    computeMinClaimValue(\n      candidate.vaultCoreVersion,\n      numVks,\n      numUcs,\n      params.councilQuorum,\n      params.councilSize,\n      params.protocolFeeRate,\n    ),\n    computeMinPeginFee(\n      candidate.vaultCoreVersion,\n      numVks,\n      numUcs,\n      params.minPeginFeeRate,\n    ),\n    peginP2aAnchorOutput(candidate.vaultCoreVersion),\n  ]);\n  const p2aAnchorValue = anchorOutput?.value ?? 0n;\n\n  if (depositorClaimValue <= 0n) {\n    throw new PeginSizingIntegrityError(\n      `WASM returned non-positive depositorClaimValue ${depositorClaimValue} for graph version ${candidate.vaultCoreVersion}`,\n    );\n  }\n  if (peginMaxFee <= 0n) {\n    throw new PeginSizingIntegrityError(\n      `WASM returned non-positive peginMaxFee ${peginMaxFee} for graph version ${candidate.vaultCoreVersion}`,\n    );\n  }\n  if (p2aAnchorValue < 0n) {\n    throw new PeginSizingIntegrityError(\n      `WASM returned negative P2A anchor value ${p2aAnchorValue} for graph version ${candidate.vaultCoreVersion}`,\n    );\n  }\n\n  return { depositorClaimValue, peginMaxFee, p2aAnchorValue };\n}\n\n/**\n * Search the candidate space for the parameter set that reproduces the funded\n * Pre-PegIn, and project it back into {@link DepositTerms}.\n *\n * Per candidate: invert each vault's `peginAmount` from the observed HTLC\n * output value via the protocol identity `htlcValue = peginAmount +\n * depositorClaimValue + peginMaxFee + p2aAnchorValue`, then hand the result to\n * `rebuildDepositTermsCore`, which independently recomputes that same sizing\n * and byte-matches both the value and the scriptPubKey of every HTLC output.\n *\n * Because the amount is inverted from the value it is compared against, the\n * VALUE check cannot discriminate between candidates: it holds for any\n * candidate whose reserve leaves a positive amount. The scriptPubKey does all\n * the discriminating, and `getPrePeginHtlcConnectorInfo` accepts exactly one\n * offchain-params scalar — `timelockRefund`. So two offchain versions sharing\n * a `timelockRefund` are indistinguishable however much their fee rates or\n * council parameters differ, and that is precisely the ambiguity this function\n * refuses to guess through. The value check is still run, by the verifier, as\n * the bound that stops a candidate whose reserve exceeds the funded output.\n *\n * Every candidate is trialled; the loop does not stop at the first match,\n * because detecting ambiguity is the point. Matches are then COMPARED rather\n * than counted — several candidates matching is the ordinary case whenever\n * their differences cannot reach the transaction, and refusing on a count\n * alone would reject a deposit whose refund is fully determined.\n *\n * A candidate is only rejected on a Gate-1 byte mismatch, which is the\n * transaction positively disagreeing with it. Any other failure means the\n * candidate was never really evaluated, so it is recorded as unresolved and\n * feeds the same fail-closed path as a version that could not be read —\n * otherwise an incidental error on the TRUE candidate would remove it silently\n * and hand back a look-alike as a trusted unique answer.\n *\n * @throws {UnanchoredPrePeginError} If the transaction carries no single,\n *   unambiguous auth-anchor OP_RETURN.\n * @throws {PeginParamsNotFoundError} If no candidate matched.\n * @throws {PeginParamsAmbiguousError} If matches disagree on the projected terms.\n * @throws {PeginParamsIncompleteSpaceError} If a match is found but the space\n *   was known to be incomplete, or a candidate failed to evaluate.\n */\nexport async function reconstructPeginParams(\n  input: ReconstructPeginParamsInput,\n): Promise<ReconstructPeginParamsResult> {\n  const {\n    hashlocks,\n    fundedPrePeginTxHex,\n    depositorBtcPubkey,\n    prepeginMaxFee,\n    maxAcceptableCommissionBps,\n    network,\n    candidates,\n    unresolvedVersions,\n  } = input;\n\n  if (hashlocks.length === 0) {\n    throw new Error(\n      \"reconstructPeginParams: at least one hashlock is required\",\n    );\n  }\n  if (candidates.length === 0) {\n    throw new Error(\"reconstructPeginParams: candidate space is empty\");\n  }\n\n  // The verifier compares this against WASM-built scripts and does not\n  // normalise, while the derivation half accepts a `0x` prefix. Passing one\n  // wallet string to both must not make step 1 pass and step 2 fail every\n  // candidate, which would present as \"no parameters found\".\n  const normalizedDepositorBtcPubkey =\n    processPublicKeyToXOnly(depositorBtcPubkey);\n\n  const cleanTxHex = stripHexPrefix(fundedPrePeginTxHex);\n  const anchor = findAuthAnchorOpReturn(cleanTxHex);\n  if (anchor === undefined) {\n    throw new UnanchoredPrePeginError(\n      `Pre-PegIn carries no single, unambiguous auth-anchor OP_RETURN; the ` +\n        `sibling set cannot be proven complete. Reconstruction refused.`,\n    );\n  }\n  // The verifier re-checks this, but catching it here attributes the failure\n  // to the hashlock set rather than to every candidate in turn.\n  if (anchor.vout !== hashlocks.length) {\n    throw new Error(\n      `reconstructPeginParams: ${hashlocks.length} hashlock(s) supplied but ` +\n        `the auth-anchor OP_RETURN sits at vout ${anchor.vout}, so the ` +\n        `transaction funds ${anchor.vout} HTLC output(s). Reconstruction refused.`,\n    );\n  }\n\n  const outputs = Transaction.fromHex(cleanTxHex).outs;\n  const observedHtlcValues = hashlocks.map((_, i) => BigInt(outputs[i].value));\n  const prepeginTxid = stripHexPrefix(\n    calculateBtcTxHash(cleanTxHex),\n  ).toLowerCase();\n\n  const sizingCache = new Map<string, PeginSizing>();\n  const survivors: {\n    candidate: PeginParamsCandidate;\n    terms: DepositTerms;\n    peginAmounts: bigint[];\n    fingerprint: string;\n  }[] = [];\n  const rejections: string[] = [];\n  // Count drives the fail-closed decision and must stay exact; only the labels\n  // that reach the error message are capped, since in the fallback search every\n  // candidate can land here and each entry embeds a full error message.\n  const unevaluatedLabels: string[] = [];\n  let unevaluatedCount = 0;\n\n  for (const candidate of candidates) {\n    try {\n      const cacheKey = sizingCacheKey(candidate);\n      let sizing = sizingCache.get(cacheKey);\n      if (sizing === undefined) {\n        sizing = await computePeginSizing(candidate);\n        sizingCache.set(cacheKey, sizing);\n      }\n      const reserve =\n        sizing.depositorClaimValue + sizing.peginMaxFee + sizing.p2aAnchorValue;\n      const peginAmounts = observedHtlcValues.map((value) => value - reserve);\n      // A reserve larger than the funded output is the transaction positively\n      // disagreeing with this candidate — the value bound doing the one piece\n      // of discriminating it can. The verifier would reject it too, but with a\n      // generic error that would be misread as \"never evaluated\" and would\n      // pollute the space with phantom gaps.\n      const shortIndex = peginAmounts.findIndex((amount) => amount <= 0n);\n      if (shortIndex !== -1) {\n        throw new HtlcOutputMismatchError(\n          `HTLC output[${shortIndex}] value ${observedHtlcValues[shortIndex]} ` +\n            `is not above this candidate's reserve ${reserve}, so it implies a ` +\n            `non-positive pegin amount ${peginAmounts[shortIndex]}.`,\n        );\n      }\n\n      const { offchainParams: params, participants } = candidate;\n      const terms = await rebuildDepositTermsCore({\n        vaultCoreVersion: candidate.vaultCoreVersion,\n        siblings: hashlocks.map((hashlock, i) => ({\n          hashlock,\n          amount: peginAmounts[i],\n        })),\n        fundedPrePeginTxHex: cleanTxHex,\n        depositorBtcPubkey: normalizedDepositorBtcPubkey,\n        vaultProviderBtcPubkey: participants.vaultProviderBtcPubkey,\n        vaultKeeperBtcPubkeys: participants.vaultKeeperBtcPubkeys,\n        universalChallengerBtcPubkeys:\n          participants.universalChallengerBtcPubkeys,\n        protocolFeeRate: params.protocolFeeRate,\n        minPeginFeeRate: params.minPeginFeeRate,\n        councilQuorum: params.councilQuorum,\n        councilSize: params.councilSize,\n        timelockPegin: params.timelockPegin,\n        timelockAssert: params.timelockAssert,\n        timelockRefund: params.timelockRefund,\n        prepeginTxid,\n        prepeginMaxFee,\n        maxAcceptableCommissionBps,\n        network,\n      });\n\n      survivors.push({\n        candidate,\n        terms,\n        peginAmounts,\n        fingerprint: matchFingerprint(terms, peginAmounts),\n      });\n    } catch (err) {\n      // A malformed WASM sizing output is not a property of the candidate, so\n      // counting it as a rejection would bury a broken binary under \"no\n      // candidate matched\". Let it out.\n      if (err instanceof PeginSizingIntegrityError) {\n        throw err;\n      }\n      const label = describePeginParamsCandidate(candidate);\n      const reason = err instanceof Error ? err.message : String(err);\n      if (err instanceof HtlcOutputMismatchError) {\n        // The transaction positively disagrees with this candidate — the\n        // expected outcome for all but one, so it cannot propagate. Recorded,\n        // and a sample reaches the not-found error to keep it diagnosable.\n        if (rejections.length < MAX_REPORTED_REJECTIONS) {\n          rejections.push(`[${label}] ${reason}`);\n        }\n      } else {\n        // Anything else says nothing about the transaction: this candidate was\n        // never actually evaluated. Treating it as a rejection would let an\n        // incidental failure on the true candidate hand back a look-alike.\n        unevaluatedCount++;\n        if (unevaluatedLabels.length < MAX_REPORTED_REJECTIONS) {\n          unevaluatedLabels.push(`${label} (${reason})`);\n        }\n      }\n    }\n  }\n\n  // A candidate that could not be evaluated is a hole in the space in exactly\n  // the same way an unreadable version is, so the two are reported together.\n  const gapCount = unresolvedVersions.length + unevaluatedCount;\n  const gaps = [\n    ...unresolvedVersions.map(describeUnresolvedVersion),\n    ...unevaluatedLabels,\n  ];\n\n  if (survivors.length === 0) {\n    throw new PeginParamsNotFoundError(candidates.length, rejections, gaps);\n  }\n\n  // Compare, do not count. Survivors all byte-matched the same funded outputs,\n  // so they already agree on every HTLC scriptPubKey and total value; if they\n  // also project identical terms there is nothing to choose between them and\n  // nothing is at stake in choosing.\n  const distinct = new Set(survivors.map((s) => s.fingerprint));\n  if (distinct.size > 1) {\n    throw new PeginParamsAmbiguousError(\n      survivors.map((s) => describePeginParamsCandidate(s.candidate)),\n    );\n  }\n\n  // Reported after ambiguity: disagreeing survivors are the more specific\n  // diagnosis, and that error already names them.\n  if (gapCount > 0) {\n    throw new PeginParamsIncompleteSpaceError(\n      describePeginParamsCandidate(survivors[0].candidate),\n      gaps,\n    );\n  }\n\n  return {\n    candidate: survivors[0].candidate,\n    terms: survivors[0].terms,\n    peginAmounts: survivors[0].peginAmounts,\n    authAnchorHash: anchor.hash,\n    candidatesTried: candidates.length,\n    matchedCandidates: survivors.map((s) => s.candidate),\n  };\n}\n","/**\n * Close the loop from a verified reconstruction to the ordinary refund path\n * (#2203).\n *\n * `buildAndBroadcastRefund` takes its two reads — the vault row and the\n * version-pinned Pre-PegIn context — as injected callbacks rather than\n * performing them itself. That is the whole seam recovery needs: a stranded\n * deposit has no row to read, but it does have a reconstruction that was\n * byte-verified against the funded transaction, and those are exactly the\n * fields the callbacks are expected to return.\n *\n * So recovery does not need a parallel refund implementation, and must not\n * have one. It supplies the same shapes from a different source and reuses the\n * orchestrator verbatim, which keeps the refund-fee cap, the abort checks, the\n * `htlcVout` contiguity invariant and the bitcoind error classification in one\n * place for both paths.\n *\n * @module recovery/toRefundInputs\n */\n\nimport type { Network } from \"@babylonlabs-io/babylon-tbv-rust-wasm\";\nimport type { Address, Hex } from \"viem\";\n\nimport { ensureHexPrefix } from \"../primitives/utils/bitcoin\";\nimport type {\n  RefundPrePeginContext,\n  VaultRefundData,\n} from \"../services/refund/buildAndBroadcastRefund\";\n\nimport type { ReconstructPeginParamsResult } from \"./reconstructPeginParams\";\n\nexport interface ToRefundInputsOptions {\n  /**\n   * Which sibling of the Pre-PegIn to refund, as an index into the\n   * reconstruction's hashlocks and amounts. Equal to the vault's `htlcVout`\n   * by construction — `PeginManager` asserts `perVault[i].htlcVout === i`.\n   */\n  htlcVout: number;\n  /**\n   * Depositor BTC pubkey, the same value the reconstruction was run with.\n   * Passed through rather than re-derived so the refund is built against the\n   * key that was actually verified.\n   *\n   * Deliberately NOT narrowed to x-only here. `VaultRefundData.depositorBtcPubkey`\n   * accepts \"32 or 33 bytes of hex\", and `buildAndBroadcastRefund` narrows it\n   * with `processPublicKeyToXOnly` before it reaches the PSBT builder — so a\n   * wallet's compressed key flows through unchanged, which is what wallets\n   * actually return. Narrowing early would discard the parity byte the\n   * orchestrator's own validation accepts.\n   */\n  depositorBtcPubkey: string;\n  /**\n   * The vault provider's application entry point. Not recoverable from the\n   * Bitcoin transaction and not part of the verified parameter set — it is a\n   * field of the vault-provider registry row, which is address-keyed and\n   * survives the reorg untouched.\n   */\n  applicationEntryPoint: Address;\n  /** Funded Pre-PegIn transaction hex, `0x` optional. */\n  fundedPrePeginTxHex: string;\n  /** Hashlocks indexed by `htlcVout`, as passed to the reconstruction. */\n  hashlocks: readonly string[];\n  /**\n   * The Bitcoin network the reconstruction was verified against. An input to\n   * the search rather than an output of it, so it is restated here; passing a\n   * different one would build the refund against a different script tree than\n   * the one that was proven to match.\n   */\n  network: Network;\n}\n\nexport interface RefundInputsFromRecovery {\n  vault: VaultRefundData;\n  context: RefundPrePeginContext;\n}\n\n/**\n * Project a verified reconstruction into the two shapes\n * `buildAndBroadcastRefund` injects.\n *\n * Every value here comes from a parameter set that has already been\n * byte-matched against the funded transaction's HTLC outputs, so this is a\n * projection and not a second validation pass. The orchestrator re-checks the\n * parts it owns regardless.\n *\n * @throws If `htlcVout` does not index the reconstructed batch, or the\n *   hashlock vector disagrees with the reconstructed amounts.\n */\nexport function toRefundInputs(\n  result: ReconstructPeginParamsResult,\n  options: ToRefundInputsOptions,\n): RefundInputsFromRecovery {\n  const {\n    htlcVout,\n    depositorBtcPubkey,\n    applicationEntryPoint,\n    fundedPrePeginTxHex,\n    hashlocks,\n    network,\n  } = options;\n\n  const { candidate, peginAmounts } = result;\n  const { offchainParams, participants } = candidate;\n\n  if (hashlocks.length !== peginAmounts.length) {\n    throw new Error(\n      `toRefundInputs: ${hashlocks.length} hashlock(s) but ` +\n        `${peginAmounts.length} reconstructed amount(s); the reconstruction ` +\n        `and the hashlock vector describe different transactions.`,\n    );\n  }\n  if (\n    !Number.isInteger(htlcVout) ||\n    htlcVout < 0 ||\n    htlcVout >= peginAmounts.length\n  ) {\n    throw new Error(\n      `toRefundInputs: htlcVout ${htlcVout} is outside the reconstructed ` +\n        `batch of ${peginAmounts.length} vault(s).`,\n    );\n  }\n\n  // The orchestrator requires the complete vout-ordered batch, not just the\n  // target: its anchor check is fail-closed, so refunding one sibling of a\n  // multi-vault Pre-PegIn without the others is rejected outright.\n  const batch = peginAmounts.map((amount, index) => ({\n    hashlock: ensureHexPrefix(hashlocks[index]),\n    amount,\n    htlcVout: index,\n  }));\n\n  const vault: VaultRefundData = {\n    vaultCoreVersion: candidate.vaultCoreVersion,\n    hashlock: batch[htlcVout].hashlock as Hex,\n    htlcVout,\n    offchainParamsVersion: offchainParams.version,\n    appVaultKeepersVersion: participants.appVaultKeepersVersion,\n    universalChallengersVersion: participants.universalChallengersVersion,\n    vaultProvider: participants.vaultProvider,\n    applicationEntryPoint,\n    amount: peginAmounts[htlcVout],\n    unsignedPrePeginTxHex: fundedPrePeginTxHex,\n    depositorBtcPubkey,\n    batch,\n  };\n\n  const context: RefundPrePeginContext = {\n    vaultProviderPubkey: participants.vaultProviderBtcPubkey,\n    vaultKeeperPubkeys: participants.vaultKeeperBtcPubkeys,\n    universalChallengerPubkeys: participants.universalChallengerBtcPubkeys,\n    timelockRefund: offchainParams.timelockRefund,\n    feeRate: offchainParams.protocolFeeRate,\n    minPeginFeeRate: offchainParams.minPeginFeeRate,\n    // Depositor-as-claimer: the local-challenger count is the keeper count,\n    // the vault provider excluded — btc-vault graph.rs derive_challengers.\n    numLocalChallengers: participants.vaultKeeperBtcPubkeys.length,\n    councilQuorum: offchainParams.councilQuorum,\n    councilSize: offchainParams.councilSize,\n    network,\n  };\n\n  return { vault, context };\n}\n"],"names":["STAMPED_PROTOCOL_FIELDS","STAMPED_ADDRESS_FIELDS","selectSiblingRegistrations","records","target","depositor","prePeginTxHash","registrationPrePeginTxHash","r","assertClaimBatchHomogeneous","siblings","sibling","field","orderClaimBatchByHtlcVout","members","ordered","a","b","member","i","m","DEPOSIT_TERMS_REJECTED_ERROR_NAME","DepositTermsRejectedError","message","reason","__publicField","isDepositTermsRejectedError","err","shaped","computeFundedPrePeginFee","fundedPrePeginTxHex","mempoolApiUrl","tx","Transaction","stripHexPrefix","totalIn","input","getUtxoInfo","Buffer","sum","u","totalOut","o","fee","MAX_REASONABLE_FEE_SATS","rebuildDepositTermsCore","siblingCount","expectedTxid","actualTxid","calculateBtcTxHash","found","findAuthAnchorOpReturn","numVks","numUcs","depositorClaimValue","computeMinClaimValue","peginMaxFee","computeMinPeginFee","anchor","peginP2aAnchorOutput","anchorValue","impliedReserve","maxImpliedReserve","MAX_REASONABLE_PEGIN_VBYTES","expectedHtlcValues","s","expectedHtlcScriptPubKeys","getPrePeginHtlcConnectorInfo","fundedOutputs","assertEncodedHtlcOutputsMatch","buildDepositTerms","rebuildDepositTermsForClaim","params","read","connectedDepositor","canonicalizeBtcPubkey","prepeginTxid","siblingMembers","record","vault","targetMember","prepeginMaxFee","isWotsMismatchError","error","msg","PEGIN_FINGERPRINT_DOMAIN_PREIMAGE","PEGIN_FINGERPRINT_DOMAIN","keccak256","toHex","UINT16_MAX","UINT64_MAX","UINT256_MAX","BYTES32_PATTERN","VAULT_CORE_VERSION_MIN","PeginFingerprintInputError","isPeginFingerprintInputError","assertUnsignedRange","value","max","solidityType","assertUint16","normalizeBytes32","normalizeRegistryAddress","registryAddress","isAddress","normalized","zeroAddress","PEGIN_FINGERPRINT_ABI_PARAMETERS","encodePeginFingerprintPreimage","registry","vaultProviderBtcKey","encodeAbiParameters","computePeginFingerprint","VaultRootMismatchError","derivedAuthAnchorHash","onChainAuthAnchorHash","UnanchoredPrePeginError","PeginParamsNotFoundError","candidatesTried","sampleRejections","unresolvedLabels","PeginParamsAmbiguousError","survivorLabels","PeginParamsIncompleteSpaceError","matchedLabel","PeginSizingIntegrityError","deriveHashlocksFromPrePegin","wallet","depositorBtcPubkey","cleanTxHex","vaultCount","fundingOutpoints","parseFundingOutpointsFromTx","root","deriveVaultRoot","hexToUint8Array","processPublicKeyToXOnly","authAnchorBytes","expandAuthAnchor","uint8ArrayToHex","sha256","hashlocks","expandPerVaultSecrets","buildPeginParamsCandidates","vaultCoreVersion","offchainParams","participantKeySets","candidates","participants","describeUnresolvedVersion","unresolved","describePeginParamsCandidate","candidate","MAX_REPORTED_REJECTIONS","matchFingerprint","terms","peginAmounts","_key","sizingCacheKey","computePeginSizing","anchorOutput","p2aAnchorValue","reconstructPeginParams","maxAcceptableCommissionBps","network","unresolvedVersions","normalizedDepositorBtcPubkey","outputs","observedHtlcValues","_","sizingCache","survivors","rejections","unevaluatedLabels","unevaluatedCount","cacheKey","sizing","reserve","shortIndex","amount","HtlcOutputMismatchError","hashlock","label","gapCount","gaps","toRefundInputs","result","options","htlcVout","applicationEntryPoint","batch","index","ensureHexPrefix","context"],"mappings":"6zBA+BMA,GAA0B,CAC9B,mBACA,wBACA,yBACA,6BACF,EACMC,GAAyB,CAC7B,wBACA,eACF,EAGO,SAASC,GACdC,EACAC,EAC2B,CAC3B,MAAMC,EAAYD,EAAO,UAAU,YAAA,EAC7BE,EAAiBC,EAAAA,2BAA2BH,CAAM,EAAE,YAAA,EAE1D,OAAOD,EAAQ,OACZK,GACCA,EAAE,UAAYJ,EAAO,SACrBI,EAAE,UAAU,YAAA,IAAkBH,GAC9BE,EAAAA,2BAA2BC,CAAC,EAAE,gBAAkBF,CAAA,CAEtD,CAGO,SAASG,GACdL,EACAM,EACM,CACN,UAAWC,KAAWD,EAAU,CAC9B,UAAWE,KAASZ,GAClB,GAAIW,EAAQ,MAAM,SAASC,CAAK,IAAMR,EAAO,MAAM,SAASQ,CAAK,EAC/D,MAAM,IAAI,MACR,gDAAgDA,CAAK,KAC/CD,EAAQ,MAAM,SAASC,CAAK,CAAC,OAAOR,EAAO,MAAM,SAASQ,CAAK,CAAC,+DAAA,EAK5E,GACED,EAAQ,6BAA+BP,EAAO,2BAE9C,MAAM,IAAI,MACR,4EACMO,EAAQ,0BAA0B,OAAOP,EAAO,0BAA0B,+DAAA,EAIpF,UAAWQ,KAASX,GAClB,GACEU,EAAQ,MAAM,MAAMC,CAAK,EAAE,YAAA,IAC3BR,EAAO,MAAM,MAAMQ,CAAK,EAAE,cAE1B,MAAM,IAAI,MACR,gDAAgDA,CAAK,KAC/CD,EAAQ,MAAM,MAAMC,CAAK,CAAC,OAAOR,EAAO,MAAM,MAAMQ,CAAK,CAAC,+DAAA,CAKxE,CACF,CAQO,SAASC,GACdC,EACkB,CAClB,MAAMC,EAAU,CAAC,GAAGD,CAAO,EAAE,KAC3B,CAACE,EAAGC,IAAMD,EAAE,MAAM,SAAS,SAAWC,EAAE,MAAM,SAAS,QAAA,EAEzD,OAAAF,EAAQ,QAAQ,CAACG,EAAQC,IAAM,CAC7B,GAAID,EAAO,MAAM,SAAS,WAAaC,EACrC,MAAM,IAAI,MACR,4DACMJ,EAAQ,IAAKK,GAAMA,EAAE,MAAM,SAAS,QAAQ,EAAE,KAAK,IAAI,CAAC,IAAA,CAGpE,CAAC,EACML,EAAQ,IAAKK,IAAO,CACzB,SAAUA,EAAE,MAAM,SAAS,SAC3B,OAAQA,EAAE,MAAM,MAAM,MAAA,EACtB,CACJ,CC/GO,MAAMC,EAAoC,4BAM1C,MAAMC,WAAkC,KAAM,CAGnD,YACEC,EACAC,EAAsC,kBACtC,CACA,MAAMD,CAAO,EANNE,EAAA,eAOP,KAAK,KAAOJ,EACZ,KAAK,OAASG,CAChB,CACF,CAOO,SAASE,GACdC,EACkC,CAClC,GAAIA,aAAeL,GAA2B,MAAO,GACrD,GAAI,OAAOK,GAAQ,UAAYA,IAAQ,KAAM,MAAO,GACpD,MAAMC,EAASD,EAGf,OACEC,EAAO,OAASP,GAChBO,EAAO,SAAW,iBAEtB,CCzBA,eAAsBC,GACpBC,EACAC,EACiB,CACjB,MAAMC,EAAKC,EAAAA,YAAY,QAAQC,EAAAA,eAAeJ,CAAmB,CAAC,EAW5DK,GAVW,MAAM,QAAQ,IAC7BH,EAAG,IAAI,IAAKI,GAEVC,GAAAA,YACEC,GAAAA,OAAO,KAAKF,EAAM,IAAI,EAAE,QAAA,EAAU,SAAS,KAAK,EAChDA,EAAM,MACNL,CAAA,CACF,CACF,GAEuB,OAAO,CAACQ,EAAKC,IAAMD,EAAM,OAAOC,EAAE,KAAK,EAAG,EAAE,EAC/DC,EAAWT,EAAG,KAAK,OAAO,CAACO,EAAKG,IAAMH,EAAM,OAAOG,EAAE,KAAK,EAAG,EAAE,EAC/DC,EAAMR,EAAUM,EACtB,GAAIE,GAAO,GACT,MAAM,IAAI,MACR,gGACoBA,CAAG,SAAA,EAG3B,GAAIA,EAAMC,EAAAA,wBACR,MAAM,IAAI,MACR,oDAAoDD,CAAG,8CAClCC,EAAAA,uBAAuB,qEAAA,EAIhD,OAAOD,CACT,CCmBA,eAAsBE,EACpBT,EACuB,CACvB,MAAMU,EAAeV,EAAM,SAAS,OACpC,GAAIU,IAAiB,EACnB,MAAM,IAAI,MACR,2DAAA,EAGJ,SAAW,CAAC3B,EAAGR,CAAO,IAAKyB,EAAM,SAAS,UACxC,GAAIzB,EAAQ,QAAU,GACpB,MAAM,IAAI,MACR,oCAAoCQ,CAAC,4CACzBR,EAAQ,MAAM,2DAAA,EAIhC,GAAIyB,EAAM,gBAAkB,GAC1B,MAAM,IAAI,MACR,4DAA4DA,EAAM,cAAc,EAAA,EAOpF,MAAMW,EAAeb,EAAAA,eAAeE,EAAM,YAAY,EAAE,YAAA,EAClDY,EAAad,EAAAA,eACjBe,EAAAA,mBAAmBb,EAAM,mBAAmB,CAAA,EAC5C,YAAA,EACF,GAAIY,IAAeD,EACjB,MAAM,IAAI,MACR,iCAAiCC,CAAU,cAAcD,CAAY,2CAAA,EAOzE,MAAMG,EAAQC,EAAAA,uBACZjB,EAAAA,eAAeE,EAAM,mBAAmB,CAAA,EAE1C,GAAIc,IAAU,OACZ,MAAM,IAAI,MACR,iOAAA,EAMJ,GAAIA,EAAM,OAASJ,EACjB,MAAM,IAAI,MACR,iCAAiCI,EAAM,IAAI,gDACbJ,CAAY,6IAAA,EAQ9C,MAAMM,EAAShB,EAAM,sBAAsB,OACrCiB,EAASjB,EAAM,8BAA8B,OAC7CkB,EAAsB,MAAMC,EAAAA,qBAChCnB,EAAM,iBACNgB,EACAC,EACAjB,EAAM,cACNA,EAAM,YACNA,EAAM,eAAA,EAEFoB,EAAc,MAAMC,EAAAA,mBACxBrB,EAAM,iBACNgB,EACAC,EACAjB,EAAM,eAAA,EAEFsB,EAAS,MAAMC,uBAAqBvB,EAAM,gBAAgB,EAC1DwB,GAAcF,GAAA,YAAAA,EAAQ,QAAS,GAKrC,GAAIJ,GAAuB,GACzB,MAAM,IAAI,MACR,kDAAkDA,CAAmB,iCAAA,EAIzE,GAAIE,GAAe,GACjB,MAAM,IAAI,MACR,0CAA0CA,CAAW,iCAAA,EAMzD,GAAII,EAAc,GAChB,MAAM,IAAI,MACR,2CAA2CA,CAAW,mBAAA,EAG1D,MAAMC,EAAiBL,EAAcI,EAC/BE,EAAoB1B,EAAM,gBAAkB2B,EAAAA,4BAClD,GAAIF,GAAkB,IAAMA,EAAiBC,EAC3C,MAAM,IAAI,MACR,8BAA8BD,CAAc,uBACnCC,CAAiB,sBAAsB1B,EAAM,eAAe,MAChE2B,EAAAA,2BAA2B,2BAAA,EAOpC,MAAMC,EAAqB5B,EAAM,SAAS,IACvC6B,GAAMA,EAAE,OAASX,EAAsBE,EAAcI,CAAA,EAElDM,EAA4B,MAAM,QAAQ,IAC9C9B,EAAM,SAAS,IAAI,MAAO6B,IACN,MAAME,+BAA6B,CACnD,eAAgB/B,EAAM,iBACtB,gBAAiBA,EAAM,mBACvB,oBAAqBA,EAAM,uBAC3B,mBAAoB,CAAC,GAAGA,EAAM,qBAAqB,EACnD,2BAA4B,CAAC,GAAGA,EAAM,6BAA6B,EACnE,SAAUF,EAAAA,eAAe+B,EAAE,QAAQ,EACnC,eAAgB7B,EAAM,eACtB,QAASA,EAAM,OAAA,CAChB,GACgB,YAClB,CAAA,EAEGgC,EAAgBnC,EAAAA,YAAY,QAChCC,EAAAA,eAAeE,EAAM,mBAAmB,CAAA,EACxC,KAAK,IAAKM,IAAO,CAAE,MAAOA,EAAE,MAAO,OAAQA,EAAE,MAAA,EAAS,EACxD2B,OAAAA,EAAAA,8BACED,EACAJ,EACAE,CAAA,EAGKI,qBAAkB,CACvB,iBAAkBlC,EAAM,iBACxB,gBAAiBA,EAAM,gBACvB,cAAeA,EAAM,cACrB,eAAgBA,EAAM,eACtB,eAAgBA,EAAM,eACtB,aAAcA,EAAM,aACpB,eAAgBA,EAAM,eACtB,uBAAwBA,EAAM,uBAC9B,sBAAuBA,EAAM,sBAC7B,8BAA+BA,EAAM,8BACrC,2BAA4BA,EAAM,2BAClC,aAAcA,EAAM,SAAS,IAAK6B,GAAMA,EAAE,MAAM,EAChD,oBAAAX,EACA,YAAAE,CAAA,CACD,CACH,CCrJA,eAAsBe,GACpBC,EACuB,CACvB,KAAM,CAAE,KAAAC,GAASD,EACXE,EAAqBC,EAAAA,sBAAsBH,EAAO,kBAAkB,EAC1E,GAAIE,IAAuBD,EAAK,QAAQ,mBACtC,MAAM,IAAI,MACR,kGAAA,EAKJ,MAAMG,EAAe1C,EAAAA,eAAeuC,EAAK,cAAc,EAAE,YAAA,EACnDzB,EAAad,EAAAA,eACjBe,EAAAA,mBAAmBuB,EAAO,mBAAmB,CAAA,EAC7C,YAAA,EACF,GAAIxB,IAAe4B,EACjB,MAAM,IAAI,MACR,iCAAiC5B,CAAU,cAAc4B,CAAY,6BAAA,EAIzE,MAAMC,EAAqC,MAAM,QAAQ,IACvD3E,GACEuE,EAAK,oBACLA,EAAK,kBAAA,EACL,IAAI,MAAOK,GAAW,CACtB,MAAMC,EAAQ,MAAMP,EAAO,cAAc,aAAaM,EAAO,OAAO,EACpE,GACEC,EAAM,SAAS,eAAe,YAAA,IAC9BxE,6BAA2BuE,CAAM,EAAE,cAEnC,MAAM,IAAI,MACR,WAAWA,EAAO,OAAO,yHAAA,EAI7B,MAAO,CACL,MAAAC,EACA,2BAA4BD,EAAO,0BAAA,CAEvC,CAAC,CAAA,EAEGE,EAAiC,CACrC,MAAOP,EAAK,MACZ,2BACEA,EAAK,mBAAmB,0BAAA,EAE5BhE,GAA4BuE,EAAcH,CAAc,EACxD,MAAMnE,EAAWG,GAA0B,CAACmE,EAAc,GAAGH,CAAc,CAAC,EAEtEI,EAAiB,MAAMpD,GAC3B2C,EAAO,oBACPA,EAAO,aAAA,EAGT,OAAO3B,EAAwB,CAC7B,iBAAkB4B,EAAK,MAAM,SAAS,iBACtC,SAAA/D,EACA,oBAAqB8D,EAAO,oBAC5B,mBAAoBE,EACpB,uBACED,EAAK,gBAAgB,cAAc,mBACrC,sBAAuBA,EAAK,gBAAgB,+BAC5C,8BACEA,EAAK,gBAAgB,uCACvB,gBAAiBA,EAAK,eAAe,QACrC,gBAAiBA,EAAK,eAAe,gBACrC,cAAeA,EAAK,eAAe,cACnC,YAAaA,EAAK,eAAe,oBAAoB,OACrD,cAAeA,EAAK,QAAQ,cAC5B,eAAgBA,EAAK,QAAQ,eAC7B,eAAgBA,EAAK,eAAe,QACpC,aAAAG,EACA,eAAAK,EAGA,2BACER,EAAK,mBAAmB,2BAC1B,QAASD,EAAO,OAAA,CACjB,CACH,CC3JO,SAASU,GAAoBC,EAAyB,CAC3D,MAAMC,GACJD,aAAiB,MACbA,EAAM,QACN,OAAOA,GAAU,SACfA,EACA,IACN,YAAA,EAEF,OACEC,EAAI,SAAS,MAAM,GACnBA,EAAI,SAAS,MAAM,GACnBA,EAAI,SAAS,gBAAgB,CAEjC,CCkCO,MAAMC,GAAoC,0BAWpCC,GAAgCC,EAAAA,UAC3CC,EAAAA,MAAMH,EAAiC,CACzC,EAGMI,EAAa,MAEbC,EAAa,IAAM,IAAM,GAEzBC,GAAc,IAAM,KAAO,GAE3BC,GAAkB,sBAWlBC,EAAyB,EAgDxB,MAAMC,UAAmC,KAAM,CACpD,YAAYvE,EAAiB,CAC3B,MAAMA,CAAO,EACb,KAAK,KAAO,4BACd,CACF,CAWO,SAASwE,GACdpE,EACmC,CACnC,OACEA,aAAemE,GACdnE,aAAe,OAASA,EAAI,OAAS,4BAE1C,CAaA,SAASqE,EACPpF,EACAqF,EACAC,EACAC,EACM,CACN,GAAI,OAAOF,GAAU,SACnB,MAAM,IAAIH,EACR,GAAGlF,CAAK,+BAA+BuF,CAAY,UAAU,OAAOF,CAAK,EAAA,EAG7E,GAAIA,EAAQ,IAAMA,EAAQC,EACxB,MAAM,IAAIJ,EACR,GAAGlF,CAAK,sBAAsBuF,CAAY,QAAQD,CAAG,UAAUD,CAAK,EAAA,CAG1E,CAEA,SAASG,EAAaxF,EAAeqF,EAAqB,CACxD,GAAI,CAAC,OAAO,UAAUA,CAAK,GAAKA,EAAQ,GAAKA,EAAQR,EACnD,MAAM,IAAIK,EACR,GAAGlF,CAAK,mDAAmD6E,CAAU,UAAUQ,CAAK,EAAA,CAG1F,CAUA,SAASI,GAAiBzF,EAAeqF,EAAiB,CACxD,GAAI,CAACL,GAAgB,KAAKK,CAAK,EAC7B,MAAM,IAAIH,EACR,GAAGlF,CAAK,8DAA8DqF,CAAK,GAAA,EAG/E,OAAOA,EAAM,YAAA,CACf,CAeA,SAASK,GAAyBC,EAAmC,CACnE,GAAI,CAACC,EAAAA,UAAUD,EAAiB,CAAE,OAAQ,EAAA,CAAO,EAC/C,MAAM,IAAIT,EACR,+DAA+DS,CAAe,GAAA,EAGlF,MAAME,EAAaF,EAAgB,YAAA,EACnC,GAAIE,IAAeC,EAAAA,YACjB,MAAM,IAAIZ,EACR,yGAAA,EAGJ,OAAOW,CACT,CAWO,MAAME,GAAmC,CAC9C,CAAE,KAAM,SAAU,KAAM,SAAA,EACxB,CAAE,KAAM,UAAW,KAAM,SAAA,EACzB,CAAE,KAAM,WAAY,KAAM,SAAA,EAC1B,CAAE,KAAM,sBAAuB,KAAM,SAAA,EACrC,CAAE,KAAM,oBAAqB,KAAM,QAAA,EACnC,CAAE,KAAM,aAAc,KAAM,QAAA,EAC5B,CAAE,KAAM,yBAA0B,KAAM,QAAA,EACxC,CAAE,KAAM,8BAA+B,KAAM,QAAA,EAC7C,CAAE,KAAM,wBAAyB,KAAM,QAAA,EACvC,CAAE,KAAM,mBAAoB,KAAM,QAAA,CACpC,EAyBO,SAASC,GACdxE,EACK,CAEL,GADA4D,EAAoB,UAAW5D,EAAM,QAASuD,GAAa,SAAS,EAChEvD,EAAM,UAAY,GACpB,MAAM,IAAI0D,EACR,0EAAA,EAGJ,MAAMe,EAAWP,GAAyBlE,EAAM,eAAe,EACzD0E,EAAsBT,GAC1B,sBACAjE,EAAM,mBAAA,EAgBR,GAdA4D,EACE,oBACA5D,EAAM,kBACNsD,EACA,QAAA,EAEFM,EAAoB,aAAc5D,EAAM,WAAYsD,EAAY,QAAQ,EACxEU,EAAa,yBAA0BhE,EAAM,sBAAsB,EACnEgE,EACE,8BACAhE,EAAM,2BAAA,EAERgE,EAAa,wBAAyBhE,EAAM,qBAAqB,EACjEgE,EAAa,mBAAoBhE,EAAM,gBAAgB,EACnDA,EAAM,iBAAmByD,EAC3B,MAAM,IAAIC,EACR,qCAAqCD,CAAsB,KACtDzD,EAAM,gBAAgB,uCAAA,EAM/B,OAAO2E,EAAAA,oBAAoBJ,GAAkC,CAC3DrB,GACAlD,EAAM,QACNyE,EACAC,EACA1E,EAAM,kBACNA,EAAM,WACNA,EAAM,uBACNA,EAAM,4BACNA,EAAM,sBACNA,EAAM,gBAAA,CACP,CACH,CAYO,SAAS4E,GAAwB5E,EAAmC,CACzE,OAAOmD,EAAAA,UAAUqB,GAA+BxE,CAAK,CAAC,CACxD,CC3UO,MAAM6E,WAA+B,KAAM,CAChD,YACWC,EACAC,EACT,CACA,MACE,iFACsBD,CAAqB,4BACtCC,CAAqB,gGAAA,EANnB,KAAA,sBAAAD,EACA,KAAA,sBAAAC,EAQT,KAAK,KAAO,wBACd,CACF,CAUO,MAAMC,UAAgC,KAAM,CACjD,YAAY7F,EAAiB,CAC3B,MAAMA,CAAO,EACb,KAAK,KAAO,yBACd,CACF,CASO,MAAM8F,WAAiC,KAAM,CAClD,YACWC,EAEAC,EAEAC,EAAsC,CAAA,EAC/C,CACA,MACE,wEACMF,CAAe,0BAClBE,EAAiB,OAAS,EACvB,GAAGA,EAAiB,MAAM,8DACFA,EAAiB,KAAK,KAAK,CAAC,KACpD,IACJ,sBAAsBD,EAAiB,KAAK,KAAK,CAAC,EAAA,EAb7C,KAAA,gBAAAD,EAEA,KAAA,iBAAAC,EAEA,KAAA,iBAAAC,EAWT,KAAK,KAAO,0BACd,CACF,CAWO,MAAMC,WAAkC,KAAM,CACnD,YAAqBC,EAAmC,CACtD,MACE,GAAGA,EAAe,MAAM,4HAEPA,EAAe,KAAK,KAAK,CAAC,2BAAA,EAJ1B,KAAA,eAAAA,EAMnB,KAAK,KAAO,2BACd,CACF,CAeO,MAAMC,WAAwC,KAAM,CACzD,YACWC,EACAJ,EACT,CACA,MACE,uCAAuCI,CAAY,UAC9CJ,EAAiB,MAAM,wGAEvBA,EAAiB,KAAK,KAAK,CAAC,iKAAA,EAP1B,KAAA,aAAAI,EACA,KAAA,iBAAAJ,EAUT,KAAK,KAAO,iCACd,CACF,CAUO,MAAMK,UAAkC,KAAM,CACnD,YAAYtG,EAAiB,CAC3B,MAAM,GAAGA,CAAO,2BAA2B,EAC3C,KAAK,KAAO,2BACd,CACF,CC7DA,eAAsBuG,GACpB1F,EAC4C,CAC5C,KAAM,CAAE,OAAA2F,EAAQ,mBAAAC,EAAoB,oBAAAlG,CAAA,EAAwBM,EAEtD6F,EAAa/F,EAAAA,eAAeJ,CAAmB,EAC/C4B,EAASP,EAAAA,uBAAuB8E,CAAU,EAChD,GAAIvE,IAAW,OACb,MAAM,IAAI0D,EACR,2LAAA,EAOJ,MAAMc,EAAaxE,EAAO,KAC1B,GAAIwE,IAAe,EACjB,MAAM,IAAId,EACR,0GAAA,EAKJ,MAAMe,EAAmBC,GAAAA,4BAA4BH,CAAU,EAEzDI,EAAO,MAAMC,GAAAA,gBAAgBP,EAAQ,CAIzC,mBAAoBQ,EAAAA,gBAClBC,EAAAA,wBAAwBR,CAAkB,CAAA,EAE5C,iBAAAG,CAAA,CACD,EAKD,GAAI,CACF,MAAMM,EAAkB,MAAMC,EAAAA,iBAAiBL,CAAI,EACnD,IAAInB,EACJ,GAAI,CACFA,EAAwByB,EAAAA,gBAAgBC,UAAOH,CAAe,CAAC,CACjE,QAAA,CACEA,EAAgB,KAAK,CAAC,CACxB,CACA,GAAIvB,IAA0BxD,EAAO,KACnC,MAAM,IAAIuD,GAAuBC,EAAuBxD,EAAO,IAAI,CAEvE,OAAS/B,EAAK,CACZ,MAAA0G,EAAK,KAAK,CAAC,EACL1G,CACR,CAKA,KAAM,CAAE,UAAAkH,CAAA,EAAc,MAAMC,GAAAA,sBAAsBT,EAAMH,CAAU,EAElE,MAAO,CAAE,WAAAA,EAAY,UAAAW,EAAW,eAAgBnF,EAAO,IAAA,CACzD,CC7BO,SAASqF,GACd3G,EACwB,CACxB,KAAM,CAAE,iBAAA4G,EAAkB,eAAAC,EAAgB,mBAAAC,CAAA,EAAuB9G,EACjE,GAAI,CAAC,OAAO,UAAU4G,CAAgB,GAAKA,EAAmB,EAC5D,MAAM,IAAI,MACR,gFAAgFA,CAAgB,EAAA,EAGpG,GAAIC,EAAe,SAAW,EAC5B,MAAM,IAAI,MACR,8EAAA,EAGJ,GAAIC,EAAmB,SAAW,EAChC,MAAM,IAAI,MACR,0EAAA,EAIJ,MAAMC,EAAqC,CAAA,EAC3C,UAAW3E,KAAUyE,EACnB,UAAWG,KAAgBF,EACzBC,EAAW,KAAK,CACd,iBAAAH,EACA,eAAgBxE,EAChB,aAAA4E,CAAA,CACD,EAGL,OAAOD,CACT,CAwBO,SAASE,GACdC,EACQ,CACR,MAAO,GAAGA,EAAW,IAAI,KAAKA,EAAW,OAAO,KAAKA,EAAW,MAAM,GACxE,CAGO,SAASC,EACdC,EACQ,CACR,KAAM,CAAE,aAAAJ,GAAiBI,EACzB,MACE,QAAQA,EAAU,gBAAgB,aACtBA,EAAU,eAAe,OAAO,YACjCJ,EAAa,sBAAsB,gBAC/BA,EAAa,2BAA2B,OACjDA,EAAa,aAAa,EAEpC,CChIA,MAAMK,EAA0B,EA6EhC,SAASC,GACPC,EACAC,EACQ,CACR,OAAO,KAAK,UAAU,CAAE,MAAAD,EAAO,aAAAC,CAAA,EAAgB,CAACC,EAAM5D,IACpD,OAAOA,GAAU,SAAW,GAAGA,CAAK,GAAKA,CAAA,CAE7C,CAUA,SAAS6D,GAAeN,EAAyC,CAC/D,KAAM,CAAE,eAAgBhF,EAAQ,aAAA4E,CAAA,EAAiBI,EACjD,MAAO,CACLA,EAAU,iBACVJ,EAAa,sBAAsB,OACnCA,EAAa,8BAA8B,OAC3C5E,EAAO,cACPA,EAAO,YACPA,EAAO,gBACPA,EAAO,eAAA,EACP,KAAK,GAAG,CACZ,CAkBA,eAAeuF,GACbP,EACsB,CACtB,KAAM,CAAE,eAAgBhF,EAAQ,aAAA4E,CAAA,EAAiBI,EAG3CpG,EAASgG,EAAa,sBAAsB,OAC5C/F,EAAS+F,EAAa,8BAA8B,OACpD,CAAC9F,EAAqBE,EAAawG,CAAY,EAAI,MAAM,QAAQ,IAAI,CACzEzG,EAAAA,qBACEiG,EAAU,iBACVpG,EACAC,EACAmB,EAAO,cACPA,EAAO,YACPA,EAAO,eAAA,EAETf,EAAAA,mBACE+F,EAAU,iBACVpG,EACAC,EACAmB,EAAO,eAAA,EAETb,EAAAA,qBAAqB6F,EAAU,gBAAgB,CAAA,CAChD,EACKS,GAAiBD,GAAA,YAAAA,EAAc,QAAS,GAE9C,GAAI1G,GAAuB,GACzB,MAAM,IAAIuE,EACR,kDAAkDvE,CAAmB,sBAAsBkG,EAAU,gBAAgB,EAAA,EAGzH,GAAIhG,GAAe,GACjB,MAAM,IAAIqE,EACR,0CAA0CrE,CAAW,sBAAsBgG,EAAU,gBAAgB,EAAA,EAGzG,GAAIS,EAAiB,GACnB,MAAM,IAAIpC,EACR,2CAA2CoC,CAAc,sBAAsBT,EAAU,gBAAgB,EAAA,EAI7G,MAAO,CAAE,oBAAAlG,EAAqB,YAAAE,EAAa,eAAAyG,CAAA,CAC7C,CA0CA,eAAsBC,GACpB9H,EACuC,CACvC,KAAM,CACJ,UAAAyG,EACA,oBAAA/G,EACA,mBAAAkG,EACA,eAAA/C,EACA,2BAAAkF,EACA,QAAAC,EACA,WAAAjB,EACA,mBAAAkB,CAAA,EACEjI,EAEJ,GAAIyG,EAAU,SAAW,EACvB,MAAM,IAAI,MACR,2DAAA,EAGJ,GAAIM,EAAW,SAAW,EACxB,MAAM,IAAI,MAAM,kDAAkD,EAOpE,MAAMmB,EACJ9B,EAAAA,wBAAwBR,CAAkB,EAEtCC,EAAa/F,EAAAA,eAAeJ,CAAmB,EAC/C4B,EAASP,EAAAA,uBAAuB8E,CAAU,EAChD,GAAIvE,IAAW,OACb,MAAM,IAAI0D,EACR,oIAAA,EAMJ,GAAI1D,EAAO,OAASmF,EAAU,OAC5B,MAAM,IAAI,MACR,2BAA2BA,EAAU,MAAM,oEACCnF,EAAO,IAAI,8BAChCA,EAAO,IAAI,0CAAA,EAItC,MAAM6G,EAAUtI,EAAAA,YAAY,QAAQgG,CAAU,EAAE,KAC1CuC,EAAqB3B,EAAU,IAAI,CAAC4B,EAAGtJ,IAAM,OAAOoJ,EAAQpJ,CAAC,EAAE,KAAK,CAAC,EACrEyD,EAAe1C,EAAAA,eACnBe,EAAAA,mBAAmBgF,CAAU,CAAA,EAC7B,YAAA,EAEIyC,MAAkB,IAClBC,EAKA,CAAA,EACAC,EAAuB,CAAA,EAIvBC,EAA8B,CAAA,EACpC,IAAIC,EAAmB,EAEvB,UAAWtB,KAAaL,EACtB,GAAI,CACF,MAAM4B,EAAWjB,GAAeN,CAAS,EACzC,IAAIwB,EAASN,EAAY,IAAIK,CAAQ,EACjCC,IAAW,SACbA,EAAS,MAAMjB,GAAmBP,CAAS,EAC3CkB,EAAY,IAAIK,EAAUC,CAAM,GAElC,MAAMC,EACJD,EAAO,oBAAsBA,EAAO,YAAcA,EAAO,eACrDpB,EAAeY,EAAmB,IAAKvE,GAAUA,EAAQgF,CAAO,EAMhEC,EAAatB,EAAa,UAAWuB,GAAWA,GAAU,EAAE,EAClE,GAAID,IAAe,GACjB,MAAM,IAAIE,EAAAA,wBACR,eAAeF,CAAU,WAAWV,EAAmBU,CAAU,CAAC,0CACvBD,CAAO,+CACnBrB,EAAasB,CAAU,CAAC,GAAA,EAI3D,KAAM,CAAE,eAAgB1G,EAAQ,aAAA4E,CAAA,EAAiBI,EAC3CG,EAAQ,MAAM9G,EAAwB,CAC1C,iBAAkB2G,EAAU,iBAC5B,SAAUX,EAAU,IAAI,CAACwC,EAAUlK,MAAO,CACxC,SAAAkK,EACA,OAAQzB,EAAazI,EAAC,CAAA,EACtB,EACF,oBAAqB8G,EACrB,mBAAoBqC,EACpB,uBAAwBlB,EAAa,uBACrC,sBAAuBA,EAAa,sBACpC,8BACEA,EAAa,8BACf,gBAAiB5E,EAAO,gBACxB,gBAAiBA,EAAO,gBACxB,cAAeA,EAAO,cACtB,YAAaA,EAAO,YACpB,cAAeA,EAAO,cACtB,eAAgBA,EAAO,eACvB,eAAgBA,EAAO,eACvB,aAAAI,EACA,eAAAK,EACA,2BAAAkF,EACA,QAAAC,CAAA,CACD,EAEDO,EAAU,KAAK,CACb,UAAAnB,EACA,MAAAG,EACA,aAAAC,EACA,YAAaF,GAAiBC,EAAOC,CAAY,CAAA,CAClD,CACH,OAASjI,EAAK,CAIZ,GAAIA,aAAekG,EACjB,MAAMlG,EAER,MAAM2J,EAAQ/B,EAA6BC,CAAS,EAC9ChI,EAASG,aAAe,MAAQA,EAAI,QAAU,OAAOA,CAAG,EAC1DA,aAAeyJ,EAAAA,wBAIbR,EAAW,OAASnB,GACtBmB,EAAW,KAAK,IAAIU,CAAK,KAAK9J,CAAM,EAAE,GAMxCsJ,IACID,EAAkB,OAASpB,GAC7BoB,EAAkB,KAAK,GAAGS,CAAK,KAAK9J,CAAM,GAAG,EAGnD,CAKF,MAAM+J,GAAWlB,EAAmB,OAASS,EACvCU,EAAO,CACX,GAAGnB,EAAmB,IAAIhB,EAAyB,EACnD,GAAGwB,CAAA,EAGL,GAAIF,EAAU,SAAW,EACvB,MAAM,IAAItD,GAAyB8B,EAAW,OAAQyB,EAAYY,CAAI,EAQxE,GADiB,IAAI,IAAIb,EAAU,IAAK1G,GAAMA,EAAE,WAAW,CAAC,EAC/C,KAAO,EAClB,MAAM,IAAIwD,GACRkD,EAAU,IAAK1G,GAAMsF,EAA6BtF,EAAE,SAAS,CAAC,CAAA,EAMlE,GAAIsH,GAAW,EACb,MAAM,IAAI5D,GACR4B,EAA6BoB,EAAU,CAAC,EAAE,SAAS,EACnDa,CAAA,EAIJ,MAAO,CACL,UAAWb,EAAU,CAAC,EAAE,UACxB,MAAOA,EAAU,CAAC,EAAE,MACpB,aAAcA,EAAU,CAAC,EAAE,aAC3B,eAAgBjH,EAAO,KACvB,gBAAiByF,EAAW,OAC5B,kBAAmBwB,EAAU,IAAK1G,GAAMA,EAAE,SAAS,CAAA,CAEvD,CCnXO,SAASwH,GACdC,EACAC,EAC0B,CAC1B,KAAM,CACJ,SAAAC,EACA,mBAAA5D,EACA,sBAAA6D,EACA,oBAAA/J,EACA,UAAA+G,EACA,QAAAuB,CAAA,EACEuB,EAEE,CAAE,UAAAnC,EAAW,aAAAI,CAAA,EAAiB8B,EAC9B,CAAE,eAAAzC,EAAgB,aAAAG,CAAA,EAAiBI,EAEzC,GAAIX,EAAU,SAAWe,EAAa,OACpC,MAAM,IAAI,MACR,mBAAmBf,EAAU,MAAM,oBAC9Be,EAAa,MAAM,uGAAA,EAI5B,GACE,CAAC,OAAO,UAAUgC,CAAQ,GAC1BA,EAAW,GACXA,GAAYhC,EAAa,OAEzB,MAAM,IAAI,MACR,4BAA4BgC,CAAQ,0CACtBhC,EAAa,MAAM,YAAA,EAOrC,MAAMkC,EAAQlC,EAAa,IAAI,CAACuB,EAAQY,KAAW,CACjD,SAAUC,EAAAA,gBAAgBnD,EAAUkD,CAAK,CAAC,EAC1C,OAAAZ,EACA,SAAUY,CAAA,EACV,EAEIhH,EAAyB,CAC7B,iBAAkByE,EAAU,iBAC5B,SAAUsC,EAAMF,CAAQ,EAAE,SAC1B,SAAAA,EACA,sBAAuB3C,EAAe,QACtC,uBAAwBG,EAAa,uBACrC,4BAA6BA,EAAa,4BAC1C,cAAeA,EAAa,cAC5B,sBAAAyC,EACA,OAAQjC,EAAagC,CAAQ,EAC7B,sBAAuB9J,EACvB,mBAAAkG,EACA,MAAA8D,CAAA,EAGIG,EAAiC,CACrC,oBAAqB7C,EAAa,uBAClC,mBAAoBA,EAAa,sBACjC,2BAA4BA,EAAa,8BACzC,eAAgBH,EAAe,eAC/B,QAASA,EAAe,gBACxB,gBAAiBA,EAAe,gBAGhC,oBAAqBG,EAAa,sBAAsB,OACxD,cAAeH,EAAe,cAC9B,YAAaA,EAAe,YAC5B,QAAAmB,CAAA,EAGF,MAAO,CAAE,MAAArF,EAAO,QAAAkH,CAAA,CAClB"}