@gardenfi/utils 2.1.3 → 2.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index102.cjs +1 -1
- package/dist/index102.js +12 -8
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +1 -1
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +75 -34
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +45 -43
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +1 -1
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +1 -1
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +1 -1
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +1 -1
- package/dist/index125.cjs +1 -1
- package/dist/index125.js +1 -1
- package/dist/index166.cjs +1 -1
- package/dist/index166.js +36 -34
- package/dist/index189.cjs +1 -1
- package/dist/index189.js +2 -2
- package/dist/index191.cjs +1 -1
- package/dist/index191.js +19 -15
- package/dist/index192.cjs +1 -1
- package/dist/index192.js +27 -25
- package/dist/index203.cjs +1 -1
- package/dist/index203.js +16 -16
- package/dist/index222.cjs +1 -1
- package/dist/index222.js +2 -2
- package/dist/index225.cjs +1 -1
- package/dist/index225.js +43 -43
- package/dist/index226.cjs +1 -1
- package/dist/index226.js +3 -113
- package/dist/index228.cjs +1 -1
- package/dist/index228.js +14 -14
- package/dist/index231.cjs +1 -1
- package/dist/index231.js +1 -1
- package/dist/index232.cjs +1 -1
- package/dist/index232.js +1 -1
- package/dist/index233.cjs +1 -1
- package/dist/index233.js +31 -2
- package/dist/index234.cjs +1 -1
- package/dist/index234.js +2 -14
- package/dist/index235.cjs +1 -1
- package/dist/index235.js +13 -12
- package/dist/index236.cjs +1 -1
- package/dist/index236.js +10 -45
- package/dist/index237.cjs +1 -1
- package/dist/index237.js +46 -10
- package/dist/index238.cjs +1 -1
- package/dist/index238.js +11 -7
- package/dist/index239.cjs +1 -1
- package/dist/index239.js +7 -9
- package/dist/index240.cjs +1 -1
- package/dist/index240.js +8 -12
- package/dist/index241.cjs +1 -1
- package/dist/index241.js +13 -14
- package/dist/index242.cjs +1 -1
- package/dist/index242.js +14 -9
- package/dist/index243.cjs +1 -1
- package/dist/index243.js +7 -28
- package/dist/index245.cjs +1 -1
- package/dist/index245.js +3 -3
- package/dist/index246.cjs +1 -1
- package/dist/index246.js +3 -3
- package/dist/index247.cjs +1 -2
- package/dist/index247.js +13 -24
- package/dist/index248.cjs +1 -1
- package/dist/index248.js +15 -13
- package/dist/index249.cjs +2 -1
- package/dist/index249.js +23 -14
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +2 -2
- package/dist/index266.cjs +1 -1
- package/dist/index266.js +1 -1
- package/dist/index275.cjs +1 -1
- package/dist/index275.js +7 -6
- package/dist/index277.cjs +1 -1
- package/dist/index277.js +103 -16
- package/dist/index278.cjs +1 -1
- package/dist/index278.js +5 -222
- package/dist/index279.cjs +1 -1
- package/dist/index279.js +224 -6
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +7 -7
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +7 -27
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +26 -34
- package/dist/index283.cjs +1 -1
- package/dist/index283.js +13 -12
- package/dist/index284.cjs +1 -1
- package/dist/index284.js +124 -48
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +3 -67
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +140 -3
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +143 -128
- package/dist/index288.cjs +1 -1
- package/dist/index288.js +9 -155
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +111 -7
- package/dist/index290.cjs +2 -1
- package/dist/index290.js +116 -95
- package/dist/index291.cjs +1 -2
- package/dist/index291.js +8 -131
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +19 -11
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +139 -19
- package/dist/index294.cjs +1 -1
- package/dist/index294.js +42 -28
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +72 -32
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +2 -69
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +69 -2
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +699 -41
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +179 -620
- package/dist/index3.cjs +1 -1
- package/dist/index3.js +1 -1
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +1 -1
- package/dist/index300.cjs +2 -1
- package/dist/index300.js +63 -203
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +4 -172
- package/dist/index302.cjs +1 -2
- package/dist/index302.js +39 -65
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +7 -4
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +60 -38
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +77 -7
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +4 -63
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +181 -64
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +64 -4
- package/dist/index309.cjs +1 -1
- package/dist/index309.js +44 -194
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +4 -18
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +5 -64
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +2 -45
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +21 -4
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +41 -41
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +1 -1
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +29 -24
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +40 -21
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +24 -24
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +111 -107
- package/dist/index59.cjs +1 -1
- package/dist/index59.js +11 -11
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +1 -1
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +1 -1
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +1 -1
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +26 -26
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +3 -3
- package/dist/index73.cjs +1 -1
- package/dist/index73.js +1 -1
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +8 -8
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +1 -1
- package/dist/index83.cjs +1 -1
- package/dist/index83.js +8 -3
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +53 -51
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +55 -54
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +53 -57
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +44 -42
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +41 -41
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +48 -47
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +28 -28
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +26 -26
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +1 -1
- package/dist/src/lib/utils.d.ts +2 -1
- package/package.json +1 -1
- package/dist/index314.cjs +0 -1
- package/dist/index314.js +0 -107
- package/dist/index315.cjs +0 -1
- package/dist/index315.js +0 -7
- package/dist/index316.cjs +0 -1
- package/dist/index316.js +0 -4
- package/dist/index317.cjs +0 -1
- package/dist/index317.js +0 -24
package/dist/index249.js
CHANGED
|
@@ -1,18 +1,27 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
1
|
+
import { BaseError as t } from "./index38.js";
|
|
2
|
+
class u extends t {
|
|
3
|
+
constructor({ docsPath: o } = {}) {
|
|
4
|
+
super([
|
|
5
|
+
"Could not find an Account to execute with this Action.",
|
|
6
|
+
"Please provide an Account with the `account` argument on the Action, or by supplying an `account` to the Client."
|
|
7
|
+
].join(`
|
|
8
|
+
`), {
|
|
9
|
+
docsPath: o,
|
|
10
|
+
docsSlug: "account",
|
|
11
|
+
name: "AccountNotFoundError"
|
|
12
|
+
});
|
|
13
|
+
}
|
|
7
14
|
}
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
+
class s extends t {
|
|
16
|
+
constructor({ docsPath: o, metaMessages: c, type: r }) {
|
|
17
|
+
super(`Account type "${r}" is not supported.`, {
|
|
18
|
+
docsPath: o,
|
|
19
|
+
metaMessages: c,
|
|
20
|
+
name: "AccountTypeNotSupportedError"
|
|
21
|
+
});
|
|
22
|
+
}
|
|
15
23
|
}
|
|
16
24
|
export {
|
|
17
|
-
|
|
25
|
+
u as AccountNotFoundError,
|
|
26
|
+
s as AccountTypeNotSupportedError
|
|
18
27
|
};
|
package/dist/index25.cjs
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index291.cjs"),M=require("./index159.cjs"),h=require("./index292.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
|
|
2
2
|
`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
|
|
3
3
|
`:"",S=`${v} wants you to sign in with your Ethereum account:
|
|
4
4
|
${$}
|
package/dist/index25.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { SiweInvalidMessageFieldError as e } from "./
|
|
1
|
+
import { SiweInvalidMessageFieldError as e } from "./index291.js";
|
|
2
2
|
import { getAddress as S } from "./index159.js";
|
|
3
|
-
import { isUri as $ } from "./
|
|
3
|
+
import { isUri as $ } from "./index292.js";
|
|
4
4
|
function C(n) {
|
|
5
5
|
const { chainId: i, domain: s, expirationTime: u, issuedAt: g = /* @__PURE__ */ new Date(), nonce: a, notBefore: m, requestId: h, resources: w, scheme: o, uri: c, version: f } = n;
|
|
6
6
|
{
|
package/dist/index266.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index263.cjs"),A=require("./index268.cjs"),g=require("./index269.cjs"),d=require("./index270.cjs"),q=require("./index271.cjs"),h=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index263.cjs"),A=require("./index268.cjs"),g=require("./index269.cjs"),d=require("./index270.cjs"),q=require("./index271.cjs"),h=require("./index297.cjs"),o=require("./index264.cjs");function z(e,t={}){if(o.isFunctionSignature(e))return E(e,t);if(o.isEventSignature(e))return P(e,t);if(o.isErrorSignature(e))return M(e,t);if(o.isConstructorSignature(e))return I(e,t);if(o.isFallbackSignature(e))return R(e);if(o.isReceiveSignature(e))return{type:"receive",stateMutability:"payable"};throw new d.UnknownSignatureError({signature:e})}function E(e,t={}){const n=o.execFunctionSignature(e);if(!n)throw new d.InvalidSignatureError({signature:e,type:"function"});const a=u(n.parameters),r=[],c=a.length;for(let s=0;s<c;s++)r.push(m(a[s],{modifiers:o.functionModifiers,structs:t,type:"function"}));const i=[];if(n.returns){const s=u(n.returns),l=s.length;for(let f=0;f<l;f++)i.push(m(s[f],{modifiers:o.functionModifiers,structs:t,type:"function"}))}return{name:n.name,type:"function",stateMutability:n.stateMutability??"nonpayable",inputs:r,outputs:i}}function P(e,t={}){const n=o.execEventSignature(e);if(!n)throw new d.InvalidSignatureError({signature:e,type:"event"});const a=u(n.parameters),r=[],c=a.length;for(let i=0;i<c;i++)r.push(m(a[i],{modifiers:o.eventModifiers,structs:t,type:"event"}));return{name:n.name,type:"event",inputs:r}}function M(e,t={}){const n=o.execErrorSignature(e);if(!n)throw new d.InvalidSignatureError({signature:e,type:"error"});const a=u(n.parameters),r=[],c=a.length;for(let i=0;i<c;i++)r.push(m(a[i],{structs:t,type:"error"}));return{name:n.name,type:"error",inputs:r}}function I(e,t={}){const n=o.execConstructorSignature(e);if(!n)throw new d.InvalidSignatureError({signature:e,type:"constructor"});const a=u(n.parameters),r=[],c=a.length;for(let i=0;i<c;i++)r.push(m(a[i],{structs:t,type:"constructor"}));return{type:"constructor",stateMutability:n.stateMutability??"nonpayable",inputs:r}}function R(e){const t=o.execFallbackSignature(e);if(!t)throw new d.InvalidSignatureError({signature:e,type:"fallback"});return{type:"fallback",stateMutability:t.stateMutability??"nonpayable"}}const _=/^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/,$=/^\((?<type>.+?)\)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/,K=/^u?int$/;function m(e,t){var p,w;const n=h.getParameterCacheKey(e,t==null?void 0:t.type,t==null?void 0:t.structs);if(h.parameterCache.has(n))return h.parameterCache.get(n);const a=y.isTupleRegex.test(e),r=y.execTyped(a?$:_,e);if(!r)throw new g.InvalidParameterError({param:e});if(r.name&&F(r.name))throw new g.SolidityProtectedKeywordError({param:e,name:r.name});const c=r.name?{name:r.name}:{},i=r.modifier==="indexed"?{indexed:!0}:{},s=(t==null?void 0:t.structs)??{};let l,f={};if(a){l="tuple";const v=u(r.type),x=[],k=v.length;for(let b=0;b<k;b++)x.push(m(v[b],{structs:s}));f={components:x}}else if(r.type in s)l="tuple",f={components:s[r.type]};else if(K.test(r.type))l=`${r.type}256`;else if(l=r.type,(t==null?void 0:t.type)!=="struct"&&!C(l))throw new A.UnknownSolidityTypeError({type:l});if(r.modifier){if(!((w=(p=t==null?void 0:t.modifiers)==null?void 0:p.has)!=null&&w.call(p,r.modifier)))throw new g.InvalidModifierError({param:e,type:t==null?void 0:t.type,modifier:r.modifier});if(o.functionModifiers.has(r.modifier)&&!T(l,!!r.array))throw new g.InvalidFunctionModifierError({param:e,type:t==null?void 0:t.type,modifier:r.modifier})}const S={type:`${l}${r.array??""}`,...c,...i,...f};return h.parameterCache.set(n,S),S}function u(e,t=[],n="",a=0){const r=e.trim().length;for(let c=0;c<r;c++){const i=e[c],s=e.slice(c+1);switch(i){case",":return a===0?u(s,[...t,n.trim()]):u(s,t,`${n}${i}`,a);case"(":return u(s,t,`${n}${i}`,a+1);case")":return u(s,t,`${n}${i}`,a-1);default:return u(s,t,`${n}${i}`,a)}}if(n==="")return t;if(a!==0)throw new q.InvalidParenthesisError({current:n,depth:a});return t.push(n.trim()),t}function C(e){return e==="address"||e==="bool"||e==="function"||e==="string"||y.bytesRegex.test(e)||y.integerRegex.test(e)}const Z=/^(?:after|alias|anonymous|apply|auto|byte|calldata|case|catch|constant|copyof|default|defined|error|event|external|false|final|function|immutable|implements|in|indexed|inline|internal|let|mapping|match|memory|mutable|null|of|override|partial|private|promise|public|pure|reference|relocatable|return|returns|sizeof|static|storage|struct|super|supports|switch|this|true|try|typedef|typeof|var|view|virtual)$/;function F(e){return e==="address"||e==="bool"||e==="function"||e==="string"||e==="tuple"||y.bytesRegex.test(e)||y.integerRegex.test(e)||Z.test(e)}function T(e,t){return t||e==="bytes"||e==="string"||e==="tuple"}exports.isSolidityKeyword=F;exports.isSolidityType=C;exports.isValidDataLocation=T;exports.parseAbiParameter=m;exports.parseConstructorSignature=I;exports.parseErrorSignature=M;exports.parseEventSignature=P;exports.parseFallbackSignature=R;exports.parseFunctionSignature=E;exports.parseSignature=z;exports.splitParameters=u;
|
package/dist/index266.js
CHANGED
|
@@ -3,7 +3,7 @@ import { UnknownSolidityTypeError as M } from "./index268.js";
|
|
|
3
3
|
import { InvalidParameterError as R, SolidityProtectedKeywordError as k, InvalidModifierError as z, InvalidFunctionModifierError as A } from "./index269.js";
|
|
4
4
|
import { UnknownSignatureError as F, InvalidSignatureError as m } from "./index270.js";
|
|
5
5
|
import { InvalidParenthesisError as T } from "./index271.js";
|
|
6
|
-
import { getParameterCacheKey as _, parameterCache as p } from "./
|
|
6
|
+
import { getParameterCacheKey as _, parameterCache as p } from "./index297.js";
|
|
7
7
|
import { isFunctionSignature as C, isEventSignature as I, isErrorSignature as Z, isConstructorSignature as K, isFallbackSignature as L, isReceiveSignature as U, functionModifiers as h, execFunctionSignature as W, execEventSignature as D, eventModifiers as V, execErrorSignature as j, execConstructorSignature as q, execFallbackSignature as B } from "./index264.js";
|
|
8
8
|
function le(e, t = {}) {
|
|
9
9
|
if (C(e))
|
package/dist/index275.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index181.cjs");function
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index171.cjs"),f=require("./index181.cjs");function u(n){const{address:s,domain:r,message:e,nonce:t,scheme:i,time:a=new Date}=n;if(r&&e.domain!==r||t&&e.nonce!==t||i&&e.scheme!==i||e.expirationTime&&a>=e.expirationTime||e.notBefore&&a<e.notBefore)return!1;try{if(!e.address||!d.isAddress(e.address,{strict:!1})||s&&!f.isAddressEqual(e.address,s))return!1}catch{return!1}return!0}exports.validateSiweMessage=u;
|
package/dist/index275.js
CHANGED
|
@@ -1,10 +1,11 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
1
|
+
import { isAddress as f } from "./index171.js";
|
|
2
|
+
import { isAddressEqual as o } from "./index181.js";
|
|
3
|
+
function l(n) {
|
|
4
|
+
const { address: r, domain: s, message: e, nonce: t, scheme: a, time: i = /* @__PURE__ */ new Date() } = n;
|
|
5
|
+
if (s && e.domain !== s || t && e.nonce !== t || a && e.scheme !== a || e.expirationTime && i >= e.expirationTime || e.notBefore && i < e.notBefore)
|
|
5
6
|
return !1;
|
|
6
7
|
try {
|
|
7
|
-
if (!e.address || r && !
|
|
8
|
+
if (!e.address || !f(e.address, { strict: !1 }) || r && !o(e.address, r))
|
|
8
9
|
return !1;
|
|
9
10
|
} catch {
|
|
10
11
|
return !1;
|
|
@@ -12,5 +13,5 @@ function u(i) {
|
|
|
12
13
|
return !0;
|
|
13
14
|
}
|
|
14
15
|
export {
|
|
15
|
-
|
|
16
|
+
l as validateSiweMessage
|
|
16
17
|
};
|
package/dist/index277.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index295.cjs"),x=require("./index284.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/index277.js
CHANGED
|
@@ -1,19 +1,106 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
1
|
+
import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index295.js";
|
|
2
|
+
import { createHasher as u, clean as C, rotr as i } from "./index284.js";
|
|
3
|
+
const B = /* @__PURE__ */ Uint32Array.from([
|
|
4
|
+
1116352408,
|
|
5
|
+
1899447441,
|
|
6
|
+
3049323471,
|
|
7
|
+
3921009573,
|
|
8
|
+
961987163,
|
|
9
|
+
1508970993,
|
|
10
|
+
2453635748,
|
|
11
|
+
2870763221,
|
|
12
|
+
3624381080,
|
|
13
|
+
310598401,
|
|
14
|
+
607225278,
|
|
15
|
+
1426881987,
|
|
16
|
+
1925078388,
|
|
17
|
+
2162078206,
|
|
18
|
+
2614888103,
|
|
19
|
+
3248222580,
|
|
20
|
+
3835390401,
|
|
21
|
+
4022224774,
|
|
22
|
+
264347078,
|
|
23
|
+
604807628,
|
|
24
|
+
770255983,
|
|
25
|
+
1249150122,
|
|
26
|
+
1555081692,
|
|
27
|
+
1996064986,
|
|
28
|
+
2554220882,
|
|
29
|
+
2821834349,
|
|
30
|
+
2952996808,
|
|
31
|
+
3210313671,
|
|
32
|
+
3336571891,
|
|
33
|
+
3584528711,
|
|
34
|
+
113926993,
|
|
35
|
+
338241895,
|
|
36
|
+
666307205,
|
|
37
|
+
773529912,
|
|
38
|
+
1294757372,
|
|
39
|
+
1396182291,
|
|
40
|
+
1695183700,
|
|
41
|
+
1986661051,
|
|
42
|
+
2177026350,
|
|
43
|
+
2456956037,
|
|
44
|
+
2730485921,
|
|
45
|
+
2820302411,
|
|
46
|
+
3259730800,
|
|
47
|
+
3345764771,
|
|
48
|
+
3516065817,
|
|
49
|
+
3600352804,
|
|
50
|
+
4094571909,
|
|
51
|
+
275423344,
|
|
52
|
+
430227734,
|
|
53
|
+
506948616,
|
|
54
|
+
659060556,
|
|
55
|
+
883997877,
|
|
56
|
+
958139571,
|
|
57
|
+
1322822218,
|
|
58
|
+
1537002063,
|
|
59
|
+
1747873779,
|
|
60
|
+
1955562222,
|
|
61
|
+
2024104815,
|
|
62
|
+
2227730452,
|
|
63
|
+
2361852424,
|
|
64
|
+
2428436474,
|
|
65
|
+
2756734187,
|
|
66
|
+
3204031479,
|
|
67
|
+
3329325298
|
|
68
|
+
]), h = /* @__PURE__ */ new Uint32Array(64);
|
|
69
|
+
class E extends D {
|
|
70
|
+
constructor(o = 32) {
|
|
71
|
+
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;
|
|
72
|
+
}
|
|
73
|
+
get() {
|
|
74
|
+
const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
|
|
75
|
+
return [o, r, t, s, a, f, c, e];
|
|
76
|
+
}
|
|
77
|
+
// prettier-ignore
|
|
78
|
+
set(o, r, t, s, a, f, c, e) {
|
|
79
|
+
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;
|
|
80
|
+
}
|
|
81
|
+
process(o, r) {
|
|
82
|
+
for (let x = 0; x < 16; x++, r += 4)
|
|
83
|
+
h[x] = o.getUint32(r, !1);
|
|
84
|
+
for (let x = 16; x < 64; x++) {
|
|
85
|
+
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;
|
|
86
|
+
h[x] = l + h[x - 7] + m + h[x - 16] | 0;
|
|
87
|
+
}
|
|
88
|
+
let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
|
|
89
|
+
for (let x = 0; x < 64; x++) {
|
|
90
|
+
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;
|
|
91
|
+
A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
|
|
92
|
+
}
|
|
93
|
+
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);
|
|
94
|
+
}
|
|
95
|
+
roundClean() {
|
|
96
|
+
C(h);
|
|
97
|
+
}
|
|
98
|
+
destroy() {
|
|
99
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
|
|
100
|
+
}
|
|
15
101
|
}
|
|
102
|
+
const y = /* @__PURE__ */ u(() => new E());
|
|
16
103
|
export {
|
|
17
|
-
|
|
18
|
-
|
|
104
|
+
E as SHA256,
|
|
105
|
+
y as sha256
|
|
19
106
|
};
|
package/dist/index278.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index298.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(r,t){const e=s=>a.weierstrass({...r,hash:s});return{...e(t),create:e}}exports.createCurve=c;
|
package/dist/index278.js
CHANGED
|
@@ -1,226 +1,9 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import { weierstrass as s } from "./index298.js";
|
|
2
2
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
return r >= d ? r : i + r;
|
|
7
|
-
}
|
|
8
|
-
function Z(t, i, r) {
|
|
9
|
-
if (i < d)
|
|
10
|
-
throw new Error("invalid exponent, negatives unsupported");
|
|
11
|
-
if (r <= d)
|
|
12
|
-
throw new Error("invalid modulus");
|
|
13
|
-
if (r === c)
|
|
14
|
-
return d;
|
|
15
|
-
let e = c;
|
|
16
|
-
for (; i > d; )
|
|
17
|
-
i & c && (e = e * t % r), t = t * t % r, i >>= c;
|
|
18
|
-
return e;
|
|
19
|
-
}
|
|
20
|
-
function V(t, i, r) {
|
|
21
|
-
let e = t;
|
|
22
|
-
for (; i-- > d; )
|
|
23
|
-
e *= e, e %= r;
|
|
24
|
-
return e;
|
|
25
|
-
}
|
|
26
|
-
function I(t, i) {
|
|
27
|
-
if (t === d)
|
|
28
|
-
throw new Error("invert: expected non-zero number");
|
|
29
|
-
if (i <= d)
|
|
30
|
-
throw new Error("invert: expected positive modulus, got " + i);
|
|
31
|
-
let r = g(t, i), e = i, s = d, u = c;
|
|
32
|
-
for (; r !== d; ) {
|
|
33
|
-
const o = e / r, n = e % r, l = s - u * o;
|
|
34
|
-
e = r, r = n, s = u, u = l;
|
|
35
|
-
}
|
|
36
|
-
if (e !== c)
|
|
37
|
-
throw new Error("invert: does not exist");
|
|
38
|
-
return g(s, i);
|
|
39
|
-
}
|
|
40
|
-
function j(t) {
|
|
41
|
-
const i = (t - c) / w;
|
|
42
|
-
let r, e, s;
|
|
43
|
-
for (r = t - c, e = 0; r % w === d; r /= w, e++)
|
|
44
|
-
;
|
|
45
|
-
for (s = w; s < t && Z(s, i, t) !== t - c; s++)
|
|
46
|
-
if (s > 1e3)
|
|
47
|
-
throw new Error("Cannot find square root: likely non-prime P");
|
|
48
|
-
if (e === 1) {
|
|
49
|
-
const f = (t + c) / b;
|
|
50
|
-
return function(n, l) {
|
|
51
|
-
const h = n.pow(l, f);
|
|
52
|
-
if (!n.eql(n.sqr(h), l))
|
|
53
|
-
throw new Error("Cannot find square root");
|
|
54
|
-
return h;
|
|
55
|
-
};
|
|
56
|
-
}
|
|
57
|
-
const u = (r + c) / w;
|
|
58
|
-
return function(o, n) {
|
|
59
|
-
if (o.pow(n, i) === o.neg(o.ONE))
|
|
60
|
-
throw new Error("Cannot find square root");
|
|
61
|
-
let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
|
|
62
|
-
for (; !o.eql(a, o.ONE); ) {
|
|
63
|
-
if (o.eql(a, o.ZERO))
|
|
64
|
-
return o.ZERO;
|
|
65
|
-
let q = 1;
|
|
66
|
-
for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
|
|
67
|
-
B = o.sqr(B);
|
|
68
|
-
const E = o.pow(h, c << BigInt(l - q - 1));
|
|
69
|
-
h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
|
|
70
|
-
}
|
|
71
|
-
return v;
|
|
72
|
-
};
|
|
73
|
-
}
|
|
74
|
-
function z(t) {
|
|
75
|
-
if (t % b === C) {
|
|
76
|
-
const i = (t + c) / b;
|
|
77
|
-
return function(e, s) {
|
|
78
|
-
const u = e.pow(s, i);
|
|
79
|
-
if (!e.eql(e.sqr(u), s))
|
|
80
|
-
throw new Error("Cannot find square root");
|
|
81
|
-
return u;
|
|
82
|
-
};
|
|
83
|
-
}
|
|
84
|
-
if (t % m === N) {
|
|
85
|
-
const i = (t - N) / m;
|
|
86
|
-
return function(e, s) {
|
|
87
|
-
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));
|
|
88
|
-
if (!e.eql(e.sqr(l), s))
|
|
89
|
-
throw new Error("Cannot find square root");
|
|
90
|
-
return l;
|
|
91
|
-
};
|
|
92
|
-
}
|
|
93
|
-
return j(t);
|
|
94
|
-
}
|
|
95
|
-
const A = [
|
|
96
|
-
"create",
|
|
97
|
-
"isValid",
|
|
98
|
-
"is0",
|
|
99
|
-
"neg",
|
|
100
|
-
"inv",
|
|
101
|
-
"sqrt",
|
|
102
|
-
"sqr",
|
|
103
|
-
"eql",
|
|
104
|
-
"add",
|
|
105
|
-
"sub",
|
|
106
|
-
"mul",
|
|
107
|
-
"pow",
|
|
108
|
-
"div",
|
|
109
|
-
"addN",
|
|
110
|
-
"subN",
|
|
111
|
-
"mulN",
|
|
112
|
-
"sqrN"
|
|
113
|
-
];
|
|
114
|
-
function Y(t) {
|
|
115
|
-
const i = {
|
|
116
|
-
ORDER: "bigint",
|
|
117
|
-
MASK: "bigint",
|
|
118
|
-
BYTES: "isSafeInteger",
|
|
119
|
-
BITS: "isSafeInteger"
|
|
120
|
-
}, r = A.reduce((e, s) => (e[s] = "function", e), i);
|
|
121
|
-
return M(t, r);
|
|
122
|
-
}
|
|
123
|
-
function k(t, i, r) {
|
|
124
|
-
if (r < d)
|
|
125
|
-
throw new Error("invalid exponent, negatives unsupported");
|
|
126
|
-
if (r === d)
|
|
127
|
-
return t.ONE;
|
|
128
|
-
if (r === c)
|
|
129
|
-
return i;
|
|
130
|
-
let e = t.ONE, s = i;
|
|
131
|
-
for (; r > d; )
|
|
132
|
-
r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
|
|
133
|
-
return e;
|
|
134
|
-
}
|
|
135
|
-
function H(t, i) {
|
|
136
|
-
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);
|
|
137
|
-
return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
|
|
138
|
-
}
|
|
139
|
-
function K(t, i) {
|
|
140
|
-
const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
|
|
141
|
-
return { nBitLength: r, nByteLength: e };
|
|
142
|
-
}
|
|
143
|
-
function p(t, i, r = !1, e = {}) {
|
|
144
|
-
if (t <= d)
|
|
145
|
-
throw new Error("invalid field: expected ORDER > 0, got " + t);
|
|
146
|
-
const { nBitLength: s, nByteLength: u } = K(t, i);
|
|
147
|
-
if (u > 2048)
|
|
148
|
-
throw new Error("invalid field: expected ORDER of <= 2048 bytes");
|
|
149
|
-
let f;
|
|
150
|
-
const o = Object.freeze({
|
|
151
|
-
ORDER: t,
|
|
152
|
-
isLE: r,
|
|
153
|
-
BITS: s,
|
|
154
|
-
BYTES: u,
|
|
155
|
-
MASK: _(s),
|
|
156
|
-
ZERO: d,
|
|
157
|
-
ONE: c,
|
|
158
|
-
create: (n) => g(n, t),
|
|
159
|
-
isValid: (n) => {
|
|
160
|
-
if (typeof n != "bigint")
|
|
161
|
-
throw new Error("invalid field element: expected bigint, got " + typeof n);
|
|
162
|
-
return d <= n && n < t;
|
|
163
|
-
},
|
|
164
|
-
is0: (n) => n === d,
|
|
165
|
-
isOdd: (n) => (n & c) === c,
|
|
166
|
-
neg: (n) => g(-n, t),
|
|
167
|
-
eql: (n, l) => n === l,
|
|
168
|
-
sqr: (n) => g(n * n, t),
|
|
169
|
-
add: (n, l) => g(n + l, t),
|
|
170
|
-
sub: (n, l) => g(n - l, t),
|
|
171
|
-
mul: (n, l) => g(n * l, t),
|
|
172
|
-
pow: (n, l) => k(o, n, l),
|
|
173
|
-
div: (n, l) => g(n * I(l, t), t),
|
|
174
|
-
// Same as above, but doesn't normalize
|
|
175
|
-
sqrN: (n) => n * n,
|
|
176
|
-
addN: (n, l) => n + l,
|
|
177
|
-
subN: (n, l) => n - l,
|
|
178
|
-
mulN: (n, l) => n * l,
|
|
179
|
-
inv: (n) => I(n, t),
|
|
180
|
-
sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
|
|
181
|
-
invertBatch: (n) => H(o, n),
|
|
182
|
-
// TODO: do we really need constant cmov?
|
|
183
|
-
// We don't have const-time bigints anyway, so probably will be not very useful
|
|
184
|
-
cmov: (n, l, h) => h ? l : n,
|
|
185
|
-
toBytes: (n) => r ? S(n, u) : x(n, u),
|
|
186
|
-
fromBytes: (n) => {
|
|
187
|
-
if (n.length !== u)
|
|
188
|
-
throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
|
|
189
|
-
return r ? y(n) : L(n);
|
|
190
|
-
}
|
|
191
|
-
});
|
|
192
|
-
return Object.freeze(o);
|
|
193
|
-
}
|
|
194
|
-
function T(t) {
|
|
195
|
-
if (typeof t != "bigint")
|
|
196
|
-
throw new Error("field order must be bigint");
|
|
197
|
-
const i = t.toString(2).length;
|
|
198
|
-
return Math.ceil(i / 8);
|
|
199
|
-
}
|
|
200
|
-
function O(t) {
|
|
201
|
-
const i = T(t);
|
|
202
|
-
return i + Math.ceil(i / 2);
|
|
203
|
-
}
|
|
204
|
-
function G(t, i, r = !1) {
|
|
205
|
-
const e = t.length, s = T(i), u = O(i);
|
|
206
|
-
if (e < 16 || e < u || e > 1024)
|
|
207
|
-
throw new Error("expected " + u + "-1024 bytes of input, got " + e);
|
|
208
|
-
const f = r ? y(t) : L(t), o = g(f, i - c) + c;
|
|
209
|
-
return r ? S(o, s) : x(o, s);
|
|
3
|
+
function c(e, t) {
|
|
4
|
+
const r = (o) => s({ ...e, hash: o });
|
|
5
|
+
return { ...r(t), create: r };
|
|
210
6
|
}
|
|
211
7
|
export {
|
|
212
|
-
|
|
213
|
-
H as FpInvertBatch,
|
|
214
|
-
k as FpPow,
|
|
215
|
-
z as FpSqrt,
|
|
216
|
-
T as getFieldBytesLength,
|
|
217
|
-
O as getMinHashLength,
|
|
218
|
-
I as invert,
|
|
219
|
-
G as mapHashToField,
|
|
220
|
-
g as mod,
|
|
221
|
-
K as nLength,
|
|
222
|
-
Z as pow,
|
|
223
|
-
V as pow2,
|
|
224
|
-
j as tonelliShanks,
|
|
225
|
-
Y as validateField
|
|
8
|
+
c as createCurve
|
|
226
9
|
};
|
package/dist/index279.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./index293.cjs"),V=require("./index284.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;
|