@gardenfi/utils 2.1.3-beta.22 → 2.1.3-beta.23

package/dist/index283.cjs

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

@@ -1,4 +1,4 @@
-import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index295.js";
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index293.js";
 import { createHasher as u, clean as C, rotr as i } from "./index290.js";
 const B = /* @__PURE__ */ Uint32Array.from([
   1116352408,

package/dist/index285.cjs

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

package/dist/index285.js

@@ -1,4 +1,4 @@
-import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index293.js";
+import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index291.js";
 import { anumber as z } from "./index290.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const g = BigInt(0), d = BigInt(1), q = /* @__PURE__ */ BigInt(2), V = /* @__PURE__ */ BigInt(3), x = /* @__PURE__ */ BigInt(4), T = /* @__PURE__ */ BigInt(5), L = /* @__PURE__ */ BigInt(8);

package/dist/index290.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index296.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function s(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function c(t,...e){if(!p(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 m(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");s(t.outputLen),s(t.blockLen)}function B(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 E(t,e){c(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function H(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function U(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function S(t,e){return t<<32-e|t>>>e}const h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function w(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function g(t){for(let e=0;e<t.length;e++)t[e]=w(t[e]);return t}const T=h?t=>t:g,d=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",V=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function _(t){if(c(t),d)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=V[t[n]];return e}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function l(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function I(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(d)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const a=l(t.charCodeAt(i)),y=l(t.charCodeAt(i+1));if(a===void 0||y===void 0){const A=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+A+'" at index '+i)}r[o]=a*16+y}return r}function x(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function b(t){return typeof t=="string"&&(t=x(t)),c(t),t}function k(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];c(o),e+=o.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const i=t[r];n.set(i,o),o+=i.length}return n}class O{}function R(t){const e=r=>t().update(b(r)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function v(t=32){if(u.crypto&&typeof u.crypto.getRandomValues=="function")return u.crypto.getRandomValues(new Uint8Array(t));if(u.crypto&&typeof u.crypto.randomBytes=="function")return Uint8Array.from(u.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=O;exports.abytes=c;exports.aexists=B;exports.ahash=m;exports.anumber=s;exports.aoutput=E;exports.byteSwap=w;exports.byteSwap32=g;exports.bytesToHex=_;exports.clean=U;exports.concatBytes=k;exports.createHasher=R;exports.createView=L;exports.hexToBytes=I;exports.isBytes=p;exports.isLE=h;exports.randomBytes=v;exports.rotr=S;exports.swap32IfBE=T;exports.toBytes=b;exports.u32=H;exports.utf8ToBytes=x;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index294.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function s(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function c(t,...e){if(!p(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 m(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");s(t.outputLen),s(t.blockLen)}function B(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 E(t,e){c(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function H(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function U(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function S(t,e){return t<<32-e|t>>>e}const h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function w(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function g(t){for(let e=0;e<t.length;e++)t[e]=w(t[e]);return t}const T=h?t=>t:g,d=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",V=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function _(t){if(c(t),d)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=V[t[n]];return e}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function l(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function I(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(d)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const a=l(t.charCodeAt(i)),y=l(t.charCodeAt(i+1));if(a===void 0||y===void 0){const A=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+A+'" at index '+i)}r[o]=a*16+y}return r}function x(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function b(t){return typeof t=="string"&&(t=x(t)),c(t),t}function k(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];c(o),e+=o.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const i=t[r];n.set(i,o),o+=i.length}return n}class O{}function R(t){const e=r=>t().update(b(r)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function v(t=32){if(u.crypto&&typeof u.crypto.getRandomValues=="function")return u.crypto.getRandomValues(new Uint8Array(t));if(u.crypto&&typeof u.crypto.randomBytes=="function")return Uint8Array.from(u.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=O;exports.abytes=c;exports.aexists=B;exports.ahash=m;exports.anumber=s;exports.aoutput=E;exports.byteSwap=w;exports.byteSwap32=g;exports.bytesToHex=_;exports.clean=U;exports.concatBytes=k;exports.createHasher=R;exports.createView=L;exports.hexToBytes=I;exports.isBytes=p;exports.isLE=h;exports.randomBytes=v;exports.rotr=S;exports.swap32IfBE=T;exports.toBytes=b;exports.u32=H;exports.utf8ToBytes=x;

package/dist/index290.js

@@ -1,4 +1,4 @@
-import { crypto as u } from "./index296.js";
+import { crypto as u } from "./index294.js";
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function w(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";

package/dist/index291.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index56.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index290.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),g=BigInt(1);function T(e,t){if(typeof t!="boolean")throw new Error(e+" boolean expected, got "+t)}function x(e){const t=e.toString(16);return t.length&1?"0"+t:t}function w(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);return e===""?d:BigInt("0x"+e)}function v(e){return w(i.bytesToHex(e))}function U(e){return i.abytes(e),w(i.bytesToHex(Uint8Array.from(e).reverse()))}function h(e,t){return i.hexToBytes(e.toString(16).padStart(t*2,"0"))}function H(e,t){return h(e,t).reverse()}function A(e,t,r){let o;if(typeof t=="string")try{o=i.hexToBytes(t)}catch(n){throw new Error(e+" must be hex string or Uint8Array, cause: "+n)}else if(i.isBytes(t))o=Uint8Array.from(t);else throw new Error(e+" must be hex string or Uint8Array");const s=o.length;if(typeof r=="number"&&s!==r)throw new Error(e+" of length "+r+" expected, got "+s);return o}const m=e=>typeof e=="bigint"&&d<=e;function p(e,t,r){return m(e)&&m(t)&&m(r)&&t<=e&&e<r}function I(e,t,r,o){if(!p(t,r,o))throw new Error("expected valid "+e+": "+r+" <= n < "+o+", got "+t)}function j(e){let t;for(t=0;e>d;e>>=g,t+=1);return t}const k=e=>(g<<BigInt(e))-g;function N(e,t,r){if(typeof e!="number"||e<2)throw new Error("hashLen must be a number");if(typeof t!="number"||t<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");const o=u=>new Uint8Array(u),s=u=>Uint8Array.of(u);let n=o(e),c=o(e),f=0;const a=()=>{n.fill(1),c.fill(0),f=0},b=(...u)=>r(c,n,...u),B=(u=o(0))=>{c=b(s(0),u),n=b(),u.length!==0&&(c=b(s(1),u),n=b())},E=()=>{if(f++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const y=[];for(;u<t;){n=b();const l=n.slice();y.push(l),u+=n.length}return i.concatBytes(...y)};return(u,y)=>{a(),B(u);let l;for(;!(l=y(E()));)B();return a(),l}}function O(e,t,r={}){if(!e||typeof e!="object")throw new Error("expected valid options object");function o(s,n,c){const f=e[s];if(c&&f===void 0)return;const a=typeof f;if(a!==n||f===null)throw new Error(`param "${s}" is invalid: expected ${n}, got ${a}`)}Object.entries(t).forEach(([s,n])=>o(s,n,!1)),Object.entries(r).forEach(([s,n])=>o(s,n,!0))}function S(e){const t=new WeakMap;return(r,...o)=>{const s=t.get(r);if(s!==void 0)return s;const n=e(r,...o);return t.set(r,n),n}}exports.abytes=i.abytes;exports.anumber=i.anumber;exports.bytesToHex=i.bytesToHex;exports.concatBytes=i.concatBytes;exports.hexToBytes=i.hexToBytes;exports.isBytes=i.isBytes;exports.randomBytes=i.randomBytes;exports.utf8ToBytes=i.utf8ToBytes;exports._validateObject=O;exports.aInRange=I;exports.abool=T;exports.bitLen=j;exports.bitMask=k;exports.bytesToNumberBE=v;exports.bytesToNumberLE=U;exports.createHmacDrbg=N;exports.ensureBytes=A;exports.hexToNumber=w;exports.inRange=p;exports.memoized=S;exports.numberToBytesBE=h;exports.numberToBytesLE=H;exports.numberToHexUnpadded=x;

package/dist/index291.js

@@ -1,14 +1,142 @@
-import { BaseError as i } from "./index56.js";
-class d extends i {
-  constructor(e) {
-    const { docsPath: s, field: r, metaMessages: a } = e;
-    super(`Invalid Sign-In with Ethereum message field "${r}".`, {
-      docsPath: s,
-      metaMessages: a,
-      name: "SiweInvalidMessageFieldError"
-    });
+import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index290.js";
+import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index290.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const y = /* @__PURE__ */ BigInt(0), g = /* @__PURE__ */ BigInt(1);
+function k(t, r) {
+  if (typeof r != "boolean")
+    throw new Error(t + " boolean expected, got " + r);
+}
+function j(t) {
+  const r = t.toString(16);
+  return r.length & 1 ? "0" + r : r;
+}
+function h(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? y : BigInt("0x" + t);
+}
+function H(t) {
+  return h(d(t));
+}
+function O(t) {
+  return v(t), h(d(Uint8Array.from(t).reverse()));
+}
+function x(t, r) {
+  return p(t.toString(16).padStart(r * 2, "0"));
+}
+function S(t, r) {
+  return x(t, r).reverse();
+}
+function _(t, r, n) {
+  let o;
+  if (typeof r == "string")
+    try {
+      o = p(r);
+    } catch (e) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + e);
+    }
+  else if (B(r))
+    o = Uint8Array.from(r);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const i = o.length;
+  if (typeof n == "number" && i !== n)
+    throw new Error(t + " of length " + n + " expected, got " + i);
+  return o;
+}
+const w = (t) => typeof t == "bigint" && y <= t;
+function T(t, r, n) {
+  return w(t) && w(r) && w(n) && r <= t && t < n;
+}
+function $(t, r, n, o) {
+  if (!T(r, n, o))
+    throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + r);
+}
+function M(t) {
+  let r;
+  for (r = 0; t > y; t >>= g, r += 1)
+    ;
+  return r;
+}
+const N = (t) => (g << BigInt(t)) - g;
+function R(t, r, n) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof r != "number" || r < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof n != "function")
+    throw new Error("hmacFn must be a function");
+  const o = (u) => new Uint8Array(u), i = (u) => Uint8Array.of(u);
+  let e = o(t), s = o(t), f = 0;
+  const c = () => {
+    e.fill(1), s.fill(0), f = 0;
+  }, l = (...u) => n(s, e, ...u), m = (u = o(0)) => {
+    s = l(i(0), u), e = l(), u.length !== 0 && (s = l(i(1), u), e = l());
+  }, E = () => {
+    if (f++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const a = [];
+    for (; u < r; ) {
+      e = l();
+      const b = e.slice();
+      a.push(b), u += e.length;
+    }
+    return U(...a);
+  };
+  return (u, a) => {
+    c(), m(u);
+    let b;
+    for (; !(b = a(E())); )
+      m();
+    return c(), b;
+  };
+}
+function z(t, r, n = {}) {
+  if (!t || typeof t != "object")
+    throw new Error("expected valid options object");
+  function o(i, e, s) {
+    const f = t[i];
+    if (s && f === void 0)
+      return;
+    const c = typeof f;
+    if (c !== e || f === null)
+      throw new Error(`param "${i}" is invalid: expected ${e}, got ${c}`);
   }
+  Object.entries(r).forEach(([i, e]) => o(i, e, !1)), Object.entries(n).forEach(([i, e]) => o(i, e, !0));
+}
+function D(t) {
+  const r = /* @__PURE__ */ new WeakMap();
+  return (n, ...o) => {
+    const i = r.get(n);
+    if (i !== void 0)
+      return i;
+    const e = t(n, ...o);
+    return r.set(n, e), e;
+  };
 }
 export {
-  d as SiweInvalidMessageFieldError
+  z as _validateObject,
+  $ as aInRange,
+  k as abool,
+  v as abytes,
+  W as anumber,
+  M as bitLen,
+  N as bitMask,
+  d as bytesToHex,
+  H as bytesToNumberBE,
+  O as bytesToNumberLE,
+  U as concatBytes,
+  R as createHmacDrbg,
+  _ as ensureBytes,
+  p as hexToBytes,
+  h as hexToNumber,
+  T as inRange,
+  B as isBytes,
+  D as memoized,
+  x as numberToBytesBE,
+  S as numberToBytesLE,
+  j as numberToHexUnpadded,
+  C as randomBytes,
+  G as utf8ToBytes
 };

package/dist/index292.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index290.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;

package/dist/index292.js

@@ -1,22 +1,45 @@
-function o(e) {
-  if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
-    return !1;
-  const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
-  if (!(f != null && f.length && i.length >= 0))
-    return !1;
-  if (t != null && t.length) {
-    if (!(i.length === 0 || /^\//.test(i)))
-      return !1;
-  } else if (/^\/\//.test(i))
-    return !1;
-  if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
-    return !1;
-  let n = "";
-  return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
-}
-function a(e) {
-  return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
+import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index290.js";
+class r extends d {
+  constructor(t, i) {
+    super(), this.finished = !1, this.destroyed = !1, u(t);
+    const h = H(i);
+    if (this.iHash = t.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const o = this.blockLen, e = new Uint8Array(o);
+    e.set(h.length > o ? t.create().update(h).digest() : h);
+    for (let s = 0; s < e.length; s++)
+      e[s] ^= 54;
+    this.iHash.update(e), this.oHash = t.create();
+    for (let s = 0; s < e.length; s++)
+      e[s] ^= 106;
+    this.oHash.update(e), l(e);
+  }
+  update(t) {
+    return a(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
+    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
 }
+const y = (n, t, i) => new r(n, t).update(i).digest();
+y.create = (n, t) => new r(n, t);
 export {
-  o as isUri
+  r as HMAC,
+  y as hmac
 };

package/dist/index293.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index290.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),g=BigInt(1);function T(e,t){if(typeof t!="boolean")throw new Error(e+" boolean expected, got "+t)}function x(e){const t=e.toString(16);return t.length&1?"0"+t:t}function w(e){if(typeof e!="string")throw new Error("hex string expected, got "+typeof e);return e===""?d:BigInt("0x"+e)}function v(e){return w(i.bytesToHex(e))}function U(e){return i.abytes(e),w(i.bytesToHex(Uint8Array.from(e).reverse()))}function h(e,t){return i.hexToBytes(e.toString(16).padStart(t*2,"0"))}function H(e,t){return h(e,t).reverse()}function A(e,t,r){let o;if(typeof t=="string")try{o=i.hexToBytes(t)}catch(n){throw new Error(e+" must be hex string or Uint8Array, cause: "+n)}else if(i.isBytes(t))o=Uint8Array.from(t);else throw new Error(e+" must be hex string or Uint8Array");const s=o.length;if(typeof r=="number"&&s!==r)throw new Error(e+" of length "+r+" expected, got "+s);return o}const m=e=>typeof e=="bigint"&&d<=e;function p(e,t,r){return m(e)&&m(t)&&m(r)&&t<=e&&e<r}function I(e,t,r,o){if(!p(t,r,o))throw new Error("expected valid "+e+": "+r+" <= n < "+o+", got "+t)}function j(e){let t;for(t=0;e>d;e>>=g,t+=1);return t}const k=e=>(g<<BigInt(e))-g;function N(e,t,r){if(typeof e!="number"||e<2)throw new Error("hashLen must be a number");if(typeof t!="number"||t<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");const o=u=>new Uint8Array(u),s=u=>Uint8Array.of(u);let n=o(e),c=o(e),f=0;const a=()=>{n.fill(1),c.fill(0),f=0},b=(...u)=>r(c,n,...u),B=(u=o(0))=>{c=b(s(0),u),n=b(),u.length!==0&&(c=b(s(1),u),n=b())},E=()=>{if(f++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const y=[];for(;u<t;){n=b();const l=n.slice();y.push(l),u+=n.length}return i.concatBytes(...y)};return(u,y)=>{a(),B(u);let l;for(;!(l=y(E()));)B();return a(),l}}function O(e,t,r={}){if(!e||typeof e!="object")throw new Error("expected valid options object");function o(s,n,c){const f=e[s];if(c&&f===void 0)return;const a=typeof f;if(a!==n||f===null)throw new Error(`param "${s}" is invalid: expected ${n}, got ${a}`)}Object.entries(t).forEach(([s,n])=>o(s,n,!1)),Object.entries(r).forEach(([s,n])=>o(s,n,!0))}function S(e){const t=new WeakMap;return(r,...o)=>{const s=t.get(r);if(s!==void 0)return s;const n=e(r,...o);return t.set(r,n),n}}exports.abytes=i.abytes;exports.anumber=i.anumber;exports.bytesToHex=i.bytesToHex;exports.concatBytes=i.concatBytes;exports.hexToBytes=i.hexToBytes;exports.isBytes=i.isBytes;exports.randomBytes=i.randomBytes;exports.utf8ToBytes=i.utf8ToBytes;exports._validateObject=O;exports.aInRange=I;exports.abool=T;exports.bitLen=j;exports.bitMask=k;exports.bytesToNumberBE=v;exports.bytesToNumberLE=U;exports.createHmacDrbg=N;exports.ensureBytes=A;exports.hexToNumber=w;exports.inRange=p;exports.memoized=S;exports.numberToBytesBE=h;exports.numberToBytesLE=H;exports.numberToHexUnpadded=x;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index290.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;

package/dist/index293.js

@@ -1,142 +1,81 @@
-import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index290.js";
-import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index290.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const y = /* @__PURE__ */ BigInt(0), g = /* @__PURE__ */ BigInt(1);
-function k(t, r) {
-  if (typeof r != "boolean")
-    throw new Error(t + " boolean expected, got " + r);
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index290.js";
+function y(o, t, s, n) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, n);
+  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
+  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
 }
-function j(t) {
-  const r = t.toString(16);
-  return r.length & 1 ? "0" + r : r;
+function U(o, t, s) {
+  return o & t ^ ~o & s;
 }
-function h(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? y : BigInt("0x" + t);
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
 }
-function H(t) {
-  return h(d(t));
-}
-function O(t) {
-  return v(t), h(d(Uint8Array.from(t).reverse()));
-}
-function x(t, r) {
-  return p(t.toString(16).padStart(r * 2, "0"));
-}
-function S(t, r) {
-  return x(t, r).reverse();
-}
-function _(t, r, n) {
-  let o;
-  if (typeof r == "string")
-    try {
-      o = p(r);
-    } catch (e) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + e);
-    }
-  else if (B(r))
-    o = Uint8Array.from(r);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const i = o.length;
-  if (typeof n == "number" && i !== n)
-    throw new Error(t + " of length " + n + " expected, got " + i);
-  return o;
-}
-const w = (t) => typeof t == "bigint" && y <= t;
-function T(t, r, n) {
-  return w(t) && w(r) && w(n) && r <= t && t < n;
-}
-function $(t, r, n, o) {
-  if (!T(r, n, o))
-    throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + r);
-}
-function M(t) {
-  let r;
-  for (r = 0; t > y; t >>= g, r += 1)
-    ;
-  return r;
-}
-const N = (t) => (g << BigInt(t)) - g;
-function R(t, r, n) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof r != "number" || r < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof n != "function")
-    throw new Error("hmacFn must be a function");
-  const o = (u) => new Uint8Array(u), i = (u) => Uint8Array.of(u);
-  let e = o(t), s = o(t), f = 0;
-  const c = () => {
-    e.fill(1), s.fill(0), f = 0;
-  }, l = (...u) => n(s, e, ...u), m = (u = o(0)) => {
-    s = l(i(0), u), e = l(), u.length !== 0 && (s = l(i(1), u), e = l());
-  }, E = () => {
-    if (f++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const a = [];
-    for (; u < r; ) {
-      e = l();
-      const b = e.slice();
-      a.push(b), u += e.length;
+class m extends g {
+  constructor(t, s, n, i) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
+  }
+  update(t) {
+    b(this), t = a(t), d(t);
+    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(i - this.pos, h - e);
+      if (r === i) {
+        const c = l(t);
+        for (; i <= h - e; e += i)
+          this.process(c, e);
+        continue;
+      }
+      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
     }
-    return U(...a);
-  };
-  return (u, a) => {
-    c(), m(u);
-    let b;
-    for (; !(b = a(E())); )
-      m();
-    return c(), b;
-  };
-}
-function z(t, r, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error("expected valid options object");
-  function o(i, e, s) {
-    const f = t[i];
-    if (s && f === void 0)
-      return;
-    const c = typeof f;
-    if (c !== e || f === null)
-      throw new Error(`param "${i}" is invalid: expected ${e}, got ${c}`);
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    b(this), x(t, this), this.finished = !0;
+    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
+    for (let f = e; f < i; f++)
+      s[f] = 0;
+    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
+    const r = l(t), c = this.outputLen;
+    if (c % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = c / 4, p = this.get();
+    if (u > p.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < u; f++)
+      r.setUint32(4 * f, p[f], h);
+  }
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
+    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
+  }
+  clone() {
+    return this._cloneInto();
   }
-  Object.entries(r).forEach(([i, e]) => o(i, e, !1)), Object.entries(n).forEach(([i, e]) => o(i, e, !0));
-}
-function D(t) {
-  const r = /* @__PURE__ */ new WeakMap();
-  return (n, ...o) => {
-    const i = r.get(n);
-    if (i !== void 0)
-      return i;
-    const e = t(n, ...o);
-    return r.set(n, e), e;
-  };
 }
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 export {
-  z as _validateObject,
-  $ as aInRange,
-  k as abool,
-  v as abytes,
-  W as anumber,
-  M as bitLen,
-  N as bitMask,
-  d as bytesToHex,
-  H as bytesToNumberBE,
-  O as bytesToNumberLE,
-  U as concatBytes,
-  R as createHmacDrbg,
-  _ as ensureBytes,
-  p as hexToBytes,
-  h as hexToNumber,
-  T as inRange,
-  B as isBytes,
-  D as memoized,
-  x as numberToBytesBE,
-  S as numberToBytesLE,
-  j as numberToHexUnpadded,
-  C as randomBytes,
-  G as utf8ToBytes
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/index294.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index290.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/index294.js

@@ -1,45 +1,4 @@
-import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index290.js";
-class r extends d {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, u(t);
-    const h = H(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 54;
-    this.iHash.update(e), this.oHash = t.create();
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 106;
-    this.oHash.update(e), l(e);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const y = (n, t, i) => new r(n, t).update(i).digest();
-y.create = (n, t) => new r(n, t);
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  r as HMAC,
-  y as hmac
+  o as crypto
 };

package/dist/index295.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index290.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index56.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;