\n * These objects are the currency accepted by SJCL's crypto functions.\n *

\n *\n *

\n * Most of our crypto primitives operate on arrays of 4-byte words internally,\n * but many of them can take arguments that are not a multiple of 4 bytes.\n * This library encodes arrays of bits (whose size need not be a multiple of 8\n * bits) as arrays of 32-bit words. The bits are packed, big-endian, into an\n * array of words, 32 bits at a time. Since the words are double-precision\n * floating point numbers, they fit some extra data. We use this (in a private,\n * possibly-changing manner) to encode the number of bits actually present\n * in the last word of the array.\n *

\n *\n *

\n * Because bitwise ops clear this out-of-band data, these arrays can be passed\n * to ciphers like AES which want arrays of words.\n *

\n */\nsjcl.bitArray = {\n /**\n * Array slices in units of bits.\n * @param {bitArray} a The array to slice.\n * @param {Number} bstart The offset to the start of the slice, in bits.\n * @param {Number} bend The offset to the end of the slice, in bits. If this is undefined,\n * slice until the end of the array.\n * @return {bitArray} The requested slice.\n */\n bitSlice: function(a, bstart, bend) {\n a = sjcl.bitArray\n ._shiftRight(a.slice(bstart / 32), 32 - (bstart & 31))\n .slice(1);\n return bend === undefined ? a : sjcl.bitArray.clamp(a, bend - bstart);\n },\n\n /**\n * Extract a number packed into a bit array.\n * @param {bitArray} a The array to slice.\n * @param {Number} bstart The offset to the start of the slice, in bits.\n * @param {Number} blength The length of the number to extract.\n * @return {Number} The requested slice.\n */\n extract: function(a, bstart, blength) {\n // FIXME: this Math.floor is not necessary at all, but for some reason\n // seems to suppress a bug in the Chromium JIT.\n var x,\n sh = Math.floor((-bstart - blength) & 31);\n if (((bstart + blength - 1) ^ bstart) & -32) {\n // it crosses a boundary\n x = (a[(bstart / 32) | 0] << (32 - sh)) ^ (a[(bstart / 32 + 1) | 0] >>> sh);\n } else {\n // within a single word\n x = a[(bstart / 32) | 0] >>> sh;\n }\n return x & ((1 << blength) - 1);\n },\n\n /**\n * Concatenate two bit arrays.\n * @param {bitArray} a1 The first array.\n * @param {bitArray} a2 The second array.\n * @return {bitArray} The concatenation of a1 and a2.\n */\n concat: function(a1, a2) {\n if (a1.length === 0 || a2.length === 0) {\n return a1.concat(a2);\n }\n\n var last = a1[a1.length - 1],\n shift = sjcl.bitArray.getPartial(last);\n if (shift === 32) {\n return a1.concat(a2);\n } else {\n return sjcl.bitArray._shiftRight(\n a2,\n shift,\n last | 0,\n a1.slice(0, a1.length - 1),\n );\n }\n },\n\n /**\n * Find the length of an array of bits.\n * @param {bitArray} a The array.\n * @return {Number} The length of a, in bits.\n */\n bitLength: function(a) {\n var l = a.length,\n x;\n if (l === 0) {\n return 0;\n }\n x = a[l - 1];\n return (l - 1) * 32 + sjcl.bitArray.getPartial(x);\n },\n\n /**\n * Truncate an array.\n * @param {bitArray} a The array.\n * @param {Number} len The length to truncate to, in bits.\n * @return {bitArray} A new array, truncated to len bits.\n */\n clamp: function(a, len) {\n if (a.length * 32 < len) {\n return a;\n }\n a = a.slice(0, Math.ceil(len / 32));\n var l = a.length;\n len = len & 31;\n if (l > 0 && len) {\n a[l - 1] = sjcl.bitArray.partial(\n len,\n a[l - 1] & (0x80000000 >> (len - 1)),\n 1,\n );\n }\n return a;\n },\n\n /**\n * Make a partial word for a bit array.\n * @param {Number} len The number of bits in the word.\n * @param {Number} x The bits.\n * @param {Number} [_end=0] Pass 1 if x has already been shifted to the high side.\n * @return {Number} The partial word.\n */\n partial: function(len, x, _end) {\n if (len === 32) {\n return x;\n }\n return (_end ? x | 0 : x << (32 - len)) + len * 0x10000000000;\n },\n\n /**\n * Get the number of bits used by a partial word.\n * @param {Number} x The partial word.\n * @return {Number} The number of bits used by the partial word.\n */\n getPartial: function(x) {\n return Math.round(x / 0x10000000000) || 32;\n },\n\n /**\n * Compare two arrays for equality in a predictable amount of time.\n * @param {bitArray} a The first array.\n * @param {bitArray} b The second array.\n * @return {boolean} true if a == b; false otherwise.\n */\n equal: function(a, b) {\n if (sjcl.bitArray.bitLength(a) !== sjcl.bitArray.bitLength(b)) {\n return false;\n }\n var x = 0,\n i;\n for (i = 0; i < a.length; i++) {\n x |= a[i] ^ b[i];\n }\n return x === 0;\n },\n\n /** Shift an array right.\n * @param {bitArray} a The array to shift.\n * @param {Number} shift The number of bits to shift.\n * @param {Number} [carry=0] A byte to carry in\n * @param {bitArray} [out=[]] An array to prepend to the output.\n * @private\n */\n _shiftRight: function(a, shift, carry, out) {\n var i,\n last2 = 0,\n shift2;\n if (out === undefined) {\n out = [];\n }\n\n for (; shift >= 32; shift -= 32) {\n out.push(carry);\n carry = 0;\n }\n if (shift === 0) {\n return out.concat(a);\n }\n\n for (i = 0; i < a.length; i++) {\n out.push(carry | (a[i] >>> shift));\n carry = a[i] << (32 - shift);\n }\n last2 = a.length ? a[a.length - 1] : 0;\n shift2 = sjcl.bitArray.getPartial(last2);\n out.push(\n sjcl.bitArray.partial(\n (shift + shift2) & 31,\n shift + shift2 > 32 ? carry : out.pop(),\n 1,\n ),\n );\n return out;\n },\n\n /** xor a block of 4 words together.\n * @private\n */\n _xor4: function(x, y) {\n return [x[0] ^ y[0], x[1] ^ y[1], x[2] ^ y[2], x[3] ^ y[3]];\n },\n\n /** byteswap a word array inplace.\n * (does not handle partial words)\n * @param {sjcl.bitArray} a word array\n * @return {sjcl.bitArray} byteswapped array\n */\n byteswapM: function(a) {\n var i,\n v,\n m = 0xff00;\n for (i = 0; i < a.length; ++i) {\n v = a[i];\n a[i] = (v >>> 24) | ((v >>> 8) & m) | ((v & m) << 8) | (v << 24);\n }\n return a;\n },\n};",[],[295,320],{"_105":328,"_98":329,"_150":330,"_152":296,"_153":136,"_154":331,"_156":157,"_107":332,"_102":173,"_160":174,"_162":333,"_163":25,"_164":-5,"_165":334,"_101":335},"0a40256e-717d-11f0-bbcd-0224a6c84d84","brsa.js","031a79ec-717d-11f0-b9e8-0224a6c84d84",61,["D",1754344230520],"// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors.\n// Copyright (c) 2017-2022, Privacy Pass Team, Cloudflare, Inc., and other contributors. All rights reserved.\n\nimport * as b64 from \"./b64.js\";\nimport * as bignum from \"./bignum.js\";\nimport * as bitarray from \"./bitarray.js\";\nimport * as bytes from \"./bytes.js\";\n\nconst sjcl = {\n ...b64.sjcl,\n ...bignum.sjcl,\n ...bitarray.sjcl,\n ...bytes.sjcl,\n};\n\n// rfc: datatracker.ietf.org/doc/html/draft-irtf-cfrg-rsa-blind-signatures-13\n// ref: cathieyun.medium.com/adventures-with-rsa-blind-signing-397035585121\n// from: github.com/privacypass/challenge-bypass-extension/blob/732205c052/src/blindrsa/blindrsa.ts\n/**\n * Blind a message using RSA-PSS.\n * @param {CryptoKey} publicKey RSA public key.\n * @param {Uint8Array} msg Message to be blinded.\n * @param {number} saltLength Length of the salt to be used in the PSS encoding.\n * @returns {Promise<{blindedMsg: Uint8Array, blindInv: Uint8Array}>} Blinded message and blinding inverse.\n * @throws {Error} If the key is not RSA-PSS or is not extractable.\n */\nexport async function blind(publicKey, msg, saltLength = 16) {\n if (publicKey.type !== \"public\" || publicKey.algorithm.name !== \"RSA-PSS\") {\n throw new Error(\"key is not RSA-PSS\");\n }\n if (!publicKey.extractable) {\n throw new Error(\"key is not extractable\");\n }\n /** @type {{modulusLength: number, hash: Algorithm}} */\n const { modulusLength, hash: hashFn } = publicKey.algorithm;\n const kBits = modulusLength;\n const kLen = Math.ceil(kBits / 8);\n const hash = hashFn.name;\n\n // 1. encoded_msg = EMSA-PSS-ENCODE(msg, kBits - 1)\n // with MGF and HF as defined in the parameters\n // 2. If EMSA-PSS-ENCODE raises an error, raise the error and stop\n const encoded_msg = await emsa_pss_encode(msg, kBits - 1, {\n sLen: saltLength,\n hash,\n });\n\n // 3. m = bytes_to_int(encoded_msg)\n const m = os2ip(encoded_msg);\n const jwkKey = await crypto.subtle.exportKey(\"jwk\", publicKey);\n if (!jwkKey.n || !jwkKey.e) {\n throw new Error(\"key has invalid parameters\");\n }\n const n = sjcl.bn.fromBits(sjcl.codec.base64url.toBits(jwkKey.n));\n const e = sjcl.bn.fromBits(sjcl.codec.base64url.toBits(jwkKey.e));\n\n // 4. r = random_integer_uniform(1, n)\n /** @type {sjcl.bn} */\n let r;\n do {\n r = os2ip(crypto.getRandomValues(new Uint8Array(kLen)));\n } while (r.greaterEquals(n));\n\n // 5. r_inv = inverse_mod(r, n)\n // 6. If inverse_mod fails, raise an \"invalid blind\" error\n // and stop\n /** @type {sjcl.bn} */\n let r_inv;\n try {\n r_inv = r.inverseMod(n);\n } catch (e) {\n throw new Error(\"invalid blind\");\n }\n // 7. x = RSAVP1(pkS, r)\n const x = rsavp1({ n, e }, r);\n\n // 8. z = m * x mod n\n const z = m.mulmod(x, n);\n\n // 9. blinded_msg = int_to_bytes(z, kLen)\n const blindedMsg = i2osp(z, kLen);\n\n // 10. inv = int_to_bytes(r_inv, kLen)\n const blindInv = i2osp(r_inv, kLen);\n\n // 11. output blinded_msg, inv\n return { blindedMsg, blindInv };\n}\n\n/**\n * @param {CryptoKey} publicKey\n * @param {Uint8Array} msg\n * @param {Uint8Array} blindInv\n * @param {Uint8Array} blindSig\n * @param {number} saltLength\n * @returns {Promise}\n */\nexport async function finalize(\n publicKey,\n msg,\n blindInv,\n blindSig,\n saltLength = 16,\n) {\n if (publicKey.type !== \"public\" || publicKey.algorithm.name !== \"RSA-PSS\") {\n throw new Error(\"key is not RSA-PSS\");\n }\n if (!publicKey.extractable) {\n throw new Error(\"key is not extractable\");\n }\n // RsaHashedKeyGenParams\n const { modulusLength } = publicKey.algorithm;\n const kLen = Math.ceil(modulusLength / 8);\n\n // 1. If len(blind_sig) != kLen, raise \"unexpected input size\" and stop\n // 2. If len(inv) != kLen, raise \"unexpected input size\" and stop\n if (blindSig.length != kLen || blindInv.length != kLen) {\n throw new Error(\"unexpected input size\");\n }\n\n // 3. z = bytes_to_int(blind_sig)\n const z = os2ip(blindSig);\n\n // 4. r_inv = bytes_to_int(inv)\n const r_inv = os2ip(blindInv);\n\n // 5. s = z * r_inv mod n\n const jwkKey = await crypto.subtle.exportKey(\"jwk\", publicKey);\n if (!jwkKey.n) {\n throw new Error(\"key has invalid parameters\");\n }\n const n = sjcl.bn.fromBits(sjcl.codec.base64url.toBits(jwkKey.n));\n const s = z.mulmod(r_inv, n);\n\n // 6. sig = int_to_bytes(s, kLen)\n const sig = i2osp(s, kLen);\n\n // 7. result = RSASSA-PSS-VERIFY(pkS, msg, sig)\n // 8. If result = \"valid signature\", output sig, else\n // raise \"invalid signature\" and stop\n const ok = await verify(publicKey, msg, sig, saltLength);\n if (!ok) {\n throw new Error(\"invalid signature\");\n }\n return sig;\n}\n\n/**\n * @param {CryptoKey} publicKey\n * @param {AlgorithmIdentifier} algorithm\n * @param {Uint8Array} msg\n * @param {Uint8Array} sig\n * @param {number} saltLength\n * @returns {Promise}\n */\nexport async function verify(publicKey, msg, sig, saltLength = 16) {\n const alg = { name: \"RSA-PSS\", saltLength };\n return crypto.subtle.verify(alg, publicKey, sig, msg);\n}\n\n/**\n * @param {CryptoKey} privateKey\n * @param {Uint8Array} blindMsg\n * @returns {Promise}\n */\nexport async function blindSign(privateKey, blindMsg) {\n if (\n privateKey.type !== \"private\"\n || privateKey.algorithm.name !== \"RSA-PSS\"\n ) {\n throw new Error(\"key is not RSA-PSS\");\n }\n if (!privateKey.extractable) {\n throw new Error(\"key is not extractable\");\n }\n const { modulusLength } = privateKey.algorithm;\n const kLen = Math.ceil(modulusLength / 8);\n\n // 1. If len(blinded_msg) != kLen, raise \"unexpected input size\"\n // and stop\n if (blindMsg.length != kLen) {\n throw new Error(\"unexpected input size\");\n }\n\n // 2. m = bytes_to_int(blinded_msg)\n const m = os2ip(blindMsg);\n\n // 3. If m >= n, raise \"invalid message length\" and stop\n const jwkKey = await crypto.subtle.exportKey(\"jwk\", privateKey);\n if (!jwkKey.n || !jwkKey.d) {\n throw new Error(\"key is not a private key\");\n }\n const n = sjcl.bn.fromBits(sjcl.codec.base64url.toBits(jwkKey.n));\n const d = sjcl.bn.fromBits(sjcl.codec.base64url.toBits(jwkKey.d));\n if (m.greaterEquals(n)) {\n throw new Error(\"invalid message length\");\n }\n\n // 4. s = RSASP1(skS, m)\n const s = rsasp1({ n, d }, m);\n\n // 5. blind_sig = int_to_bytes(s, kLen)\n // 6. output blind_sig\n return i2osp(s, kLen);\n}\n\n// from: github.com/privacypass/challenge-bypass-extension/blob/732205c052/src/blindrsa/util.ts\n\n// RSAVP1\n// https://www.rfc-editor.org/rfc/rfc3447.html#section-5.2.2\n/**\n * @param {{ n: sjcl.bn; e: sjcl.bn }} pkS\n * @param {sjcl.bn} s\n * @returns {sjcl.bn}\n */\nexport function rsavp1(pkS, s) {\n // 1. If the signature representative s is not between 0 and n - 1,\n // output \"signature representative out of range\" and stop.\n if (!s.greaterEquals(new sjcl.bn(0)) || s.greaterEquals(pkS.n) == 1) {\n throw new Error(\"sig out of range\");\n }\n // 2. Let m = s^e mod n.\n const m = s.powermod(pkS.e, pkS.n);\n // 3. Output m.\n return m;\n}\n\n// RSASP1\n// https://www.rfc-editor.org/rfc/rfc3447.html#section-5.2.1\n/**\n * @param {{ n: sjcl.bn; d: sjcl.bn }} skS\n * @param {sjcl.bn} m\n * @returns {sjcl.bn}\n */\nexport function rsasp1(skS, m) {\n // 1. If the message representative m is not between 0 and n - 1,\n // output \"message representative out of range\" and stop.\n if (!m.greaterEquals(new sjcl.bn(0)) || m.greaterEquals(skS.n) == 1) {\n throw new Error(\"signature representative out of range\");\n }\n // 2. The signature representative s is computed as follows.\n // If the first form (n, d) of K is used, let s = m^d mod n.\n const s = m.powermod(skS.d, skS.n);\n // 3. Output s.\n return s;\n}\n\n/**\n * @param {Uint8Array} bytes\n * @returns {sjcl.bn}\n */\nexport function os2ip(bytes) {\n return sjcl.bn.fromBits(sjcl.codec.bytes.toBits(bytes));\n}\n\n/**\n * @param {sjcl.bn} num\n * @param {number} byteLength\n * @returns {Uint8Array}\n */\nexport function i2osp(num, byteLength) {\n if (Math.ceil(num.bitLength() / 8) > byteLength) {\n throw new Error(`number does not fit in ${byteLength} bytes`);\n }\n const bytes = new Uint8Array(byteLength);\n const unpadded = new Uint8Array(\n sjcl.codec.bytes.fromBits(num.toBits(undefined), false),\n );\n bytes.set(unpadded, byteLength - unpadded.length);\n return bytes;\n}\n\n// EMSA-PSS-ENCODE (M, emBits)\n//\n// https://www.rfc-editor.org/rfc/rfc3447.html#section-9.1.1\n//\n// Input:\n// M message to be encoded, an octet string\n// emBits maximal bit length of the integer OS2IP (EM) (see Section\n// 4.2), at least 8hLen + 8sLen + 9\n// MGF mask generation function\n//\n// Output:\n// EM encoded message, an octet string of length emLen = \\ceil\n// (emBits/8)\n//\n// Errors: \"encoding error\"; \"message too long\"\n/**\n * @param {Uint8Array} msg\n * @param {number} emBits\n * @param {{ hash: string; sLen: number }} opts\n * @param {MGFFn} mgf\n * @returns {Promise}\n */\nexport async function emsa_pss_encode(msg, emBits, opts, mgf = mgf1) {\n const { hash, sLen } = opts;\n const hashParams = getHashParams(hash);\n const { hLen } = hashParams;\n const emLen = Math.ceil(emBits / 8);\n\n // 1. If the length of M is greater than the input limitation for the\n // hash function (2^61 - 1 octets for SHA-1), output \"message too\n // long\" and stop.\n //\n // 2. Let mHash = Hash(M), an octet string of length hLen.\n const mHash = new Uint8Array(await crypto.subtle.digest(hash, msg));\n // 3. If emLen < hLen + sLen + 2, output \"encoding error\" and stop.\n if (emLen < hLen + sLen + 2) {\n throw new Error(\"encoding error\");\n }\n // 4. Generate a random octet string salt of length sLen; if sLen = 0,\n // then salt is the empty string.\n const salt = crypto.getRandomValues(new Uint8Array(sLen));\n // 5. Let\n // M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt;\n //\n // M' is an octet string of length 8 + hLen + sLen with eight\n // initial zero octets.\n //\n const mPrime = concat([new Uint8Array(8), mHash, salt]);\n // 6. Let H = Hash(M'), an octet string of length hLen.\n const h = new Uint8Array(await crypto.subtle.digest(hash, mPrime));\n // 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2\n // zero octets. The length of PS may be 0.\n const ps = new Uint8Array(emLen - sLen - hLen - 2);\n // 8. Let DB = PS || 0x01 || salt; DB is an octet string of length\n // emLen - hLen - 1.\n const db = concat([ps, Uint8Array.of(0x01), salt]);\n // 9. Let dbMask = MGF(H, emLen - hLen - 1).\n const dbMask = await mgf(hashParams, h, emLen - hLen - 1);\n // 10. Let maskedDB = DB \\xor dbMask.\n const maskedDB = xor(db, dbMask);\n // 11. Set the leftmost 8emLen - emBits bits of the leftmost octet\n // in maskedDB to zero.\n maskedDB[0] &= 0xff >> (8 * emLen - emBits);\n // 12. Let EM = maskedDB || H || 0xbc.\n const em = concat([maskedDB, h, Uint8Array.of(0xbc)]);\n\n // 13. Output EM.\n return em;\n}\n\n/**\n * @param {string} hash\n * @returns {HashParams}\n */\nfunction getHashParams(hash) {\n switch (hash) {\n case \"SHA-1\":\n return { name: hash, hLen: 20 };\n case \"SHA-256\":\n return { name: hash, hLen: 32 };\n case \"SHA-384\":\n return { name: hash, hLen: 48 };\n case \"SHA-512\":\n return { name: hash, hLen: 64 };\n default:\n throw new Error(`unexpected hash id: ${hash}`);\n }\n}\n\n/**\n * @param {Uint8Array[]} a\n * @returns {Uint8Array}\n */\nexport function concat(a) {\n let size = 0;\n for (let i = 0; i < a.length; i++) {\n size += a[i].length;\n }\n const ret = new Uint8Array(new ArrayBuffer(size));\n for (let i = 0, offset = 0; i < a.length; i++) {\n ret.set(a[i], offset);\n offset += a[i].length;\n }\n return ret;\n}\n\n/**\n * @param {Uint8Array} a\n * @param {Uint8Array} b\n * @returns {Uint8Array}\n */\nexport function xor(a, b) {\n if (a.length !== b.length || a.length === 0) {\n throw new Error(\"arrays of different length\");\n }\n const n = a.length;\n const c = new Uint8Array(n);\n for (let i = 0; i < n; i++) {\n c[i] = a[i] ^ b[i];\n }\n return c;\n}\n\n/**\n * @param {Uint8Array} c\n */\nfunction incCounter(c) {\n c[3]++;\n if (c[3] != 0) {\n return;\n }\n c[2]++;\n if (c[2] != 0) {\n return;\n }\n c[1]++;\n if (c[1] != 0) {\n return;\n }\n c[0]++;\n}\n\n/**\n * @typedef {(h: HashParams, seed: Uint8Array, mLen: number) => Promise} MGFFn\n * @typedef { name: string; hLen: number } HashParams\n */\n\n// MGF1 (mgfSeed, maskLen)\n//\n// https://www.rfc-editor.org/rfc/rfc8017#appendix-B.2.1\n//\n// Options:\n// Hash hash function (hLen denotes the length in octets of\n// the hash function output)\n//\n// Input:\n// mgfSeed seed from which mask is generated, an octet string\n// maskLen intended length in octets of the mask, at most 2^32 hLen\n//\n// Output:\n// mask mask, an octet string of length maskLen\n//\n// Error: \"mask too long\"\n/**\n * @param {HashParams} h\n * @param {Uint8Array} seed\n * @param {number} mLen\n * @returns {Promise}\n */\nasync function mgf1(h, seed, mLen) {\n // 1. If maskLen > 2^32 hLen, output \"mask too long\" and stop.\n const n = Math.ceil(mLen / h.hLen);\n if (n > Math.pow(2, 32)) {\n throw new Error(\"mask too long\");\n }\n\n // 2. Let T be the empty octet string.\n let T = new Uint8Array();\n\n // 3. For counter from 0 to \\ceil (maskLen / hLen) - 1, do the\n // following:\n const counter = new Uint8Array(4);\n for (let i = 0; i < n; i++) {\n // A. Convert counter to an octet string C of length 4 octets (see\n // Section 4.1):\n //\n // C = I2OSP (counter, 4) .\n // B. Concatenate the hash of the seed mgfSeed and C to the octet\n // string T:\n //\n // T = T || Hash(mgfSeed || C) .\n const hash = new Uint8Array(\n await crypto.subtle.digest(h.name, concat([seed, counter])),\n );\n T = concat([T, hash]);\n incCounter(counter);\n }\n\n // 4. Output the leading maskLen octets of T as the octet string mask.\n return T.subarray(0, mLen);\n}",[],[295,329],{"_105":337,"_98":338,"_150":339,"_152":296,"_153":136,"_154":340,"_156":157,"_107":341,"_102":173,"_160":174,"_162":342,"_163":25,"_164":-5,"_165":343,"_101":344},"182928ec-717d-11f0-8c74-0224a6c84d84","bytes.js","10ea25ae-717d-11f0-8c29-0224a6c84d84",64,["D",1754344253856],"// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors.\n// Copyright (c) 2009-2015, Emily Stark, Mike Hamburg, and Dan Boneh at Stanford University. All rights reserved.\n\n// from: github.com/bitwiseshiftleft/sjcl/blob/85caa53c281e/core/codecBytes.js\n\n/** @fileOverview Bit array codec implementations.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\nimport * as b64 from \"./b64.js\";\nimport * as bitarray from \"./bitarray.js\";\n\nexport const sjcl = {\n ...b64.sjcl,\n ...bitarray.sjcl,\n};\n\n/**\n * Arrays of bytes\n * @namespace\n */\nsjcl.codec.bytes = {\n /** Convert from a bitArray to an array of bytes. */\n fromBits: function(arr) {\n var out = [],\n bl = sjcl.bitArray.bitLength(arr),\n i,\n tmp;\n for (i = 0; i < bl / 8; i++) {\n if ((i & 3) === 0) {\n tmp = arr[i / 4];\n }\n out.push(tmp >>> 24);\n tmp <<= 8;\n }\n return out;\n },\n /** Convert from an array of bytes to a bitArray. */\n toBits: function(bytes) {\n var out = [],\n i,\n tmp = 0;\n for (i = 0; i < bytes.length; i++) {\n tmp = (tmp << 8) | bytes[i];\n if ((i & 3) === 3) {\n out.push(tmp);\n tmp = 0;\n }\n }\n if (i & 3) {\n out.push(sjcl.bitArray.partial(8 * (i & 3), tmp));\n }\n return out;\n },\n};",[],[295,338],[295],{"_105":347,"_98":348,"_150":349,"_152":-5,"_153":136,"_154":350,"_156":157,"_107":351,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":352,"_101":371},"23e66596-717d-11f0-b9e8-0224a6c84d84","webcrypto","214f51d0-717d-11f0-8d5d-0224a6c84d84",66,["D",1754344273550],[353,362],{"_105":354,"_98":355,"_150":356,"_152":349,"_153":136,"_154":357,"_156":157,"_107":358,"_102":173,"_160":174,"_162":359,"_163":25,"_164":-5,"_165":360,"_101":361},"33b35dd0-717d-11f0-8ca1-0224a6c84d84","blindrsa.js","2c826b28-717d-11f0-be68-0224a6c84d84",69,["D",1754344300059],"// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors.\n\nexport async function genkey() {\n // generate the private key for rsa-pss\n const ck = await crypto.subtle.generateKey(\n {\n name: \"RSA-PSS\",\n modulusLength: 2048, // can be 1024, 2048, or 4096\n publicExponent: new Uint8Array([0x01, 0x00, 0x01]),\n hash: { name: \"SHA-384\" }, // can be \"SHA-1\", \"SHA-256\", \"SHA-384\", or \"SHA-512\"\n },\n true, // whether the key is extractable (i.e. can be used in exportKey)\n [\"sign\", \"verify\"], // can be any combination of \"sign\" and \"verify\"\n );\n const privjwk = await crypto.subtle.exportKey(\"jwk\", ck.privateKey);\n const pubjwk = await crypto.subtle.exportKey(\"jwk\", ck.publicKey);\n const privstr = JSON.stringify(privjwk);\n const pubstr = JSON.stringify(pubjwk);\n return [privstr, pubstr];\n}\n\nexport async function importkey(privjwkstr, pubjwkstr) {\n const privjwk = JSON.parse(privjwkstr);\n const pubjwk = JSON.parse(pubjwkstr);\n const privkey = await crypto.subtle.importKey(\n \"jwk\",\n privjwk,\n {\n name: \"RSA-PSS\",\n hash: { name: \"SHA-384\" },\n },\n true,\n [\"sign\"],\n );\n const pubkey = await crypto.subtle.importKey(\n \"jwk\",\n pubjwk,\n {\n name: \"RSA-PSS\",\n hash: { name: \"SHA-384\" },\n },\n true,\n [\"verify\"],\n );\n return [privkey, pubkey];\n}",[],[348,355],{"_105":363,"_98":364,"_150":365,"_152":349,"_153":136,"_154":366,"_156":157,"_107":367,"_102":173,"_160":174,"_162":368,"_163":25,"_164":-5,"_165":369,"_101":370},"41129306-717d-11f0-aa15-0224a6c84d84","hmac.js","3a0181da-717d-11f0-bfa3-0224a6c84d84",72,["D",1754344322493],"// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors.\n\nimport * as bin from \"../base/buf.js\";\n\nexport const hkdfalgkeysz = 32; // sha256\n\nexport function rand(sz = 16) {\n const t = new Uint8Array(sz);\n crypto.getRandomValues(t);\n return t;\n}\n\nexport async function hmacsign(ck, m) {\n return crypto.subtle.sign(\"HMAC\", ck, m);\n}\n\nexport async function hmacverify(ck, mac, m) {\n return crypto.subtle.verify(\"HMAC\", ck, mac, m);\n}\n\n// with hkdf, salt is optional and public, but if used,\n// for a given secret (Z) it needn't be unique per use,\n// but it *must* be random:\n// cendyne.dev/posts/2023-01-30-how-to-use-hkdf.html\n// info adds entropy to extracted keys, and must be unique:\n// see: soatok.blog/2021/11/17/understanding-hkdf\nexport async function hkdfhmac(skmac, usectx, salt = bin.ZEROBUF) {\n const dk = await hkdf(skmac);\n return crypto.subtle.deriveKey(\n hkdf256(salt, usectx),\n dk,\n hmac256opts(),\n true, // extractable? can be true for sign, verify\n [\"sign\", \"verify\"], // usage\n );\n}\n\nexport async function hmackey(sk) {\n return crypto.subtle.importKey(\n \"raw\",\n sk,\n hmac256opts(),\n false, // extractable? always false for use as derivedKey\n [\"sign\", \"verify\"], // usage\n );\n}\n\nexport async function hkdf(sk) {\n return crypto.subtle.importKey(\n \"raw\",\n sk,\n \"HKDF\",\n false, // extractable? always false for use as derivedKey\n [\"deriveKey\", \"deriveBits\"], // usage\n );\n}\n\nexport function hmac256opts() {\n return { name: \"HMAC\", hash: \"SHA-256\" };\n}\n\nexport function hkdf256(salt, usectx) {\n return { name: \"HKDF\", hash: \"SHA-256\", salt: salt, info: usectx };\n}\n\nexport async function sha256(b) {\n const ab = await crypto.subtle.digest(\"SHA-256\", b);\n return bin.byt(ab);\n}\n\nexport async function sha512(b) {\n const ab = await crypto.subtle.digest(\"SHA-512\", b);\n return bin.byt(ab);\n}",[],[348,364],[348],{"_105":373,"_98":374,"_150":375,"_152":-5,"_153":136,"_154":376,"_156":157,"_107":377,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":378,"_101":388},"4c5015fe-717d-11f0-8d5d-0224a6c84d84","workers","49338838-717d-11f0-bc3e-0224a6c84d84",74,["D",1754344341351],[379],{"_105":380,"_98":381,"_150":382,"_152":375,"_153":136,"_154":383,"_156":157,"_107":384,"_102":173,"_160":174,"_162":385,"_163":25,"_164":-5,"_165":386,"_101":387},"579126ec-717d-11f0-aa15-0224a6c84d84","wsvc.js","4dd65762-717d-11f0-b9e8-0224a6c84d84",77,["D",1754344360234],"// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors.\n\nimport * as bin from \"../base/buf.js\";\nimport * as cfg from \"../base/cfg.js\";\nimport * as log from \"../base/log.js\";\nimport * as modres from \"../base/res.js\";\nimport * as auth from \"../core/auth.js\";\nimport * as brsa from \"../sjcl/brsa.js\";\nimport * as krsa from \"../webcrypto/blindrsa.js\";\nimport { sha256 } from \"../webcrypto/hmac.js\";\n\nconst KEYS = {\n // todo: use lfu cache\n /** @type {Map} */\n ckmacs: new Map(),\n /** @type {CryptoKey} */\n ckpriv0: null,\n /** @type {CryptoKey} */\n ckpub0: null,\n /** @type {CryptoKey} */\n ckpriv1: null,\n /** @type {CryptoKey} */\n ckpub1: null,\n};\n\n// todo: use lfu cache\n/** @type {Set} */\nconst TOKAUTH = new Set();\n\nconst enc = new TextEncoder();\n\n/**\n * Given a blind message, return a blind signature.\n * @param {Request} r\n * @param {any} env\n * @param {any} ctx\n * @return {Promise}\n * @throws\n */\nexport async function sign(r, env, ctx) {\n if (r.method !== \"POST\" || r.method !== \"PUT\") return modres.r405;\n\n if (!superuser(r, env)) return modres.r401;\n\n const blindMsgHex = await r.text();\n if (!blindMsgHex) {\n log.w(\"sign: invalid request; no body\");\n return modres.r400;\n }\n\n const blindMsg = bin.hex2buf(blindMsgHex);\n const ck = await currentrsasecrets(env);\n const blindSig = await brsa.blindSign(ck[0], blindMsg); // TODO: may throw exception\n const blindSigHex = bin.buf2hex(blindSig);\n return new Response(blindSigHex, { ...modres.txthdr });\n}\n\n/**\n * If unblinded msg and signature are verified, issue a data token\n * against a hashed client token.\n * @param {Request} r\n * @param {any} env\n * @param {any} ctx\n */\nexport async function issue(r, env, ctx) {\n if (r.method !== \"POST\" || r.method !== \"PUT\") return modres.r405;\n\n if (!superuser(r, env)) return modres.r401;\n\n // txt is of form: msg:sig:sha256(sig):sha256(token):expiryMs\n const txt = await r.text();\n if (!txt) {\n log.w(\"issue: invalid request; no body\");\n return modres.r400;\n }\n\n // unblindedMsgHex, unblindedSigHex, hex(hash(unblindedSig)), hashedthex\n const msgsig = txt.split(auth.claimDelim);\n if (msgsig.length < 4) {\n log.w(\"issue: unexpected len(msgsig);\", msgsig.length);\n return modres.r401;\n }\n\n let expiryMs = 0;\n const rsamsghex = msgsig[0];\n const rsasighex = msgsig[1];\n const rsasighashhex = msgsig[2]; // unused\n const hashedthex = msgsig[3];\n // expiryMs from msgsig[4] set below\n if (!rsamsghex || !rsasighex || !rsasighashhex || !hashedthex) {\n log.w(\"issue: someempty(msgsig);\", msgsig);\n return modres.r401;\n }\n\n // default: expires in 3h\n if (msgsig.length >= 4) expiryMs = parseInt(msgsig[4]);\n else expiryMs = cfg.minAuthExpiryMs;\n\n if (typeof expiryMs !== \"number\" || expiryMs < cfg.minAuthExpiryMs) {\n log.w(\"issue: invalid expiryMs;\", expiryMs);\n return modres.r400;\n }\n\n const msg = bin.hex2buf(rsamsghex);\n const sig = bin.hex2buf(rsasighex);\n const ck0 = await currentrsasecrets(env);\n\n const ok0 = await brsa.verify(ck0[1], msg, sig);\n if (!ok0) {\n const ck1 = await previousrsasecrets(env);\n const ok1 = await brsa.verify(ck1[1], msg, sig);\n if (!ok1) {\n log.e(\"issue: cannot verify sigs\");\n return modres.r401;\n }\n }\n\n const hashedsig = await sha256(sig); // same as rsasighashhex\n const info = bin.buf2hex(hashedsig);\n const sk = await macsecret(env, info);\n if (!sk) {\n log.e(\"issue: no mac secret\");\n return modres.r500;\n }\n\n const expsig = await auth.issue(sk, hashedthex, expiryMs);\n if (!expsig || expsig.length <= 0) {\n log.e(\"issue: failure\");\n return modres.r500;\n }\n // todo: no-cache headers\n return new Response(expsig.join(auth.claimDelim), { ...modres.txthdr });\n}\n\n/**\n * @param {Request} r\n * @param {any} env\n * @param {any} ctx\n */\nexport async function allow(r, env, ctx) {\n const url = new URL(r.url);\n const tok = r.headers.get(cfg.headerClaim); // client raw token\n const mac = r.headers.get(cfg.headerMac); // hmac on msg (url.path) w/ sig(client token)\n // msg is hex(sha256(url.pathname)) or headerMsg\n const msgh = r.headers.get(cfg.headerMsg); // hex; may be null\n const msg = msgh || await grabMsg(url); // hex; sha256(url.path)\n const info = grabHashedRsaSig(url); // sha256(unblinded-rsa-sig(payment-msg))\n\n if (cfg.bypassAuth && notprod(env)) {\n log.w(\"auth: bypass\", \"claim?\", mac, \"msg?\", msg);\n return auth.ok;\n }\n\n if (!tok || !mac || !msg || !info) {\n log.d(\"auth: no claim or msg\");\n return auth.notok;\n }\n\n if (auth.verifyExpiry(tok)) { // verifyClaim also checks expiry\n log.d(\"auth: expired claim\");\n return auth.notok;\n }\n\n const tokcachekey = tok + msg + mac + info;\n if (TOKAUTH.has(tokcachekey)) {\n log.d(\"auth: cached claim: ok\");\n return auth.ok;\n }\n\n // todo: cache auth result\n const sk = await macsecret(env, info);\n if (!sk) {\n log.e(\"auth: no sk\");\n return auth.notok;\n }\n\n const authres = await auth.verifyClaim(sk, tok, msg, mac, /*checkExpiry*/ false);\n if (authres == auth.ok) {\n TOKAUTH.add(tokcachekey);\n }\n return authres;\n}\n\n/**\n * @param {any} env\n * @param {string} ctx\n * @returns {Promise}\n */\nasync function macsecret(env, ctx) {\n let sk = KEYS.ckmacs.get(ctx);\n if (sk == null) {\n const seed = env.SECRET_KEY_MAC_A;\n if (!seed) {\n log.e(\"macsecret: no seed\");\n return null;\n }\n sk = await auth.keygen(seed, ctx);\n KEYS.ckmacs.set(ctx, sk);\n }\n return sk;\n}\n\n/**\n * @param {any} env\n * @returns {Promise}\n * @throws when rsa-pss pub/priv keys are missing\n */\nasync function previousrsasecrets(env) {\n const curprev = await rsasecrets(env);\n return curprev[1];\n}\n\n/**\n * @param {any} env\n * @returns {Promise}\n * @throws when rsa-pss pub/priv keys are missing\n */\nasync function currentrsasecrets(env) {\n const curprev = await rsasecrets(env);\n return curprev[0];\n}\n\n/**\n * @param {any} env\n * @returns {Promise>}\n * @throws when rsa-pss pub/priv keys are missing\n */\nasync function rsasecrets(env) {\n // todo: should not be cached for more than 3 days\n if (\n KEYS.ckpriv0 != null\n && KEYS.ckpub0 != null\n && KEYS.ckpriv1 != null\n && KEYS.ckpub1 != null\n ) {\n const latest = [KEYS.ckpriv0, KEYS.ckpub0];\n const previous = [KEYS.ckpriv1, KEYS.ckpub1];\n return [latest, previous];\n }\n // see: redir's rsapubkey fn\n const privprefix = cfg.wenvBlindRsaPrivateKeyPrefix;\n const pubprefix = cfg.wenvBlindRsaPublicKeyPrefix;\n // default key name\n let kpriv0 = privprefix + \"A\";\n let kpub0 = pubprefix + \"A\";\n let kpriv1 = privprefix + \"B\";\n let kpub1 = pubprefix + \"B\";\n const descend = Object.keys(env)\n .filter((k) => k.startsWith(privprefix))\n .sort((a, b) => {\n const l = parseInt(a.slice(privprefix.length));\n const r = parseInt(b.slice(privprefix.length));\n return r - l;\n });\n if (descend.length > 0) {\n kpriv0 = privprefix + descend[0];\n kpub0 = pubprefix + descend[0];\n }\n if (descend.length > 1) {\n kpriv1 = privprefix + descend[1];\n kpub1 = pubprefix + descend[1];\n }\n const privjwkstr0 = env[kpriv0];\n const pubjwkstr0 = env[kpub0];\n if (!privjwkstr0 || !pubjwkstr0) {\n const ex = \"missing rsa-pss keys;\" + kpriv0 + kpub0;\n throw new Error(ex);\n }\n const privjwkstr1 = env[kpriv1];\n const pubjwkstr1 = env[kpub1];\n if (!privjwkstr1 || !pubjwkstr1) {\n const ex = \"missing rsa-pss keys;\" + kpriv1 + kpub1;\n throw new Error(ex);\n }\n const cks0 = await krsa.importkey(privjwkstr0, pubjwkstr0);\n const cks1 = await krsa.importkey(privjwkstr1, pubjwkstr1);\n\n KEYS.ckpriv0 = cks0[0];\n KEYS.ckpub0 = cks0[1];\n KEYS.ckpriv1 = cks1[0];\n KEYS.ckpub1 = cks1[1];\n return [cks0, cks1];\n}\n\n/**\n * @param {URL} u\n * @returns {string}\n */\nfunction grabHashedRsaSig(u) {\n try {\n const p = u.pathname.split(\"/\");\n return p[2];\n } catch (ex) {\n log.w(\"wsvc: grabRsaSig\", ex);\n }\n return null;\n}\n\n/**\n * @param {URL} u\n * @returns {Promise}\n */\nasync function grabMsg(u) {\n try {\n const p = enc.encode(u.pathname);\n const d = await sha256(p);\n return bin.buf2hex(d);\n } catch (ex) {\n log.w(\"wsvc: grabMsg\", ex);\n }\n return null;\n}\n\n/**\n * @param {Request} r\n * @param {any} env\n * @returns {boolean}\n */\nfunction superuser(r, env) {\n const svcpskhex = r.headers.get(cfg.headerSvcPsk);\n if (!svcpskhex) return false;\n\n const svcauthres = auth.verifySvcPsk(env, svcpskhex);\n return svcauthres === auth.ok;\n}\n\n/**\n * @param {any} env\n * @returns {boolean}\n */\nfunction notprod(env) {\n return env[\"WENV\"] !== \"prod\";\n}",[],[374,381],[374],{"_105":390,"_98":391,"_150":392,"_152":-5,"_153":136,"_154":159,"_156":157,"_107":393,"_102":29,"_160":174,"_162":71,"_163":25,"_164":-5,"_165":394,"_101":395},"09ccea20-717a-11f0-b367-0224a6c84d84","main.tsx","09cceaca-717a-11f0-b367-0224a6c84d84",["D",1754342941278],[],[391],{"_105":397,"_98":398,"_150":399,"_152":-5,"_153":136,"_154":135,"_156":157,"_107":400,"_102":401,"_160":402,"_162":403,"_163":25,"_164":-5,"_165":404,"_101":405},"6bd5fe02-717d-11f0-bbcd-0224a6c84d84","server-val.js","bcf642e8-717c-11f0-86e3-0224a6c84d84",["D",1754344394241],3,"http","// SPDX-License-Identifier: MPL-2.0\n// Copyright (c) 2023 RethinkDNS and its authors\n\nimport * as cfg from \"./base/cfg.js\";\nimport * as log from \"./base/log.js\";\nimport * as modres from \"./base/res.js\";\nimport * as svc from \"./core/svc.js\";\nimport * as h2 from \"./proxifier/h2.js\";\nimport * as ws from \"./proxifier/ws.js\";\n\nexport default handle;\n\n/**\n * @param {Request} req\n * @returns {Response}\n */\nasync function handle(req) {\n log.d(\"fetch: serving\", req.url);\n const u = new URL(req.url);\n const [what, addr] = svc.intent(u);\n\n if (what.startsWith(\"yo\")) {\n log.d(\"svc: test\");\n return svc.tester(req, addr.hostname);\n }\n\n // todo: impl auth\n try {\n if (what.startsWith(\"ws\")) {\n if (!ws.isWs(req)) {\n return modres.r426();\n }\n log.d(\"ws: connect\", addr);\n const sock = await mksocket(addr);\n return ws.accept(sock);\n } else if (what.startsWith(\"h2\")) {\n log.d(\"pipe: connect\", addr);\n const sock = await mksocket(addr);\n return h2.pipe(req, sock);\n } else if (what.startsWith(\"echo\")) {\n log.d(\"echo: start\");\n const sock = await mksocket(addr);\n return h2.echo(sock);\n }\n } catch (err) {\n log.e(\"fetch:\", err);\n }\n return modres.r400;\n}\n\nasync function mksocket(addr) {\n // ref: developers.cloudflare.com/workers/runtime-apis/tcp-sockets\n return Deno.connect(addr, cfg.tcpOpts);\n}",[],[398],"files",[147,167,178,187,196,206,213,222,232,239,248,257,267,274,283,293,300,309,318,327,336,346,353,362,372,379,389,396],"counts",{"_410":29,"_411":159,"_412":29,"_413":29},"pulls","branches","forks","envVars","contents",[416,419,422,425,428,431,434,437,440],{"_105":148,"_98":149,"_150":151,"_152":-5,"_153":136,"_154":155,"_156":157,"_107":417,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":418},["D",1754343712109],[149],{"_105":207,"_98":208,"_150":209,"_152":-5,"_153":136,"_154":210,"_156":157,"_107":420,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":421},["D",1754343866908],[208],{"_105":233,"_98":234,"_150":235,"_152":-5,"_153":136,"_154":236,"_156":157,"_107":423,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":424},["D",1754343937240],[234],{"_105":268,"_98":269,"_150":270,"_152":-5,"_153":136,"_154":271,"_156":157,"_107":426,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":427},["D",1754344039205],[269],{"_105":294,"_98":295,"_150":296,"_152":-5,"_153":136,"_154":297,"_156":157,"_107":429,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":430},["D",1754344143590],[295],{"_105":347,"_98":348,"_150":349,"_152":-5,"_153":136,"_154":350,"_156":157,"_107":432,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":433},["D",1754344273550],[348],{"_105":373,"_98":374,"_150":375,"_152":-5,"_153":136,"_154":376,"_156":157,"_107":435,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":436},["D",1754344341351],[374],{"_105":390,"_98":391,"_150":392,"_152":-5,"_153":136,"_154":159,"_156":157,"_107":438,"_102":29,"_160":174,"_162":71,"_163":25,"_164":-5,"_101":439},["D",1754342941278],[391],{"_105":397,"_98":398,"_150":399,"_152":-5,"_153":136,"_154":135,"_156":157,"_107":441,"_102":401,"_160":402,"_162":403,"_163":25,"_164":-5,"_101":442},["D",1754344394241],[398],"file","upstreamProject","upstreamBranch","emptyEnvVars","isNew","routes/_app.x.$handle.$name._index",{"_96":97,"_98":99,"_100":-7,"_102":-7,"_103":450,"_414":454,"_473":-7,"_474":-5,"_475":-5,"_406":476,"_561":562},{"_105":106,"_98":99,"_107":451,"_109":-5,"_110":25,"_111":112,"_113":-5,"_114":-5,"_12":115,"_116":-5,"_117":25,"_118":-5,"_119":29,"_14":120,"_121":122,"_123":122,"_124":125,"_126":125,"_127":125,"_128":122,"_129":122,"_19":452,"_133":453,"_144":25},["D",1754342941264],{"_96":97,"_131":132},{"_102":135,"_98":40,"_105":136,"_137":106,"_138":-5,"_139":-5,"_140":-5,"_141":-5,"_142":99,"_143":97},[455,457,459,461,463,465,467,469,471],{"_105":148,"_98":149,"_150":151,"_152":-5,"_153":136,"_154":155,"_156":157,"_107":417,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":456},[149],{"_105":207,"_98":208,"_150":209,"_152":-5,"_153":136,"_154":210,"_156":157,"_107":420,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":458},[208],{"_105":233,"_98":234,"_150":235,"_152":-5,"_153":136,"_154":236,"_156":157,"_107":423,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":460},[234],{"_105":268,"_98":269,"_150":270,"_152":-5,"_153":136,"_154":271,"_156":157,"_107":426,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":462},[269],{"_105":294,"_98":295,"_150":296,"_152":-5,"_153":136,"_154":297,"_156":157,"_107":429,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":464},[295],{"_105":347,"_98":348,"_150":349,"_152":-5,"_153":136,"_154":350,"_156":157,"_107":432,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":466},[348],{"_105":373,"_98":374,"_150":375,"_152":-5,"_153":136,"_154":376,"_156":157,"_107":435,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_101":468},[374],{"_105":390,"_98":391,"_150":392,"_152":-5,"_153":136,"_154":159,"_156":157,"_107":438,"_102":29,"_160":174,"_162":71,"_163":25,"_164":-5,"_101":470},[391],{"_105":397,"_98":398,"_150":399,"_152":-5,"_153":136,"_154":135,"_156":157,"_107":441,"_102":401,"_160":402,"_162":403,"_163":25,"_164":-5,"_101":472},[398],"readme","upstream","pull",[477,479,482,485,488,492,494,497,501,503,506,509,513,515,518,522,524,527,530,533,536,540,542,545,549,551,555,558],{"_105":148,"_98":149,"_150":151,"_152":-5,"_153":136,"_154":155,"_156":157,"_107":158,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":478,"_101":491},[479,482,485,488],{"_105":168,"_98":169,"_150":170,"_152":151,"_153":136,"_154":171,"_156":157,"_107":172,"_102":173,"_160":174,"_162":175,"_163":25,"_164":-5,"_165":480,"_101":481},[],[149,169],{"_105":179,"_98":180,"_150":181,"_152":151,"_153":136,"_154":182,"_156":157,"_107":183,"_102":173,"_160":174,"_162":184,"_163":25,"_164":-5,"_165":483,"_101":484},[],[149,180],{"_105":188,"_98":189,"_150":190,"_152":151,"_153":136,"_154":191,"_156":157,"_107":192,"_102":173,"_160":174,"_162":193,"_163":25,"_164":-5,"_165":486,"_101":487},[],[149,189],{"_105":197,"_98":198,"_150":199,"_152":151,"_153":136,"_154":200,"_156":157,"_107":201,"_102":173,"_160":174,"_162":202,"_163":25,"_164":-5,"_165":489,"_101":490},[],[149,198],[149],{"_105":207,"_98":208,"_150":209,"_152":-5,"_153":136,"_154":210,"_156":157,"_107":211,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":493,"_101":500},[494,497],{"_105":214,"_98":215,"_150":216,"_152":209,"_153":136,"_154":217,"_156":157,"_107":218,"_102":173,"_160":174,"_162":219,"_163":25,"_164":-5,"_165":495,"_101":496},[],[208,215],{"_105":223,"_98":224,"_150":225,"_152":209,"_153":136,"_154":226,"_156":157,"_107":227,"_102":173,"_160":174,"_162":228,"_163":25,"_164":-5,"_165":498,"_101":499},[],[208,224],[208],{"_105":233,"_98":234,"_150":235,"_152":-5,"_153":136,"_154":236,"_156":157,"_107":237,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":502,"_101":512},[503,506,509],{"_105":240,"_98":241,"_150":242,"_152":235,"_153":136,"_154":243,"_156":157,"_107":244,"_102":173,"_160":174,"_162":245,"_163":25,"_164":-5,"_165":504,"_101":505},[],[234,241],{"_105":249,"_98":250,"_150":251,"_152":235,"_153":136,"_154":252,"_156":157,"_107":253,"_102":173,"_160":174,"_162":254,"_163":25,"_164":-5,"_165":507,"_101":508},[],[234,250],{"_105":258,"_98":259,"_150":260,"_152":235,"_153":136,"_154":261,"_156":157,"_107":262,"_102":173,"_160":174,"_162":263,"_163":25,"_164":-5,"_165":510,"_101":511},[],[234,259],[234],{"_105":268,"_98":269,"_150":270,"_152":-5,"_153":136,"_154":271,"_156":157,"_107":272,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":514,"_101":521},[515,518],{"_105":275,"_98":276,"_150":277,"_152":270,"_153":136,"_154":278,"_156":157,"_107":279,"_102":173,"_160":174,"_162":280,"_163":25,"_164":-5,"_165":516,"_101":517},[],[269,276],{"_105":284,"_98":285,"_150":286,"_152":270,"_153":136,"_154":287,"_156":157,"_107":288,"_102":173,"_160":174,"_162":289,"_163":25,"_164":-5,"_165":519,"_101":520},[],[269,285],[269],{"_105":294,"_98":295,"_150":296,"_152":-5,"_153":136,"_154":297,"_156":157,"_107":298,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":523,"_101":539},[524,527,530,533,536],{"_105":301,"_98":302,"_150":303,"_152":296,"_153":136,"_154":304,"_156":157,"_107":305,"_102":173,"_160":174,"_162":306,"_163":25,"_164":-5,"_165":525,"_101":526},[],[295,302],{"_105":310,"_98":311,"_150":312,"_152":296,"_153":136,"_154":313,"_156":157,"_107":314,"_102":173,"_160":174,"_162":315,"_163":25,"_164":-5,"_165":528,"_101":529},[],[295,311],{"_105":319,"_98":320,"_150":321,"_152":296,"_153":136,"_154":322,"_156":157,"_107":323,"_102":173,"_160":174,"_162":324,"_163":25,"_164":-5,"_165":531,"_101":532},[],[295,320],{"_105":328,"_98":329,"_150":330,"_152":296,"_153":136,"_154":331,"_156":157,"_107":332,"_102":173,"_160":174,"_162":333,"_163":25,"_164":-5,"_165":534,"_101":535},[],[295,329],{"_105":337,"_98":338,"_150":339,"_152":296,"_153":136,"_154":340,"_156":157,"_107":341,"_102":173,"_160":174,"_162":342,"_163":25,"_164":-5,"_165":537,"_101":538},[],[295,338],[295],{"_105":347,"_98":348,"_150":349,"_152":-5,"_153":136,"_154":350,"_156":157,"_107":351,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":541,"_101":548},[542,545],{"_105":354,"_98":355,"_150":356,"_152":349,"_153":136,"_154":357,"_156":157,"_107":358,"_102":173,"_160":174,"_162":359,"_163":25,"_164":-5,"_165":543,"_101":544},[],[348,355],{"_105":363,"_98":364,"_150":365,"_152":349,"_153":136,"_154":366,"_156":157,"_107":367,"_102":173,"_160":174,"_162":368,"_163":25,"_164":-5,"_165":546,"_101":547},[],[348,364],[348],{"_105":373,"_98":374,"_150":375,"_152":-5,"_153":136,"_154":376,"_156":157,"_107":377,"_102":159,"_160":161,"_162":-5,"_163":25,"_164":-5,"_165":550,"_101":554},[551],{"_105":380,"_98":381,"_150":382,"_152":375,"_153":136,"_154":383,"_156":157,"_107":384,"_102":173,"_160":174,"_162":385,"_163":25,"_164":-5,"_165":552,"_101":553},[],[374,381],[374],{"_105":390,"_98":391,"_150":392,"_152":-5,"_153":136,"_154":159,"_156":157,"_107":393,"_102":29,"_160":174,"_162":71,"_163":25,"_164":-5,"_165":556,"_101":557},[],[391],{"_105":397,"_98":398,"_150":399,"_152":-5,"_153":136,"_154":135,"_156":157,"_107":400,"_102":401,"_160":402,"_162":403,"_163":25,"_164":-5,"_165":559,"_101":560},[],[398],"previews",[558],"routes/_app","actionData","errors"]