@gardenfi/swap 0.0.2 → 0.1.0-beta.1

package/dist/index379.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const et=require("./index380.cjs"),K=require("./index351.cjs"),a=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(y){y.lowS!==void 0&&a.abool("lowS",y.lowS),y.prehash!==void 0&&a.abool("prehash",y.prehash)}function ut(y){const r=et.validateBasic(y);a.validateObject(r,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:B,a:R}=r;if(t){if(!B.eql(R,B.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...r})}class ct extends Error{constructor(r=""){super(r)}}const U={Err:ct,_tlv:{encode:(y,r)=>{const{Err:t}=U;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length&1)throw new t("tlv.encode: unpadded data");const B=r.length/2,R=a.numberToHexUnpadded(B);if(R.length/2&128)throw new t("tlv.encode: long form length too big");const z=B>127?a.numberToHexUnpadded(R.length/2|128):"";return a.numberToHexUnpadded(y)+z+R+r},decode(y,r){const{Err:t}=U;let B=0;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length<2||r[B++]!==y)throw new t("tlv.decode: wrong tlv");const R=r[B++],z=!!(R&128);let T=0;if(!z)T=R;else{const S=R&127;if(!S)throw new t("tlv.decode(long): indefinite length not supported");if(S>4)throw new t("tlv.decode(long): byte length is too big");const F=r.subarray(B,B+S);if(F.length!==S)throw new t("tlv.decode: length bytes not complete");if(F[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const A of F)T=T<<8|A;if(B+=S,T<128)throw new t("tlv.decode(long): not minimal encoding")}const Y=r.subarray(B,B+T);if(Y.length!==T)throw new t("tlv.decode: wrong value length");return{v:Y,l:r.subarray(B+T)}}},_int:{encode(y){const{Err:r}=U;if(y<I)throw new r("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(y);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new r("unexpected DER parsing assertion: unpadded hex");return t},decode(y){const{Err:r}=U;if(y[0]&128)throw new r("invalid signature integer: negative");if(y[0]===0&&!(y[1]&128))throw new r("invalid signature integer: unnecessary leading zero");return a.bytesToNumberBE(y)}},toSig(y){const{Err:r,_int:t,_tlv:B}=U,R=a.ensureBytes("signature",y),{v:z,l:T}=B.decode(48,R);if(T.length)throw new r("invalid signature: left bytes after parsing");const{v:Y,l:S}=B.decode(2,z),{v:F,l:A}=B.decode(2,S);if(A.length)throw new r("invalid signature: left bytes after parsing");return{r:t.decode(Y),s:t.decode(F)}},hexFromSig(y){const{_tlv:r,_int:t}=U,B=r.encode(2,t.encode(y.r)),R=r.encode(2,t.encode(y.s)),z=B+R;return r.encode(48,z)}};function st(y,r){return a.bytesToHex(a.numberToBytesBE(y,r))}const I=BigInt(0),O=BigInt(1);BigInt(2);const it=BigInt(3),dt=BigInt(4);function lt(y){const r=ut(y),{Fp:t}=r,B=K.Field(r.n,r.nBitLength),R=r.toBytes||((w,e,s)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),z=r.fromBytes||(w=>{const e=w.subarray(1),s=t.fromBytes(e.subarray(0,t.BYTES)),c=t.fromBytes(e.subarray(t.BYTES,2*t.BYTES));return{x:s,y:c}});function T(w){const{a:e,b:s}=r,c=t.sqr(w),f=t.mul(c,w);return t.add(t.add(f,t.mul(w,e)),s)}function Y(w,e){const s=t.sqr(e),c=T(w);return t.eql(s,c)}if(!Y(r.Gx,r.Gy))throw new Error("bad curve params: generator point");const S=t.mul(t.pow(r.a,it),dt),F=t.mul(t.sqr(r.b),BigInt(27));if(t.is0(t.add(S,F)))throw new Error("bad curve params: a or b");function A(w){return a.inRange(w,O,r.n)}function D(w){const{allowedPrivateKeyLengths:e,nByteLength:s,wrapPrivateKey:c,n:f}=r;if(e&&typeof w!="bigint"){if(a.isBytes(w)&&(w=a.bytesToHex(w)),typeof w!="string"||!e.includes(w.length))throw new Error("invalid private key");w=w.padStart(s*2,"0")}let g;try{g=typeof w=="bigint"?w:a.bytesToNumberBE(a.ensureBytes("private key",w,s))}catch{throw new Error("invalid private key, expected hex or "+s+" bytes, got "+typeof w)}return c&&(g=K.mod(g,f)),a.aInRange("private key",g,O,f),g}function _(w){if(!(w instanceof E))throw new Error("ProjectivePoint expected")}const nt=a.memoized((w,e)=>{const{px:s,py:c,pz:f}=w;if(t.eql(f,t.ONE))return{x:s,y:c};const g=w.is0();e==null&&(e=g?t.ONE:t.inv(f));const v=t.mul(s,e),b=t.mul(c,e),l=t.mul(f,e);if(g)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:b}}),G=a.memoized(w=>{if(w.is0()){if(r.allowInfinityPoint&&!t.is0(w.py))return;throw new Error("bad point: ZERO")}const{x:e,y:s}=w.toAffine();if(!t.isValid(e)||!t.isValid(s))throw new Error("bad point: x or y not FE");if(!Y(e,s))throw new Error("bad point: equation left != right");if(!w.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class E{constructor(e,s,c){if(e==null||!t.isValid(e))throw new Error("x required");if(s==null||!t.isValid(s)||t.is0(s))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");this.px=e,this.py=s,this.pz=c,Object.freeze(this)}static fromAffine(e){const{x:s,y:c}=e||{};if(!e||!t.isValid(s)||!t.isValid(c))throw new Error("invalid affine point");if(e instanceof E)throw new Error("projective point not allowed");const f=g=>t.eql(g,t.ZERO);return f(s)&&f(c)?E.ZERO:new E(s,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const s=K.FpInvertBatch(t,e.map(c=>c.pz));return e.map((c,f)=>c.toAffine(s[f])).map(E.fromAffine)}static fromHex(e){const s=E.fromAffine(z(a.ensureBytes("pointHex",e)));return s.assertValidity(),s}static fromPrivateKey(e){return E.BASE.multiply(D(e))}static msm(e,s){return et.pippenger(E,B,e,s)}_setWindowSize(e){C.setWindowSize(this,e)}assertValidity(){G(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e,l=t.eql(t.mul(s,b),t.mul(g,f)),p=t.eql(t.mul(c,b),t.mul(v,f));return l&&p}negate(){return new E(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:s}=r,c=t.mul(s,it),{px:f,py:g,pz:v}=this;let b=t.ZERO,l=t.ZERO,p=t.ZERO,u=t.mul(f,f),N=t.mul(g,g),o=t.mul(v,v),n=t.mul(f,g);return n=t.add(n,n),p=t.mul(f,v),p=t.add(p,p),b=t.mul(e,p),l=t.mul(c,o),l=t.add(b,l),b=t.sub(N,l),l=t.add(N,l),l=t.mul(b,l),b=t.mul(n,b),p=t.mul(c,p),o=t.mul(e,o),n=t.sub(u,o),n=t.mul(e,n),n=t.add(n,p),p=t.add(u,u),u=t.add(p,u),u=t.add(u,o),u=t.mul(u,n),l=t.add(l,u),o=t.mul(g,v),o=t.add(o,o),u=t.mul(o,n),b=t.sub(b,u),p=t.mul(o,N),p=t.add(p,p),p=t.add(p,p),new E(b,l,p)}add(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e;let l=t.ZERO,p=t.ZERO,u=t.ZERO;const N=r.a,o=t.mul(r.b,it);let n=t.mul(s,g),i=t.mul(c,v),m=t.mul(f,b),d=t.add(s,c),h=t.add(g,v);d=t.mul(d,h),h=t.add(n,i),d=t.sub(d,h),h=t.add(s,f);let x=t.add(g,b);return h=t.mul(h,x),x=t.add(n,m),h=t.sub(h,x),x=t.add(c,f),l=t.add(v,b),x=t.mul(x,l),l=t.add(i,m),x=t.sub(x,l),u=t.mul(N,h),l=t.mul(o,m),u=t.add(l,u),l=t.sub(i,u),u=t.add(i,u),p=t.mul(l,u),i=t.add(n,n),i=t.add(i,n),m=t.mul(N,m),h=t.mul(o,h),i=t.add(i,m),m=t.sub(n,m),m=t.mul(N,m),h=t.add(h,m),n=t.mul(i,h),p=t.add(p,n),n=t.mul(x,h),l=t.mul(d,l),l=t.sub(l,n),n=t.mul(d,i),u=t.mul(x,u),u=t.add(u,n),new E(l,p,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(E.ZERO)}wNAF(e){return C.wNAFCached(this,e,E.normalizeZ)}multiplyUnsafe(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,I,c);const f=E.ZERO;if(e===I)return f;if(this.is0()||e===O)return this;if(!s||C.hasPrecomputes(this))return C.wNAFCachedUnsafe(this,e,E.normalizeZ);let{k1neg:g,k1:v,k2neg:b,k2:l}=s.splitScalar(e),p=f,u=f,N=this;for(;v>I||l>I;)v&O&&(p=p.add(N)),l&O&&(u=u.add(N)),N=N.double(),v>>=O,l>>=O;return g&&(p=p.negate()),b&&(u=u.negate()),u=new E(t.mul(u.px,s.beta),u.py,u.pz),p.add(u)}multiply(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,O,c);let f,g;if(s){const{k1neg:v,k1:b,k2neg:l,k2:p}=s.splitScalar(e);let{p:u,f:N}=this.wNAF(b),{p:o,f:n}=this.wNAF(p);u=C.constTimeNegate(v,u),o=C.constTimeNegate(l,o),o=new E(t.mul(o.px,s.beta),o.py,o.pz),f=u.add(o),g=N.add(n)}else{const{p:v,f:b}=this.wNAF(e);f=v,g=b}return E.normalizeZ([f,g])[0]}multiplyAndAddUnsafe(e,s,c){const f=E.BASE,g=(b,l)=>l===I||l===O||!b.equals(f)?b.multiplyUnsafe(l):b.multiply(l),v=g(this,s).add(g(e,c));return v.is0()?void 0:v}toAffine(e){return nt(this,e)}isTorsionFree(){const{h:e,isTorsionFree:s}=r;if(e===O)return!0;if(s)return s(E,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:s}=r;return e===O?this:s?s(E,this):this.multiplyUnsafe(r.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),R(E,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}E.BASE=new E(r.Gx,r.Gy,t.ONE),E.ZERO=new E(t.ZERO,t.ONE,t.ZERO);const{endo:tt,nBitLength:H}=r,C=et.wNAF(E,tt?Math.ceil(H/2):H);return{CURVE:r,ProjectivePoint:E,normPrivateKeyToScalar:D,weierstrassEquation:T,isWithinCurveOrder:A}}function ft(y){const r=et.validateBasic(y);return a.validateObject(r,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...r})}function ht(y){const r=ft(y),{Fp:t,n:B,nByteLength:R,nBitLength:z}=r,T=t.BYTES+1,Y=2*t.BYTES+1;function S(o){return K.mod(o,B)}function F(o){return K.invert(o,B)}const{ProjectivePoint:A,normPrivateKeyToScalar:D,weierstrassEquation:_,isWithinCurveOrder:nt}=lt({...r,toBytes(o,n,i){const m=n.toAffine(),d=t.toBytes(m.x),h=a.concatBytes;return a.abool("isCompressed",i),i?h(Uint8Array.from([n.hasEvenY()?2:3]),d):h(Uint8Array.from([4]),d,t.toBytes(m.y))},fromBytes(o){const n=o.length,i=o[0],m=o.subarray(1);if(n===T&&(i===2||i===3)){const d=a.bytesToNumberBE(m);if(!a.inRange(d,O,t.ORDER))throw new Error("Point is not on curve");const h=_(d);let x;try{x=t.sqrt(h)}catch(L){const q=L instanceof Error?": "+L.message:"";throw new Error("Point is not on curve"+q)}const Z=(x&O)===O;return(i&1)===1!==Z&&(x=t.neg(x)),{x:d,y:x}}else if(n===Y&&i===4){const d=t.fromBytes(m.subarray(0,t.BYTES)),h=t.fromBytes(m.subarray(t.BYTES,2*t.BYTES));return{x:d,y:h}}else{const d=T,h=Y;throw new Error("invalid Point, expected length of "+d+", or uncompressed "+h+", got "+n)}}});function G(o){const n=B>>O;return o>n}function E(o){return G(o)?S(-o):o}const tt=(o,n,i)=>a.bytesToNumberBE(o.slice(n,i));class H{constructor(n,i,m){a.aInRange("r",n,O,B),a.aInRange("s",i,O,B),this.r=n,this.s=i,m!=null&&(this.recovery=m),Object.freeze(this)}static fromCompact(n){const i=R;return n=a.ensureBytes("compactSignature",n,i*2),new H(tt(n,0,i),tt(n,i,2*i))}static fromDER(n){const{r:i,s:m}=U.toSig(a.ensureBytes("DER",n));return new H(i,m)}assertValidity(){}addRecoveryBit(n){return new H(this.r,this.s,n)}recoverPublicKey(n){const{r:i,s:m,recovery:d}=this,h=f(a.ensureBytes("msgHash",n));if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");const x=d===2||d===3?i+r.n:i;if(x>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=d&1?"03":"02",V=A.fromHex(Z+st(x,t.BYTES)),L=F(x),q=S(-h*L),X=S(m*L),j=A.BASE.multiplyAndAddUnsafe(V,q,X);if(!j)throw new Error("point at infinify");return j.assertValidity(),j}hasHighS(){return G(this.s)}normalizeS(){return this.hasHighS()?new H(this.r,S(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return U.hexFromSig(this)}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){const n=R;return st(this.r,n)+st(this.s,n)}}const C={isValidPrivateKey(o){try{return D(o),!0}catch{return!1}},normPrivateKeyToScalar:D,randomPrivateKey:()=>{const o=K.getMinHashLength(r.n);return K.mapHashToField(r.randomBytes(o),r.n)},precompute(o=8,n=A.BASE){return n._setWindowSize(o),n.multiply(BigInt(3)),n}};function w(o,n=!0){return A.fromPrivateKey(o).toRawBytes(n)}function e(o){if(typeof o=="bigint")return!1;if(o instanceof A)return!0;const i=a.ensureBytes("key",o).length,m=t.BYTES,d=m+1,h=2*m+1;if(!(r.allowedPrivateKeyLengths||R===d))return i===d||i===h}function s(o,n,i=!0){if(e(o)===!0)throw new Error("first arg must be private key");if(e(n)===!1)throw new Error("second arg must be public key");return A.fromHex(n).multiply(D(o)).toRawBytes(i)}const c=r.bits2int||function(o){if(o.length>8192)throw new Error("input is too large");const n=a.bytesToNumberBE(o),i=o.length*8-z;return i>0?n>>BigInt(i):n},f=r.bits2int_modN||function(o){return S(c(o))},g=a.bitMask(z);function v(o){return a.aInRange("num < 2^"+z,o,I,g),a.numberToBytesBE(o,R)}function b(o,n,i=l){if(["recovered","canonical"].some(P=>P in i))throw new Error("sign() legacy options not supported");const{hash:m,randomBytes:d}=r;let{lowS:h,prehash:x,extraEntropy:Z}=i;h==null&&(h=!0),o=a.ensureBytes("msgHash",o),at(i),x&&(o=a.ensureBytes("prehashed msgHash",m(o)));const V=f(o),L=D(n),q=[v(L),v(V)];if(Z!=null&&Z!==!1){const P=Z===!0?d(t.BYTES):Z;q.push(a.ensureBytes("extraEntropy",P))}const X=a.concatBytes(...q),j=V;function rt(P){const M=c(P);if(!nt(M))return;const ot=F(M),Q=A.BASE.multiply(M).toAffine(),k=S(Q.x);if(k===I)return;const $=S(ot*S(j+k*L));if($===I)return;let J=(Q.x===k?0:2)|Number(Q.y&O),W=$;return h&&G($)&&(W=E($),J^=1),new H(k,W,J)}return{seed:X,k2sig:rt}}const l={lowS:r.lowS,prehash:!1},p={lowS:r.lowS,prehash:!1};function u(o,n,i=l){const{seed:m,k2sig:d}=b(o,n,i),h=r;return a.createHmacDrbg(h.hash.outputLen,h.nByteLength,h.hmac)(m,d)}A.BASE._setWindowSize(8);function N(o,n,i,m=p){var J;const d=o;n=a.ensureBytes("msgHash",n),i=a.ensureBytes("publicKey",i);const{lowS:h,prehash:x,format:Z}=m;if(at(m),"strict"in m)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const V=typeof d=="string"||a.isBytes(d),L=!V&&!Z&&typeof d=="object"&&d!==null&&typeof d.r=="bigint"&&typeof d.s=="bigint";if(!V&&!L)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let q,X;try{if(L&&(q=new H(d.r,d.s)),V){try{Z!=="compact"&&(q=H.fromDER(d))}catch(W){if(!(W instanceof U.Err))throw W}!q&&Z!=="der"&&(q=H.fromCompact(d))}X=A.fromHex(i)}catch{return!1}if(!q||h&&q.hasHighS())return!1;x&&(n=r.hash(n));const{r:j,s:rt}=q,P=f(n),M=F(rt),ot=S(P*M),Q=S(j*M),k=(J=A.BASE.multiplyAndAddUnsafe(X,ot,Q))==null?void 0:J.toAffine();return k?S(k.x)===j:!1}return{CURVE:r,getPublicKey:w,getSharedSecret:s,sign:u,verify:N,ProjectivePoint:A,Signature:H,utils:C}}exports.DER=U;exports.DERErr=ct;exports.weierstrass=ht;exports.weierstrassPoints=lt;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const et=require("./index380.cjs"),K=require("./index346.cjs"),a=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(y){y.lowS!==void 0&&a.abool("lowS",y.lowS),y.prehash!==void 0&&a.abool("prehash",y.prehash)}function ut(y){const r=et.validateBasic(y);a.validateObject(r,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:B,a:R}=r;if(t){if(!B.eql(R,B.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...r})}class ct extends Error{constructor(r=""){super(r)}}const U={Err:ct,_tlv:{encode:(y,r)=>{const{Err:t}=U;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length&1)throw new t("tlv.encode: unpadded data");const B=r.length/2,R=a.numberToHexUnpadded(B);if(R.length/2&128)throw new t("tlv.encode: long form length too big");const z=B>127?a.numberToHexUnpadded(R.length/2|128):"";return a.numberToHexUnpadded(y)+z+R+r},decode(y,r){const{Err:t}=U;let B=0;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length<2||r[B++]!==y)throw new t("tlv.decode: wrong tlv");const R=r[B++],z=!!(R&128);let T=0;if(!z)T=R;else{const S=R&127;if(!S)throw new t("tlv.decode(long): indefinite length not supported");if(S>4)throw new t("tlv.decode(long): byte length is too big");const F=r.subarray(B,B+S);if(F.length!==S)throw new t("tlv.decode: length bytes not complete");if(F[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const A of F)T=T<<8|A;if(B+=S,T<128)throw new t("tlv.decode(long): not minimal encoding")}const Y=r.subarray(B,B+T);if(Y.length!==T)throw new t("tlv.decode: wrong value length");return{v:Y,l:r.subarray(B+T)}}},_int:{encode(y){const{Err:r}=U;if(y<I)throw new r("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(y);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new r("unexpected DER parsing assertion: unpadded hex");return t},decode(y){const{Err:r}=U;if(y[0]&128)throw new r("invalid signature integer: negative");if(y[0]===0&&!(y[1]&128))throw new r("invalid signature integer: unnecessary leading zero");return a.bytesToNumberBE(y)}},toSig(y){const{Err:r,_int:t,_tlv:B}=U,R=a.ensureBytes("signature",y),{v:z,l:T}=B.decode(48,R);if(T.length)throw new r("invalid signature: left bytes after parsing");const{v:Y,l:S}=B.decode(2,z),{v:F,l:A}=B.decode(2,S);if(A.length)throw new r("invalid signature: left bytes after parsing");return{r:t.decode(Y),s:t.decode(F)}},hexFromSig(y){const{_tlv:r,_int:t}=U,B=r.encode(2,t.encode(y.r)),R=r.encode(2,t.encode(y.s)),z=B+R;return r.encode(48,z)}};function st(y,r){return a.bytesToHex(a.numberToBytesBE(y,r))}const I=BigInt(0),O=BigInt(1);BigInt(2);const it=BigInt(3),dt=BigInt(4);function lt(y){const r=ut(y),{Fp:t}=r,B=K.Field(r.n,r.nBitLength),R=r.toBytes||((w,e,s)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),z=r.fromBytes||(w=>{const e=w.subarray(1),s=t.fromBytes(e.subarray(0,t.BYTES)),c=t.fromBytes(e.subarray(t.BYTES,2*t.BYTES));return{x:s,y:c}});function T(w){const{a:e,b:s}=r,c=t.sqr(w),f=t.mul(c,w);return t.add(t.add(f,t.mul(w,e)),s)}function Y(w,e){const s=t.sqr(e),c=T(w);return t.eql(s,c)}if(!Y(r.Gx,r.Gy))throw new Error("bad curve params: generator point");const S=t.mul(t.pow(r.a,it),dt),F=t.mul(t.sqr(r.b),BigInt(27));if(t.is0(t.add(S,F)))throw new Error("bad curve params: a or b");function A(w){return a.inRange(w,O,r.n)}function D(w){const{allowedPrivateKeyLengths:e,nByteLength:s,wrapPrivateKey:c,n:f}=r;if(e&&typeof w!="bigint"){if(a.isBytes(w)&&(w=a.bytesToHex(w)),typeof w!="string"||!e.includes(w.length))throw new Error("invalid private key");w=w.padStart(s*2,"0")}let g;try{g=typeof w=="bigint"?w:a.bytesToNumberBE(a.ensureBytes("private key",w,s))}catch{throw new Error("invalid private key, expected hex or "+s+" bytes, got "+typeof w)}return c&&(g=K.mod(g,f)),a.aInRange("private key",g,O,f),g}function _(w){if(!(w instanceof E))throw new Error("ProjectivePoint expected")}const nt=a.memoized((w,e)=>{const{px:s,py:c,pz:f}=w;if(t.eql(f,t.ONE))return{x:s,y:c};const g=w.is0();e==null&&(e=g?t.ONE:t.inv(f));const v=t.mul(s,e),b=t.mul(c,e),l=t.mul(f,e);if(g)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:b}}),G=a.memoized(w=>{if(w.is0()){if(r.allowInfinityPoint&&!t.is0(w.py))return;throw new Error("bad point: ZERO")}const{x:e,y:s}=w.toAffine();if(!t.isValid(e)||!t.isValid(s))throw new Error("bad point: x or y not FE");if(!Y(e,s))throw new Error("bad point: equation left != right");if(!w.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class E{constructor(e,s,c){if(e==null||!t.isValid(e))throw new Error("x required");if(s==null||!t.isValid(s)||t.is0(s))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");this.px=e,this.py=s,this.pz=c,Object.freeze(this)}static fromAffine(e){const{x:s,y:c}=e||{};if(!e||!t.isValid(s)||!t.isValid(c))throw new Error("invalid affine point");if(e instanceof E)throw new Error("projective point not allowed");const f=g=>t.eql(g,t.ZERO);return f(s)&&f(c)?E.ZERO:new E(s,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const s=K.FpInvertBatch(t,e.map(c=>c.pz));return e.map((c,f)=>c.toAffine(s[f])).map(E.fromAffine)}static fromHex(e){const s=E.fromAffine(z(a.ensureBytes("pointHex",e)));return s.assertValidity(),s}static fromPrivateKey(e){return E.BASE.multiply(D(e))}static msm(e,s){return et.pippenger(E,B,e,s)}_setWindowSize(e){C.setWindowSize(this,e)}assertValidity(){G(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e,l=t.eql(t.mul(s,b),t.mul(g,f)),p=t.eql(t.mul(c,b),t.mul(v,f));return l&&p}negate(){return new E(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:s}=r,c=t.mul(s,it),{px:f,py:g,pz:v}=this;let b=t.ZERO,l=t.ZERO,p=t.ZERO,u=t.mul(f,f),N=t.mul(g,g),o=t.mul(v,v),n=t.mul(f,g);return n=t.add(n,n),p=t.mul(f,v),p=t.add(p,p),b=t.mul(e,p),l=t.mul(c,o),l=t.add(b,l),b=t.sub(N,l),l=t.add(N,l),l=t.mul(b,l),b=t.mul(n,b),p=t.mul(c,p),o=t.mul(e,o),n=t.sub(u,o),n=t.mul(e,n),n=t.add(n,p),p=t.add(u,u),u=t.add(p,u),u=t.add(u,o),u=t.mul(u,n),l=t.add(l,u),o=t.mul(g,v),o=t.add(o,o),u=t.mul(o,n),b=t.sub(b,u),p=t.mul(o,N),p=t.add(p,p),p=t.add(p,p),new E(b,l,p)}add(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e;let l=t.ZERO,p=t.ZERO,u=t.ZERO;const N=r.a,o=t.mul(r.b,it);let n=t.mul(s,g),i=t.mul(c,v),m=t.mul(f,b),d=t.add(s,c),h=t.add(g,v);d=t.mul(d,h),h=t.add(n,i),d=t.sub(d,h),h=t.add(s,f);let x=t.add(g,b);return h=t.mul(h,x),x=t.add(n,m),h=t.sub(h,x),x=t.add(c,f),l=t.add(v,b),x=t.mul(x,l),l=t.add(i,m),x=t.sub(x,l),u=t.mul(N,h),l=t.mul(o,m),u=t.add(l,u),l=t.sub(i,u),u=t.add(i,u),p=t.mul(l,u),i=t.add(n,n),i=t.add(i,n),m=t.mul(N,m),h=t.mul(o,h),i=t.add(i,m),m=t.sub(n,m),m=t.mul(N,m),h=t.add(h,m),n=t.mul(i,h),p=t.add(p,n),n=t.mul(x,h),l=t.mul(d,l),l=t.sub(l,n),n=t.mul(d,i),u=t.mul(x,u),u=t.add(u,n),new E(l,p,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(E.ZERO)}wNAF(e){return C.wNAFCached(this,e,E.normalizeZ)}multiplyUnsafe(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,I,c);const f=E.ZERO;if(e===I)return f;if(this.is0()||e===O)return this;if(!s||C.hasPrecomputes(this))return C.wNAFCachedUnsafe(this,e,E.normalizeZ);let{k1neg:g,k1:v,k2neg:b,k2:l}=s.splitScalar(e),p=f,u=f,N=this;for(;v>I||l>I;)v&O&&(p=p.add(N)),l&O&&(u=u.add(N)),N=N.double(),v>>=O,l>>=O;return g&&(p=p.negate()),b&&(u=u.negate()),u=new E(t.mul(u.px,s.beta),u.py,u.pz),p.add(u)}multiply(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,O,c);let f,g;if(s){const{k1neg:v,k1:b,k2neg:l,k2:p}=s.splitScalar(e);let{p:u,f:N}=this.wNAF(b),{p:o,f:n}=this.wNAF(p);u=C.constTimeNegate(v,u),o=C.constTimeNegate(l,o),o=new E(t.mul(o.px,s.beta),o.py,o.pz),f=u.add(o),g=N.add(n)}else{const{p:v,f:b}=this.wNAF(e);f=v,g=b}return E.normalizeZ([f,g])[0]}multiplyAndAddUnsafe(e,s,c){const f=E.BASE,g=(b,l)=>l===I||l===O||!b.equals(f)?b.multiplyUnsafe(l):b.multiply(l),v=g(this,s).add(g(e,c));return v.is0()?void 0:v}toAffine(e){return nt(this,e)}isTorsionFree(){const{h:e,isTorsionFree:s}=r;if(e===O)return!0;if(s)return s(E,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:s}=r;return e===O?this:s?s(E,this):this.multiplyUnsafe(r.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),R(E,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}E.BASE=new E(r.Gx,r.Gy,t.ONE),E.ZERO=new E(t.ZERO,t.ONE,t.ZERO);const{endo:tt,nBitLength:H}=r,C=et.wNAF(E,tt?Math.ceil(H/2):H);return{CURVE:r,ProjectivePoint:E,normPrivateKeyToScalar:D,weierstrassEquation:T,isWithinCurveOrder:A}}function ft(y){const r=et.validateBasic(y);return a.validateObject(r,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...r})}function ht(y){const r=ft(y),{Fp:t,n:B,nByteLength:R,nBitLength:z}=r,T=t.BYTES+1,Y=2*t.BYTES+1;function S(o){return K.mod(o,B)}function F(o){return K.invert(o,B)}const{ProjectivePoint:A,normPrivateKeyToScalar:D,weierstrassEquation:_,isWithinCurveOrder:nt}=lt({...r,toBytes(o,n,i){const m=n.toAffine(),d=t.toBytes(m.x),h=a.concatBytes;return a.abool("isCompressed",i),i?h(Uint8Array.from([n.hasEvenY()?2:3]),d):h(Uint8Array.from([4]),d,t.toBytes(m.y))},fromBytes(o){const n=o.length,i=o[0],m=o.subarray(1);if(n===T&&(i===2||i===3)){const d=a.bytesToNumberBE(m);if(!a.inRange(d,O,t.ORDER))throw new Error("Point is not on curve");const h=_(d);let x;try{x=t.sqrt(h)}catch(L){const q=L instanceof Error?": "+L.message:"";throw new Error("Point is not on curve"+q)}const Z=(x&O)===O;return(i&1)===1!==Z&&(x=t.neg(x)),{x:d,y:x}}else if(n===Y&&i===4){const d=t.fromBytes(m.subarray(0,t.BYTES)),h=t.fromBytes(m.subarray(t.BYTES,2*t.BYTES));return{x:d,y:h}}else{const d=T,h=Y;throw new Error("invalid Point, expected length of "+d+", or uncompressed "+h+", got "+n)}}});function G(o){const n=B>>O;return o>n}function E(o){return G(o)?S(-o):o}const tt=(o,n,i)=>a.bytesToNumberBE(o.slice(n,i));class H{constructor(n,i,m){a.aInRange("r",n,O,B),a.aInRange("s",i,O,B),this.r=n,this.s=i,m!=null&&(this.recovery=m),Object.freeze(this)}static fromCompact(n){const i=R;return n=a.ensureBytes("compactSignature",n,i*2),new H(tt(n,0,i),tt(n,i,2*i))}static fromDER(n){const{r:i,s:m}=U.toSig(a.ensureBytes("DER",n));return new H(i,m)}assertValidity(){}addRecoveryBit(n){return new H(this.r,this.s,n)}recoverPublicKey(n){const{r:i,s:m,recovery:d}=this,h=f(a.ensureBytes("msgHash",n));if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");const x=d===2||d===3?i+r.n:i;if(x>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=d&1?"03":"02",V=A.fromHex(Z+st(x,t.BYTES)),L=F(x),q=S(-h*L),X=S(m*L),j=A.BASE.multiplyAndAddUnsafe(V,q,X);if(!j)throw new Error("point at infinify");return j.assertValidity(),j}hasHighS(){return G(this.s)}normalizeS(){return this.hasHighS()?new H(this.r,S(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return U.hexFromSig(this)}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){const n=R;return st(this.r,n)+st(this.s,n)}}const C={isValidPrivateKey(o){try{return D(o),!0}catch{return!1}},normPrivateKeyToScalar:D,randomPrivateKey:()=>{const o=K.getMinHashLength(r.n);return K.mapHashToField(r.randomBytes(o),r.n)},precompute(o=8,n=A.BASE){return n._setWindowSize(o),n.multiply(BigInt(3)),n}};function w(o,n=!0){return A.fromPrivateKey(o).toRawBytes(n)}function e(o){if(typeof o=="bigint")return!1;if(o instanceof A)return!0;const i=a.ensureBytes("key",o).length,m=t.BYTES,d=m+1,h=2*m+1;if(!(r.allowedPrivateKeyLengths||R===d))return i===d||i===h}function s(o,n,i=!0){if(e(o)===!0)throw new Error("first arg must be private key");if(e(n)===!1)throw new Error("second arg must be public key");return A.fromHex(n).multiply(D(o)).toRawBytes(i)}const c=r.bits2int||function(o){if(o.length>8192)throw new Error("input is too large");const n=a.bytesToNumberBE(o),i=o.length*8-z;return i>0?n>>BigInt(i):n},f=r.bits2int_modN||function(o){return S(c(o))},g=a.bitMask(z);function v(o){return a.aInRange("num < 2^"+z,o,I,g),a.numberToBytesBE(o,R)}function b(o,n,i=l){if(["recovered","canonical"].some(P=>P in i))throw new Error("sign() legacy options not supported");const{hash:m,randomBytes:d}=r;let{lowS:h,prehash:x,extraEntropy:Z}=i;h==null&&(h=!0),o=a.ensureBytes("msgHash",o),at(i),x&&(o=a.ensureBytes("prehashed msgHash",m(o)));const V=f(o),L=D(n),q=[v(L),v(V)];if(Z!=null&&Z!==!1){const P=Z===!0?d(t.BYTES):Z;q.push(a.ensureBytes("extraEntropy",P))}const X=a.concatBytes(...q),j=V;function rt(P){const M=c(P);if(!nt(M))return;const ot=F(M),Q=A.BASE.multiply(M).toAffine(),k=S(Q.x);if(k===I)return;const $=S(ot*S(j+k*L));if($===I)return;let J=(Q.x===k?0:2)|Number(Q.y&O),W=$;return h&&G($)&&(W=E($),J^=1),new H(k,W,J)}return{seed:X,k2sig:rt}}const l={lowS:r.lowS,prehash:!1},p={lowS:r.lowS,prehash:!1};function u(o,n,i=l){const{seed:m,k2sig:d}=b(o,n,i),h=r;return a.createHmacDrbg(h.hash.outputLen,h.nByteLength,h.hmac)(m,d)}A.BASE._setWindowSize(8);function N(o,n,i,m=p){var J;const d=o;n=a.ensureBytes("msgHash",n),i=a.ensureBytes("publicKey",i);const{lowS:h,prehash:x,format:Z}=m;if(at(m),"strict"in m)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const V=typeof d=="string"||a.isBytes(d),L=!V&&!Z&&typeof d=="object"&&d!==null&&typeof d.r=="bigint"&&typeof d.s=="bigint";if(!V&&!L)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let q,X;try{if(L&&(q=new H(d.r,d.s)),V){try{Z!=="compact"&&(q=H.fromDER(d))}catch(W){if(!(W instanceof U.Err))throw W}!q&&Z!=="der"&&(q=H.fromCompact(d))}X=A.fromHex(i)}catch{return!1}if(!q||h&&q.hasHighS())return!1;x&&(n=r.hash(n));const{r:j,s:rt}=q,P=f(n),M=F(rt),ot=S(P*M),Q=S(j*M),k=(J=A.BASE.multiplyAndAddUnsafe(X,ot,Q))==null?void 0:J.toAffine();return k?S(k.x)===j:!1}return{CURVE:r,getPublicKey:w,getSharedSecret:s,sign:u,verify:N,ProjectivePoint:A,Signature:H,utils:C}}exports.DER=U;exports.DERErr=ct;exports.weierstrass=ht;exports.weierstrassPoints=lt;

package/dist/index379.js

@@ -1,5 +1,5 @@
 import { validateBasic as mt, pippenger as bt, wNAF as vt } from "./index380.js";
-import { Field as Bt, mod as wt, getMinHashLength as xt, mapHashToField as St, FpInvertBatch as Rt, invert as Ot } from "./index351.js";
+import { Field as Bt, mod as wt, getMinHashLength as xt, mapHashToField as St, FpInvertBatch as Rt, invert as Ot } from "./index346.js";
 import { bytesToNumberBE as _, bitMask as At, validateObject as pt, concatBytes as lt, aInRange as W, ensureBytes as F, hexToBytes as dt, isBytes as yt, createHmacDrbg as Tt, memoized as ft, abool as tt, bytesToHex as ut, inRange as gt, numberToHexUnpadded as rt, numberToBytesBE as Et } from "./index359.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function ht(m) {

package/dist/index38.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("react"),n=require("@gardenfi/garden-book"),u=require("@gardenfi/orderbook"),s=require("framer-motion"),p=require("./index34.cjs"),w=require("./index64.cjs"),v=require("./index6.cjs"),x=require("./index65.cjs"),N=require("./index25.cjs"),y=({inputAsset:t,outputAsset:i,formattedRate:l,formattedTokenPrice:o,className:a=""})=>e.createElement("div",{className:"flex min-w-fit items-center gap-1"},e.createElement(n.Typography,{size:"h5",weight:"regular",className:`!text-nowrap ${a}`},"1 ",t==null?void 0:t.symbol," ≈"),e.createElement(n.Typography,{size:"h5",weight:"regular",className:`!text-nowrap ${a}`},l&&`${l} ${i==null?void 0:i.symbol}`,o&&`$${o}`)),S=()=>{const[t,i]=e.useState(!1),[,l]=e.useState(!1),o=e.useRef(null),{inputAsset:a,outputAsset:r,networkFees:E}=v.swapStore(),{solanaAddress:c,bitcoinAddress:m,evmAddress:d}=N.useAddresses(),f=e.useMemo(()=>p.formatAmount((a==null?void 0:a.price)??0,0,2),[a==null?void 0:a.price]),g=e.useMemo(()=>a?u.isBitcoin(a.chain)?m:u.isSolana(a.chain)?c:d:void 0,[a,m,c,d]),h=e.useMemo(()=>r?u.isBitcoin(r.chain)?m:u.isSolana(r.chain)?c:d:void 0,[r,m,c,d]);return e.createElement("div",{className:"flex flex-col rounded-2xl bg-white/50 pb-4 mt-3 transition-all duration-200"},e.createElement("div",{className:"flex w-full items-center justify-between rounded-2xl px-4 pt-4"},e.createElement("div",{className:"relative flex w-full items-center justify-start gap-1"},e.createElement(s.AnimatePresence,{mode:"wait"},t?e.createElement(s.motion.div,{key:"expanded",className:"w-fit",...w.delayedFadeAnimation},e.createElement("div",{className:"flex items-center gap-1"},e.createElement(n.Typography,{size:"h5",weight:"regular",className:"!text-mid-grey"},"Rate"),e.createElement("span",{ref:o,className:"inline-block cursor-pointer",onMouseEnter:()=>l(!0),onMouseLeave:()=>l(!1)},e.createElement(n.InfoIcon,{className:"h-3 w-3 !fill-mid-grey"})))):e.createElement(s.motion.div,{key:"collapsed",className:"w-fit",...w.delayedFadeAnimation},e.createElement(y,{inputAsset:a,outputAsset:r,formattedTokenPrice:f,className:"!text-mid-grey"})))),e.createElement("div",{className:"flex w-full items-center justify-end gap-1"},e.createElement(s.AnimatePresence,{mode:"wait"},t?e.createElement(s.motion.div,{key:"expanded",className:"w-fit",...w.delayedFadeAnimation},e.createElement(y,{inputAsset:a,outputAsset:r,formattedTokenPrice:f})):e.createElement(s.motion.div,{key:"collapsed",className:"w-fit",...w.delayedFadeAnimation},e.createElement("div",{className:"flex min-w-fit items-center gap-1"},e.createElement(n.GasStationIcon,{className:"h-3 w-3"}),e.createElement(n.Typography,{size:"h5",weight:"regular",className:"!text-nowrap"},"Free"))))),e.createElement(s.motion.div,{initial:{width:0,scale:0,opacity:0},animate:{width:"auto",scale:1,opacity:1},exit:{width:0,scale:0,opacity:0},transition:{duration:.2,ease:"easeInOut"},className:"pl-1"},e.createElement(n.KeyboardDownIcon,{className:`h-4 w-4 cursor-pointer px-1 transition-transform duration-300 ${t?"rotate-180":""}`,onClick:()=>i(!t)}))),e.createElement(s.AnimatePresence,null,t&&e.createElement(x.SwapSavingsAndAddresses,{refundAddress:g,receiveAddress:h,showComparison:()=>{},networkFeesValue:Number(p.formatAmountUsd(E,0))})))};exports.FeesAndRateDetails=S;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("react"),n=require("@gardenfi/garden-book"),u=require("@gardenfi/orderbook"),s=require("framer-motion"),p=require("./index34.cjs"),w=require("./index66.cjs"),v=require("./index6.cjs"),x=require("./index67.cjs"),N=require("./index25.cjs"),y=({inputAsset:t,outputAsset:i,formattedRate:l,formattedTokenPrice:o,className:a=""})=>e.createElement("div",{className:"flex min-w-fit items-center gap-1"},e.createElement(n.Typography,{size:"h5",weight:"regular",className:`!text-nowrap ${a}`},"1 ",t==null?void 0:t.symbol," ≈"),e.createElement(n.Typography,{size:"h5",weight:"regular",className:`!text-nowrap ${a}`},l&&`${l} ${i==null?void 0:i.symbol}`,o&&`$${o}`)),S=()=>{const[t,i]=e.useState(!1),[,l]=e.useState(!1),o=e.useRef(null),{inputAsset:a,outputAsset:r,networkFees:E}=v.swapStore(),{solanaAddress:c,bitcoinAddress:m,evmAddress:d}=N.useAddresses(),f=e.useMemo(()=>p.formatAmount((a==null?void 0:a.price)??0,0,2),[a==null?void 0:a.price]),g=e.useMemo(()=>a?u.isBitcoin(a.chain)?m:u.isSolana(a.chain)?c:d:void 0,[a,m,c,d]),h=e.useMemo(()=>r?u.isBitcoin(r.chain)?m:u.isSolana(r.chain)?c:d:void 0,[r,m,c,d]);return e.createElement("div",{className:"flex flex-col rounded-2xl bg-white/50 pb-4 mt-3 transition-all duration-200"},e.createElement("div",{className:"flex w-full items-center justify-between rounded-2xl px-4 pt-4"},e.createElement("div",{className:"relative flex w-full items-center justify-start gap-1"},e.createElement(s.AnimatePresence,{mode:"wait"},t?e.createElement(s.motion.div,{key:"expanded",className:"w-fit",...w.delayedFadeAnimation},e.createElement("div",{className:"flex items-center gap-1"},e.createElement(n.Typography,{size:"h5",weight:"regular",className:"!text-mid-grey"},"Rate"),e.createElement("span",{ref:o,className:"inline-block cursor-pointer",onMouseEnter:()=>l(!0),onMouseLeave:()=>l(!1)},e.createElement(n.InfoIcon,{className:"h-3 w-3 !fill-mid-grey"})))):e.createElement(s.motion.div,{key:"collapsed",className:"w-fit",...w.delayedFadeAnimation},e.createElement(y,{inputAsset:a,outputAsset:r,formattedTokenPrice:f,className:"!text-mid-grey"})))),e.createElement("div",{className:"flex w-full items-center justify-end gap-1"},e.createElement(s.AnimatePresence,{mode:"wait"},t?e.createElement(s.motion.div,{key:"expanded",className:"w-fit",...w.delayedFadeAnimation},e.createElement(y,{inputAsset:a,outputAsset:r,formattedTokenPrice:f})):e.createElement(s.motion.div,{key:"collapsed",className:"w-fit",...w.delayedFadeAnimation},e.createElement("div",{className:"flex min-w-fit items-center gap-1"},e.createElement(n.GasStationIcon,{className:"h-3 w-3"}),e.createElement(n.Typography,{size:"h5",weight:"regular",className:"!text-nowrap"},"Free"))))),e.createElement(s.motion.div,{initial:{width:0,scale:0,opacity:0},animate:{width:"auto",scale:1,opacity:1},exit:{width:0,scale:0,opacity:0},transition:{duration:.2,ease:"easeInOut"},className:"pl-1"},e.createElement(n.KeyboardDownIcon,{className:`h-4 w-4 cursor-pointer px-1 transition-transform duration-300 ${t?"rotate-180":""}`,onClick:()=>i(!t)}))),e.createElement(s.AnimatePresence,null,t&&e.createElement(x.SwapSavingsAndAddresses,{refundAddress:g,receiveAddress:h,showComparison:()=>{},networkFeesValue:Number(p.formatAmountUsd(E,0))})))};exports.FeesAndRateDetails=S;

package/dist/index38.js

@@ -3,9 +3,9 @@ import { Typography as f, InfoIcon as k, GasStationIcon as I, KeyboardDownIcon a
 import { isBitcoin as h, isSolana as u } from "@gardenfi/orderbook";
 import { AnimatePresence as w, motion as n } from "framer-motion";
 import { formatAmount as S, formatAmountUsd as D } from "./index34.js";
-import { delayedFadeAnimation as d } from "./index64.js";
+import { delayedFadeAnimation as d } from "./index66.js";
 import { swapStore as F } from "./index6.js";
-import { SwapSavingsAndAddresses as R } from "./index65.js";
+import { SwapSavingsAndAddresses as R } from "./index67.js";
 import { useAddresses as z } from "./index25.js";
 const N = ({
   inputAsset: t,

package/dist/index380.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index351.cjs"),m=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);const c=a*n,d=c+Math.abs(f)-1,g=f===0,l=f<0,u=a%2!==0;return{nextN:s,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:c}}function O(e,a){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof a))throw new Error("invalid point at index "+n)})}function z(e,a){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!a.isValid(t))throw new Error("invalid scalar at index "+n)})}const S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(s),d=new Array(Number(c)+1).fill(r),g=Math.floor((a.BITS-1)/s)*s;let l=r;for(let u=g;u>=0;u-=s){d.fill(r);for(let w=0;w<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].add(t[w])}let h=r;for(let w=d.length-1,p=r;w>0;w--)p=p.add(d[w]),h=h.add(p);if(l=l.add(h),u!==0)for(let w=0;w<s;w++)l=l.double()}return l}function Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index346.cjs"),m=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);const c=a*n,d=c+Math.abs(f)-1,g=f===0,l=f<0,u=a%2!==0;return{nextN:s,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:c}}function O(e,a){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof a))throw new Error("invalid point at index "+n)})}function z(e,a){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!a.isValid(t))throw new Error("invalid scalar at index "+n)})}const S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(s),d=new Array(Number(c)+1).fill(r),g=Math.floor((a.BITS-1)/s)*s;let l=r;for(let u=g;u>=0;u-=s){d.fill(r);for(let w=0;w<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].add(t[w])}let h=r;for(let w=d.length-1,p=r;w>0;w--)p=p.add(d[w]),h=h.add(p);if(l=l.add(h),u!==0)for(let w=0;w<s;w++)l=l.double()}return l}function Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;

package/dist/index380.js

@@ -1,4 +1,4 @@
-import { validateField as M, nLength as z } from "./index351.js";
+import { validateField as M, nLength as z } from "./index346.js";
 import { validateObject as O, bitLen as k, bitMask as x } from "./index359.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const E = BigInt(0), F = BigInt(1);

package/dist/index381.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./index352.cjs"),x=require("./index281.cjs"),y=require("./index282.cjs"),U=require("./index278.cjs"),c=require("./index277.cjs"),V=require("./index287.cjs");function l(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=P(t.type);if(r){const[i,a]=r;return I(e,{...t,type:a},{checksumAddress:n,length:i,staticPosition:o})}if(t.type==="tuple")return k(e,t,{checksumAddress:n,staticPosition:o});if(t.type==="address")return C(e,{checksum:n});if(t.type==="bool")return L(e);if(t.type.startsWith("bytes"))return E(e,t,{staticPosition:o});if(t.type.startsWith("uint")||t.type.startsWith("int"))return W(e,t);if(t.type==="string")return O(e,{staticPosition:o});throw new g.InvalidTypeError(t.type)}const S=32,z=32;function C(e,t={}){const{checksum:s=!1}=t,n=e.readBytes(32);return[(r=>s?x.checksum(r):r)(c.fromBytes(y.slice(n,-20))),32]}function I(e,t,s){const{checksumAddress:n,length:o,staticPosition:r}=s;if(!o){const d=y.toNumber(e.readBytes(z)),f=r+d,u=f+S;e.setPosition(f);const m=y.toNumber(e.readBytes(S)),h=p(t);let b=0;const w=[];for(let N=0;N<m;++N){e.setPosition(u+(h?N*32:b));const[j,H]=l(e,t,{checksumAddress:n,staticPosition:u});b+=H,w.push(j)}return e.setPosition(r+32),[w,32]}if(p(t)){const d=y.toNumber(e.readBytes(z)),f=r+d,u=[];for(let m=0;m<o;++m){e.setPosition(f+m*32);const[h]=l(e,t,{checksumAddress:n,staticPosition:f});u.push(h)}return e.setPosition(r+32),[u,32]}let i=0;const a=[];for(let d=0;d<o;++d){const[f,u]=l(e,t,{checksumAddress:n,staticPosition:r+i});i+=u,a.push(f)}return[a,i]}function L(e){return[y.toBoolean(e.readBytes(32),{size:32}),32]}function E(e,t,{staticPosition:s}){const[n,o]=t.type.split("bytes");if(!o){const i=y.toNumber(e.readBytes(32));e.setPosition(s+i);const a=y.toNumber(e.readBytes(32));if(a===0)return e.setPosition(s+32),["0x",32];const d=e.readBytes(a);return e.setPosition(s+32),[c.fromBytes(d),32]}return[c.fromBytes(e.readBytes(Number.parseInt(o,10),32)),32]}function W(e,t){const s=t.type.startsWith("int"),n=Number.parseInt(t.type.split("int")[1]||"256",10),o=e.readBytes(32);return[n>48?y.toBigInt(o,{signed:s}):y.toNumber(o,{signed:s}),32]}function k(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=t.components.length===0||t.components.some(({name:d})=>!d),i=r?[]:{};let a=0;if(p(t)){const d=y.toNumber(e.readBytes(z)),f=o+d;for(let u=0;u<t.components.length;++u){const m=t.components[u];e.setPosition(f+a);const[h,b]=l(e,m,{checksumAddress:n,staticPosition:f});a+=b,i[r?u:m==null?void 0:m.name]=h}return e.setPosition(o+32),[i,32]}for(let d=0;d<t.components.length;++d){const f=t.components[d],[u,m]=l(e,f,{checksumAddress:n,staticPosition:o});i[r?d:f==null?void 0:f.name]=u,a+=m}return[i,a]}function O(e,{staticPosition:t}){const s=y.toNumber(e.readBytes(32)),n=t+s;e.setPosition(n);const o=y.toNumber(e.readBytes(32));if(o===0)return e.setPosition(t+32),["",32];const r=e.readBytes(o,32),i=y.toString(y.trimLeft(r));return e.setPosition(t+32),[i,32]}function F({checksumAddress:e,parameters:t,values:s}){const n=[];for(let o=0;o<t.length;o++)n.push(B({checksumAddress:e,parameter:t[o],value:s[o]}));return n}function B({checksumAddress:e=!1,parameter:t,value:s}){const n=t,o=P(n.type);if(o){const[r,i]=o;return _(s,{checksumAddress:e,length:r,parameter:{...n,type:i}})}if(n.type==="tuple")return D(s,{checksumAddress:e,parameter:n});if(n.type==="address")return T(s,{checksum:e});if(n.type==="bool")return R(s);if(n.type.startsWith("uint")||n.type.startsWith("int")){const r=n.type.startsWith("int"),[,,i="256"]=V.integerRegex.exec(n.type)??[];return M(s,{signed:r,size:Number(i)})}if(n.type.startsWith("bytes"))return q(s,{type:n.type});if(n.type==="string")return $(s);throw new g.InvalidTypeError(n.type)}function A(e){let t=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?t+=32:t+=c.size(a)}const s=[],n=[];let o=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?(s.push(c.fromNumber(t+o,{size:32})),n.push(a),o+=c.size(a)):s.push(a)}return c.concat(...s,...n)}function T(e,t){const{checksum:s=!1}=t;return x.assert(e,{strict:s}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function _(e,t){const{checksumAddress:s,length:n,parameter:o}=t,r=n===null;if(!Array.isArray(e))throw new g.InvalidArrayError(e);if(!r&&e.length!==n)throw new g.ArrayLengthMismatchError({expectedLength:n,givenLength:e.length,type:`${o.type}[${n}]`});let i=!1;const a=[];for(let d=0;d<e.length;d++){const f=B({checksumAddress:s,parameter:o,value:e[d]});f.dynamic&&(i=!0),a.push(f)}if(r||i){const d=A(a);if(r){const f=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(f,d):f}}if(i)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function q(e,{type:t}){const[,s]=t.split("bytes"),n=c.size(e);if(!s){let o=e;return n%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(n,{size:32})),o)}}if(n!==Number.parseInt(s,10))throw new g.BytesSizeMismatchError({expectedSize:Number.parseInt(s,10),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function R(e){if(typeof e!="boolean")throw new U.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function M(e,{signed:t,size:s}){if(typeof s=="number"){const n=2n**(BigInt(s)-(t?1n:0n))-1n,o=t?-n-1n:0n;if(e>n||e<o)throw new c.IntegerOutOfRangeError({max:n.toString(),min:o.toString(),signed:t,size:s/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:t})}}function $(e){const t=c.fromString(e),s=Math.ceil(c.size(t)/32),n=[];for(let o=0;o<s;o++)n.push(c.padRight(c.slice(t,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(t),{size:32})),...n)}}function D(e,t){const{checksumAddress:s,parameter:n}=t;let o=!1;const r=[];for(let i=0;i<n.components.length;i++){const a=n.components[i],d=Array.isArray(e)?i:a.name,f=B({checksumAddress:s,parameter:a,value:e[d]});r.push(f),f.dynamic&&(o=!0)}return{dynamic:o,encoded:o?A(r):c.concat(...r.map(({encoded:i})=>i))}}function P(e){const t=e.match(/^(.*)\[(\d+)?\]$/);return t?[t[2]?Number(t[2]):null,t[1]]:void 0}function p(e){var n;const{type:t}=e;if(t==="string"||t==="bytes"||t.endsWith("[]"))return!0;if(t==="tuple")return(n=e.components)==null?void 0:n.some(p);const s=P(e.type);return!!(s&&p({...e,type:s[1]}))}exports.decodeAddress=C;exports.decodeArray=I;exports.decodeBool=L;exports.decodeBytes=E;exports.decodeNumber=W;exports.decodeParameter=l;exports.decodeString=O;exports.decodeTuple=k;exports.encode=A;exports.encodeAddress=T;exports.encodeArray=_;exports.encodeBoolean=R;exports.encodeBytes=q;exports.encodeNumber=M;exports.encodeString=$;exports.encodeTuple=D;exports.getArrayComponents=P;exports.hasDynamicChild=p;exports.prepareParameter=B;exports.prepareParameters=F;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;

package/dist/index381.js

@@ -1,346 +1,4 @@
-import { InvalidTypeError as C, InvalidArrayError as _, ArrayLengthMismatchError as $, BytesSizeMismatchError as O } from "./index352.js";
-import { checksum as M, assert as R } from "./index281.js";
-import { toNumber as u, slice as T, toBoolean as D, toBigInt as U, toString as V, trimLeft as j } from "./index282.js";
-import { BaseError as q } from "./index278.js";
-import { size as h, fromNumber as B, concat as m, fromBytes as w, padLeft as S, fromBoolean as F, IntegerOutOfRangeError as G, padRight as b, fromString as H, slice as J } from "./index277.js";
-import { integerRegex as K } from "./index287.js";
-function p(t, e, o) {
-  const { checksumAddress: n, staticPosition: s } = o, i = I(e.type);
-  if (i) {
-    const [r, d] = i;
-    return X(t, { ...e, type: d }, { checksumAddress: n, length: r, staticPosition: s });
-  }
-  if (e.type === "tuple")
-    return tt(t, e, {
-      checksumAddress: n,
-      staticPosition: s
-    });
-  if (e.type === "address")
-    return Q(t, { checksum: n });
-  if (e.type === "bool")
-    return Y(t);
-  if (e.type.startsWith("bytes"))
-    return Z(t, e, { staticPosition: s });
-  if (e.type.startsWith("uint") || e.type.startsWith("int"))
-    return v(t, e);
-  if (e.type === "string")
-    return et(t, { staticPosition: s });
-  throw new C(e.type);
-}
-const k = 32, A = 32;
-function Q(t, e = {}) {
-  const { checksum: o = !1 } = e, n = t.readBytes(32);
-  return [((i) => o ? M(i) : i)(w(T(n, -20))), 32];
-}
-function X(t, e, o) {
-  const { checksumAddress: n, length: s, staticPosition: i } = o;
-  if (!s) {
-    const c = u(t.readBytes(A)), a = i + c, f = a + k;
-    t.setPosition(a);
-    const y = u(t.readBytes(k)), l = g(e);
-    let P = 0;
-    const N = [];
-    for (let z = 0; z < y; ++z) {
-      t.setPosition(f + (l ? z * 32 : P));
-      const [L, E] = p(t, e, {
-        checksumAddress: n,
-        staticPosition: f
-      });
-      P += E, N.push(L);
-    }
-    return t.setPosition(i + 32), [N, 32];
-  }
-  if (g(e)) {
-    const c = u(t.readBytes(A)), a = i + c, f = [];
-    for (let y = 0; y < s; ++y) {
-      t.setPosition(a + y * 32);
-      const [l] = p(t, e, {
-        checksumAddress: n,
-        staticPosition: a
-      });
-      f.push(l);
-    }
-    return t.setPosition(i + 32), [f, 32];
-  }
-  let r = 0;
-  const d = [];
-  for (let c = 0; c < s; ++c) {
-    const [a, f] = p(t, e, {
-      checksumAddress: n,
-      staticPosition: i + r
-    });
-    r += f, d.push(a);
-  }
-  return [d, r];
-}
-function Y(t) {
-  return [D(t.readBytes(32), { size: 32 }), 32];
-}
-function Z(t, e, { staticPosition: o }) {
-  const [n, s] = e.type.split("bytes");
-  if (!s) {
-    const r = u(t.readBytes(32));
-    t.setPosition(o + r);
-    const d = u(t.readBytes(32));
-    if (d === 0)
-      return t.setPosition(o + 32), ["0x", 32];
-    const c = t.readBytes(d);
-    return t.setPosition(o + 32), [w(c), 32];
-  }
-  return [w(t.readBytes(Number.parseInt(s, 10), 32)), 32];
-}
-function v(t, e) {
-  const o = e.type.startsWith("int"), n = Number.parseInt(e.type.split("int")[1] || "256", 10), s = t.readBytes(32);
-  return [
-    n > 48 ? U(s, { signed: o }) : u(s, { signed: o }),
-    32
-  ];
-}
-function tt(t, e, o) {
-  const { checksumAddress: n, staticPosition: s } = o, i = e.components.length === 0 || e.components.some(({ name: c }) => !c), r = i ? [] : {};
-  let d = 0;
-  if (g(e)) {
-    const c = u(t.readBytes(A)), a = s + c;
-    for (let f = 0; f < e.components.length; ++f) {
-      const y = e.components[f];
-      t.setPosition(a + d);
-      const [l, P] = p(t, y, {
-        checksumAddress: n,
-        staticPosition: a
-      });
-      d += P, r[i ? f : y == null ? void 0 : y.name] = l;
-    }
-    return t.setPosition(s + 32), [r, 32];
-  }
-  for (let c = 0; c < e.components.length; ++c) {
-    const a = e.components[c], [f, y] = p(t, a, {
-      checksumAddress: n,
-      staticPosition: s
-    });
-    r[i ? c : a == null ? void 0 : a.name] = f, d += y;
-  }
-  return [r, d];
-}
-function et(t, { staticPosition: e }) {
-  const o = u(t.readBytes(32)), n = e + o;
-  t.setPosition(n);
-  const s = u(t.readBytes(32));
-  if (s === 0)
-    return t.setPosition(e + 32), ["", 32];
-  const i = t.readBytes(s, 32), r = V(j(i));
-  return t.setPosition(e + 32), [r, 32];
-}
-function pt({ checksumAddress: t, parameters: e, values: o }) {
-  const n = [];
-  for (let s = 0; s < e.length; s++)
-    n.push(x({
-      checksumAddress: t,
-      parameter: e[s],
-      value: o[s]
-    }));
-  return n;
-}
-function x({ checksumAddress: t = !1, parameter: e, value: o }) {
-  const n = e, s = I(n.type);
-  if (s) {
-    const [i, r] = s;
-    return st(o, {
-      checksumAddress: t,
-      length: i,
-      parameter: {
-        ...n,
-        type: r
-      }
-    });
-  }
-  if (n.type === "tuple")
-    return dt(o, {
-      checksumAddress: t,
-      parameter: n
-    });
-  if (n.type === "address")
-    return nt(o, {
-      checksum: t
-    });
-  if (n.type === "bool")
-    return it(o);
-  if (n.type.startsWith("uint") || n.type.startsWith("int")) {
-    const i = n.type.startsWith("int"), [, , r = "256"] = K.exec(n.type) ?? [];
-    return rt(o, {
-      signed: i,
-      size: Number(r)
-    });
-  }
-  if (n.type.startsWith("bytes"))
-    return ot(o, { type: n.type });
-  if (n.type === "string")
-    return ct(o);
-  throw new C(n.type);
-}
-function W(t) {
-  let e = 0;
-  for (let i = 0; i < t.length; i++) {
-    const { dynamic: r, encoded: d } = t[i];
-    r ? e += 32 : e += h(d);
-  }
-  const o = [], n = [];
-  let s = 0;
-  for (let i = 0; i < t.length; i++) {
-    const { dynamic: r, encoded: d } = t[i];
-    r ? (o.push(B(e + s, { size: 32 })), n.push(d), s += h(d)) : o.push(d);
-  }
-  return m(...o, ...n);
-}
-function nt(t, e) {
-  const { checksum: o = !1 } = e;
-  return R(t, { strict: o }), {
-    dynamic: !1,
-    encoded: S(t.toLowerCase())
-  };
-}
-function st(t, e) {
-  const { checksumAddress: o, length: n, parameter: s } = e, i = n === null;
-  if (!Array.isArray(t))
-    throw new _(t);
-  if (!i && t.length !== n)
-    throw new $({
-      expectedLength: n,
-      givenLength: t.length,
-      type: `${s.type}[${n}]`
-    });
-  let r = !1;
-  const d = [];
-  for (let c = 0; c < t.length; c++) {
-    const a = x({
-      checksumAddress: o,
-      parameter: s,
-      value: t[c]
-    });
-    a.dynamic && (r = !0), d.push(a);
-  }
-  if (i || r) {
-    const c = W(d);
-    if (i) {
-      const a = B(d.length, { size: 32 });
-      return {
-        dynamic: !0,
-        encoded: d.length > 0 ? m(a, c) : a
-      };
-    }
-    if (r)
-      return { dynamic: !0, encoded: c };
-  }
-  return {
-    dynamic: !1,
-    encoded: m(...d.map(({ encoded: c }) => c))
-  };
-}
-function ot(t, { type: e }) {
-  const [, o] = e.split("bytes"), n = h(t);
-  if (!o) {
-    let s = t;
-    return n % 32 !== 0 && (s = b(s, Math.ceil((t.length - 2) / 2 / 32) * 32)), {
-      dynamic: !0,
-      encoded: m(S(B(n, { size: 32 })), s)
-    };
-  }
-  if (n !== Number.parseInt(o, 10))
-    throw new O({
-      expectedSize: Number.parseInt(o, 10),
-      value: t
-    });
-  return { dynamic: !1, encoded: b(t) };
-}
-function it(t) {
-  if (typeof t != "boolean")
-    throw new q(`Invalid boolean value: "${t}" (type: ${typeof t}). Expected: \`true\` or \`false\`.`);
-  return { dynamic: !1, encoded: S(F(t)) };
-}
-function rt(t, { signed: e, size: o }) {
-  if (typeof o == "number") {
-    const n = 2n ** (BigInt(o) - (e ? 1n : 0n)) - 1n, s = e ? -n - 1n : 0n;
-    if (t > n || t < s)
-      throw new G({
-        max: n.toString(),
-        min: s.toString(),
-        signed: e,
-        size: o / 8,
-        value: t.toString()
-      });
-  }
-  return {
-    dynamic: !1,
-    encoded: B(t, {
-      size: 32,
-      signed: e
-    })
-  };
-}
-function ct(t) {
-  const e = H(t), o = Math.ceil(h(e) / 32), n = [];
-  for (let s = 0; s < o; s++)
-    n.push(b(J(e, s * 32, (s + 1) * 32)));
-  return {
-    dynamic: !0,
-    encoded: m(b(B(h(e), { size: 32 })), ...n)
-  };
-}
-function dt(t, e) {
-  const { checksumAddress: o, parameter: n } = e;
-  let s = !1;
-  const i = [];
-  for (let r = 0; r < n.components.length; r++) {
-    const d = n.components[r], c = Array.isArray(t) ? r : d.name, a = x({
-      checksumAddress: o,
-      parameter: d,
-      value: t[c]
-    });
-    i.push(a), a.dynamic && (s = !0);
-  }
-  return {
-    dynamic: s,
-    encoded: s ? W(i) : m(...i.map(({ encoded: r }) => r))
-  };
-}
-function I(t) {
-  const e = t.match(/^(.*)\[(\d+)?\]$/);
-  return e ? (
-    // Return `null` if the array is dynamic.
-    [e[2] ? Number(e[2]) : null, e[1]]
-  ) : void 0;
-}
-function g(t) {
-  var n;
-  const { type: e } = t;
-  if (e === "string" || e === "bytes" || e.endsWith("[]"))
-    return !0;
-  if (e === "tuple")
-    return (n = t.components) == null ? void 0 : n.some(g);
-  const o = I(t.type);
-  return !!(o && g({
-    ...t,
-    type: o[1]
-  }));
-}
+const o = "0.1.1";
 export {
-  Q as decodeAddress,
-  X as decodeArray,
-  Y as decodeBool,
-  Z as decodeBytes,
-  v as decodeNumber,
-  p as decodeParameter,
-  et as decodeString,
-  tt as decodeTuple,
-  W as encode,
-  nt as encodeAddress,
-  st as encodeArray,
-  it as encodeBoolean,
-  ot as encodeBytes,
-  rt as encodeNumber,
-  ct as encodeString,
-  dt as encodeTuple,
-  I as getArrayComponents,
-  g as hasDynamicChild,
-  x as prepareParameter,
-  pt as prepareParameters
+  o as version
 };

package/dist/index382.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index278.cjs"),h={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new r({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new n({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new e({offset:t});const i=this.position-t;this.assertPosition(i),this.position=i},getReadCount(t){return this.positionReadCount.get(t||this.position)||0},incrementPosition(t){if(t<0)throw new e({offset:t});const i=this.position+t;this.assertPosition(i),this.position=i},inspectByte(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectBytes(t,i){const s=i??this.position;return this.assertPosition(s+t-1),this.bytes.subarray(s,s+t)},inspectUint8(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectUint16(t){const i=t??this.position;return this.assertPosition(i+1),this.dataView.getUint16(i)},inspectUint24(t){const i=t??this.position;return this.assertPosition(i+2),(this.dataView.getUint16(i)<<8)+this.dataView.getUint8(i+2)},inspectUint32(t){const i=t??this.position;return this.assertPosition(i+3),this.dataView.getUint32(i)},pushByte(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushBytes(t){this.assertPosition(this.position+t.length-1),this.bytes.set(t,this.position),this.position+=t.length},pushUint8(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushUint16(t){this.assertPosition(this.position+1),this.dataView.setUint16(this.position,t),this.position+=2},pushUint24(t){this.assertPosition(this.position+2),this.dataView.setUint16(this.position,t>>8),this.dataView.setUint8(this.position+2,t&255),this.position+=3},pushUint32(t){this.assertPosition(this.position+3),this.dataView.setUint32(this.position,t),this.position+=4},readByte(){this.assertReadLimit(),this._touch();const t=this.inspectByte();return this.position++,t},readBytes(t,i){this.assertReadLimit(),this._touch();const s=this.inspectBytes(t);return this.position+=i??t,s},readUint8(){this.assertReadLimit(),this._touch();const t=this.inspectUint8();return this.position+=1,t},readUint16(){this.assertReadLimit(),this._touch();const t=this.inspectUint16();return this.position+=2,t},readUint24(){this.assertReadLimit(),this._touch();const t=this.inspectUint24();return this.position+=3,t},readUint32(){this.assertReadLimit(),this._touch();const t=this.inspectUint32();return this.position+=4,t},get remaining(){return this.bytes.length-this.position},setPosition(t){const i=this.position;return this.assertPosition(t),this.position=t,()=>this.position=i},_touch(){if(this.recursiveReadLimit===Number.POSITIVE_INFINITY)return;const t=this.getReadCount();this.positionReadCount.set(this.position,t+1),t>0&&this.recursiveReadCount++}};function a(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(h);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}class e extends o.BaseError{constructor({offset:i}){super(`Offset \`${i}\` cannot be negative.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.NegativeOffsetError"})}}class n extends o.BaseError{constructor({length:i,position:s}){super(`Position \`${s}\` is out of bounds (\`0 < position < ${i}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.PositionOutOfBoundsError"})}}class r extends o.BaseError{constructor({count:i,limit:s}){super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${i}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=e;exports.PositionOutOfBoundsError=n;exports.RecursiveReadLimitExceededError=r;exports.create=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class i extends Map{constructor(e){super(),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.maxSize=e}get(e){const t=super.get(e);return super.has(e)&&t!==void 0&&(this.delete(e),super.set(e,t)),t}set(e,t){if(super.set(e,t),this.maxSize&&this.size>this.maxSize){const s=this.keys().next().value;s&&this.delete(s)}return this}}exports.LruMap=i;