@protontech/openpgp 6.0.0 → 6.0.2-patch.0

package/dist/lightweight/noble_hashes.min.mjs

@@ -1,3 +1,3 @@
-/*! OpenPGP.js v6.0.0 - 2024-11-06 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
-"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self&&self;import{w as t,g as s,i as h,C as i,M as e,j as n,s as r,a,d as o,k as l,l as f}from"./sha3.min.mjs";const c=/* @__PURE__ */new Uint32Array([1732584193,4023233417,2562383102,271733878,3285377520]),p=/* @__PURE__ */new Uint32Array(80);class d extends s{constructor(){super(64,20,8,!1),this.A=0|c[0],this.B=0|c[1],this.C=0|c[2],this.D=0|c[3],this.E=0|c[4]}get(){const{A:t,B:s,C:h,D:i,E:e}=this;return[t,s,h,i,e]}set(t,s,h,i,e){this.A=0|t,this.B=0|s,this.C=0|h,this.D=0|i,this.E=0|e}process(t,s){for(let h=0;h<16;h++,s+=4)p[h]=t.getUint32(s,!1);for(let t=16;t<80;t++)p[t]=h(p[t-3]^p[t-8]^p[t-14]^p[t-16],1);let{A:n,B:r,C:a,D:o,E:l}=this;for(let t=0;t<80;t++){let s,f;t<20?(s=i(r,a,o),f=1518500249):t<40?(s=r^a^o,f=1859775393):t<60?(s=e(r,a,o),f=2400959708):(s=r^a^o,f=3395469782);const c=h(n,5)+s+l+f+p[t]|0;l=o,o=a,a=h(r,30),r=n,n=c}n=n+this.A|0,r=r+this.B|0,a=a+this.C|0,o=o+this.D|0,l=l+this.E|0,this.set(n,r,a,o,l)}roundClean(){p.fill(0)}destroy(){this.set(0,0,0,0,0),this.buffer.fill(0)}}const u=/* @__PURE__ */t((()=>new d)),w=/* @__PURE__ */new Uint8Array([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),y=/* @__PURE__ */new Uint8Array(Array(16).fill(0).map(((t,s)=>s)));let A=[y],m=[/* @__PURE__ */y.map((t=>(9*t+5)%16))];for(let t=0;t<4;t++)for(let s of[A,m])s.push(s[t].map((t=>w[t])));const U=/* @__PURE__ */[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map((t=>new Uint8Array(t))),C=/* @__PURE__ */A.map(((t,s)=>t.map((t=>U[s][t])))),g=/* @__PURE__ */m.map(((t,s)=>t.map((t=>U[s][t])))),b=/* @__PURE__ */new Uint32Array([0,1518500249,1859775393,2400959708,2840853838]),B=/* @__PURE__ */new Uint32Array([1352829926,1548603684,1836072691,2053994217,0]);function D(t,s,h,i){return 0===t?s^h^i:1===t?s&h|~s&i:2===t?(s|~h)^i:3===t?s&i|h&~i:s^(h|~i)}const E=/* @__PURE__ */new Uint32Array(16);class j extends s{constructor(){super(64,20,8,!0),this.h0=1732584193,this.h1=-271733879,this.h2=-1732584194,this.h3=271733878,this.h4=-1009589776}get(){const{h0:t,h1:s,h2:h,h3:i,h4:e}=this;return[t,s,h,i,e]}set(t,s,h,i,e){this.h0=0|t,this.h1=0|s,this.h2=0|h,this.h3=0|i,this.h4=0|e}process(t,s){for(let h=0;h<16;h++,s+=4)E[h]=t.getUint32(s,!0);let i=0|this.h0,e=i,n=0|this.h1,r=n,a=0|this.h2,o=a,l=0|this.h3,f=l,c=0|this.h4,p=c;for(let t=0;t<5;t++){const s=4-t,d=b[t],u=B[t],w=A[t],y=m[t],U=C[t],j=g[t];for(let s=0;s<16;s++){const e=h(i+D(t,n,a,l)+E[w[s]]+d,U[s])+c|0;i=c,c=l,l=0|h(a,10),a=n,n=e}for(let t=0;t<16;t++){const i=h(e+D(s,r,o,f)+E[y[t]]+u,j[t])+p|0;e=p,p=f,f=0|h(o,10),o=r,r=i}}this.set(this.h1+a+f|0,this.h2+l+p|0,this.h3+c+e|0,this.h4+i+r|0,this.h0+n+o|0)}roundClean(){E.fill(0)}destroy(){this.destroyed=!0,this.buffer.fill(0),this.set(0,0,0,0,0)}}const x=new Map(Object.entries({sha1:u,sha224:n,sha256:r,sha384:a,sha512:o,sha3_256:l,sha3_512:f,ripemd160:/* @__PURE__ */t((()=>new j))}));export{x as nobleHashes};
+/*! OpenPGP.js v6.0.2-patch.0 - 2024-11-27 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self&&self;import{H as t,C as s,M as h,c as i,s as e,a as n,b as r}from"./sha512.min.mjs";import{w as a,e as o,f as l,g as f}from"./sha3.min.mjs";const c=/* @__PURE__ */new Uint32Array([1732584193,4023233417,2562383102,271733878,3285377520]),p=/* @__PURE__ */new Uint32Array(80);class d extends t{constructor(){super(64,20,8,!1),this.A=0|c[0],this.B=0|c[1],this.C=0|c[2],this.D=0|c[3],this.E=0|c[4]}get(){const{A:t,B:s,C:h,D:i,E:e}=this;return[t,s,h,i,e]}set(t,s,h,i,e){this.A=0|t,this.B=0|s,this.C=0|h,this.D=0|i,this.E=0|e}process(t,i){for(let s=0;s<16;s++,i+=4)p[s]=t.getUint32(i,!1);for(let t=16;t<80;t++)p[t]=o(p[t-3]^p[t-8]^p[t-14]^p[t-16],1);let{A:e,B:n,C:r,D:a,E:l}=this;for(let t=0;t<80;t++){let i,f;t<20?(i=s(n,r,a),f=1518500249):t<40?(i=n^r^a,f=1859775393):t<60?(i=h(n,r,a),f=2400959708):(i=n^r^a,f=3395469782);const c=o(e,5)+i+l+f+p[t]|0;l=a,a=r,r=o(n,30),n=e,e=c}e=e+this.A|0,n=n+this.B|0,r=r+this.C|0,a=a+this.D|0,l=l+this.E|0,this.set(e,n,r,a,l)}roundClean(){p.fill(0)}destroy(){this.set(0,0,0,0,0),this.buffer.fill(0)}}const m=/* @__PURE__ */a((()=>new d)),u=/* @__PURE__ */new Uint8Array([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),w=/* @__PURE__ */new Uint8Array(Array(16).fill(0).map(((t,s)=>s)));let y=[w],A=[/* @__PURE__ */w.map((t=>(9*t+5)%16))];for(let t=0;t<4;t++)for(let s of[y,A])s.push(s[t].map((t=>u[t])));const U=/* @__PURE__ */[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map((t=>new Uint8Array(t))),C=/* @__PURE__ */y.map(((t,s)=>t.map((t=>U[s][t])))),g=/* @__PURE__ */A.map(((t,s)=>t.map((t=>U[s][t])))),b=/* @__PURE__ */new Uint32Array([0,1518500249,1859775393,2400959708,2840853838]),B=/* @__PURE__ */new Uint32Array([1352829926,1548603684,1836072691,2053994217,0]);function D(t,s,h,i){return 0===t?s^h^i:1===t?s&h|~s&i:2===t?(s|~h)^i:3===t?s&i|h&~i:s^(h|~i)}const E=/* @__PURE__ */new Uint32Array(16);class j extends t{constructor(){super(64,20,8,!0),this.h0=1732584193,this.h1=-271733879,this.h2=-1732584194,this.h3=271733878,this.h4=-1009589776}get(){const{h0:t,h1:s,h2:h,h3:i,h4:e}=this;return[t,s,h,i,e]}set(t,s,h,i,e){this.h0=0|t,this.h1=0|s,this.h2=0|h,this.h3=0|i,this.h4=0|e}process(t,s){for(let h=0;h<16;h++,s+=4)E[h]=t.getUint32(s,!0);let h=0|this.h0,i=h,e=0|this.h1,n=e,r=0|this.h2,a=r,l=0|this.h3,f=l,c=0|this.h4,p=c;for(let t=0;t<5;t++){const s=4-t,d=b[t],m=B[t],u=y[t],w=A[t],U=C[t],j=g[t];for(let s=0;s<16;s++){const i=o(h+D(t,e,r,l)+E[u[s]]+d,U[s])+c|0;h=c,c=l,l=0|o(r,10),r=e,e=i}for(let t=0;t<16;t++){const h=o(i+D(s,n,a,f)+E[w[t]]+m,j[t])+p|0;i=p,p=f,f=0|o(a,10),a=n,n=h}}this.set(this.h1+r+f|0,this.h2+l+p|0,this.h3+c+i|0,this.h4+h+n|0,this.h0+e+a|0)}roundClean(){E.fill(0)}destroy(){this.destroyed=!0,this.buffer.fill(0),this.set(0,0,0,0,0)}}const x=new Map(Object.entries({sha1:m,sha224:i,sha256:e,sha384:n,sha512:r,sha3_256:l,sha3_512:f,ripemd160:/* @__PURE__ */a((()=>new j))}));export{x as nobleHashes};
 //# sourceMappingURL=noble_hashes.min.mjs.map

package/dist/lightweight/noble_hashes.min.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"noble_hashes.min.mjs","sources":["../../node_modules/@noble/hashes/esm/sha1.js","../../node_modules/@noble/hashes/esm/ripemd160.js","../../src/crypto/hash/noble_hashes.js"],"sourcesContent":["import { HashMD, Chi, Maj } from './_md.js';\nimport { rotl, wrapConstructor } from './utils.js';\n// SHA1 (RFC 3174). It was cryptographically broken: prefer newer algorithms.\n// Initial state\nconst SHA1_IV = /* @__PURE__ */ new Uint32Array([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA1 extends HashMD {\n    constructor() {\n        super(64, 20, 8, false);\n        this.A = SHA1_IV[0] | 0;\n        this.B = SHA1_IV[1] | 0;\n        this.C = SHA1_IV[2] | 0;\n        this.D = SHA1_IV[3] | 0;\n        this.E = SHA1_IV[4] | 0;\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        SHA1_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n/**\n * SHA1 (RFC 3174) hash function.\n * It was cryptographically broken: prefer newer algorithms.\n * @param message - data that would be hashed\n */\nexport const sha1 = /* @__PURE__ */ wrapConstructor(() => new SHA1());\n//# sourceMappingURL=sha1.js.map","import { HashMD } from './_md.js';\nimport { rotl, wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst R_BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends HashMD {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            R_BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + R_BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + R_BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        R_BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","/**\n * This file is needed to dynamic import the noble-hashes.\n * Separate dynamic imports are not convenient as they result in too many chunks,\n * which share a lot of code anyway.\n */\n\nimport { sha1 } from '@noble/hashes/sha1';\nimport { sha224, sha256 } from '@noble/hashes/sha256';\nimport { sha384, sha512 } from '@noble/hashes/sha512';\nimport { sha3_256, sha3_512 } from '@noble/hashes/sha3';\nimport { ripemd160 } from '@noble/hashes/ripemd160';\n\nexport const nobleHashes = new Map(Object.entries({\n  sha1,\n  sha224,\n  sha256,\n  sha384,\n  sha512,\n  sha3_256,\n  sha3_512,\n  ripemd160\n}));\n"],"names":["SHA1_IV","Uint32Array","SHA1_W","SHA1","HashMD","constructor","super","this","A","B","C","D","E","get","set","process","view","offset","i","getUint32","rotl","F","K","Chi","Maj","T","roundClean","fill","destroy","buffer","sha1","wrapConstructor","Rho","Uint8Array","Id","Array","map","_","idxL","idxR","j","push","k","shifts","shiftsL","idx","shiftsR","Kl","Kr","f","group","x","y","z","R_BUF","RIPEMD160","h0","h1","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","tr","destroyed","nobleHashes","Map","Object","entries","sha224","sha256","sha384","sha512","sha3_256","sha3_512","ripemd160"],"mappings":";uMAIA,MAAMA,iBAA0B,IAAIC,YAAY,CAC5C,WAAY,WAAY,WAAY,UAAY,aAI9CC,iBAAyB,IAAID,YAAY,IACxC,MAAME,UAAaC,EACtB,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKC,EAAiB,EAAbR,EAAQ,GACjBO,KAAKE,EAAiB,EAAbT,EAAQ,GACjBO,KAAKG,EAAiB,EAAbV,EAAQ,GACjBO,KAAKI,EAAiB,EAAbX,EAAQ,GACjBO,KAAKK,EAAiB,EAAbZ,EAAQ,EACzB,CACI,GAAAa,GACI,MAAML,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KAC1B,MAAO,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,EAC5B,CACI,GAAAE,CAAIN,EAAGC,EAAGC,EAAGC,EAAGC,GACZL,KAAKC,EAAQ,EAAJA,EACTD,KAAKE,EAAQ,EAAJA,EACTF,KAAKG,EAAQ,EAAJA,EACTH,KAAKI,EAAQ,EAAJA,EACTJ,KAAKK,EAAQ,EAAJA,CACjB,CACI,OAAAG,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCf,EAAOgB,GAAKF,EAAKG,UAAUF,GAAQ,GACvC,IAAK,IAAIC,EAAI,GAAIA,EAAI,GAAIA,IACrBhB,EAAOgB,GAAKE,EAAKlB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,IAAMhB,EAAOgB,EAAI,IAAK,GAEtF,IAAIV,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KACxB,IAAK,IAAIW,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAIG,EAAGC,EACHJ,EAAI,IACJG,EAAIE,EAAId,EAAGC,EAAGC,GACdW,EAAI,YAECJ,EAAI,IACTG,EAAIZ,EAAIC,EAAIC,EACZW,EAAI,YAECJ,EAAI,IACTG,EAAIG,EAAIf,EAAGC,EAAGC,GACdW,EAAI,aAGJD,EAAIZ,EAAIC,EAAIC,EACZW,EAAI,YAER,MAAMG,EAAKL,EAAKZ,EAAG,GAAKa,EAAIT,EAAIU,EAAIpB,EAAOgB,GAAM,EACjDN,EAAID,EACJA,EAAID,EACJA,EAAIU,EAAKX,EAAG,IACZA,EAAID,EACJA,EAAIiB,CAChB,CAEQjB,EAAKA,EAAID,KAAKC,EAAK,EACnBC,EAAKA,EAAIF,KAAKE,EAAK,EACnBC,EAAKA,EAAIH,KAAKG,EAAK,EACnBC,EAAKA,EAAIJ,KAAKI,EAAK,EACnBC,EAAKA,EAAIL,KAAKK,EAAK,EACnBL,KAAKO,IAAIN,EAAGC,EAAGC,EAAGC,EAAGC,EAC7B,CACI,UAAAc,GACIxB,EAAOyB,KAAK,EACpB,CACI,OAAAC,GACIrB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,GACrBP,KAAKsB,OAAOF,KAAK,EACzB,EAOO,MAAMG,iBAAuBC,GAAgB,IAAM,IAAI5B,IC/ExD6B,iBAAsB,IAAIC,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzFC,iBAAqB,IAAID,WAAeE,MAAM,IAAIR,KAAK,GAAGS,KAAI,CAACC,EAAGnB,IAAMA,KAE9E,IAAIoB,EAAO,CAACJ,GACRK,EAAO,gBAFgBL,EAAGE,KAAKlB,IAAO,EAAIA,EAAI,GAAK,MAGvD,IAAK,IAAIA,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIsB,IAAK,CAACF,EAAMC,GACjBC,EAAEC,KAAKD,EAAEtB,GAAGkB,KAAKM,GAAMV,EAAIU,MACnC,MAAMC,iBAAyB,CAC3B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDP,KAAKlB,GAAM,IAAIe,WAAWf,KACtB0B,iBAA0BN,EAAKF,KAAI,CAACS,EAAK3B,IAAM2B,EAAIT,KAAKI,GAAMG,EAAOzB,GAAGsB,OACxEM,iBAA0BP,EAAKH,KAAI,CAACS,EAAK3B,IAAM2B,EAAIT,KAAKI,GAAMG,EAAOzB,GAAGsB,OACxEO,iBAAqB,IAAI9C,YAAY,CACvC,EAAY,WAAY,WAAY,WAAY,aAE9C+C,iBAAqB,IAAI/C,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,IAGpD,SAASgD,EAAEC,EAAOC,EAAGC,EAAGC,GACpB,OAAc,IAAVH,EACOC,EAAIC,EAAIC,EACA,IAAVH,EACGC,EAAIC,GAAOD,EAAIE,EACR,IAAVH,GACGC,GAAKC,GAAKC,EACH,IAAVH,EACGC,EAAIE,EAAMD,GAAKC,EAEhBF,GAAKC,GAAKC,EACzB,CAEA,MAAMC,iBAAwB,IAAIrD,YAAY,IACvC,MAAMsD,UAAkBnD,EAC3B,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKiD,GAAK,WACVjD,KAAKkD,IAAK,UACVlD,KAAKmD,IAAK,WACVnD,KAAKoD,GAAK,UACVpD,KAAKqD,IAAK,UAClB,CACI,GAAA/C,GACI,MAAM2C,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOrD,KAC/B,MAAO,CAACiD,EAAIC,EAAIC,EAAIC,EAAIC,EAChC,CACI,GAAA9C,CAAI0C,EAAIC,EAAIC,EAAIC,EAAIC,GAChBrD,KAAKiD,GAAU,EAALA,EACVjD,KAAKkD,GAAU,EAALA,EACVlD,KAAKmD,GAAU,EAALA,EACVnD,KAAKoD,GAAU,EAALA,EACVpD,KAAKqD,GAAU,EAALA,CAClB,CACI,OAAA7C,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCqC,EAAMpC,GAAKF,EAAKG,UAAUF,GAAQ,GAEtC,IAAI4C,EAAe,EAAVtD,KAAKiD,GAAQM,EAAKD,EAAIE,EAAe,EAAVxD,KAAKkD,GAAQO,EAAKD,EAAIE,EAAe,EAAV1D,KAAKmD,GAAQQ,EAAKD,EAAIE,EAAe,EAAV5D,KAAKoD,GAAQS,EAAKD,EAAIE,EAAe,EAAV9D,KAAKqD,GAAQU,EAAKD,EAGvI,IAAK,IAAInB,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMqB,EAAS,EAAIrB,EACbsB,EAAMzB,EAAGG,GAAQuB,EAAMzB,EAAGE,GAC1BwB,EAAKpC,EAAKY,GAAQyB,EAAKpC,EAAKW,GAC5B0B,EAAKhC,EAAQM,GAAQ2B,EAAK/B,EAAQI,GACxC,IAAK,IAAIhC,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM4D,EAAM1D,EAAKyC,EAAKZ,EAAEC,EAAOa,EAAIE,EAAIE,GAAMb,EAAMoB,EAAGxD,IAAMsD,EAAKI,EAAG1D,IAAMmD,EAAM,EAChFR,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAf/C,EAAK6C,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CACvE,CAEY,IAAK,IAAI5D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM6D,EAAM3D,EAAK0C,EAAKb,EAAEsB,EAAQP,EAAIE,EAAIE,GAAMd,EAAMqB,EAAGzD,IAAMuD,EAAKI,EAAG3D,IAAMoD,EAAM,EACjFR,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfhD,EAAK8C,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CACvE,CACA,CAEQxE,KAAKO,IAAKP,KAAKkD,GAAKQ,EAAKG,EAAM,EAAI7D,KAAKmD,GAAKS,EAAKG,EAAM,EAAI/D,KAAKoD,GAAKU,EAAKP,EAAM,EAAIvD,KAAKqD,GAAKC,EAAKG,EAAM,EAAIzD,KAAKiD,GAAKO,EAAKG,EAAM,EAC3I,CACI,UAAAxC,GACI4B,EAAM3B,KAAK,EACnB,CACI,OAAAC,GACIrB,KAAKyE,WAAY,EACjBzE,KAAKsB,OAAOF,KAAK,GACjBpB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,EAC7B,EAMO,MCxFMmE,EAAc,IAAIC,IAAIC,OAAOC,QAAQ,CAChDtD,OACAuD,SACAC,SACAC,SACAC,SACAC,WACAC,WACAC,yBDgFuC5D,GAAgB,IAAM,IAAIwB","x_google_ignoreList":[0,1]}
+{"version":3,"file":"noble_hashes.min.mjs","sources":["../../node_modules/@noble/hashes/esm/sha1.js","../../node_modules/@noble/hashes/esm/ripemd160.js","../../src/crypto/hash/noble_hashes.js"],"sourcesContent":["import { HashMD, Chi, Maj } from './_md.js';\nimport { rotl, wrapConstructor } from './utils.js';\n// SHA1 (RFC 3174). It was cryptographically broken: prefer newer algorithms.\n// Initial state\nconst SHA1_IV = /* @__PURE__ */ new Uint32Array([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA1 extends HashMD {\n    constructor() {\n        super(64, 20, 8, false);\n        this.A = SHA1_IV[0] | 0;\n        this.B = SHA1_IV[1] | 0;\n        this.C = SHA1_IV[2] | 0;\n        this.D = SHA1_IV[3] | 0;\n        this.E = SHA1_IV[4] | 0;\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        SHA1_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n/**\n * SHA1 (RFC 3174) hash function.\n * It was cryptographically broken: prefer newer algorithms.\n * @param message - data that would be hashed\n */\nexport const sha1 = /* @__PURE__ */ wrapConstructor(() => new SHA1());\n//# sourceMappingURL=sha1.js.map","import { HashMD } from './_md.js';\nimport { rotl, wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst R_BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends HashMD {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            R_BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + R_BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + R_BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        R_BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","/**\n * This file is needed to dynamic import the noble-hashes.\n * Separate dynamic imports are not convenient as they result in too many chunks,\n * which share a lot of code anyway.\n */\n\nimport { sha1 } from '@noble/hashes/sha1';\nimport { sha224, sha256 } from '@noble/hashes/sha256';\nimport { sha384, sha512 } from '@noble/hashes/sha512';\nimport { sha3_256, sha3_512 } from '@noble/hashes/sha3';\nimport { ripemd160 } from '@noble/hashes/ripemd160';\n\nexport const nobleHashes = new Map(Object.entries({\n  sha1,\n  sha224,\n  sha256,\n  sha384,\n  sha512,\n  sha3_256,\n  sha3_512,\n  ripemd160\n}));\n"],"names":["SHA1_IV","Uint32Array","SHA1_W","SHA1","HashMD","constructor","super","this","A","B","C","D","E","get","set","process","view","offset","i","getUint32","rotl","F","K","Chi","Maj","T","roundClean","fill","destroy","buffer","sha1","wrapConstructor","Rho","Uint8Array","Id","Array","map","_","idxL","idxR","j","push","k","shifts","shiftsL","idx","shiftsR","Kl","Kr","f","group","x","y","z","R_BUF","RIPEMD160","h0","h1","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","tr","destroyed","nobleHashes","Map","Object","entries","sha224","sha256","sha384","sha512","sha3_256","sha3_512","ripemd160"],"mappings":";0OAIA,MAAMA,iBAA0B,IAAIC,YAAY,CAC5C,WAAY,WAAY,WAAY,UAAY,aAI9CC,iBAAyB,IAAID,YAAY,IACxC,MAAME,UAAaC,EACtB,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKC,EAAiB,EAAbR,EAAQ,GACjBO,KAAKE,EAAiB,EAAbT,EAAQ,GACjBO,KAAKG,EAAiB,EAAbV,EAAQ,GACjBO,KAAKI,EAAiB,EAAbX,EAAQ,GACjBO,KAAKK,EAAiB,EAAbZ,EAAQ,EACzB,CACI,GAAAa,GACI,MAAML,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KAC1B,MAAO,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,EAC5B,CACI,GAAAE,CAAIN,EAAGC,EAAGC,EAAGC,EAAGC,GACZL,KAAKC,EAAQ,EAAJA,EACTD,KAAKE,EAAQ,EAAJA,EACTF,KAAKG,EAAQ,EAAJA,EACTH,KAAKI,EAAQ,EAAJA,EACTJ,KAAKK,EAAQ,EAAJA,CACjB,CACI,OAAAG,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCf,EAAOgB,GAAKF,EAAKG,UAAUF,GAAQ,GACvC,IAAK,IAAIC,EAAI,GAAIA,EAAI,GAAIA,IACrBhB,EAAOgB,GAAKE,EAAKlB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,IAAMhB,EAAOgB,EAAI,IAAK,GAEtF,IAAIV,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KACxB,IAAK,IAAIW,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAIG,EAAGC,EACHJ,EAAI,IACJG,EAAIE,EAAId,EAAGC,EAAGC,GACdW,EAAI,YAECJ,EAAI,IACTG,EAAIZ,EAAIC,EAAIC,EACZW,EAAI,YAECJ,EAAI,IACTG,EAAIG,EAAIf,EAAGC,EAAGC,GACdW,EAAI,aAGJD,EAAIZ,EAAIC,EAAIC,EACZW,EAAI,YAER,MAAMG,EAAKL,EAAKZ,EAAG,GAAKa,EAAIT,EAAIU,EAAIpB,EAAOgB,GAAM,EACjDN,EAAID,EACJA,EAAID,EACJA,EAAIU,EAAKX,EAAG,IACZA,EAAID,EACJA,EAAIiB,CAChB,CAEQjB,EAAKA,EAAID,KAAKC,EAAK,EACnBC,EAAKA,EAAIF,KAAKE,EAAK,EACnBC,EAAKA,EAAIH,KAAKG,EAAK,EACnBC,EAAKA,EAAIJ,KAAKI,EAAK,EACnBC,EAAKA,EAAIL,KAAKK,EAAK,EACnBL,KAAKO,IAAIN,EAAGC,EAAGC,EAAGC,EAAGC,EAC7B,CACI,UAAAc,GACIxB,EAAOyB,KAAK,EACpB,CACI,OAAAC,GACIrB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,GACrBP,KAAKsB,OAAOF,KAAK,EACzB,EAOO,MAAMG,iBAAuBC,GAAgB,IAAM,IAAI5B,IC/ExD6B,iBAAsB,IAAIC,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzFC,iBAAqB,IAAID,WAAeE,MAAM,IAAIR,KAAK,GAAGS,KAAI,CAACC,EAAGnB,IAAMA,KAE9E,IAAIoB,EAAO,CAACJ,GACRK,EAAO,gBAFgBL,EAAGE,KAAKlB,IAAO,EAAIA,EAAI,GAAK,MAGvD,IAAK,IAAIA,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIsB,IAAK,CAACF,EAAMC,GACjBC,EAAEC,KAAKD,EAAEtB,GAAGkB,KAAKM,GAAMV,EAAIU,MACnC,MAAMC,iBAAyB,CAC3B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDP,KAAKlB,GAAM,IAAIe,WAAWf,KACtB0B,iBAA0BN,EAAKF,KAAI,CAACS,EAAK3B,IAAM2B,EAAIT,KAAKI,GAAMG,EAAOzB,GAAGsB,OACxEM,iBAA0BP,EAAKH,KAAI,CAACS,EAAK3B,IAAM2B,EAAIT,KAAKI,GAAMG,EAAOzB,GAAGsB,OACxEO,iBAAqB,IAAI9C,YAAY,CACvC,EAAY,WAAY,WAAY,WAAY,aAE9C+C,iBAAqB,IAAI/C,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,IAGpD,SAASgD,EAAEC,EAAOC,EAAGC,EAAGC,GACpB,OAAc,IAAVH,EACOC,EAAIC,EAAIC,EACA,IAAVH,EACGC,EAAIC,GAAOD,EAAIE,EACR,IAAVH,GACGC,GAAKC,GAAKC,EACH,IAAVH,EACGC,EAAIE,EAAMD,GAAKC,EAEhBF,GAAKC,GAAKC,EACzB,CAEA,MAAMC,iBAAwB,IAAIrD,YAAY,IACvC,MAAMsD,UAAkBnD,EAC3B,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKiD,GAAK,WACVjD,KAAKkD,IAAK,UACVlD,KAAKmD,IAAK,WACVnD,KAAKoD,GAAK,UACVpD,KAAKqD,IAAK,UAClB,CACI,GAAA/C,GACI,MAAM2C,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOrD,KAC/B,MAAO,CAACiD,EAAIC,EAAIC,EAAIC,EAAIC,EAChC,CACI,GAAA9C,CAAI0C,EAAIC,EAAIC,EAAIC,EAAIC,GAChBrD,KAAKiD,GAAU,EAALA,EACVjD,KAAKkD,GAAU,EAALA,EACVlD,KAAKmD,GAAU,EAALA,EACVnD,KAAKoD,GAAU,EAALA,EACVpD,KAAKqD,GAAU,EAALA,CAClB,CACI,OAAA7C,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCqC,EAAMpC,GAAKF,EAAKG,UAAUF,GAAQ,GAEtC,IAAI4C,EAAe,EAAVtD,KAAKiD,GAAQM,EAAKD,EAAIE,EAAe,EAAVxD,KAAKkD,GAAQO,EAAKD,EAAIE,EAAe,EAAV1D,KAAKmD,GAAQQ,EAAKD,EAAIE,EAAe,EAAV5D,KAAKoD,GAAQS,EAAKD,EAAIE,EAAe,EAAV9D,KAAKqD,GAAQU,EAAKD,EAGvI,IAAK,IAAInB,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMqB,EAAS,EAAIrB,EACbsB,EAAMzB,EAAGG,GAAQuB,EAAMzB,EAAGE,GAC1BwB,EAAKpC,EAAKY,GAAQyB,EAAKpC,EAAKW,GAC5B0B,EAAKhC,EAAQM,GAAQ2B,EAAK/B,EAAQI,GACxC,IAAK,IAAIhC,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM4D,EAAM1D,EAAKyC,EAAKZ,EAAEC,EAAOa,EAAIE,EAAIE,GAAMb,EAAMoB,EAAGxD,IAAMsD,EAAKI,EAAG1D,IAAMmD,EAAM,EAChFR,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAf/C,EAAK6C,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CACvE,CAEY,IAAK,IAAI5D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM6D,EAAM3D,EAAK0C,EAAKb,EAAEsB,EAAQP,EAAIE,EAAIE,GAAMd,EAAMqB,EAAGzD,IAAMuD,EAAKI,EAAG3D,IAAMoD,EAAM,EACjFR,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfhD,EAAK8C,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CACvE,CACA,CAEQxE,KAAKO,IAAKP,KAAKkD,GAAKQ,EAAKG,EAAM,EAAI7D,KAAKmD,GAAKS,EAAKG,EAAM,EAAI/D,KAAKoD,GAAKU,EAAKP,EAAM,EAAIvD,KAAKqD,GAAKC,EAAKG,EAAM,EAAIzD,KAAKiD,GAAKO,EAAKG,EAAM,EAC3I,CACI,UAAAxC,GACI4B,EAAM3B,KAAK,EACnB,CACI,OAAAC,GACIrB,KAAKyE,WAAY,EACjBzE,KAAKsB,OAAOF,KAAK,GACjBpB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,EAC7B,EAMO,MCxFMmE,EAAc,IAAIC,IAAIC,OAAOC,QAAQ,CAChDtD,OACAuD,SACAC,SACAC,SACAC,SACAC,WACAC,WACAC,yBDgFuC5D,GAAgB,IAAM,IAAIwB","x_google_ignoreList":[0,1]}

package/dist/lightweight/noble_hashes.mjs

@@ -1,7 +1,8 @@
-/*! OpenPGP.js v6.0.0 - 2024-11-06 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+/*! OpenPGP.js v6.0.2-patch.0 - 2024-11-27 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
 const globalThis = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
-import { w as wrapConstructor, g as HashMD, i as rotl, C as Chi, M as Maj, j as sha224, s as sha256, a as sha384, d as sha512, k as sha3_256, l as sha3_512 } from './sha3.mjs';
+import { H as HashMD, C as Chi, M as Maj, c as sha224, s as sha256, a as sha384, b as sha512 } from './sha512.mjs';
+import { w as wrapConstructor, e as rotl, f as sha3_256, g as sha3_512 } from './sha3.mjs';
 
 // SHA1 (RFC 3174). It was cryptographically broken: prefer newer algorithms.
 // Initial state

package/dist/lightweight/noble_post_quantum.min.mjs

@@ -0,0 +1,5 @@
+/*! OpenPGP.js v6.0.2-patch.0 - 2024-11-27 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self&&self;import{c as e,r as t,l as n,s as r,f as o,g as c,m as s,d}from"./sha3.min.mjs";
+/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */const l=e,u=t;function f(e,t){if(e.length!==t.length)return!1;let n=0;for(let r=0;r<e.length;r++)n|=e[r]^t[r];return 0===n}function i(...e){const t=e=>"number"==typeof e?e:e.bytesLen,n=e.reduce(((e,n)=>e+t(n)),0);return{bytesLen:n,encode:r=>{const o=new Uint8Array(n);for(let n=0,c=0;n<e.length;n++){const s=e[n],d=t(s),u="number"==typeof s?r[n]:s.encode(r[n]);l(u,d),o.set(u,c),"number"!=typeof s&&u.fill(0),c+=d}return o},decode:r=>{l(r,n);const o=[];for(const n of e){const e=t(n),c=r.subarray(0,e);o.push("number"==typeof n?c:n.decode(c)),r=r.subarray(e)}return o}}}function a(e,t){const n=t*e.bytesLen;return{bytesLen:n,encode:r=>{if(r.length!==t)throw Error(`vecCoder.encode: wrong length=${r.length}. Expected: ${t}`);const o=new Uint8Array(n);for(let t=0,n=0;t<r.length;t++){const c=e.encode(r[t]);o.set(c,n),c.fill(0),n+=c.length}return o},decode:t=>{l(t,n);const r=[];for(let n=0;n<t.length;n+=e.bytesLen)r.push(e.decode(t.subarray(n,n+e.bytesLen)));return r}}}function y(...e){for(const t of e)if(Array.isArray(t))for(const e of t)e.fill(0);else t.fill(0)}function p(e){return(1<<e)-1}
+/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function h(e,t=8){const n=e.toString(2).padStart(8,"0").slice(-t).padStart(7,"0").split("").reverse().join("");return Number.parseInt(n,2)}const g=e=>{const{newPoly:t,N:n,Q:r,F:o,ROOT_OF_UNITY:c,brvBits:s,isKyber:d}=e,l=(e,t=r)=>{const n=e%t|0;return 0|(n>=0?n:t+n)};const u=function(){const e=t(n);for(let t=0;t<n;t++){const n=h(t,s),o=BigInt(c)**BigInt(n)%BigInt(r);e[t]=0|Number(o)}return e}(),f=d?128:n,i=d?1:0,a={encode:e=>{for(let t=1,r=128;r>i;r>>=1)for(let o=0;o<n;o+=2*r){const n=u[t++];for(let t=o;t<o+r;t++){const o=l(n*e[t+r]);e[t+r]=0|l(e[t]-o),e[t]=0|l(e[t]+o)}}return e},decode:e=>{for(let t=f-1,r=1+i;r<f+i;r<<=1)for(let o=0;o<n;o+=2*r){const n=u[t--];for(let t=o;t<o+r;t++){const o=e[t];e[t]=l(o+e[t+r]),e[t+r]=l(n*(e[t+r]-o))}}for(let t=0;t<e.length;t++)e[t]=l(o*e[t]);return e}};return{mod:l,smod:(e,t=r)=>{const n=0|l(e,t);return 0|(n>t>>1?n-t:n)},nttZetas:u,NTT:a,bitsCoder:(e,r)=>{const o=p(e),c=e*(n/8);return{bytesLen:c,encode:t=>{const n=new Uint8Array(c);for(let c=0,s=0,d=0,l=0;c<t.length;c++)for(s|=(r.encode(t[c])&o)<<d,d+=e;d>=8;d-=8,s>>=8)n[l++]=s&p(d);return n},decode:c=>{const s=t(n);for(let t=0,n=0,d=0,l=0;t<c.length;t++)for(n|=c[t]<<d,d+=8;d>=e;d-=e,n>>=e)s[l++]=r.decode(n&o);return s}}}}},b=e=>(t,n)=>{n||(n=e.blockLen);const r=new Uint8Array(t.length+2);r.set(t);const o=t.length,c=new Uint8Array(n);let s=e.create({}),d=0,l=0;return{stats:()=>({calls:d,xofs:l}),get:(t,n)=>(r[o+0]=t,r[o+1]=n,s.destroy(),s=e.create({}).update(r),d++,()=>(l++,s.xofInto(c))),clean:()=>{s.destroy(),c.fill(0),r.fill(0)}}},A=/* @__PURE__ */b(n),L=/* @__PURE__ */b(r),w=256,T=3329,{mod:E,nttZetas:m,NTT:K,bitsCoder:U}=g({N:w,Q:T,F:3303,ROOT_OF_UNITY:17,newPoly:e=>new Uint16Array(e),brvBits:7,isKyber:!0}),k=e=>U(e,(e=>{if(e>=12)return{encode:e=>e,decode:e=>e};const t=2**(e-1);return{encode:t=>((t<<e)+T/2)/T,decode:n=>n*T+t>>>e}})(e));function M(e,t){for(let n=0;n<w;n++)e[n]=E(e[n]+t[n])}function B(e,t){for(let s=0;s<128;s++){let d=m[64+(s>>1)];1&s&&(d=-d);const{c0:l,c1:u}=(n=e[2*s+0],r=e[2*s+1],o=t[2*s+0],c=t[2*s+1],{c0:E(r*c*d+n*o),c1:E(n*c+r*o)});e[2*s+0]=l,e[2*s+1]=u}var n,r,o,c;return e}function O(e){const t=new Uint16Array(w);for(let n=0;n<w;){const r=e();if(r.length%3)throw Error("SampleNTT: unaligned block");for(let e=0;n<w&&e+3<=r.length;e+=3){const o=4095&(r[e+0]|r[e+1]<<8),c=4095&(r[e+1]>>4|r[e+2]<<4);o<T&&(t[n++]=o),n<w&&c<T&&(t[n++]=c)}}return t}function F(e,t,n,r){const o=e(r*w/4,t,n),c=new Uint16Array(w),d=s(o);let l=0;for(let e=0,t=0,n=0,o=0;e<d.length;e++){let s=d[e];for(let e=0;e<32;e++)n+=1&s,s>>=1,l+=1,l===r?(o=n,n=0):l===2*r&&(c[t++]=E(o-n),n=0,l=0)}if(l)throw Error("sampleCBD: leftover bits: "+l);return c}const S=e=>{const{K:t,PRF:n,XOF:r,HASH512:o,ETA1:c,ETA2:s,du:d,dv:l}=e,u=k(1),f=k(l),p=k(d),h=i(a(k(12),t),32),g=a(k(12),t),b=i(a(p,t),f),A=i(32,32);return{secretCoder:g,secretKeyLen:g.bytesLen,publicKeyLen:h.bytesLen,cipherTextLen:b.bytesLen,keygen:e=>{const s=new Uint8Array(33);s.set(e),s[32]=t;const d=o(s),[l,u]=A.decode(d),f=[],i=[];for(let e=0;e<t;e++)f.push(K.encode(F(n,u,e,c)));const a=r(l);for(let e=0;e<t;e++){const r=K.encode(F(n,u,t+e,c));for(let n=0;n<t;n++){M(r,B(O(a.get(n,e)),f[n]))}i.push(r)}a.clean();const p={publicKey:h.encode([i,l]),secretKey:g.encode(f)};return y(l,u,f,i,s,d),p},encrypt:(e,o,d)=>{const[l,f]=h.decode(e),i=[];for(let e=0;e<t;e++)i.push(K.encode(F(n,d,e,c)));const a=r(f),p=new Uint16Array(w),g=[];for(let e=0;e<t;e++){const r=F(n,d,t+e,s),o=new Uint16Array(w);for(let n=0;n<t;n++){M(o,B(O(a.get(e,n)),i[n]))}M(r,K.decode(o)),g.push(r),M(p,B(l[e],i[e])),o.fill(0)}a.clean();const A=F(n,d,2*t,s);M(A,K.decode(p));const L=u.decode(o);return M(L,A),y(l,i,p,A),b.encode([g,L])},decrypt:(e,n)=>{const[r,o]=b.decode(e),c=g.decode(n),s=new Uint16Array(w);for(let e=0;e<t;e++)M(s,B(c[e],K.encode(r[e])));return function(e,t){for(let n=0;n<w;n++)e[n]=E(e[n]-t[n])}(o,K.decode(s)),y(s,c,r),u.encode(o)}}};function v(e){const t=S(e),{HASH256:n,HASH512:r,KDF:o}=e,{secretCoder:c,cipherTextLen:s}=t,d=t.publicKeyLen,a=i(t.secretKeyLen,t.publicKeyLen,32,32),p=a.bytesLen;return{publicKeyLen:d,msgLen:32,keygen:(e=u(64))=>{l(e,64);const{publicKey:r,secretKey:o}=t.keygen(e.subarray(0,32)),c=n(r),s=a.encode([o,r,c,e.subarray(32)]);return y(o,c),{publicKey:r,secretKey:s}},encapsulate:(o,s=u(32))=>{l(o,d),l(s,32);const i=o.subarray(0,384*e.K),a=c.encode(c.decode(i.slice()));if(!f(a,i))throw y(a),Error("ML-KEM.encapsulate: wrong publicKey modulus");y(a);const p=r.create().update(s).update(n(o)).digest(),h=t.encrypt(o,s,p.subarray(32,64));return p.subarray(32).fill(0),{cipherText:h,sharedSecret:p.subarray(0,32)}},decapsulate:(e,n)=>{l(n,p),l(e,s);const[c,d,u,i]=a.decode(n),h=t.decrypt(e,c),g=r.create().update(h).update(u).digest(),b=g.subarray(0,32),A=t.encrypt(d,h,g.subarray(32,64)),L=f(e,A),w=o.create({dkLen:32}).update(i).update(e).digest();return y(h,A,L?w:b),L?b:w}}}const N=/* @__PURE__ */v({...{HASH256:o,HASH512:c,KDF:r,XOF:A,PRF:function(e,t,n){return r.create({dkLen:e}).update(t).update(new Uint8Array([n])).digest()}},...{N:w,Q:T,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192}}),R=256,_=8380417,I=13,H=0|Math.floor((_-1)/88),C=0|Math.floor((_-1)/32),x={K:6,L:5,D:I,GAMMA1:2**19,GAMMA2:C,TAU:49,ETA:4,OMEGA:55},G=e=>new Int32Array(e),{mod:Y,smod:D,NTT:P,bitsCoder:X}=g({N:R,Q:_,F:8347681,ROOT_OF_UNITY:1753,newPoly:G,isKyber:!1,brvBits:8}),$=e=>e,Q=(e,t=$,n=$)=>X(e,{encode:e=>t(n(e)),decode:e=>n(t(e))}),j=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=Y(e[n]+t[n]);return e},W=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=Y(e[n]-t[n]);return e},Z=e=>{for(let t=0;t<R;t++)e[t]<<=I;return e},q=(e,t)=>{for(let n=0;n<R;n++)if(Math.abs(D(e[n]))>=t)return!0;return!1},z=(e,t)=>{const n=G(R);for(let r=0;r<e.length;r++)n[r]=Y(e[r]*t[r]);return n};function J(e){const t=G(R);for(let n=0;n<R;){const r=e();if(r.length%3)throw Error("RejNTTPoly: unaligned block");for(let e=0;n<R&&e<=r.length-3;e+=3){const o=8388607&(r[e+0]|r[e+1]<<8|r[e+2]<<16);o<_&&(t[n++]=o)}}return t}const V=new Uint8Array(0);function ee(e){const{K:t,L:n,GAMMA1:o,GAMMA2:c,TAU:s,ETA:p,OMEGA:h}=e,{CRH_BYTES:g,TR_BYTES:b,C_TILDE_BYTES:A,XOF128:L,XOF256:w}=e;if(![2,4].includes(p))throw Error("Wrong ETA");if(![1<<17,1<<19].includes(o))throw Error("Wrong GAMMA1");if(![H,C].includes(c))throw Error("Wrong GAMMA2");const T=s*p,E=e=>{const t=Y(e),n=0|D(t,2*c);if(t-n==_-1)return{r1:0,r0:n-1|0};return{r1:0|Math.floor((t-n)/(2*c)),r0:n}},m=e=>E(e).r1,K=e=>E(e).r0,U=(e,t)=>{const n=Math.floor((_-1)/(2*c)),{r1:r,r0:o}=E(t);return 1===e?o>0?0|Y(r+1,n):0|Y(r-1,n):0|r},k=e=>{const t=Y(e),n=0|D(t,8192);return{r1:0|Math.floor((t-n)/8192),r0:n}},M={bytesLen:h+t,encode:e=>{if(!1===e)throw Error("hint.encode: hint is false");const n=new Uint8Array(h+t);for(let r=0,o=0;r<t;r++){for(let t=0;t<R;t++)0!==e[r][t]&&(n[o++]=t);n[h+r]=o}return n},decode:e=>{const n=[];let r=0;for(let o=0;o<t;o++){const t=G(R);if(e[h+o]<r||e[h+o]>h)return!1;for(let n=r;n<e[h+o];n++){if(n>r&&e[n]<=e[n-1])return!1;t[e[n]]=1}r=e[h+o],n.push(t)}for(let t=r;t<h;t++)if(0!==e[t])return!1;return n}},B=Q(2===p?3:4,(e=>p-e),(e=>{if(!(-p<=e&&e<=p))throw Error(`malformed key s1/s3 ${e} outside of ETA range [${-p}, ${p}]`);return e})),O=Q(13,(e=>4096-e)),F=Q(10),S=Q(o===1<<17?18:20,(e=>D(o-e))),v=a(Q(c===H?6:4),t),N=i(32,a(F,t)),I=i(32,32,b,a(B,n),a(B,t),a(O,t)),x=i(A,a(S,n),M),X=2===p?e=>e<15&&2-e%5:e=>e<9&&4-e;function $(e){const t=G(R);for(let n=0;n<R;){const r=e();for(let e=0;n<R&&e<r.length;e+=1){const o=X(15&r[e]),c=X(r[e]>>4&15);!1!==o&&(t[n++]=o),n<R&&!1!==c&&(t[n++]=c)}}return t}const ee=e=>{const t=G(R),n=r.create({}).update(e),o=new Uint8Array(r.blockLen);n.xofInto(o);const c=o.slice(0,8);for(let e=R-s,d=8,l=0,u=0;e<R;e++){let s=e+1;for(;s>e;)s=o[d++],d<r.blockLen||(n.xofInto(o),d=0);t[e]=t[s],t[s]=1-((c[l]>>u++&1)<<1),u>=8&&(l++,u=0)}return t},te=e=>{const t=G(R),n=G(R);for(let r=0;r<e.length;r++){const{r0:o,r1:c}=k(e[r]);t[r]=o,n[r]=c}return{r0:t,r1:n}},ne=(e,t)=>{for(let n=0;n<R;n++)e[n]=U(t[n],e[n]);return e},re=(e,t)=>{const n=G(R);let r=0;for(let d=0;d<R;d++){const l=(o=e[d],s=t[d],o<=c||o>_-c||o===_-c&&0===s?0:1);n[d]=l,r+=l}var o,s;return{v:n,cnt:r}},oe=i(32,64,32),ce={signRandBytes:32,keygen:(e=u(32))=>{const o=new Uint8Array(34);o.set(e),o[32]=t,o[33]=n;const[c,s,d]=oe.decode(r(o,{dkLen:oe.bytesLen})),l=w(s),f=[];for(let e=0;e<n;e++)f.push($(l.get(255&e,e>>8&255)));const i=[];for(let e=n;e<n+t;e++)i.push($(l.get(255&e,e>>8&255)));const a=f.map((e=>P.encode(e.slice()))),p=[],h=[],g=L(c),A=G(R);for(let e=0;e<t;e++){A.fill(0);for(let t=0;t<n;t++){const n=J(g.get(t,e));j(A,z(n,a[t]))}P.decode(A);const{r0:t,r1:r}=te(j(A,i[e]));p.push(t),h.push(r)}const T=N.encode([c,h]),E=r(T,{dkLen:b}),m=I.encode([c,d,E,f,i,p]);return g.clean(),l.clean(),y(c,s,d,f,i,a,A,p,h,E,o),{publicKey:T,secretKey:m}},sign:(e,s,d)=>{const[u,f,i,a,p,b]=I.decode(e),E=[],U=L(u);for(let e=0;e<t;e++){const t=[];for(let r=0;r<n;r++)t.push(J(U.get(r,e)));E.push(t)}U.clean();for(let e=0;e<n;e++)P.encode(a[e]);for(let e=0;e<t;e++)P.encode(p[e]),P.encode(b[e]);const k=r.create({dkLen:g}).update(i).update(s).digest(),M=d||new Uint8Array(32);l(M);const B=r.create({dkLen:g}).update(f).update(M).update(k).digest();l(B,g);const O=w(B,S.bytesLen);e:for(let e=0;;){const s=[];for(let t=0;t<n;t++,e++)s.push(S.decode(O.get(255&e,e>>8)()));const d=s.map((e=>P.encode(e.slice()))),l=[];for(let e=0;e<t;e++){const t=G(R);for(let r=0;r<n;r++)j(t,z(E[e][r],d[r]));P.decode(t),l.push(t)}const u=l.map((e=>e.map(m))),f=r.create({dkLen:A}).update(k).update(v.encode(u)).digest(),i=P.encode(ee(f)),g=a.map((e=>z(e,i)));for(let e=0;e<n;e++)if(j(P.decode(g[e]),s[e]),q(g[e],o-T))continue e;let L=0;const w=[];for(let e=0;e<t;e++){const t=P.decode(z(p[e],i)),n=W(l[e],t).map(K);if(q(n,c-T))continue e;const r=P.decode(z(b[e],i));if(q(r,c))continue e;j(n,r);const o=re(n,u[e]);w.push(o.v),L+=o.cnt}if(L>h)continue;O.clean();const U=x.encode([f,g,w]);return y(f,g,w,i,u,l,d,s,B,k,a,p,b,...E),U}throw Error("Unreachable code path reached, report this error")},verify:(e,c,s)=>{const[d,l]=N.decode(e),u=r(e,{dkLen:b});if(s.length!==x.bytesLen)return!1;const[i,a,y]=x.decode(s);if(!1===y)return!1;for(let e=0;e<n;e++)if(q(a[e],o-T))return!1;const p=r.create({dkLen:g}).update(u).update(c).digest(),w=P.encode(ee(i)),E=a.map((e=>e.slice()));for(let e=0;e<n;e++)P.encode(E[e]);const m=[],K=L(d);for(let e=0;e<t;e++){const t=z(P.encode(Z(l[e])),w),r=G(R);for(let t=0;t<n;t++){const n=J(K.get(t,e));j(r,z(n,E[t]))}const o=P.decode(W(r,t));m.push(ne(o,y[e]))}K.clean();const U=r.create({dkLen:A}).update(p).update(v.encode(m)).digest();for(const e of y){if(!(e.reduce(((e,t)=>e+t),0)<=h))return!1}for(const e of a)if(q(e,o-T))return!1;return f(i,U)}},se=(e,t=V)=>{if(l(e),l(t),t.length>255)throw Error("context should be less than 255 bytes");return d(new Uint8Array([0,t.length]),t,e)};return{internal:ce,keygen:ce.keygen,signRandBytes:ce.signRandBytes,sign:(e,t,n=V,r)=>{const o=se(t,n),c=ce.sign(e,o,r);return o.fill(0),c},verify:(e,t,n,r=V)=>ce.verify(e,se(t,r),n)}}const te=/* @__PURE__ */ee({...x,CRH_BYTES:64,TR_BYTES:64,C_TILDE_BYTES:48,XOF128:A,XOF256:L});export{te as ml_dsa65,N as ml_kem768};
+//# sourceMappingURL=noble_post_quantum.min.mjs.map

package/dist/lightweight/noble_post_quantum.min.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"noble_post_quantum.min.mjs","sources":["../../node_modules/@noble/post-quantum/esm/utils.js","../../node_modules/@noble/post-quantum/esm/_crystals.js","../../node_modules/@noble/post-quantum/esm/ml-kem.js","../../node_modules/@noble/post-quantum/esm/ml-dsa.js"],"sourcesContent":["/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { bytes as abytes } from '@noble/hashes/_assert';\nimport { randomBytes as randb, concatBytes } from '@noble/hashes/utils';\nexport const ensureBytes = abytes;\nexport const randomBytes = randb;\nexport { concatBytes };\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\nexport function splitCoder(...lengths) {\n    const getLength = (c) => (typeof c === 'number' ? c : c.bytesLen);\n    const bytesLen = lengths.reduce((sum, a) => sum + getLength(a), 0);\n    return {\n        bytesLen,\n        encode: (bufs) => {\n            const res = new Uint8Array(bytesLen);\n            for (let i = 0, pos = 0; i < lengths.length; i++) {\n                const c = lengths[i];\n                const l = getLength(c);\n                const b = typeof c === 'number' ? bufs[i] : c.encode(bufs[i]);\n                ensureBytes(b, l);\n                res.set(b, pos);\n                if (typeof c !== 'number')\n                    b.fill(0); // clean\n                pos += l;\n            }\n            return res;\n        },\n        decode: (buf) => {\n            ensureBytes(buf, bytesLen);\n            const res = [];\n            for (const c of lengths) {\n                const l = getLength(c);\n                const b = buf.subarray(0, l);\n                res.push(typeof c === 'number' ? b : c.decode(b));\n                buf = buf.subarray(l);\n            }\n            return res;\n        },\n    };\n}\n// nano-packed.array (fixed size)\nexport function vecCoder(c, vecLen) {\n    const bytesLen = vecLen * c.bytesLen;\n    return {\n        bytesLen,\n        encode: (u) => {\n            if (u.length !== vecLen)\n                throw new Error(`vecCoder.encode: wrong length=${u.length}. Expected: ${vecLen}`);\n            const res = new Uint8Array(bytesLen);\n            for (let i = 0, pos = 0; i < u.length; i++) {\n                const b = c.encode(u[i]);\n                res.set(b, pos);\n                b.fill(0); // clean\n                pos += b.length;\n            }\n            return res;\n        },\n        decode: (a) => {\n            ensureBytes(a, bytesLen);\n            const r = [];\n            for (let i = 0; i < a.length; i += c.bytesLen)\n                r.push(c.decode(a.subarray(i, i + c.bytesLen)));\n            return r;\n        },\n    };\n}\n// cleanBytes(new Uint8Array(), [new Uint16Array(), new Uint32Array()])\nexport function cleanBytes(...list) {\n    for (const t of list) {\n        if (Array.isArray(t))\n            for (const b of t)\n                b.fill(0);\n        else\n            t.fill(0);\n    }\n}\nexport function getMask(bits) {\n    return (1 << bits) - 1; // 4 -> 0b1111\n}\n//# sourceMappingURL=utils.js.map","/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { shake128, shake256 } from '@noble/hashes/sha3';\nimport { getMask } from './utils.js';\n// TODO: benchmark\nfunction bitReversal(n, bits = 8) {\n    const padded = n.toString(2).padStart(8, '0');\n    const sliced = padded.slice(-bits).padStart(7, '0');\n    const revrsd = sliced.split('').reverse().join('');\n    return Number.parseInt(revrsd, 2);\n}\nexport const genCrystals = (opts) => {\n    // isKyber: true means Kyber, false means Dilithium\n    const { newPoly, N, Q, F, ROOT_OF_UNITY, brvBits, isKyber } = opts;\n    const mod = (a, modulo = Q) => {\n        const result = a % modulo | 0;\n        return (result >= 0 ? result | 0 : (modulo + result) | 0) | 0;\n    };\n    // -(Q-1)/2 < a <= (Q-1)/2\n    const smod = (a, modulo = Q) => {\n        const r = mod(a, modulo) | 0;\n        return (r > modulo >> 1 ? (r - modulo) | 0 : r) | 0;\n    };\n    // Generate zettas\n    function getZettas() {\n        const out = newPoly(N);\n        for (let i = 0; i < N; i++) {\n            const b = bitReversal(i, brvBits);\n            const p = BigInt(ROOT_OF_UNITY) ** BigInt(b) % BigInt(Q);\n            out[i] = Number(p) | 0;\n        }\n        return out;\n    }\n    const nttZetas = getZettas();\n    // Number-Theoretic Transform\n    // Explained: https://electricdusk.com/ntt.html\n    // Kyber has slightly different params, since there is no 512th primitive root of unity mod q,\n    // only 256th primitive root of unity mod. Which also complicates MultiplyNTT.\n    // TODO: there should be less ugly way to define this.\n    const LEN1 = isKyber ? 128 : N;\n    const LEN2 = isKyber ? 1 : 0;\n    const NTT = {\n        encode: (r) => {\n            for (let k = 1, len = 128; len > LEN2; len >>= 1) {\n                for (let start = 0; start < N; start += 2 * len) {\n                    const zeta = nttZetas[k++];\n                    for (let j = start; j < start + len; j++) {\n                        const t = mod(zeta * r[j + len]);\n                        r[j + len] = mod(r[j] - t) | 0;\n                        r[j] = mod(r[j] + t) | 0;\n                    }\n                }\n            }\n            return r;\n        },\n        decode: (r) => {\n            for (let k = LEN1 - 1, len = 1 + LEN2; len < LEN1 + LEN2; len <<= 1) {\n                for (let start = 0; start < N; start += 2 * len) {\n                    const zeta = nttZetas[k--];\n                    for (let j = start; j < start + len; j++) {\n                        const t = r[j];\n                        r[j] = mod(t + r[j + len]);\n                        r[j + len] = mod(zeta * (r[j + len] - t));\n                    }\n                }\n            }\n            for (let i = 0; i < r.length; i++)\n                r[i] = mod(F * r[i]);\n            return r;\n        },\n    };\n    // Encode polynominal as bits\n    const bitsCoder = (d, c) => {\n        const mask = getMask(d);\n        const bytesLen = d * (N / 8);\n        return {\n            bytesLen,\n            encode: (poly) => {\n                const r = new Uint8Array(bytesLen);\n                for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < poly.length; i++) {\n                    buf |= (c.encode(poly[i]) & mask) << bufLen;\n                    bufLen += d;\n                    for (; bufLen >= 8; bufLen -= 8, buf >>= 8)\n                        r[pos++] = buf & getMask(bufLen);\n                }\n                return r;\n            },\n            decode: (bytes) => {\n                const r = newPoly(N);\n                for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < bytes.length; i++) {\n                    buf |= bytes[i] << bufLen;\n                    bufLen += 8;\n                    for (; bufLen >= d; bufLen -= d, buf >>= d)\n                        r[pos++] = c.decode(buf & mask);\n                }\n                return r;\n            },\n        };\n    };\n    return { mod, smod, nttZetas, NTT, bitsCoder };\n};\nconst createXofShake = (shake) => (seed, blockLen) => {\n    if (!blockLen)\n        blockLen = shake.blockLen;\n    // Optimizations that won't mater:\n    // - cached seed update (two .update(), on start and on the end)\n    // - another cache which cloned into working copy\n    // Faster than multiple updates, since seed less than blockLen\n    const _seed = new Uint8Array(seed.length + 2);\n    _seed.set(seed);\n    const seedLen = seed.length;\n    const buf = new Uint8Array(blockLen); // == shake128.blockLen\n    let h = shake.create({});\n    let calls = 0;\n    let xofs = 0;\n    return {\n        stats: () => ({ calls, xofs }),\n        get: (x, y) => {\n            _seed[seedLen + 0] = x;\n            _seed[seedLen + 1] = y;\n            h.destroy();\n            h = shake.create({}).update(_seed);\n            calls++;\n            return () => {\n                xofs++;\n                return h.xofInto(buf);\n            };\n        },\n        clean: () => {\n            h.destroy();\n            buf.fill(0);\n            _seed.fill(0);\n        },\n    };\n};\nexport const XOF128 = /* @__PURE__ */ createXofShake(shake128);\nexport const XOF256 = /* @__PURE__ */ createXofShake(shake256);\n//# sourceMappingURL=_crystals.js.map","/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { sha3_256, sha3_512, shake256 } from '@noble/hashes/sha3';\nimport { u32 } from '@noble/hashes/utils';\nimport { genCrystals, XOF128 } from './_crystals.js';\nimport { cleanBytes, ensureBytes, equalBytes, randomBytes, splitCoder, vecCoder, } from './utils.js';\n/*\nLattice-based key encapsulation mechanism.\nSee [official site](https://www.pq-crystals.org/kyber/resources.shtml),\n[repo](https://github.com/pq-crystals/kyber),\n[spec](https://datatracker.ietf.org/doc/draft-cfrg-schwabe-kyber/).\n\nKey encapsulation is similar to DH / ECDH (think X25519), with important differences:\n\n- We can't verify if it was \"Bob\" who've sent the shared secret.\n  In ECDH, it's always verified\n- Kyber is probabalistic and relies on quality of randomness (CSPRNG).\n  ECDH doesn't (to this extent).\n- Kyber decapsulation never throws an error, even when shared secret was\n  encrypted by a different public key. It will just return a different\n  shared secret\n\nThere are some concerns with regards to security: see\n[djb blog](https://blog.cr.yp.to/20231003-countcorrectly.html) and\n[mailing list](https://groups.google.com/a/list.nist.gov/g/pqc-forum/c/W2VOzy0wz_E).\n\n*/\nconst N = 256; // Kyber (not FIPS-203) supports different lengths, but all std modes were using 256\nconst Q = 3329; // 13*(2**8)+1, modulo prime\nconst F = 3303; // 3303 ≡ 128**(−1) mod q (FIPS-203)\nconst ROOT_OF_UNITY = 17; // ζ = 17 ∈ Zq is a primitive 256-th root of unity modulo Q. ζ**128 ≡−1\nconst { mod, nttZetas, NTT, bitsCoder } = genCrystals({\n    N,\n    Q,\n    F,\n    ROOT_OF_UNITY,\n    newPoly: (n) => new Uint16Array(n),\n    brvBits: 7,\n    isKyber: true,\n});\n// prettier-ignore\nexport const PARAMS = {\n    512: { N, Q, K: 2, ETA1: 3, ETA2: 2, du: 10, dv: 4, RBGstrength: 128 },\n    768: { N, Q, K: 3, ETA1: 2, ETA2: 2, du: 10, dv: 4, RBGstrength: 192 },\n    1024: { N, Q, K: 4, ETA1: 2, ETA2: 2, du: 11, dv: 5, RBGstrength: 256 },\n};\n// FIPS-203: compress/decompress\nconst compress = (d) => {\n    // Special case, no need to compress, pass as is, but strip high bytes on compression\n    if (d >= 12)\n        return { encode: (i) => i, decode: (i) => i };\n    // NOTE: we don't use float arithmetic (forbidden by FIPS-203 and high chance of bugs).\n    // Comments map to python implementation in RFC (draft-cfrg-schwabe-kyber)\n    // const round = (i: number) => Math.floor(i + 0.5) | 0;\n    const a = 2 ** (d - 1);\n    return {\n        // const compress = (i: number) => round((2 ** d / Q) * i) % 2 ** d;\n        encode: (i) => ((i << d) + Q / 2) / Q,\n        // const decompress = (i: number) => round((Q / 2 ** d) * i);\n        decode: (i) => (i * Q + a) >>> d,\n    };\n};\n// NOTE: we merge encoding and compress because it is faster, also both require same d param\n// Converts between bytes and d-bits compressed representation. Kinda like convertRadix2 from @scure/base\n// decode(encode(t)) == t, but there is loss of information on encode(decode(t))\nconst polyCoder = (d) => bitsCoder(d, compress(d));\nfunction polyAdd(a, b) {\n    for (let i = 0; i < N; i++)\n        a[i] = mod(a[i] + b[i]); // a += b\n}\nfunction polySub(a, b) {\n    for (let i = 0; i < N; i++)\n        a[i] = mod(a[i] - b[i]); // a -= b\n}\n// FIPS-203: Computes the product of two degree-one polynomials with respect to a quadratic modulus\nfunction BaseCaseMultiply(a0, a1, b0, b1, zeta) {\n    const c0 = mod(a1 * b1 * zeta + a0 * b0);\n    const c1 = mod(a0 * b1 + a1 * b0);\n    return { c0, c1 };\n}\n// FIPS-203: Computes the product (in the ring Tq) of two NTT representations. NOTE: works inplace for f\n// NOTE: since multiply defined only for NTT representation, we need to convert to NTT, multiply and convert back\nfunction MultiplyNTTs(f, g) {\n    for (let i = 0; i < N / 2; i++) {\n        let z = nttZetas[64 + (i >> 1)];\n        if (i & 1)\n            z = -z;\n        const { c0, c1 } = BaseCaseMultiply(f[2 * i + 0], f[2 * i + 1], g[2 * i + 0], g[2 * i + 1], z);\n        f[2 * i + 0] = c0;\n        f[2 * i + 1] = c1;\n    }\n    return f;\n}\n// Return poly in NTT representation\nfunction SampleNTT(xof) {\n    const r = new Uint16Array(N);\n    for (let j = 0; j < N;) {\n        const b = xof();\n        if (b.length % 3)\n            throw new Error('SampleNTT: unaligned block');\n        for (let i = 0; j < N && i + 3 <= b.length; i += 3) {\n            const d1 = ((b[i + 0] >> 0) | (b[i + 1] << 8)) & 0xfff;\n            const d2 = ((b[i + 1] >> 4) | (b[i + 2] << 4)) & 0xfff;\n            if (d1 < Q)\n                r[j++] = d1;\n            if (j < N && d2 < Q)\n                r[j++] = d2;\n        }\n    }\n    return r;\n}\n// Sampling from the centered binomial distribution\n// Returns poly with small coefficients (noise/errors)\nfunction sampleCBD(PRF, seed, nonce, eta) {\n    const buf = PRF((eta * N) / 4, seed, nonce);\n    const r = new Uint16Array(N);\n    const b32 = u32(buf);\n    let len = 0;\n    for (let i = 0, p = 0, bb = 0, t0 = 0; i < b32.length; i++) {\n        let b = b32[i];\n        for (let j = 0; j < 32; j++) {\n            bb += b & 1;\n            b >>= 1;\n            len += 1;\n            if (len === eta) {\n                t0 = bb;\n                bb = 0;\n            }\n            else if (len === 2 * eta) {\n                r[p++] = mod(t0 - bb);\n                bb = 0;\n                len = 0;\n            }\n        }\n    }\n    if (len)\n        throw new Error(`sampleCBD: leftover bits: ${len}`);\n    return r;\n}\n// K-PKE\n// As per FIPS-203, it doesn't perform any input validation and can't be used in standalone fashion.\nconst genKPKE = (opts) => {\n    const { K, PRF, XOF, HASH512, ETA1, ETA2, du, dv } = opts;\n    const poly1 = polyCoder(1);\n    const polyV = polyCoder(dv);\n    const polyU = polyCoder(du);\n    const publicCoder = splitCoder(vecCoder(polyCoder(12), K), 32);\n    const secretCoder = vecCoder(polyCoder(12), K);\n    const cipherCoder = splitCoder(vecCoder(polyU, K), polyV);\n    const seedCoder = splitCoder(32, 32);\n    return {\n        secretCoder,\n        secretKeyLen: secretCoder.bytesLen,\n        publicKeyLen: publicCoder.bytesLen,\n        cipherTextLen: cipherCoder.bytesLen,\n        keygen: (seed) => {\n            const seedDst = new Uint8Array(33);\n            seedDst.set(seed);\n            seedDst[32] = K;\n            const seedHash = HASH512(seedDst);\n            const [rho, sigma] = seedCoder.decode(seedHash);\n            const sHat = [];\n            const tHat = [];\n            for (let i = 0; i < K; i++)\n                sHat.push(NTT.encode(sampleCBD(PRF, sigma, i, ETA1)));\n            const x = XOF(rho);\n            for (let i = 0; i < K; i++) {\n                const e = NTT.encode(sampleCBD(PRF, sigma, K + i, ETA1));\n                for (let j = 0; j < K; j++) {\n                    const aji = SampleNTT(x.get(j, i)); // A[j][i], inplace\n                    polyAdd(e, MultiplyNTTs(aji, sHat[j]));\n                }\n                tHat.push(e); // t ← A ◦ s + e\n            }\n            x.clean();\n            const res = {\n                publicKey: publicCoder.encode([tHat, rho]),\n                secretKey: secretCoder.encode(sHat),\n            };\n            cleanBytes(rho, sigma, sHat, tHat, seedDst, seedHash);\n            return res;\n        },\n        encrypt: (publicKey, msg, seed) => {\n            const [tHat, rho] = publicCoder.decode(publicKey);\n            const rHat = [];\n            for (let i = 0; i < K; i++)\n                rHat.push(NTT.encode(sampleCBD(PRF, seed, i, ETA1)));\n            const x = XOF(rho);\n            const tmp2 = new Uint16Array(N);\n            const u = [];\n            for (let i = 0; i < K; i++) {\n                const e1 = sampleCBD(PRF, seed, K + i, ETA2);\n                const tmp = new Uint16Array(N);\n                for (let j = 0; j < K; j++) {\n                    const aij = SampleNTT(x.get(i, j)); // A[i][j], inplace\n                    polyAdd(tmp, MultiplyNTTs(aij, rHat[j])); // t += aij * rHat[j]\n                }\n                polyAdd(e1, NTT.decode(tmp)); // e1 += tmp\n                u.push(e1);\n                polyAdd(tmp2, MultiplyNTTs(tHat[i], rHat[i])); // t2 += tHat[i] * rHat[i]\n                tmp.fill(0);\n            }\n            x.clean();\n            const e2 = sampleCBD(PRF, seed, 2 * K, ETA2);\n            polyAdd(e2, NTT.decode(tmp2)); // e2 += tmp2\n            const v = poly1.decode(msg); // encode plaintext m into polynomial v\n            polyAdd(v, e2); // v += e2\n            cleanBytes(tHat, rHat, tmp2, e2);\n            return cipherCoder.encode([u, v]);\n        },\n        decrypt: (cipherText, privateKey) => {\n            const [u, v] = cipherCoder.decode(cipherText);\n            const sk = secretCoder.decode(privateKey); // s  ← ByteDecode_12(dkPKE)\n            const tmp = new Uint16Array(N);\n            for (let i = 0; i < K; i++)\n                polyAdd(tmp, MultiplyNTTs(sk[i], NTT.encode(u[i]))); // tmp += sk[i] * u[i]\n            polySub(v, NTT.decode(tmp)); // v += tmp\n            cleanBytes(tmp, sk, u);\n            return poly1.encode(v);\n        },\n    };\n};\nfunction createKyber(opts) {\n    const KPKE = genKPKE(opts);\n    const { HASH256, HASH512, KDF } = opts;\n    const { secretCoder: KPKESecretCoder, cipherTextLen } = KPKE;\n    const publicKeyLen = KPKE.publicKeyLen; // 384*K+32\n    const secretCoder = splitCoder(KPKE.secretKeyLen, KPKE.publicKeyLen, 32, 32);\n    const secretKeyLen = secretCoder.bytesLen;\n    const msgLen = 32;\n    return {\n        publicKeyLen,\n        msgLen,\n        keygen: (seed = randomBytes(64)) => {\n            ensureBytes(seed, 64);\n            const { publicKey, secretKey: sk } = KPKE.keygen(seed.subarray(0, 32));\n            const publicKeyHash = HASH256(publicKey);\n            // (dkPKE||ek||H(ek)||z)\n            const secretKey = secretCoder.encode([sk, publicKey, publicKeyHash, seed.subarray(32)]);\n            cleanBytes(sk, publicKeyHash);\n            return { publicKey, secretKey };\n        },\n        encapsulate: (publicKey, msg = randomBytes(32)) => {\n            ensureBytes(publicKey, publicKeyLen);\n            ensureBytes(msg, msgLen);\n            // FIPS-203 includes additional verification check for modulus\n            const eke = publicKey.subarray(0, 384 * opts.K);\n            const ek = KPKESecretCoder.encode(KPKESecretCoder.decode(eke.slice())); // Copy because of inplace encoding\n            // (Modulus check.) Perform the computation ek ← ByteEncode12(ByteDecode12(eke)).\n            // If ek = ̸ eke, the input is invalid. (See Section 4.2.1.)\n            if (!equalBytes(ek, eke)) {\n                cleanBytes(ek);\n                throw new Error('ML-KEM.encapsulate: wrong publicKey modulus');\n            }\n            cleanBytes(ek);\n            const kr = HASH512.create().update(msg).update(HASH256(publicKey)).digest(); // derive randomness\n            const cipherText = KPKE.encrypt(publicKey, msg, kr.subarray(32, 64));\n            kr.subarray(32).fill(0);\n            return { cipherText, sharedSecret: kr.subarray(0, 32) };\n        },\n        decapsulate: (cipherText, secretKey) => {\n            ensureBytes(secretKey, secretKeyLen); // 768*k + 96\n            ensureBytes(cipherText, cipherTextLen); // 32(du*k + dv)\n            const [sk, publicKey, publicKeyHash, z] = secretCoder.decode(secretKey);\n            const msg = KPKE.decrypt(cipherText, sk);\n            const kr = HASH512.create().update(msg).update(publicKeyHash).digest(); // derive randomness, Khat, rHat = G(mHat || h)\n            const Khat = kr.subarray(0, 32);\n            const cipherText2 = KPKE.encrypt(publicKey, msg, kr.subarray(32, 64)); // re-encrypt using the derived randomness\n            const isValid = equalBytes(cipherText, cipherText2); // if ciphertexts do not match, “implicitly reject”\n            const Kbar = KDF.create({ dkLen: 32 }).update(z).update(cipherText).digest();\n            cleanBytes(msg, cipherText2, !isValid ? Khat : Kbar);\n            return isValid ? Khat : Kbar;\n        },\n    };\n}\nfunction shakePRF(dkLen, key, nonce) {\n    return shake256\n        .create({ dkLen })\n        .update(key)\n        .update(new Uint8Array([nonce]))\n        .digest();\n}\nconst opts = {\n    HASH256: sha3_256,\n    HASH512: sha3_512,\n    KDF: shake256,\n    XOF: XOF128,\n    PRF: shakePRF,\n};\n/**\n * FIPS-203 ML-KEM.\n */\nexport const ml_kem512 = /* @__PURE__ */ createKyber({\n    ...opts,\n    ...PARAMS[512],\n});\nexport const ml_kem768 = /* @__PURE__ */ createKyber({\n    ...opts,\n    ...PARAMS[768],\n});\nexport const ml_kem1024 = /* @__PURE__ */ createKyber({\n    ...opts,\n    ...PARAMS[1024],\n});\n//# sourceMappingURL=ml-kem.js.map","/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { shake256 } from '@noble/hashes/sha3';\nimport { genCrystals, XOF128, XOF256 } from './_crystals.js';\nimport { cleanBytes, ensureBytes, equalBytes, randomBytes, splitCoder, vecCoder, concatBytes, } from './utils.js';\n/*\nLattice-based digital signature algorithm. See\n[official site](https://www.pq-crystals.org/dilithium/index.shtml),\n[repo](https://github.com/pq-crystals/dilithium).\nDilithium has similar internals to Kyber, but their keys and params are different.\n\n*/\n// Constants\nconst N = 256;\n// 2**23 − 2**13 + 1, 23 bits: multiply will be 46. We have enough precision in JS to avoid bigints\nconst Q = 8380417;\nconst ROOT_OF_UNITY = 1753;\n// f = 256**−1 mod q, pow(256, -1, q) = 8347681 (python3)\nconst F = 8347681;\nconst D = 13;\n// Dilithium is kinda parametrized over GAMMA2, but everything will break with any other value.\nconst GAMMA2_1 = Math.floor((Q - 1) / 88) | 0;\nconst GAMMA2_2 = Math.floor((Q - 1) / 32) | 0;\n// prettier-ignore\nexport const PARAMS = {\n    2: { K: 4, L: 4, D, GAMMA1: 2 ** 17, GAMMA2: GAMMA2_1, TAU: 39, ETA: 2, OMEGA: 80 },\n    3: { K: 6, L: 5, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 49, ETA: 4, OMEGA: 55 },\n    5: { K: 8, L: 7, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 60, ETA: 2, OMEGA: 75 },\n};\nconst newPoly = (n) => new Int32Array(n);\nconst { mod, smod, NTT, bitsCoder } = genCrystals({\n    N,\n    Q,\n    F,\n    ROOT_OF_UNITY,\n    newPoly,\n    isKyber: false,\n    brvBits: 8,\n});\nconst id = (n) => n;\nconst polyCoder = (d, compress = id, verify = id) => bitsCoder(d, {\n    encode: (i) => compress(verify(i)),\n    decode: (i) => verify(compress(i)),\n});\nconst polyAdd = (a, b) => {\n    for (let i = 0; i < a.length; i++)\n        a[i] = mod(a[i] + b[i]);\n    return a;\n};\nconst polySub = (a, b) => {\n    for (let i = 0; i < a.length; i++)\n        a[i] = mod(a[i] - b[i]);\n    return a;\n};\nconst polyShiftl = (p) => {\n    for (let i = 0; i < N; i++)\n        p[i] <<= D;\n    return p;\n};\nconst polyChknorm = (p, B) => {\n    // Not very sure about this, but FIPS204 doesn't provide any function for that :(\n    for (let i = 0; i < N; i++)\n        if (Math.abs(smod(p[i])) >= B)\n            return true;\n    return false;\n};\nconst MultiplyNTTs = (a, b) => {\n    // NOTE: we don't use montgomery reduction in code, since it requires 64 bit ints,\n    // which is not available in JS. mod(a[i] * b[i]) is ok, since Q is 23 bit,\n    // which means a[i] * b[i] is 46 bit, which is safe to use in JS. (number is 53 bits).\n    // Barrett reduction is slower than mod :(\n    const c = newPoly(N);\n    for (let i = 0; i < a.length; i++)\n        c[i] = mod(a[i] * b[i]);\n    return c;\n};\n// Return poly in NTT representation\nfunction RejNTTPoly(xof) {\n    // Samples a polynomial ∈ Tq.\n    const r = newPoly(N);\n    // NOTE: we can represent 3xu24 as 4xu32, but it doesn't improve perf :(\n    for (let j = 0; j < N;) {\n        const b = xof();\n        if (b.length % 3)\n            throw new Error('RejNTTPoly: unaligned block');\n        for (let i = 0; j < N && i <= b.length - 3; i += 3) {\n            const t = (b[i + 0] | (b[i + 1] << 8) | (b[i + 2] << 16)) & 0x7fffff; // 3 bytes\n            if (t < Q)\n                r[j++] = t;\n        }\n    }\n    return r;\n}\nconst EMPTY = new Uint8Array(0);\nfunction getDilithium(opts) {\n    const { K, L, GAMMA1, GAMMA2, TAU, ETA, OMEGA } = opts;\n    const { CRH_BYTES, TR_BYTES, C_TILDE_BYTES, XOF128, XOF256 } = opts;\n    if (![2, 4].includes(ETA))\n        throw new Error('Wrong ETA');\n    if (![1 << 17, 1 << 19].includes(GAMMA1))\n        throw new Error('Wrong GAMMA1');\n    if (![GAMMA2_1, GAMMA2_2].includes(GAMMA2))\n        throw new Error('Wrong GAMMA2');\n    const BETA = TAU * ETA;\n    const decompose = (r) => {\n        // Decomposes r into (r1, r0) such that r ≡ r1(2γ2) + r0 mod q.\n        const rPlus = mod(r);\n        const r0 = smod(rPlus, 2 * GAMMA2) | 0;\n        if (rPlus - r0 === Q - 1)\n            return { r1: 0 | 0, r0: (r0 - 1) | 0 };\n        const r1 = Math.floor((rPlus - r0) / (2 * GAMMA2)) | 0;\n        return { r1, r0 }; // r1 = HighBits, r0 = LowBits\n    };\n    const HighBits = (r) => decompose(r).r1;\n    const LowBits = (r) => decompose(r).r0;\n    const MakeHint = (z, r) => {\n        // Compute hint bit indicating whether adding z to r alters the high bits of r.\n        // From dilithium code\n        const res0 = z <= GAMMA2 || z > Q - GAMMA2 || (z === Q - GAMMA2 && r === 0) ? 0 : 1;\n        // from FIPS204:\n        // // const r1 = HighBits(r);\n        // // const v1 = HighBits(r + z);\n        // // const res1 = +(r1 !== v1);\n        // But they return different results! However, decompose is same.\n        // So, either there is a bug in Dilithium ref implementation or in FIPS204.\n        // For now, lets use dilithium one, so test vectors can be passed.\n        // See\n        // https://github.com/GiacomoPope/dilithium-py?tab=readme-ov-file#optimising-decomposition-and-making-hints\n        return res0;\n    };\n    const UseHint = (h, r) => {\n        // Returns the high bits of r adjusted according to hint h\n        const m = Math.floor((Q - 1) / (2 * GAMMA2));\n        const { r1, r0 } = decompose(r);\n        // 3: if h = 1 and r0 > 0 return (r1 + 1) mod m\n        // 4: if h = 1 and r0 ≤ 0 return (r1 − 1) mod m\n        if (h === 1)\n            return r0 > 0 ? mod(r1 + 1, m) | 0 : mod(r1 - 1, m) | 0;\n        return r1 | 0;\n    };\n    const Power2Round = (r) => {\n        // Decomposes r into (r1, r0) such that r ≡ r1*(2**d) + r0 mod q.\n        const rPlus = mod(r);\n        const r0 = smod(rPlus, 2 ** D) | 0;\n        return { r1: Math.floor((rPlus - r0) / 2 ** D) | 0, r0 };\n    };\n    const hintCoder = {\n        bytesLen: OMEGA + K,\n        encode: (h) => {\n            if (h === false)\n                throw new Error('hint.encode: hint is false'); // should never happen\n            const res = new Uint8Array(OMEGA + K);\n            for (let i = 0, k = 0; i < K; i++) {\n                for (let j = 0; j < N; j++)\n                    if (h[i][j] !== 0)\n                        res[k++] = j;\n                res[OMEGA + i] = k;\n            }\n            return res;\n        },\n        decode: (buf) => {\n            const h = [];\n            let k = 0;\n            for (let i = 0; i < K; i++) {\n                const hi = newPoly(N);\n                if (buf[OMEGA + i] < k || buf[OMEGA + i] > OMEGA)\n                    return false;\n                for (let j = k; j < buf[OMEGA + i]; j++) {\n                    if (j > k && buf[j] <= buf[j - 1])\n                        return false;\n                    hi[buf[j]] = 1;\n                }\n                k = buf[OMEGA + i];\n                h.push(hi);\n            }\n            for (let j = k; j < OMEGA; j++)\n                if (buf[j] !== 0)\n                    return false;\n            return h;\n        },\n    };\n    const ETACoder = polyCoder(ETA === 2 ? 3 : 4, (i) => ETA - i, (i) => {\n        if (!(-ETA <= i && i <= ETA))\n            throw new Error(`malformed key s1/s3 ${i} outside of ETA range [${-ETA}, ${ETA}]`);\n        return i;\n    });\n    const T0Coder = polyCoder(13, (i) => (1 << (D - 1)) - i);\n    const T1Coder = polyCoder(10);\n    // Requires smod. Need to fix!\n    const ZCoder = polyCoder(GAMMA1 === 1 << 17 ? 18 : 20, (i) => smod(GAMMA1 - i));\n    const W1Coder = polyCoder(GAMMA2 === GAMMA2_1 ? 6 : 4);\n    const W1Vec = vecCoder(W1Coder, K);\n    // Main structures\n    const publicCoder = splitCoder(32, vecCoder(T1Coder, K));\n    const secretCoder = splitCoder(32, 32, TR_BYTES, vecCoder(ETACoder, L), vecCoder(ETACoder, K), vecCoder(T0Coder, K));\n    const sigCoder = splitCoder(C_TILDE_BYTES, vecCoder(ZCoder, L), hintCoder);\n    const CoefFromHalfByte = ETA === 2\n        ? (n) => (n < 15 ? 2 - (n % 5) : false)\n        : (n) => (n < 9 ? 4 - n : false);\n    // Return poly in NTT representation\n    function RejBoundedPoly(xof) {\n        // Samples an element a ∈ Rq with coeffcients in [−η, η] computed via rejection sampling from ρ.\n        const r = newPoly(N);\n        for (let j = 0; j < N;) {\n            const b = xof();\n            for (let i = 0; j < N && i < b.length; i += 1) {\n                // half byte. Should be superfast with vector instructions. But very slow with js :(\n                const d1 = CoefFromHalfByte(b[i] & 0x0f);\n                const d2 = CoefFromHalfByte((b[i] >> 4) & 0x0f);\n                if (d1 !== false)\n                    r[j++] = d1;\n                if (j < N && d2 !== false)\n                    r[j++] = d2;\n            }\n        }\n        return r;\n    }\n    const SampleInBall = (seed) => {\n        // Samples a polynomial c ∈ Rq with coeffcients from {−1, 0, 1} and Hamming weight τ\n        const pre = newPoly(N);\n        const s = shake256.create({}).update(seed);\n        const buf = new Uint8Array(shake256.blockLen);\n        s.xofInto(buf);\n        const masks = buf.slice(0, 8);\n        for (let i = N - TAU, pos = 8, maskPos = 0, maskBit = 0; i < N; i++) {\n            let b = i + 1;\n            for (; b > i;) {\n                b = buf[pos++];\n                if (pos < shake256.blockLen)\n                    continue;\n                s.xofInto(buf);\n                pos = 0;\n            }\n            pre[i] = pre[b];\n            pre[b] = 1 - (((masks[maskPos] >> maskBit++) & 1) << 1);\n            if (maskBit >= 8) {\n                maskPos++;\n                maskBit = 0;\n            }\n        }\n        return pre;\n    };\n    const polyPowerRound = (p) => {\n        const res0 = newPoly(N);\n        const res1 = newPoly(N);\n        for (let i = 0; i < p.length; i++) {\n            const { r0, r1 } = Power2Round(p[i]);\n            res0[i] = r0;\n            res1[i] = r1;\n        }\n        return { r0: res0, r1: res1 };\n    };\n    const polyUseHint = (u, h) => {\n        for (let i = 0; i < N; i++)\n            u[i] = UseHint(h[i], u[i]);\n        return u;\n    };\n    const polyMakeHint = (a, b) => {\n        const v = newPoly(N);\n        let cnt = 0;\n        for (let i = 0; i < N; i++) {\n            const h = MakeHint(a[i], b[i]);\n            v[i] = h;\n            cnt += h;\n        }\n        return { v, cnt };\n    };\n    const signRandBytes = 32;\n    const seedCoder = splitCoder(32, 64, 32);\n    // API & argument positions are exactly as in FIPS204.\n    const internal = {\n        signRandBytes,\n        keygen: (seed = randomBytes(32)) => {\n            // H(𝜉||IntegerToBytes(𝑘, 1)||IntegerToBytes(ℓ, 1), 128) 2: ▷ expand seed\n            const seedDst = new Uint8Array(32 + 2);\n            seedDst.set(seed);\n            seedDst[32] = K;\n            seedDst[33] = L;\n            const [rho, rhoPrime, K_] = seedCoder.decode(shake256(seedDst, { dkLen: seedCoder.bytesLen }));\n            const xofPrime = XOF256(rhoPrime);\n            const s1 = [];\n            for (let i = 0; i < L; i++)\n                s1.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n            const s2 = [];\n            for (let i = L; i < L + K; i++)\n                s2.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n            const s1Hat = s1.map((i) => NTT.encode(i.slice()));\n            const t0 = [];\n            const t1 = [];\n            const xof = XOF128(rho);\n            const t = newPoly(N);\n            for (let i = 0; i < K; i++) {\n                // t ← NTT−1(A*NTT(s1)) + s2\n                t.fill(0); // don't-reallocate\n                for (let j = 0; j < L; j++) {\n                    const aij = RejNTTPoly(xof.get(j, i)); // super slow!\n                    polyAdd(t, MultiplyNTTs(aij, s1Hat[j]));\n                }\n                NTT.decode(t);\n                const { r0, r1 } = polyPowerRound(polyAdd(t, s2[i])); // (t1, t0) ← Power2Round(t, d)\n                t0.push(r0);\n                t1.push(r1);\n            }\n            const publicKey = publicCoder.encode([rho, t1]); // pk ← pkEncode(ρ, t1)\n            const tr = shake256(publicKey, { dkLen: TR_BYTES }); // tr ← H(BytesToBits(pk), 512)\n            const secretKey = secretCoder.encode([rho, K_, tr, s1, s2, t0]); // sk ← skEncode(ρ, K,tr, s1, s2, t0)\n            xof.clean();\n            xofPrime.clean();\n            // STATS\n            // Kyber512:  { calls: 4, xofs: 12 }, Kyber768: { calls: 9, xofs: 27 }, Kyber1024: { calls: 16, xofs: 48 }\n            // DSA44:    { calls: 24, xofs: 24 }, DSA65:    { calls: 41, xofs: 41 }, DSA87:    { calls: 71, xofs: 71 }\n            cleanBytes(rho, rhoPrime, K_, s1, s2, s1Hat, t, t0, t1, tr, seedDst);\n            return { publicKey, secretKey };\n        },\n        // NOTE: random is optional.\n        sign: (secretKey, msg, random) => {\n            // This part can be pre-cached per secretKey, but there is only minor performance improvement,\n            // since we re-use a lot of variables to computation.\n            const [rho, _K, tr, s1, s2, t0] = secretCoder.decode(secretKey); // (ρ, K,tr, s1, s2, t0) ← skDecode(sk)\n            // Cache matrix to avoid re-compute later\n            const A = []; // A ← ExpandA(ρ)\n            const xof = XOF128(rho);\n            for (let i = 0; i < K; i++) {\n                const pv = [];\n                for (let j = 0; j < L; j++)\n                    pv.push(RejNTTPoly(xof.get(j, i)));\n                A.push(pv);\n            }\n            xof.clean();\n            for (let i = 0; i < L; i++)\n                NTT.encode(s1[i]); // sˆ1 ← NTT(s1)\n            for (let i = 0; i < K; i++) {\n                NTT.encode(s2[i]); // sˆ2 ← NTT(s2)\n                NTT.encode(t0[i]); // tˆ0 ← NTT(t0)\n            }\n            // This part is per msg\n            const mu = shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest(); // 6: µ ← H(tr||M, 512) ▷ Compute message representative µ\n            // Compute private random seed\n            const rnd = random ? random : new Uint8Array(32);\n            ensureBytes(rnd);\n            const rhoprime = shake256\n                .create({ dkLen: CRH_BYTES })\n                .update(_K)\n                .update(rnd)\n                .update(mu)\n                .digest(); // ρ′← H(K||rnd||µ, 512)\n            ensureBytes(rhoprime, CRH_BYTES);\n            const x256 = XOF256(rhoprime, ZCoder.bytesLen);\n            //  Rejection sampling loop\n            main_loop: for (let kappa = 0;;) {\n                const y = [];\n                // y ← ExpandMask(ρ , κ)\n                for (let i = 0; i < L; i++, kappa++)\n                    y.push(ZCoder.decode(x256.get(kappa & 0xff, kappa >> 8)()));\n                const z = y.map((i) => NTT.encode(i.slice()));\n                const w = [];\n                for (let i = 0; i < K; i++) {\n                    // w ← NTT−1(A ◦ NTT(y))\n                    const wi = newPoly(N);\n                    for (let j = 0; j < L; j++)\n                        polyAdd(wi, MultiplyNTTs(A[i][j], z[j]));\n                    NTT.decode(wi);\n                    w.push(wi);\n                }\n                const w1 = w.map((j) => j.map(HighBits)); // w1 ← HighBits(w)\n                // Commitment hash: c˜ ∈{0, 1 2λ } ← H(µ||w1Encode(w1), 2λ)\n                const cTilde = shake256\n                    .create({ dkLen: C_TILDE_BYTES })\n                    .update(mu)\n                    .update(W1Vec.encode(w1))\n                    .digest();\n                // Verifer’s challenge\n                const cHat = NTT.encode(SampleInBall(cTilde)); // c ← SampleInBall(c˜1); cˆ ← NTT(c)\n                // ⟨⟨cs1⟩⟩ ← NTT−1(cˆ◦ sˆ1)\n                const cs1 = s1.map((i) => MultiplyNTTs(i, cHat));\n                for (let i = 0; i < L; i++) {\n                    polyAdd(NTT.decode(cs1[i]), y[i]); // z ← y + ⟨⟨cs1⟩⟩\n                    if (polyChknorm(cs1[i], GAMMA1 - BETA))\n                        continue main_loop; // ||z||∞ ≥ γ1 − β\n                }\n                // cs1 is now z (▷ Signer’s response)\n                let cnt = 0;\n                const h = [];\n                for (let i = 0; i < K; i++) {\n                    const cs2 = NTT.decode(MultiplyNTTs(s2[i], cHat)); // ⟨⟨cs2⟩⟩ ← NTT−1(cˆ◦ sˆ2)\n                    const r0 = polySub(w[i], cs2).map(LowBits); // r0 ← LowBits(w − ⟨⟨cs2⟩⟩)\n                    if (polyChknorm(r0, GAMMA2 - BETA))\n                        continue main_loop; // ||r0||∞ ≥ γ2 − β\n                    const ct0 = NTT.decode(MultiplyNTTs(t0[i], cHat)); // ⟨⟨ct0⟩⟩ ← NTT−1(cˆ◦ tˆ0)\n                    if (polyChknorm(ct0, GAMMA2))\n                        continue main_loop;\n                    polyAdd(r0, ct0);\n                    // ▷ Signer’s hint\n                    const hint = polyMakeHint(r0, w1[i]); // h ← MakeHint(−⟨⟨ct0⟩⟩, w− ⟨⟨cs2⟩⟩ + ⟨⟨ct0⟩⟩)\n                    h.push(hint.v);\n                    cnt += hint.cnt;\n                }\n                if (cnt > OMEGA)\n                    continue; // the number of 1’s in h is greater than ω\n                x256.clean();\n                const res = sigCoder.encode([cTilde, cs1, h]); // σ ← sigEncode(c˜, z mod±q, h)\n                // rho, _K, tr is subarray of secretKey, cannot clean.\n                cleanBytes(cTilde, cs1, h, cHat, w1, w, z, y, rhoprime, mu, s1, s2, t0, ...A);\n                return res;\n            }\n            // @ts-ignore\n            throw new Error('Unreachable code path reached, report this error');\n        },\n        verify: (publicKey, msg, sig) => {\n            // ML-DSA.Verify(pk, M, σ): Verifes a signature σ for a message M.\n            const [rho, t1] = publicCoder.decode(publicKey); // (ρ, t1) ← pkDecode(pk)\n            const tr = shake256(publicKey, { dkLen: TR_BYTES }); // 6: tr ← H(BytesToBits(pk), 512)\n            if (sig.length !== sigCoder.bytesLen)\n                return false; // return false instead of exception\n            const [cTilde, z, h] = sigCoder.decode(sig); // (c˜, z, h) ← sigDecode(σ), ▷ Signer’s commitment hash c ˜, response z and hint\n            if (h === false)\n                return false; // if h = ⊥ then return false\n            for (let i = 0; i < L; i++)\n                if (polyChknorm(z[i], GAMMA1 - BETA))\n                    return false;\n            const mu = shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest(); // 7: µ ← H(tr||M, 512)\n            // Compute verifer’s challenge from c˜\n            const c = NTT.encode(SampleInBall(cTilde)); // c ← SampleInBall(c˜1)\n            const zNtt = z.map((i) => i.slice()); // zNtt = NTT(z)\n            for (let i = 0; i < L; i++)\n                NTT.encode(zNtt[i]);\n            const wTick1 = [];\n            const xof = XOF128(rho);\n            for (let i = 0; i < K; i++) {\n                const ct12d = MultiplyNTTs(NTT.encode(polyShiftl(t1[i])), c); //c * t1 * (2**d)\n                const Az = newPoly(N); // // A * z\n                for (let j = 0; j < L; j++) {\n                    const aij = RejNTTPoly(xof.get(j, i)); // A[i][j] inplace\n                    polyAdd(Az, MultiplyNTTs(aij, zNtt[j]));\n                }\n                // wApprox = A*z - c*t1 * (2**d)\n                const wApprox = NTT.decode(polySub(Az, ct12d));\n                // Reconstruction of signer’s commitment\n                wTick1.push(polyUseHint(wApprox, h[i])); // w ′ ← UseHint(h, w'approx )\n            }\n            xof.clean();\n            // c˜′← H (µ||w1Encode(w′1), 2λ),  Hash it; this should match c˜\n            const c2 = shake256\n                .create({ dkLen: C_TILDE_BYTES })\n                .update(mu)\n                .update(W1Vec.encode(wTick1))\n                .digest();\n            // Additional checks in FIPS-204:\n            // [[ ||z||∞ < γ1 − β ]] and [[c ˜ = c˜′]] and [[number of 1’s in h is ≤ ω]]\n            for (const t of h) {\n                const sum = t.reduce((acc, i) => acc + i, 0);\n                if (!(sum <= OMEGA))\n                    return false;\n            }\n            for (const t of z)\n                if (polyChknorm(t, GAMMA1 - BETA))\n                    return false;\n            return equalBytes(cTilde, c2);\n        },\n    };\n    const getMessage = (msg, ctx = EMPTY) => {\n        ensureBytes(msg);\n        ensureBytes(ctx);\n        if (ctx.length > 255)\n            throw new Error('context should be less than 255 bytes');\n        return concatBytes(new Uint8Array([0, ctx.length]), ctx, msg);\n    };\n    // TODO: no hash-dsa vectors for now, so we don't implement it yet\n    return {\n        internal,\n        keygen: internal.keygen,\n        signRandBytes: internal.signRandBytes,\n        sign: (secretKey, msg, ctx = EMPTY, random) => {\n            const M = getMessage(msg, ctx);\n            const res = internal.sign(secretKey, M, random);\n            M.fill(0);\n            return res;\n        },\n        verify: (publicKey, msg, sig, ctx = EMPTY) => {\n            return internal.verify(publicKey, getMessage(msg, ctx), sig);\n        },\n    };\n}\n// ML-DSA\nexport const ml_dsa44 = /* @__PURE__ */ getDilithium({\n    ...PARAMS[2],\n    CRH_BYTES: 64,\n    TR_BYTES: 64,\n    C_TILDE_BYTES: 32,\n    XOF128,\n    XOF256,\n});\nexport const ml_dsa65 = /* @__PURE__ */ getDilithium({\n    ...PARAMS[3],\n    CRH_BYTES: 64,\n    TR_BYTES: 64,\n    C_TILDE_BYTES: 48,\n    XOF128,\n    XOF256,\n});\nexport const ml_dsa87 = /* @__PURE__ */ getDilithium({\n    ...PARAMS[5],\n    CRH_BYTES: 64,\n    TR_BYTES: 64,\n    C_TILDE_BYTES: 64,\n    XOF128,\n    XOF256,\n});\n//# sourceMappingURL=ml-dsa.js.map"],"names":["ensureBytes","abytes","randomBytes","randb","equalBytes","a","b","length","diff","i","splitCoder","lengths","getLength","c","bytesLen","reduce","sum","encode","bufs","res","Uint8Array","pos","l","set","fill","decode","buf","subarray","push","vecCoder","vecLen","u","Error","r","cleanBytes","list","t","Array","isArray","getMask","bits","bitReversal","n","revrsd","toString","padStart","slice","split","reverse","join","Number","parseInt","genCrystals","opts","newPoly","N","Q","F","ROOT_OF_UNITY","brvBits","isKyber","mod","modulo","result","nttZetas","out","p","BigInt","getZettas","LEN1","LEN2","NTT","k","len","start","zeta","j","smod","bitsCoder","d","mask","poly","bufLen","bytes","createXofShake","shake","seed","blockLen","_seed","seedLen","h","create","calls","xofs","stats","get","x","y","destroy","update","xofInto","clean","XOF128","shake128","XOF256","shake256","Uint16Array","polyCoder","compress","polyAdd","MultiplyNTTs","f","g","z","c0","c1","a0","a1","b0","b1","SampleNTT","xof","d1","d2","sampleCBD","PRF","nonce","eta","b32","u32","bb","t0","genKPKE","K","XOF","HASH512","ETA1","ETA2","du","dv","poly1","polyV","polyU","publicCoder","secretCoder","cipherCoder","seedCoder","secretKeyLen","publicKeyLen","cipherTextLen","keygen","seedDst","seedHash","rho","sigma","sHat","tHat","e","publicKey","secretKey","encrypt","msg","rHat","tmp2","e1","tmp","e2","v","decrypt","cipherText","privateKey","sk","polySub","createKyber","KPKE","HASH256","KDF","KPKESecretCoder","msgLen","publicKeyHash","encapsulate","eke","ek","kr","digest","sharedSecret","decapsulate","Khat","cipherText2","isValid","Kbar","dkLen","ml_kem768","sha3_256","sha3_512","key","RBGstrength","D","GAMMA2_1","Math","floor","GAMMA2_2","PARAMS","L","GAMMA1","GAMMA2","TAU","ETA","OMEGA","Int32Array","id","verify","polyShiftl","polyChknorm","B","abs","RejNTTPoly","EMPTY","getDilithium","CRH_BYTES","TR_BYTES","C_TILDE_BYTES","includes","BETA","decompose","rPlus","r0","r1","HighBits","LowBits","UseHint","m","Power2Round","hintCoder","hi","ETACoder","T0Coder","T1Coder","ZCoder","W1Vec","sigCoder","CoefFromHalfByte","RejBoundedPoly","SampleInBall","pre","s","masks","maskPos","maskBit","polyPowerRound","res0","res1","polyUseHint","polyMakeHint","cnt","internal","signRandBytes","rhoPrime","K_","xofPrime","s1","s2","s1Hat","map","t1","aij","tr","sign","random","_K","A","pv","mu","rnd","rhoprime","x256","main_loop","kappa","w","wi","w1","cTilde","cHat","cs1","cs2","ct0","hint","sig","zNtt","wTick1","ct12d","Az","wApprox","c2","acc","getMessage","ctx","concatBytes","M","ml_dsa65"],"mappings":";;4EAGO,MAAMA,EAAcC,EACdC,EAAcC,EAGpB,SAASC,EAAWC,EAAGC,GAC1B,GAAID,EAAEE,SAAWD,EAAEC,OACf,OAAO,EACX,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAAEE,OAAQE,IAC1BD,GAAQH,EAAEI,GAAKH,EAAEG,GACrB,OAAgB,IAATD,CACX,CACO,SAASE,KAAcC,GAC1B,MAAMC,EAAaC,GAAoB,iBAANA,EAAiBA,EAAIA,EAAEC,SAClDA,EAAWH,EAAQI,QAAO,CAACC,EAAKX,IAAMW,EAAMJ,EAAUP,IAAI,GAChE,MAAO,CACHS,WACAG,OAASC,IACL,MAAMC,EAAM,IAAIC,WAAWN,GAC3B,IAAK,IAAIL,EAAI,EAAGY,EAAM,EAAGZ,EAAIE,EAAQJ,OAAQE,IAAK,CAC9C,MAAMI,EAAIF,EAAQF,GACZa,EAAIV,EAAUC,GACdP,EAAiB,iBAANO,EAAiBK,EAAKT,GAAKI,EAAEI,OAAOC,EAAKT,IAC1DT,EAAYM,EAAGgB,GACfH,EAAII,IAAIjB,EAAGe,GACM,iBAANR,GACPP,EAAEkB,KAAK,GACXH,GAAOC,CACvB,CACY,OAAOH,CAAG,EAEdM,OAASC,IACL1B,EAAY0B,EAAKZ,GACjB,MAAMK,EAAM,GACZ,IAAK,MAAMN,KAAKF,EAAS,CACrB,MAAMW,EAAIV,EAAUC,GACdP,EAAIoB,EAAIC,SAAS,EAAGL,GAC1BH,EAAIS,KAAkB,iBAANf,EAAiBP,EAAIO,EAAEY,OAAOnB,IAC9CoB,EAAMA,EAAIC,SAASL,EACnC,CACY,OAAOH,CAAG,EAGtB,CAEO,SAASU,EAAShB,EAAGiB,GACxB,MAAMhB,EAAWgB,EAASjB,EAAEC,SAC5B,MAAO,CACHA,WACAG,OAASc,IACL,GAAIA,EAAExB,SAAWuB,EACb,MAAUE,MAAM,iCAAiCD,EAAExB,qBAAqBuB,KAC5E,MAAMX,EAAM,IAAIC,WAAWN,GAC3B,IAAK,IAAIL,EAAI,EAAGY,EAAM,EAAGZ,EAAIsB,EAAExB,OAAQE,IAAK,CACxC,MAAMH,EAAIO,EAAEI,OAAOc,EAAEtB,IACrBU,EAAII,IAAIjB,EAAGe,GACXf,EAAEkB,KAAK,GACPH,GAAOf,EAAEC,MACzB,CACY,OAAOY,CAAG,EAEdM,OAASpB,IACLL,EAAYK,EAAGS,GACf,MAAMmB,EAAI,GACV,IAAK,IAAIxB,EAAI,EAAGA,EAAIJ,EAAEE,OAAQE,GAAKI,EAAEC,SACjCmB,EAAEL,KAAKf,EAAEY,OAAOpB,EAAEsB,SAASlB,EAAGA,EAAII,EAAEC,YACxC,OAAOmB,CAAC,EAGpB,CAEO,SAASC,KAAcC,GAC1B,IAAK,MAAMC,KAAKD,EACZ,GAAIE,MAAMC,QAAQF,GACd,IAAK,MAAM9B,KAAK8B,EACZ9B,EAAEkB,KAAK,QAEXY,EAAEZ,KAAK,EAEnB,CACO,SAASe,EAAQC,GACpB,OAAQ,GAAKA,GAAQ,CACzB;4ECjFA,SAASC,EAAYC,EAAGF,EAAO,GAC3B,MAEMG,EAFSD,EAAEE,SAAS,GAAGC,SAAS,EAAG,KACnBC,OAAON,GAAMK,SAAS,EAAG,KACzBE,MAAM,IAAIC,UAAUC,KAAK,IAC/C,OAAOC,OAAOC,SAASR,EAAQ,EACnC,CACO,MAAMS,EAAeC,IAExB,MAAMC,QAAEA,EAAOC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,cAAEA,EAAaC,QAAEA,EAAOC,QAAEA,GAAYP,EACxDQ,EAAM,CAACxD,EAAGyD,EAASN,KACrB,MAAMO,EAAS1D,EAAIyD,EAAS,EAC5B,OAA4D,GAApDC,GAAU,EAAIA,EAAcD,EAASC,EAAgB,EAiBjE,MAAMC,EATN,WACI,MAAMC,EAAMX,EAAQC,GACpB,IAAK,IAAI9C,EAAI,EAAGA,EAAI8C,EAAG9C,IAAK,CACxB,MAAMH,EAAImC,EAAYhC,EAAGkD,GACnBO,EAAIC,OAAOT,IAAkBS,OAAO7D,GAAK6D,OAAOX,GACtDS,EAAIxD,GAAiB,EAAZyC,OAAOgB,EAC5B,CACQ,OAAOD,CACf,CACqBG,GAMXC,EAAOT,EAAU,IAAML,EACvBe,EAAOV,EAAU,EAAI,EACrBW,EAAM,CACRtD,OAASgB,IACL,IAAK,IAAIuC,EAAI,EAAGC,EAAM,IAAKA,EAAMH,EAAMG,IAAQ,EAC3C,IAAK,IAAIC,EAAQ,EAAGA,EAAQnB,EAAGmB,GAAS,EAAID,EAAK,CAC7C,MAAME,EAAOX,EAASQ,KACtB,IAAK,IAAII,EAAIF,EAAOE,EAAIF,EAAQD,EAAKG,IAAK,CACtC,MAAMxC,EAAIyB,EAAIc,EAAO1C,EAAE2C,EAAIH,IAC3BxC,EAAE2C,EAAIH,GAAuB,EAAhBZ,EAAI5B,EAAE2C,GAAKxC,GACxBH,EAAE2C,GAAqB,EAAhBf,EAAI5B,EAAE2C,GAAKxC,EAC1C,CACA,CAEY,OAAOH,CAAC,EAEZR,OAASQ,IACL,IAAK,IAAIuC,EAAIH,EAAO,EAAGI,EAAM,EAAIH,EAAMG,EAAMJ,EAAOC,EAAMG,IAAQ,EAC9D,IAAK,IAAIC,EAAQ,EAAGA,EAAQnB,EAAGmB,GAAS,EAAID,EAAK,CAC7C,MAAME,EAAOX,EAASQ,KACtB,IAAK,IAAII,EAAIF,EAAOE,EAAIF,EAAQD,EAAKG,IAAK,CACtC,MAAMxC,EAAIH,EAAE2C,GACZ3C,EAAE2C,GAAKf,EAAIzB,EAAIH,EAAE2C,EAAIH,IACrBxC,EAAE2C,EAAIH,GAAOZ,EAAIc,GAAQ1C,EAAE2C,EAAIH,GAAOrC,GAC9D,CACA,CAEY,IAAK,IAAI3B,EAAI,EAAGA,EAAIwB,EAAE1B,OAAQE,IAC1BwB,EAAExB,GAAKoD,EAAIJ,EAAIxB,EAAExB,IACrB,OAAOwB,CAAC,GA+BhB,MAAO,CAAE4B,MAAKgB,KAhFD,CAACxE,EAAGyD,EAASN,KACtB,MAAMvB,EAAqB,EAAjB4B,EAAIxD,EAAGyD,GACjB,OAAkD,GAA1C7B,EAAI6B,GAAU,EAAK7B,EAAI6B,EAAc7B,EAAM,EA8EnC+B,WAAUO,MAAKO,UA3BjB,CAACC,EAAGlE,KAClB,MAAMmE,EAAOzC,EAAQwC,GACfjE,EAAWiE,GAAKxB,EAAI,GAC1B,MAAO,CACHzC,WACAG,OAASgE,IACL,MAAMhD,EAAI,IAAIb,WAAWN,GACzB,IAAK,IAAIL,EAAI,EAAGiB,EAAM,EAAGwD,EAAS,EAAG7D,EAAM,EAAGZ,EAAIwE,EAAK1E,OAAQE,IAG3D,IAFAiB,IAAQb,EAAEI,OAAOgE,EAAKxE,IAAMuE,IAASE,EACrCA,GAAUH,EACHG,GAAU,EAAGA,GAAU,EAAGxD,IAAQ,EACrCO,EAAEZ,KAASK,EAAMa,EAAQ2C,GAEjC,OAAOjD,CAAC,EAEZR,OAAS0D,IACL,MAAMlD,EAAIqB,EAAQC,GAClB,IAAK,IAAI9C,EAAI,EAAGiB,EAAM,EAAGwD,EAAS,EAAG7D,EAAM,EAAGZ,EAAI0E,EAAM5E,OAAQE,IAG5D,IAFAiB,GAAOyD,EAAM1E,IAAMyE,EACnBA,GAAU,EACHA,GAAUH,EAAGG,GAAUH,EAAGrD,IAAQqD,EACrC9C,EAAEZ,KAASR,EAAEY,OAAOC,EAAMsD,GAElC,OAAO/C,CAAC,EAEf,EAEyC,EAE5CmD,EAAkBC,GAAU,CAACC,EAAMC,KAChCA,IACDA,EAAWF,EAAME,UAKrB,MAAMC,EAAQ,IAAIpE,WAAWkE,EAAK/E,OAAS,GAC3CiF,EAAMjE,IAAI+D,GACV,MAAMG,EAAUH,EAAK/E,OACfmB,EAAM,IAAIN,WAAWmE,GAC3B,IAAIG,EAAIL,EAAMM,OAAO,IACjBC,EAAQ,EACRC,EAAO,EACX,MAAO,CACHC,MAAO,KAAO,CAAEF,QAAOC,SACvBE,IAAK,CAACC,EAAGC,KACLT,EAAMC,EAAU,GAAKO,EACrBR,EAAMC,EAAU,GAAKQ,EACrBP,EAAEQ,UACFR,EAAIL,EAAMM,OAAO,CAAE,GAAEQ,OAAOX,GAC5BI,IACO,KACHC,IACOH,EAAEU,QAAQ1E,KAGzB2E,MAAO,KACHX,EAAEQ,UACFxE,EAAIF,KAAK,GACTgE,EAAMhE,KAAK,EAAE,EAEpB,EAEQ8E,iBAAyBlB,EAAemB,GACxCC,iBAAyBpB,EAAeqB,GC7G/ClD,EAAI,IACJC,EAAI,MAGJK,IAAEA,EAAGG,SAAEA,EAAQO,IAAEA,EAAGO,UAAEA,GAAc1B,EAAY,CACtDG,EAAIA,EACJC,EAAIA,EACJC,EALU,KAMVC,cALsB,GAMlBJ,QAAUZ,GAAM,IAAIgE,YAAYhE,GAChCiB,QAAS,EACTC,SAAS,IA2BP+C,EAAa5B,GAAMD,EAAUC,EAlBlB,CAACA,IAEd,GAAIA,GAAK,GACL,MAAO,CAAE9D,OAASR,GAAMA,EAAGgB,OAAShB,GAAMA,GAI9C,MAAMJ,EAAI,IAAM0E,EAAI,GACpB,MAAO,CAEH9D,OAASR,KAAQA,GAAKsE,GAAKvB,EAAI,GAAKA,EAEpC/B,OAAShB,GAAOA,EAAI+C,EAAInD,IAAO0E,EAClC,EAKiC6B,CAAS7B,IAC/C,SAAS8B,EAAQxG,EAAGC,GAChB,IAAK,IAAIG,EAAI,EAAGA,EAAI8C,EAAG9C,IACnBJ,EAAEI,GAAKoD,EAAIxD,EAAEI,GAAKH,EAAEG,GAC5B,CAaA,SAASqG,EAAaC,EAAGC,GACrB,IAAK,IAAIvG,EAAI,EAAGA,EAAI8C,IAAO9C,IAAK,CAC5B,IAAIwG,EAAIjD,EAAS,IAAMvD,GAAK,IACpB,EAAJA,IACAwG,GAAKA,GACT,MAAMC,GAAEA,EAAEC,GAAEA,IAZMC,EAYkBL,EAAE,EAAItG,EAAI,GAZxB4G,EAY4BN,EAAE,EAAItG,EAAI,GAZlC6G,EAYsCN,EAAE,EAAIvG,EAAI,GAZ5C8G,EAYgDP,EAAE,EAAIvG,EAAI,GATrF,CAAEyG,GAFErD,EAAIwD,EAAKE,EAW4EN,EAXhEG,EAAKE,GAExBH,GADFtD,EAAIuD,EAAKG,EAAKF,EAAKC,KAW1BP,EAAE,EAAItG,EAAI,GAAKyG,EACfH,EAAE,EAAItG,EAAI,GAAK0G,CACvB,CAfA,IAA0BC,EAAIC,EAAIC,EAAIC,EAgBlC,OAAOR,CACX,CAEA,SAASS,EAAUC,GACf,MAAMxF,EAAI,IAAIyE,YAAYnD,GAC1B,IAAK,IAAIqB,EAAI,EAAGA,EAAIrB,GAAI,CACpB,MAAMjD,EAAImH,IACV,GAAInH,EAAEC,OAAS,EACX,MAAUyB,MAAM,8BACpB,IAAK,IAAIvB,EAAI,EAAGmE,EAAIrB,GAAK9C,EAAI,GAAKH,EAAEC,OAAQE,GAAK,EAAG,CAChD,MAAMiH,EAA2C,MAApCpH,EAAEG,EAAI,GAAYH,EAAEG,EAAI,IAAM,GACrCkH,EAA2C,MAApCrH,EAAEG,EAAI,IAAM,EAAMH,EAAEG,EAAI,IAAM,GACvCiH,EAAKlE,IACLvB,EAAE2C,KAAO8C,GACT9C,EAAIrB,GAAKoE,EAAKnE,IACdvB,EAAE2C,KAAO+C,EACzB,CACA,CACI,OAAO1F,CACX,CAGA,SAAS2F,EAAUC,EAAKvC,EAAMwC,EAAOC,GACjC,MAAMrG,EAAMmG,EAAKE,EAAMxE,EAAK,EAAG+B,EAAMwC,GAC/B7F,EAAI,IAAIyE,YAAYnD,GACpByE,EAAMC,EAAIvG,GAChB,IAAI+C,EAAM,EACV,IAAK,IAAIhE,EAAI,EAAGyD,EAAI,EAAGgE,EAAK,EAAGC,EAAK,EAAG1H,EAAIuH,EAAIzH,OAAQE,IAAK,CACxD,IAAIH,EAAI0H,EAAIvH,GACZ,IAAK,IAAImE,EAAI,EAAGA,EAAI,GAAIA,IACpBsD,GAAU,EAAJ5H,EACNA,IAAM,EACNmE,GAAO,EACHA,IAAQsD,GACRI,EAAKD,EACLA,EAAK,GAEAzD,IAAQ,EAAIsD,IACjB9F,EAAEiC,KAAOL,EAAIsE,EAAKD,GAClBA,EAAK,EACLzD,EAAM,EAGtB,CACI,GAAIA,EACA,MAAUzC,MAAM,6BAA6ByC,GACjD,OAAOxC,CACX,CAGA,MAAMmG,EAAW/E,IACb,MAAMgF,EAAEA,EAACR,IAAEA,EAAGS,IAAEA,EAAGC,QAAEA,EAAOC,KAAEA,EAAIC,KAAEA,EAAIC,GAAEA,EAAEC,GAAEA,GAAOtF,EAC/CuF,EAAQjC,EAAU,GAClBkC,EAAQlC,EAAUgC,GAClBG,EAAQnC,EAAU+B,GAClBK,EAAcrI,EAAWmB,EAAS8E,EAAU,IAAK0B,GAAI,IACrDW,EAAcnH,EAAS8E,EAAU,IAAK0B,GACtCY,EAAcvI,EAAWmB,EAASiH,EAAOT,GAAIQ,GAC7CK,EAAYxI,EAAW,GAAI,IACjC,MAAO,CACHsI,cACAG,aAAcH,EAAYlI,SAC1BsI,aAAcL,EAAYjI,SAC1BuI,cAAeJ,EAAYnI,SAC3BwI,OAAShE,IACL,MAAMiE,EAAU,IAAInI,WAAW,IAC/BmI,EAAQhI,IAAI+D,GACZiE,EAAQ,IAAMlB,EACd,MAAMmB,EAAWjB,EAAQgB,IAClBE,EAAKC,GAASR,EAAUzH,OAAO+H,GAChCG,EAAO,GACPC,EAAO,GACb,IAAK,IAAInJ,EAAI,EAAGA,EAAI4H,EAAG5H,IACnBkJ,EAAK/H,KAAK2C,EAAItD,OAAO2G,EAAUC,EAAK6B,EAAOjJ,EAAG+H,KAClD,MAAMxC,EAAIsC,EAAImB,GACd,IAAK,IAAIhJ,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAMoJ,EAAItF,EAAItD,OAAO2G,EAAUC,EAAK6B,EAAOrB,EAAI5H,EAAG+H,IAClD,IAAK,IAAI5D,EAAI,EAAGA,EAAIyD,EAAGzD,IAAK,CAExBiC,EAAQgD,EAAG/C,EADCU,EAAUxB,EAAED,IAAInB,EAAGnE,IACFkJ,EAAK/E,IACtD,CACgBgF,EAAKhI,KAAKiI,EAC1B,CACY7D,EAAEK,QACF,MAAMlF,EAAM,CACR2I,UAAWf,EAAY9H,OAAO,CAAC2I,EAAMH,IACrCM,UAAWf,EAAY/H,OAAO0I,IAGlC,OADAzH,EAAWuH,EAAKC,EAAOC,EAAMC,EAAML,EAASC,GACrCrI,CAAG,EAEd6I,QAAS,CAACF,EAAWG,EAAK3E,KACtB,MAAOsE,EAAMH,GAAOV,EAAYtH,OAAOqI,GACjCI,EAAO,GACb,IAAK,IAAIzJ,EAAI,EAAGA,EAAI4H,EAAG5H,IACnByJ,EAAKtI,KAAK2C,EAAItD,OAAO2G,EAAUC,EAAKvC,EAAM7E,EAAG+H,KACjD,MAAMxC,EAAIsC,EAAImB,GACRU,EAAO,IAAIzD,YAAYnD,GACvBxB,EAAI,GACV,IAAK,IAAItB,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAM2J,EAAKxC,EAAUC,EAAKvC,EAAM+C,EAAI5H,EAAGgI,GACjC4B,EAAM,IAAI3D,YAAYnD,GAC5B,IAAK,IAAIqB,EAAI,EAAGA,EAAIyD,EAAGzD,IAAK,CAExBiC,EAAQwD,EAAKvD,EADDU,EAAUxB,EAAED,IAAItF,EAAGmE,IACAsF,EAAKtF,IACxD,CACgBiC,EAAQuD,EAAI7F,EAAI9C,OAAO4I,IACvBtI,EAAEH,KAAKwI,GACPvD,EAAQsD,EAAMrD,EAAa8C,EAAKnJ,GAAIyJ,EAAKzJ,KACzC4J,EAAI7I,KAAK,EACzB,CACYwE,EAAEK,QACF,MAAMiE,EAAK1C,EAAUC,EAAKvC,EAAM,EAAI+C,EAAGI,GACvC5B,EAAQyD,EAAI/F,EAAI9C,OAAO0I,IACvB,MAAMI,EAAI3B,EAAMnH,OAAOwI,GAGvB,OAFApD,EAAQ0D,EAAGD,GACXpI,EAAW0H,EAAMM,EAAMC,EAAMG,GACtBrB,EAAYhI,OAAO,CAACc,EAAGwI,GAAG,EAErCC,QAAS,CAACC,EAAYC,KAClB,MAAO3I,EAAGwI,GAAKtB,EAAYxH,OAAOgJ,GAC5BE,EAAK3B,EAAYvH,OAAOiJ,GACxBL,EAAM,IAAI3D,YAAYnD,GAC5B,IAAK,IAAI9C,EAAI,EAAGA,EAAI4H,EAAG5H,IACnBoG,EAAQwD,EAAKvD,EAAa6D,EAAGlK,GAAI8D,EAAItD,OAAOc,EAAEtB,MAGlD,OApJZ,SAAiBJ,EAAGC,GAChB,IAAK,IAAIG,EAAI,EAAGA,EAAI8C,EAAG9C,IACnBJ,EAAEI,GAAKoD,EAAIxD,EAAEI,GAAKH,EAAEG,GAC5B,CA+IYmK,CAAQL,EAAGhG,EAAI9C,OAAO4I,IACtBnI,EAAWmI,EAAKM,EAAI5I,GACb6G,EAAM3H,OAAOsJ,EAAE,EAE7B,EAEL,SAASM,EAAYxH,GACjB,MAAMyH,EAAO1C,EAAQ/E,IACf0H,QAAEA,EAAOxC,QAAEA,EAAOyC,IAAEA,GAAQ3H,GAC1B2F,YAAaiC,EAAe5B,cAAEA,GAAkByB,EAClD1B,EAAe0B,EAAK1B,aACpBJ,EAActI,EAAWoK,EAAK3B,aAAc2B,EAAK1B,aAAc,GAAI,IACnED,EAAeH,EAAYlI,SAEjC,MAAO,CACHsI,eACA8B,OAHW,GAIX5B,OAAQ,CAAChE,EAAOpF,EAAY,OACxBF,EAAYsF,EAAM,IAClB,MAAMwE,UAAEA,EAAWC,UAAWY,GAAOG,EAAKxB,OAAOhE,EAAK3D,SAAS,EAAG,KAC5DwJ,EAAgBJ,EAAQjB,GAExBC,EAAYf,EAAY/H,OAAO,CAAC0J,EAAIb,EAAWqB,EAAe7F,EAAK3D,SAAS,MAElF,OADAO,EAAWyI,EAAIQ,GACR,CAAErB,YAAWC,YAAW,EAEnCqB,YAAa,CAACtB,EAAWG,EAAM/J,EAAY,OACvCF,EAAY8J,EAAWV,GACvBpJ,EAAYiK,EAfL,IAiBP,MAAMoB,EAAMvB,EAAUnI,SAAS,EAAG,IAAM0B,EAAKgF,GACvCiD,EAAKL,EAAgBhK,OAAOgK,EAAgBxJ,OAAO4J,EAAIvI,UAG7D,IAAK1C,EAAWkL,EAAID,GAEhB,MADAnJ,EAAWoJ,GACDtJ,MAAM,+CAEpBE,EAAWoJ,GACX,MAAMC,EAAKhD,EAAQ5C,SAASQ,OAAO8D,GAAK9D,OAAO4E,EAAQjB,IAAY0B,SAC7Df,EAAaK,EAAKd,QAAQF,EAAWG,EAAKsB,EAAG5J,SAAS,GAAI,KAEhE,OADA4J,EAAG5J,SAAS,IAAIH,KAAK,GACd,CAAEiJ,aAAYgB,aAAcF,EAAG5J,SAAS,EAAG,IAAK,EAE3D+J,YAAa,CAACjB,EAAYV,KACtB/J,EAAY+J,EAAWZ,GACvBnJ,EAAYyK,EAAYpB,GACxB,MAAOsB,EAAIb,EAAWqB,EAAelE,GAAK+B,EAAYvH,OAAOsI,GACvDE,EAAMa,EAAKN,QAAQC,EAAYE,GAC/BY,EAAKhD,EAAQ5C,SAASQ,OAAO8D,GAAK9D,OAAOgF,GAAeK,SACxDG,EAAOJ,EAAG5J,SAAS,EAAG,IACtBiK,EAAcd,EAAKd,QAAQF,EAAWG,EAAKsB,EAAG5J,SAAS,GAAI,KAC3DkK,EAAUzL,EAAWqK,EAAYmB,GACjCE,EAAOd,EAAIrF,OAAO,CAAEoG,MAAO,KAAM5F,OAAOc,GAAGd,OAAOsE,GAAYe,SAEpE,OADAtJ,EAAW+H,EAAK2B,EAAcC,EAAiBC,EAAPH,GACjCE,EAAUF,EAAOG,CAAI,EAGxC,CAQA,MAcaE,iBAA4BnB,EAAY,IAdxC,CACTE,QAASkB,EACT1D,QAAS2D,EACTlB,IAAKvE,EACL6B,IAAKhC,EACLuB,IAZJ,SAAkBkE,EAAOI,EAAKrE,GAC1B,OAAOrB,EACFd,OAAO,CAAEoG,UACT5F,OAAOgG,GACPhG,OAAO,IAAI/E,WAAW,CAAC0G,KACvB0D,QACT,MA9OS,CAAEjI,EAAAA,EAAGC,EAAAA,EAAG6E,EAAG,EAAGG,KAAM,EAAGC,KAAM,EAAGC,GAAI,GAAIC,GAAI,EAAGyD,YAAa,OC9B/D7I,EAAI,IAEJC,EAAI,QAIJ6I,EAAI,GAEJC,EAAsC,EAA3BC,KAAKC,OAAOhJ,EAAI,GAAK,IAChCiJ,EAAsC,EAA3BF,KAAKC,OAAOhJ,EAAI,GAAK,IAEzBkJ,EAEN,CAAErE,EAAG,EAAGsE,EAAG,EAAGN,IAAGO,OAAQ,GAAK,GAAIC,OAAQJ,EAAUK,IAAK,GAAIC,IAAK,EAAGC,MAAO,IAG7E1J,EAAWZ,GAAM,IAAIuK,WAAWvK,IAChCmB,IAAEA,EAAGgB,KAAEA,EAAIN,IAAEA,EAAGO,UAAEA,GAAc1B,EAAY,CAC9CG,IACAC,IACAC,EAfM,QAgBNC,cAlBkB,KAmBlBJ,UACAM,SAAS,EACTD,QAAS,IAEPuJ,EAAMxK,GAAMA,EACZiE,EAAY,CAAC5B,EAAG6B,EAAWsG,EAAIC,EAASD,IAAOpI,EAAUC,EAAG,CAC9D9D,OAASR,GAAMmG,EAASuG,EAAO1M,IAC/BgB,OAAShB,GAAM0M,EAAOvG,EAASnG,MAE7BoG,EAAU,CAACxG,EAAGC,KAChB,IAAK,IAAIG,EAAI,EAAGA,EAAIJ,EAAEE,OAAQE,IAC1BJ,EAAEI,GAAKoD,EAAIxD,EAAEI,GAAKH,EAAEG,IACxB,OAAOJ,CAAC,EAENuK,EAAU,CAACvK,EAAGC,KAChB,IAAK,IAAIG,EAAI,EAAGA,EAAIJ,EAAEE,OAAQE,IAC1BJ,EAAEI,GAAKoD,EAAIxD,EAAEI,GAAKH,EAAEG,IACxB,OAAOJ,CAAC,EAEN+M,EAAclJ,IAChB,IAAK,IAAIzD,EAAI,EAAGA,EAAI8C,EAAG9C,IACnByD,EAAEzD,KAAO4L,EACb,OAAOnI,CAAC,EAENmJ,EAAc,CAACnJ,EAAGoJ,KAEpB,IAAK,IAAI7M,EAAI,EAAGA,EAAI8C,EAAG9C,IACnB,GAAI8L,KAAKgB,IAAI1I,EAAKX,EAAEzD,MAAQ6M,EACxB,OAAO,EACf,OAAO,CAAK,EAEVxG,EAAe,CAACzG,EAAGC,KAKrB,MAAMO,EAAIyC,EAAQC,GAClB,IAAK,IAAI9C,EAAI,EAAGA,EAAIJ,EAAEE,OAAQE,IAC1BI,EAAEJ,GAAKoD,EAAIxD,EAAEI,GAAKH,EAAEG,IACxB,OAAOI,CAAC,EAGZ,SAAS2M,EAAW/F,GAEhB,MAAMxF,EAAIqB,EAAQC,GAElB,IAAK,IAAIqB,EAAI,EAAGA,EAAIrB,GAAI,CACpB,MAAMjD,EAAImH,IACV,GAAInH,EAAEC,OAAS,EACX,MAAUyB,MAAM,+BACpB,IAAK,IAAIvB,EAAI,EAAGmE,EAAIrB,GAAK9C,GAAKH,EAAEC,OAAS,EAAGE,GAAK,EAAG,CAChD,MAAM2B,EAAsD,SAAjD9B,EAAEG,EAAI,GAAMH,EAAEG,EAAI,IAAM,EAAMH,EAAEG,EAAI,IAAM,IACjD2B,EAAIoB,IACJvB,EAAE2C,KAAOxC,EACzB,CACA,CACI,OAAOH,CACX,CACA,MAAMwL,EAAQ,IAAIrM,WAAW,GAC7B,SAASsM,GAAarK,GAClB,MAAMgF,EAAEA,EAACsE,EAAEA,EAACC,OAAEA,EAAMC,OAAEA,EAAMC,IAAEA,EAAGC,IAAEA,EAAGC,MAAEA,GAAU3J,GAC5CsK,UAAEA,EAASC,SAAEA,EAAQC,cAAEA,EAAavH,OAAEA,EAAME,OAAEA,GAAWnD,EAC/D,IAAK,CAAC,EAAG,GAAGyK,SAASf,GACjB,MAAU/K,MAAM,aACpB,IAAK,CAAC,GAAK,GAAI,GAAK,IAAI8L,SAASlB,GAC7B,MAAU5K,MAAM,gBACpB,IAAK,CAACsK,EAAUG,GAAUqB,SAASjB,GAC/B,MAAU7K,MAAM,gBACpB,MAAM+L,EAAOjB,EAAMC,EACbiB,EAAa/L,IAEf,MAAMgM,EAAQpK,EAAI5B,GACZiM,EAA+B,EAA1BrJ,EAAKoJ,EAAO,EAAIpB,GAC3B,GAAIoB,EAAQC,GAAO1K,EAAI,EACnB,MAAO,CAAE2K,GAAI,EAAOD,GAAKA,EAAK,EAAK,GAEvC,MAAO,CAAEC,GAD4C,EAA1C5B,KAAKC,OAAOyB,EAAQC,IAAO,EAAIrB,IAC7BqB,KAAI,EAEfE,EAAYnM,GAAM+L,EAAU/L,GAAGkM,GAC/BE,EAAWpM,GAAM+L,EAAU/L,GAAGiM,GAgB9BI,EAAU,CAAC5I,EAAGzD,KAEhB,MAAMsM,EAAIhC,KAAKC,OAAOhJ,EAAI,IAAM,EAAIqJ,KAC9BsB,GAAEA,EAAED,GAAEA,GAAOF,EAAU/L,GAG7B,OAAU,IAANyD,EACOwI,EAAK,EAAqB,EAAjBrK,EAAIsK,EAAK,EAAGI,GAA0B,EAAjB1K,EAAIsK,EAAK,EAAGI,GACzC,EAALJ,CAAM,EAEXK,EAAevM,IAEjB,MAAMgM,EAAQpK,EAAI5B,GACZiM,EAA2B,EAAtBrJ,EAAKoJ,EAAO,MACvB,MAAO,CAAEE,GAAwC,EAApC5B,KAAKC,OAAOyB,EAAQC,GAAM,MAAaA,KAAI,EAEtDO,EAAY,CACd3N,SAAUkM,EAAQ3E,EAClBpH,OAASyE,IACL,IAAU,IAANA,EACA,MAAU1D,MAAM,8BACpB,MAAMb,EAAM,IAAIC,WAAW4L,EAAQ3E,GACnC,IAAK,IAAI5H,EAAI,EAAG+D,EAAI,EAAG/D,EAAI4H,EAAG5H,IAAK,CAC/B,IAAK,IAAImE,EAAI,EAAGA,EAAIrB,EAAGqB,IACH,IAAZc,EAAEjF,GAAGmE,KACLzD,EAAIqD,KAAOI,GACnBzD,EAAI6L,EAAQvM,GAAK+D,CACjC,CACY,OAAOrD,CAAG,EAEdM,OAASC,IACL,MAAMgE,EAAI,GACV,IAAIlB,EAAI,EACR,IAAK,IAAI/D,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAMiO,EAAKpL,EAAQC,GACnB,GAAI7B,EAAIsL,EAAQvM,GAAK+D,GAAK9C,EAAIsL,EAAQvM,GAAKuM,EACvC,OAAO,EACX,IAAK,IAAIpI,EAAIJ,EAAGI,EAAIlD,EAAIsL,EAAQvM,GAAImE,IAAK,CACrC,GAAIA,EAAIJ,GAAK9C,EAAIkD,IAAMlD,EAAIkD,EAAI,GAC3B,OAAO,EACX8J,EAAGhN,EAAIkD,IAAM,CACjC,CACgBJ,EAAI9C,EAAIsL,EAAQvM,GAChBiF,EAAE9D,KAAK8M,EACvB,CACY,IAAK,IAAI9J,EAAIJ,EAAGI,EAAIoI,EAAOpI,IACvB,GAAe,IAAXlD,EAAIkD,GACJ,OAAO,EACf,OAAOc,CAAC,GAGViJ,EAAWhI,EAAkB,IAARoG,EAAY,EAAI,GAAItM,GAAMsM,EAAMtM,IAAIA,IAC3D,MAAOsM,GAAOtM,GAAKA,GAAKsM,GACpB,MAAU/K,MAAM,uBAAuBvB,4BAA4BsM,MAAQA,MAC/E,OAAOtM,CAAC,IAENmO,EAAUjI,EAAU,IAAKlG,GAAM,KAAiBA,IAChDoO,EAAUlI,EAAU,IAEpBmI,EAASnI,EAAUiG,IAAW,GAAK,GAAK,GAAK,IAAKnM,GAAMoE,EAAK+H,EAASnM,KAEtEsO,EAAQlN,EADE8E,EAAUkG,IAAWP,EAAW,EAAI,GACpBjE,GAE1BU,EAAcrI,EAAW,GAAImB,EAASgN,EAASxG,IAC/CW,EAActI,EAAW,GAAI,GAAIkN,EAAU/L,EAAS8M,EAAUhC,GAAI9K,EAAS8M,EAAUtG,GAAIxG,EAAS+M,EAASvG,IAC3G2G,EAAWtO,EAAWmN,EAAehM,EAASiN,EAAQnC,GAAI8B,GAC1DQ,EAA2B,IAARlC,EAClBrK,GAAOA,EAAI,IAAK,EAAKA,EAAI,EACzBA,GAAOA,EAAI,GAAI,EAAIA,EAE1B,SAASwM,EAAezH,GAEpB,MAAMxF,EAAIqB,EAAQC,GAClB,IAAK,IAAIqB,EAAI,EAAGA,EAAIrB,GAAI,CACpB,MAAMjD,EAAImH,IACV,IAAK,IAAIhH,EAAI,EAAGmE,EAAIrB,GAAK9C,EAAIH,EAAEC,OAAQE,GAAK,EAAG,CAE3C,MAAMiH,EAAKuH,EAAwB,GAAP3O,EAAEG,IACxBkH,EAAKsH,EAAkB3O,EAAEG,IAAM,EAAK,KAC/B,IAAPiH,IACAzF,EAAE2C,KAAO8C,GACT9C,EAAIrB,IAAY,IAAPoE,IACT1F,EAAE2C,KAAO+C,EAC7B,CACA,CACQ,OAAO1F,CACf,CACI,MAAMkN,GAAgB7J,IAElB,MAAM8J,EAAM9L,EAAQC,GACd8L,EAAI5I,EAASd,OAAO,CAAA,GAAIQ,OAAOb,GAC/B5D,EAAM,IAAIN,WAAWqF,EAASlB,UACpC8J,EAAEjJ,QAAQ1E,GACV,MAAM4N,EAAQ5N,EAAIoB,MAAM,EAAG,GAC3B,IAAK,IAAIrC,EAAI8C,EAAIuJ,EAAKzL,EAAM,EAAGkO,EAAU,EAAGC,EAAU,EAAG/O,EAAI8C,EAAG9C,IAAK,CACjE,IAAIH,EAAIG,EAAI,EACZ,KAAOH,EAAIG,GACPH,EAAIoB,EAAIL,KACJA,EAAMoF,EAASlB,WAEnB8J,EAAEjJ,QAAQ1E,GACVL,EAAM,GAEV+N,EAAI3O,GAAK2O,EAAI9O,GACb8O,EAAI9O,GAAK,IAAOgP,EAAMC,IAAYC,IAAa,IAAM,GACjDA,GAAW,IACXD,IACAC,EAAU,EAE1B,CACQ,OAAOJ,CAAG,EAERK,GAAkBvL,IACpB,MAAMwL,EAAOpM,EAAQC,GACfoM,EAAOrM,EAAQC,GACrB,IAAK,IAAI9C,EAAI,EAAGA,EAAIyD,EAAE3D,OAAQE,IAAK,CAC/B,MAAMyN,GAAEA,EAAEC,GAAEA,GAAOK,EAAYtK,EAAEzD,IACjCiP,EAAKjP,GAAKyN,EACVyB,EAAKlP,GAAK0N,CACtB,CACQ,MAAO,CAAED,GAAIwB,EAAMvB,GAAIwB,EAAM,EAE3BC,GAAc,CAAC7N,EAAG2D,KACpB,IAAK,IAAIjF,EAAI,EAAGA,EAAI8C,EAAG9C,IACnBsB,EAAEtB,GAAK6N,EAAQ5I,EAAEjF,GAAIsB,EAAEtB,IAC3B,OAAOsB,CAAC,EAEN8N,GAAe,CAACxP,EAAGC,KACrB,MAAMiK,EAAIjH,EAAQC,GAClB,IAAIuM,EAAM,EACV,IAAK,IAAIrP,EAAI,EAAGA,EAAI8C,EAAG9C,IAAK,CACxB,MAAMiF,GAlJIuB,EAkJS5G,EAAEI,GAlJRwB,EAkJY3B,EAAEG,GA/IlBwG,GAAK4F,GAAU5F,EAAIzD,EAAIqJ,GAAW5F,IAAMzD,EAAIqJ,GAAgB,IAAN5K,EAAW,EAAI,GAgJ9EsI,EAAE9J,GAAKiF,EACPoK,GAAOpK,CACnB,CArJqB,IAACuB,EAAGhF,EAsJjB,MAAO,CAAEsI,IAAGuF,MAAK,EAGf5G,GAAYxI,EAAW,GAAI,GAAI,IAE/BqP,GAAW,CACbC,cAJkB,GAKlB1G,OAAQ,CAAChE,EAAOpF,EAAY,OAExB,MAAMqJ,EAAU,IAAInI,WAAW,IAC/BmI,EAAQhI,IAAI+D,GACZiE,EAAQ,IAAMlB,EACdkB,EAAQ,IAAMoD,EACd,MAAOlD,EAAKwG,EAAUC,GAAMhH,GAAUzH,OAAOgF,EAAS8C,EAAS,CAAEwC,MAAO7C,GAAUpI,YAC5EqP,EAAW3J,EAAOyJ,GAClBG,EAAK,GACX,IAAK,IAAI3P,EAAI,EAAGA,EAAIkM,EAAGlM,IACnB2P,EAAGxO,KAAKsN,EAAeiB,EAASpK,IAAQ,IAAJtF,EAAWA,GAAK,EAAK,OAC7D,MAAM4P,EAAK,GACX,IAAK,IAAI5P,EAAIkM,EAAGlM,EAAIkM,EAAItE,EAAG5H,IACvB4P,EAAGzO,KAAKsN,EAAeiB,EAASpK,IAAQ,IAAJtF,EAAWA,GAAK,EAAK,OAC7D,MAAM6P,EAAQF,EAAGG,KAAK9P,GAAM8D,EAAItD,OAAOR,EAAEqC,WACnCqF,EAAK,GACLqI,EAAK,GACL/I,EAAMnB,EAAOmD,GACbrH,EAAIkB,EAAQC,GAClB,IAAK,IAAI9C,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CAExB2B,EAAEZ,KAAK,GACP,IAAK,IAAIoD,EAAI,EAAGA,EAAI+H,EAAG/H,IAAK,CACxB,MAAM6L,EAAMjD,EAAW/F,EAAI1B,IAAInB,EAAGnE,IAClCoG,EAAQzE,EAAG0E,EAAa2J,EAAKH,EAAM1L,IACvD,CACgBL,EAAI9C,OAAOW,GACX,MAAM8L,GAAEA,EAAEC,GAAEA,GAAOsB,GAAe5I,EAAQzE,EAAGiO,EAAG5P,KAChD0H,EAAGvG,KAAKsM,GACRsC,EAAG5O,KAAKuM,EACxB,CACY,MAAMrE,EAAYf,EAAY9H,OAAO,CAACwI,EAAK+G,IACrCE,EAAKjK,EAASqD,EAAW,CAAEiC,MAAO6B,IAClC7D,EAAYf,EAAY/H,OAAO,CAACwI,EAAKyG,EAAIQ,EAAIN,EAAIC,EAAIlI,IAO3D,OANAV,EAAIpB,QACJ8J,EAAS9J,QAITnE,EAAWuH,EAAKwG,EAAUC,EAAIE,EAAIC,EAAIC,EAAOlO,EAAG+F,EAAIqI,EAAIE,EAAInH,GACrD,CAAEO,YAAWC,YAAW,EAGnC4G,KAAM,CAAC5G,EAAWE,EAAK2G,KAGnB,MAAOnH,EAAKoH,EAAIH,EAAIN,EAAIC,EAAIlI,GAAMa,EAAYvH,OAAOsI,GAE/C+G,EAAI,GACJrJ,EAAMnB,EAAOmD,GACnB,IAAK,IAAIhJ,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAMsQ,EAAK,GACX,IAAK,IAAInM,EAAI,EAAGA,EAAI+H,EAAG/H,IACnBmM,EAAGnP,KAAK4L,EAAW/F,EAAI1B,IAAInB,EAAGnE,KAClCqQ,EAAElP,KAAKmP,EACvB,CACYtJ,EAAIpB,QACJ,IAAK,IAAI5F,EAAI,EAAGA,EAAIkM,EAAGlM,IACnB8D,EAAItD,OAAOmP,EAAG3P,IAClB,IAAK,IAAIA,EAAI,EAAGA,EAAI4H,EAAG5H,IACnB8D,EAAItD,OAAOoP,EAAG5P,IACd8D,EAAItD,OAAOkH,EAAG1H,IAGlB,MAAMuQ,EAAKvK,EAASd,OAAO,CAAEoG,MAAO4B,IAAaxH,OAAOuK,GAAIvK,OAAO8D,GAAKuB,SAElEyF,EAAML,GAAkB,IAAIxP,WAAW,IAC7CpB,EAAYiR,GACZ,MAAMC,EAAWzK,EACZd,OAAO,CAAEoG,MAAO4B,IAChBxH,OAAO0K,GACP1K,OAAO8K,GACP9K,OAAO6K,GACPxF,SACLxL,EAAYkR,EAAUvD,GACtB,MAAMwD,EAAO3K,EAAO0K,EAAUpC,EAAOhO,UAErCsQ,EAAW,IAAK,IAAIC,EAAQ,IAAK,CAC7B,MAAMpL,EAAI,GAEV,IAAK,IAAIxF,EAAI,EAAGA,EAAIkM,EAAGlM,IAAK4Q,IACxBpL,EAAErE,KAAKkN,EAAOrN,OAAO0P,EAAKpL,IAAY,IAARsL,EAAcA,GAAS,EAAhCF,KACzB,MAAMlK,EAAIhB,EAAEsK,KAAK9P,GAAM8D,EAAItD,OAAOR,EAAEqC,WAC9BwO,EAAI,GACV,IAAK,IAAI7Q,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CAExB,MAAM8Q,EAAKjO,EAAQC,GACnB,IAAK,IAAIqB,EAAI,EAAGA,EAAI+H,EAAG/H,IACnBiC,EAAQ0K,EAAIzK,EAAagK,EAAErQ,GAAGmE,GAAIqC,EAAErC,KACxCL,EAAI9C,OAAO8P,GACXD,EAAE1P,KAAK2P,EAC3B,CACgB,MAAMC,EAAKF,EAAEf,KAAK3L,GAAMA,EAAE2L,IAAInC,KAExBqD,EAAShL,EACVd,OAAO,CAAEoG,MAAO8B,IAChB1H,OAAO6K,GACP7K,OAAO4I,EAAM9N,OAAOuQ,IACpBhG,SAECkG,EAAOnN,EAAItD,OAAOkO,GAAasC,IAE/BE,EAAMvB,EAAGG,KAAK9P,GAAMqG,EAAarG,EAAGiR,KAC1C,IAAK,IAAIjR,EAAI,EAAGA,EAAIkM,EAAGlM,IAEnB,GADAoG,EAAQtC,EAAI9C,OAAOkQ,EAAIlR,IAAKwF,EAAExF,IAC1B4M,EAAYsE,EAAIlR,GAAImM,EAASmB,GAC7B,SAASqD,EAGjB,IAAItB,EAAM,EACV,MAAMpK,EAAI,GACV,IAAK,IAAIjF,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAMmR,EAAMrN,EAAI9C,OAAOqF,EAAauJ,EAAG5P,GAAIiR,IACrCxD,EAAKtD,EAAQ0G,EAAE7Q,GAAImR,GAAKrB,IAAIlC,GAClC,GAAIhB,EAAYa,EAAIrB,EAASkB,GACzB,SAASqD,EACb,MAAMS,EAAMtN,EAAI9C,OAAOqF,EAAaqB,EAAG1H,GAAIiR,IAC3C,GAAIrE,EAAYwE,EAAKhF,GACjB,SAASuE,EACbvK,EAAQqH,EAAI2D,GAEZ,MAAMC,EAAOjC,GAAa3B,EAAIsD,EAAG/Q,IACjCiF,EAAE9D,KAAKkQ,EAAKvH,GACZuF,GAAOgC,EAAKhC,GAChC,CACgB,GAAIA,EAAM9C,EACN,SACJmE,EAAK9K,QACL,MAAMlF,EAAM6N,EAAS/N,OAAO,CAACwQ,EAAQE,EAAKjM,IAG1C,OADAxD,EAAWuP,EAAQE,EAAKjM,EAAGgM,EAAMF,EAAIF,EAAGrK,EAAGhB,EAAGiL,EAAUF,EAAIZ,EAAIC,EAAIlI,KAAO2I,GACpE3P,CACvB,CAEY,MAAUa,MAAM,mDAAmD,EAEvEmL,OAAQ,CAACrD,EAAWG,EAAK8H,KAErB,MAAOtI,EAAK+G,GAAMzH,EAAYtH,OAAOqI,GAC/B4G,EAAKjK,EAASqD,EAAW,CAAEiC,MAAO6B,IACxC,GAAImE,EAAIxR,SAAWyO,EAASlO,SACxB,OAAO,EACX,MAAO2Q,EAAQxK,EAAGvB,GAAKsJ,EAASvN,OAAOsQ,GACvC,IAAU,IAANrM,EACA,OAAO,EACX,IAAK,IAAIjF,EAAI,EAAGA,EAAIkM,EAAGlM,IACnB,GAAI4M,EAAYpG,EAAExG,GAAImM,EAASmB,GAC3B,OAAO,EACf,MAAMiD,EAAKvK,EAASd,OAAO,CAAEoG,MAAO4B,IAAaxH,OAAOuK,GAAIvK,OAAO8D,GAAKuB,SAElE3K,EAAI0D,EAAItD,OAAOkO,GAAasC,IAC5BO,EAAO/K,EAAEsJ,KAAK9P,GAAMA,EAAEqC,UAC5B,IAAK,IAAIrC,EAAI,EAAGA,EAAIkM,EAAGlM,IACnB8D,EAAItD,OAAO+Q,EAAKvR,IACpB,MAAMwR,EAAS,GACTxK,EAAMnB,EAAOmD,GACnB,IAAK,IAAIhJ,EAAI,EAAGA,EAAI4H,EAAG5H,IAAK,CACxB,MAAMyR,EAAQpL,EAAavC,EAAItD,OAAOmM,EAAWoD,EAAG/P,KAAMI,GACpDsR,EAAK7O,EAAQC,GACnB,IAAK,IAAIqB,EAAI,EAAGA,EAAI+H,EAAG/H,IAAK,CACxB,MAAM6L,EAAMjD,EAAW/F,EAAI1B,IAAInB,EAAGnE,IAClCoG,EAAQsL,EAAIrL,EAAa2J,EAAKuB,EAAKpN,IACvD,CAEgB,MAAMwN,EAAU7N,EAAI9C,OAAOmJ,EAAQuH,EAAID,IAEvCD,EAAOrQ,KAAKgO,GAAYwC,EAAS1M,EAAEjF,IACnD,CACYgH,EAAIpB,QAEJ,MAAMgM,EAAK5L,EACNd,OAAO,CAAEoG,MAAO8B,IAChB1H,OAAO6K,GACP7K,OAAO4I,EAAM9N,OAAOgR,IACpBzG,SAGL,IAAK,MAAMpJ,KAAKsD,EAAG,CAEf,KADYtD,EAAErB,QAAO,CAACuR,EAAK7R,IAAM6R,EAAM7R,GAAG,IAC7BuM,GACT,OAAO,CAC3B,CACY,IAAK,MAAM5K,KAAK6E,EACZ,GAAIoG,EAAYjL,EAAGwK,EAASmB,GACxB,OAAO,EACf,OAAO3N,EAAWqR,EAAQY,EAAG,GAG/BE,GAAa,CAACtI,EAAKuI,EAAM/E,KAG3B,GAFAzN,EAAYiK,GACZjK,EAAYwS,GACRA,EAAIjS,OAAS,IACb,MAAUyB,MAAM,yCACpB,OAAOyQ,EAAY,IAAIrR,WAAW,CAAC,EAAGoR,EAAIjS,SAAUiS,EAAKvI,EAAI,EAGjE,MAAO,CACH8F,YACAzG,OAAQyG,GAASzG,OACjB0G,cAAeD,GAASC,cACxBW,KAAM,CAAC5G,EAAWE,EAAKuI,EAAM/E,EAAOmD,KAChC,MAAM8B,EAAIH,GAAWtI,EAAKuI,GACpBrR,EAAM4O,GAASY,KAAK5G,EAAW2I,EAAG9B,GAExC,OADA8B,EAAElR,KAAK,GACAL,CAAG,EAEdgM,OAAQ,CAACrD,EAAWG,EAAK8H,EAAKS,EAAM/E,IACzBsC,GAAS5C,OAAOrD,EAAWyI,GAAWtI,EAAKuI,GAAMT,GAGpE,CAUY,MAACY,kBAA2BjF,GAAa,IAC9ChB,EACHiB,UAAW,GACXC,SAAU,GACVC,cAAe,GACfvH,SACAE","x_google_ignoreList":[0,1,2,3]}