PageSourceSearch

https://dynamic-lebkuchen-0238db.netlify.app/static/js/9694.0afc79b9.chunk.js

js dynamic-lebkuchen-0238db.netlify.app collected 2026-10-03 10:41:50 UTC 31,471 bytes, 3 lines download raw bytes

1/*! For license information please see 9694.0afc79b9.chunk.js.LICENSE.txt */
2"use strict";(self.webpackChunkico_react=self.webpackChunkico_react||[]).push([[9694],{39694:(t,e,n)=>{n.d(e,{secp256k1:()=>Ut});var r=n(24107),o=n(36457),i=n(38420),s=n(5282);const c=BigInt(0),f=BigInt(1);function a(t){let e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"";if("boolean"!==typeof t){const n=e&&'"'.concat(e,'"');throw new Error(n+"expected boolean, got type="+typeof t)}return t}function u(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"";const r=(0,s.aY)(t),o=null===t||void 0===t?void 0:t.length,i=void 0!==e;if(!r||i&&o!==e){const s=n&&'"'.concat(n,'" '),c=i?" of length ".concat(e):"",f=r?"length=".concat(o):"type=".concat(typeof t);throw new Error(s+"expected Uint8Array"+c+", got "+f)}return t}function l(t){const e=t.toString(16);return 1&e.length?"0"+e:e}function d(t){if("string"!==typeof t)throw new Error("hex string expected, got "+typeof t);return""===t?c:BigInt("0x"+t)}function h(t){return d((0,s.My)(t))}function g(t){return(0,s.DO)(t),d((0,s.My)(Uint8Array.from(t).reverse()))}function w(t,e){return(0,s.aT)(t.toString(16).padStart(2*e,"0"))}function y(t,e){return w(t,e).reverse()}function p(t,e,n){let r;if("string"===typeof e)try{r=(0,s.aT)(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else{if(!(0,s.aY)(e))throw new Error(t+" must be hex string or Uint8Array");r=Uint8Array.from(e)}const o=r.length;if("number"===typeof n&&o!==n)throw new Error(t+" of length "+n+" expected, got "+o);return r}const m=t=>"bigint"===typeof t&&c<=t;function b(t,e,n,r){if(!function(t,e,n){return m(t)&&m(e)&&m(n)&&e<=t&&t<n}(e,n,r))throw new Error("expected valid "+t+": "+n+" <= n < "+r+", got "+e)}function E(t){let e;for(e=0;t>c;t>>=f,e+=1);return e}const v=t=>(f<<BigInt(t))-f;function B(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};if(!t||"object"!==typeof t)throw new Error("expected valid options object");function r(e,n,r){const o=t[e];if(r&&void 0===o)return;const i=typeof o;if(i!==n||null===o)throw new Error('param "'.concat(e,'" is invalid: expected ').concat(n,", got ").concat(i))}Object.entries(e).forEach(t=>{let[e,n]=t;return r(e,n,!1)}),Object.entries(n).forEach(t=>{let[e,n]=t;return r(e,n,!0)})}function O(t){const e=new WeakMap;return function(n){const r=e.get(n);if(void 0!==r)return r;for(var o=arguments.length,i=new Array(o>1?o-1:0),s=1;s<o;s++)i[s-1]=arguments[s];const c=t(n,...i);return e.set(n,c),c}}const x=BigInt(0),R=BigInt(1),S=BigInt(2),I=BigInt(3),A=BigInt(4),N=BigInt(5),q=BigInt(7),F=BigInt(8),Z=BigInt(9),U=BigInt(16);function V(t,e){const n=t%e;return n>=x?n:e+n}function k(t,e,n){let r=t;for(;e-- >x;)r*=r,r%=n;return r}function K(t,e){if(t===x)throw new Error("invert: expected non-zero number");if(e<=x)throw new Error("invert: expected positive modulus, got "+e);let n=V(t,e),r=e,o=x,i=R,s=R,c=x;for(;n!==x;){const t=r/n,e=r%n,f=o-s*t,a=i-c*t;r=n,n=e,o=s,i=c,s=f,c=a}if(r!==R)throw new Error("invert: does not exist");return V(o,e)}function P(t,e,n){if(!t.eql(t.sqr(e),n))throw new Error("Cannot find square root")}function C(t,e){const n=(t.ORDER+R)/A,r=t.pow(e,n);return P(t,r,e),r}function T(t,e){const n=(t.ORDER-N)/F,r=t.mul(e,S),o=t.pow(r,n),i=t.mul(e,o),s=t.mul(t.mul(i,S),o),c=t.mul(i,t.sub(s,t.ONE));return P(t,c,e),c}function j(t){if(t<I)throw new Error("sqrt is not defined for small field");let e=t-R,n=0;for(;e%S===x;)e/=S,n++;let r=S;const o=H(t);for(;1===M(o,r);)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(1===n)return C;let i=o.pow(r,e);const s=(e+R)/S;return function(t,r){if(t.is0(r))return r;if(1!==M(t,r))throw new Error("Cannot find square root");let o=n,c=t.mul(t.ONE,i),f=t.pow(r,e),a=t.pow(r,s);for(;!t.eql(f,t.ONE);){if(t.is0(f))return t.ZERO;let e=1,n=t.sqr(f);for(;!t.eql(n,t.ONE);)if(e++,n=t.sqr(n),e===o)throw new Error("Cannot find square root");const r=R<<BigInt(o-e-1),i=t.pow(c,r);o=e,c=t.sqr(i),f=t.mul(f,c),a=t.mul(a,i)}return a}}function Y(t){return t%A===I?C:t%F===N?T:t%U===Z?function(t){const e=H(t),n=j(t),r=n(e,e.neg(e.ONE)),o=n(e,r),i=n(e,e.neg(r)),s=(t+q)/U;return(t,e)=>{let n=t.pow(e,s),c=t.mul(n,r);const f=t.mul(n,o),a=t.mul(n,i),u=t.eql(t.sqr(c),e),l=t.eql(t.sqr(f),e);n=t.cmov(n,c,u),c=t.cmov(a,f,l);const d=t.eql(t.sqr(c),e),h=t.cmov(n,c,d);return P(t,h,e),h}}(t):j(t)}const D=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function L(t,e,n){if(n<x)throw new Error("invalid exponent, negatives unsupported");if(n===x)return t.ONE;if(n===R)return e;let r=t.ONE,o=e;for(;n>x;)n&R&&(r=t.mul(r,o)),o=t.sqr(o),n>>=R;return r}function z(t,e){let n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const r=new Array(e.length).fill(n?t.ZERO:void 0),o=e.reduce((e,n,o)=>t.is0(n)?e:(r[o]=e,t.mul(e,n)),t.ONE),i=t.inv(o);return e.reduceRight((e,n,o)=>t.is0(n)?e:(r[o]=t.mul(e,r[o]),t.mul(e,n)),i),r}function M(t,e){const n=(t.ORDER-R)/S,r=t.pow(e,n),o=t.eql(r,t.ONE),i=t.eql(r,t.ZERO),s=t.eql(r,t.neg(t.ONE));if(!o&&!i&&!s)throw new Error("invalid Legendre symbol result");return o?1:i?0:-1}function _(t,e){void 0!==e&&(0,s.Fe)(e);const n=void 0!==e?e:t.toString(2).length;return{nBitLength:n,nByteLength:Math.ceil(n/8)}}function H(t,e){let n,r,o=arguments.length>2&&void 0!==arguments[2]&&arguments[2],i=arguments.length>3&&void 0!==arguments[3]?arguments[3]:{};if(t<=x)throw new Error("invalid field: expected ORDER > 0, got "+t);let s,c=!1;if("object"===typeof e&&null!=e){if(i.sqrt||o)throw new Error("cannot specify opts in two arguments");const t=e;
2t.BITS&&(n=t.BITS),t.sqrt&&(r=t.sqrt),"boolean"===typeof t.isLE&&(o=t.isLE),"boolean"===typeof t.modFromBytes&&(c=t.modFromBytes),s=t.allowedLengths}else"number"===typeof e&&(n=e),i.sqrt&&(r=i.sqrt);const{nBitLength:f,nByteLength:a}=_(t,n);if(a>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const l=Object.freeze({ORDER:t,isLE:o,BITS:f,BYTES:a,MASK:v(f),ZERO:x,ONE:R,allowedLengths:s,create:e=>V(e,t),isValid:e=>{if("bigint"!==typeof e)throw new Error("invalid field element: expected bigint, got "+typeof e);return x<=e&&e<t},is0:t=>t===x,isValidNot0:t=>!l.is0(t)&&l.isValid(t),isOdd:t=>(t&R)===R,neg:e=>V(-e,t),eql:(t,e)=>t===e,sqr:e=>V(e*e,t),add:(e,n)=>V(e+n,t),sub:(e,n)=>V(e-n,t),mul:(e,n)=>V(e*n,t),pow:(t,e)=>L(l,t,e),div:(e,n)=>V(e*K(n,t),t),sqrN:t=>t*t,addN:(t,e)=>t+e,subN:(t,e)=>t-e,mulN:(t,e)=>t*e,inv:e=>K(e,t),sqrt:r||(e=>(u||(u=Y(t)),u(l,e))),toBytes:t=>o?y(t,a):w(t,a),fromBytes:function(e){let n=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];if(s){if(!s.includes(e.length)||e.length>a)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+e.length);const t=new Uint8Array(a);t.set(e,o?0:t.length-e.length),e=t}if(e.length!==a)throw new Error("Field.fromBytes: expected "+a+" bytes, got "+e.length);let r=o?g(e):h(e);if(c&&(r=V(r,t)),!n&&!l.isValid(r))throw new Error("invalid field element: outside of range 0..ORDER");return r},invertBatch:t=>z(l,t),cmov:(t,e,n)=>n?e:t});return Object.freeze(l)}function G(t){if("bigint"!==typeof t)throw new Error("field order must be bigint");const e=t.toString(2).length;return Math.ceil(e/8)}function X(t){const e=G(t);return e+Math.ceil(e/2)}const W=BigInt(0),J=BigInt(1);function Q(t,e){const n=e.negate();return t?n:e}function $(t,e){const n=z(t.Fp,e.map(t=>t.Z));return e.map((e,r)=>t.fromAffine(e.toAffine(n[r])))}function tt(t,e){if(!Number.isSafeInteger(t)||t<=0||t>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+t)}function et(t,e){tt(t,e);const n=2**t;return{windows:Math.ceil(e/t)+1,windowSize:2**(t-1),mask:v(t),maxNumber:n,shiftBy:BigInt(t)}}function nt(t,e,n){const{windowSize:r,mask:o,maxNumber:i,shiftBy:s}=n;let c=Number(t&o),f=t>>s;c>r&&(c-=i,f+=J);const a=e*r;return{nextN:f,offset:a+Math.abs(c)-1,isZero:0===c,isNeg:c<0,isNegF:e%2!==0,offsetF:a}}function rt(t,e){if(!Array.isArray(t))throw new Error("array expected");t.forEach((t,n)=>{if(!(t instanceof e))throw new Error("invalid point at index "+n)})}function ot(t,e){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((t,n)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+n)})}const it=new WeakMap,st=new WeakMap;function ct(t){return st.get(t)||1}function ft(t){if(t!==W)throw new Error("invalid wNAF")}class at{constructor(t,e){this.BASE=t.BASE,this.ZERO=t.ZERO,this.Fn=t.Fn,this.bits=e}_unsafeLadder(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:this.ZERO,r=t;for(;e>W;)e&J&&(n=n.add(r)),r=r.double(),e>>=J;return n}precomputeWindow(t,e){const{windows:n,windowSize:r}=et(e,this.bits),o=[];let i=t,s=i;for(let c=0;c<n;c++){s=i,o.push(s);for(let t=1;t<r;t++)s=s.add(i),o.push(s);i=s.double()}return o}wNAF(t,e,n){if(!this.Fn.isValid(n))throw new Error("invalid scalar");let r=this.ZERO,o=this.BASE;const i=et(t,this.bits);for(let s=0;s<i.windows;s++){const{nextN:t,offset:c,isZero:f,isNeg:a,isNegF:u,offsetF:l}=nt(n,s,i);n=t,f?o=o.add(Q(u,e[l])):r=r.add(Q(a,e[c]))}return ft(n),{p:r,f:o}}wNAFUnsafe(t,e,n){let r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:this.ZERO;const o=et(t,this.bits);for(let i=0;i<o.windows&&n!==W;i++){const{nextN:t,offset:s,isZero:c,isNeg:f}=nt(n,i,o);if(n=t,!c){const t=e[s];r=r.add(f?t.negate():t)}}return ft(n),r}getPrecomputes(t,e,n){let r=it.get(e);return r||(r=this.precomputeWindow(e,t),1!==t&&("function"===typeof n&&(r=n(r)),it.set(e,r))),r}cached(t,e,n){const r=ct(t);
2return this.wNAF(r,this.getPrecomputes(r,t,n),e)}unsafe(t,e,n,r){const o=ct(t);return 1===o?this._unsafeLadder(t,e,r):this.wNAFUnsafe(o,this.getPrecomputes(o,t,n),e,r)}createCache(t,e){tt(e,this.bits),st.set(t,e),it.delete(t)}hasCache(t){return 1!==ct(t)}}function ut(t,e,n){if(e){if(e.ORDER!==t)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return function(t){B(t,D.reduce((t,e)=>(t[e]="function",t),{ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"}))}(e),e}return H(t,{isLE:n})}const lt=(t,e)=>(t+(t>=0?e:-e)/mt)/e;function dt(t){if(!["compact","recovered","der"].includes(t))throw new Error('Signature format must be "compact", "recovered", or "der"');return t}function ht(t,e){const n={};for(let r of Object.keys(e))n[r]=void 0===t[r]?e[r]:t[r];return a(n.lowS,"lowS"),a(n.prehash,"prehash"),void 0!==n.format&&dt(n.format),n}class gt extends Error{constructor(){super(arguments.length>0&&void 0!==arguments[0]?arguments[0]:"")}}const wt={Err:gt,_tlv:{encode:(t,e)=>{const{Err:n}=wt;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(1&e.length)throw new n("tlv.encode: unpadded data");const r=e.length/2,o=l(r);if(o.length/2&128)throw new n("tlv.encode: long form length too big");const i=r>127?l(o.length/2|128):"";return l(t)+i+o+e},decode(t,e){const{Err:n}=wt;let r=0;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(e.length<2||e[r++]!==t)throw new n("tlv.decode: wrong tlv");const o=e[r++];let i=0;if(!!(128&o)){const t=127&o;if(!t)throw new n("tlv.decode(long): indefinite length not supported");if(t>4)throw new n("tlv.decode(long): byte length is too big");const s=e.subarray(r,r+t);if(s.length!==t)throw new n("tlv.decode: length bytes not complete");if(0===s[0])throw new n("tlv.decode(long): zero leftmost byte");for(const e of s)i=i<<8|e;if(r+=t,i<128)throw new n("tlv.decode(long): not minimal encoding")}else i=o;const s=e.subarray(r,r+i);if(s.length!==i)throw new n("tlv.decode: wrong value length");return{v:s,l:e.subarray(r+i)}}},_int:{encode(t){const{Err:e}=wt;if(t<yt)throw new e("integer: negative integers are not allowed");let n=l(t);if(8&Number.parseInt(n[0],16)&&(n="00"+n),1&n.length)throw new e("unexpected DER parsing assertion: unpadded hex");return n},decode(t){const{Err:e}=wt;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){const{Err:e,_int:n,_tlv:r}=wt,o=p("signature",t),{v:i,l:s}=r.decode(48,o);if(s.length)throw new e("invalid signature: left bytes after parsing");const{v:c,l:f}=r.decode(2,i),{v:a,l:u}=r.decode(2,f);if(u.length)throw new e("invalid signature: left bytes after parsing");return{r:n.decode(c),s:n.decode(a)}},hexFromSig(t){const{_tlv:e,_int:n}=wt,r=e.encode(2,n.encode(t.r))+e.encode(2,n.encode(t.s));return e.encode(48,r)}},yt=BigInt(0),pt=BigInt(1),mt=BigInt(2),bt=BigInt(3),Et=BigInt(4);function vt(t,e){const{BYTES:n}=t;let r;if("bigint"===typeof e)r=e;else{let i=p("private key",e);try{r=t.fromBytes(i)}catch(o){throw new Error("invalid private key: expected ui8a of size ".concat(n,", got ").concat(typeof e))}}if(!t.isValidNot0(r))throw new Error("invalid private key: out of range [1..N-1]");return r}function Bt(t){let e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const n=function(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{},r=arguments.length>3?arguments[3]:void 0;if(void 0===r&&(r="edwards"===t),!e||"object"!==typeof e)throw new Error("expected valid ".concat(t," CURVE object"));for(const c of["p","n","h"]){const t=e[c];if(!("bigint"===typeof t&&t>W))throw new Error("CURVE.".concat(c," must be positive bigint"))}const o=ut(e.p,n.Fp,r),i=ut(e.n,n.Fn,r),s=["Gx","Gy","a","weierstrass"===t?"b":"d"];for(const c of s)if(!o.isValid(e[c]))throw new Error("CURVE.".concat(c," must be valid field element of CURVE.Fp"));return{CURVE:e=Object.freeze(Object.assign({},e)),Fp:o,Fn:i}}("weierstrass",t,e),{Fp:r,Fn:o}=n;let i=n.CURVE;const{h:c,n:f}=i;B(e,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});
2const{endo:l}=e;if(l&&(!r.is0(i.a)||"bigint"!==typeof l.beta||!Array.isArray(l.basises)))throw new Error('invalid endo: expected "beta": bigint and "basises": array');const d=xt(r,o);function h(){if(!r.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}const g=e.toBytes||function(t,e,n){const{x:o,y:i}=e.toAffine(),c=r.toBytes(o);if(a(n,"isCompressed"),n){h();const t=!r.isOdd(i);return(0,s.Id)(Ot(t),c)}return(0,s.Id)(Uint8Array.of(4),c,r.toBytes(i))},w=e.fromBytes||function(t){u(t,void 0,"Point");const{publicKey:e,publicKeyUncompressed:n}=d,o=t.length,i=t[0],s=t.subarray(1);if(o!==e||2!==i&&3!==i){if(o===n&&4===i){const t=r.BYTES,e=r.fromBytes(s.subarray(0,t)),n=r.fromBytes(s.subarray(t,2*t));if(!m(e,n))throw new Error("bad point: is not on curve");return{x:e,y:n}}throw new Error("bad point: got length ".concat(o,", expected compressed=").concat(e," or uncompressed=").concat(n))}{const t=r.fromBytes(s);if(!r.isValid(t))throw new Error("bad point: is not on curve, wrong x");const e=y(t);let n;try{n=r.sqrt(e)}catch(c){const t=c instanceof Error?": "+c.message:"";throw new Error("bad point: is not on curve, sqrt error"+t)}h();return 1===(1&i)!==r.isOdd(n)&&(n=r.neg(n)),{x:t,y:n}}};function y(t){const e=r.sqr(t),n=r.mul(e,t);return r.add(r.add(n,r.mul(t,i.a)),i.b)}function m(t,e){const n=r.sqr(e),o=y(t);return r.eql(n,o)}if(!m(i.Gx,i.Gy))throw new Error("bad curve params: generator point");const b=r.mul(r.pow(i.a,bt),Et),x=r.mul(r.sqr(i.b),BigInt(27));if(r.is0(r.add(b,x)))throw new Error("bad curve params: a or b");function R(t,e){let n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if(!r.isValid(e)||n&&r.is0(e))throw new Error("bad point coordinate ".concat(t));return e}function S(t){if(!(t instanceof F))throw new Error("ProjectivePoint expected")}function I(t){if(!l||!l.basises)throw new Error("no endo");return function(t,e,n){const[[r,o],[i,s]]=e,c=lt(s*t,n),f=lt(-o*t,n);let a=t-c*r-f*i,u=-c*o-f*s;const l=a<yt,d=u<yt;l&&(a=-a),d&&(u=-u);const h=v(Math.ceil(E(n)/2))+pt;if(a<yt||a>=h||u<yt||u>=h)throw new Error("splitScalar (endomorphism): failed, k="+t);return{k1neg:l,k1:a,k2neg:d,k2:u}}(t,l.basises,o.ORDER)}const A=O((t,e)=>{const{X:n,Y:o,Z:i}=t;if(r.eql(i,r.ONE))return{x:n,y:o};const s=t.is0();null==e&&(e=s?r.ONE:r.inv(i));const c=r.mul(n,e),f=r.mul(o,e),a=r.mul(i,e);if(s)return{x:r.ZERO,y:r.ZERO};if(!r.eql(a,r.ONE))throw new Error("invZ was invalid");return{x:c,y:f}}),N=O(t=>{if(t.is0()){if(e.allowInfinityPoint&&!r.is0(t.Y))return;throw new Error("bad point: ZERO")}const{x:n,y:o}=t.toAffine();if(!r.isValid(n)||!r.isValid(o))throw new Error("bad point: x or y not field elements");if(!m(n,o))throw new Error("bad point: equation left != right");if(!t.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function q(t,e,n,o,i){return n=new F(r.mul(n.X,t),n.Y,n.Z),e=Q(o,e),n=Q(i,n),e.add(n)}class F{constructor(t,e,n){this.X=R("x",t),this.Y=R("y",e,!0),this.Z=R("z",n),Object.freeze(this)}static CURVE(){return i}static fromAffine(t){const{x:e,y:n}=t||{};if(!t||!r.isValid(e)||!r.isValid(n))throw new Error("invalid affine point");if(t instanceof F)throw new Error("projective point not allowed");return r.is0(e)&&r.is0(n)?F.ZERO:new F(e,n,r.ONE)}static fromBytes(t){const e=F.fromAffine(w(u(t,void 0,"point")));return e.assertValidity(),e}static fromHex(t){return F.fromBytes(p("pointHex",t))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(){let t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:8,e=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];return U.createCache(this,t),e||this.multiply(bt),this}assertValidity(){N(this)}hasEvenY(){const{y:t}=this.toAffine();if(!r.isOdd)throw new Error("Field doesn't support isOdd");return!r.isOdd(t)}equals(t){S(t);const{X:e,Y:n,Z:o}=this,{X:i,Y:s,Z:c}=t,f=r.eql(r.mul(e,c),r.mul(i,o)),a=r.eql(r.mul(n,c),r.mul(s,o));return f&&a}negate(){return new F(this.X,r.neg(this.Y),this.Z)}double(){const{a:t,b:e}=i,n=r.mul(e,bt),{X:o,Y:s,Z:c}=this;let f=r.ZERO,a=r.ZERO,u=r.ZERO,l=r.mul(o,o),d=r.mul(s,s),h=r.mul(c,c),g=r.mul(o,s);return g=r.add(g,g),u=r.mul(o,c),u=r.add(u,u),f=r.mul(t,u),a=r.mul(n,h),a=r.add(f,a),f=r.sub(d,a),a=r.add(d,a),a=r.mul(f,a),f=r.mul(g,f),u=r.mul(n,u),h=r.mul(t,h),g=r.sub(l,h),g=r.mul(t,g),g=r.add(g,u),u=r.add(l,l),l=r.add(u,l),l=r.add(l,h),l=r.mul(l,g),a=r.add(a,l),h=r.mul(s,c),h=r.add(h,h),l=r.mul(h,g),f=r.sub(f,l),u=r.mul(h,d),u=r.add(u,u),u=r.add(u,u),new F(f,a,u)}add(t){S(t);const{X:e,Y:n,Z:o}=this,{X:s,Y:c,Z:f}=t;let a=r.ZERO,u=r.ZERO,l=r.ZERO;const d=i.a,h=r.mul(i.b,bt);let g=r.mul(e,s),w=r.mul(n,c),y=r.mul(o,f),p=r.add(e,n),m=r.add(s,c);p=r.mul(p,m),m=r.add(g,w),p=r.sub(p,m),m=r.add(e,o);let b=r.add(s,f);return m=r.mul(m,b),b=r.add(g,y),m=r.sub(m,b),b=r.add(n,o),a=r.add(c,f),b=r.mul(b,a),a=r.add(w,y),b=r.sub(b,a),l=r.mul(d,m),a=r.mul(h,y),l=r.add(a,l),a=r.sub(w,l),l=r.add(w,l),u=r.mul(a,l),w=r.add(g,g),w=r.add(w,g),y=r.mul(d,y),m=r.mul(h,m),w=r.add(w,y),y=r.sub(g,y),y=r.mul(d,y),m=r.add(m,y),g=r.mul(w,m),u=r.add(u,g),g=r.mul(b,m),a=r.mul(p,a),a=r.sub(a,g),g=r.mul(p,w),l=r.mul(b,l),l=r.add(l,g),new F(a,u,l)}subtract(t){return this.add(t.negate())}is0(){return this.equals(F.ZERO)}
2multiply(t){const{endo:n}=e;if(!o.isValidNot0(t))throw new Error("invalid scalar: out of range");let r,i;const s=t=>U.cached(this,t,t=>$(F,t));if(n){const{k1neg:e,k1:o,k2neg:c,k2:f}=I(t),{p:a,f:u}=s(o),{p:l,f:d}=s(f);i=u.add(d),r=q(n.beta,a,l,e,c)}else{const{p:e,f:n}=s(t);r=e,i=n}return $(F,[r,i])[0]}multiplyUnsafe(t){const{endo:n}=e,r=this;if(!o.isValid(t))throw new Error("invalid scalar: out of range");if(t===yt||r.is0())return F.ZERO;if(t===pt)return r;if(U.hasCache(this))return this.multiply(t);if(n){const{k1neg:e,k1:o,k2neg:i,k2:s}=I(t),{p1:c,p2:f}=function(t,e,n,r){let o=e,i=t.ZERO,s=t.ZERO;for(;n>W||r>W;)n&J&&(i=i.add(o)),r&J&&(s=s.add(o)),o=o.double(),n>>=J,r>>=J;return{p1:i,p2:s}}(F,r,o,s);return q(n.beta,c,f,e,i)}return U.unsafe(r,t)}multiplyAndAddUnsafe(t,e,n){const r=this.multiplyUnsafe(e).add(t.multiplyUnsafe(n));return r.is0()?void 0:r}toAffine(t){return A(this,t)}isTorsionFree(){const{isTorsionFree:t}=e;return c===pt||(t?t(F,this):U.unsafe(this,f).is0())}clearCofactor(){const{clearCofactor:t}=e;return c===pt?this:t?t(F,this):this.multiplyUnsafe(c)}isSmallOrder(){return this.multiplyUnsafe(c).is0()}toBytes(){let t=!(arguments.length>0&&void 0!==arguments[0])||arguments[0];return a(t,"isCompressed"),this.assertValidity(),g(F,this,t)}toHex(){let t=!(arguments.length>0&&void 0!==arguments[0])||arguments[0];return(0,s.My)(this.toBytes(t))}toString(){return"<Point ".concat(this.is0()?"ZERO":this.toHex(),">")}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(){let t=!(arguments.length>0&&void 0!==arguments[0])||arguments[0];return this.toBytes(t)}_setWindowSize(t){this.precompute(t)}static normalizeZ(t){return $(F,t)}static msm(t,e){return function(t,e,n,r){rt(n,t),ot(r,e);const o=n.length,i=r.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,c=E(BigInt(o));let f=1;c>12?f=c-3:c>4?f=c-2:c>0&&(f=2);const a=v(f),u=new Array(Number(a)+1).fill(s);let l=s;for(let d=Math.floor((e.BITS-1)/f)*f;d>=0;d-=f){u.fill(s);for(let e=0;e<i;e++){const t=r[e],o=Number(t>>BigInt(d)&a);u[o]=u[o].add(n[e])}let t=s;for(let e=u.length-1,n=s;e>0;e--)n=n.add(u[e]),t=t.add(n);if(l=l.add(t),0!==d)for(let e=0;e<f;e++)l=l.double()}return l}(F,o,t,e)}static fromPrivateKey(t){return F.BASE.multiply(vt(o,t))}}F.BASE=new F(i.Gx,i.Gy,r.ONE),F.ZERO=new F(r.ZERO,r.ONE,r.ZERO),F.Fp=r,F.Fn=o;const Z=o.BITS,U=new at(F,e.endo?Math.ceil(Z/2):Z);return F.BASE.precompute(8),F}function Ot(t){return Uint8Array.of(t?2:3)}function xt(t,e){return{secretKey:e.BYTES,publicKey:1+t.BYTES,publicKeyUncompressed:1+2*t.BYTES,publicKeyHasPrefix:!0,signature:2*e.BYTES}}function Rt(t){let e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const{Fn:n}=t,r=e.randomBytes||s.po,o=Object.assign(xt(t.Fp,n),{seed:X(n.ORDER)});function i(t){try{return!!vt(n,t)}catch(e){return!1}}function c(){return function(t,e){let n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const r=t.length,o=G(e),i=X(e);if(r<16||r<i||r>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+r);const s=V(n?g(t):h(t),e-R)+R;return n?y(s,o):w(s,o)}(u(arguments.length>0&&void 0!==arguments[0]?arguments[0]:r(o.seed),o.seed,"seed"),n.ORDER)}function f(e){let r=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];return t.BASE.multiply(vt(n,e)).toBytes(r)}function a(e){if("bigint"===typeof e)return!1;if(e instanceof t)return!0;const{secretKey:r,publicKey:i,publicKeyUncompressed:s}=o;if(n.allowedLengths||r===i)return;const c=p("key",e).length;return c===i||c===s}const l={isValidSecretKey:i,isValidPublicKey:function(e,n){const{publicKey:r,publicKeyUncompressed:i}=o;try{const o=e.length;return(!0!==n||o===r)&&((!1!==n||o===i)&&!!t.fromBytes(e))}catch(s){return!1}},randomSecretKey:c,isValidPrivateKey:i,randomPrivateKey:c,normPrivateKeyToScalar:t=>vt(n,t),precompute(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:8;return(arguments.length>1&&void 0!==arguments[1]?arguments[1]:t.BASE).precompute(e,!1)}};return Object.freeze({getPublicKey:f,getSharedSecret:function(e,r){let o=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(!0===a(e))throw new Error("first arg must be private key");if(!1===a(r))throw new Error("second arg must be public key");const i=vt(n,e);return t.fromHex(r).multiply(i).toBytes(o)},keygen:function(t){const e=c(t);return{secretKey:e,publicKey:f(e)}},Point:t,utils:l,lengths:o})}function St(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};(0,s.sd)(e),B(n,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const r=n.randomBytes||s.po,o=n.hmac||function(t){for(var n=arguments.length,r=new Array(n>1?n-1:0),o=1;o<n;o++)r[o-1]=arguments[o];return(0,i.w)(e,t,(0,s.Id)(...r))},{Fp:c,Fn:f}=t,{ORDER:a,BITS:l}=f,{keygen:d,getPublicKey:g,getSharedSecret:w,utils:y,lengths:m}=Rt(t,n),E={prehash:!1,lowS:"boolean"===typeof n.lowS&&n.lowS,format:void 0,extraEntropy:!1},O="compact";function x(t){return t>a>>pt}function R(t,e){if(!f.isValidNot0(e))throw new Error("invalid signature ".concat(t,": out of range 1..Point.Fn.ORDER"));return e}class S{constructor(t,e,n){this.r=R("r",t),this.s=R("s",e),null!=n&&(this.recovery=n),Object.freeze(this)}static fromBytes(t){let e,n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:O;if(function(t,e){dt(e);const n=m.signature;u(t,"compact"===e?n:"recovered"===e?n+1:void 0,"".concat(e," signature"))}(t,n),"der"===n){const{r:e,s:n}=wt.toSig(u(t));return new S(e,n)}"recovered"===n&&(e=t[0],n="compact",t=t.subarray(1));const r=f.BYTES,o=t.subarray(0,r),i=t.subarray(r,2*r);return new S(f.fromBytes(o),f.fromBytes(i),e)}static fromHex(t,e){return this.fromBytes((0,s.aT)(t),e)}addRecoveryBit(t){return new S(this.r,this.s,t)}recoverPublicKey(e){const n=c.ORDER,{r:r,s:o,recovery:i}=this;if(null==i||![0,1,2,3].includes(i))throw new Error("recovery id invalid");if(a*mt<n&&i>1)throw new Error("recovery id is ambiguous for h>1 curve");const u=2===i||3===i?r+a:r;if(!c.isValid(u))throw new Error("recovery id 2 or 3 invalid");const l=c.toBytes(u),d=t.fromBytes((0,s.Id)(Ot(0===(1&i)),l)),h=f.inv(u),g=A(p("msgHash",e)),w=f.create(-g*h),y=f.create(o*h),m=t.BASE.multiplyUnsafe(w).add(d.multiplyUnsafe(y));if(m.is0())throw new Error("point at infinify");return m.assertValidity(),m}hasHighS(){return x(this.s)}toBytes(){let t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:O;if(dt(t),"der"===t)return(0,s.aT)(wt.hexFromSig(this));const e=f.toBytes(this.r),n=f.toBytes(this.s);if("recovered"===t){if(null==this.recovery)throw new Error("recovery bit must be present");return(0,s.Id)(Uint8Array.of(this.recovery),e,n)}return(0,s.Id)(e,n)}toHex(t){return(0,s.My)(this.toBytes(t))}assertValidity(){}static fromCompact(t){return S.fromBytes(p("sig",t),"compact")}static fromDER(t){return S.fromBytes(p("sig",t),"der")}normalizeS(){return this.hasHighS()?new S(this.r,f.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return(0,s.My)(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return(0,s.My)(this.toBytes("compact"))}}const I=n.bits2int||function(t){if(t.length>8192)throw new Error("input is too large");const e=h(t),n=8*t.length-l;return n>0?e>>BigInt(n):e},A=n.bits2int_modN||function(t){return f.create(I(t))},N=v(l);function q(t){return b("num < 2^"+l,t,yt,N),f.toBytes(t)}function F(t,n){return u(t,void 0,"message"),n?u(e(t),void 0,"prehashed message"):t}return Object.freeze({keygen:d,getPublicKey:g,getSharedSecret:w,utils:y,lengths:m,Point:t,sign:function(n,i){let c=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};n=p("message",n);const{seed:a,k2sig:u}=function(e,n,o){if(["recovered","canonical"].some(t=>t in o))throw new Error("sign() legacy options not supported");const{lowS:i,prehash:c,extraEntropy:a}=ht(o,E);e=F(e,c);const u=A(e),l=vt(f,n),d=[q(l),q(u)];if(null!=a&&!1!==a){const t=!0===a?r(m.secretKey):a;d.push(p("extraEntropy",t))}const h=(0,s.Id)(...d),g=u;return{seed:h,k2sig:function(e){const n=I(e);if(!f.isValidNot0(n))return;const r=f.inv(n),o=t.BASE.multiply(n).toAffine(),s=f.create(o.x);if(s===yt)return;const c=f.create(r*f.create(g+s*l));if(c===yt)return;let a=(o.x===s?0:2)|Number(o.y&pt),u=c;return i&&x(c)&&(u=f.neg(c),a^=1),new S(s,u,a)}}}(n,i,c),l=function(t,e,n){if("number"!==typeof t||t<2)throw new Error("hashLen must be a number");if("number"!==typeof e||e<2)throw new Error("qByteLen must be a number");if("function"!==typeof n)throw new Error("hmacFn must be a function");const r=t=>new Uint8Array(t),o=t=>Uint8Array.of(t);let i=r(t),c=r(t),f=0;const a=()=>{i.fill(1),c.fill(0),f=0},u=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];return n(c,i,...e)},l=function(){let t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:r(0);c=u(o(0),t),i=u(),0!==t.length&&(c=u(o(1),t),i=u())},d=()=>
2{if(f++>=1e3)throw new Error("drbg: tried 1000 values");let t=0;const n=[];for(;t<e;){i=u();const e=i.slice();n.push(e),t+=i.length}return(0,s.Id)(...n)};return(t,e)=>{let n;for(a(),l(t);!(n=e(d()));)l();return a(),n}}(e.outputLen,f.BYTES,o);return l(a,u)},verify:function(e,n,r){let o=arguments.length>3&&void 0!==arguments[3]?arguments[3]:{};const{lowS:i,prehash:c,format:a}=ht(o,E);if(r=p("publicKey",r),n=F(p("message",n),c),"strict"in o)throw new Error("options.strict was renamed to lowS");const u=void 0===a?function(t){let e;const n="string"===typeof t||(0,s.aY)(t),r=!n&&null!==t&&"object"===typeof t&&"bigint"===typeof t.r&&"bigint"===typeof t.s;if(!n&&!r)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(r)e=new S(t.r,t.s);else if(n){try{e=S.fromBytes(p("sig",t),"der")}catch(o){if(!(o instanceof wt.Err))throw o}if(!e)try{e=S.fromBytes(p("sig",t),"compact")}catch(i){return!1}}return e||!1}(e):S.fromBytes(p("sig",e),a);if(!1===u)return!1;try{const e=t.fromBytes(r);if(i&&u.hasHighS())return!1;const{r:o,s:s}=u,c=A(n),a=f.inv(s),l=f.create(c*a),d=f.create(o*a),h=t.BASE.multiplyUnsafe(l).add(e.multiplyUnsafe(d));if(h.is0())return!1;return f.create(h.x)===o}catch(l){return!1}},recoverPublicKey:function(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};const{prehash:r}=ht(n,E);return e=F(e,r),S.fromBytes(t,"recovered").recoverPublicKey(e).toBytes()},Signature:S,hash:e})}function It(t){const e={a:t.a,b:t.b,p:t.Fp.ORDER,n:t.n,h:t.h,Gx:t.Gx,Gy:t.Gy},n=t.Fp;let r=t.allowedPrivateKeyLengths?Array.from(new Set(t.allowedPrivateKeyLengths.map(t=>Math.ceil(t/2)))):void 0;return{CURVE:e,curveOpts:{Fp:n,Fn:H(e.n,{BITS:t.nBitLength,allowedLengths:r,modFromBytes:t.wrapPrivateKey}),allowInfinityPoint:t.allowInfinityPoint,endo:t.endo,isTorsionFree:t.isTorsionFree,clearCofactor:t.clearCofactor,fromBytes:t.fromBytes,toBytes:t.toBytes}}}function At(t){const{CURVE:e,curveOpts:n,hash:r,ecdsaOpts:o}=function(t){const{CURVE:e,curveOpts:n}=It(t),r={hmac:t.hmac,randomBytes:t.randomBytes,lowS:t.lowS,bits2int:t.bits2int,bits2int_modN:t.bits2int_modN};return{CURVE:e,curveOpts:n,hash:t.hash,ecdsaOpts:r}}(t);return function(t,e){const n=e.Point;return Object.assign({},e,{ProjectivePoint:n,CURVE:Object.assign({},t,_(n.Fn.ORDER,n.Fn.BITS))})}(t,St(Bt(e,n),r,o))}const Nt={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},qt={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},Ft=BigInt(2);const Zt=H(Nt.p,{sqrt:function(t){const e=Nt.p,n=BigInt(3),r=BigInt(6),o=BigInt(11),i=BigInt(22),s=BigInt(23),c=BigInt(44),f=BigInt(88),a=t*t*t%e,u=a*a*t%e,l=k(u,n,e)*u%e,d=k(l,n,e)*u%e,h=k(d,Ft,e)*a%e,g=k(h,o,e)*h%e,w=k(g,i,e)*g%e,y=k(w,c,e)*w%e,p=k(y,f,e)*y%e,m=k(p,c,e)*w%e,b=k(m,n,e)*u%e,E=k(b,s,e)*g%e,v=k(E,r,e)*a%e,B=k(v,Ft,e);if(!Zt.eql(Zt.sqr(B),t))throw new Error("Cannot find square root");return B}}),Ut=function(t,e){const n=e=>At((0,r.A)((0,r.A)({},t),{},{hash:e}));return(0,r.A)((0,r.A)({},n(e)),{},{create:n})}((0,r.A)((0,r.A)({},Nt),{},{Fp:Zt,lowS:!0,endo:qt}),o.sc)}}]);
3//# sourceMappingURL=9694.0afc79b9.chunk.js.map

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.