@gardenfi/utils 2.5.2 → 2.5.3-beta.1

package/dist/index243.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function p(e,{method:u}){var s,o;const r={};return e.transport.type==="fallback"&&((o=(s=e.transport).onResponse)==null||o.call(s,({method:t,response:a,status:c,transport:n})=>{c==="success"&&u===t&&(r[a]=n.request)})),t=>r[t]||e.request}exports.createFilterRequestScope=p;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const we=require("./index237.cjs"),H=require("./index233.cjs"),h=require("./index244.cjs"),L=require("./index245.cjs"),ee=require("./index228.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const ce=(r,s)=>(r+(r>=0?s:-s)/le)/s;function ae(r,s,c){const[[e,w],[p,l]]=s,F=ce(l*r,c),R=ce(-w*r,c);let T=r-F*e-R*p,U=-F*w-R*l;const X=T<D,j=U<D;X&&(T=-T),j&&(U=-U);const E=h.bitMask(Math.ceil(h.bitLen(c)/2))+M;if(T<D||T>=E||U<D||U>=E)throw new Error("splitScalar (endomorphism): failed, k="+r);return{k1neg:X,k1:T,k2neg:j,k2:U}}function oe(r){if(!["compact","recovered","der"].includes(r))throw new Error('Signature format must be "compact", "recovered", or "der"');return r}function ne(r,s){const c={};for(let e of Object.keys(s))c[e]=r[e]===void 0?s[e]:r[e];return h._abool2(c.lowS,"lowS"),h._abool2(c.prehash,"prehash"),c.format!==void 0&&oe(c.format),c}class ue extends Error{constructor(s=""){super(s)}}const C={Err:ue,_tlv:{encode:(r,s)=>{const{Err:c}=C;if(r<0||r>256)throw new c("tlv.encode: wrong tag");if(s.length&1)throw new c("tlv.encode: unpadded data");const e=s.length/2,w=h.numberToHexUnpadded(e);if(w.length/2&128)throw new c("tlv.encode: long form length too big");const p=e>127?h.numberToHexUnpadded(w.length/2|128):"";return h.numberToHexUnpadded(r)+p+w+s},decode(r,s){const{Err:c}=C;let e=0;if(r<0||r>256)throw new c("tlv.encode: wrong tag");if(s.length<2||s[e++]!==r)throw new c("tlv.decode: wrong tlv");const w=s[e++],p=!!(w&128);let l=0;if(!p)l=w;else{const R=w&127;if(!R)throw new c("tlv.decode(long): indefinite length not supported");if(R>4)throw new c("tlv.decode(long): byte length is too big");const T=s.subarray(e,e+R);if(T.length!==R)throw new c("tlv.decode: length bytes not complete");if(T[0]===0)throw new c("tlv.decode(long): zero leftmost byte");for(const U of T)l=l<<8|U;if(e+=R,l<128)throw new c("tlv.decode(long): not minimal encoding")}const F=s.subarray(e,e+l);if(F.length!==l)throw new c("tlv.decode: wrong value length");return{v:F,l:s.subarray(e+l)}}},_int:{encode(r){const{Err:s}=C;if(r<D)throw new s("integer: negative integers are not allowed");let c=h.numberToHexUnpadded(r);if(Number.parseInt(c[0],16)&8&&(c="00"+c),c.length&1)throw new s("unexpected DER parsing assertion: unpadded hex");return c},decode(r){const{Err:s}=C;if(r[0]&128)throw new s("invalid signature integer: negative");if(r[0]===0&&!(r[1]&128))throw new s("invalid signature integer: unnecessary leading zero");return h.bytesToNumberBE(r)}},toSig(r){const{Err:s,_int:c,_tlv:e}=C,w=h.ensureBytes("signature",r),{v:p,l}=e.decode(48,w);if(l.length)throw new s("invalid signature: left bytes after parsing");const{v:F,l:R}=e.decode(2,p),{v:T,l:U}=e.decode(2,R);if(U.length)throw new s("invalid signature: left bytes after parsing");return{r:c.decode(F),s:c.decode(T)}},hexFromSig(r){const{_tlv:s,_int:c}=C,e=s.encode(2,c.encode(r.r)),w=s.encode(2,c.encode(r.s)),p=e+w;return s.encode(48,p)}},D=BigInt(0),M=BigInt(1),le=BigInt(2),J=BigInt(3),pe=BigInt(4);function I(r,s){const{BYTES:c}=r;let e;if(typeof s=="bigint")e=s;else{let w=h.ensureBytes("private key",s);try{e=r.fromBytes(w)}catch{throw new Error(`invalid private key: expected ui8a of size ${c}, got ${typeof s}`)}}if(!r.isValidNot0(e))throw new Error("invalid private key: out of range [1..N-1]");return e}function de(r,s={}){const c=L._createCurveFields("weierstrass",r,s),{Fp:e,Fn:w}=c;let p=c.CURVE;const{h:l,n:F}=p;h._validateObject(s,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:R}=s;if(R&&(!e.is0(p.a)||typeof R.beta!="bigint"||!Array.isArray(R.basises)))throw new Error('invalid endo: expected "beta": bigint and "basises": array');const T=ye(e,w);function U(){if(!e.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}function X(B,o,n){const{x:t,y:i}=o.toAffine(),a=e.toBytes(t);if(h._abool2(n,"isCompressed"),n){U();const f=!e.isOdd(i);return H.concatBytes(fe(f),a)}else return H.concatBytes(Uint8Array.of(4),a,e.toBytes(i))}function j(B){h._abytes2(B,void 0,"Point");const{publicKey:o,publicKeyUncompressed:n}=T,t=B.length,i=B[0],a=B.subarray(1);if(t===o&&(i===2||i===3)){const f=e.fromBytes(a);if(!e.isValid(f))throw new Error("bad point: is not on curve, wrong x");const d=N(f);let u;try{u=e.sqrt(d)}catch(Z){const v=Z instanceof Error?": "+Z.message:"";throw new Error("bad point: is not on curve, sqrt error"+v)}U();const y=e.isOdd(u);return(i&1)===1!==y&&(u=e.neg(u)),{x:f,y:u}}else if(t===n&&i===4){const f=e.BYTES,d=e.fromBytes(a.subarray(0,f)),u=e.fromBytes(a.subarray(f,f*2));if(!K(d,u))throw new Error("bad point: is not on curve");return{x:d,y:u}}else throw new Error(`bad point: got length ${t}, expected compressed=${o} or uncompressed=${n}`)}const E=s.toBytes||X,O=s.fromBytes||j;function N(B){const o=e.sqr(B),n=e.mul(o,B);return e.add(e.add(n,e.mul(B,p.a)),p.b)}function K(B,o){const n=e.sqr(o),t=N(B);return e.eql(n,t)}if(!K(p.Gx,p.Gy))throw new Error("bad curve params: generator point");const q=e.mul(e.pow(p.a,J),pe),te=e.mul(e.sqr(p.b),BigInt(27));if(e.is0(e.add(q,te)))throw new Error("bad curve params: a or b");function A(B,o,n=!1){if(!e.isValid(o)||n&&e.is0(o))throw new Error(`bad point coordinate ${B}`);return o}function G(B){if(!(B instanceof g))throw new Error("ProjectivePoint expected")}function z(B){if(!R||!R.basises)throw new Error("no endo");return ae(B,R.basises,w.ORDER)}const re=h.memoized((B,o)=>{const{X:n,Y:t,Z:i}=B;if(e.eql(i,e.ONE))return{x:n,y:t};const a=B.is0();o==null&&(o=a?e.ONE:e.inv(i));const f=e.mul(n,o),d=e.mul(t,o),u=e.mul(i,o);if(a)return{x:e.ZERO,y:e.ZERO};if(!e.eql(u,e.ONE))throw new Error("invZ was invalid");return{x:f,y:d}}),P=h.memoized(B=>{if(B.is0()){if(s.allowInfinityPoint&&!e.is0(B.Y))return;throw new Error("bad point: ZERO")}const{x:o,y:n}=B.toAffine();if(!e.isValid(o)||!e.isValid(n))throw new Error("bad point: x or y not field elements");if(!K(o,n))throw new Error("bad point: equation left != right");if(!B.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function $(B,o,n,t,i){return n=new g(e.mul(n.X,B),n.Y,n.Z),o=L.negateCt(t,o),n=L.negateCt(i,n),o.add(n)}class g{constructor(o,n,t){this.X=A("x",o),this.Y=A("y",n,!0),this.Z=A("z",t),Object.freeze(this)}static CURVE(){return p}static fromAffine(o){const{x:n,y:t}=o||{};if(!o||!e.isValid(n)||!e.isValid(t))throw new Error("invalid affine point");if(o instanceof g)throw new Error("projective point not allowed");return e.is0(n)&&e.is0(t)?g.ZERO:new g(n,t,e.ONE)}static fromBytes(o){const n=g.fromAffine(O(h._abytes2(o,void 0,"point")));return n.assertValidity(),n}static fromHex(o){return g.fromBytes(h.ensureBytes("pointHex",o))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(o=8,n=!0){return k.createCache(this,o),n||this.multiply(J),this}assertValidity(){P(this)}hasEvenY(){const{y:o}=this.toAffine();if(!e.isOdd)throw new Error("Field doesn't support isOdd");return!e.isOdd(o)}equals(o){G(o);const{X:n,Y:t,Z:i}=this,{X:a,Y:f,Z:d}=o,u=e.eql(e.mul(n,d),e.mul(a,i)),y=e.eql(e.mul(t,d),e.mul(f,i));return u&&y}negate(){return new g(this.X,e.neg(this.Y),this.Z)}double(){const{a:o,b:n}=p,t=e.mul(n,J),{X:i,Y:a,Z:f}=this;let d=e.ZERO,u=e.ZERO,y=e.ZERO,m=e.mul(i,i),Z=e.mul(a,a),v=e.mul(f,f),b=e.mul(i,a);return b=e.add(b,b),y=e.mul(i,f),y=e.add(y,y),d=e.mul(o,y),u=e.mul(t,v),u=e.add(d,u),d=e.sub(Z,u),u=e.add(Z,u),u=e.mul(d,u),d=e.mul(b,d),y=e.mul(t,y),v=e.mul(o,v),b=e.sub(m,v),b=e.mul(o,b),b=e.add(b,y),y=e.add(m,m),m=e.add(y,m),m=e.add(m,v),m=e.mul(m,b),u=e.add(u,m),v=e.mul(a,f),v=e.add(v,v),m=e.mul(v,b),d=e.sub(d,m),y=e.mul(v,Z),y=e.add(y,y),y=e.add(y,y),new g(d,u,y)}add(o){G(o);const{X:n,Y:t,Z:i}=this,{X:a,Y:f,Z:d}=o;let u=e.ZERO,y=e.ZERO,m=e.ZERO;const Z=p.a,v=e.mul(p.b,J);let b=e.mul(n,a),x=e.mul(t,f),_=e.mul(i,d),Y=e.add(n,t),S=e.add(a,f);Y=e.mul(Y,S),S=e.add(b,x),Y=e.sub(Y,S),S=e.add(n,i);let V=e.add(a,d);return S=e.mul(S,V),V=e.add(b,_),S=e.sub(S,V),V=e.add(t,i),u=e.add(f,d),V=e.mul(V,u),u=e.add(x,_),V=e.sub(V,u),m=e.mul(Z,S),u=e.mul(v,_),m=e.add(u,m),u=e.sub(x,m),m=e.add(x,m),y=e.mul(u,m),x=e.add(b,b),x=e.add(x,b),_=e.mul(Z,_),S=e.mul(v,S),x=e.add(x,_),_=e.sub(b,_),_=e.mul(Z,_),S=e.add(S,_),b=e.mul(x,S),y=e.add(y,b),b=e.mul(V,S),u=e.mul(Y,u),u=e.sub(u,b),b=e.mul(Y,x),m=e.mul(V,m),m=e.add(m,b),new g(u,y,m)}subtract(o){return this.add(o.negate())}is0(){return this.equals(g.ZERO)}multiply(o){const{endo:n}=s;if(!w.isValidNot0(o))throw new Error("invalid scalar: out of range");let t,i;const a=f=>k.cached(this,f,d=>L.normalizeZ(g,d));if(n){const{k1neg:f,k1:d,k2neg:u,k2:y}=z(o),{p:m,f:Z}=a(d),{p:v,f:b}=a(y);i=Z.add(b),t=$(n.beta,m,v,f,u)}else{const{p:f,f:d}=a(o);t=f,i=d}return L.normalizeZ(g,[t,i])[0]}multiplyUnsafe(o){const{endo:n}=s,t=this;if(!w.isValid(o))throw new Error("invalid scalar: out of range");if(o===D||t.is0())return g.ZERO;if(o===M)return t;if(k.hasCache(this))return this.multiply(o);if(n){const{k1neg:i,k1:a,k2neg:f,k2:d}=z(o),{p1:u,p2:y}=L.mulEndoUnsafe(g,t,a,d);return $(n.beta,u,y,i,f)}else return k.unsafe(t,o)}multiplyAndAddUnsafe(o,n,t){const i=this.multiplyUnsafe(n).add(o.multiplyUnsafe(t));return i.is0()?void 0:i}toAffine(o){return re(this,o)}isTorsionFree(){const{isTorsionFree:o}=s;return l===M?!0:o?o(g,this):k.unsafe(this,F).is0()}clearCofactor(){const{clearCofactor:o}=s;return l===M?this:o?o(g,this):this.multiplyUnsafe(l)}isSmallOrder(){return this.multiplyUnsafe(l).is0()}toBytes(o=!0){return h._abool2(o,"isCompressed"),this.assertValidity(),E(g,this,o)}toHex(o=!0){return H.bytesToHex(this.toBytes(o))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(o=!0){return this.toBytes(o)}_setWindowSize(o){this.precompute(o)}static normalizeZ(o){return L.normalizeZ(g,o)}static msm(o,n){return L.pippenger(g,w,o,n)}static fromPrivateKey(o){return g.BASE.multiply(I(w,o))}}g.BASE=new g(p.Gx,p.Gy,e.ONE),g.ZERO=new g(e.ZERO,e.ONE,e.ZERO),g.Fp=e,g.Fn=w;const W=w.BITS,k=new L.wNAF(g,s.endo?Math.ceil(W/2):W);return g.BASE.precompute(8),g}function fe(r){return Uint8Array.of(r?2:3)}function ye(r,s){return{secretKey:s.BYTES,publicKey:1+r.BYTES,publicKeyUncompressed:1+2*r.BYTES,publicKeyHasPrefix:!0,signature:2*s.BYTES}}function he(r,s={}){const{Fn:c}=r,e=s.randomBytes||H.randomBytes,w=Object.assign(ye(r.Fp,c),{seed:ee.getMinHashLength(c.ORDER)});function p(E){try{return!!I(c,E)}catch{return!1}}function l(E,O){const{publicKey:N,publicKeyUncompressed:K}=w;try{const q=E.length;return O===!0&&q!==N||O===!1&&q!==K?!1:!!r.fromBytes(E)}catch{return!1}}function F(E=e(w.seed)){return ee.mapHashToField(h._abytes2(E,w.seed,"seed"),c.ORDER)}function R(E,O=!0){return r.BASE.multiply(I(c,E)).toBytes(O)}function T(E){const O=F(E);return{secretKey:O,publicKey:R(O)}}function U(E){if(typeof E=="bigint")return!1;if(E instanceof r)return!0;const{secretKey:O,publicKey:N,publicKeyUncompressed:K}=w;if(c.allowedLengths||O===N)return;const q=h.ensureBytes("key",E).length;return q===N||q===K}function X(E,O,N=!0){if(U(E)===!0)throw new Error("first arg must be private key");if(U(O)===!1)throw new Error("second arg must be public key");const K=I(c,E);return r.fromHex(O).multiply(K).toBytes(N)}return Object.freeze({getPublicKey:R,getSharedSecret:X,keygen:T,Point:r,utils:{isValidSecretKey:p,isValidPublicKey:l,randomSecretKey:F,isValidPrivateKey:p,randomPrivateKey:F,normPrivateKeyToScalar:E=>I(c,E),precompute(E=8,O=r.BASE){return O.precompute(E,!1)}},lengths:w})}function me(r,s,c={}){H.ahash(s),h._validateObject(c,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const e=c.randomBytes||H.randomBytes,w=c.hmac||((n,...t)=>we.hmac(s,n,H.concatBytes(...t))),{Fp:p,Fn:l}=r,{ORDER:F,BITS:R}=l,{keygen:T,getPublicKey:U,getSharedSecret:X,utils:j,lengths:E}=he(r,c),O={prehash:!1,lowS:typeof c.lowS=="boolean"?c.lowS:!1,format:void 0,extraEntropy:!1},N="compact";function K(n){const t=F>>M;return n>t}function q(n,t){if(!l.isValidNot0(t))throw new Error(`invalid signature ${n}: out of range 1..Point.Fn.ORDER`);return t}function te(n,t){oe(t);const i=E.signature,a=t==="compact"?i:t==="recovered"?i+1:void 0;return h._abytes2(n,a,`${t} signature`)}class A{constructor(t,i,a){this.r=q("r",t),this.s=q("s",i),a!=null&&(this.recovery=a),Object.freeze(this)}static fromBytes(t,i=N){te(t,i);let a;if(i==="der"){const{r:y,s:m}=C.toSig(h._abytes2(t));return new A(y,m)}i==="recovered"&&(a=t[0],i="compact",t=t.subarray(1));const f=l.BYTES,d=t.subarray(0,f),u=t.subarray(f,f*2);return new A(l.fromBytes(d),l.fromBytes(u),a)}static fromHex(t,i){return this.fromBytes(H.hexToBytes(t),i)}addRecoveryBit(t){return new A(this.r,this.s,t)}recoverPublicKey(t){const i=p.ORDER,{r:a,s:f,recovery:d}=this;if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");if(F*le<i&&d>1)throw new Error("recovery id is ambiguous for h>1 curve");const y=d===2||d===3?a+F:a;if(!p.isValid(y))throw new Error("recovery id 2 or 3 invalid");const m=p.toBytes(y),Z=r.fromBytes(H.concatBytes(fe((d&1)===0),m)),v=l.inv(y),b=z(h.ensureBytes("msgHash",t)),x=l.create(-b*v),_=l.create(f*v),Y=r.BASE.multiplyUnsafe(x).add(Z.multiplyUnsafe(_));if(Y.is0())throw new Error("point at infinify");return Y.assertValidity(),Y}hasHighS(){return K(this.s)}toBytes(t=N){if(oe(t),t==="der")return H.hexToBytes(C.hexFromSig(this));const i=l.toBytes(this.r),a=l.toBytes(this.s);if(t==="recovered"){if(this.recovery==null)throw new Error("recovery bit must be present");return H.concatBytes(Uint8Array.of(this.recovery),i,a)}return H.concatBytes(i,a)}toHex(t){return H.bytesToHex(this.toBytes(t))}assertValidity(){}static fromCompact(t){return A.fromBytes(h.ensureBytes("sig",t),"compact")}static fromDER(t){return A.fromBytes(h.ensureBytes("sig",t),"der")}normalizeS(){return this.hasHighS()?new A(this.r,l.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return H.bytesToHex(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return H.bytesToHex(this.toBytes("compact"))}}const G=c.bits2int||function(t){if(t.length>8192)throw new Error("input is too large");const i=h.bytesToNumberBE(t),a=t.length*8-R;return a>0?i>>BigInt(a):i},z=c.bits2int_modN||function(t){return l.create(G(t))},re=h.bitMask(R);function P(n){return h.aInRange("num < 2^"+R,n,D,re),l.toBytes(n)}function $(n,t){return h._abytes2(n,void 0,"message"),t?h._abytes2(s(n),void 0,"prehashed message"):n}function g(n,t,i){if(["recovered","canonical"].some(x=>x in i))throw new Error("sign() legacy options not supported");const{lowS:a,prehash:f,extraEntropy:d}=ne(i,O);n=$(n,f);const u=z(n),y=I(l,t),m=[P(y),P(u)];if(d!=null&&d!==!1){const x=d===!0?e(E.secretKey):d;m.push(h.ensureBytes("extraEntropy",x))}const Z=H.concatBytes(...m),v=u;function b(x){const _=G(x);if(!l.isValidNot0(_))return;const Y=l.inv(_),S=r.BASE.multiply(_).toAffine(),V=l.create(S.x);if(V===D)return;const Q=l.create(Y*l.create(v+V*y));if(Q===D)return;let se=(S.x===V?0:2)|Number(S.y&M),ie=Q;return a&&K(Q)&&(ie=l.neg(Q),se^=1),new A(V,ie,se)}return{seed:Z,k2sig:b}}function W(n,t,i={}){n=h.ensureBytes("message",n);const{seed:a,k2sig:f}=g(n,t,i);return h.createHmacDrbg(s.outputLen,l.BYTES,w)(a,f)}function k(n){let t;const i=typeof n=="string"||H.isBytes(n),a=!i&&n!==null&&typeof n=="object"&&typeof n.r=="bigint"&&typeof n.s=="bigint";if(!i&&!a)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(a)t=new A(n.r,n.s);else if(i){try{t=A.fromBytes(h.ensureBytes("sig",n),"der")}catch(f){if(!(f instanceof C.Err))throw f}if(!t)try{t=A.fromBytes(h.ensureBytes("sig",n),"compact")}catch{return!1}}return t||!1}function B(n,t,i,a={}){const{lowS:f,prehash:d,format:u}=ne(a,O);if(i=h.ensureBytes("publicKey",i),t=$(h.ensureBytes("message",t),d),"strict"in a)throw new Error("options.strict was renamed to lowS");const y=u===void 0?k(n):A.fromBytes(h.ensureBytes("sig",n),u);if(y===!1)return!1;try{const m=r.fromBytes(i);if(f&&y.hasHighS())return!1;const{r:Z,s:v}=y,b=z(t),x=l.inv(v),_=l.create(b*x),Y=l.create(Z*x),S=r.BASE.multiplyUnsafe(_).add(m.multiplyUnsafe(Y));return S.is0()?!1:l.create(S.x)===Z}catch{return!1}}function o(n,t,i={}){const{prehash:a}=ne(i,O);return t=$(t,a),A.fromBytes(n,"recovered").recoverPublicKey(t).toBytes()}return Object.freeze({keygen:T,getPublicKey:U,getSharedSecret:X,utils:j,lengths:E,Point:r,sign:W,verify:B,recoverPublicKey:o,Signature:A,hash:s})}function ge(r){const s={a:r.a,b:r.b,p:r.Fp.ORDER,n:r.n,h:r.h,Gx:r.Gx,Gy:r.Gy},c=r.Fp;let e=r.allowedPrivateKeyLengths?Array.from(new Set(r.allowedPrivateKeyLengths.map(l=>Math.ceil(l/2)))):void 0;const w=ee.Field(s.n,{BITS:r.nBitLength,allowedLengths:e,modFromBytes:r.wrapPrivateKey}),p={Fp:c,Fn:w,allowInfinityPoint:r.allowInfinityPoint,endo:r.endo,isTorsionFree:r.isTorsionFree,clearCofactor:r.clearCofactor,fromBytes:r.fromBytes,toBytes:r.toBytes};return{CURVE:s,curveOpts:p}}function be(r){const{CURVE:s,curveOpts:c}=ge(r),e={hmac:r.hmac,randomBytes:r.randomBytes,lowS:r.lowS,bits2int:r.bits2int,bits2int_modN:r.bits2int_modN};return{CURVE:s,curveOpts:c,hash:r.hash,ecdsaOpts:e}}function Ee(r,s){const c=s.Point;return Object.assign({},s,{ProjectivePoint:c,CURVE:Object.assign({},r,ee.nLength(c.Fn.ORDER,c.Fn.BITS))})}function Be(r){const{CURVE:s,curveOpts:c,hash:e,ecdsaOpts:w}=be(r),p=de(s,c),l=me(p,e,w);return Ee(r,l)}exports.DER=C;exports.DERErr=ue;exports._normFnElement=I;exports._splitEndoScalar=ae;exports.ecdh=he;exports.ecdsa=me;exports.weierstrass=Be;exports.weierstrassN=de;