@hanzo/team 0.1.12 → 0.1.14

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 (172) hide show
  1. package/README.md +1 -0
  2. package/dist/404.html +3 -1
  3. package/dist/admin/index.html +3 -1
  4. package/dist/agents/algo/index.html +3 -1
  5. package/dist/agents/art/index.html +3 -1
  6. package/dist/agents/biz/index.html +3 -1
  7. package/dist/agents/cal/index.html +3 -1
  8. package/dist/agents/core/index.html +3 -1
  9. package/dist/agents/cyber/index.html +3 -1
  10. package/dist/agents/data/index.html +3 -1
  11. package/dist/agents/db/index.html +3 -1
  12. package/dist/agents/des/index.html +3 -1
  13. package/dist/agents/dev/index.html +3 -1
  14. package/dist/agents/doc/index.html +3 -1
  15. package/dist/agents/ed/index.html +3 -1
  16. package/dist/agents/fin/index.html +3 -1
  17. package/dist/agents/gov/index.html +3 -1
  18. package/dist/agents/huma/index.html +3 -1
  19. package/dist/agents/index.html +3 -1
  20. package/dist/agents/lang/index.html +3 -1
  21. package/dist/agents/law/index.html +3 -1
  22. package/dist/agents/mana/index.html +3 -1
  23. package/dist/agents/mark/index.html +3 -1
  24. package/dist/agents/mo/index.html +3 -1
  25. package/dist/agents/mu/index.html +3 -1
  26. package/dist/agents/opera/index.html +3 -1
  27. package/dist/agents/rev/index.html +3 -1
  28. package/dist/agents/sal/index.html +3 -1
  29. package/dist/agents/sci/index.html +3 -1
  30. package/dist/agents/sec/index.html +3 -1
  31. package/dist/agents/su/index.html +3 -1
  32. package/dist/agents/vi/index.html +3 -1
  33. package/dist/apps/ads/index.html +3 -1
  34. package/dist/apps/ai-chat/index.html +3 -1
  35. package/dist/apps/analytics/index.html +3 -1
  36. package/dist/apps/billing/index.html +3 -1
  37. package/dist/apps/bots/index.html +3 -1
  38. package/dist/apps/cal/index.html +3 -1
  39. package/dist/apps/chat/index.html +3 -1
  40. package/dist/apps/cms/index.html +3 -1
  41. package/dist/apps/commerce/index.html +3 -1
  42. package/dist/apps/console/index.html +3 -1
  43. package/dist/apps/crm/index.html +3 -1
  44. package/dist/apps/dataroom/index.html +3 -1
  45. package/dist/apps/dev/index.html +3 -1
  46. package/dist/apps/email/index.html +3 -1
  47. package/dist/apps/index.html +3 -1
  48. package/dist/apps/meet/index.html +3 -1
  49. package/dist/apps/platform/index.html +3 -1
  50. package/dist/apps/sign/index.html +3 -1
  51. package/dist/apps/social/index.html +3 -1
  52. package/dist/apps/tracker/index.html +3 -1
  53. package/dist/assets/Bots-DU1hNVB7.js +174 -0
  54. package/dist/assets/Bots-DU1hNVB7.js.map +1 -0
  55. package/dist/assets/ThemeToggleNext-D0-PyTrG.js +2 -0
  56. package/dist/assets/{ThemeToggleNext-ClJ0mOw1.js.map → ThemeToggleNext-D0-PyTrG.js.map} +1 -1
  57. package/dist/assets/index-C6xlLqXz.js +186 -0
  58. package/dist/assets/index-C6xlLqXz.js.map +1 -0
  59. package/dist/assets/instrument-D2ByLhpL.js +42 -0
  60. package/dist/assets/instrument-D2ByLhpL.js.map +1 -0
  61. package/dist/assets/rolldown-runtime-B0Z9INg1.js +1 -0
  62. package/dist/assets/sha3-DDKddPFc.js +2 -0
  63. package/dist/assets/sha3-DDKddPFc.js.map +1 -0
  64. package/dist/auth/callback/index.html +3 -1
  65. package/dist/auth/index.html +3 -1
  66. package/dist/bots/index.html +3 -1
  67. package/dist/cal/index.html +3 -1
  68. package/dist/calendar/index.html +3 -1
  69. package/dist/chat/c-design/index.html +3 -1
  70. package/dist/chat/c-general/index.html +3 -1
  71. package/dist/chat/c-lux-bank/index.html +3 -1
  72. package/dist/chat/c-lux-bridge/index.html +3 -1
  73. package/dist/chat/c-revenue/index.html +3 -1
  74. package/dist/chat/c-support/index.html +3 -1
  75. package/dist/chat/c-tracker/index.html +3 -1
  76. package/dist/chat/c-ui/index.html +3 -1
  77. package/dist/chat/c-video/index.html +3 -1
  78. package/dist/chat/dm-algo/index.html +3 -1
  79. package/dist/chat/dm-art/index.html +3 -1
  80. package/dist/chat/dm-biz/index.html +3 -1
  81. package/dist/chat/dm-cal/index.html +3 -1
  82. package/dist/chat/dm-core/index.html +3 -1
  83. package/dist/chat/dm-cyber/index.html +3 -1
  84. package/dist/chat/dm-data/index.html +3 -1
  85. package/dist/chat/dm-db/index.html +3 -1
  86. package/dist/chat/dm-des/index.html +3 -1
  87. package/dist/chat/dm-dev/index.html +3 -1
  88. package/dist/chat/dm-doc/index.html +3 -1
  89. package/dist/chat/dm-ed/index.html +3 -1
  90. package/dist/chat/dm-fin/index.html +3 -1
  91. package/dist/chat/dm-gov/index.html +3 -1
  92. package/dist/chat/dm-huma/index.html +3 -1
  93. package/dist/chat/dm-lang/index.html +3 -1
  94. package/dist/chat/dm-law/index.html +3 -1
  95. package/dist/chat/dm-mana/index.html +3 -1
  96. package/dist/chat/dm-mark/index.html +3 -1
  97. package/dist/chat/dm-mo/index.html +3 -1
  98. package/dist/chat/dm-mu/index.html +3 -1
  99. package/dist/chat/dm-opera/index.html +3 -1
  100. package/dist/chat/dm-rev/index.html +3 -1
  101. package/dist/chat/dm-sal/index.html +3 -1
  102. package/dist/chat/dm-sci/index.html +3 -1
  103. package/dist/chat/dm-sec/index.html +3 -1
  104. package/dist/chat/dm-su/index.html +3 -1
  105. package/dist/chat/dm-vi/index.html +3 -1
  106. package/dist/chat/index.html +3 -1
  107. package/dist/crm/analytics/index.html +3 -1
  108. package/dist/crm/automations/index.html +3 -1
  109. package/dist/crm/campaigns/index.html +3 -1
  110. package/dist/crm/companies/index.html +3 -1
  111. package/dist/crm/contacts/index.html +3 -1
  112. package/dist/crm/customers/index.html +3 -1
  113. package/dist/crm/deliverability/index.html +3 -1
  114. package/dist/crm/forms/index.html +3 -1
  115. package/dist/crm/funds/index.html +3 -1
  116. package/dist/crm/index.html +3 -1
  117. package/dist/crm/investors/index.html +3 -1
  118. package/dist/crm/journeys/index.html +3 -1
  119. package/dist/crm/leads/index.html +3 -1
  120. package/dist/crm/lists/index.html +3 -1
  121. package/dist/crm/opportunities/index.html +3 -1
  122. package/dist/crm/segments/index.html +3 -1
  123. package/dist/crm/settings/index.html +3 -1
  124. package/dist/crm/templates/index.html +3 -1
  125. package/dist/crm/webhooks/index.html +3 -1
  126. package/dist/docs/index.html +3 -1
  127. package/dist/files/index.html +3 -1
  128. package/dist/inbox/index.html +3 -1
  129. package/dist/index.html +3 -1
  130. package/dist/issues/index.html +3 -1
  131. package/dist/issues/kanban/index.html +3 -1
  132. package/dist/issues/list/index.html +3 -1
  133. package/dist/login/index.html +3 -1
  134. package/dist/mail/index.html +3 -1
  135. package/dist/meet/index.html +3 -1
  136. package/dist/mine/index.html +3 -1
  137. package/dist/people/index.html +3 -1
  138. package/dist/projects/index.html +3 -1
  139. package/dist/projects/proj-crm/components/index.html +3 -1
  140. package/dist/projects/proj-crm/index.html +3 -1
  141. package/dist/projects/proj-crm/issues/index.html +3 -1
  142. package/dist/projects/proj-crm/issues/kanban/index.html +3 -1
  143. package/dist/projects/proj-crm/issues/list/index.html +3 -1
  144. package/dist/projects/proj-crm/milestones/index.html +3 -1
  145. package/dist/projects/proj-crm/templates/index.html +3 -1
  146. package/dist/projects/proj-dev/components/index.html +3 -1
  147. package/dist/projects/proj-dev/index.html +3 -1
  148. package/dist/projects/proj-dev/issues/index.html +3 -1
  149. package/dist/projects/proj-dev/issues/kanban/index.html +3 -1
  150. package/dist/projects/proj-dev/issues/list/index.html +3 -1
  151. package/dist/projects/proj-dev/milestones/index.html +3 -1
  152. package/dist/projects/proj-dev/templates/index.html +3 -1
  153. package/dist/projects/proj-mkt/components/index.html +3 -1
  154. package/dist/projects/proj-mkt/index.html +3 -1
  155. package/dist/projects/proj-mkt/issues/index.html +3 -1
  156. package/dist/projects/proj-mkt/issues/kanban/index.html +3 -1
  157. package/dist/projects/proj-mkt/issues/list/index.html +3 -1
  158. package/dist/projects/proj-mkt/milestones/index.html +3 -1
  159. package/dist/projects/proj-mkt/templates/index.html +3 -1
  160. package/dist/projects/proj-next/components/index.html +3 -1
  161. package/dist/projects/proj-next/index.html +3 -1
  162. package/dist/projects/proj-next/issues/index.html +3 -1
  163. package/dist/projects/proj-next/issues/kanban/index.html +3 -1
  164. package/dist/projects/proj-next/issues/list/index.html +3 -1
  165. package/dist/projects/proj-next/milestones/index.html +3 -1
  166. package/dist/projects/proj-next/templates/index.html +3 -1
  167. package/dist/settings/index.html +3 -1
  168. package/dist/time/index.html +3 -1
  169. package/package.json +9 -2
  170. package/dist/assets/ThemeToggleNext-ClJ0mOw1.js +0 -2
  171. package/dist/assets/index-eBmhKyf8.js +0 -221
  172. package/dist/assets/index-eBmhKyf8.js.map +0 -1
@@ -0,0 +1 @@
1
+ var e=Object.create,t=Object.defineProperty,n=Object.getOwnPropertyDescriptor,r=Object.getOwnPropertyNames,i=Object.getPrototypeOf,a=Object.prototype.hasOwnProperty,o=(e,t,n)=>()=>{if(n)throw n[0];try{return e&&(t=e(e=0)),t}catch(e){throw n=[e],e}},s=(e,t)=>()=>(t||(e((t={exports:{}}).exports,t),e=null),t.exports),c=(e,n)=>{let r={};for(var i in e)t(r,i,{get:e[i],enumerable:!0});return n||t(r,Symbol.toStringTag,{value:`Module`}),r},l=(e,i,o,s)=>{if(i&&typeof i==`object`||typeof i==`function`)for(var c=r(i),l=0,u=c.length,d;l<u;l++)d=c[l],!a.call(e,d)&&d!==o&&t(e,d,{get:(e=>i[e]).bind(null,d),enumerable:!(s=n(i,d))||s.enumerable});return e},u=(n,r,o)=>(o=n==null?{}:e(i(n)),l(r||!n||!n.__esModule||!a.call(n,`default`)?t(o,`default`,{value:n,enumerable:!0}):o,n)),d=e=>a.call(e,`module.exports`)?e[`module.exports`]:l(t({},`__esModule`,{value:!0}),e);export{u as a,d as i,o as n,c as r,s as t};
@@ -0,0 +1,2 @@
1
+ var e=BigInt(2**32-1),t=BigInt(32);function n(n,r=!1){return r?{h:Number(n&e),l:Number(n>>t&e)}:{h:Number(n>>t&e)|0,l:Number(n&e)|0}}function r(e,t=!1){let r=e.length,i=new Uint32Array(r),a=new Uint32Array(r);for(let o=0;o<r;o++){let{h:r,l:s}=n(e[o],t);[i[o],a[o]]=[r,s]}return[i,a]}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name===`Uint8Array`&&`BYTES_PER_ELEMENT`in e&&e.BYTES_PER_ELEMENT===1}var a=e=>e?`"${e}" `:``;function o(e,t=``){if(typeof e!=`number`)throw TypeError(a(t)+`expected number, got `+typeof e);if(!Number.isSafeInteger(e)||e<0)throw RangeError(a(t)+`expected integer >= 0, got `+e);return e}function s(e,t=``){if(typeof e!=`boolean`)throw TypeError(a(t)+`expected boolean, got type=`+typeof e);return e}function c(e,t,n=``){if(i(e)&&(t===void 0||e.length===t))return e;t!==void 0&&o(t,`length`);let r=i(e),s=t===void 0?``:` of length ${t}`,c=r?`length=${e.length}`:`type=${typeof e}`,l=a(n)+`expected Uint8Array`+s+`, got `+c;throw r?RangeError(l):TypeError(l)}var l=(e,t)=>{if(typeof e!=`object`||!e||Array.isArray(e))throw TypeError((t===`object`?``:`"${t}" `)+`expected object, got type=`+typeof e)},u=(e,t)=>{l(e,t);let n=Object.getPrototypeOf(e);if(n!==Object.prototype&&n!==null)throw TypeError(`"${t}" expected plain object`);if(Object.hasOwn(e,`__proto__`))throw TypeError(`"${t}.__proto__" is not allowed`)};function d(e,t=!0){if(e.destroyed)throw Error(`hash was destroyed`);if(t&&e.finished)throw Error(`digest() was already called`)}function f(e,t){c(e,void 0,`output`);let n=t.outputLen;if(!(e.length>=n))throw RangeError(`"output" expected length >= `+n)}function p(e){return new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4))}function m(...e){for(let t=0;t<e.length;t++)e[t].fill(0)}var h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function g(e){return e<<24&4278190080|e<<8&16711680|e>>>8&65280|e>>>24&255}function _(e){for(let t=0;t<e.length;t++)e[t]=g(e[t]);return e}var v=h?e=>e:_;function y(e,t,n=`opts`){return u(e,`defaults`),t!==void 0&&u(t,n),Object.assign(Object.create(null),e,t)}function b(e,t={}){if(typeof e!=`function`)throw TypeError(`"hashCons" expected function, got type=`+typeof e);t=y({},t,`info`);let n=(t,n)=>e(n).update(t).digest(),r=e(void 0);return n.outputLen=r.outputLen,n.blockLen=r.blockLen,n.canXOF=r.canXOF,n.create=t=>e(t),Object.assign(n,t),Object.freeze(n)}var x=BigInt(0),S=BigInt(1),C=BigInt(2),w=BigInt(7),T=BigInt(256),E=BigInt(113),D=[],O=[],k=[];for(let e=0,t=S,n=1,r=0;e<24;e++){[n,r]=[r,(2*n+3*r)%5],D.push(2*(5*r+n)),O.push((e+1)*(e+2)/2%64);let i=x;for(let e=0;e<7;e++)t=(t<<S^(t>>w)*E)%T,t&C&&(i^=S<<(S<<BigInt(e))-S);k.push(i)}var A=r(k,!0),j=A[0],M=A[1],N=(e,t,n)=>e<<n|t>>>32-n,P=(e,t,n)=>t<<n|e>>>32-n,F=(e,t,n)=>t<<n-32|e>>>64-n,I=(e,t,n)=>e<<n-32|t>>>64-n,L=(e,t,n)=>n>32?F(e,t,n):N(e,t,n),R=(e,t,n)=>n>32?I(e,t,n):P(e,t,n),z=new Uint32Array(10);function B(e,t=24){if(!(e instanceof Uint32Array))throw TypeError(`"s" expected Uint32Array(50), got type=`+typeof e);if(e.length!==50)throw RangeError(`"s" expected Uint32Array(50), got length=`+e.length);if(o(t,`rounds`),t<1||t>24)throw Error(`"rounds" expected integer 1..24`);for(let n=24-t;n<24;n++){for(let t=0;t<10;t++)z[t]=e[t]^e[t+10]^e[t+20]^e[t+30]^e[t+40];for(let t=0;t<10;t+=2){let n=(t+8)%10,r=(t+2)%10,i=z[r],a=z[r+1],o=L(i,a,1)^z[n],s=R(i,a,1)^z[n+1];for(let n=0;n<50;n+=10)e[t+n]^=o,e[t+n+1]^=s}let t=e[2],r=e[3];for(let n=0;n<24;n++){let i=O[n],a=L(t,r,i),o=R(t,r,i),s=D[n];t=e[s],r=e[s+1],e[s]=a,e[s+1]=o}for(let t=0;t<50;t+=10){let n=e[t],r=e[t+1],i=e[t+2],a=e[t+3];e[t]^=~e[t+2]&e[t+4],e[t+1]^=~e[t+3]&e[t+5],e[t+2]^=~e[t+4]&e[t+6],e[t+3]^=~e[t+5]&e[t+7],e[t+4]^=~e[t+6]&e[t+8],e[t+5]^=~e[t+7]&e[t+9],e[t+6]^=~e[t+8]&n,e[t+7]^=~e[t+9]&r,e[t+8]^=~n&i,e[t+9]^=~r&a}e[0]^=j[n],e[1]^=M[n]}m(z)}var V=class e{state;pos=0;posOut=0;finished=!1;state32;destroyed=!1;blockLen;suffix;outputLen;canXOF;enableXOF=!1;rounds;constructor(e,t,n,r=!1,i=24){if(o(e,`blockLen`),o(t,`suffix`),o(i,`rounds`),s(r,`enableXOF`),this.blockLen=e,this.suffix=t,this.outputLen=n,this.enableXOF=r,this.canXOF=r,this.rounds=i,o(n,`outputLen`),!(0<e&&e<200))throw Error(`"blockLen" must be 1..199`);this.state=new Uint8Array(200),this.state32=p(this.state)}clone(){return this._cloneInto()}keccak(){v(this.state32),B(this.state32,this.rounds),v(this.state32),this.posOut=0,this.pos=0}update(e){d(this),c(e);let{blockLen:t,state:n,state32:r}=this,i=e.length,a=t%4==0&&e.byteOffset%4==0,o=t/4,s=a&&i>=t?p(e):void 0;for(let a=0;a<i;){if(s!==void 0&&this.pos===0&&a%4==0&&i-a>=t){for(let e=0,t=a/4;e<o;e++)r[e]^=s[t+e];a+=t,this.pos=t,this.keccak();continue}let c=Math.min(t-this.pos,i-a);for(let t=0;t<c;t++)n[this.pos++]^=e[a++];this.pos===t&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:e,suffix:t,pos:n,blockLen:r}=this;e[n]^=t,t&128&&n===r-1&&this.keccak(),e[r-1]^=128,this.keccak()}writeInto(e){d(this,!1),c(e),this.finish();let t=this.state,{blockLen:n}=this;for(let r=0,i=e.length;r<i;){this.posOut>=n&&this.keccak();let a=Math.min(n-this.posOut,i-r);e.set(t.subarray(this.posOut,this.posOut+a),r),this.posOut+=a,r+=a}return e}xofInto(e){if(!this.enableXOF)throw Error(`XOF is not enabled`);return this.writeInto(e)}xof(e){return o(e),this.xofInto(new Uint8Array(e))}digestInto(e){if(f(e,this),this.finished)throw Error(`digest() was already called`);this.writeInto(e.length===this.outputLen?e:e.subarray(0,this.outputLen)),this.destroy()}digest(){let e=new Uint8Array(this.outputLen);return this.digestInto(e),e}destroy(){this.destroyed=!0,m(this.state)}_cloneInto(t){let{blockLen:n,suffix:r,outputLen:i,rounds:a,enableXOF:o}=this;return t||=new e(n,r,i,o,a),t.blockLen=n,t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=a,t.suffix=r,t.outputLen=i,t.enableXOF=o,t.canXOF=this.canXOF,t.destroyed=this.destroyed,t}},H=((e,t,n,r={})=>b(()=>new V(t,e,n),r))(1,136,32);export{H as keccak_256};
2
+ //# sourceMappingURL=sha3-DDKddPFc.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"sha3-DDKddPFc.js","names":[],"sources":["../../node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_u64.js","../../node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/utils.js","../../node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/sha3.js"],"sourcesContent":["const U32_MASK64 = /* @__PURE__ */ (() => BigInt(2 ** 32 - 1))();\nconst _32n = /* @__PURE__ */ BigInt(32);\n// Split bigint into two 32-bit halves. With `le=true`, returned fields become `{ h: low, l: high\n// }` to match little-endian word order rather than the property names.\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n// Split bigint list into `[highWords, lowWords]` when `le=false`; with `le=true`, the first array\n// holds the low halves because `fromBig(...)` swaps the semantic meaning of `h` and `l`.\nfunction split(lst, le = false) {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n// Combine explicit `(high, low)` 32-bit halves into a bigint; `>>> 0` normalizes signed JS\n// bitwise results back to uint32 first, and little-endian callers must swap.\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// Split a JS number into u32 halves without a BigInt allocation. Exact only for integers\n// `0 <= n < 2**53`; callers use it on byte / bit counters, which JS length math caps far below\n// that (an ArrayBuffer cannot exceed 2**53 - 1 bytes).\nconst fromNumH = (n) => (n / 2 ** 32) | 0;\nconst fromNumL = (n) => n >>> 0;\n// Drop-in replacement for `view.setBigUint64(byteOffset, BigInt(n), isLE)` without the per-call\n// BigInt allocation. Same `n < 2**53` precondition as `fromNumH`/`fromNumL`.\nfunction setU64FromNum(view, byteOffset, n, isLE) {\n const h = fromNumH(n);\n const l = fromNumL(n);\n view.setUint32(byteOffset, isLE ? l : h, isLE);\n view.setUint32(byteOffset + 4, isLE ? h : l, isLE);\n}\n// High 32-bit half of a 64-bit logical right shift for `s` in `0..31`.\nconst shrSH = (h, _l, s) => h >>> s;\n// Low 32-bit half of a 64-bit logical right shift, valid for `s` in `1..31`.\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// High 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped low half.\nconst rotr32H = (_h, l) => l;\n// Low 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped high half.\nconst rotr32L = (h, _l) => h;\n// 64-bit left rotates (rotl*) are not defined here: sha3.ts, their only consumer, keeps\n// local copies so V8 inlines them into keccakP.\n// Add two split 64-bit words and return the split `{ h, l }` sum.\n// JS uses 32-bit signed integers for bitwise operations, so we cannot simply shift the carry out\n// of the low sum and instead use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\n// Unmasked low-word accumulator for 3-way addition; pass the raw result into `add3H(...)`.\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\n// High-word finalize step for 3-way addition; `low` must be the untruncated output of `add3L(...)`.\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 4-way addition; pass the raw result into `add4H(...)`.\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\n// High-word finalize step for 4-way addition; `low` must be the untruncated output of `add4L(...)`.\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 5-way addition; pass the raw result into `add5H(...)`.\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\n// High-word finalize step for 5-way addition; `low` must be the untruncated output of `add5L(...)`.\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, fromNumH, fromNumL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, setU64FromNum, shrSH, shrSL, split, toBig };\n","/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - value to test\n * @returns `true` when the value is a Uint8Array-compatible view.\n * @example\n * Check whether a value is a Uint8Array-compatible view.\n * ```ts\n * isBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function isBytes(a) {\n // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy / cross-realm cases.\n // The fallback still requires a real ArrayBuffer view, so plain\n // JSON-deserialized `{ constructor: ... }` spoofing is rejected, and\n // `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n return (a instanceof Uint8Array ||\n (ArrayBuffer.isView(a) &&\n a.constructor.name === 'Uint8Array' &&\n 'BYTES_PER_ELEMENT' in a &&\n a.BYTES_PER_ELEMENT === 1));\n}\n// Shared error-message prefix builder. Only called on throw paths, so assert\n// success paths never pay for the string concatenation.\nconst atitle = (title) => (title ? `\"${title}\" ` : '');\n/**\n * Asserts something is a non-negative integer.\n * @param n - number to validate\n * @param title - label included in thrown errors\n * @returns The validated number.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a non-negative integer option.\n * ```ts\n * anumber(32, 'length');\n * ```\n */\nexport function anumber(n, title = '') {\n if (typeof n !== 'number')\n throw new TypeError(atitle(title) + 'expected number, got ' + typeof n);\n if (!Number.isSafeInteger(n) || n < 0)\n throw new RangeError(atitle(title) + 'expected integer >= 0, got ' + n);\n return n;\n}\n/**\n * Asserts something is a boolean.\n * @param value - value to validate\n * @param title - label included in thrown errors\n * @returns The validated boolean.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate a boolean option.\n * ```ts\n * abool(true, 'enableXOF');\n * ```\n */\nexport function abool(value, title = '') {\n if (typeof value !== 'boolean')\n throw new TypeError(atitle(title) + 'expected boolean, got type=' + typeof value);\n return value;\n}\n/**\n * Asserts something is Uint8Array.\n * @param value - value to validate\n * @param length - optional exact length constraint\n * @param title - label included in thrown errors\n * @returns The validated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate that a value is a byte array.\n * ```ts\n * abytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function abytes(value, length, title = '') {\n // Success path first: this runs at the start of every update() / digestInto(), and the\n // common `abytes(data)` form must not pay for length handling it does not use.\n if (isBytes(value) && (length === undefined || value.length === length))\n return value;\n // Error path: recompute freely to build the exact message.\n if (length !== undefined)\n anumber(length, 'length');\n const bytes = isBytes(value);\n const ofLen = length !== undefined ? ` of length ${length}` : '';\n const got = bytes ? `length=${value.length}` : `type=${typeof value}`;\n const message = atitle(title) + 'expected Uint8Array' + ofLen + ', got ' + got;\n if (!bytes)\n throw new TypeError(message);\n throw new RangeError(message);\n}\n/**\n * Copies bytes into a fresh Uint8Array.\n * Buffer-style slices can alias the same backing store, so callers that need ownership should copy.\n * @param bytes - source bytes to clone\n * @returns Freshly allocated copy of `bytes`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Clone a byte array before mutating it.\n * ```ts\n * const copy = copyBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function copyBytes(bytes) {\n // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n // because callers use it at byte-validation boundaries before mutating the detached copy.\n return Uint8Array.from(abytes(bytes));\n}\n/**\n * Asserts something is a wrapped hash constructor.\n * @param h - hash constructor to validate\n * @throws On wrong argument types or invalid hash wrapper shape. {@link TypeError}\n * @throws On invalid hash metadata ranges or values. {@link RangeError}\n * @throws If the hash metadata allows empty outputs or block sizes. {@link Error}\n * @example\n * Validate a callable hash wrapper.\n * ```ts\n * import { ahash } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * ahash(sha256);\n * ```\n */\nexport function ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new TypeError('expected hash wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n // HMAC and KDF callers treat these as real byte lengths; allowing zero lets fake wrappers pass\n // validation and can produce empty outputs instead of failing fast.\n if (h.outputLen < 1 || h.blockLen < 1)\n throw new Error('hash blockLen / outputLen must be >= 1');\n}\nconst aobject = (value, label) => {\n if (value === null || typeof value !== 'object' || Array.isArray(value))\n throw new TypeError((label === 'object' ? '' : `\"${label}\" `) + 'expected object, got type=' + typeof value);\n};\nconst aopts = (value, label) => {\n aobject(value, label);\n const proto = Object.getPrototypeOf(value);\n if (proto !== Object.prototype && proto !== null)\n throw new TypeError(`\"${label}\" expected plain object`);\n // Object.assign() treats an own \"__proto__\" source key as a write to the target's legacy\n // prototype setter. Reject it before merging so inherited option values cannot be injected.\n if (Object.hasOwn(value, '__proto__'))\n throw new TypeError(`\"${label}.__proto__\" is not allowed`);\n};\n/**\n * Asserts a hash instance has not been destroyed or finished.\n * @param instance - hash instance to validate\n * @param checkFinished - whether to reject finalized instances\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Validate that a hash instance is still usable.\n * ```ts\n * import { aexists } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aexists(hash);\n * ```\n */\nexport function aexists(instance, checkFinished = true) {\n // Runs on every update()/digestInto(); the flags are library-owned booleans, so only their\n // truthiness is checked - re-validating their type per call was pure hot-path overhead.\n if (instance.destroyed)\n throw new Error('hash was destroyed');\n if (checkFinished && instance.finished)\n throw new Error('digest() was already called');\n}\n/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - destination buffer\n * @param instance - hash instance providing output length\n * Oversized buffers are allowed; downstream code only promises to fill the first `outputLen` bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a caller-provided digest buffer.\n * ```ts\n * import { aoutput } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aoutput(new Uint8Array(hash.outputLen), hash);\n * ```\n */\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'output');\n // `outputLen` is a library-owned readonly number; the negated comparison keeps failing fast\n // when it is missing/NaN (comparisons with undefined/NaN are false) without an anumber() call.\n const min = instance.outputLen;\n if (!(out.length >= min)) {\n throw new RangeError('\"output\" expected length >= ' + min);\n }\n}\n/**\n * Casts a typed array view to Uint8Array.\n * @param arr - source typed array\n * @returns Uint8Array view over the same buffer.\n * @example\n * Reinterpret a typed array as bytes.\n * ```ts\n * u8(new Uint32Array([1, 2]));\n * ```\n */\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Casts a typed array view to Uint32Array.\n * `arr.byteOffset` must already be 4-byte aligned or the platform\n * Uint32Array constructor will throw.\n * @param arr - source typed array\n * @returns Uint32Array view over the same buffer.\n * @example\n * Reinterpret a byte array as 32-bit words.\n * ```ts\n * u32(new Uint8Array(8));\n * ```\n */\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/**\n * Zeroizes typed arrays in place. Warning: JS provides no guarantees.\n * @param arrays - arrays to overwrite with zeros\n * @example\n * Zeroize sensitive buffers in place.\n * ```ts\n * clean(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - source typed array\n * @returns DataView over the same buffer region.\n * @example\n * Create a DataView over an existing buffer.\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Rotate-right operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the right.\n * ```ts\n * rotr(0x12345678, 8);\n * ```\n */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/**\n * Rotate-left operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the left.\n * ```ts\n * rotl(0x12345678, 8);\n * ```\n */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Whether the current platform is little-endian. */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/**\n * Byte-swap operation for uint32 values.\n * @param word - source word\n * @returns Word with reversed byte order.\n * @example\n * Reverse the byte order of a 32-bit word.\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/**\n * Conditionally byte-swaps one 32-bit word on big-endian platforms.\n * @param n - source word\n * @returns Original or byte-swapped word depending on platform endianness.\n * @example\n * Normalize a 32-bit word for host endianness.\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n) >>> 0;\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - array to mutate\n * @returns The same array after mutation; callers pass live state arrays here.\n * @example\n * Reverse the byte order of every word in place.\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n/**\n * Conditionally byte-swaps a Uint32Array on big-endian platforms.\n * @param u - array to normalize for host endianness\n * @returns Original or byte-swapped array depending on platform endianness.\n * On big-endian runtimes this mutates `u` in place via `byteSwap32(...)`.\n * @example\n * Normalize a word array for host endianness.\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string.\n * Uses the built-in function when available and assumes it matches the tested\n * fallback semantics.\n * @param bytes - bytes to encode\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Convert bytes to lowercase hexadecimal.\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// Strict ASCII nibble parser: non-ASCII hex lookalikes are rejected as undefined.\n// ASCII codes: '0'..'9' = 48..57, 'A'..'F' = 65..70, 'a'..'f' = 97..102.\n// prettier-ignore\nfunction asciiToBase16(ch) {\n return ch >= 48 && ch <= 57 ? ch - 48 // '2' => 50-48\n : ch >= 65 && ch <= 70 ? ch - (65 - 10) // 'B' => 66-(65-10)\n : ch >= 97 && ch <= 102 ? ch - (97 - 10) // 'b' => 98-(97-10)\n : undefined;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new TypeError('hex string expected, got ' + typeof hex);\n if (hasHexBuiltin) {\n try {\n return Uint8Array.fromHex(hex);\n }\n catch (error) {\n if (error instanceof SyntaxError)\n throw new RangeError(error.message);\n throw error;\n }\n }\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new RangeError('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi)); // parse first char, multiply it by 16\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1)); // parse second char\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new RangeError('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n }\n return array;\n}\n/**\n * Yields to the host task scheduler so timers, I/O, and rendering can make progress.\n * Uses the Web Scheduling API when available or `setTimeout` as a cross-platform fallback.\n * Host-task yields are much slower than microtasks (roughly 1ms with the timer fallback), so\n * async loops should use `asyncTick >= 10` to amortize scheduling overhead to about 10% while\n * still allowing other event-loop work to proceed.\n * @param onReject - optional cleanup invoked only if the host yield fails\n * @example\n * Yield to the next scheduler tick.\n * ```ts\n * await nextTick();\n * ```\n */\nexport function nextTick(onReject) {\n const host = globalThis;\n if (typeof host.scheduler?.yield === 'function') {\n const promise = host.scheduler.yield();\n // Keep the original scheduler rejection; this handler exists only for cleanup.\n if (onReject)\n promise.catch(onReject);\n return promise;\n }\n return new Promise((resolve) => host.setTimeout(resolve, 0));\n}\n/**\n * Returns control to the host event loop every `tick` milliseconds to avoid blocking long loops.\n * @param iters - number of loop iterations to run\n * @param tick - maximum time slice in milliseconds\n * @param cb - callback executed on each iteration\n * @param onReject - optional cleanup invoked only if a host yield fails\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Run a loop that periodically yields back to the event loop.\n * ```ts\n * await asyncLoop(2, 0, () => {});\n * ```\n */\nexport async function asyncLoop(iters, tick, cb, onReject) {\n anumber(iters, 'iters');\n anumber(tick, 'tick');\n if (typeof cb !== 'function')\n throw new TypeError('callback must be a function');\n // Callback is synchronous by contract; asyncLoop only yields between sync work windows.\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick(onReject);\n // Track only synchronous work time; scheduler delay after yielding is outside our budget.\n ts = Date.now();\n }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * Non-ASCII details are delegated to the platform `TextEncoder`.\n * @param str - string to encode\n * @returns UTF-8 encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode a string as UTF-8 bytes.\n * ```ts\n * utf8ToBytes('abc'); // Uint8Array.from([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new TypeError('string expected');\n const encoded = new TextEncoder().encode(str);\n try {\n // Copy into the current realm for Firefox extension contexts. Callers that own the returned\n // buffer can then wipe it independently of TextEncoder's temporary result.\n return new Uint8Array(encoded); // https://bugzil.la/1681809\n }\n finally {\n clean(encoded);\n }\n}\n/**\n * Helper for KDFs: consumes Uint8Array or string.\n * String inputs are UTF-8 encoded; byte-array inputs stay aliased to the caller buffer.\n * @param data - user-provided KDF input\n * @param errorTitle - label included in thrown errors\n * @returns Byte representation of the input.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Normalize KDF input to bytes.\n * ```ts\n * kdfInputToBytes('password');\n * ```\n */\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - arrays to concatenate\n * @returns Concatenated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Concatenate multiple byte arrays.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/**\n * Validates declared required and optional field types on a plain object.\n * This walks field schemas and formats detailed errors, so avoid it on hot paths; use direct\n * one-line guards such as `abytes()`, `abool()`, or `anumber()` instead.\n * @param object - object to validate\n * @param fields - map of required field names to expected types\n * @param optFields - map of optional field names to expected types\n * @param title - label included in thrown errors\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate required and optional option fields.\n * ```ts\n * validateObject({ N: 1024, dkLen: 32 }, { N: 'number' }, { dkLen: 'number' });\n * ```\n */\nexport const validateObject = (object, fields = {}, optFields = {}, title = 'object') => {\n aobject(object, title);\n aobject(fields, 'fields');\n aobject(optFields, 'optFields');\n function checkField(fieldName, expectedType, isOpt) {\n const label = title === 'object' ? `param \"${String(fieldName)}\"` : `\"${title}.${String(fieldName)}\"`;\n // Config fields must be explicit own properties. Optional inherited values are rejected too\n // because callers keep reading the same options object after validation.\n const val = object[fieldName];\n // Runtime objects such as Field instances intentionally satisfy required method slots\n // via their shared prototype.\n if (!Object.hasOwn(object, fieldName) &&\n (isOpt ? val !== undefined : expectedType !== 'function')) {\n throw new TypeError(`${label} is invalid: expected own property`);\n }\n if (isOpt && val === undefined)\n return;\n const current = typeof val;\n if (current !== expectedType || val === null)\n throw new TypeError(`${label} is invalid: expected ${expectedType}, got ${current}`);\n }\n const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n};\n/**\n * Merges default options and passed options.\n * @param defaults - base option object\n * @param opts - user overrides\n * @param title - label included in thrown override errors\n * @returns Fresh merged option object with a null prototype.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Merge user overrides onto default options.\n * ```ts\n * checkOpts({ dkLen: 32 }, { asyncTick: 10 });\n * ```\n */\nexport function checkOpts(defaults, opts, title = 'opts') {\n aopts(defaults, 'defaults');\n if (opts !== undefined)\n aopts(opts, title);\n // Callers read optional fields directly, so omitted values must not fall through to ambient\n // Object.prototype pollution (for example a forged `dkLen` changing SHAKE's default output).\n const merged = Object.assign(Object.create(null), defaults, opts);\n return merged;\n}\n/**\n * Creates a callable hash function from a stateful class constructor.\n * @param hashCons - hash constructor or factory\n * @param info - optional metadata such as DER OID\n * @returns Frozen callable hash wrapper with `.create()`.\n * Wrapper construction eagerly calls `hashCons(undefined)` once to read\n * `outputLen` / `blockLen`, so constructor side effects happen at module\n * init time.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Wrap a stateful hash constructor into a callable helper.\n * ```ts\n * import { createHasher } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const wrapped = createHasher(sha256.create, { oid: sha256.oid });\n * wrapped(new Uint8Array([1]));\n * ```\n */\nexport function createHasher(hashCons, info = {}) {\n if (typeof hashCons !== 'function')\n throw new TypeError('\"hashCons\" expected function, got type=' + typeof hashCons);\n info = checkOpts({}, info, 'info');\n const hashC = (msg, opts) => hashCons(opts)\n .update(msg)\n .digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.canXOF = tmp.canXOF;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32) {\n // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n anumber(bytesLength, 'bytesLength');\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n // Web Cryptography API Level 2 §10.1.1:\n // if `byteLength > 65536`, throw `QuotaExceededError`.\n // Keep the guard explicit so callers can see the quota in code\n // instead of discovering it by reading the spec or host errors.\n // This wrapper surfaces the same quota as a stable library RangeError.\n if (bytesLength > 65536)\n throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/**\n * Creates OID metadata for NIST hashes with prefix `06 09 60 86 48 01 65 03 04 02`.\n * @param suffix - final OID byte for the selected hash.\n * The helper accepts any byte even though only the documented NIST hash\n * suffixes are meaningful downstream.\n * @returns Object containing the DER-encoded OID.\n * @example\n * Build OID metadata for a NIST hash.\n * ```ts\n * oidNist(0x01);\n * ```\n */\nexport const oidNist = (suffix) => ({\n // Current NIST hashAlgs suffixes used here fit in one DER subidentifier octet.\n // Larger suffix values would need base-128 OID encoding and a different length byte.\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out\n * {@link https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf | FIPS-202},\n * {@link https://keccak.team/keccak.html | Website}, and\n * {@link https://crypto.stackexchange.com/q/15727 | the differences between\n * SHA-3 and Keccak}.\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { split } from \"./_u64.js\";\n// prettier-ignore\nimport { abool, abytes, aexists, anumber, aoutput, checkOpts, clean, createHasher, oidNist, swap32IfBE, u32 } from \"./utils.js\";\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\n// FIPS 202 Algorithm 5 rc(): when the outgoing bit is 1, the 8-bit LFSR xors\n// taps 0, 4, 5, and 6, which compresses to the feedback mask `0x71`.\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n)\n t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\n// `split(..., true)` keeps the local little-endian lane-word layout used by\n// `state32`, so these `H` / `L` tables follow the file's first-word /\n// second-word lane slots rather than `_u64.ts`'s usual high/low naming.\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n// 64-bit left rotates as u32 pairs. Inlined here (not imported from _u64) so V8 can\n// inline them into keccakP — the import path costs ~24% on sha3_256. SHA3 is the only\n// consumer of left-rotates; other hashes use right-rotates from _u64.\n// Valid for s in 1..31 (SH/SL) and 33..63 (BH/BL); keccak never rotates by 0/32/64.\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Reused Theta scratch buffer (column parities), same pattern as SHA256_W in sha2.\n// keccakP never calls user code, so the shared buffer cannot be observed mid-permutation.\nconst B = new Uint32Array(5 * 2);\n/**\n * `keccakf1600` internal permutation, additionally allows adjusting the round count.\n * @param s - 5x5 Keccak state encoded as 25 lanes split into 50 uint32 words\n * in this file's local little-endian lane-word order\n * @param rounds - number of rounds to execute\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If `rounds` is outside the supported `1..24` range. {@link Error}\n * @example\n * Permute a Keccak state with the default 24 rounds.\n * ```ts\n * keccakP(new Uint32Array(50));\n * ```\n */\nexport function keccakP(s, rounds = 24) {\n if (!(s instanceof Uint32Array))\n throw new TypeError('\"s\" expected Uint32Array(50), got type=' + typeof s);\n if (s.length !== 50)\n throw new RangeError('\"s\" expected Uint32Array(50), got length=' + s.length);\n anumber(rounds, 'rounds');\n // This implementation precomputes only the standard Keccak-f[1600] 24-round Iota table.\n if (rounds < 1 || rounds > 24)\n throw new Error('\"rounds\" expected integer 1..24');\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++)\n B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n // Same as:\n // for (let x = 0; x < 10; x++) B[x] = s[y + x];\n // for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n for (let y = 0; y < 50; y += 10) {\n const b0 = s[y], b1 = s[y + 1], b2 = s[y + 2], b3 = s[y + 3];\n s[y] ^= ~s[y + 2] & s[y + 4];\n s[y + 1] ^= ~s[y + 3] & s[y + 5];\n s[y + 2] ^= ~s[y + 4] & s[y + 6];\n s[y + 3] ^= ~s[y + 5] & s[y + 7];\n s[y + 4] ^= ~s[y + 6] & s[y + 8];\n s[y + 5] ^= ~s[y + 7] & s[y + 9];\n s[y + 6] ^= ~s[y + 8] & b0;\n s[y + 7] ^= ~s[y + 9] & b1;\n s[y + 8] ^= ~b0 & b2;\n s[y + 9] ^= ~b1 & b3;\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n/**\n * Keccak sponge function.\n * @param blockLen - absorb/squeeze rate in bytes\n * @param suffix - domain separation suffix byte\n * @param outputLen - default digest length in bytes. This base sponge only\n * requires a non-negative integer; wrappers that need positive output\n * lengths must enforce that themselves.\n * @param enableXOF - whether XOF output is allowed\n * @param rounds - number of Keccak-f rounds\n * @example\n * Build a sponge state, absorb bytes, then finalize a digest.\n * ```ts\n * const hash = new Keccak(136, 0x06, 32);\n * hash.update(new Uint8Array([1, 2, 3]));\n * hash.digest();\n * ```\n */\nexport class Keccak {\n state;\n pos = 0;\n posOut = 0;\n finished = false;\n state32;\n destroyed = false;\n blockLen;\n suffix;\n outputLen;\n canXOF;\n enableXOF = false;\n rounds;\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n anumber(blockLen, 'blockLen');\n anumber(suffix, 'suffix');\n anumber(rounds, 'rounds');\n abool(enableXOF, 'enableXOF');\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.canXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // Only keccak-f1600 is supported: 1600 bits (5x5 matrix of 64bit) === 200 bytes of state.\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('\"blockLen\" must be 1..199');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone() {\n return this._cloneInto();\n }\n keccak() {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { blockLen, state, state32 } = this;\n const len = data.length;\n // Absorb full blocks with u32 XORs when both sides are 4-byte aligned.\n // XOR of same-position words equals XOR of same-position bytes, so this is endianness-safe.\n const canUseU32 = blockLen % 4 === 0 && data.byteOffset % 4 === 0;\n const blockLen32 = blockLen / 4;\n const data32 = canUseU32 && len >= blockLen ? u32(data) : undefined;\n for (let pos = 0; pos < len;) {\n if (data32 !== undefined && this.pos === 0 && pos % 4 === 0 && len - pos >= blockLen) {\n for (let i = 0, o = pos / 4; i < blockLen32; i++)\n state32[i] ^= data32[o + i];\n pos += blockLen;\n // Subclasses (_KeccakPRG) read `this.pos` inside their `keccak()` override,\n // so it must reflect the fully-absorbed block before the permutation fires.\n this.pos = blockLen;\n this.keccak();\n continue;\n }\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++)\n state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen)\n this.keccak();\n }\n return this;\n }\n finish() {\n if (this.finished)\n return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // FIPS 202 appends the SHA3/SHAKE domain-separation suffix before pad10*1.\n // These byte values already include the first padding bit, while the\n // final `0x80` below supplies the closing `1` bit in the last rate byte.\n state[pos] ^= suffix;\n // If that combined suffix lands in the last rate byte and already sets\n // bit 7, absorb it first so the final pad10*1 bit can be xored into a\n // fresh block.\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n writeInto(out) {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len;) {\n if (this.posOut >= blockLen)\n this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out) {\n // Plain SHA3/Keccak usage with XOF is probably a mistake, but this base\n // class is also reused by SHAKE/cSHAKE/KMAC/TupleHash/ParallelHash/\n // TurboSHAKE/KangarooTwelve wrappers that intentionally enable XOF.\n if (!this.enableXOF)\n throw new Error('XOF is not enabled');\n return this.writeInto(out);\n }\n xof(bytes) {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out) {\n aoutput(out, this);\n if (this.finished)\n throw new Error('digest() was already called');\n // `aoutput(...)` allows oversized buffers; digestInto() must fill only the advertised digest.\n this.writeInto(out.length === this.outputLen ? out : out.subarray(0, this.outputLen));\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.outputLen);\n this.digestInto(out);\n return out;\n }\n destroy() {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to) {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n // Reused destinations can come from a different rate/capacity variant, so clone must rewrite\n // the sponge geometry as well as the state words.\n to.blockLen = blockLen;\n to.state32.set(this.state32);\n // Sponge padding and XOF output are positional, so both offsets are part of the clone state.\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n // Clones must preserve the public capability bit too; `_KMAC` reuses this path and deep clone\n // tests compare instance fields directly, so leaving `canXOF` behind makes the clone lie.\n to.canXOF = this.canXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\nconst genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n/**\n * SHA3-224 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-224.\n * ```ts\n * sha3_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_224 = /* @__PURE__ */ genKeccak(0x06, 144, 28, \n/* @__PURE__ */ oidNist(0x07));\n/**\n * SHA3-256 hash function. Different from keccak-256.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-256.\n * ```ts\n * sha3_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_256 = /* @__PURE__ */ genKeccak(0x06, 136, 32, \n/* @__PURE__ */ oidNist(0x08));\n/**\n * SHA3-384 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-384.\n * ```ts\n * sha3_384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_384 = /* @__PURE__ */ genKeccak(0x06, 104, 48, \n/* @__PURE__ */ oidNist(0x09));\n/**\n * SHA3-512 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-512.\n * ```ts\n * sha3_512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_512 = /* @__PURE__ */ genKeccak(0x06, 72, 64, \n/* @__PURE__ */ oidNist(0x0a));\n/**\n * Keccak-224 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-224.\n * ```ts\n * keccak_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_224 = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/**\n * Keccak-256 hash function. Different from SHA3-256.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-256.\n * ```ts\n * keccak_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_256 = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/**\n * Keccak-384 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-384.\n * ```ts\n * keccak_384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_384 = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/**\n * Keccak-512 hash function.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-512.\n * ```ts\n * keccak_512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_512 = /* @__PURE__ */ genKeccak(0x01, 72, 64);\nconst genShake = (suffix, blockLen, outputLen, info = {}) => createHasher((opts = {}) => {\n opts = checkOpts({}, opts);\n return new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true);\n}, info);\n/**\n * SHAKE128 XOF with 128-bit security and a 16-byte default output.\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE128.\n * ```ts\n * shake128(new Uint8Array([97, 98, 99]), { dkLen: 32 });\n * ```\n */\nexport const shake128 = \n/* @__PURE__ */\ngenShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/**\n * SHAKE256 XOF with 256-bit security and a 32-byte default output.\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE256.\n * ```ts\n * shake256(new Uint8Array([97, 98, 99]), { dkLen: 64 });\n * ```\n */\nexport const shake256 = \n/* @__PURE__ */\ngenShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n/**\n * SHAKE128 XOF with 256-bit output (NIST version).\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE128 using a 32-byte default output.\n * ```ts\n * shake128_32(new Uint8Array([97, 98, 99]), { dkLen: 32 });\n * ```\n */\nexport const shake128_32 = \n/* @__PURE__ */\ngenShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/**\n * SHAKE256 XOF with 512-bit output (NIST version).\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE256 using a 64-byte default output.\n * ```ts\n * shake256_64(new Uint8Array([97, 98, 99]), { dkLen: 64 });\n * ```\n */\nexport const shake256_64 = \n/* @__PURE__ */\ngenShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n"],"x_google_ignoreList":[0,1,2],"mappings":"AAAA,IAAM,EAAoC,OAAO,GAAK,GAAK,CAAC,EACtD,EAAuB,OAAO,EAAE,EAGtC,SAAS,EAAQ,EAAG,EAAK,GAAO,CAG5B,OAFI,EACO,CAAE,EAAG,OAAO,EAAI,CAAU,EAAG,EAAG,OAAQ,GAAK,EAAQ,CAAU,CAAE,EACrE,CAAE,EAAG,OAAQ,GAAK,EAAQ,CAAU,EAAI,EAAG,EAAG,OAAO,EAAI,CAAU,EAAI,CAAE,CACpF,CAGA,SAAS,EAAM,EAAK,EAAK,GAAO,CAC5B,IAAM,EAAM,EAAI,OACZ,EAAK,IAAI,YAAY,CAAG,EACxB,EAAK,IAAI,YAAY,CAAG,EAC5B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,IAAK,CAC1B,GAAM,CAAE,IAAG,KAAM,EAAQ,EAAI,GAAI,CAAE,EACnC,CAAC,EAAG,GAAI,EAAG,IAAM,CAAC,EAAG,CAAC,CAC1B,CACA,MAAO,CAAC,EAAI,CAAE,CAClB,CCVA,SAAgB,EAAQ,EAAG,CAKvB,OAAQ,aAAa,YAChB,YAAY,OAAO,CAAC,GACjB,EAAE,YAAY,OAAS,cACvB,sBAAuB,GACvB,EAAE,oBAAsB,CACpC,CAGA,IAAM,EAAU,GAAW,EAAQ,IAAI,EAAM,IAAM,GAcnD,SAAgB,EAAQ,EAAG,EAAQ,GAAI,CACnC,GAAI,OAAO,GAAM,SACb,MAAU,UAAU,EAAO,CAAK,EAAI,wBAA0B,OAAO,CAAC,EAC1E,GAAI,CAAC,OAAO,cAAc,CAAC,GAAK,EAAI,EAChC,MAAU,WAAW,EAAO,CAAK,EAAI,8BAAgC,CAAC,EAC1E,OAAO,CACX,CAaA,SAAgB,EAAM,EAAO,EAAQ,GAAI,CACrC,GAAI,OAAO,GAAU,UACjB,MAAU,UAAU,EAAO,CAAK,EAAI,8BAAgC,OAAO,CAAK,EACpF,OAAO,CACX,CAeA,SAAgB,EAAO,EAAO,EAAQ,EAAQ,GAAI,CAG9C,GAAI,EAAQ,CAAK,IAAM,IAAW,IAAA,IAAa,EAAM,SAAW,GAC5D,OAAO,EAEP,IAAW,IAAA,IACX,EAAQ,EAAQ,QAAQ,EAC5B,IAAM,EAAQ,EAAQ,CAAK,EACrB,EAAQ,IAAW,IAAA,GAAqC,GAAzB,cAAc,IAC7C,EAAM,EAAQ,UAAU,EAAM,SAAW,QAAQ,OAAO,IACxD,EAAU,EAAO,CAAK,EAAI,sBAAwB,EAAQ,SAAW,EAG3E,MAFK,EAEK,WAAW,CAAO,EADd,UAAU,CAAO,CAEnC,CA0CA,IAAM,GAAW,EAAO,IAAU,CAC9B,GAAsB,OAAO,GAAU,WAAnC,GAA+C,MAAM,QAAQ,CAAK,EAClE,MAAU,WAAW,IAAU,SAAW,GAAK,IAAI,EAAM,KAAO,6BAA+B,OAAO,CAAK,CACnH,EACM,GAAS,EAAO,IAAU,CAC5B,EAAQ,EAAO,CAAK,EACpB,IAAM,EAAQ,OAAO,eAAe,CAAK,EACzC,GAAI,IAAU,OAAO,WAAa,IAAU,KACxC,MAAU,UAAU,IAAI,EAAM,wBAAwB,EAG1D,GAAI,OAAO,OAAO,EAAO,WAAW,EAChC,MAAU,UAAU,IAAI,EAAM,2BAA2B,CACjE,EAeA,SAAgB,EAAQ,EAAU,EAAgB,GAAM,CAGpD,GAAI,EAAS,UACT,MAAU,MAAM,oBAAoB,EACxC,GAAI,GAAiB,EAAS,SAC1B,MAAU,MAAM,6BAA6B,CACrD,CAiBA,SAAgB,EAAQ,EAAK,EAAU,CACnC,EAAO,EAAK,IAAA,GAAW,QAAQ,EAG/B,IAAM,EAAM,EAAS,UACrB,GAAI,EAAE,EAAI,QAAU,GAChB,MAAU,WAAW,+BAAiC,CAAG,CAEjE,CA0BA,SAAgB,EAAI,EAAK,CACrB,OAAO,IAAI,YAAY,EAAI,OAAQ,EAAI,WAAY,KAAK,MAAM,EAAI,WAAa,CAAC,CAAC,CACrF,CAUA,SAAgB,EAAM,GAAG,EAAQ,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,EAAO,EAAE,CAAC,KAAK,CAAC,CAExB,CA2CA,IAAa,EAA8B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAO,GAWvG,SAAgB,EAAS,EAAM,CAC3B,OAAU,GAAQ,GAAM,WAClB,GAAQ,EAAK,SACb,IAAS,EAAK,MACd,IAAS,GAAM,GACzB,CAwBA,SAAgB,EAAW,EAAK,CAC5B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC5B,EAAI,GAAK,EAAS,EAAI,EAAE,EAE5B,OAAO,CACX,CAYA,IAAa,EAAa,EACnB,GAAM,EACP,EAqQN,SAAgB,EAAU,EAAU,EAAM,EAAQ,OAAQ,CAOtD,OANA,EAAM,EAAU,UAAU,EACtB,IAAS,IAAA,IACT,EAAM,EAAM,CAAK,EAGN,OAAO,OAAO,OAAO,OAAO,IAAI,EAAG,EAAU,CAChD,CAChB,CAmBA,SAAgB,EAAa,EAAU,EAAO,CAAC,EAAG,CAC9C,GAAI,OAAO,GAAa,WACpB,MAAU,UAAU,0CAA4C,OAAO,CAAQ,EACnF,EAAO,EAAU,CAAC,EAAG,EAAM,MAAM,EACjC,IAAM,GAAS,EAAK,IAAS,EAAS,CAAI,CAAC,CACtC,OAAO,CAAG,CAAC,CACX,OAAO,EACN,EAAM,EAAS,IAAA,EAAS,EAM9B,MALA,GAAM,UAAY,EAAI,UACtB,EAAM,SAAW,EAAI,SACrB,EAAM,OAAS,EAAI,OACnB,EAAM,OAAU,GAAS,EAAS,CAAI,EACtC,OAAO,OAAO,EAAO,CAAI,EAClB,OAAO,OAAO,CAAK,CAC9B,CC3mBA,IAAM,EAAM,OAAO,CAAC,EACd,EAAM,OAAO,CAAC,EACd,EAAM,OAAO,CAAC,EACd,EAAM,OAAO,CAAC,EACd,EAAQ,OAAO,GAAG,EAGlB,EAAS,OAAO,GAAI,EACpB,EAAU,CAAC,EACX,EAAY,CAAC,EACb,EAAa,CAAC,EACpB,IAAK,IAAI,EAAQ,EAAG,EAAI,EAAK,EAAI,EAAG,EAAI,EAAG,EAAQ,GAAI,IAAS,CAE5D,CAAC,EAAG,GAAK,CAAC,GAAI,EAAI,EAAI,EAAI,GAAK,CAAC,EAChC,EAAQ,KAAK,GAAK,EAAI,EAAI,EAAE,EAE5B,EAAU,MAAQ,EAAQ,IAAM,EAAQ,GAAM,EAAK,EAAE,EAErD,IAAI,EAAI,EACR,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,GAAM,GAAK,GAAS,GAAK,GAAO,GAAW,EACvC,EAAI,IACJ,GAAK,IAAS,GAAO,OAAO,CAAC,GAAK,GAE1C,EAAW,KAAK,CAAC,CACrB,CACA,IAAM,EAAQ,EAAM,EAAY,EAAI,EAI9B,EAAc,EAAM,GACpB,EAAc,EAAM,GAKpB,GAAU,EAAG,EAAG,IAAO,GAAK,EAAM,IAAO,GAAK,EAC9C,GAAU,EAAG,EAAG,IAAO,GAAK,EAAM,IAAO,GAAK,EAC9C,GAAU,EAAG,EAAG,IAAO,GAAM,EAAI,GAAQ,IAAO,GAAK,EACrD,GAAU,EAAG,EAAG,IAAO,GAAM,EAAI,GAAQ,IAAO,GAAK,EACrD,GAAS,EAAG,EAAG,IAAO,EAAI,GAAK,EAAO,EAAG,EAAG,CAAC,EAAI,EAAO,EAAG,EAAG,CAAC,EAC/D,GAAS,EAAG,EAAG,IAAO,EAAI,GAAK,EAAO,EAAG,EAAG,CAAC,EAAI,EAAO,EAAG,EAAG,CAAC,EAG/D,EAAI,IAAI,YAAY,EAAK,EAe/B,SAAgB,EAAQ,EAAG,EAAS,GAAI,CACpC,GAAI,EAAE,aAAa,aACf,MAAU,UAAU,0CAA4C,OAAO,CAAC,EAC5E,GAAI,EAAE,SAAW,GACb,MAAU,WAAW,4CAA8C,EAAE,MAAM,EAG/E,GAFA,EAAQ,EAAQ,QAAQ,EAEpB,EAAS,GAAK,EAAS,GACvB,MAAU,MAAM,iCAAiC,EAErD,IAAK,IAAI,EAAQ,GAAK,EAAQ,EAAQ,GAAI,IAAS,CAE/C,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAE,GAAK,EAAE,GAAK,EAAE,EAAI,IAAM,EAAE,EAAI,IAAM,EAAE,EAAI,IAAM,EAAE,EAAI,IAC5D,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,GAAK,EAAG,CAC5B,IAAM,GAAQ,EAAI,GAAK,GACjB,GAAQ,EAAI,GAAK,GACjB,EAAK,EAAE,GACP,EAAK,EAAE,EAAO,GACd,EAAK,EAAM,EAAI,EAAI,CAAC,EAAI,EAAE,GAC1B,EAAK,EAAM,EAAI,EAAI,CAAC,EAAI,EAAE,EAAO,GACvC,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,GAAK,GACzB,EAAE,EAAI,IAAM,EACZ,EAAE,EAAI,EAAI,IAAM,CAExB,CAEA,IAAI,EAAO,EAAE,GACT,EAAO,EAAE,GACb,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IAAK,CACzB,IAAM,EAAQ,EAAU,GAClB,EAAK,EAAM,EAAM,EAAM,CAAK,EAC5B,EAAK,EAAM,EAAM,EAAM,CAAK,EAC5B,EAAK,EAAQ,GACnB,EAAO,EAAE,GACT,EAAO,EAAE,EAAK,GACd,EAAE,GAAM,EACR,EAAE,EAAK,GAAK,CAChB,CAKA,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,GAAK,GAAI,CAC7B,IAAM,EAAK,EAAE,GAAI,EAAK,EAAE,EAAI,GAAI,EAAK,EAAE,EAAI,GAAI,EAAK,EAAE,EAAI,GAC1D,EAAE,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC1B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC9B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC9B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC9B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC9B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EAAE,EAAI,GAC9B,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EACxB,EAAE,EAAI,IAAM,CAAC,EAAE,EAAI,GAAK,EACxB,EAAE,EAAI,IAAM,CAAC,EAAK,EAClB,EAAE,EAAI,IAAM,CAAC,EAAK,CACtB,CAEA,EAAE,IAAM,EAAY,GACpB,EAAE,IAAM,EAAY,EACxB,CACA,EAAM,CAAC,CACX,CAkBA,IAAa,EAAb,MAAa,CAAO,CAChB,MACA,IAAM,EACN,OAAS,EACT,SAAW,GACX,QACA,UAAY,GACZ,SACA,OACA,UACA,OACA,UAAY,GACZ,OAEA,YAAY,EAAU,EAAQ,EAAW,EAAY,GAAO,EAAS,GAAI,CAcrE,GAbA,EAAQ,EAAU,UAAU,EAC5B,EAAQ,EAAQ,QAAQ,EACxB,EAAQ,EAAQ,QAAQ,EACxB,EAAM,EAAW,WAAW,EAC5B,KAAK,SAAW,EAChB,KAAK,OAAS,EACd,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,EAAQ,EAAW,WAAW,EAE1B,EAAE,EAAI,GAAY,EAAW,KAC7B,MAAU,MAAM,2BAA2B,EAC/C,KAAK,MAAQ,IAAI,WAAW,GAAG,EAC/B,KAAK,QAAU,EAAI,KAAK,KAAK,CACjC,CACA,OAAQ,CACJ,OAAO,KAAK,WAAW,CAC3B,CACA,QAAS,CACL,EAAW,KAAK,OAAO,EACvB,EAAQ,KAAK,QAAS,KAAK,MAAM,EACjC,EAAW,KAAK,OAAO,EACvB,KAAK,OAAS,EACd,KAAK,IAAM,CACf,CACA,OAAO,EAAM,CACT,EAAQ,IAAI,EACZ,EAAO,CAAI,EACX,GAAM,CAAE,WAAU,QAAO,WAAY,KAC/B,EAAM,EAAK,OAGX,EAAY,EAAW,GAAM,GAAK,EAAK,WAAa,GAAM,EAC1D,EAAa,EAAW,EACxB,EAAS,GAAa,GAAO,EAAW,EAAI,CAAI,EAAI,IAAA,GAC1D,IAAK,IAAI,EAAM,EAAG,EAAM,GAAM,CAC1B,GAAI,IAAW,IAAA,IAAa,KAAK,MAAQ,GAAK,EAAM,GAAM,GAAK,EAAM,GAAO,EAAU,CAClF,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,EAAG,EAAI,EAAY,IACzC,EAAQ,IAAM,EAAO,EAAI,GAC7B,GAAO,EAGP,KAAK,IAAM,EACX,KAAK,OAAO,EACZ,QACJ,CACA,IAAM,EAAO,KAAK,IAAI,EAAW,KAAK,IAAK,EAAM,CAAG,EACpD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IACtB,EAAM,KAAK,QAAU,EAAK,KAC1B,KAAK,MAAQ,GACb,KAAK,OAAO,CACpB,CACA,OAAO,IACX,CACA,QAAS,CACL,GAAI,KAAK,SACL,OACJ,KAAK,SAAW,GAChB,GAAM,CAAE,QAAO,SAAQ,MAAK,YAAa,KAIzC,EAAM,IAAQ,EAIT,EAAS,KAAe,IAAQ,EAAW,GAC5C,KAAK,OAAO,EAChB,EAAM,EAAW,IAAM,IACvB,KAAK,OAAO,CAChB,CACA,UAAU,EAAK,CACX,EAAQ,KAAM,EAAK,EACnB,EAAO,CAAG,EACV,KAAK,OAAO,EACZ,IAAM,EAAY,KAAK,MACjB,CAAE,YAAa,KACrB,IAAK,IAAI,EAAM,EAAG,EAAM,EAAI,OAAQ,EAAM,GAAM,CACxC,KAAK,QAAU,GACf,KAAK,OAAO,EAChB,IAAM,EAAO,KAAK,IAAI,EAAW,KAAK,OAAQ,EAAM,CAAG,EACvD,EAAI,IAAI,EAAU,SAAS,KAAK,OAAQ,KAAK,OAAS,CAAI,EAAG,CAAG,EAChE,KAAK,QAAU,EACf,GAAO,CACX,CACA,OAAO,CACX,CACA,QAAQ,EAAK,CAIT,GAAI,CAAC,KAAK,UACN,MAAU,MAAM,oBAAoB,EACxC,OAAO,KAAK,UAAU,CAAG,CAC7B,CACA,IAAI,EAAO,CAEP,OADA,EAAQ,CAAK,EACN,KAAK,QAAQ,IAAI,WAAW,CAAK,CAAC,CAC7C,CACA,WAAW,EAAK,CAEZ,GADA,EAAQ,EAAK,IAAI,EACb,KAAK,SACL,MAAU,MAAM,6BAA6B,EAEjD,KAAK,UAAU,EAAI,SAAW,KAAK,UAAY,EAAM,EAAI,SAAS,EAAG,KAAK,SAAS,CAAC,EACpF,KAAK,QAAQ,CACjB,CACA,QAAS,CACL,IAAM,EAAM,IAAI,WAAW,KAAK,SAAS,EAEzC,OADA,KAAK,WAAW,CAAG,EACZ,CACX,CACA,SAAU,CACN,KAAK,UAAY,GACjB,EAAM,KAAK,KAAK,CACpB,CACA,WAAW,EAAI,CACX,GAAM,CAAE,WAAU,SAAQ,YAAW,SAAQ,aAAc,KAmB3D,MAlBA,KAAO,IAAI,EAAO,EAAU,EAAQ,EAAW,EAAW,CAAM,EAGhE,EAAG,SAAW,EACd,EAAG,QAAQ,IAAI,KAAK,OAAO,EAE3B,EAAG,IAAM,KAAK,IACd,EAAG,OAAS,KAAK,OACjB,EAAG,SAAW,KAAK,SACnB,EAAG,OAAS,EAEZ,EAAG,OAAS,EACZ,EAAG,UAAY,EACf,EAAG,UAAY,EAGf,EAAG,OAAS,KAAK,OACjB,EAAG,UAAY,KAAK,UACb,CACX,CACJ,EA6Ea,IA5EM,EAAQ,EAAU,EAAW,EAAO,CAAC,IAAM,MAAmB,IAAI,EAAO,EAAU,EAAQ,CAAS,EAAG,CAAI,EA4EpF,CAAU,EAAM,IAAK,EAAE"}
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>
@@ -21,7 +21,9 @@
21
21
  height: 100dvh;
22
22
  }
23
23
  </style>
24
- <script type="module" crossorigin src="/assets/index-eBmhKyf8.js"></script>
24
+ <script type="module" crossorigin src="/assets/index-C6xlLqXz.js"></script>
25
+ <link rel="modulepreload" crossorigin href="/assets/rolldown-runtime-B0Z9INg1.js">
26
+ <link rel="modulepreload" crossorigin href="/assets/instrument-D2ByLhpL.js">
25
27
  <link rel="stylesheet" crossorigin href="/assets/index-Cs7y8nyH.css">
26
28
  </head>
27
29
  <body>