@gardenfi/utils 2.1.2-beta.7 → 2.1.2-beta.9

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.
Files changed (131) hide show
  1. package/dist/index102.cjs +1 -1
  2. package/dist/index102.js +2 -2
  3. package/dist/index103.cjs +1 -1
  4. package/dist/index103.js +1 -1
  5. package/dist/index15.cjs +1 -1
  6. package/dist/index15.js +2 -2
  7. package/dist/index20.cjs +1 -1
  8. package/dist/index20.js +17 -18
  9. package/dist/index21.cjs +1 -16
  10. package/dist/index21.js +30 -112
  11. package/dist/index22.cjs +16 -1
  12. package/dist/index22.js +113 -30
  13. package/dist/index23.cjs +1 -1
  14. package/dist/index23.js +3 -3
  15. package/dist/index32.cjs +1 -1
  16. package/dist/index32.js +1 -1
  17. package/dist/index33.cjs +1 -1
  18. package/dist/index33.js +1 -1
  19. package/dist/index35.cjs +1 -1
  20. package/dist/index35.js +1 -1
  21. package/dist/index36.cjs +1 -1
  22. package/dist/index36.js +2 -2
  23. package/dist/index37.cjs +1 -1
  24. package/dist/index37.js +2 -2
  25. package/dist/index38.cjs +1 -1
  26. package/dist/index38.js +1 -1
  27. package/dist/index39.cjs +1 -1
  28. package/dist/index39.js +2 -2
  29. package/dist/index40.cjs +1 -1
  30. package/dist/index40.js +11 -11
  31. package/dist/index41.cjs +1 -1
  32. package/dist/index41.js +3 -3
  33. package/dist/index42.cjs +1 -1
  34. package/dist/index42.js +1 -1
  35. package/dist/index43.cjs +1 -1
  36. package/dist/index43.js +1 -1
  37. package/dist/index45.cjs +1 -1
  38. package/dist/index45.js +1 -1
  39. package/dist/index46.cjs +1 -1
  40. package/dist/index46.js +1 -1
  41. package/dist/index47.cjs +1 -1
  42. package/dist/index47.js +105 -33
  43. package/dist/index48.cjs +1 -1
  44. package/dist/index48.js +15 -33
  45. package/dist/index49.cjs +1 -1
  46. package/dist/index49.js +213 -59
  47. package/dist/index50.cjs +2 -1
  48. package/dist/index50.js +57 -110
  49. package/dist/index51.cjs +1 -1
  50. package/dist/index51.js +18 -64
  51. package/dist/index52.cjs +1 -1
  52. package/dist/index52.js +105 -2
  53. package/dist/index53.cjs +1 -1
  54. package/dist/index53.js +3 -16
  55. package/dist/index54.cjs +1 -1
  56. package/dist/index54.js +16 -222
  57. package/dist/index55.cjs +1 -1
  58. package/dist/index55.js +8 -231
  59. package/dist/index56.cjs +1 -2
  60. package/dist/index56.js +9 -58
  61. package/dist/index57.cjs +1 -1
  62. package/dist/index57.js +11 -21
  63. package/dist/index58.cjs +1 -1
  64. package/dist/index58.js +13 -104
  65. package/dist/index59.cjs +1 -1
  66. package/dist/index59.js +18 -3
  67. package/dist/index60.cjs +1 -1
  68. package/dist/index60.js +6 -17
  69. package/dist/index61.cjs +1 -1
  70. package/dist/index61.js +42 -8
  71. package/dist/index62.cjs +1 -1
  72. package/dist/index62.js +77 -9
  73. package/dist/index63.cjs +1 -1
  74. package/dist/index63.js +14 -11
  75. package/dist/index64.cjs +1 -1
  76. package/dist/index64.js +18 -13
  77. package/dist/index65.cjs +1 -1
  78. package/dist/index65.js +8 -18
  79. package/dist/index66.cjs +1 -1
  80. package/dist/index66.js +191 -6
  81. package/dist/index67.cjs +1 -1
  82. package/dist/index67.js +60 -38
  83. package/dist/index68.cjs +1 -1
  84. package/dist/index68.js +4 -78
  85. package/dist/index69.cjs +1 -1
  86. package/dist/index69.js +40 -14
  87. package/dist/index70.cjs +1 -1
  88. package/dist/index70.js +34 -18
  89. package/dist/index71.cjs +1 -1
  90. package/dist/index71.js +69 -8
  91. package/dist/index72.cjs +1 -1
  92. package/dist/index72.js +58 -182
  93. package/dist/index73.cjs +1 -1
  94. package/dist/index73.js +2 -65
  95. package/dist/index74.cjs +1 -1
  96. package/dist/index74.js +231 -4
  97. package/dist/index76.cjs +1 -1
  98. package/dist/index76.js +1 -1
  99. package/dist/index79.cjs +1 -1
  100. package/dist/index79.js +2 -2
  101. package/dist/index80.cjs +1 -1
  102. package/dist/index80.js +1 -1
  103. package/dist/index84.cjs +1 -1
  104. package/dist/index84.js +2 -2
  105. package/dist/index85.cjs +1 -1
  106. package/dist/index85.js +1 -1
  107. package/dist/index87.cjs +1 -1
  108. package/dist/index87.js +1 -1
  109. package/dist/index89.cjs +1 -1
  110. package/dist/index89.js +12 -8
  111. package/dist/index9.cjs +1 -1
  112. package/dist/index9.js +2 -2
  113. package/dist/index90.cjs +1 -1
  114. package/dist/index90.js +8 -12
  115. package/dist/index91.cjs +1 -1
  116. package/dist/index91.js +641 -16
  117. package/dist/index92.cjs +1 -1
  118. package/dist/index92.js +153 -624
  119. package/dist/index93.cjs +1 -1
  120. package/dist/index93.js +17 -171
  121. package/dist/index95.cjs +1 -2
  122. package/dist/index95.js +2 -3
  123. package/dist/index96.cjs +1 -1
  124. package/dist/index96.js +2 -2
  125. package/dist/index97.cjs +1 -1
  126. package/dist/index97.js +38 -2
  127. package/dist/index98.cjs +1 -1
  128. package/dist/index98.js +34 -33
  129. package/dist/index99.cjs +2 -1
  130. package/dist/index99.js +3 -39
  131. package/package.json +1 -1
package/dist/index40.js CHANGED
@@ -1,16 +1,16 @@
1
1
  import { InvalidLegacyVError as H } from "./index43.js";
2
- import { serializeAuthorizationList as g } from "./index60.js";
3
- import { blobsToCommitments as B } from "./index61.js";
4
- import { blobsToProofs as V } from "./index62.js";
5
- import { commitmentsToVersionedHashes as C } from "./index63.js";
6
- import { toBlobSidecars as k } from "./index64.js";
7
- import { concatHex as h } from "./index65.js";
8
- import { trim as T } from "./index66.js";
2
+ import { serializeAuthorizationList as g } from "./index54.js";
3
+ import { blobsToCommitments as B } from "./index55.js";
4
+ import { blobsToProofs as V } from "./index56.js";
5
+ import { commitmentsToVersionedHashes as C } from "./index57.js";
6
+ import { toBlobSidecars as k } from "./index58.js";
7
+ import { concatHex as h } from "./index59.js";
8
+ import { trim as T } from "./index60.js";
9
9
  import { toHex as o, bytesToHex as w } from "./index24.js";
10
- import { toRlp as y } from "./index67.js";
11
- import { assertTransactionEIP1559 as S, assertTransactionEIP2930 as _, assertTransactionEIP4844 as R, assertTransactionEIP7702 as Y, assertTransactionLegacy as j } from "./index68.js";
12
- import { getTransactionType as q } from "./index69.js";
13
- import { serializeAccessList as v } from "./index70.js";
10
+ import { toRlp as y } from "./index61.js";
11
+ import { assertTransactionEIP1559 as S, assertTransactionEIP2930 as _, assertTransactionEIP4844 as R, assertTransactionEIP7702 as Y, assertTransactionLegacy as j } from "./index62.js";
12
+ import { getTransactionType as q } from "./index63.js";
13
+ import { serializeAccessList as v } from "./index64.js";
14
14
  function te(e, r) {
15
15
  const i = q(e);
16
16
  return i === "eip1559" ? K(e, r) : i === "eip2930" ? M(e, r) : i === "eip4844" ? J(e, r) : i === "eip7702" ? D(e, r) : N(e, r);
package/dist/index41.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index72.cjs"),D=require("./index65.cjs"),f=require("./index24.cjs"),s=require("./index39.cjs"),p=require("./index73.cjs");function b(c){const{domain:t={},message:e,primaryType:n}=c,o={EIP712Domain:p.getTypesForEIP712Domain({domain:t}),...c.types};p.validateTypedData({domain:t,message:e,primaryType:n,types:o});const a=["0x1901"];return t&&a.push(y({domain:t,types:o})),n!=="EIP712Domain"&&a.push(d({data:e,primaryType:n,types:o})),s.keccak256(D.concat(a))}function y({domain:c,types:t}){return d({data:c,primaryType:"EIP712Domain",types:t})}function d({data:c,primaryType:t,types:e}){const n=h({data:c,primaryType:t,types:e});return s.keccak256(n)}function h({data:c,primaryType:t,types:e}){const n=[{type:"bytes32"}],o=[l({primaryType:t,types:e})];for(const a of e[t]){const[r,i]=T({types:e,name:a.name,type:a.type,value:c[a.name]});n.push(r),o.push(i)}return u.encodeAbiParameters(n,o)}function l({primaryType:c,types:t}){const e=f.toHex(m({primaryType:c,types:t}));return s.keccak256(e)}function m({primaryType:c,types:t}){let e="";const n=k({primaryType:c,types:t});n.delete(c);const o=[c,...Array.from(n).sort()];for(const a of o)e+=`${a}(${t[a].map(({name:r,type:i})=>`${i} ${r}`).join(",")})`;return e}function k({primaryType:c,types:t},e=new Set){const n=c.match(/^\w*/u),o=n==null?void 0:n[0];if(e.has(o)||t[o]===void 0)return e;e.add(o);for(const a of t[o])k({primaryType:a.type,types:t},e);return e}function T({types:c,name:t,type:e,value:n}){if(c[e]!==void 0)return[{type:"bytes32"},s.keccak256(h({data:n,primaryType:e,types:c}))];if(e==="bytes")return n=`0x${(n.length%2?"0":"")+n.slice(2)}`,[{type:"bytes32"},s.keccak256(n)];if(e==="string")return[{type:"bytes32"},s.keccak256(f.toHex(n))];if(e.lastIndexOf("]")===e.length-1){const o=e.slice(0,e.lastIndexOf("[")),a=n.map(r=>T({name:t,type:o,types:c,value:r}));return[{type:"bytes32"},s.keccak256(u.encodeAbiParameters(a.map(([r])=>r),a.map(([,r])=>r)))]}return[{type:e},n]}exports.encodeType=m;exports.hashDomain=y;exports.hashStruct=d;exports.hashTypedData=b;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index66.cjs"),D=require("./index59.cjs"),f=require("./index24.cjs"),s=require("./index39.cjs"),p=require("./index67.cjs");function b(c){const{domain:t={},message:e,primaryType:n}=c,o={EIP712Domain:p.getTypesForEIP712Domain({domain:t}),...c.types};p.validateTypedData({domain:t,message:e,primaryType:n,types:o});const a=["0x1901"];return t&&a.push(y({domain:t,types:o})),n!=="EIP712Domain"&&a.push(d({data:e,primaryType:n,types:o})),s.keccak256(D.concat(a))}function y({domain:c,types:t}){return d({data:c,primaryType:"EIP712Domain",types:t})}function d({data:c,primaryType:t,types:e}){const n=h({data:c,primaryType:t,types:e});return s.keccak256(n)}function h({data:c,primaryType:t,types:e}){const n=[{type:"bytes32"}],o=[l({primaryType:t,types:e})];for(const a of e[t]){const[r,i]=T({types:e,name:a.name,type:a.type,value:c[a.name]});n.push(r),o.push(i)}return u.encodeAbiParameters(n,o)}function l({primaryType:c,types:t}){const e=f.toHex(m({primaryType:c,types:t}));return s.keccak256(e)}function m({primaryType:c,types:t}){let e="";const n=k({primaryType:c,types:t});n.delete(c);const o=[c,...Array.from(n).sort()];for(const a of o)e+=`${a}(${t[a].map(({name:r,type:i})=>`${i} ${r}`).join(",")})`;return e}function k({primaryType:c,types:t},e=new Set){const n=c.match(/^\w*/u),o=n==null?void 0:n[0];if(e.has(o)||t[o]===void 0)return e;e.add(o);for(const a of t[o])k({primaryType:a.type,types:t},e);return e}function T({types:c,name:t,type:e,value:n}){if(c[e]!==void 0)return[{type:"bytes32"},s.keccak256(h({data:n,primaryType:e,types:c}))];if(e==="bytes")return n=`0x${(n.length%2?"0":"")+n.slice(2)}`,[{type:"bytes32"},s.keccak256(n)];if(e==="string")return[{type:"bytes32"},s.keccak256(f.toHex(n))];if(e.lastIndexOf("]")===e.length-1){const o=e.slice(0,e.lastIndexOf("[")),a=n.map(r=>T({name:t,type:o,types:c,value:r}));return[{type:"bytes32"},s.keccak256(u.encodeAbiParameters(a.map(([r])=>r),a.map(([,r])=>r)))]}return[{type:e},n]}exports.encodeType=m;exports.hashDomain=y;exports.hashStruct=d;exports.hashTypedData=b;
package/dist/index41.js CHANGED
@@ -1,8 +1,8 @@
1
- import { encodeAbiParameters as p } from "./index72.js";
2
- import { concat as h } from "./index65.js";
1
+ import { encodeAbiParameters as p } from "./index66.js";
2
+ import { concat as h } from "./index59.js";
3
3
  import { toHex as d } from "./index24.js";
4
4
  import { keccak256 as c } from "./index39.js";
5
- import { getTypesForEIP712Domain as T, validateTypedData as D } from "./index73.js";
5
+ import { getTypesForEIP712Domain as T, validateTypedData as D } from "./index67.js";
6
6
  function k(o) {
7
7
  const { domain: t = {}, message: e, primaryType: n } = o, r = {
8
8
  EIP712Domain: T({ domain: t }),
package/dist/index42.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index32.cjs"),f=require("./index36.cjs"),a=require("./index39.cjs"),l=require("./index57.cjs"),A=require("./index33.cjs"),o=new l.LruMap(8192);function u(s,t){if(o.has(`${s}.${t}`))return o.get(`${s}.${t}`);const c=s.substring(2).toLowerCase(),n=a.keccak256(f.stringToBytes(c),"bytes"),r=c.split("");for(let e=0;e<40;e+=2)n[e>>1]>>4>=8&&r[e]&&(r[e]=r[e].toUpperCase()),(n[e>>1]&15)>=8&&r[e+1]&&(r[e+1]=r[e+1].toUpperCase());const i=`0x${r.join("")}`;return o.set(`${s}.${t}`,i),i}function g(s,t){if(!A.isAddress(s,{strict:!1}))throw new d.InvalidAddressError({address:s});return u(s,t)}exports.checksumAddress=u;exports.getAddress=g;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index32.cjs"),f=require("./index36.cjs"),a=require("./index39.cjs"),l=require("./index51.cjs"),A=require("./index33.cjs"),o=new l.LruMap(8192);function u(s,t){if(o.has(`${s}.${t}`))return o.get(`${s}.${t}`);const c=s.substring(2).toLowerCase(),n=a.keccak256(f.stringToBytes(c),"bytes"),r=c.split("");for(let e=0;e<40;e+=2)n[e>>1]>>4>=8&&r[e]&&(r[e]=r[e].toUpperCase()),(n[e>>1]&15)>=8&&r[e+1]&&(r[e+1]=r[e+1].toUpperCase());const i=`0x${r.join("")}`;return o.set(`${s}.${t}`,i),i}function g(s,t){if(!A.isAddress(s,{strict:!1}))throw new d.InvalidAddressError({address:s});return u(s,t)}exports.checksumAddress=u;exports.getAddress=g;
package/dist/index42.js CHANGED
@@ -1,7 +1,7 @@
1
1
  import { InvalidAddressError as c } from "./index32.js";
2
2
  import { stringToBytes as m } from "./index36.js";
3
3
  import { keccak256 as p } from "./index39.js";
4
- import { LruMap as u } from "./index57.js";
4
+ import { LruMap as u } from "./index51.js";
5
5
  import { isAddress as $ } from "./index33.js";
6
6
  const s = /* @__PURE__ */ new u(8192);
7
7
  function h(t, o) {
package/dist/index43.cjs CHANGED
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index56.cjs");function o(a){const r=Object.entries(a).map(([n,e])=>e===void 0||e===!1?null:[n,e]).filter(Boolean),i=r.reduce((n,[e])=>Math.max(n,e.length),0);return r.map(([n,e])=>` ${`${n}:`.padEnd(i+1)} ${e}`).join(`
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index50.cjs");function o(a){const r=Object.entries(a).map(([n,e])=>e===void 0||e===!1?null:[n,e]).filter(Boolean),i=r.reduce((n,[e])=>Math.max(n,e.length),0);return r.map(([n,e])=>` ${`${n}:`.padEnd(i+1)} ${e}`).join(`
2
2
  `)}class s extends t.BaseError{constructor({v:r}){super(`Invalid \`v\` value "${r}". Expected 27 or 28.`,{name:"InvalidLegacyVError"})}}class c extends t.BaseError{constructor({transaction:r}){super("Cannot infer a transaction type from provided transaction.",{metaMessages:["Provided Transaction:","{",o(r),"}","","To infer the type, either provide:","- a `type` to the Transaction, or","- an EIP-1559 Transaction with `maxFeePerGas`, or","- an EIP-2930 Transaction with `gasPrice` & `accessList`, or","- an EIP-4844 Transaction with `blobs`, `blobVersionedHashes`, `sidecars`, or","- an EIP-7702 Transaction with `authorizationList`, or","- a Legacy Transaction with `gasPrice`"],name:"InvalidSerializableTransactionError"})}}class d extends t.BaseError{constructor({storageKey:r}){super(`Size for storage key "${r}" is invalid. Expected 32 bytes. Got ${Math.floor((r.length-2)/2)} bytes.`,{name:"InvalidStorageKeySizeError"})}}class l extends t.BaseError{constructor({hash:r}){super(`Transaction receipt with hash "${r}" could not be found. The Transaction may not be processed on a block yet.`,{name:"TransactionReceiptNotFoundError"})}}exports.InvalidLegacyVError=s;exports.InvalidSerializableTransactionError=c;exports.InvalidStorageKeySizeError=d;exports.TransactionReceiptNotFoundError=l;exports.prettyPrint=o;
package/dist/index43.js CHANGED
@@ -1,4 +1,4 @@
1
- import { BaseError as t } from "./index56.js";
1
+ import { BaseError as t } from "./index50.js";
2
2
  function i(a) {
3
3
  const r = Object.entries(a).map(([n, e]) => e === void 0 || e === !1 ? null : [n, e]).filter(Boolean), o = r.reduce((n, [e]) => Math.max(n, e.length), 0);
4
4
  return r.map(([n, e]) => ` ${`${n}:`.padEnd(o + 1)} ${e}`).join(`
package/dist/index45.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index56.cjs");class i extends n.BaseError{constructor({max:e,min:r,signed:s,size:t,value:a}){super(`Number "${a}" is not in safe ${t?`${t*8}-bit ${s?"signed":"unsigned"} `:""}integer range ${e?`(${r} to ${e})`:`(above ${r})`}`,{name:"IntegerOutOfRangeError"})}}class u extends n.BaseError{constructor({givenSize:e,maxSize:r}){super(`Size cannot exceed ${r} bytes. Given size: ${e} bytes.`,{name:"SizeOverflowError"})}}exports.IntegerOutOfRangeError=i;exports.SizeOverflowError=u;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index50.cjs");class i extends n.BaseError{constructor({max:e,min:r,signed:s,size:t,value:a}){super(`Number "${a}" is not in safe ${t?`${t*8}-bit ${s?"signed":"unsigned"} `:""}integer range ${e?`(${r} to ${e})`:`(above ${r})`}`,{name:"IntegerOutOfRangeError"})}}class u extends n.BaseError{constructor({givenSize:e,maxSize:r}){super(`Size cannot exceed ${r} bytes. Given size: ${e} bytes.`,{name:"SizeOverflowError"})}}exports.IntegerOutOfRangeError=i;exports.SizeOverflowError=u;
package/dist/index45.js CHANGED
@@ -1,4 +1,4 @@
1
- import { BaseError as t } from "./index56.js";
1
+ import { BaseError as t } from "./index50.js";
2
2
  class $ extends t {
3
3
  constructor({ max: e, min: r, signed: s, size: n, value: a }) {
4
4
  super(`Number "${a}" is not in safe ${n ? `${n * 8}-bit ${s ? "signed" : "unsigned"} ` : ""}integer range ${e ? `(${r} to ${e})` : `(above ${r})`}`, { name: "IntegerOutOfRangeError" });
package/dist/index46.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index90.cjs");function p(e,{dir:n,size:t=32}={}){return typeof e=="string"?o(e,{dir:n,size:t}):l(e,{dir:n,size:t})}function o(e,{dir:n,size:t=32}={}){if(t===null)return e;const r=e.replace("0x","");if(r.length>t*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(r.length/2),targetSize:t,type:"hex"});return`0x${r[n==="right"?"padEnd":"padStart"](t*2,"0")}`}function l(e,{dir:n,size:t=32}={}){if(t===null)return e;if(e.length>t)throw new i.SizeExceedsPaddingSizeError({size:e.length,targetSize:t,type:"bytes"});const r=new Uint8Array(t);for(let a=0;a<t;a++){const d=n==="right";r[d?a:t-a-1]=e[d?a:e.length-a-1]}return r}exports.pad=p;exports.padBytes=l;exports.padHex=o;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index89.cjs");function p(e,{dir:n,size:t=32}={}){return typeof e=="string"?o(e,{dir:n,size:t}):l(e,{dir:n,size:t})}function o(e,{dir:n,size:t=32}={}){if(t===null)return e;const r=e.replace("0x","");if(r.length>t*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(r.length/2),targetSize:t,type:"hex"});return`0x${r[n==="right"?"padEnd":"padStart"](t*2,"0")}`}function l(e,{dir:n,size:t=32}={}){if(t===null)return e;if(e.length>t)throw new i.SizeExceedsPaddingSizeError({size:e.length,targetSize:t,type:"bytes"});const r=new Uint8Array(t);for(let a=0;a<t;a++){const d=n==="right";r[d?a:t-a-1]=e[d?a:e.length-a-1]}return r}exports.pad=p;exports.padBytes=l;exports.padHex=o;
package/dist/index46.js CHANGED
@@ -1,4 +1,4 @@
1
- import { SizeExceedsPaddingSizeError as d } from "./index90.js";
1
+ import { SizeExceedsPaddingSizeError as d } from "./index89.js";
2
2
  function f(n, { dir: r, size: t = 32 } = {}) {
3
3
  return typeof n == "string" ? p(n, { dir: r, size: t }) : i(n, { dir: r, size: t });
4
4
  }
package/dist/index47.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index48.cjs"),c=require("./index49.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.ahash(t);const h=c.toBytes(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 a=this.blockLen,e=new Uint8Array(a);e.set(h.length>a?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),e.fill(0)}update(t){return o.aexists(this),this.iHash.update(t),this}digestInto(t){o.aexists(this),o.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:i,iHash:h,finished:a,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index72.cjs"),s=require("./index71.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/index47.js CHANGED
@@ -1,43 +1,115 @@
1
- import { ahash as c, aexists as a, abytes as u } from "./index48.js";
2
- import { Hash as H, toBytes as p } from "./index49.js";
3
- class r extends H {
4
- constructor(t, i) {
5
- super(), this.finished = !1, this.destroyed = !1, c(t);
6
- const h = p(i);
7
- if (this.iHash = t.create(), typeof this.iHash.update != "function")
8
- throw new Error("Expected instance of class which extends utils.Hash");
9
- this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
10
- const o = this.blockLen, e = new Uint8Array(o);
11
- e.set(h.length > o ? t.create().update(h).digest() : h);
12
- for (let s = 0; s < e.length; s++)
13
- e[s] ^= 54;
14
- this.iHash.update(e), this.oHash = t.create();
15
- for (let s = 0; s < e.length; s++)
16
- e[s] ^= 106;
17
- this.oHash.update(e), e.fill(0);
1
+ import { HashMD as m, Chi as p, Maj as u } from "./index72.js";
2
+ import { wrapConstructor as D, rotr as i } from "./index71.js";
3
+ const g = /* @__PURE__ */ new Uint32Array([
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
+ ]), b = /* @__PURE__ */ new Uint32Array([
69
+ 1779033703,
70
+ 3144134277,
71
+ 1013904242,
72
+ 2773480762,
73
+ 1359893119,
74
+ 2600822924,
75
+ 528734635,
76
+ 1541459225
77
+ ]), h = /* @__PURE__ */ new Uint32Array(64);
78
+ class w extends m {
79
+ constructor() {
80
+ 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;
18
81
  }
19
- update(t) {
20
- return a(this), this.iHash.update(t), this;
82
+ get() {
83
+ const { A: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
84
+ return [d, o, t, s, a, f, c, e];
21
85
  }
22
- digestInto(t) {
23
- a(this), u(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
86
+ // prettier-ignore
87
+ set(d, o, t, s, a, f, c, e) {
88
+ 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;
24
89
  }
25
- digest() {
26
- const t = new Uint8Array(this.oHash.outputLen);
27
- return this.digestInto(t), t;
90
+ process(d, o) {
91
+ for (let x = 0; x < 16; x++, o += 4)
92
+ h[x] = d.getUint32(o, !1);
93
+ for (let x = 16; x < 64; x++) {
94
+ 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;
95
+ h[x] = H + h[x - 7] + C + h[x - 16] | 0;
96
+ }
97
+ let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
98
+ for (let x = 0; x < 64; x++) {
99
+ 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;
100
+ l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 0;
101
+ }
102
+ 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);
28
103
  }
29
- _cloneInto(t) {
30
- t || (t = Object.create(Object.getPrototypeOf(this), {}));
31
- const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: d } = this;
32
- return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
104
+ roundClean() {
105
+ h.fill(0);
33
106
  }
34
107
  destroy() {
35
- this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
108
+ this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
36
109
  }
37
110
  }
38
- const l = (n, t, i) => new r(n, t).update(i).digest();
39
- l.create = (n, t) => new r(n, t);
111
+ const G = /* @__PURE__ */ D(() => new w());
40
112
  export {
41
- r as HMAC,
42
- l as hmac
113
+ w as SHA256,
114
+ G as sha256
43
115
  };
package/dist/index48.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!i(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error("Uint8Array expected of length "+t+", got length="+e.length)}function a(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");r(e.outputLen),r(e.blockLen)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function u(e,t){o(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}exports.abytes=o;exports.aexists=s;exports.ahash=a;exports.anumber=r;exports.aoutput=u;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index69.cjs"),s=require("./index71.cjs"),o=require("./index91.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/index48.js CHANGED
@@ -1,37 +1,19 @@
1
- function n(e) {
2
- if (!Number.isSafeInteger(e) || e < 0)
3
- throw new Error("positive integer expected, got " + e);
1
+ import { hmac as c } from "./index69.js";
2
+ import { randomBytes as m, concatBytes as n } from "./index71.js";
3
+ import { weierstrass as a } from "./index91.js";
4
+ /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
5
+ function i(r) {
6
+ return {
7
+ hash: r,
8
+ hmac: (e, ...t) => c(r, e, n(...t)),
9
+ randomBytes: m
10
+ };
4
11
  }
5
- function o(e) {
6
- return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
7
- }
8
- function i(e, ...t) {
9
- if (!o(e))
10
- throw new Error("Uint8Array expected");
11
- if (t.length > 0 && !t.includes(e.length))
12
- throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
13
- }
14
- function f(e) {
15
- if (typeof e != "function" || typeof e.create != "function")
16
- throw new Error("Hash should be wrapped by utils.wrapConstructor");
17
- n(e.outputLen), n(e.blockLen);
18
- }
19
- function s(e, t = !0) {
20
- if (e.destroyed)
21
- throw new Error("Hash instance has been destroyed");
22
- if (t && e.finished)
23
- throw new Error("Hash#digest() has already been called");
24
- }
25
- function u(e, t) {
26
- i(e);
27
- const r = t.outputLen;
28
- if (e.length < r)
29
- throw new Error("digestInto() expects output buffer of length at least " + r);
12
+ function p(r, e) {
13
+ const t = (o) => a({ ...r, ...i(o) });
14
+ return { ...t(e), create: t };
30
15
  }
31
16
  export {
32
- i as abytes,
33
- s as aexists,
34
- f as ahash,
35
- n as anumber,
36
- u as aoutput
17
+ p as createCurve,
18
+ i as getHash
37
19
  };
package/dist/index49.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index52.cjs"),f=require("./index48.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function a(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function l(t,e){return t<<32-e|t>>>e}const b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function i(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function w(t){for(let e=0;e<t.length;e++)t[e]=i(t[e])}function y(t){if(typeof t!="string")throw new Error("utf8ToBytes expected string, got "+typeof t);return new Uint8Array(new TextEncoder().encode(t))}function s(t){return typeof t=="string"&&(t=y(t)),f.abytes(t),t}function g(...t){let e=0;for(let n=0;n<t.length;n++){const u=t[n];f.abytes(u),e+=u.length}const r=new Uint8Array(e);for(let n=0,u=0;n<t.length;n++){const c=t[n];r.set(c,u),u+=c.length}return r}class m{clone(){return this._cloneInto()}}function B(t){const e=n=>t().update(s(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function d(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));if(o.crypto&&typeof o.crypto.randomBytes=="function")return o.crypto.randomBytes(t);throw new Error("crypto.getRandomValues must be defined")}exports.Hash=m;exports.byteSwap=i;exports.byteSwap32=w;exports.concatBytes=g;exports.createView=a;exports.isLE=b;exports.randomBytes=d;exports.rotr=l;exports.toBytes=s;exports.u32=p;exports.utf8ToBytes=y;exports.wrapConstructor=B;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index74.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;