@gardenfi/utils 2.5.3-beta.0 → 2.5.3-beta.1

package/dist/index222.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function u(n,{errorInstance:r=new Error("timed out"),timeout:i,signal:a}){return new Promise((l,e)=>{(async()=>{let o;try{const t=new AbortController;i>0&&(o=setTimeout(()=>{a&&t.abort()},i)),l(await n({signal:(t==null?void 0:t.signal)||null}))}catch(t){(t==null?void 0:t.name)==="AbortError"&&e(r),e(t)}finally{clearTimeout(o)}})()})}exports.withTimeout=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index210.cjs");class t extends s.BaseError{constructor({current:r,depth:e}){super("Unbalanced parentheses.",{metaMessages:[`"${r.trim()}" has too many ${e>0?"opening":"closing"} parentheses.`],details:`Depth "${e}"`}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidParenthesisError"})}}exports.InvalidParenthesisError=t;

package/dist/index222.js

@@ -1,20 +1,19 @@
-function u(r, { errorInstance: e = new Error("timed out"), timeout: i, signal: a }) {
-  return new Promise((l, n) => {
-    (async () => {
-      let o;
-      try {
-        const t = new AbortController();
-        i > 0 && (o = setTimeout(() => {
-          a && t.abort();
-        }, i)), l(await r({ signal: (t == null ? void 0 : t.signal) || null }));
-      } catch (t) {
-        (t == null ? void 0 : t.name) === "AbortError" && n(e), n(t);
-      } finally {
-        clearTimeout(o);
-      }
-    })();
-  });
+import { BaseError as s } from "./index210.js";
+class n extends s {
+  constructor({ current: r, depth: e }) {
+    super("Unbalanced parentheses.", {
+      metaMessages: [
+        `"${r.trim()}" has too many ${e > 0 ? "opening" : "closing"} parentheses.`
+      ],
+      details: `Depth "${e}"`
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "InvalidParenthesisError"
+    });
+  }
 }
 export {
-  u as withTimeout
+  n as InvalidParenthesisError
 };

package/dist/index223.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(r,i){let t=r.toString();const n=t.startsWith("-");n&&(t=t.slice(1)),t=t.padStart(i,"0");let[l,e]=[t.slice(0,t.length-i),t.slice(t.length-i)];return e=e.replace(/(0+)$/,""),`${n?"-":""}${l||"0"}${e?`.${e}`:""}`}exports.formatUnits=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index210.cjs");class t extends r.BaseError{constructor({type:e}){super("Circular reference detected.",{metaMessages:[`Struct "${e}" is a circular reference.`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"CircularReferenceError"})}}exports.CircularReferenceError=t;

package/dist/index223.js

@@ -1,13 +1,16 @@
-function a(r, n) {
-  let t = r.toString();
-  const i = t.startsWith("-");
-  i && (t = t.slice(1)), t = t.padStart(n, "0");
-  let [l, e] = [
-    t.slice(0, t.length - n),
-    t.slice(t.length - n)
-  ];
-  return e = e.replace(/(0+)$/, ""), `${i ? "-" : ""}${l || "0"}${e ? `.${e}` : ""}`;
+import { BaseError as r } from "./index210.js";
+class a extends r {
+  constructor({ type: e }) {
+    super("Circular reference detected.", {
+      metaMessages: [`Struct "${e}" is a circular reference.`]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "CircularReferenceError"
+    });
+  }
 }
 export {
-  a as formatUnits
+  a as CircularReferenceError
 };

package/dist/index224.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function e(){return{current:0,take(){return this.current++},reset(){this.current=0}}}const t=e();exports.idCache=t;

package/dist/index224.js

@@ -1,24 +1,15 @@
-class r 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);
+function r() {
+  return {
+    current: 0,
+    take() {
+      return this.current++;
+    },
+    reset() {
+      this.current = 0;
     }
-    return this;
-  }
+  };
 }
+const t = /* @__PURE__ */ r();
 export {
-  r as LruMap
+  t as idCache
 };

package/dist/index225.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const C=require("./index127.cjs"),f=require("./index41.cjs"),e=require("./index132.cjs"),q=require("./index52.cjs"),w=require("./index143.cjs"),p=3;function D(r,{abi:n,address:u,args:E,docsPath:d,functionName:o,sender:R}){const a=r instanceof e.RawContractError?r:r instanceof f.BaseError?r.walk(l=>"data"in l)||r.walk():{},{code:b,data:t,details:c,message:s,shortMessage:i}=a,g=r instanceof C.AbiDecodingZeroDataError?new e.ContractFunctionZeroDataError({functionName:o}):[p,w.InternalRpcError.code].includes(b)&&(t||c||s||i)?new e.ContractFunctionRevertedError({abi:n,data:typeof t=="object"?t.data:t,functionName:o,message:a instanceof q.RpcRequestError?c:i??s}):r;return new e.ContractFunctionExecutionError(g,{abi:n,args:E,contractAddress:u,docsPath:d,functionName:o,sender:R})}exports.getContractError=D;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index171.cjs"),t=new o.LruMap(8192);function i(r,{enabled:n=!0,id:e}){if(!n||!e)return r();if(t.get(e))return t.get(e);const u=r().finally(()=>t.delete(e));return t.set(e,u),u}exports.promiseCache=t;exports.withDedupe=i;

package/dist/index225.js

@@ -1,25 +1,14 @@
-import { AbiDecodingZeroDataError as p } from "./index127.js";
-import { BaseError as C } from "./index41.js";
-import { RawContractError as w, ContractFunctionZeroDataError as g, ContractFunctionRevertedError as l, ContractFunctionExecutionError as D } from "./index132.js";
-import { RpcRequestError as F } from "./index52.js";
-import { InternalRpcError as O } from "./index143.js";
-const _ = 3;
-function Z(r, { abi: n, address: i, args: E, docsPath: d, functionName: o, sender: f }) {
-  const e = r instanceof w ? r : r instanceof C ? r.walk((R) => "data" in R) || r.walk() : {}, { code: m, data: t, details: a, message: c, shortMessage: s } = e, u = r instanceof p ? new g({ functionName: o }) : [_, O.code].includes(m) && (t || a || c || s) ? new l({
-    abi: n,
-    data: typeof t == "object" ? t.data : t,
-    functionName: o,
-    message: e instanceof F ? a : s ?? c
-  }) : r;
-  return new D(u, {
-    abi: n,
-    args: E,
-    contractAddress: i,
-    docsPath: d,
-    functionName: o,
-    sender: f
-  });
+import { LruMap as u } from "./index171.js";
+const t = /* @__PURE__ */ new u(8192);
+function s(r, { enabled: o = !0, id: e }) {
+  if (!o || !e)
+    return r();
+  if (t.get(e))
+    return t.get(e);
+  const n = r().finally(() => t.delete(e));
+  return t.set(e, n), n;
 }
 export {
-  Z as getContractError
+  t as promiseCache,
+  s as withDedupe
 };

package/dist/index226.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index283.cjs"),r=require("./index284.cjs");function n(t){return e.hashSignature(r.toSignature(t))}exports.toSignatureHash=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index238.cjs"),x=require("./index233.cjs"),_=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),f=new Uint32Array(64);class u extends e.HashMD{constructor(o=32){super(64,o,8,!1),this.A=e.SHA256_IV[0]|0,this.B=e.SHA256_IV[1]|0,this.C=e.SHA256_IV[2]|0,this.D=e.SHA256_IV[3]|0,this.E=e.SHA256_IV[4]|0,this.F=e.SHA256_IV[5]|0,this.G=e.SHA256_IV[6]|0,this.H=e.SHA256_IV[7]|0}get(){const{A:o,B:h,C:s,D:a,E:r,F:b,G:c,H:i}=this;return[o,h,s,a,r,b,c,i]}set(o,h,s,a,r,b,c,i){this.A=o|0,this.B=h|0,this.C=s|0,this.D=a|0,this.E=r|0,this.F=b|0,this.G=c|0,this.H=i|0}process(o,h){for(let t=0;t<16;t++,h+=4)f[t]=o.getUint32(h,!1);for(let t=16;t<64;t++){const H=f[t-15],d=f[t-2],S=x.rotr(H,7)^x.rotr(H,18)^H>>>3,l=x.rotr(d,17)^x.rotr(d,19)^d>>>10;f[t]=l+f[t-7]+S+f[t-16]|0}let{A:s,B:a,C:r,D:b,E:c,F:i,G:n,H:A}=this;for(let t=0;t<64;t++){const H=x.rotr(c,6)^x.rotr(c,11)^x.rotr(c,25),d=A+H+e.Chi(c,i,n)+_[t]+f[t]|0,l=(x.rotr(s,2)^x.rotr(s,13)^x.rotr(s,22))+e.Maj(s,a,r)|0;A=n,n=i,i=c,c=b+d|0,b=r,r=a,a=s,s=d+l|0}s=s+this.A|0,a=a+this.B|0,r=r+this.C|0,b=b+this.D|0,c=c+this.E|0,i=i+this.F|0,n=n+this.G|0,A=A+this.H|0,this.set(s,a,r,b,c,i,n,A)}roundClean(){x.clean(f)}destroy(){this.set(0,0,0,0,0,0,0,0),x.clean(this.buffer)}}const I=x.createHasher(()=>new u);exports.SHA256=u;exports.sha256=I;

package/dist/index226.js

@@ -1,8 +1,106 @@
-import { hashSignature as t } from "./index283.js";
-import { toSignature as o } from "./index284.js";
-function a(r) {
-  return t(o(r));
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index238.js";
+import { createHasher as u, clean as C, rotr as i } from "./index233.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
+  }
+  roundClean() {
+    C(h);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  }
 }
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  a as toSignatureHash
+  E as SHA256,
+  y as sha256
 };

package/dist/index227.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index156.cjs"),t=require("./index228.cjs");function a(e,s){return r.keccak256(t.toPrefixedMessage(e),s)}exports.hashMessage=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index243.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(r,t){const e=s=>a.weierstrass({...r,hash:s});return{...e(t),create:e}}exports.createCurve=c;

package/dist/index227.js

@@ -1,8 +1,9 @@
-import { keccak256 as o } from "./index156.js";
-import { toPrefixedMessage as t } from "./index228.js";
-function f(e, r) {
-  return o(t(e), r);
+import { weierstrass as s } from "./index243.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function c(e, t) {
+  const r = (o) => s({ ...e, hash: o });
+  return { ...r(t), create: r };
 }
 export {
-  f as hashMessage
+  c as createCurve
 };

package/dist/index228.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index126.cjs"),o=require("./index159.cjs"),s=require("./index129.cjs"),r=require("./index155.cjs");function c(e){const t=typeof e=="string"?r.stringToHex(e):typeof e.raw=="string"?e.raw:r.bytesToHex(e.raw),i=r.stringToHex(`${n.presignMessagePrefix}${s.size(t)}`);return o.concat([i,t])}exports.toPrefixedMessage=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("./index244.cjs"),Y=require("./index233.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const h=BigInt(0),g=BigInt(1),b=BigInt(2),x=BigInt(3),M=BigInt(4),A=BigInt(5),k=BigInt(7),j=BigInt(8),O=BigInt(9),V=BigInt(16);function q(t,n){const r=t%n;return r>=h?r:n+r}function U(t,n,r){let o=t;for(;n-- >h;)o*=o,o%=r;return o}function y(t,n){if(t===h)throw new Error("invert: expected non-zero number");if(n<=h)throw new Error("invert: expected positive modulus, got "+n);let r=q(t,n),o=n,l=h,f=g;for(;r!==h;){const i=o/r,s=o%r,u=l-f*i;o=r,r=s,l=f,f=u}if(o!==g)throw new Error("invert: does not exist");return q(l,n)}function I(t,n,r){if(!t.eql(t.sqr(n),r))throw new Error("Cannot find square root")}function Z(t,n){const r=(t.ORDER+g)/M,o=t.pow(n,r);return I(t,o,n),o}function $(t,n){const r=(t.ORDER-A)/j,o=t.mul(n,b),l=t.pow(o,r),f=t.mul(n,l),d=t.mul(t.mul(f,b),l),i=t.mul(f,t.sub(d,t.ONE));return I(t,i,n),i}function G(t){const n=_(t),r=S(t),o=r(n,n.neg(n.ONE)),l=r(n,o),f=r(n,n.neg(o)),d=(t+k)/V;return(i,s)=>{let u=i.pow(s,d),w=i.mul(u,o);const a=i.mul(u,l),e=i.mul(u,f),c=i.eql(i.sqr(w),s),m=i.eql(i.sqr(a),s);u=i.cmov(u,w,c),w=i.cmov(e,a,m);const B=i.eql(i.sqr(w),s),E=i.cmov(u,w,B);return I(i,E,s),E}}function S(t){if(t<x)throw new Error("sqrt is not defined for small field");let n=t-g,r=0;for(;n%b===h;)n/=b,r++;let o=b;const l=_(t);for(;N(l,o)===1;)if(o++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(r===1)return Z;let f=l.pow(o,n);const d=(n+g)/b;return function(s,u){if(s.is0(u))return u;if(N(s,u)!==1)throw new Error("Cannot find square root");let w=r,a=s.mul(s.ONE,f),e=s.pow(u,n),c=s.pow(u,d);for(;!s.eql(e,s.ONE);){if(s.is0(e))return s.ZERO;let m=1,B=s.sqr(e);for(;!s.eql(B,s.ONE);)if(m++,B=s.sqr(B),m===w)throw new Error("Cannot find square root");const E=g<<BigInt(w-m-1),L=s.pow(a,E);w=m,a=s.sqr(L),e=s.mul(e,a),c=s.mul(c,L)}return c}}function z(t){return t%M===x?Z:t%j===A?$:t%V===O?G(t):S(t)}const J=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function W(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},r=J.reduce((o,l)=>(o[l]="function",o),n);return v._validateObject(t,r),t}function C(t,n,r){if(r<h)throw new Error("invalid exponent, negatives unsupported");if(r===h)return t.ONE;if(r===g)return n;let o=t.ONE,l=n;for(;r>h;)r&g&&(o=t.mul(o,l)),l=t.sqr(l),r>>=g;return o}function H(t,n,r=!1){const o=new Array(n.length).fill(r?t.ZERO:void 0),l=n.reduce((d,i,s)=>t.is0(i)?d:(o[s]=d,t.mul(d,i)),t.ONE),f=t.inv(l);return n.reduceRight((d,i,s)=>t.is0(i)?d:(o[s]=t.mul(d,o[s]),t.mul(d,i)),f),o}function N(t,n){const r=(t.ORDER-g)/b,o=t.pow(n,r),l=t.eql(o,t.ONE),f=t.eql(o,t.ZERO),d=t.eql(o,t.neg(t.ONE));if(!l&&!f&&!d)throw new Error("invalid Legendre symbol result");return l?1:f?0:-1}function K(t,n){n!==void 0&&Y.anumber(n);const r=n!==void 0?n:t.toString(2).length,o=Math.ceil(r/8);return{nBitLength:r,nByteLength:o}}function _(t,n,r=!1,o={}){if(t<=h)throw new Error("invalid field: expected ORDER > 0, got "+t);let l,f,d=!1,i;if(typeof n=="object"&&n!=null){if(o.sqrt||r)throw new Error("cannot specify opts in two arguments");const e=n;e.BITS&&(l=e.BITS),e.sqrt&&(f=e.sqrt),typeof e.isLE=="boolean"&&(r=e.isLE),typeof e.modFromBytes=="boolean"&&(d=e.modFromBytes),i=e.allowedLengths}else typeof n=="number"&&(l=n),o.sqrt&&(f=o.sqrt);const{nBitLength:s,nByteLength:u}=K(t,l);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let w;const a=Object.freeze({ORDER:t,isLE:r,BITS:s,BYTES:u,MASK:v.bitMask(s),ZERO:h,ONE:g,allowedLengths:i,create:e=>q(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return h<=e&&e<t},is0:e=>e===h,isValidNot0:e=>!a.is0(e)&&a.isValid(e),isOdd:e=>(e&g)===g,neg:e=>q(-e,t),eql:(e,c)=>e===c,sqr:e=>q(e*e,t),add:(e,c)=>q(e+c,t),sub:(e,c)=>q(e-c,t),mul:(e,c)=>q(e*c,t),pow:(e,c)=>C(a,e,c),div:(e,c)=>q(e*y(c,t),t),sqrN:e=>e*e,addN:(e,c)=>e+c,subN:(e,c)=>e-c,mulN:(e,c)=>e*c,inv:e=>y(e,t),sqrt:f||(e=>(w||(w=z(t)),w(a,e))),toBytes:e=>r?v.numberToBytesLE(e,u):v.numberToBytesBE(e,u),fromBytes:(e,c=!0)=>{if(i){if(!i.includes(e.length)||e.length>u)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+e.length);const B=new Uint8Array(u);B.set(e,r?0:B.length-e.length),e=B}if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);let m=r?v.bytesToNumberLE(e):v.bytesToNumberBE(e);if(d&&(m=q(m,t)),!c&&!a.isValid(m))throw new Error("invalid field element: outside of range 0..ORDER");return m},invertBatch:e=>H(a,e),cmov:(e,c,m)=>m?c:e});return Object.freeze(a)}function T(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function Q(t){const n=T(t);return n+Math.ceil(n/2)}function X(t,n,r=!1){const o=t.length,l=T(n),f=Q(n);if(o<16||o<f||o>1024)throw new Error("expected "+f+"-1024 bytes of input, got "+o);const d=r?v.bytesToNumberLE(t):v.bytesToNumberBE(t),i=q(d,n-g)+g;return r?v.numberToBytesLE(i,l):v.numberToBytesBE(i,l)}exports.Field=_;exports.FpInvertBatch=H;exports.FpLegendre=N;exports.FpPow=C;exports.FpSqrt=z;exports.getFieldBytesLength=T;exports.getMinHashLength=Q;exports.invert=y;exports.mapHashToField=X;exports.mod=q;exports.nLength=K;exports.pow2=U;exports.tonelliShanks=S;exports.validateField=W;

package/dist/index228.js

@@ -1,11 +1,247 @@
-import { presignMessagePrefix as e } from "./index126.js";
-import { concat as n } from "./index159.js";
-import { size as f } from "./index129.js";
-import { stringToHex as o, bytesToHex as p } from "./index155.js";
-function u(r) {
-  const t = typeof r == "string" ? o(r) : typeof r.raw == "string" ? r.raw : p(r.raw), i = o(`${e}${f(t)}`);
-  return n([i, t]);
+import { numberToBytesLE as _, numberToBytesBE as S, bitMask as K, bytesToNumberLE as x, bytesToNumberBE as T, _validateObject as Q } from "./index244.js";
+import { anumber as Y } from "./index233.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const a = BigInt(0), g = BigInt(1), B = /* @__PURE__ */ BigInt(2), L = /* @__PURE__ */ BigInt(3), M = /* @__PURE__ */ BigInt(4), A = /* @__PURE__ */ BigInt(5), U = /* @__PURE__ */ BigInt(7), V = /* @__PURE__ */ BigInt(8), k = /* @__PURE__ */ BigInt(9), Z = /* @__PURE__ */ BigInt(16);
+function q(t, n) {
+  const r = t % n;
+  return r >= a ? r : n + r;
+}
+function F(t, n, r) {
+  let o = t;
+  for (; n-- > a; )
+    o *= o, o %= r;
+  return o;
+}
+function y(t, n) {
+  if (t === a)
+    throw new Error("invert: expected non-zero number");
+  if (n <= a)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let r = q(t, n), o = n, l = a, f = g;
+  for (; r !== a; ) {
+    const i = o / r, s = o % r, u = l - f * i;
+    o = r, r = s, l = f, f = u;
+  }
+  if (o !== g)
+    throw new Error("invert: does not exist");
+  return q(l, n);
+}
+function b(t, n, r) {
+  if (!t.eql(t.sqr(n), r))
+    throw new Error("Cannot find square root");
+}
+function j(t, n) {
+  const r = (t.ORDER + g) / M, o = t.pow(n, r);
+  return b(t, o, n), o;
+}
+function G(t, n) {
+  const r = (t.ORDER - A) / V, o = t.mul(n, B), l = t.pow(o, r), f = t.mul(n, l), d = t.mul(t.mul(f, B), l), i = t.mul(f, t.sub(d, t.ONE));
+  return b(t, i, n), i;
+}
+function J(t) {
+  const n = C(t), r = z(t), o = r(n, n.neg(n.ONE)), l = r(n, o), f = r(n, n.neg(o)), d = (t + U) / Z;
+  return (i, s) => {
+    let u = i.pow(s, d), h = i.mul(u, o);
+    const w = i.mul(u, l), e = i.mul(u, f), c = i.eql(i.sqr(h), s), m = i.eql(i.sqr(w), s);
+    u = i.cmov(u, h, c), h = i.cmov(e, w, m);
+    const v = i.eql(i.sqr(h), s), E = i.cmov(u, h, v);
+    return b(i, E, s), E;
+  };
+}
+function z(t) {
+  if (t < L)
+    throw new Error("sqrt is not defined for small field");
+  let n = t - g, r = 0;
+  for (; n % B === a; )
+    n /= B, r++;
+  let o = B;
+  const l = C(t);
+  for (; I(l, o) === 1; )
+    if (o++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (r === 1)
+    return j;
+  let f = l.pow(o, n);
+  const d = (n + g) / B;
+  return function(s, u) {
+    if (s.is0(u))
+      return u;
+    if (I(s, u) !== 1)
+      throw new Error("Cannot find square root");
+    let h = r, w = s.mul(s.ONE, f), e = s.pow(u, n), c = s.pow(u, d);
+    for (; !s.eql(e, s.ONE); ) {
+      if (s.is0(e))
+        return s.ZERO;
+      let m = 1, v = s.sqr(e);
+      for (; !s.eql(v, s.ONE); )
+        if (m++, v = s.sqr(v), m === h)
+          throw new Error("Cannot find square root");
+      const E = g << BigInt(h - m - 1), N = s.pow(w, E);
+      h = m, w = s.sqr(N), e = s.mul(e, w), c = s.mul(c, N);
+    }
+    return c;
+  };
+}
+function O(t) {
+  return t % M === L ? j : t % V === A ? G : t % Z === k ? J(t) : z(t);
+}
+const W = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function tt(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "number",
+    BITS: "number"
+  }, r = W.reduce((o, l) => (o[l] = "function", o), n);
+  return Q(t, r), t;
+}
+function X(t, n, r) {
+  if (r < a)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r === a)
+    return t.ONE;
+  if (r === g)
+    return n;
+  let o = t.ONE, l = n;
+  for (; r > a; )
+    r & g && (o = t.mul(o, l)), l = t.sqr(l), r >>= g;
+  return o;
+}
+function $(t, n, r = !1) {
+  const o = new Array(n.length).fill(r ? t.ZERO : void 0), l = n.reduce((d, i, s) => t.is0(i) ? d : (o[s] = d, t.mul(d, i)), t.ONE), f = t.inv(l);
+  return n.reduceRight((d, i, s) => t.is0(i) ? d : (o[s] = t.mul(d, o[s]), t.mul(d, i)), f), o;
+}
+function I(t, n) {
+  const r = (t.ORDER - g) / B, o = t.pow(n, r), l = t.eql(o, t.ONE), f = t.eql(o, t.ZERO), d = t.eql(o, t.neg(t.ONE));
+  if (!l && !f && !d)
+    throw new Error("invalid Legendre symbol result");
+  return l ? 1 : f ? 0 : -1;
+}
+function P(t, n) {
+  n !== void 0 && Y(n);
+  const r = n !== void 0 ? n : t.toString(2).length, o = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: o };
+}
+function C(t, n, r = !1, o = {}) {
+  if (t <= a)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  let l, f, d = !1, i;
+  if (typeof n == "object" && n != null) {
+    if (o.sqrt || r)
+      throw new Error("cannot specify opts in two arguments");
+    const e = n;
+    e.BITS && (l = e.BITS), e.sqrt && (f = e.sqrt), typeof e.isLE == "boolean" && (r = e.isLE), typeof e.modFromBytes == "boolean" && (d = e.modFromBytes), i = e.allowedLengths;
+  } else
+    typeof n == "number" && (l = n), o.sqrt && (f = o.sqrt);
+  const { nBitLength: s, nByteLength: u } = P(t, l);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let h;
+  const w = Object.freeze({
+    ORDER: t,
+    isLE: r,
+    BITS: s,
+    BYTES: u,
+    MASK: K(s),
+    ZERO: a,
+    ONE: g,
+    allowedLengths: i,
+    create: (e) => q(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return a <= e && e < t;
+    },
+    is0: (e) => e === a,
+    // is valid and invertible
+    isValidNot0: (e) => !w.is0(e) && w.isValid(e),
+    isOdd: (e) => (e & g) === g,
+    neg: (e) => q(-e, t),
+    eql: (e, c) => e === c,
+    sqr: (e) => q(e * e, t),
+    add: (e, c) => q(e + c, t),
+    sub: (e, c) => q(e - c, t),
+    mul: (e, c) => q(e * c, t),
+    pow: (e, c) => X(w, e, c),
+    div: (e, c) => q(e * y(c, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, c) => e + c,
+    subN: (e, c) => e - c,
+    mulN: (e, c) => e * c,
+    inv: (e) => y(e, t),
+    sqrt: f || ((e) => (h || (h = O(t)), h(w, e))),
+    toBytes: (e) => r ? _(e, u) : S(e, u),
+    fromBytes: (e, c = !0) => {
+      if (i) {
+        if (!i.includes(e.length) || e.length > u)
+          throw new Error("Field.fromBytes: expected " + i + " bytes, got " + e.length);
+        const v = new Uint8Array(u);
+        v.set(e, r ? 0 : v.length - e.length), e = v;
+      }
+      if (e.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + e.length);
+      let m = r ? x(e) : T(e);
+      if (d && (m = q(m, t)), !c && !w.isValid(m))
+        throw new Error("invalid field element: outside of range 0..ORDER");
+      return m;
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => $(w, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, c, m) => m ? c : e
+  });
+  return Object.freeze(w);
+}
+function H(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function D(t) {
+  const n = H(t);
+  return n + Math.ceil(n / 2);
+}
+function et(t, n, r = !1) {
+  const o = t.length, l = H(n), f = D(n);
+  if (o < 16 || o < f || o > 1024)
+    throw new Error("expected " + f + "-1024 bytes of input, got " + o);
+  const d = r ? x(t) : T(t), i = q(d, n - g) + g;
+  return r ? _(i, l) : S(i, l);
 }
 export {
-  u as toPrefixedMessage
+  C as Field,
+  $ as FpInvertBatch,
+  I as FpLegendre,
+  X as FpPow,
+  O as FpSqrt,
+  H as getFieldBytesLength,
+  D as getMinHashLength,
+  y as invert,
+  et as mapHashToField,
+  q as mod,
+  P as nLength,
+  F as pow2,
+  z as tonelliShanks,
+  tt as validateField
 };

package/dist/index229.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index286.cjs"),c=require("./index287.cjs"),A=BigInt(0),u=BigInt(1),H=BigInt(2),L=BigInt(7),S=BigInt(256),T=BigInt(113),O=[],y=[],w=[];for(let n=0,t=u,s=1,i=0;n<24;n++){[s,i]=[i,(2*s+3*i)%5],O.push(2*(5*i+s)),y.push((n+1)*(n+2)/2%64);let o=A;for(let r=0;r<7;r++)t=(t<<u^(t>>L)*T)%S,t&H&&(o^=u<<(u<<BigInt(r))-u);w.push(o)}const _=f.split(w,!0),F=_[0],X=_[1],I=(n,t,s)=>s>32?f.rotlBH(n,t,s):f.rotlSH(n,t,s),x=(n,t,s)=>s>32?f.rotlBL(n,t,s):f.rotlSL(n,t,s);function b(n,t=24){const s=new Uint32Array(10);for(let i=24-t;i<24;i++){for(let e=0;e<10;e++)s[e]=n[e]^n[e+10]^n[e+20]^n[e+30]^n[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,l=(e+2)%10,p=s[l],a=s[l+1],g=I(p,a,1)^s[h],B=x(p,a,1)^s[h+1];for(let d=0;d<50;d+=10)n[e+d]^=g,n[e+d+1]^=B}let o=n[2],r=n[3];for(let e=0;e<24;e++){const h=y[e],l=I(o,r,h),p=x(o,r,h),a=O[e];o=n[a],r=n[a+1],n[a]=l,n[a+1]=p}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=n[e+h];for(let h=0;h<10;h++)n[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}n[0]^=F[i],n[1]^=X[i]}c.clean(s)}class k extends c.Hash{constructor(t,s,i,o=!1,r=24){if(super(),this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,this.enableXOF=!1,this.blockLen=t,this.suffix=s,this.outputLen=i,this.enableXOF=o,this.rounds=r,c.anumber(i),!(0<t&&t<200))throw new Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}clone(){return this._cloneInto()}keccak(){c.swap32IfBE(this.state32),b(this.state32,this.rounds),c.swap32IfBE(this.state32),this.posOut=0,this.pos=0}update(t){c.aexists(this),t=c.toBytes(t),c.abytes(t);const{blockLen:s,state:i}=this,o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)i[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:i,blockLen:o}=this;t[i]^=s,s&128&&i===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){c.aexists(this,!1),c.abytes(t),this.finish();const s=this.state,{blockLen:i}=this;for(let o=0,r=t.length;o<r;){this.posOut>=i&&this.keccak();const e=Math.min(i-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return c.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(c.aoutput(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,c.clean(this.state)}_cloneInto(t){const{blockLen:s,suffix:i,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new k(s,i,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=i,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const m=(n,t,s)=>c.createHasher(()=>new k(t,n,s)),E=m(1,136,256/8);exports.Keccak=k;exports.keccakP=b;exports.keccak_256=E;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index113.cjs"),r=require("./index129.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;