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

package/dist/index225.js

@@ -1,14 +1,22 @@
-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;
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
 }
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
+  }
+  return [l, c];
+}
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  t as promiseCache,
-  s as withDedupe
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/index226.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index238.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function s(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function u(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function f(t,...e){if(!s(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function h(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");u(t.outputLen),u(t.blockLen)}function g(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function b(t,e){f(t);const r=e.outputLen;if(t.length<r)throw new Error("digestInto() expects output buffer of length at least "+r)}function d(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function m(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function B(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function x(t,e){return t<<32-e|t>>>e}const a=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function y(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function p(t){for(let e=0;e<t.length;e++)t[e]=y(t[e]);return t}const E=a?t=>t:p;function l(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function w(t){return typeof t=="string"&&(t=l(t)),f(t),t}function A(...t){let e=0;for(let n=0;n<t.length;n++){const i=t[n];f(i),e+=i.length}const r=new Uint8Array(e);for(let n=0,i=0;n<t.length;n++){const c=t[n];r.set(c,i),i+=c.length}return r}class U{}function L(t){const e=n=>t().update(w(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function H(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));if(o.crypto&&typeof o.crypto.randomBytes=="function")return Uint8Array.from(o.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=U;exports.abytes=f;exports.aexists=g;exports.ahash=h;exports.anumber=u;exports.aoutput=b;exports.byteSwap=y;exports.byteSwap32=p;exports.clean=m;exports.concatBytes=A;exports.createHasher=L;exports.createView=B;exports.isBytes=s;exports.isLE=a;exports.randomBytes=H;exports.rotr=x;exports.swap32IfBE=E;exports.toBytes=w;exports.u32=d;exports.utf8ToBytes=l;

package/dist/index226.js

@@ -1,106 +1,111 @@
-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);
+import { crypto as o } from "./index238.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function s(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function c(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function i(e, ...t) {
+  if (!s(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function g(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  c(e.outputLen), c(e.blockLen);
+}
+function d(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function b(e, t) {
+  i(e);
+  const r = t.outputLen;
+  if (e.length < r)
+    throw new Error("digestInto() expects output buffer of length at least " + r);
+}
+function m(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function x(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function A(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function E(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function l(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function y(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = l(e[t]);
+  return e;
+}
+const U = a ? (e) => e : y;
+function p(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function w(e) {
+  return typeof e == "string" && (e = p(e)), i(e), e;
+}
+function B(...e) {
+  let t = 0;
+  for (let n = 0; n < e.length; n++) {
+    const f = e[n];
+    i(f), t += f.length;
   }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  const r = new Uint8Array(t);
+  for (let n = 0, f = 0; n < e.length; n++) {
+    const u = e[n];
+    r.set(u, f), f += u.length;
   }
+  return r;
+}
+class L {
+}
+function H(e) {
+  const t = (n) => e().update(w(n)).digest(), r = e();
+  return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
+}
+function V(e = 32) {
+  if (o && typeof o.getRandomValues == "function")
+    return o.getRandomValues(new Uint8Array(e));
+  if (o && typeof o.randomBytes == "function")
+    return Uint8Array.from(o.randomBytes(e));
+  throw new Error("crypto.getRandomValues must be defined");
 }
-const y = /* @__PURE__ */ u(() => new E());
 export {
-  E as SHA256,
-  y as sha256
+  L as Hash,
+  i as abytes,
+  d as aexists,
+  g as ahash,
+  c as anumber,
+  b as aoutput,
+  l as byteSwap,
+  y as byteSwap32,
+  x as clean,
+  B as concatBytes,
+  H as createHasher,
+  A as createView,
+  s as isBytes,
+  a as isLE,
+  V as randomBytes,
+  E as rotr,
+  U as swap32IfBE,
+  w as toBytes,
+  m as u32,
+  p as utf8ToBytes
 };

package/dist/index227.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index110.cjs"),r=require("./index126.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index227.js

@@ -1,9 +1,9 @@
-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 };
+import { toBytes as o } from "./index110.js";
+import { keccak256 as r } from "./index126.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
 export {
-  c as createCurve
+  c as hashSignature
 };

package/dist/index228.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index230.cjs"),n=require("./index211.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index228.js

@@ -1,247 +1,9 @@
-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);
-}
+import { normalizeSignature as o } from "./index230.js";
+import { formatAbiItem as n } from "./index211.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
 export {
-  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
+  m as toSignature
 };

package/dist/index229.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index237.cjs"),x=require("./index226.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;