@gardenfi/utils 2.0.5 → 2.0.6-beta.1

package/dist/index85.js

@@ -1,13 +1,6 @@
-import { hashTypedData as o } from "./index74.js";
-import { sign as r } from "./index81.js";
-async function p(t) {
-  const { privateKey: a, ...e } = t;
-  return await r({
-    hash: o(e),
-    privateKey: a,
-    to: "hex"
-  });
+function e(t, { strict: r = !0 } = {}) {
+  return !t || typeof t != "string" ? !1 : r ? /^0x[0-9a-fA-F]*$/.test(t) : t.startsWith("0x");
 }
 export {
-  p as signTypedData
+  e as isHex
 };

package/dist/index86.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index76.cjs"),u=require("./index55.cjs"),r=require("./index24.cjs"),a=require("./index95.cjs"),h=require("./index56.cjs");function x(n){const{chainId:e,contractAddress:c,nonce:t,to:s}=n,o=h.keccak256(i.concatHex(["0x05",a.toRlp([e?r.numberToHex(e):"0x",c,t?r.numberToHex(t):"0x"])]));return s==="bytes"?u.hexToBytes(o):o}exports.hashAuthorization=x;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index109.cjs"),o=require("./index84.cjs"),s=require("./index66.cjs"),r=require("./index25.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;

package/dist/index86.js

@@ -1,19 +1,11 @@
-import { concatHex as i } from "./index76.js";
-import { hexToBytes as s } from "./index55.js";
-import { numberToHex as n } from "./index24.js";
-import { toRlp as a } from "./index95.js";
-import { keccak256 as f } from "./index56.js";
-function b(e) {
-  const { chainId: o, contractAddress: c, nonce: t, to: m } = e, r = f(i([
-    "0x05",
-    a([
-      o ? n(o) : "0x",
-      c,
-      t ? n(t) : "0x"
-    ])
-  ]));
-  return m === "bytes" ? s(r) : r;
+import { presignMessagePrefix as e } from "./index109.js";
+import { concat as n } from "./index84.js";
+import { size as f } from "./index66.js";
+import { stringToHex as o, bytesToHex as p } from "./index25.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]);
 }
 export {
-  b as hashAuthorization
+  u as toPrefixedMessage
 };

package/dist/index87.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index29.cjs"),G=require("./index59.cjs"),R=require("./index60.cjs"),S=require("./index61.cjs"),B=require("./index63.cjs"),L=require("./index76.cjs"),h=require("./index46.cjs"),t=require("./index24.cjs"),b=require("./index95.cjs"),V=require("./index105.cjs"),z=require("./index103.cjs"),C=require("./index65.cjs"),v=require("./index106.cjs");function k(e,o){const s=C.getTransactionType(e);return s==="eip1559"?_(e,o):s==="eip2930"?j(e,o):s==="eip4844"?Y(e,o):s==="eip7702"?w(e,o):M(e,o)}function w(e,o){const{authorizationList:s,chainId:i,gas:r,nonce:c,to:a,value:x,maxFeePerGas:l,maxPriorityFeePerGas:n,accessList:H,data:d}=e;z.assertTransactionEIP7702(e);const f=v.serializeAccessList(H),u=V.serializeAuthorizationList(s);return L.concatHex(["0x04",b.toRlp([t.toHex(i),c?t.toHex(c):"0x",n?t.toHex(n):"0x",l?t.toHex(l):"0x",r?t.toHex(r):"0x",a??"0x",x?t.toHex(x):"0x",d??"0x",f,u,...T(e,o)])])}function Y(e,o){const{chainId:s,gas:i,nonce:r,to:c,value:a,maxFeePerBlobGas:x,maxFeePerGas:l,maxPriorityFeePerGas:n,accessList:H,data:d}=e;z.assertTransactionEIP4844(e);let f=e.blobVersionedHashes,u=e.sidecars;if(e.blobs&&(typeof f>"u"||typeof u>"u")){const m=typeof e.blobs[0]=="string"?e.blobs:e.blobs.map(y=>t.bytesToHex(y)),P=e.kzg,p=G.blobsToCommitments({blobs:m,kzg:P});if(typeof f>"u"&&(f=S.commitmentsToVersionedHashes({commitments:p})),typeof u>"u"){const y=R.blobsToProofs({blobs:m,commitments:p,kzg:P});u=B.toBlobSidecars({blobs:m,commitments:p,proofs:y})}}const I=v.serializeAccessList(H),A=[t.toHex(s),r?t.toHex(r):"0x",n?t.toHex(n):"0x",l?t.toHex(l):"0x",i?t.toHex(i):"0x",c??"0x",a?t.toHex(a):"0x",d??"0x",I,x?t.toHex(x):"0x",f??[],...T(e,o)],q=[],g=[],E=[];if(u)for(let m=0;m<u.length;m++){const{blob:P,commitment:p,proof:y}=u[m];q.push(P),g.push(p),E.push(y)}return L.concatHex(["0x03",u?b.toRlp([A,q,g,E]):b.toRlp(A)])}function _(e,o){const{chainId:s,gas:i,nonce:r,to:c,value:a,maxFeePerGas:x,maxPriorityFeePerGas:l,accessList:n,data:H}=e;z.assertTransactionEIP1559(e);const d=v.serializeAccessList(n),f=[t.toHex(s),r?t.toHex(r):"0x",l?t.toHex(l):"0x",x?t.toHex(x):"0x",i?t.toHex(i):"0x",c??"0x",a?t.toHex(a):"0x",H??"0x",d,...T(e,o)];return L.concatHex(["0x02",b.toRlp(f)])}function j(e,o){const{chainId:s,gas:i,data:r,nonce:c,to:a,value:x,accessList:l,gasPrice:n}=e;z.assertTransactionEIP2930(e);const H=v.serializeAccessList(l),d=[t.toHex(s),c?t.toHex(c):"0x",n?t.toHex(n):"0x",i?t.toHex(i):"0x",a??"0x",x?t.toHex(x):"0x",r??"0x",H,...T(e,o)];return L.concatHex(["0x01",b.toRlp(d)])}function M(e,o){const{chainId:s=0,gas:i,data:r,nonce:c,to:a,value:x,gasPrice:l}=e;z.assertTransactionLegacy(e);let n=[c?t.toHex(c):"0x",l?t.toHex(l):"0x",i?t.toHex(i):"0x",a??"0x",x?t.toHex(x):"0x",r??"0x"];if(o){const H=(()=>{if(o.v>=35n)return(o.v-35n)/2n>0?o.v:27n+(o.v===35n?0n:1n);if(s>0)return BigInt(s*2)+BigInt(35n+o.v-27n);const u=27n+(o.v===27n?0n:1n);if(o.v!==u)throw new F.InvalidLegacyVError({v:o.v});return u})(),d=h.trim(o.r),f=h.trim(o.s);n=[...n,t.toHex(H),d==="0x00"?"0x":d,f==="0x00"?"0x":f]}else s>0&&(n=[...n,t.toHex(s),"0x","0x"]);return b.toRlp(n)}function T(e,o){const s=o??e,{v:i,yParity:r}=s;if(typeof s.r>"u")return[];if(typeof s.s>"u")return[];if(typeof i>"u"&&typeof r>"u")return[];const c=h.trim(s.r),a=h.trim(s.s);return[typeof r=="number"?r?t.toHex(1):"0x":i===0n?"0x":i===1n?t.toHex(1):i===27n?"0x":t.toHex(1),c==="0x00"?"0x":c,a==="0x00"?"0x":a]}exports.serializeTransaction=k;exports.toYParitySignatureArray=T;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index110.cjs"),s=require("./index111.cjs"),S=new Uint32Array([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]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(){super(64,32,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:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;

package/dist/index87.js

@@ -1,174 +1,115 @@
-import { InvalidLegacyVError as H } from "./index29.js";
-import { blobsToCommitments as g } from "./index59.js";
-import { blobsToProofs as B } from "./index60.js";
-import { commitmentsToVersionedHashes as V } from "./index61.js";
-import { toBlobSidecars as C } from "./index63.js";
-import { concatHex as h } from "./index76.js";
-import { trim as T } from "./index46.js";
-import { toHex as o, bytesToHex as k } from "./index24.js";
-import { toRlp as y } from "./index95.js";
-import { serializeAuthorizationList as w } from "./index105.js";
-import { assertTransactionEIP7702 as S, assertTransactionEIP4844 as _, assertTransactionEIP1559 as R, assertTransactionEIP2930 as Y, assertTransactionLegacy as j } from "./index103.js";
-import { getTransactionType as q } from "./index65.js";
-import { serializeAccessList as v } from "./index106.js";
-function te(e, r) {
-  const i = q(e);
-  return i === "eip1559" ? K(e, r) : i === "eip2930" ? M(e, r) : i === "eip4844" ? J(e, r) : i === "eip7702" ? D(e, r) : N(e, r);
-}
-function D(e, r) {
-  const { authorizationList: i, chainId: s, gas: n, nonce: c, to: f, value: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
-  S(e);
-  const d = v(p), m = w(i);
-  return h([
-    "0x04",
-    y([
-      o(s),
-      c ? o(c) : "0x",
-      t ? o(t) : "0x",
-      x ? o(x) : "0x",
-      n ? o(n) : "0x",
-      f ?? "0x",
-      a ? o(a) : "0x",
-      l ?? "0x",
-      d,
-      m,
-      ...I(e, r)
-    ])
-  ]);
-}
-function J(e, r) {
-  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerBlobGas: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
-  _(e);
-  let d = e.blobVersionedHashes, m = e.sidecars;
-  if (e.blobs && (typeof d > "u" || typeof m > "u")) {
-    const u = typeof e.blobs[0] == "string" ? e.blobs : e.blobs.map((P) => k(P)), z = e.kzg, b = g({
-      blobs: u,
-      kzg: z
-    });
-    if (typeof d > "u" && (d = V({
-      commitments: b
-    })), typeof m > "u") {
-      const P = B({ blobs: u, commitments: b, kzg: z });
-      m = C({ blobs: u, commitments: b, proofs: P });
-    }
+import { HashMD as m, Chi as p, Maj as u } from "./index110.js";
+import { wrapConstructor as D, rotr as i } from "./index111.js";
+const g = /* @__PURE__ */ new Uint32Array([
+  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
+]), b = /* @__PURE__ */ new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class w extends m {
+  constructor() {
+    super(64, 32, 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: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [d, o, t, s, a, f, c, e];
   }
-  const L = v(p), E = [
-    o(i),
-    n ? o(n) : "0x",
-    t ? o(t) : "0x",
-    x ? o(x) : "0x",
-    s ? o(s) : "0x",
-    c ?? "0x",
-    f ? o(f) : "0x",
-    l ?? "0x",
-    L,
-    a ? o(a) : "0x",
-    d ?? [],
-    ...I(e, r)
-  ], A = [], F = [], G = [];
-  if (m)
-    for (let u = 0; u < m.length; u++) {
-      const { blob: z, commitment: b, proof: P } = m[u];
-      A.push(z), F.push(b), G.push(P);
+  // prettier-ignore
+  set(d, o, t, s, a, f, c, e) {
+    this.A = d | 0, this.B = o | 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(d, o) {
+    for (let x = 0; x < 16; x++, o += 4)
+      h[x] = d.getUint32(o, !1);
+    for (let x = 16; x < 64; x++) {
+      const A = h[x - 15], n = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(n, 17) ^ i(n, 19) ^ n >>> 10;
+      h[x] = H + h[x - 7] + C + h[x - 16] | 0;
     }
-  return h([
-    "0x03",
-    m ? (
-      // If sidecars are enabled, envelope turns into a "wrapper":
-      y([E, A, F, G])
-    ) : (
-      // If sidecars are disabled, standard envelope is used:
-      y(E)
-    )
-  ]);
-}
-function K(e, r) {
-  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerGas: a, maxPriorityFeePerGas: x, accessList: t, data: p } = e;
-  R(e);
-  const l = v(t), d = [
-    o(i),
-    n ? o(n) : "0x",
-    x ? o(x) : "0x",
-    a ? o(a) : "0x",
-    s ? o(s) : "0x",
-    c ?? "0x",
-    f ? o(f) : "0x",
-    p ?? "0x",
-    l,
-    ...I(e, r)
-  ];
-  return h([
-    "0x02",
-    y(d)
-  ]);
-}
-function M(e, r) {
-  const { chainId: i, gas: s, data: n, nonce: c, to: f, value: a, accessList: x, gasPrice: t } = e;
-  Y(e);
-  const p = v(x), l = [
-    o(i),
-    c ? o(c) : "0x",
-    t ? o(t) : "0x",
-    s ? o(s) : "0x",
-    f ?? "0x",
-    a ? o(a) : "0x",
-    n ?? "0x",
-    p,
-    ...I(e, r)
-  ];
-  return h([
-    "0x01",
-    y(l)
-  ]);
-}
-function N(e, r) {
-  const { chainId: i = 0, gas: s, data: n, nonce: c, to: f, value: a, gasPrice: x } = e;
-  j(e);
-  let t = [
-    c ? o(c) : "0x",
-    x ? o(x) : "0x",
-    s ? o(s) : "0x",
-    f ?? "0x",
-    a ? o(a) : "0x",
-    n ?? "0x"
-  ];
-  if (r) {
-    const p = (() => {
-      if (r.v >= 35n)
-        return (r.v - 35n) / 2n > 0 ? r.v : 27n + (r.v === 35n ? 0n : 1n);
-      if (i > 0)
-        return BigInt(i * 2) + BigInt(35n + r.v - 27n);
-      const m = 27n + (r.v === 27n ? 0n : 1n);
-      if (r.v !== m)
-        throw new H({ v: r.v });
-      return m;
-    })(), l = T(r.r), d = T(r.s);
-    t = [
-      ...t,
-      o(p),
-      l === "0x00" ? "0x" : l,
-      d === "0x00" ? "0x" : d
-    ];
-  } else i > 0 && (t = [
-    ...t,
-    o(i),
-    "0x",
-    "0x"
-  ]);
-  return y(t);
-}
-function I(e, r) {
-  const i = r ?? e, { v: s, yParity: n } = i;
-  if (typeof i.r > "u")
-    return [];
-  if (typeof i.s > "u")
-    return [];
-  if (typeof s > "u" && typeof n > "u")
-    return [];
-  const c = T(i.r), f = T(i.s);
-  return [typeof n == "number" ? n ? o(1) : "0x" : s === 0n ? "0x" : s === 1n ? o(1) : s === 27n ? "0x" : o(1), c === "0x00" ? "0x" : c, f === "0x00" ? "0x" : f];
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
+    for (let x = 0; x < 64; x++) {
+      const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), n = l + A + p(c, e, r) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
+      l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 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, r = r + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, r, l);
+  }
+  roundClean() {
+    h.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
 }
+const G = /* @__PURE__ */ D(() => new w());
 export {
-  te as serializeTransaction,
-  I as toYParitySignatureArray
+  w as SHA256,
+  G as sha256
 };

package/dist/index88.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function n(e){return{formatters:void 0,fees:void 0,serializers:void 0,...e}}exports.defineChain=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index114.cjs"),s=require("./index111.cjs"),o=require("./index115.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;

package/dist/index88.js

@@ -1,11 +1,19 @@
-function n(e) {
+import { hmac as c } from "./index114.js";
+import { concatBytes as m, randomBytes as n } from "./index111.js";
+import { weierstrass as a } from "./index115.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function i(r) {
   return {
-    formatters: void 0,
-    fees: void 0,
-    serializers: void 0,
-    ...e
+    hash: r,
+    hmac: (e, ...t) => c(r, e, m(...t)),
+    randomBytes: n
   };
 }
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
+}
 export {
-  n as defineChain
+  p as createCurve,
+  i as getHash
 };

package/dist/index89.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index43.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index116.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),c=BigInt(1),w=BigInt(2),j=BigInt(3),E=BigInt(4),S=BigInt(5),I=BigInt(8);function g(t,i){const r=t%i;return r>=d?r:i+r}function L(t,i,r){if(i<d)throw new Error("invalid exponent, negatives unsupported");if(r<=d)throw new Error("invalid modulus");if(r===c)return d;let n=c;for(;i>d;)i&c&&(n=n*t%r),t=t*t%r,i>>=c;return n}function H(t,i,r){let n=t;for(;i-- >d;)n*=n,n%=r;return n}function m(t,i){if(t===d)throw new Error("invert: expected non-zero number");if(i<=d)throw new Error("invert: expected positive modulus, got "+i);let r=g(t,i),n=i,s=d,u=c;for(;r!==d;){const o=n/r,e=n%r,l=s-u*o;n=r,r=e,s=u,u=l}if(n!==c)throw new Error("invert: does not exist");return g(s,i)}function T(t){const i=(t-c)/w;let r,n,s;for(r=t-c,n=0;r%w===d;r/=w,n++);for(s=w;s<t&&L(s,i,t)!==t-c;s++)if(s>1e3)throw new Error("Cannot find square root: likely non-prime P");if(n===1){const f=(t+c)/E;return function(e,l){const h=e.pow(l,f);if(!e.eql(e.sqr(h),l))throw new Error("Cannot find square root");return h}}const u=(r+c)/w;return function(o,e){if(o.pow(e,i)===o.neg(o.ONE))throw new Error("Cannot find square root");let l=n,h=o.pow(o.mul(o.ONE,s),r),v=o.pow(e,u),q=o.pow(e,r);for(;!o.eql(q,o.ONE);){if(o.eql(q,o.ZERO))return o.ZERO;let b=1;for(let B=o.sqr(q);b<l&&!o.eql(B,o.ONE);b++)B=o.sqr(B);const y=o.pow(h,c<<BigInt(l-b-1));h=o.sqr(y),v=o.mul(v,y),q=o.mul(q,h),l=b}return v}}function x(t){if(t%E===j){const i=(t+c)/E;return function(n,s){const u=n.pow(s,i);if(!n.eql(n.sqr(u),s))throw new Error("Cannot find square root");return u}}if(t%I===S){const i=(t-S)/I;return function(n,s){const u=n.mul(s,w),f=n.pow(u,i),o=n.mul(s,f),e=n.mul(n.mul(o,w),f),l=n.mul(o,n.sub(e,n.ONE));if(!n.eql(n.sqr(l),s))throw new Error("Cannot find square root");return l}}return T(t)}const Z=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const i={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},r=Z.reduce((n,s)=>(n[s]="function",n),i);return a.validateObject(t,r)}function M(t,i,r){if(r<d)throw new Error("invalid exponent, negatives unsupported");if(r===d)return t.ONE;if(r===c)return i;let n=t.ONE,s=i;for(;r>d;)r&c&&(n=t.mul(n,s)),s=t.sqr(s),r>>=c;return n}function _(t,i){const r=new Array(i.length),n=i.reduce((u,f,o)=>t.is0(f)?u:(r[o]=u,t.mul(u,f)),t.ONE),s=t.inv(n);return i.reduceRight((u,f,o)=>t.is0(f)?u:(r[o]=t.mul(u,r[o]),t.mul(u,f)),s),r}function p(t,i){const r=i!==void 0?i:t.toString(2).length,n=Math.ceil(r/8);return{nBitLength:r,nByteLength:n}}function z(t,i,r=!1,n={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:u}=p(t,i);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let f;const o=Object.freeze({ORDER:t,isLE:r,BITS:s,BYTES:u,MASK:a.bitMask(s),ZERO:d,ONE:c,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&c)===c,neg:e=>g(-e,t),eql:(e,l)=>e===l,sqr:e=>g(e*e,t),add:(e,l)=>g(e+l,t),sub:(e,l)=>g(e-l,t),mul:(e,l)=>g(e*l,t),pow:(e,l)=>M(o,e,l),div:(e,l)=>g(e*m(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>m(e,t),sqrt:n.sqrt||(e=>(f||(f=x(t)),f(o,e))),invertBatch:e=>_(o,e),cmov:(e,l,h)=>h?l:e,toBytes:e=>r?a.numberToBytesLE(e,u):a.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return r?a.bytesToNumberLE(e):a.bytesToNumberBE(e)}});return Object.freeze(o)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const i=t.toString(2).length;return Math.ceil(i/8)}function C(t){const i=N(t);return i+Math.ceil(i/2)}function A(t,i,r=!1){const n=t.length,s=N(i),u=C(i);if(n<16||n<u||n>1024)throw new Error("expected "+u+"-1024 bytes of input, got "+n);const f=r?a.bytesToNumberLE(t):a.bytesToNumberBE(t),o=g(f,i-c)+c;return r?a.numberToBytesLE(o,s):a.numberToBytesBE(o,s)}exports.Field=z;exports.FpInvertBatch=_;exports.FpPow=M;exports.FpSqrt=x;exports.getFieldBytesLength=N;exports.getMinHashLength=C;exports.invert=m;exports.mapHashToField=A;exports.mod=g;exports.nLength=p;exports.pow=L;exports.pow2=H;exports.tonelliShanks=T;exports.validateField=k;

package/dist/index89.js

@@ -1,15 +1,226 @@
-import { BaseError as o } from "./index43.js";
-class d extends o {
-  constructor({ offset: r, position: s, size: e }) {
-    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
+import { bitMask as _, numberToBytesLE as S, numberToBytesBE as x, bytesToNumberLE as y, bytesToNumberBE as L, validateObject as M } from "./index116.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), c = BigInt(1), w = /* @__PURE__ */ BigInt(2), C = /* @__PURE__ */ BigInt(3), b = /* @__PURE__ */ BigInt(4), N = /* @__PURE__ */ BigInt(5), m = /* @__PURE__ */ BigInt(8);
+function g(t, i) {
+  const r = t % i;
+  return r >= d ? r : i + r;
+}
+function Z(t, i, r) {
+  if (i < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r <= d)
+    throw new Error("invalid modulus");
+  if (r === c)
+    return d;
+  let e = c;
+  for (; i > d; )
+    i & c && (e = e * t % r), t = t * t % r, i >>= c;
+  return e;
+}
+function V(t, i, r) {
+  let e = t;
+  for (; i-- > d; )
+    e *= e, e %= r;
+  return e;
+}
+function I(t, i) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (i <= d)
+    throw new Error("invert: expected positive modulus, got " + i);
+  let r = g(t, i), e = i, s = d, u = c;
+  for (; r !== d; ) {
+    const o = e / r, n = e % r, l = s - u * o;
+    e = r, r = n, s = u, u = l;
   }
+  if (e !== c)
+    throw new Error("invert: does not exist");
+  return g(s, i);
 }
-class n extends o {
-  constructor({ size: r, targetSize: s, type: e }) {
-    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+function j(t) {
+  const i = (t - c) / w;
+  let r, e, s;
+  for (r = t - c, e = 0; r % w === d; r /= w, e++)
+    ;
+  for (s = w; s < t && Z(s, i, t) !== t - c; s++)
+    if (s > 1e3)
+      throw new Error("Cannot find square root: likely non-prime P");
+  if (e === 1) {
+    const f = (t + c) / b;
+    return function(n, l) {
+      const h = n.pow(l, f);
+      if (!n.eql(n.sqr(h), l))
+        throw new Error("Cannot find square root");
+      return h;
+    };
   }
+  const u = (r + c) / w;
+  return function(o, n) {
+    if (o.pow(n, i) === o.neg(o.ONE))
+      throw new Error("Cannot find square root");
+    let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
+    for (; !o.eql(a, o.ONE); ) {
+      if (o.eql(a, o.ZERO))
+        return o.ZERO;
+      let q = 1;
+      for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
+        B = o.sqr(B);
+      const E = o.pow(h, c << BigInt(l - q - 1));
+      h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
+    }
+    return v;
+  };
+}
+function z(t) {
+  if (t % b === C) {
+    const i = (t + c) / b;
+    return function(e, s) {
+      const u = e.pow(s, i);
+      if (!e.eql(e.sqr(u), s))
+        throw new Error("Cannot find square root");
+      return u;
+    };
+  }
+  if (t % m === N) {
+    const i = (t - N) / m;
+    return function(e, s) {
+      const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
+      if (!e.eql(e.sqr(l), s))
+        throw new Error("Cannot find square root");
+      return l;
+    };
+  }
+  return j(t);
+}
+const A = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function Y(t) {
+  const i = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, r = A.reduce((e, s) => (e[s] = "function", e), i);
+  return M(t, r);
+}
+function k(t, i, r) {
+  if (r < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r === d)
+    return t.ONE;
+  if (r === c)
+    return i;
+  let e = t.ONE, s = i;
+  for (; r > d; )
+    r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
+  return e;
+}
+function H(t, i) {
+  const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
+  return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
+}
+function K(t, i) {
+  const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: e };
+}
+function p(t, i, r = !1, e = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: u } = K(t, i);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let f;
+  const o = Object.freeze({
+    ORDER: t,
+    isLE: r,
+    BITS: s,
+    BYTES: u,
+    MASK: _(s),
+    ZERO: d,
+    ONE: c,
+    create: (n) => g(n, t),
+    isValid: (n) => {
+      if (typeof n != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof n);
+      return d <= n && n < t;
+    },
+    is0: (n) => n === d,
+    isOdd: (n) => (n & c) === c,
+    neg: (n) => g(-n, t),
+    eql: (n, l) => n === l,
+    sqr: (n) => g(n * n, t),
+    add: (n, l) => g(n + l, t),
+    sub: (n, l) => g(n - l, t),
+    mul: (n, l) => g(n * l, t),
+    pow: (n, l) => k(o, n, l),
+    div: (n, l) => g(n * I(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (n) => n * n,
+    addN: (n, l) => n + l,
+    subN: (n, l) => n - l,
+    mulN: (n, l) => n * l,
+    inv: (n) => I(n, t),
+    sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
+    invertBatch: (n) => H(o, n),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (n, l, h) => h ? l : n,
+    toBytes: (n) => r ? S(n, u) : x(n, u),
+    fromBytes: (n) => {
+      if (n.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
+      return r ? y(n) : L(n);
+    }
+  });
+  return Object.freeze(o);
+}
+function T(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const i = t.toString(2).length;
+  return Math.ceil(i / 8);
+}
+function O(t) {
+  const i = T(t);
+  return i + Math.ceil(i / 2);
+}
+function G(t, i, r = !1) {
+  const e = t.length, s = T(i), u = O(i);
+  if (e < 16 || e < u || e > 1024)
+    throw new Error("expected " + u + "-1024 bytes of input, got " + e);
+  const f = r ? y(t) : L(t), o = g(f, i - c) + c;
+  return r ? S(o, s) : x(o, s);
 }
 export {
-  n as SizeExceedsPaddingSizeError,
-  d as SliceOffsetOutOfBoundsError
+  p as Field,
+  H as FpInvertBatch,
+  k as FpPow,
+  z as FpSqrt,
+  T as getFieldBytesLength,
+  O as getMinHashLength,
+  I as invert,
+  G as mapHashToField,
+  g as mod,
+  K as nLength,
+  Z as pow,
+  V as pow2,
+  j as tonelliShanks,
+  Y as validateField
 };