vendor: 4,652 bytes, line 1
1"use strict";(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[5110],{45110:function(t,e,r){r.d(e,{secp256k1:function(){return tO}});var n=r(57658),i=r(88186);class o extends i.kb{constructor(t,e){super(),this.finished=!1,this.destroyed=!1,(0,i.z3)(t);let r=(0,i.O0)(e);if(this.iHash=t.create(),"function"!=typeof this.iHash.update)throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let n=this.blockLen,o=new Uint8Array(n);o.set(r.length>n?t.create().update(r).digest():r);for(let t=0;t<o.length;t++)o[t]^=54;this.iHash.update(o),this.oHash=t.create();for(let t=0;t<o.length;t++)o[t]^=106;this.oHash.update(o),(0,i.ru)(o)}update(t){return(0,i.$h)(this),this.iHash.update(t),this}digestInto(t){(0,i.$h)(this),(0,i.gk)(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){let t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));let{oHash:e,iHash:r,finished:n,destroyed:i,blockLen:o,outputLen:s}=this;return t.finished=n,t.destroyed=i,t.blockLen=o,t.outputLen=s,t.oHash=e._cloneInto(t.oHash),t.iHash=r._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}let s=(t,e,r)=>new o(t,e).update(r).digest();s.create=(t,e)=>new o(t,e);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */let l=BigInt(0),f=BigInt(1);function a(t,e=""){if("boolean"!=typeof t)throw Error((e&&`"${e}"`)+"expected boolean, got type="+typeof t);return t}function u(t,e,r=""){let n=(0,i._t)(t),o=t?.length,s=void 0!==e;if(!n||s&&o!==e)throw Error((r&&`"${r}" `)+"expected Uint8Array"+(s?` of length ${e}`:"")+", got "+(n?`length=${o}`:`type=${typeof t}`));return t}function d(t){let e=t.toString(16);return 1&e.length?"0"+e:e}function c(t){if("string"!=typeof t)throw Error("hex string expected, got "+typeof t);return""===t?l:BigInt("0x"+t)}function h(t){return c((0,i.ci)(t))}function g(t){return(0,i.gk)(t),c((0,i.ci)(Uint8Array.from(t).reverse()))}function p(t,e){return(0,i.nr)(t.toString(16).padStart(2*e,"0"))}function m(t,e){return p(t,e).reverse()}function y(t,e,r){let n;if("string"==typeof e)try{n=(0,i.nr)(e)}catch(e){throw Error(t+" must be hex string or Uint8Array, cause: "+e)}else if((0,i._t)(e))n=Uint8Array.from(e);else throw Error(t+" must be hex string or Uint8Array");let o=n.length;if("number"==typeof r&&o!==r)throw Error(t+" of length "+r+" expected, got "+o);return n}let w=t=>"bigint"==typeof t&&l<=t;function b(t){let e;for(e=0;t>l;t>>=f,e+=1);return e}let E=t=>(f<<BigInt(t))-f;function B(t,e,r={}){if(!t||"object"!=typeof t)throw Error("expected valid options object");function n(e,r,n){let i=t[e];if(n&&void 0===i)return;let o=typeof i;if(o!==r||null===i)throw Error(`param "${e}" is invalid: expected ${r}, got ${o}`)}Object.entries(e).forEach(([t,e])=>n(t,e,!1)),Object.entries(r).forEach(([t,e])=>n(t,e,!0))}function v(t){let e=new WeakMap;return(r,...n)=>{let i=e.get(r);if(void 0!==i)return i;let o=t(r,...n);return e.set(r,o),o}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */let O=BigInt(0),x=BigInt(1),R=BigInt(2),I=BigInt(3),S=BigInt(4),q=BigInt(5),A=BigInt(7),N=BigInt(8),V=BigInt(9),F=BigInt(16);function Z(t,e){let r=t%e;return r>=O?r:e+r}function U(t,e,r){let n=t;for(;e-- >O;)n*=n,n%=r;return n}function H(t,e){if(t===O)throw Error("invert: expected non-zero number");if(e<=O)throw Error("invert: expected positive modulus, got "+e);let r=Z(t,e),n=e,i=O,o=x,s=x,l=O;for(;r!==O;){let t=n/r,e=n%r,f=i-s*t,a=o-l*t;n=r,r=e,i=s,o=l,s=f,l=a}if(n!==x)throw Error("invert: does not exist");return Z(i,e)}function P(t,e,r){if(!t.eql(t.sqr(e),r))throw Error("Cannot find square root")}function C(t,e){let r=(t.ORDER+x)/S,n=t.pow(e,r);return P(t,n,e),n}function L(t,e){let r=(t.ORDER-q)/N,n=t.mul(e,R),i=t.pow(n,r),o=t.mul(e,i),s=t.mul(t.mul(o,R),i),l=t.mul(o,t.sub(s,t.ONE));return P(t,l,e),l}function k(t){if(t<I)throw Error("sqrt is not defined for small field");let e=t-x,r=0;for(;e%R===O;)e/=R,r++;let n=R,i=$(t);for(;1===_(i,n);)if(n++>1e3)throw Error("Cannot find square root: probably non-prime P");if(1===r)return C;let o=i.pow(n,e),s=(e+x)/R;return function(t,n){if(t.is0(n))return n;if(1!==_(t,n))throw Error("Cannot find square root");let i=r,l=t.mul(t.ONE,o),f=t.pow(n,e),a=t.pow(n,s);for(;!t.eql(f,t.ONE);){if(t.is0(f))return t.ZERO;let e=1,r=t.sqr(f);for(;!t.eql(r,t.ONE);)if(e++,r=t.sqr(r),e===i)throw Error("Cannot find square root");let n=x<<BigInt(i-e-1),o=t.pow(l,n);
vendor: 4,401 bytes, line 1
1i=e,l=t.sqr(o),f=t.mul(f,l),a=t.mul(a,o)}return a}}let j=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function K(t,e,r=!1){let n=Array(e.length).fill(r?t.ZERO:void 0),i=e.reduce((e,r,i)=>t.is0(r)?e:(n[i]=e,t.mul(e,r)),t.ONE),o=t.inv(i);return e.reduceRight((e,r,i)=>t.is0(r)?e:(n[i]=t.mul(e,n[i]),t.mul(e,r)),o),n}function _(t,e){let r=(t.ORDER-x)/R,n=t.pow(e,r),i=t.eql(n,t.ONE),o=t.eql(n,t.ZERO),s=t.eql(n,t.neg(t.ONE));if(!i&&!o&&!s)throw Error("invalid Legendre symbol result");return i?1:o?0:-1}function T(t,e){void 0!==e&&(0,i.k8)(e);let r=void 0!==e?e:t.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function $(t,e,r=!1,n={}){let i,o,s,l;if(t<=O)throw Error("invalid field: expected ORDER > 0, got "+t);let f=!1;if("object"==typeof e&&null!=e){if(n.sqrt||r)throw Error("cannot specify opts in two arguments");e.BITS&&(o=e.BITS),e.sqrt&&(s=e.sqrt),"boolean"==typeof e.isLE&&(r=e.isLE),"boolean"==typeof e.modFromBytes&&(f=e.modFromBytes),l=e.allowedLengths}else"number"==typeof e&&(o=e),n.sqrt&&(s=n.sqrt);let{nBitLength:a,nByteLength:u}=T(t,o);if(u>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let d=Object.freeze({ORDER:t,isLE:r,BITS:a,BYTES:u,MASK:E(a),ZERO:O,ONE:x,allowedLengths:l,create:e=>Z(e,t),isValid:e=>{if("bigint"!=typeof e)throw Error("invalid field element: expected bigint, got "+typeof e);return O<=e&&e<t},is0:t=>t===O,isValidNot0:t=>!d.is0(t)&&d.isValid(t),isOdd:t=>(t&x)===x,neg:e=>Z(-e,t),eql:(t,e)=>t===e,sqr:e=>Z(e*e,t),add:(e,r)=>Z(e+r,t),sub:(e,r)=>Z(e-r,t),mul:(e,r)=>Z(e*r,t),pow:(t,e)=>(function(t,e,r){if(r<O)throw Error("invalid exponent, negatives unsupported");if(r===O)return t.ONE;if(r===x)return e;let n=t.ONE,i=e;for(;r>O;)r&x&&(n=t.mul(n,i)),i=t.sqr(i),r>>=x;return n})(d,t,e),div:(e,r)=>Z(e*H(r,t),t),sqrN:t=>t*t,addN:(t,e)=>t+e,subN:(t,e)=>t-e,mulN:(t,e)=>t*e,inv:e=>H(e,t),sqrt:s||(e=>(!i&&(i=t%S===I?C:t%N===q?L:t%F===V?function(t){let e=$(t),r=k(t),n=r(e,e.neg(e.ONE)),i=r(e,n),o=r(e,e.neg(n)),s=(t+A)/F;return(t,e)=>{let r=t.pow(e,s),l=t.mul(r,n),f=t.mul(r,i),a=t.mul(r,o),u=t.eql(t.sqr(l),e),d=t.eql(t.sqr(f),e);r=t.cmov(r,l,u),l=t.cmov(a,f,d);let c=t.eql(t.sqr(l),e),h=t.cmov(r,l,c);return P(t,h,e),h}}(t):k(t)),i(d,e))),toBytes:t=>r?m(t,u):p(t,u),fromBytes:(e,n=!0)=>{if(l){if(!l.includes(e.length)||e.length>u)throw Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);let t=new Uint8Array(u);t.set(e,r?0:t.length-e.length),e=t}if(e.length!==u)throw Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);let i=r?g(e):h(e);if(f&&(i=Z(i,t)),!n&&!d.isValid(i))throw Error("invalid field element: outside of range 0..ORDER");return i},invertBatch:t=>K(d,t),cmov:(t,e,r)=>r?e:t});return Object.freeze(d)}function D(t){if("bigint"!=typeof t)throw Error("field order must be bigint");return Math.ceil(t.toString(2).length/8)}function z(t){let e=D(t);return e+Math.ceil(e/2)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */let Y=BigInt(0),M=BigInt(1);function G(t,e){let r=e.negate();return t?r:e}function X(t,e){let r=K(t.Fp,e.map(t=>t.Z));return e.map((e,n)=>t.fromAffine(e.toAffine(r[n])))}function W(t,e){if(!Number.isSafeInteger(t)||t<=0||t>e)throw Error("invalid window size, expected [1.."+e+"], got W="+t)}function J(t,e){W(t,e);let r=Math.ceil(e/t)+1,n=2**(t-1),i=2**t;return{windows:r,windowSize:n,mask:E(t),maxNumber:i,shiftBy:BigInt(t)}}function Q(t,e,r){let{windowSize:n,mask:i,maxNumber:o,shiftBy:s}=r,l=Number(t&i),f=t>>s;l>n&&(l-=o,f+=M);let a=e*n,u=a+Math.abs(l)-1;return{nextN:f,offset:u,isZero:0===l,isNeg:l<0,isNegF:e%2!=0,offsetF:a}}let tt=new WeakMap,te=new WeakMap;function tr(t){return te.get(t)||1}function tn(t){if(t!==Y)throw Error("invalid wNAF")}class ti{constructor(t,e){this.BASE=t.BASE,this.ZERO=t.ZERO,this.Fn=t.Fn,this.bits=e}_unsafeLadder(t,e,r=this.ZERO){let n=t;for(;e>Y;)e&M&&(r=r.add(n)),n=n.double(),e>>=M;return r}precomputeWindow(t,e){let{windows:r,windowSize:n}=J(e,this.bits),i=[],o=t,s=o;for(let t=0;t<r;t++){s=o,i.push(s);for(let t=1;t<n;t++)s=s.add(o),i.push(s);o=s.double()}return i}wNAF(t,e,r){if(!this.Fn.isValid(r))throw Error("invalid scalar");let n=this.ZERO,i=this.BASE,o=J(t,this.bits);for(let t=0;t<o.windows;t++){let{nextN:s,offset:l,isZero:f,isNeg:a,isNegF:u,offsetF:d}=Q(r,t,o);r=s,f?i=i.add(G(u,e[d])):n=n.add(G(a,e[l]))}return tn(r),{p:n,f:i}
vendor: 7,683 bytes, line 1
1}wNAFUnsafe(t,e,r,n=this.ZERO){let i=J(t,this.bits);for(let t=0;t<i.windows&&r!==Y;t++){let{nextN:o,offset:s,isZero:l,isNeg:f}=Q(r,t,i);if(r=o,!l){let t=e[s];n=n.add(f?t.negate():t)}}return tn(r),n}getPrecomputes(t,e,r){let n=tt.get(e);return n||(n=this.precomputeWindow(e,t),1!==t&&("function"==typeof r&&(n=r(n)),tt.set(e,n))),n}cached(t,e,r){let n=tr(t);return this.wNAF(n,this.getPrecomputes(n,t,r),e)}unsafe(t,e,r,n){let i=tr(t);return 1===i?this._unsafeLadder(t,e,n):this.wNAFUnsafe(i,this.getPrecomputes(i,t,r),e,n)}createCache(t,e){W(e,this.bits),te.set(t,e),tt.delete(t)}hasCache(t){return 1!==tr(t)}}function to(t,e,r){if(!e)return $(t,{isLE:r});if(e.ORDER!==t)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return B(e,j.reduce((t,e)=>(t[e]="function",t),{ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"})),e}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */let ts=(t,e)=>(t+(t>=0?e:-e)/th)/e;function tl(t){if(!["compact","recovered","der"].includes(t))throw Error('Signature format must be "compact", "recovered", or "der"');return t}function tf(t,e){let r={};for(let n of Object.keys(e))r[n]=void 0===t[n]?e[n]:t[n];return a(r.lowS,"lowS"),a(r.prehash,"prehash"),void 0!==r.format&&tl(r.format),r}class ta extends Error{constructor(t=""){super(t)}}let tu={Err:ta,_tlv:{encode:(t,e)=>{let{Err:r}=tu;if(t<0||t>256)throw new r("tlv.encode: wrong tag");if(1&e.length)throw new r("tlv.encode: unpadded data");let n=e.length/2,i=d(n);if(i.length/2&128)throw new r("tlv.encode: long form length too big");let o=n>127?d(i.length/2|128):"";return d(t)+o+i+e},decode(t,e){let{Err:r}=tu,n=0;if(t<0||t>256)throw new r("tlv.encode: wrong tag");if(e.length<2||e[n++]!==t)throw new r("tlv.decode: wrong tlv");let i=e[n++],o=0;if(128&i){let t=127&i;if(!t)throw new r("tlv.decode(long): indefinite length not supported");if(t>4)throw new r("tlv.decode(long): byte length is too big");let s=e.subarray(n,n+t);if(s.length!==t)throw new r("tlv.decode: length bytes not complete");if(0===s[0])throw new r("tlv.decode(long): zero leftmost byte");for(let t of s)o=o<<8|t;if(n+=t,o<128)throw new r("tlv.decode(long): not minimal encoding")}else o=i;let s=e.subarray(n,n+o);if(s.length!==o)throw new r("tlv.decode: wrong value length");return{v:s,l:e.subarray(n+o)}}},_int:{encode(t){let{Err:e}=tu;if(t<td)throw new e("integer: negative integers are not allowed");let r=d(t);if(8&Number.parseInt(r[0],16)&&(r="00"+r),1&r.length)throw new e("unexpected DER parsing assertion: unpadded hex");return r},decode(t){let{Err:e}=tu;if(128&t[0])throw new e("invalid signature integer: negative");if(0===t[0]&&!(128&t[1]))throw new e("invalid signature integer: unnecessary leading zero");return h(t)}},toSig(t){let{Err:e,_int:r,_tlv:n}=tu,i=y("signature",t),{v:o,l:s}=n.decode(48,i);if(s.length)throw new e("invalid signature: left bytes after parsing");let{v:l,l:f}=n.decode(2,o),{v:a,l:u}=n.decode(2,f);if(u.length)throw new e("invalid signature: left bytes after parsing");return{r:r.decode(l),s:r.decode(a)}},hexFromSig(t){let{_tlv:e,_int:r}=tu,n=e.encode(2,r.encode(t.r)),i=e.encode(2,r.encode(t.s));return e.encode(48,n+i)}},td=BigInt(0),tc=BigInt(1),th=BigInt(2),tg=BigInt(3),tp=BigInt(4);function tm(t,e){let r;let{BYTES:n}=t;if("bigint"==typeof e)r=e;else{let i=y("private key",e);try{r=t.fromBytes(i)}catch(t){throw Error(`invalid private key: expected ui8a of size ${n}, got ${typeof e}`)}}if(!t.isValidNot0(r))throw Error("invalid private key: out of range [1..N-1]");return r}function ty(t){return Uint8Array.of(t?2:3)}function tw(t,e){return{secretKey:e.BYTES,publicKey:1+t.BYTES,publicKeyUncompressed:1+2*t.BYTES,publicKeyHasPrefix:!0,signature:2*e.BYTES}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */let tb={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},tE={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},tB=BigInt(2),tv=$(tb.p,{sqrt:function(t){let e=tb.p,r=BigInt(3),n=BigInt(6),i=BigInt(11),o=BigInt(22),s=BigInt(23),l=BigInt(44),f=BigInt(88),a=t*t*t%e,u=a*a*t%e,d=U(u,r,e)*u%e,c=U(d,r,e)*u%e,h=U(c,tB,e)*a%e,g=U(h,i,e)*h%e,p=U(g,o,e)*g%e,m=U(p,l,e)*p%e,y=U(m,f,e)*m%e,w=U(y,l,e)*p%e,b=U(w,r,e)*u%e,E=U(b,s,e)*g%e,B=U(E,n,e)*a%e,v=U(B,tB,e);if(!tv.eql(tv.sqr(v),t))throw Error("Cannot find square root");return v}}),tO=function(t,e){let r=e=>(function(t){let{CURVE:e,curveOpts:r,hash:n,ecdsaOpts:o}=function(t){let{CURVE:e,curveOpts:r}=function(t){let e={a:t.a,b:t.b,p:t.Fp.ORDER,n:t.n,h:t.h,Gx:t.Gx,Gy:t.Gy},r=t.Fp,n=t.allowedPrivateKeyLengths?Array.from(new Set(t.allowedPrivateKeyLengths.map(t=>Math.ceil(t/2)))):void 0,i={Fp:r,Fn:$(e.n,{BITS:t.nBitLength,allowedLengths:n,modFromBytes:t.wrapPrivateKey}),allowInfinityPoint:t.allowInfinityPoint,endo:t.endo,isTorsionFree:t.isTorsionFree,clearCofactor:t.clearCofactor,fromBytes:t.fromBytes,toBytes:t.toBytes};return{CURVE:e,curveOpts:i}}(t),n={hmac:t.hmac,randomBytes:t.randomBytes,lowS:t.lowS,bits2int:t.bits2int,bits2int_modN:t.bits2int_modN};return{CURVE:e,curveOpts:r,hash:t.hash,ecdsaOpts:n}}(t);return function(t,e){let r=e.Point;return Object.assign({},e,{ProjectivePoint:r,CURVE:Object.assign({},t,T(r.Fn.ORDER,r.Fn.BITS))})}(t,function(t,e,r={}){(0,i.z3)(e),B(r,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});let n=r.randomBytes||i.O6,o=r.hmac||((t,...r)=>s(e,t,(0,i.eV)(...r))),{Fp:l,Fn:f}=t,{ORDER:a,BITS:d}=f,{keygen:c,getPublicKey:b,getSharedSecret:v,utils:O,lengths:R}=function(t,e={}){let{Fn:r}=t,n=e.randomBytes||i.O6,o=Object.assign(tw(t.Fp,r),{seed:z(r.ORDER)});function s(t){try{return!!tm(r,t)}catch(t){return!1}}function l(t=n(o.seed)){return function(t,e,r=!1){let n=t.length,i=D(e),o=z(e);if(n<16||n<o||n>1024)throw Error("expected "+o+"-1024 bytes of input, got "+n);let s=Z(r?g(t):h(t),e-x)+x;return r?m(s,i):p(s,i)}(u(t,o.seed,"seed"),r.ORDER)}function f(e,n=!0){return t.BASE.multiply(tm(r,e)).toBytes(n)}function a(e){if("bigint"==typeof e)return!1;if(e instanceof t)return!0;let{secretKey:n,publicKey:i,publicKeyUncompressed:s}=o;if(r.allowedLengths||n===i)return;let l=y("key",e).length;return l===i||l===s}return Object.freeze({getPublicKey:f,getSharedSecret:function(e,n,i=!0){if(!0===a(e))throw Error("first arg must be private key");if(!1===a(n))throw Error("second arg must be public key");let o=tm(r,e);return t.fromHex(n).multiply(o).toBytes(i)},keygen:function(t){let e=l(t);return{secretKey:e,publicKey:f(e)}},Point:t,utils:{isValidSecretKey:s,isValidPublicKey:function(e,r){let{publicKey:n,publicKeyUncompressed:i}=o;try{let o=e.length;if(!0===r&&o!==n||!1===r&&o!==i)return!1;return!!t.fromBytes(e)}catch(t){return!1}},randomSecretKey:l,isValidPrivateKey:s,randomPrivateKey:l,normPrivateKeyToScalar:t=>tm(r,t),precompute:(e=8,r=t.BASE)=>r.precompute(e,!1)},lengths:o})}(t,r),I={prehash:!1,lowS:"boolean"==typeof r.lowS&&r.lowS,format:void 0,extraEntropy:!1},S="compact";function q(t,e){if(!f.isValidNot0(e))throw Error(`invalid signature ${t}: out of range 1..Point.Fn.ORDER`);return e}class A{constructor(t,e,r){this.r=q("r",t),this.s=q("s",e),null!=r&&(this.recovery=r),Object.freeze(this)}static fromBytes(t,e=S){let r;
vendor: 12,824 bytes, line 1
1if(!function(t,e){tl(e);let r=R.signature;u(t,"compact"===e?r:"recovered"===e?r+1:void 0,`${e} signature`)}(t,e),"der"===e){let{r:e,s:r}=tu.toSig(u(t));return new A(e,r)}"recovered"===e&&(r=t[0],e="compact",t=t.subarray(1));let n=f.BYTES,i=t.subarray(0,n),o=t.subarray(n,2*n);return new A(f.fromBytes(i),f.fromBytes(o),r)}static fromHex(t,e){return this.fromBytes((0,i.nr)(t),e)}addRecoveryBit(t){return new A(this.r,this.s,t)}recoverPublicKey(e){let r=l.ORDER,{r:n,s:o,recovery:s}=this;if(null==s||![0,1,2,3].includes(s))throw Error("recovery id invalid");if(a*th<r&&s>1)throw Error("recovery id is ambiguous for h>1 curve");let u=2===s||3===s?n+a:n;if(!l.isValid(u))throw Error("recovery id 2 or 3 invalid");let d=l.toBytes(u),c=t.fromBytes((0,i.eV)(ty((1&s)==0),d)),h=f.inv(u),g=V(y("msgHash",e)),p=f.create(-g*h),m=f.create(o*h),w=t.BASE.multiplyUnsafe(p).add(c.multiplyUnsafe(m));if(w.is0())throw Error("point at infinify");return w.assertValidity(),w}hasHighS(){return this.s>a>>tc}toBytes(t=S){if(tl(t),"der"===t)return(0,i.nr)(tu.hexFromSig(this));let e=f.toBytes(this.r),r=f.toBytes(this.s);if("recovered"===t){if(null==this.recovery)throw Error("recovery bit must be present");return(0,i.eV)(Uint8Array.of(this.recovery),e,r)}return(0,i.eV)(e,r)}toHex(t){return(0,i.ci)(this.toBytes(t))}assertValidity(){}static fromCompact(t){return A.fromBytes(y("sig",t),"compact")}static fromDER(t){return A.fromBytes(y("sig",t),"der")}normalizeS(){return this.hasHighS()?new A(this.r,f.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return(0,i.ci)(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return(0,i.ci)(this.toBytes("compact"))}}let N=r.bits2int||function(t){if(t.length>8192)throw Error("input is too large");let e=h(t),r=8*t.length-d;return r>0?e>>BigInt(r):e},V=r.bits2int_modN||function(t){return f.create(N(t))},F=E(d);function U(t){return!function(t,e,r,n){if(!(w(e)&&w(r)&&w(n))||!(r<=e)||!(e<n))throw Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}("num < 2^"+d,t,td,F),f.toBytes(t)}function H(t,r){return u(t,void 0,"message"),r?u(e(t),void 0,"prehashed message"):t}return Object.freeze({keygen:c,getPublicKey:b,getSharedSecret:v,utils:O,lengths:R,Point:t,sign:function(r,s,l={}){let{seed:u,k2sig:d}=function(e,r,o){if(["recovered","canonical"].some(t=>t in o))throw Error("sign() legacy options not supported");let{lowS:s,prehash:l,extraEntropy:u}=tf(o,I),d=V(e=H(e,l)),c=tm(f,r),h=[U(c),U(d)];if(null!=u&&!1!==u){let t=!0===u?n(R.secretKey):u;h.push(y("extraEntropy",t))}return{seed:(0,i.eV)(...h),k2sig:function(e){let r=N(e);if(!f.isValidNot0(r))return;let n=f.inv(r),i=t.BASE.multiply(r).toAffine(),o=f.create(i.x);if(o===td)return;let l=f.create(n*f.create(d+o*c));if(l===td)return;let u=(i.x===o?0:2)|Number(i.y&tc),h=l;return s&&l>a>>tc&&(h=f.neg(l),u^=1),new A(o,h,u)}}}(r=y("message",r),s,l);return(function(t,e,r){if("number"!=typeof t||t<2)throw Error("hashLen must be a number");if("number"!=typeof e||e<2)throw Error("qByteLen must be a number");if("function"!=typeof r)throw Error("hmacFn must be a function");let n=t=>new Uint8Array(t),o=t=>Uint8Array.of(t),s=n(t),l=n(t),f=0,a=()=>{s.fill(1),l.fill(0),f=0},u=(...t)=>r(l,s,...t),d=(t=n(0))=>{l=u(o(0),t),s=u(),0!==t.length&&(l=u(o(1),t),s=u())},c=()=>{if(f++>=1e3)throw Error("drbg: tried 1000 values");let t=0,r=[];for(;t<e;){let e=(s=u()).slice();r.push(e),t+=s.length}return(0,i.eV)(...r)};return(t,e)=>{let r;for(a(),d(t);!(r=e(c()));)d();return a(),r}})(e.outputLen,f.BYTES,o)(u,d)},verify:function(e,r,n,o={}){let{lowS:s,prehash:l,format:a}=tf(o,I);if(n=y("publicKey",n),r=H(y("message",r),l),"strict"in o)throw Error("options.strict was renamed to lowS");let u=void 0===a?function(t){let e;let r="string"==typeof t||(0,i._t)(t),n=!r&&null!==t&&"object"==typeof t&&"bigint"==typeof t.r&&"bigint"==typeof t.s;if(!r&&!n)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(n)e=new A(t.r,t.s);else if(r){try{e=A.fromBytes(y("sig",t),"der")}catch(t){if(!(t instanceof tu.Err))throw t}if(!e)try{e=A.fromBytes(y("sig",t),"compact")}catch(t){return!1}}return!!e&&e}(e):A.fromBytes(y("sig",e),a);if(!1===u)return!1;try{let e=t.fromBytes(n);if(s&&u.hasHighS())return!1;let{r:i,s:o}=u,l=V(r),a=f.inv(o),d=f.create(l*a),c=f.create(i*a),h=t.BASE.multiplyUnsafe(d).add(e.multiplyUnsafe(c));if(h.is0())return!1;return f.create(h.x)===i}catch(t){return!1}},recoverPublicKey:function(t,e,r={}){let{prehash:n}=tf(r,I);return e=H(e,n),A.fromBytes(t,"recovered").recoverPublicKey(e).toBytes()},Signature:A,hash:e})}(function(t,e={}){let r=function(t,e,r={},n){if(void 0===n&&(n="edwards"===t),!e||"object"!=typeof e)throw Error(`expected valid ${t} CURVE object`);for(let t of["p","n","h"]){let r=e[t];if(!("bigint"==typeof r&&r>Y))throw Error(`CURVE.${t} must be positive bigint`)}let i=to(e.p,r.Fp,n),o=to(e.n,r.Fn,n);for(let r of["Gx","Gy","a","weierstrass"===t?"b":"d"])if(!i.isValid(e[r]))throw Error(`CURVE.${r} must be valid field element of CURVE.Fp`);return{CURVE:e=Object.freeze(Object.assign({},e)),Fp:i,Fn:o}}("weierstrass",t,e),{Fp:n,Fn:o}=r,s=r.CURVE,{h:l,n:f}=s;B(e,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});let{endo:d}=e;if(d&&(!n.is0(s.a)||"bigint"!=typeof d.beta||!Array.isArray(d.basises)))throw Error('invalid endo: expected "beta": bigint and "basises": array');let c=tw(n,o);function h(){if(!n.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}let g=e.toBytes||function(t,e,r){let{x:o,y:s}=e.toAffine(),l=n.toBytes(o);if(a(r,"isCompressed"),!r)return(0,i.eV)(Uint8Array.of(4),l,n.toBytes(s));{h();let t=!n.isOdd(s);return(0,i.eV)(ty(t),l)}},p=e.fromBytes||function(t){u(t,void 0,"Point");let{publicKey:e,publicKeyUncompressed:r}=c,i=t.length,o=t[0],s=t.subarray(1);if(i===e&&(2===o||3===o)){let t;let e=n.fromBytes(s);if(!n.isValid(e))throw Error("bad point: is not on curve, wrong x");let r=m(e);try{t=n.sqrt(r)}catch(t){throw Error("bad point: is not on curve, sqrt error"+(t instanceof Error?": "+t.message:""))}return h(),(1&o)==1!==n.isOdd(t)&&(t=n.neg(t)),{x:e,y:t}}if(i===r&&4===o){let t=n.BYTES,e=n.fromBytes(s.subarray(0,t)),r=n.fromBytes(s.subarray(t,2*t));if(!w(e,r))throw Error("bad point: is not on curve");return{x:e,y:r}}throw Error(`bad point: got length ${i}, expected compressed=${e} or uncompressed=${r}`)};function m(t){let e=n.sqr(t),r=n.mul(e,t);return n.add(n.add(r,n.mul(t,s.a)),s.b)}function w(t,e){let r=n.sqr(e),i=m(t);return n.eql(r,i)}if(!w(s.Gx,s.Gy))throw Error("bad curve params: generator point");let O=n.mul(n.pow(s.a,tg),tp),x=n.mul(n.sqr(s.b),BigInt(27));if(n.is0(n.add(O,x)))throw Error("bad curve params: a or b");function R(t,e,r=!1){if(!n.isValid(e)||r&&n.is0(e))throw Error(`bad point coordinate ${t}`);return e}function I(t){if(!(t instanceof V))throw Error("ProjectivePoint expected")}function S(t){if(!d||!d.basises)throw Error("no endo");return function(t,e,r){let[[n,i],[o,s]]=e,l=ts(s*t,r),f=ts(-i*t,r),a=t-l*n-f*o,u=-l*i-f*s,d=a<td,c=u<td;d&&(a=-a),c&&(u=-u);let h=E(Math.ceil(b(r)/2))+tc;if(a<td||a>=h||u<td||u>=h)throw Error("splitScalar (endomorphism): failed, k="+t);return{k1neg:d,k1:a,k2neg:c,k2:u}}(t,d.basises,o.ORDER)}let q=v((t,e)=>{let{X:r,Y:i,Z:o}=t;if(n.eql(o,n.ONE))return{x:r,y:i};let s=t.is0();null==e&&(e=s?n.ONE:n.inv(o));let l=n.mul(r,e),f=n.mul(i,e),a=n.mul(o,e);if(s)return{x:n.ZERO,y:n.ZERO};if(!n.eql(a,n.ONE))throw Error("invZ was invalid");return{x:l,y:f}}),A=v(t=>{if(t.is0()){if(e.allowInfinityPoint&&!n.is0(t.Y))return;throw Error("bad point: ZERO")}let{x:r,y:i}=t.toAffine();if(!n.isValid(r)||!n.isValid(i))throw Error("bad point: x or y not field elements");if(!w(r,i))throw Error("bad point: equation left != right");if(!t.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function N(t,e,r,i,o){return r=new V(n.mul(r.X,t),r.Y,r.Z),e=G(i,e),r=G(o,r),e.add(r)}class V{constructor(t,e,r){this.X=R("x",t),this.Y=R("y",e,!0),this.Z=R("z",r),Object.freeze(this)}static CURVE(){return s}static fromAffine(t){let{x:e,y:r}=t||{};if(!t||!n.isValid(e)||!n.isValid(r))throw Error("invalid affine point");if(t instanceof V)throw Error("projective point not allowed");return n.is0(e)&&n.is0(r)?V.ZERO:new V(e,r,n.ONE)}static fromBytes(t){let e=V.fromAffine(p(u(t,void 0,"point")));return e.assertValidity(),e}static fromHex(t){return V.fromBytes(y("pointHex",t))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(t=8,e=!0){return Z.createCache(this,t),e||this.multiply(tg),this}assertValidity(){A(this)}hasEvenY(){let{y:t}=this.toAffine();if(!n.isOdd)throw Error("Field doesn't support isOdd");return!n.isOdd(t)}equals(t){I(t);let{X:e,Y:r,Z:i}=this,{X:o,Y:s,Z:l}=t,f=n.eql(n.mul(e,l),n.mul(o,i)),a=n.eql(n.mul(r,l),n.mul(s,i));return f&&a}negate(){return new V(this.X,n.neg(this.Y),this.Z)}double(){let{a:t,b:e}=s,r=n.mul(e,tg),{X:i,Y:o,Z:l}=this,f=n.ZERO,a=n.ZERO,u=n.ZERO,d=n.mul(i,i),c=n.mul(o,o),h=n.mul(l,l),g=n.mul(i,o);return g=n.add(g,g),u=n.mul(i,l),u=n.add(u,u),f=n.mul(t,u),a=n.mul(r,h),a=n.add(f,a),f=n.sub(c,a),a=n.add(c,a),a=n.mul(f,a),f=n.mul(g,f),u=n.mul(r,u),h=n.mul(t,h),g=n.sub(d,h),g=n.mul(t,g),g=n.add(g,u),u=n.add(d,d),d=n.add(u,d),d=n.add(d,h),d=n.mul(d,g),a=n.add(a,d),h=n.mul(o,l),h=n.add(h,h),d=n.mul(h,g),f=n.sub(f,d),u=n.mul(h,c),u=n.add(u,u),new V(f,a,u=n.add(u,u))}add(t){I(t);let{X:e,Y:r,Z:i}=this,{X:o,Y:l,Z:f}=t,a=n.ZERO,u=n.ZERO,d=n.ZERO,c=s.a,h=n.mul(s.b,tg),g=n.mul(e,o),p=n.mul(r,l),m=n.mul(i,f),y=n.add(e,r),w=n.add(o,l);y=n.mul(y,w),w=n.add(g,p),y=n.sub(y,w),w=n.add(e,i);let b=n.add(o,f);return w=n.mul(w,b),b=n.add(g,m),w=n.sub(w,b),b=n.add(r,i),a=n.add(l,f),b=n.mul(b,a),a=n.add(p,m),b=n.sub(b,a),d=n.mul(c,w),a=n.mul(h,m),d=n.add(a,d),a=n.sub(p,d),d=n.add(p,d),u=n.mul(a,d),p=n.add(g,g),p=n.add(p,g),m=n.mul(c,m),w=n.mul(h,w),p=n.add(p,m),m=n.sub(g,m),m=n.mul(c,m),w=n.add(w,m),g=n.mul(p,w),u=n.add(u,g),g=n.mul(b,w),a=n.mul(y,a),a=n.sub(a,g),g=n.mul(y,p),d=n.mul(b,d),new V(a,u,d=n.add(d,g))}subtract(t){return this.add(t.negate())}is0(){return this.equals(V.ZERO)}multiply(t){let r,n;let{endo:i}=e;if(!o.isValidNot0(t))throw Error("invalid scalar: out of range");let s=t=>Z.cached(this,t,t=>X(V,t));if(i){let{k1neg:e,k1:o,k2neg:l,k2:f}=S(t),{p:a,f:u}=s(o),{p:d,f:c}=s(f);n=u.add(c),r=N(i.beta,a,d,e,l)}else{let{p:e,f:i}=s(t);r=e,n=i}return X(V,[r,n])[0]}multiplyUnsafe(t){let{endo:r}=e;if(!o.isValid(t))throw Error("invalid scalar: out of range");if(t===td||this.is0())return V.ZERO;if(t===tc)return this;if(Z.hasCache(this))return this.multiply(t);if(!r)return Z.unsafe(this,t);{let{k1neg:e,k1:n,k2neg:i,k2:o}=S(t),{p1:s,p2:l}=function(t,e,r,n){let i=e,o=t.ZERO,s=t.ZERO;for(;r>Y||n>Y;)r&M&&(o=o.add(i)),n&M&&(s=s.add(i)),i=i.double(),r>>=M,n>>=M;return{p1:o,p2:s}}(V,this,n,o);return N(r.beta,s,l,e,i)}}multiplyAndAddUnsafe(t,e,r){let n=this.multiplyUnsafe(e).add(t.multiplyUnsafe(r));return n.is0()?void 0:n}toAffine(t){return q(this,t)}isTorsionFree(){let{isTorsionFree:t}=e;return l===tc||(t?t(V,this):Z.unsafe(this,f).is0())}clearCofactor(){let{clearCofactor:t}=e;return l===tc?this:t?t(V,this):this.multiplyUnsafe(l)}isSmallOrder(){return this.multiplyUnsafe(l).is0()}toBytes(t=!0){return a(t,"isCompressed"),this.assertValidity(),g(V,this,t)}toHex(t=!0){return(0,i.ci)(this.toBytes(t))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(t=!0){return this.toBytes(t)}_setWindowSize(t){this.precompute(t)}static normalizeZ(t){return X(V,t)}static msm(t,e){return function(t,e,r,n){!function(t,e){if(!Array.isArray(t))throw Error("array expected");t.forEach((t,r)=>{if(!(t instanceof e))throw Error("invalid point at index "+r)})}(r,t),function(t,e){if(!Array.isArray(t))throw Error("array of scalars expected");t.forEach((t,r)=>{if(!e.isValid(t))throw Error("invalid scalar at index "+r)})}(n,e);let i=r.length,o=n.length;if(i!==o)throw Error("arrays of points and scalars must have equal length");let s=t.ZERO,l=b(BigInt(i)),f=1;l>12?f=l-3:l>4?f=l-2:l>0&&(f=2);let a=E(f),u=Array(Number(a)+1).fill(s),d=Math.floor((e.BITS-1)/f)*f,c=s;for(let t=d;t>=0;t-=f){u.fill(s);for(let e=0;e<o;e++){let i=Number(n[e]>>BigInt(t)&a);u[i]=u[i].add(r[e])}let e=s;for(let t=u.length-1,r=s;t>0;t--)r=r.add(u[t]),e=e.add(r);if(c=c.add(e),0!==t)for(let t=0;t<f;t++)c=c.double()}return c}(V,o,t,e)}static fromPrivateKey(t){return V.BASE.multiply(tm(o,t))}}V.BASE=new V(s.Gx,s.Gy,n.ONE),V.ZERO=new V(n.ZERO,n.ONE,n.ZERO),V.Fp=n,V.Fn=o;let F=o.BITS,Z=new ti(V,e.endo?Math.ceil(F/2):F);return V.BASE.precompute(8),V}(e,r),n,o))})({...t,hash:e});return{...r(e),create:r}}({...tb,Fp:tv,lowS:!0,endo:tE},n.JQ)}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.