@ghostlytools/cli 1.0.0

package/dist/assets/argon2id-088uQfnH.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"argon2id-088uQfnH.js","names":["globalThis"],"sources":["../../../../node_modules/openpgp/dist/lightweight/argon2id.mjs"],"sourcesContent":["/*! OpenPGP.js v6.3.2 - 2026-09-24 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */\nconst globalThis = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};\n\n// Adapted from the reference implementation in RFC7693\n// Initial port to Javascript by https://github.com/dcposch and https://github.com/emilbayes\n\n// Uint64 values are represented using two Uint32s, stored as little endian\n// NB: Uint32Arrays endianness depends on the underlying system, so for interoperability, conversions between Uint8Array and Uint32Arrays\n// need to be manually handled\n\n// 64-bit unsigned addition (little endian, in place)\n// Sets a[i,i+1] += b[j,j+1]\n// `a` and `b` must be Uint32Array(2)\nfunction ADD64 (a, i, b, j) {\n  a[i] += b[j];\n  a[i+1] += b[j+1] + (a[i] < b[j]); // add carry\n}\n\n// Increment 64-bit little-endian unsigned value by `c` (in place)\n// `a` must be Uint32Array(2)\nfunction INC64 (a, c) {\n  a[0] += c;\n  a[1] += (a[0] < c);\n}\n\n// G Mixing function\n// The ROTRs are inlined for speed\nfunction G$1 (v, m, a, b, c, d, ix, iy) {\n  ADD64(v, a, v, b); // v[a,a+1] += v[b,b+1]\n  ADD64(v, a, m, ix); // v[a, a+1] += x ... x0\n\n  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n  let xor0 = v[d] ^ v[a];\n  let xor1 = v[d + 1] ^ v[a + 1];\n  v[d] = xor1;\n  v[d + 1] = xor0;\n\n  ADD64(v, c, v, d);\n\n  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n  xor0 = v[b] ^ v[c];\n  xor1 = v[b + 1] ^ v[c + 1];\n  v[b] = (xor0 >>> 24) ^ (xor1 << 8);\n  v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8);\n\n  ADD64(v, a, v, b);\n  ADD64(v, a, m, iy);\n\n  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n  xor0 = v[d] ^ v[a];\n  xor1 = v[d + 1] ^ v[a + 1];\n  v[d] = (xor0 >>> 16) ^ (xor1 << 16);\n  v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16);\n\n  ADD64(v, c, v, d);\n\n  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n  xor0 = v[b] ^ v[c];\n  xor1 = v[b + 1] ^ v[c + 1];\n  v[b] = (xor1 >>> 31) ^ (xor0 << 1);\n  v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1);\n}\n\n// Initialization Vector\nconst BLAKE2B_IV32 = new Uint32Array([\n  0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,\n  0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,\n  0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,\n  0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19\n]);\n\n// These are offsets into a Uint64 buffer.\n// Multiply them all by 2 to make them offsets into a Uint32 buffer\nconst SIGMA = new Uint8Array([\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n  11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n  7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n  9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n  2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n  12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n  13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n  6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n  10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3\n].map(x => x * 2));\n\n// Compression function. 'last' flag indicates last block.\n// Note: we're representing 16 uint64s as 32 uint32s\nfunction compress(S, last) {\n  const v = new Uint32Array(32);\n  const m = new Uint32Array(S.b.buffer, S.b.byteOffset, 32);\n\n  // init work variables\n  for (let i = 0; i < 16; i++) {\n    v[i] = S.h[i];\n    v[i + 16] = BLAKE2B_IV32[i];\n  }\n\n  // low 64 bits of offset\n  v[24] ^= S.t0[0];\n  v[25] ^= S.t0[1];\n  // high 64 bits not supported (`t1`), offset may not be higher than 2**53-1\n\n  // if last block\n  const f0 = last ? 0xFFFFFFFF : 0;\n  v[28] ^= f0;\n  v[29] ^= f0;\n\n  // twelve rounds of mixing\n  for (let i = 0; i < 12; i++) {\n    // ROUND(r)\n    const i16 = i << 4;\n    G$1(v, m, 0, 8, 16, 24,  SIGMA[i16 + 0], SIGMA[i16 + 1]);\n    G$1(v, m, 2, 10, 18, 26, SIGMA[i16 + 2], SIGMA[i16 + 3]);\n    G$1(v, m, 4, 12, 20, 28, SIGMA[i16 + 4], SIGMA[i16 + 5]);\n    G$1(v, m, 6, 14, 22, 30, SIGMA[i16 + 6], SIGMA[i16 + 7]);\n    G$1(v, m, 0, 10, 20, 30, SIGMA[i16 + 8], SIGMA[i16 + 9]);\n    G$1(v, m, 2, 12, 22, 24, SIGMA[i16 + 10], SIGMA[i16 + 11]);\n    G$1(v, m, 4, 14, 16, 26, SIGMA[i16 + 12], SIGMA[i16 + 13]);\n    G$1(v, m, 6, 8, 18, 28,  SIGMA[i16 + 14], SIGMA[i16 + 15]);\n  }\n\n  for (let i = 0; i < 16; i++) {\n    S.h[i] ^= v[i] ^ v[i + 16];\n  }\n}\n\n// Creates a BLAKE2b hashing context\n// Requires an output length between 1 and 64 bytes\n// Takes an optional Uint8Array key\nclass Blake2b {\n  constructor(outlen, key, salt, personal) {\n    const params = new Uint8Array(64);\n    //  0: outlen, keylen, fanout, depth\n    //  4: leaf length, sequential mode\n    //  8: node offset\n    // 12: node offset\n    // 16: node depth, inner length, rfu\n    // 20: rfu\n    // 24: rfu\n    // 28: rfu\n    // 32: salt\n    // 36: salt\n    // 40: salt\n    // 44: salt\n    // 48: personal\n    // 52: personal\n    // 56: personal\n    // 60: personal\n\n    // init internal state\n    this.S = {\n      b: new Uint8Array(BLOCKBYTES),\n      h: new Uint32Array(OUTBYTES_MAX / 4),\n      t0: new Uint32Array(2), // input counter `t`, lower 64-bits only\n      c: 0, // `fill`, pointer within buffer, up to `BLOCKBYTES`\n      outlen // output length in bytes\n    };\n\n    // init parameter block\n    params[0] = outlen;\n    if (key) params[1] = key.length;\n    params[2] = 1; // fanout\n    params[3] = 1; // depth\n    if (salt) params.set(salt, 32);\n    if (personal) params.set(personal, 48);\n    const params32 = new Uint32Array(params.buffer, params.byteOffset, params.length / Uint32Array.BYTES_PER_ELEMENT);\n\n    // initialize hash state\n    for (let i = 0; i < 16; i++) {\n      this.S.h[i] = BLAKE2B_IV32[i] ^ params32[i];\n    }\n\n    // key the hash, if applicable\n    if (key) {\n      const block = new Uint8Array(BLOCKBYTES);\n      block.set(key);\n      this.update(block);\n    }\n  }\n\n  // Updates a BLAKE2b streaming hash\n  // Requires Uint8Array (byte array)\n  update(input) {\n    if (!(input instanceof Uint8Array)) throw new Error('Input must be Uint8Array or Buffer')\n    // for (let i = 0; i < input.length; i++) {\n    //   if (this.S.c === BLOCKBYTES) { // buffer full\n    //     INC64(this.S.t0, this.S.c) // add counters\n    //     compress(this.S, false)\n    //     this.S.c = 0 // empty buffer\n    //   }\n    //   this.S.b[this.S.c++] = input[i]\n    // }\n    let i = 0;\n    while(i < input.length) {\n      if (this.S.c === BLOCKBYTES) { // buffer full\n        INC64(this.S.t0, this.S.c); // add counters\n        compress(this.S, false);\n        this.S.c = 0; // empty buffer\n      }\n      let left = BLOCKBYTES - this.S.c;\n      this.S.b.set(input.subarray(i, i + left), this.S.c); // end index can be out of bounds\n      const fill = Math.min(left, input.length - i);\n      this.S.c += fill;\n      i += fill;\n    }\n    return this\n  }\n\n  /**\n   * Return a BLAKE2b hash, either filling the given Uint8Array or allocating a new one\n   * @param {Uint8Array} [prealloc] - optional preallocated buffer\n   * @returns {ArrayBuffer} message digest\n   */\n  digest(prealloc) {\n    INC64(this.S.t0, this.S.c); // mark last block offset\n\n    // final block, padded\n    this.S.b.fill(0, this.S.c);\n    this.S.c = BLOCKBYTES;\n    compress(this.S, true);\n\n    const out = prealloc || new Uint8Array(this.S.outlen);\n    for (let i = 0; i < this.S.outlen; i++) {\n      // must be loaded individually since default Uint32 endianness is platform dependant\n      out[i] = this.S.h[i >> 2] >> (8 * (i & 3));\n    }\n    this.S.h = null; // prevent calling `update` after `digest`\n    return out.buffer;\n  }\n}\n\n\nfunction createHash(outlen, key, salt, personal) {\n  if (outlen > OUTBYTES_MAX) throw new Error(`outlen must be at most ${OUTBYTES_MAX} (given: ${outlen})`)\n\n  return new Blake2b(outlen, key, salt, personal)\n}\n\nconst OUTBYTES_MAX = 64;\nconst BLOCKBYTES = 128;\n\nconst TYPE = 2;  // Argon2id\nconst VERSION = 0x13;\nconst TAGBYTES_MAX = 0xFFFFFFFF; // Math.pow(2, 32) - 1;\nconst TAGBYTES_MIN = 4; // Math.pow(2, 32) - 1;\nconst SALTBYTES_MAX = 0xFFFFFFFF; // Math.pow(2, 32) - 1;\nconst SALTBYTES_MIN = 8;\nconst passwordBYTES_MAX = 0xFFFFFFFF;// Math.pow(2, 32) - 1;\nconst passwordBYTES_MIN = 8;\nconst MEMBYTES_MAX = 0xFFFFFFFF;// Math.pow(2, 32) - 1;\nconst ADBYTES_MAX = 0xFFFFFFFF; // Math.pow(2, 32) - 1; // associated data (optional)\nconst SECRETBYTES_MAX = 32; // key (optional)\n\nconst ARGON2_BLOCK_SIZE = 1024;\nconst ARGON2_PREHASH_DIGEST_LENGTH = 64;\n\nconst isLittleEndian = new Uint8Array(new Uint16Array([0xabcd]).buffer)[0] === 0xcd;\n\n// store n as a little-endian 32-bit Uint8Array inside buf (at buf[i:i+3])\nfunction LE32(buf, n, i) {\n  buf[i+0] = n;\n  buf[i+1] = n >>  8;\n  buf[i+2] = n >> 16;\n  buf[i+3] = n >> 24;\n  return buf;\n}\n\n/**\n * Store n as a 64-bit LE number in the given buffer (from buf[i] to buf[i+7])\n * @param {Uint8Array} buf\n * @param {Number} n\n * @param {Number} i\n */\nfunction LE64(buf, n, i) {\n  if (n > Number.MAX_SAFE_INTEGER) throw new Error(\"LE64: large numbers unsupported\");\n  // ECMAScript standard has engines convert numbers to 32-bit integers for bitwise operations\n  // shifting by 32 or more bits is not supported (https://stackoverflow.com/questions/6729122/javascript-bit-shift-number-wraps)\n  // so we manually extract each byte\n  let remainder = n;\n  for (let offset = i; offset < i+7; offset++) { // last byte can be ignored as it would overflow MAX_SAFE_INTEGER\n    buf[offset] = remainder; // implicit & 0xff\n    remainder = (remainder - buf[offset]) / 256;\n  }\n  return buf;\n}\n\n/**\n * Variable-Length Hash Function H'\n * @param {Number} outlen - T\n * @param {Uint8Array} X - value to hash\n * @param {Uint8Array} res - output buffer, of length `outlength` or larger\n */\nfunction H_(outlen, X, res) {\n  const V = new Uint8Array(64); // no need to keep around all V_i\n\n  const V1_in = new Uint8Array(4 + X.length);\n  LE32(V1_in, outlen, 0);\n  V1_in.set(X, 4);\n  if (outlen <= 64) {\n    // H'^T(A) = H^T(LE32(T)||A)\n    createHash(outlen).update(V1_in).digest(res);\n    return res\n  }\n\n  const r = Math.ceil(outlen / 32) - 2;\n\n  // Let V_i be a 64-byte block and W_i be its first 32 bytes.\n  // V_1 = H^(64)(LE32(T)||A)\n  // V_2 = H^(64)(V_1)\n  // ...\n  // V_r = H^(64)(V_{r-1})\n  // V_{r+1} = H^(T-32*r)(V_{r})\n  // H'^T(X) = W_1 || W_2 || ... || W_r || V_{r+1}\n  for (let i = 0; i < r; i++) {\n    createHash(64).update(i === 0 ? V1_in : V).digest(V);\n    // store W_i in result buffer already\n    res.set(V.subarray(0, 32), i*32);\n  }\n  // V_{r+1}\n  const V_r1 = new Uint8Array(createHash(outlen - 32*r).update(V).digest());\n  res.set(V_r1, r*32);\n\n  return res;\n}\n\n// compute buf = xs ^ ys\nfunction XOR(wasmContext, buf, xs, ys) {\n  wasmContext.fn.XOR(\n    buf.byteOffset,\n    xs.byteOffset,\n    ys.byteOffset,\n  );\n  return buf\n}\n\n/**\n * @param {Uint8Array} X (read-only)\n * @param {Uint8Array} Y (read-only)\n * @param {Uint8Array} R - output buffer\n * @returns\n */\nfunction G(wasmContext, X, Y, R) {\n  wasmContext.fn.G(\n    X.byteOffset,\n    Y.byteOffset,\n    R.byteOffset,\n    wasmContext.refs.gZ.byteOffset\n  );\n  return R;\n}\n\nfunction G2(wasmContext, X, Y, R) {\n  wasmContext.fn.G2(\n    X.byteOffset,\n    Y.byteOffset,\n    R.byteOffset,\n    wasmContext.refs.gZ.byteOffset\n  );\n  return R;\n}\n\n// Generator for data-independent J1, J2. Each `next()` invocation returns a new pair of values.\nfunction* makePRNG(wasmContext, pass, lane, slice, m_, totalPasses, segmentLength, segmentOffset) {\n  // For each segment, we do the following. First, we compute the value Z as:\n  // Z= ( LE64(r) || LE64(l) || LE64(sl) || LE64(m') || LE64(t) || LE64(y) )\n  wasmContext.refs.prngTmp.fill(0);\n  const Z = wasmContext.refs.prngTmp.subarray(0, 6 * 8);\n  LE64(Z, pass, 0);\n  LE64(Z, lane, 8);\n  LE64(Z, slice, 16);\n  LE64(Z, m_, 24);\n  LE64(Z, totalPasses, 32);\n  LE64(Z, TYPE, 40);\n\n  // Then we compute q/(128*SL) 1024-byte values\n  // G( ZERO(1024),\n  //    G( ZERO(1024), Z || LE64(1) || ZERO(968) ) ),\n  // ...,\n  // G( ZERO(1024),\n  //    G( ZERO(1024), Z || LE64(q/(128*SL)) || ZERO(968) )),\n  for(let i = 1; i <= segmentLength; i++) {\n    // tmp.set(Z); // no need to re-copy\n    LE64(wasmContext.refs.prngTmp, i, Z.length); // tmp.set(ZER0968) not necessary, memory already zeroed\n    const g2 = G2(wasmContext, wasmContext.refs.ZERO1024, wasmContext.refs.prngTmp, wasmContext.refs.prngR );\n\n    // each invocation of G^2 outputs 1024 bytes that are to be partitioned into 8-bytes values, take as X1 || X2\n    // NB: the first generated pair must be used for the first block of the segment, and so on.\n    // Hence, if some blocks are skipped (e.g. during the first pass), the corresponding J1J2 are discarded based on the given segmentOffset.\n    for(let k = i === 1 ? segmentOffset*8 : 0; k < g2.length; k += 8) {\n       yield g2.subarray(k, k+8);\n    }\n  }\n  return [];\n}\n\nfunction validateParams({ type, version, tagLength, password, salt, ad, secret, parallelism, memorySize, passes }) {\n  const assertLength = (name, value, min, max) => {\n    if (value < min || value > max) { throw new Error(`${name} size should be between ${min} and ${max} bytes`); }\n  };\n\n  if (type !== TYPE || version !== VERSION) throw new Error('Unsupported type or version');\n  assertLength('password', password, passwordBYTES_MIN, passwordBYTES_MAX);\n  assertLength('salt', salt, SALTBYTES_MIN, SALTBYTES_MAX);\n  assertLength('tag', tagLength, TAGBYTES_MIN, TAGBYTES_MAX);\n  assertLength('memory', memorySize, 8*parallelism, MEMBYTES_MAX);\n  // optional fields\n  ad && assertLength('associated data', ad, 0, ADBYTES_MAX);\n  secret && assertLength('secret', secret, 0, SECRETBYTES_MAX);\n\n  return { type, version, tagLength, password, salt, ad, secret, lanes: parallelism, memorySize, passes };\n}\n\nconst KB = 1024;\nconst WASM_PAGE_SIZE = 64 * KB;\n\nfunction argon2id(params, { memory, instance: wasmInstance }) {\n  if (!isLittleEndian) throw new Error('BigEndian system not supported'); // optmisations assume LE system\n\n  const ctx = validateParams({ type: TYPE, version: VERSION, ...params });\n\n  const { G:wasmG, G2:wasmG2, xor:wasmXOR, getLZ:wasmLZ } = wasmInstance.exports;\n  const wasmRefs = {};\n  const wasmFn = {};\n  wasmFn.G = wasmG;\n  wasmFn.G2 = wasmG2;\n  wasmFn.XOR = wasmXOR;\n\n  // The actual number of blocks is m', which is m rounded down to the nearest multiple of 4*p.\n  const m_ = 4 * ctx.lanes * Math.floor(ctx.memorySize / (4 * ctx.lanes));\n  const requiredMemory = m_ * ARGON2_BLOCK_SIZE + 10 * KB; // Additional KBs for utility references\n  if (memory.buffer.byteLength < requiredMemory) {\n    const missing = Math.ceil((requiredMemory - memory.buffer.byteLength) / WASM_PAGE_SIZE);\n    // If enough memory is available, the `memory.buffer` is internally detached and the reference updated.\n    // Otherwise, the operation fails, and the original memory can still be used.\n    memory.grow(missing);\n  }\n\n  let offset = 0;\n  // Init wasm memory needed in other functions\n  wasmRefs.gZ = new Uint8Array(memory.buffer, offset, ARGON2_BLOCK_SIZE); offset+= wasmRefs.gZ.length;\n  wasmRefs.prngR = new Uint8Array(memory.buffer, offset, ARGON2_BLOCK_SIZE); offset+=wasmRefs.prngR.length;\n  wasmRefs.prngTmp = new Uint8Array(memory.buffer, offset, ARGON2_BLOCK_SIZE); offset+=wasmRefs.prngTmp.length;\n  wasmRefs.ZERO1024 = new Uint8Array(memory.buffer, offset, 1024); offset+=wasmRefs.ZERO1024.length;\n  // Init wasm memory needed locally\n  const lz = new Uint32Array(memory.buffer, offset, 2); offset+=lz.length * Uint32Array.BYTES_PER_ELEMENT;\n  const wasmContext = { fn: wasmFn, refs: wasmRefs };\n  const newBlock = new Uint8Array(memory.buffer, offset, ARGON2_BLOCK_SIZE); offset+=newBlock.length;\n  const blockMemory = new Uint8Array(memory.buffer, offset, ctx.memorySize * ARGON2_BLOCK_SIZE);\n  const allocatedMemory = new Uint8Array(memory.buffer, 0, offset);\n\n  // 1. Establish H_0\n  const H0 = getH0(ctx);\n\n  // 2. Allocate the memory as m' 1024-byte blocks\n  // For p lanes, the memory is organized in a matrix B[i][j] of blocks with p rows (lanes) and q = m' / p columns.\n  const q = m_ / ctx.lanes;\n  const B = new Array(ctx.lanes).fill(null).map(() => new Array(q));\n  const initBlock = (i, j) => {\n    B[i][j] = blockMemory.subarray(i*q*1024 + j*1024, (i*q*1024 + j*1024) + ARGON2_BLOCK_SIZE);\n    return B[i][j];\n  };\n\n  for (let i = 0; i < ctx.lanes; i++) {\n    // const LEi = LE0; //  since p = 1 for us\n    const tmp = new Uint8Array(H0.length + 8);\n    // 3. Compute B[i][0] for all i ranging from (and including) 0 to (not including) p\n    // B[i][0] = H'^(1024)(H_0 || LE32(0) || LE32(i))\n    tmp.set(H0); LE32(tmp, 0, H0.length); LE32(tmp, i, H0.length + 4);\n    H_(ARGON2_BLOCK_SIZE, tmp, initBlock(i, 0));\n    // 4. Compute B[i][1] for all i ranging from (and including) 0 to (not including) p\n    // B[i][1] = H'^(1024)(H_0 || LE32(1) || LE32(i))\n    LE32(tmp, 1, H0.length);\n    H_(ARGON2_BLOCK_SIZE, tmp, initBlock(i, 1));\n  }\n\n    // 5. Compute B[i][j] for all i ranging from (and including) 0 to (not including) p and for all j ranging from (and including) 2\n    // to (not including) q. The computation MUST proceed slicewise (Section 3.4) : first, blocks from slice 0 are computed for all lanes\n    // (in an arbitrary order of lanes), then blocks from slice 1 are computed, etc.\n  const SL = 4; // vertical slices\n  const segmentLength = q / SL;\n  for (let pass = 0; pass < ctx.passes; pass++) {\n      // The intersection of a slice and a lane is called a segment, which has a length of q/SL. Segments of the same slice can be computed in parallel\n    for (let sl = 0; sl < SL; sl++) {\n      const isDataIndependent = pass === 0 && sl <= 1;\n      for (let i = 0; i < ctx.lanes; i++) { // lane\n        // On the first slice of the first pass, blocks 0 and 1 are already filled\n        let segmentOffset = sl === 0 && pass === 0 ? 2 : 0;\n        // no need to generate all J1J2s, use iterator/generator that creates the value on the fly (to save memory)\n        const PRNG = isDataIndependent ? makePRNG(wasmContext, pass, i, sl, m_, ctx.passes, segmentLength, segmentOffset) : null;\n        for (segmentOffset; segmentOffset < segmentLength; segmentOffset++) {\n          const j = sl * segmentLength + segmentOffset;\n          const prevBlock = j > 0 ? B[i][j-1] : B[i][q-1]; // B[i][(j-1) mod q]\n\n          // we can assume the PRNG is never done\n          const J1J2 = isDataIndependent ? PRNG.next().value : prevBlock; // .subarray(0, 8) not required since we only pass the byteOffset to wasm\n          // The block indices l and z are determined for each i, j differently for Argon2d, Argon2i, and Argon2id.\n          wasmLZ(lz.byteOffset, J1J2.byteOffset, i, ctx.lanes, pass, sl, segmentOffset, SL, segmentLength);\n          const l = lz[0]; const z = lz[1];\n          // for (let i = 0; i < p; i++ )\n          // B[i][j] = G(B[i][j-1], B[l][z])\n          // The block indices l and z are determined for each i, j differently for Argon2d, Argon2i, and Argon2id.\n          if (pass === 0) initBlock(i, j);\n          G(wasmContext, prevBlock, B[l][z], pass > 0 ? newBlock : B[i][j]);\n\n          // 6. If the number of passes t is larger than 1, we repeat step 5. However, blocks are computed differently as the old value is XORed with the new one\n          if (pass > 0) XOR(wasmContext, B[i][j], newBlock, B[i][j]);\n        }\n      }\n    }\n  }\n\n  // 7. After t steps have been iterated, the final block C is computed as the XOR of the last column:\n  // C = B[0][q-1] XOR B[1][q-1] XOR ... XOR B[p-1][q-1]\n  const C = B[0][q-1];\n  for(let i = 1; i < ctx.lanes; i++) {\n    XOR(wasmContext, C, C, B[i][q-1]);\n  }\n\n  const tag = H_(ctx.tagLength, C, new Uint8Array(ctx.tagLength));\n  // clear memory since the module might be cached\n  allocatedMemory.fill(0); // clear sensitive contents\n  memory.grow(0); // allow deallocation\n  // 8. The output tag is computed as H'^T(C).\n  return tag;\n\n}\n\nfunction getH0(ctx) {\n  const H = createHash(ARGON2_PREHASH_DIGEST_LENGTH);\n  const ZERO32 = new Uint8Array(4);\n  const params = new Uint8Array(24);\n  LE32(params, ctx.lanes, 0);\n  LE32(params, ctx.tagLength, 4);\n  LE32(params, ctx.memorySize, 8);\n  LE32(params, ctx.passes, 12);\n  LE32(params, ctx.version, 16);\n  LE32(params, ctx.type, 20);\n\n  const toHash = [params];\n  if (ctx.password) {\n    toHash.push(LE32(new Uint8Array(4), ctx.password.length, 0));\n    toHash.push(ctx.password);\n  } else {\n    toHash.push(ZERO32); // context.password.length\n  }\n\n  if (ctx.salt) {\n    toHash.push(LE32(new Uint8Array(4), ctx.salt.length, 0));\n    toHash.push(ctx.salt);\n  } else {\n    toHash.push(ZERO32); // context.salt.length\n  }\n\n  if (ctx.secret) {\n    toHash.push(LE32(new Uint8Array(4), ctx.secret.length, 0));\n    toHash.push(ctx.secret);\n    // todo clear secret?\n  } else {\n    toHash.push(ZERO32); // context.secret.length\n  }\n\n  if (ctx.ad) {\n    toHash.push(LE32(new Uint8Array(4), ctx.ad.length, 0));\n    toHash.push(ctx.ad);\n  } else {\n    toHash.push(ZERO32); // context.ad.length\n  }\n  H.update(concatArrays(toHash));\n\n  const outputBuffer = H.digest();\n  return new Uint8Array(outputBuffer);\n}\n\nfunction concatArrays(arrays) {\n  if (arrays.length === 1) return arrays[0];\n\n  let totalLength = 0;\n  for (let i = 0; i < arrays.length; i++) {\n      if (!(arrays[i] instanceof Uint8Array)) {\n          throw new Error('concatArrays: Data must be in the form of a Uint8Array');\n      }\n\n      totalLength += arrays[i].length;\n  }\n\n  const result = new Uint8Array(totalLength);\n  let pos = 0;\n  arrays.forEach((element) => {\n      result.set(element, pos);\n      pos += element.length;\n  });\n\n  return result;\n}\n\nlet isSIMDSupported;\nasync function wasmLoader(memory, getSIMD, getNonSIMD) {\n  const importObject = { env: { memory } };\n  if (isSIMDSupported === undefined) {\n    try {\n      const loaded = await getSIMD(importObject);\n      isSIMDSupported = true;\n      return loaded;\n    } catch(e) {\n      isSIMDSupported = false;\n    }\n  }\n\n  const loader = isSIMDSupported ? getSIMD : getNonSIMD;\n  return loader(importObject);\n}\n\nasync function setupWasm(getSIMD, getNonSIMD) {\n  const memory = new WebAssembly.Memory({\n    // in pages of 64KiB each\n    // these values need to be compatible with those declared when building in `build-wasm`\n    initial: 1040,  // 65MB\n    maximum: 65536, // 4GB\n  });\n  const wasmModule = await wasmLoader(memory, getSIMD, getNonSIMD);\n\n  /**\n   * Argon2id hash function\n   * @callback computeHash\n   * @param {Object} params\n   * @param {Uint8Array} params.password - password\n   * @param {Uint8Array} params.salt - salt\n   * @param {Integer} params.parallelism\n   * @param {Integer} params.passes\n   * @param {Integer} params.memorySize - in kibibytes\n   * @param {Integer} params.tagLength - output tag length\n   * @param {Uint8Array} [params.ad] - associated data (optional)\n   * @param {Uint8Array} [params.secret] - secret data (optional)\n   * @return {Uint8Array} argon2id hash\n   */\n  const computeHash = (params) => argon2id(params, { instance: wasmModule.instance, memory });\n\n  return computeHash;\n}\n\nfunction _loadWasmModule (sync, filepath, src, imports) {\n  function _instantiateOrCompile(source, imports, stream) {\n    var instantiateFunc = stream ? WebAssembly.instantiateStreaming : WebAssembly.instantiate;\n    var compileFunc = stream ? WebAssembly.compileStreaming : WebAssembly.compile;\n\n    if (imports) {\n      return instantiateFunc(source, imports)\n    } else {\n      return compileFunc(source)\n    }\n  }\n\n  \nvar buf = null;\n\n\nvar raw = globalThis.atob(src);\nvar rawLength = raw.length;\nbuf = new Uint8Array(new ArrayBuffer(rawLength));\nfor(var i = 0; i < rawLength; i++) {\n   buf[i] = raw.charCodeAt(i);\n}\n\n\n\n  {\n    return _instantiateOrCompile(buf, imports, false)\n  }\n}\n\nfunction wasmSIMD(imports){return _loadWasmModule(0, null, 'AGFzbQEAAAABKwdgBH9/f38AYAABf2AAAGADf39/AGAJf39/f39/f39/AX9gAX8AYAF/AX8CEwEDZW52Bm1lbW9yeQIBkAiAgAQDCgkCAwAABAEFBgEEBQFwAQICBgkBfwFBkIjAAgsHfQoDeG9yAAEBRwACAkcyAAMFZ2V0TFoABBlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALX2luaXRpYWxpemUAABBfX2Vycm5vX2xvY2F0aW9uAAgJc3RhY2tTYXZlAAUMc3RhY2tSZXN0b3JlAAYKc3RhY2tBbGxvYwAHCQcBAEEBCwEACs0gCQMAAQtYAQJ/A0AgACAEQQR0IgNqIAIgA2r9AAQAIAEgA2r9AAQA/VH9CwQAIAAgA0EQciIDaiACIANq/QAEACABIANq/QAEAP1R/QsEACAEQQJqIgRBwABHDQALC7ceAgt7A38DQCADIBFBBHQiD2ogASAPav0ABAAgACAPav0ABAD9USIF/QsEACACIA9qIAX9CwQAIAMgD0EQciIPaiABIA9q/QAEACAAIA9q/QAEAP1RIgX9CwQAIAIgD2ogBf0LBAAgEUECaiIRQcAARw0ACwNAIAMgEEEHdGoiAEEQaiAA/QAEcCAA/QAEMCIFIAD9AAQQIgT9zgEgBSAF/Q0AAQIDCAkKCwABAgMICQoLIAQgBP0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgT9USIJQSD9ywEgCUEg/c0B/VAiCSAA/QAEUCIG/c4BIAkgCf0NAAECAwgJCgsAAQIDCAkKCyAGIAb9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIGIAX9USIFQSj9ywEgBUEY/c0B/VAiCCAE/c4BIAggCP0NAAECAwgJCgsAAQIDCAkKCyAEIAT9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIKIAogCf1RIgVBMP3LASAFQRD9zQH9UCIFIAb9zgEgBSAF/Q0AAQIDCAkKCwABAgMICQoLIAYgBv0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgkgCP1RIgRBAf3LASAEQT/9zQH9UCIMIAD9AARgIAD9AAQgIgQgAP0ABAAiBv3OASAEIAT9DQABAgMICQoLAAECAwgJCgsgBiAG/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBv1RIghBIP3LASAIQSD9zQH9UCIIIABBQGsiAf0ABAAiB/3OASAIIAj9DQABAgMICQoLAAECAwgJCgsgByAH/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiByAE/VEiBEEo/csBIARBGP3NAf1QIgsgBv3OASALIAv9DQABAgMICQoLAAECAwgJCgsgBiAG/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBiAI/VEiBEEw/csBIARBEP3NAf1QIgQgB/3OASAEIAT9DQABAgMICQoLAAECAwgJCgsgByAH/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiCCAL/VEiB0EB/csBIAdBP/3NAf1QIg0gDf0NAAECAwQFBgcQERITFBUWF/0NCAkKCwwNDg8YGRobHB0eHyIH/c4BIAcgB/0NAAECAwgJCgsAAQIDCAkKCyAKIAr9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIKIAQgBSAF/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4f/VEiC0Eg/csBIAtBIP3NAf1QIgsgCP3OASALIAv9DQABAgMICQoLAAECAwgJCgsgCCAI/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiCCAH/VEiB0Eo/csBIAdBGP3NAf1QIgcgCv3OASAHIAf9DQABAgMICQoLAAECAwgJCgsgCiAK/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiDv0LBAAgACAGIA0gDCAM/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4fIgr9zgEgCiAK/Q0AAQIDCAkKCwABAgMICQoLIAYgBv0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgYgBSAEIAT9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh/9USIFQSD9ywEgBUEg/c0B/VAiBSAJ/c4BIAUgBf0NAAECAwgJCgsAAQIDCAkKCyAJIAn9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIJIAr9USIEQSj9ywEgBEEY/c0B/VAiCiAG/c4BIAogCv0NAAECAwgJCgsAAQIDCAkKCyAGIAb9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIE/QsEACAAIAQgBf1RIgVBMP3LASAFQRD9zQH9UCIFIA4gC/1RIgRBMP3LASAEQRD9zQH9UCIEIAT9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh/9CwRgIAAgBCAFIAX9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh/9CwRwIAEgBCAI/c4BIAQgBP0NAAECAwgJCgsAAQIDCAkKCyAIIAj9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIE/QsEACAAIAUgCf3OASAFIAX9DQABAgMICQoLAAECAwgJCgsgCSAJ/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiCf0LBFAgACAEIAf9USIFQQH9ywEgBUE//c0B/VAiBSAJIAr9USIEQQH9ywEgBEE//c0B/VAiBCAE/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4f/QsEICAAIAQgBSAF/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4f/QsEMCAQQQFqIhBBCEcNAAtBACEQA0AgAyAQQQR0aiIAQYABaiAA/QAEgAcgAP0ABIADIgUgAP0ABIABIgT9zgEgBSAF/Q0AAQIDCAkKCwABAgMICQoLIAQgBP0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgT9USIJQSD9ywEgCUEg/c0B/VAiCSAA/QAEgAUiBv3OASAJIAn9DQABAgMICQoLAAECAwgJCgsgBiAG/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBiAF/VEiBUEo/csBIAVBGP3NAf1QIgggBP3OASAIIAj9DQABAgMICQoLAAECAwgJCgsgBCAE/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiCiAKIAn9USIFQTD9ywEgBUEQ/c0B/VAiBSAG/c4BIAUgBf0NAAECAwgJCgsAAQIDCAkKCyAGIAb9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIJIAj9USIEQQH9ywEgBEE//c0B/VAiDCAA/QAEgAYgAP0ABIACIgQgAP0ABAAiBv3OASAEIAT9DQABAgMICQoLAAECAwgJCgsgBiAG/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBv1RIghBIP3LASAIQSD9zQH9UCIIIAD9AASABCIH/c4BIAggCP0NAAECAwgJCgsAAQIDCAkKCyAHIAf9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIHIAT9USIEQSj9ywEgBEEY/c0B/VAiCyAG/c4BIAsgC/0NAAECAwgJCgsAAQIDCAkKCyAGIAb9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIGIAj9USIEQTD9ywEgBEEQ/c0B/VAiBCAH/c4BIAQgBP0NAAECAwgJCgsAAQIDCAkKCyAHIAf9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIIIAv9USIHQQH9ywEgB0E//c0B/VAiDSAN/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4fIgf9zgEgByAH/Q0AAQIDCAkKCwABAgMICQoLIAogCv0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgogBCAFIAX9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh/9USILQSD9ywEgC0Eg/c0B/VAiCyAI/c4BIAsgC/0NAAECAwgJCgsAAQIDCAkKCyAIIAj9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIIIAf9USIHQSj9ywEgB0EY/c0B/VAiByAK/c4BIAcgB/0NAAECAwgJCgsAAQIDCAkKCyAKIAr9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIO/QsEACAAIAYgDSAMIAz9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh8iCv3OASAKIAr9DQABAgMICQoLAAECAwgJCgsgBiAG/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBiAFIAQgBP0NAAECAwQFBgcQERITFBUWF/0NCAkKCwwNDg8YGRobHB0eH/1RIgVBIP3LASAFQSD9zQH9UCIFIAn9zgEgBSAF/Q0AAQIDCAkKCwABAgMICQoLIAkgCf0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgkgCv1RIgRBKP3LASAEQRj9zQH9UCIKIAb9zgEgCiAK/Q0AAQIDCAkKCwABAgMICQoLIAYgBv0NAAECAwgJCgsAAQIDCAkKC/3eAUEB/csB/c4BIgT9CwQAIAAgBCAF/VEiBUEw/csBIAVBEP3NAf1QIgUgDiAL/VEiBEEw/csBIARBEP3NAf1QIgQgBP0NAAECAwQFBgcQERITFBUWF/0NCAkKCwwNDg8YGRobHB0eH/0LBIAGIAAgBCAFIAX9DQABAgMEBQYHEBESExQVFhf9DQgJCgsMDQ4PGBkaGxwdHh/9CwSAByAAIAQgCP3OASAEIAT9DQABAgMICQoLAAECAwgJCgsgCCAI/Q0AAQIDCAkKCwABAgMICQoL/d4BQQH9ywH9zgEiBP0LBIAEIAAgBSAJ/c4BIAUgBf0NAAECAwgJCgsAAQIDCAkKCyAJIAn9DQABAgMICQoLAAECAwgJCgv93gFBAf3LAf3OASIJ/QsEgAUgACAEIAf9USIFQQH9ywEgBUE//c0B/VAiBSAJIAr9USIEQQH9ywEgBEE//c0B/VAiBCAE/Q0AAQIDBAUGBxAREhMUFRYX/Q0ICQoLDA0ODxgZGhscHR4f/QsEgAIgACAEIAUgBf0NAAECAwQFBgcQERITFBUWF/0NCAkKCwwNDg8YGRobHB0eH/0LBIADIBBBAWoiEEEIRw0AC0EAIRADQCACIBBBBHQiAGoiASAAIANq/QAEACAB/QAEAP1R/QsEACACIABBEHIiAWoiDyABIANq/QAEACAP/QAEAP1R/QsEACACIABBIHIiAWoiDyABIANq/QAEACAP/QAEAP1R/QsEACACIABBMHIiAGoiASAAIANq/QAEACAB/QAEAP1R/QsEACAQQQRqIhBBwABHDQALCxYAIAAgASACIAMQAiAAIAIgAiADEAILewIBfwF+IAIhCSABNQIAIQogBCAFcgRAIAEoAgQgA3AhCQsgACAJNgIAIAAgB0EBayAFIAQbIAhsIAZBAWtBAEF/IAYbIAIgCUYbaiIBIAVBAWogCGxBACAEG2ogAa0gCiAKfkIgiH5CIIinQX9zaiAHIAhscDYCBCAACwQAIwALBgAgACQACxAAIwAgAGtBcHEiACQAIAALBQBBgAgL', imports)}\n\nfunction wasmNonSIMD(imports){return _loadWasmModule(0, null, 'AGFzbQEAAAABPwhgBH9/f38AYAABf2AAAGADf39/AGARf39/f39/f39/f39/f39/f38AYAl/f39/f39/f38Bf2ABfwBgAX8BfwITAQNlbnYGbWVtb3J5AgGQCICABAMLCgIDBAAABQEGBwEEBQFwAQICBgkBfwFBkIjAAgsHfQoDeG9yAAEBRwADAkcyAAQFZ2V0TFoABRlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALX2luaXRpYWxpemUAABBfX2Vycm5vX2xvY2F0aW9uAAkJc3RhY2tTYXZlAAYMc3RhY2tSZXN0b3JlAAcKc3RhY2tBbGxvYwAICQcBAEEBCwEACssaCgMAAQtQAQJ/A0AgACAEQQN0IgNqIAIgA2opAwAgASADaikDAIU3AwAgACADQQhyIgNqIAIgA2opAwAgASADaikDAIU3AwAgBEECaiIEQYABRw0ACwveDwICfgF/IAAgAUEDdGoiEyATKQMAIhEgACAFQQN0aiIBKQMAIhJ8IBFCAYZC/v///x+DIBJC/////w+DfnwiETcDACAAIA1BA3RqIgUgESAFKQMAhUIgiSIRNwMAIAAgCUEDdGoiCSARIAkpAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAEgESABKQMAhUIoiSIRNwMAIBMgESATKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACAFIBEgBSkDAIVCMIkiETcDACAJIBEgCSkDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgASARIAEpAwCFQgGJNwMAIAAgAkEDdGoiDSANKQMAIhEgACAGQQN0aiICKQMAIhJ8IBFCAYZC/v///x+DIBJC/////w+DfnwiETcDACAAIA5BA3RqIgYgESAGKQMAhUIgiSIRNwMAIAAgCkEDdGoiCiARIAopAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAIgESACKQMAhUIoiSIRNwMAIA0gESANKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACAGIBEgBikDAIVCMIkiETcDACAKIBEgCikDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgAiARIAIpAwCFQgGJNwMAIAAgA0EDdGoiDiAOKQMAIhEgACAHQQN0aiIDKQMAIhJ8IBFCAYZC/v///x+DIBJC/////w+DfnwiETcDACAAIA9BA3RqIgcgESAHKQMAhUIgiSIRNwMAIAAgC0EDdGoiCyARIAspAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAMgESADKQMAhUIoiSIRNwMAIA4gESAOKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACAHIBEgBykDAIVCMIkiETcDACALIBEgCykDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgAyARIAMpAwCFQgGJNwMAIAAgBEEDdGoiDyAPKQMAIhEgACAIQQN0aiIEKQMAIhJ8IBFCAYZC/v///x+DIBJC/////w+DfnwiETcDACAAIBBBA3RqIgggESAIKQMAhUIgiSIRNwMAIAAgDEEDdGoiACARIAApAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAQgESAEKQMAhUIoiSIRNwMAIA8gESAPKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACAIIBEgCCkDAIVCMIkiETcDACAAIBEgACkDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgBCARIAQpAwCFQgGJNwMAIBMgEykDACIRIAIpAwAiEnwgEUIBhkL+////H4MgEkL/////D4N+fCIRNwMAIAggESAIKQMAhUIgiSIRNwMAIAsgESALKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACACIBEgAikDAIVCKIkiETcDACATIBEgEykDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgCCARIAgpAwCFQjCJIhE3AwAgCyARIAspAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAIgESACKQMAhUIBiTcDACANIA0pAwAiESADKQMAIhJ8IBFCAYZC/v///x+DIBJC/////w+DfnwiETcDACAFIBEgBSkDAIVCIIkiETcDACAAIBEgACkDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgAyARIAMpAwCFQiiJIhE3AwAgDSARIA0pAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAUgESAFKQMAhUIwiSIRNwMAIAAgESAAKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACADIBEgAykDAIVCAYk3AwAgDiAOKQMAIhEgBCkDACISfCARQgGGQv7///8fgyASQv////8Pg358IhE3AwAgBiARIAYpAwCFQiCJIhE3AwAgCSARIAkpAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAQgESAEKQMAhUIoiSIRNwMAIA4gESAOKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACAGIBEgBikDAIVCMIkiETcDACAJIBEgCSkDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgBCARIAQpAwCFQgGJNwMAIA8gDykDACIRIAEpAwAiEnwgEUIBhkL+////H4MgEkL/////D4N+fCIRNwMAIAcgESAHKQMAhUIgiSIRNwMAIAogESAKKQMAIhJ8IBFC/////w+DIBJCAYZC/v///x+DfnwiETcDACABIBEgASkDAIVCKIkiETcDACAPIBEgDykDACISfCARQv////8PgyASQgGGQv7///8fg358IhE3AwAgByARIAcpAwCFQjCJIhE3AwAgCiARIAopAwAiEnwgEUL/////D4MgEkIBhkL+////H4N+fCIRNwMAIAEgESABKQMAhUIBiTcDAAvdCAEPfwNAIAIgBUEDdCIGaiABIAZqKQMAIAAgBmopAwCFNwMAIAIgBkEIciIGaiABIAZqKQMAIAAgBmopAwCFNwMAIAVBAmoiBUGAAUcNAAsDQCADIARBA3QiAGogACACaikDADcDACADIARBAXIiAEEDdCIBaiABIAJqKQMANwMAIAMgBEECciIBQQN0IgVqIAIgBWopAwA3AwAgAyAEQQNyIgVBA3QiBmogAiAGaikDADcDACADIARBBHIiBkEDdCIHaiACIAdqKQMANwMAIAMgBEEFciIHQQN0IghqIAIgCGopAwA3AwAgAyAEQQZyIghBA3QiCWogAiAJaikDADcDACADIARBB3IiCUEDdCIKaiACIApqKQMANwMAIAMgBEEIciIKQQN0IgtqIAIgC2opAwA3AwAgAyAEQQlyIgtBA3QiDGogAiAMaikDADcDACADIARBCnIiDEEDdCINaiACIA1qKQMANwMAIAMgBEELciINQQN0Ig5qIAIgDmopAwA3AwAgAyAEQQxyIg5BA3QiD2ogAiAPaikDADcDACADIARBDXIiD0EDdCIQaiACIBBqKQMANwMAIAMgBEEOciIQQQN0IhFqIAIgEWopAwA3AwAgAyAEQQ9yIhFBA3QiEmogAiASaikDADcDACADIARB//8DcSAAQf//A3EgAUH//wNxIAVB//8DcSAGQf//A3EgB0H//wNxIAhB//8DcSAJQf//A3EgCkH//wNxIAtB//8DcSAMQf//A3EgDUH//wNxIA5B//8DcSAPQf//A3EgEEH//wNxIBFB//8DcRACIARB8ABJIQAgBEEQaiEEIAANAAtBACEBIANBAEEBQRBBEUEgQSFBMEExQcAAQcEAQdAAQdEAQeAAQeEAQfAAQfEAEAIgA0ECQQNBEkETQSJBI0EyQTNBwgBBwwBB0gBB0wBB4gBB4wBB8gBB8wAQAiADQQRBBUEUQRVBJEElQTRBNUHEAEHFAEHUAEHVAEHkAEHlAEH0AEH1ABACIANBBkEHQRZBF0EmQSdBNkE3QcYAQccAQdYAQdcAQeYAQecAQfYAQfcAEAIgA0EIQQlBGEEZQShBKUE4QTlByABByQBB2ABB2QBB6ABB6QBB+ABB+QAQAiADQQpBC0EaQRtBKkErQTpBO0HKAEHLAEHaAEHbAEHqAEHrAEH6AEH7ABACIANBDEENQRxBHUEsQS1BPEE9QcwAQc0AQdwAQd0AQewAQe0AQfwAQf0AEAIgA0EOQQ9BHkEfQS5BL0E+QT9BzgBBzwBB3gBB3wBB7gBB7wBB/gBB/wAQAgNAIAIgAUEDdCIAaiIEIAAgA2opAwAgBCkDAIU3AwAgAiAAQQhyIgRqIgUgAyAEaikDACAFKQMAhTcDACACIABBEHIiBGoiBSADIARqKQMAIAUpAwCFNwMAIAIgAEEYciIAaiIEIAAgA2opAwAgBCkDAIU3AwAgAUEEaiIBQYABRw0ACwsWACAAIAEgAiADEAMgACACIAIgAxADC3sCAX8BfiACIQkgATUCACEKIAQgBXIEQCABKAIEIANwIQkLIAAgCTYCACAAIAdBAWsgBSAEGyAIbCAGQQFrQQBBfyAGGyACIAlGG2oiASAFQQFqIAhsQQAgBBtqIAGtIAogCn5CIIh+QiCIp0F/c2ogByAIbHA2AgQgAAsEACMACwYAIAAkAAsQACMAIABrQXBxIgAkACAACwUAQYAICw==', imports)}\n\nconst loadWasm = async () => setupWasm(\n  (instanceObject) => wasmSIMD(instanceObject),\n  (instanceObject) => wasmNonSIMD(instanceObject),\n);\n\nexport { loadWasm as default };\n"],"x_google_ignoreList":[0],"mappings":";;AACA,IAAMA,eAAa,OAAO,WAAW,cAAc,SAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAC;AAY3I,SAAS,MAAO,GAAG,GAAG,GAAG,GAAG;CAC1B,EAAE,MAAM,EAAE;CACV,EAAE,IAAE,MAAM,EAAE,IAAE,MAAM,EAAE,KAAK,EAAE;AAC/B;AAIA,SAAS,MAAO,GAAG,GAAG;CACpB,EAAE,MAAM;CACR,EAAE,MAAO,EAAE,KAAK;AAClB;AAIA,SAAS,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI;CACtC,MAAM,GAAG,GAAG,GAAG,CAAC;CAChB,MAAM,GAAG,GAAG,GAAG,EAAE;CAGjB,IAAI,OAAO,EAAE,KAAK,EAAE;CACpB,IAAI,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI;CAC5B,EAAE,KAAK;CACP,EAAE,IAAI,KAAK;CAEX,MAAM,GAAG,GAAG,GAAG,CAAC;CAGhB,OAAO,EAAE,KAAK,EAAE;CAChB,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI;CACxB,EAAE,KAAM,SAAS,KAAO,QAAQ;CAChC,EAAE,IAAI,KAAM,SAAS,KAAO,QAAQ;CAEpC,MAAM,GAAG,GAAG,GAAG,CAAC;CAChB,MAAM,GAAG,GAAG,GAAG,EAAE;CAGjB,OAAO,EAAE,KAAK,EAAE;CAChB,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI;CACxB,EAAE,KAAM,SAAS,KAAO,QAAQ;CAChC,EAAE,IAAI,KAAM,SAAS,KAAO,QAAQ;CAEpC,MAAM,GAAG,GAAG,GAAG,CAAC;CAGhB,OAAO,EAAE,KAAK,EAAE;CAChB,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI;CACxB,EAAE,KAAM,SAAS,KAAO,QAAQ;CAChC,EAAE,IAAI,KAAM,SAAS,KAAO,QAAQ;AACtC;AAGA,IAAM,eAAe,IAAI,YAAY;CACnC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;AACtC,CAAC;AAID,IAAM,QAAQ,IAAI,WAAW;CAC3B;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAClD;CAAI;CAAI;CAAG;CAAG;CAAG;CAAI;CAAI;CAAG;CAAG;CAAI;CAAG;CAAG;CAAI;CAAG;CAAG;CACnD;CAAI;CAAG;CAAI;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CACnD;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAI;CAAG;CAAG;CAAI;CACnD;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAG;CAAG;CAAG;CAClD;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAG;CAAG;CAAI;CAAG;CAAG;CAAI;CAAI;CAAG;CACnD;CAAI;CAAG;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAClD;CAAI;CAAI;CAAG;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAG;CAAG;CAAG;CAClD;CAAG;CAAI;CAAI;CAAG;CAAI;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAG;CAAG;CAAI;CACnD;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAG;CAAI;CAAG;CAAI;CAAI;CACnD;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAClD;CAAI;CAAI;CAAG;CAAG;CAAG;CAAI;CAAI;CAAG;CAAG;CAAI;CAAG;CAAG;CAAI;CAAG;CAAG;AACrD,CAAC,CAAC,KAAI,MAAK,IAAI,CAAC,CAAC;AAIjB,SAAS,SAAS,GAAG,MAAM;CACzB,MAAM,oBAAI,IAAI,YAAY,EAAE;CAC5B,MAAM,IAAI,IAAI,YAAY,EAAE,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE;CAGxD,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,EAAE,KAAK,EAAE,EAAE;EACX,EAAE,IAAI,MAAM,aAAa;CAC3B;CAGA,EAAE,OAAO,EAAE,GAAG;CACd,EAAE,OAAO,EAAE,GAAG;CAId,MAAM,KAAK,OAAO,aAAa;CAC/B,EAAE,OAAO;CACT,EAAE,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAE3B,MAAM,MAAM,KAAK;EACjB,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAK,MAAM,MAAM,IAAI,MAAM,MAAM,EAAE;EACvD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,EAAE;EACvD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,EAAE;EACvD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,EAAE;EACvD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,EAAE;EACvD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,KAAK,MAAM,MAAM,GAAG;EACzD,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,KAAK,MAAM,MAAM,GAAG;EACzD,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAK,MAAM,MAAM,KAAK,MAAM,MAAM,GAAG;CAC3D;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACtB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI;AAE3B;AAKA,IAAM,UAAN,MAAc;CACZ,YAAY,QAAQ,KAAK,MAAM,UAAU;EACvC,MAAM,yBAAS,IAAI,WAAW,EAAE;EAmBhC,KAAK,IAAI;GACP,GAAG,IAAI,WAAW,UAAU;GAC5B,GAAG,IAAI,YAAY,eAAe,CAAC;GACnC,oBAAI,IAAI,YAAY,CAAC;GACrB,GAAG;GACH;EACF;EAGA,OAAO,KAAK;EACZ,IAAI,KAAK,OAAO,KAAK,IAAI;EACzB,OAAO,KAAK;EACZ,OAAO,KAAK;EACZ,IAAI,MAAM,OAAO,IAAI,MAAM,EAAE;EAC7B,IAAI,UAAU,OAAO,IAAI,UAAU,EAAE;EACrC,MAAM,WAAW,IAAI,YAAY,OAAO,QAAQ,OAAO,YAAY,OAAO,SAAS,YAAY,iBAAiB;EAGhH,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACtB,KAAK,EAAE,EAAE,KAAK,aAAa,KAAK,SAAS;EAI3C,IAAI,KAAK;GACP,MAAM,QAAQ,IAAI,WAAW,UAAU;GACvC,MAAM,IAAI,GAAG;GACb,KAAK,OAAO,KAAK;EACnB;CACF;CAIA,OAAO,OAAO;EACZ,IAAI,EAAE,iBAAiB,aAAa,MAAM,IAAI,MAAM,oCAAoC;EASxF,IAAI,IAAI;EACR,OAAM,IAAI,MAAM,QAAQ;GACtB,IAAI,KAAK,EAAE,MAAM,YAAY;IAC3B,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;IACzB,SAAS,KAAK,GAAG,KAAK;IACtB,KAAK,EAAE,IAAI;GACb;GACA,IAAI,OAAO,aAAa,KAAK,EAAE;GAC/B,KAAK,EAAE,EAAE,IAAI,MAAM,SAAS,GAAG,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;GAClD,MAAM,OAAO,KAAK,IAAI,MAAM,MAAM,SAAS,CAAC;GAC5C,KAAK,EAAE,KAAK;GACZ,KAAK;EACP;EACA,OAAO;CACT;;;;;;CAOA,OAAO,UAAU;EACf,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;EAGzB,KAAK,EAAE,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC;EACzB,KAAK,EAAE,IAAI;EACX,SAAS,KAAK,GAAG,IAAI;EAErB,MAAM,MAAM,YAAY,IAAI,WAAW,KAAK,EAAE,MAAM;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,QAAQ,KAEjC,IAAI,KAAK,KAAK,EAAE,EAAE,KAAK,MAAO,KAAK,IAAI;EAEzC,KAAK,EAAE,IAAI;EACX,OAAO,IAAI;CACb;AACF;AAGA,SAAS,WAAW,QAAQ,KAAK,MAAM,UAAU;CAC/C,IAAI,SAAS,cAAc,MAAM,IAAI,MAAM,0BAA0B,aAAa,WAAW,OAAO,EAAE;CAEtG,OAAO,IAAI,QAAQ,QAAQ,KAAK,MAAM,QAAQ;AAChD;AAEA,IAAM,eAAe;AACrB,IAAM,aAAa;AAEnB,IAAM,OAAO;AACb,IAAM,UAAU;AAChB,IAAM,eAAe;AACrB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAC1B,IAAM,oBAAoB;AAC1B,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,kBAAkB;AAExB,IAAM,oBAAoB;AAC1B,IAAM,+BAA+B;AAErC,IAAM,iBAAiB,IAAI,WAAW,IAAI,YAAY,CAAC,KAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO;AAG/E,SAAS,KAAK,KAAK,GAAG,GAAG;CACvB,IAAI,IAAE,KAAK;CACX,IAAI,IAAE,KAAK,KAAM;CACjB,IAAI,IAAE,KAAK,KAAK;CAChB,IAAI,IAAE,KAAK,KAAK;CAChB,OAAO;AACT;;;;;;;AAQA,SAAS,KAAK,KAAK,GAAG,GAAG;CACvB,IAAI,IAAI,OAAO,kBAAkB,MAAM,IAAI,MAAM,iCAAiC;CAIlF,IAAI,YAAY;CAChB,KAAK,IAAI,SAAS,GAAG,SAAS,IAAE,GAAG,UAAU;EAC3C,IAAI,UAAU;EACd,aAAa,YAAY,IAAI,WAAW;CAC1C;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,GAAG,QAAQ,GAAG,KAAK;CAC1B,MAAM,oBAAI,IAAI,WAAW,EAAE;CAE3B,MAAM,QAAQ,IAAI,WAAW,IAAI,EAAE,MAAM;CACzC,KAAK,OAAO,QAAQ,CAAC;CACrB,MAAM,IAAI,GAAG,CAAC;CACd,IAAI,UAAU,IAAI;EAEhB,WAAW,MAAM,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,GAAG;EAC3C,OAAO;CACT;CAEA,MAAM,IAAI,KAAK,KAAK,SAAS,EAAE,IAAI;CASnC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,WAAW,EAAE,CAAC,CAAC,OAAO,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;EAEnD,IAAI,IAAI,EAAE,SAAS,GAAG,EAAE,GAAG,IAAE,EAAE;CACjC;CAEA,MAAM,OAAO,IAAI,WAAW,WAAW,SAAS,KAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;CACxE,IAAI,IAAI,MAAM,IAAE,EAAE;CAElB,OAAO;AACT;AAGA,SAAS,IAAI,aAAa,KAAK,IAAI,IAAI;CACrC,YAAY,GAAG,IACb,IAAI,YACJ,GAAG,YACH,GAAG,UACL;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,EAAE,aAAa,GAAG,GAAG,GAAG;CAC/B,YAAY,GAAG,EACb,EAAE,YACF,EAAE,YACF,EAAE,YACF,YAAY,KAAK,GAAG,UACtB;CACA,OAAO;AACT;AAEA,SAAS,GAAG,aAAa,GAAG,GAAG,GAAG;CAChC,YAAY,GAAG,GACb,EAAE,YACF,EAAE,YACF,EAAE,YACF,YAAY,KAAK,GAAG,UACtB;CACA,OAAO;AACT;AAGA,UAAU,SAAS,aAAa,MAAM,MAAM,OAAO,IAAI,aAAa,eAAe,eAAe;CAGhG,YAAY,KAAK,QAAQ,KAAK,CAAC;CAC/B,MAAM,IAAI,YAAY,KAAK,QAAQ,SAAS,GAAG,EAAK;CACpD,KAAK,GAAG,MAAM,CAAC;CACf,KAAK,GAAG,MAAM,CAAC;CACf,KAAK,GAAG,OAAO,EAAE;CACjB,KAAK,GAAG,IAAI,EAAE;CACd,KAAK,GAAG,aAAa,EAAE;CACvB,KAAK,GAAG,MAAM,EAAE;CAQhB,KAAI,IAAI,IAAI,GAAG,KAAK,eAAe,KAAK;EAEtC,KAAK,YAAY,KAAK,SAAS,GAAG,EAAE,MAAM;EAC1C,MAAM,KAAK,GAAG,aAAa,YAAY,KAAK,UAAU,YAAY,KAAK,SAAS,YAAY,KAAK,KAAM;EAKvG,KAAI,IAAI,IAAI,MAAM,IAAI,gBAAc,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAC5D,MAAM,GAAG,SAAS,GAAG,IAAE,CAAC;CAE7B;CACA,OAAO,CAAC;AACV;AAEA,SAAS,eAAe,EAAE,MAAM,SAAS,WAAW,UAAU,MAAM,IAAI,QAAQ,aAAa,YAAY,UAAU;CACjH,MAAM,gBAAgB,MAAM,OAAO,KAAK,QAAQ;EAC9C,IAAI,QAAQ,OAAO,QAAQ,KAAO,MAAM,IAAI,MAAM,GAAG,KAAK,0BAA0B,IAAI,OAAO,IAAI,OAAO;CAC5G;CAEA,IAAI,SAAS,QAAQ,YAAY,SAAS,MAAM,IAAI,MAAM,6BAA6B;CACvF,aAAa,YAAY,UAAU,mBAAmB,iBAAiB;CACvE,aAAa,QAAQ,MAAM,eAAe,aAAa;CACvD,aAAa,OAAO,WAAW,cAAc,YAAY;CACzD,aAAa,UAAU,YAAY,IAAE,aAAa,YAAY;CAE9D,MAAM,aAAa,mBAAmB,IAAI,GAAG,WAAW;CACxD,UAAU,aAAa,UAAU,QAAQ,GAAG,eAAe;CAE3D,OAAO;EAAE;EAAM;EAAS;EAAW;EAAU;EAAM;EAAI;EAAQ,OAAO;EAAa;EAAY;CAAO;AACxG;AAEA,IAAM,KAAK;AACX,IAAM,iBAAiB,KAAK;AAE5B,SAAS,SAAS,QAAQ,EAAE,QAAQ,UAAU,gBAAgB;CAC5D,IAAI,CAAC,gBAAgB,MAAM,IAAI,MAAM,gCAAgC;CAErE,MAAM,MAAM,eAAe;EAAE,MAAM;EAAM,SAAS;EAAS,GAAG;CAAO,CAAC;CAEtE,MAAM,EAAE,GAAE,OAAO,IAAG,QAAQ,KAAI,SAAS,OAAM,WAAW,aAAa;CACvE,MAAM,WAAW,CAAC;CAClB,MAAM,SAAS,CAAC;CAChB,OAAO,IAAI;CACX,OAAO,KAAK;CACZ,OAAO,MAAM;CAGb,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,MAAM,IAAI,cAAc,IAAI,IAAI,MAAM;CACtE,MAAM,iBAAiB,KAAK,oBAAoB,KAAK;CACrD,IAAI,OAAO,OAAO,aAAa,gBAAgB;EAC7C,MAAM,UAAU,KAAK,MAAM,iBAAiB,OAAO,OAAO,cAAc,cAAc;EAGtF,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,SAAS;CAEb,SAAS,KAAK,IAAI,WAAW,OAAO,QAAQ,QAAQ,iBAAiB;CAAG,UAAS,SAAS,GAAG;CAC7F,SAAS,QAAQ,IAAI,WAAW,OAAO,QAAQ,QAAQ,iBAAiB;CAAG,UAAQ,SAAS,MAAM;CAClG,SAAS,UAAU,IAAI,WAAW,OAAO,QAAQ,QAAQ,iBAAiB;CAAG,UAAQ,SAAS,QAAQ;CACtG,SAAS,WAAW,IAAI,WAAW,OAAO,QAAQ,QAAQ,IAAI;CAAG,UAAQ,SAAS,SAAS;CAE3F,MAAM,KAAK,IAAI,YAAY,OAAO,QAAQ,QAAQ,CAAC;CAAG,UAAQ,GAAG,SAAS,YAAY;CACtF,MAAM,cAAc;EAAE,IAAI;EAAQ,MAAM;CAAS;CACjD,MAAM,WAAW,IAAI,WAAW,OAAO,QAAQ,QAAQ,iBAAiB;CAAG,UAAQ,SAAS;CAC5F,MAAM,cAAc,IAAI,WAAW,OAAO,QAAQ,QAAQ,IAAI,aAAa,iBAAiB;CAC5F,MAAM,kBAAkB,IAAI,WAAW,OAAO,QAAQ,GAAG,MAAM;CAG/D,MAAM,KAAK,MAAM,GAAG;CAIpB,MAAM,IAAI,KAAK,IAAI;CACnB,MAAM,IAAI,IAAI,MAAM,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC;CAChE,MAAM,aAAa,GAAG,MAAM;EAC1B,EAAE,EAAE,CAAC,KAAK,YAAY,SAAS,IAAE,IAAE,OAAO,IAAE,MAAO,IAAE,IAAE,OAAO,IAAE,OAAQ,iBAAiB;EACzF,OAAO,EAAE,EAAE,CAAC;CACd;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK;EAElC,MAAM,MAAM,IAAI,WAAW,GAAG,SAAS,CAAC;EAGxC,IAAI,IAAI,EAAE;EAAG,KAAK,KAAK,GAAG,GAAG,MAAM;EAAG,KAAK,KAAK,GAAG,GAAG,SAAS,CAAC;EAChE,GAAG,mBAAmB,KAAK,UAAU,GAAG,CAAC,CAAC;EAG1C,KAAK,KAAK,GAAG,GAAG,MAAM;EACtB,GAAG,mBAAmB,KAAK,UAAU,GAAG,CAAC,CAAC;CAC5C;CAKA,MAAM,KAAK;CACX,MAAM,gBAAgB,IAAI;CAC1B,KAAK,IAAI,OAAO,GAAG,OAAO,IAAI,QAAQ,QAEpC,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,MAAM;EAC9B,MAAM,oBAAoB,SAAS,KAAK,MAAM;EAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK;GAElC,IAAI,gBAAgB,OAAO,KAAK,SAAS,IAAI,IAAI;GAEjD,MAAM,OAAO,oBAAoB,SAAS,aAAa,MAAM,GAAG,IAAI,IAAI,IAAI,QAAQ,eAAe,aAAa,IAAI;GACpH,OAAoB,gBAAgB,eAAe,iBAAiB;IAClE,MAAM,IAAI,KAAK,gBAAgB;IAC/B,MAAM,YAAY,IAAI,IAAI,EAAE,EAAE,CAAC,IAAE,KAAK,EAAE,EAAE,CAAC,IAAE;IAG7C,MAAM,OAAO,oBAAoB,KAAK,KAAK,CAAC,CAAC,QAAQ;IAErD,OAAO,GAAG,YAAY,KAAK,YAAY,GAAG,IAAI,OAAO,MAAM,IAAI,eAAe,IAAI,aAAa;IAC/F,MAAM,IAAI,GAAG;IAAI,MAAM,IAAI,GAAG;IAI9B,IAAI,SAAS,GAAG,UAAU,GAAG,CAAC;IAC9B,EAAE,aAAa,WAAW,EAAE,EAAE,CAAC,IAAI,OAAO,IAAI,WAAW,EAAE,EAAE,CAAC,EAAE;IAGhE,IAAI,OAAO,GAAG,IAAI,aAAa,EAAE,EAAE,CAAC,IAAI,UAAU,EAAE,EAAE,CAAC,EAAE;GAC3D;EACF;CACF;CAKF,MAAM,IAAI,EAAE,EAAE,CAAC,IAAE;CACjB,KAAI,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAC5B,IAAI,aAAa,GAAG,GAAG,EAAE,EAAE,CAAC,IAAE,EAAE;CAGlC,MAAM,MAAM,GAAG,IAAI,WAAW,GAAG,IAAI,WAAW,IAAI,SAAS,CAAC;CAE9D,gBAAgB,KAAK,CAAC;CACtB,OAAO,KAAK,CAAC;CAEb,OAAO;AAET;AAEA,SAAS,MAAM,KAAK;CAClB,MAAM,IAAI,WAAW,4BAA4B;CACjD,MAAM,yBAAS,IAAI,WAAW,CAAC;CAC/B,MAAM,yBAAS,IAAI,WAAW,EAAE;CAChC,KAAK,QAAQ,IAAI,OAAO,CAAC;CACzB,KAAK,QAAQ,IAAI,WAAW,CAAC;CAC7B,KAAK,QAAQ,IAAI,YAAY,CAAC;CAC9B,KAAK,QAAQ,IAAI,QAAQ,EAAE;CAC3B,KAAK,QAAQ,IAAI,SAAS,EAAE;CAC5B,KAAK,QAAQ,IAAI,MAAM,EAAE;CAEzB,MAAM,SAAS,CAAC,MAAM;CACtB,IAAI,IAAI,UAAU;EAChB,OAAO,KAAK,qBAAK,IAAI,WAAW,CAAC,GAAG,IAAI,SAAS,QAAQ,CAAC,CAAC;EAC3D,OAAO,KAAK,IAAI,QAAQ;CAC1B,OACE,OAAO,KAAK,MAAM;CAGpB,IAAI,IAAI,MAAM;EACZ,OAAO,KAAK,qBAAK,IAAI,WAAW,CAAC,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC;EACvD,OAAO,KAAK,IAAI,IAAI;CACtB,OACE,OAAO,KAAK,MAAM;CAGpB,IAAI,IAAI,QAAQ;EACd,OAAO,KAAK,qBAAK,IAAI,WAAW,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,CAAC;EACzD,OAAO,KAAK,IAAI,MAAM;CAExB,OACE,OAAO,KAAK,MAAM;CAGpB,IAAI,IAAI,IAAI;EACV,OAAO,KAAK,qBAAK,IAAI,WAAW,CAAC,GAAG,IAAI,GAAG,QAAQ,CAAC,CAAC;EACrD,OAAO,KAAK,IAAI,EAAE;CACpB,OACE,OAAO,KAAK,MAAM;CAEpB,EAAE,OAAO,aAAa,MAAM,CAAC;CAE7B,MAAM,eAAe,EAAE,OAAO;CAC9B,OAAO,IAAI,WAAW,YAAY;AACpC;AAEA,SAAS,aAAa,QAAQ;CAC5B,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CAEvC,IAAI,cAAc;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACpC,IAAI,EAAE,OAAO,cAAc,aACvB,MAAM,IAAI,MAAM,wDAAwD;EAG5E,eAAe,OAAO,EAAE,CAAC;CAC7B;CAEA,MAAM,SAAS,IAAI,WAAW,WAAW;CACzC,IAAI,MAAM;CACV,OAAO,SAAS,YAAY;EACxB,OAAO,IAAI,SAAS,GAAG;EACvB,OAAO,QAAQ;CACnB,CAAC;CAED,OAAO;AACT;AAEA,IAAI;AACJ,eAAe,WAAW,QAAQ,SAAS,YAAY;CACrD,MAAM,eAAe,EAAE,KAAK,EAAE,OAAO,EAAE;CACvC,IAAI,oBAAoB,KAAA,GACtB,IAAI;EACF,MAAM,SAAS,MAAM,QAAQ,YAAY;EACzC,kBAAkB;EAClB,OAAO;CACT,SAAQ,GAAG;EACT,kBAAkB;CACpB;CAIF,QADe,kBAAkB,UAAU,WAAA,CAC7B,YAAY;AAC5B;AAEA,eAAe,UAAU,SAAS,YAAY;CAC5C,MAAM,SAAS,IAAI,YAAY,OAAO;EAGpC,SAAS;EACT,SAAS;CACX,CAAC;CACD,MAAM,aAAa,MAAM,WAAW,QAAQ,SAAS,UAAU;;;;;;;;;;;;;;;CAgB/D,MAAM,eAAe,WAAW,SAAS,QAAQ;EAAE,UAAU,WAAW;EAAU;CAAO,CAAC;CAE1F,OAAO;AACT;AAEA,SAAS,gBAAiB,MAAM,UAAU,KAAK,SAAS;CACtD,SAAS,sBAAsB,QAAQ,SAAS,QAAQ;EACtD,IAAI,kBAAkB,SAAS,YAAY,uBAAuB,YAAY;EAC9E,IAAI,cAAc,SAAS,YAAY,mBAAmB,YAAY;EAEtE,IAAI,SACF,OAAO,gBAAgB,QAAQ,OAAO;OAEtC,OAAO,YAAY,MAAM;CAE7B;CAGF,IAAI,MAAM;CAGV,IAAI,MAAMA,aAAW,KAAK,GAAG;CAC7B,IAAI,YAAY,IAAI;CACpB,MAAM,IAAI,WAAW,IAAI,YAAY,SAAS,CAAC;CAC/C,KAAI,IAAI,IAAI,GAAG,IAAI,WAAW,KAC3B,IAAI,KAAK,IAAI,WAAW,CAAC;CAMxB,OAAO,sBAAsB,KAAK,SAAS,KAAK;AAEpD;AAEA,SAAS,SAAS,SAAQ;CAAC,OAAO,gBAAgB,GAAG,MAAM,owLAAowL,OAAO;AAAC;AAEv0L,SAAS,YAAY,SAAQ;CAAC,OAAO,gBAAgB,GAAG,MAAM,gyJAAgyJ,OAAO;AAAC;AAEt2J,IAAM,WAAW,YAAY,WAC1B,mBAAmB,SAAS,cAAc,IAC1C,mBAAmB,YAAY,cAAc,CAChD"}

package/dist/assets/bark_ffi_wasm_bg-EY2uc0Bx.js

@@ -0,0 +1,6 @@
+//#region ../../node_modules/@secondts/bark/web/bark_ffi_wasm_bg.wasm?url
+var bark_ffi_wasm_bg_default = new URL("./bark_ffi_wasm_bg-Bxru_BVW.wasm", import.meta.url).href;
+//#endregion
+export { bark_ffi_wasm_bg_default as default };
+
+//# sourceMappingURL=bark_ffi_wasm_bg-EY2uc0Bx.js.map

package/dist/assets/bark_ffi_wasm_bg-EY2uc0Bx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bark_ffi_wasm_bg-EY2uc0Bx.js","names":["import.meta.ROLLDOWN_FILE_URL_WPGYjwIlzWVNM1bYhOc83w"],"sources":["../../../../node_modules/@secondts/bark/web/bark_ffi_wasm_bg.wasm?url"],"sourcesContent":["export default import.meta.ROLLDOWN_FILE_URL_WPGYjwIlzWVNM1bYhOc83w"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAA,2BAAe,IAAA,IAAA,oCAAA,YAAA,GAAmD,CAAA,CAAnDA"}

package/dist/assets/bitcoindevkit_bg-B-iLWrmX.js

@@ -0,0 +1,6 @@
+//#region ../../node_modules/@bitcoindevkit/bdk-wallet-web/bitcoindevkit_bg.wasm?url
+var bitcoindevkit_bg_default = new URL("./bitcoindevkit_bg-CRkZTSbO.wasm", import.meta.url).href;
+//#endregion
+export { bitcoindevkit_bg_default as default };
+
+//# sourceMappingURL=bitcoindevkit_bg-B-iLWrmX.js.map

package/dist/assets/bitcoindevkit_bg-B-iLWrmX.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitcoindevkit_bg-B-iLWrmX.js","names":["import.meta.ROLLDOWN_FILE_URL_FKNdLzKnlftW3t_gzo81yw"],"sources":["../../../../node_modules/@bitcoindevkit/bdk-wallet-web/bitcoindevkit_bg.wasm?url"],"sourcesContent":["export default import.meta.ROLLDOWN_FILE_URL_FKNdLzKnlftW3t_gzo81yw"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAA,2BAAe,IAAA,IAAA,oCAAA,YAAA,GAAmD,CAAA,CAAnDA"}

package/dist/assets/endpoint-h3cqRyRz.js

@@ -0,0 +1,185 @@
+import DHT from "hyperdht";
+//#region ../../native-transports/hyperdht/endpoint.mjs
+var MAX_FRAME = 61440;
+var PREFACE = "ghostly/paired-chat/1";
+/** Native UDP + NoiseSecretStream. The binding comes from the authenticated
+* stream itself, never from an application frame supplied by the other peer. */
+async function createHyperEndpoint(seed, options = {}) {
+	if (!(seed instanceof Uint8Array) || seed.length !== 32) throw new Error("Invalid HyperDHT seed");
+	const keyPair = DHT.keyPair(Buffer.from(seed));
+	const node = new DHT({
+		...options,
+		keyPair
+	});
+	const channels = /* @__PURE__ */ new Set();
+	let stopped = false;
+	let incomingHandler = null;
+	const waiting = [];
+	const descriptor = { publicKey: keyPair.publicKey.toString("hex") };
+	async function attach(socket) {
+		if (stopped || channels.size >= 2) {
+			socket.destroy();
+			throw new Error("Native connection limit reached");
+		}
+		let reader = null;
+		let closeHandler = null;
+		let closed = false;
+		let pending = [];
+		let buffer = Buffer.alloc(0);
+		let preface = false;
+		let resolveOpen, rejectOpen;
+		const ready = new Promise((resolve, reject) => {
+			resolveOpen = resolve;
+			rejectOpen = reject;
+		});
+		const timer = setTimeout(() => {
+			socket.destroy(/* @__PURE__ */ new Error("HyperDHT handshake timed out"));
+		}, 2e4);
+		const channel = {
+			get bufferedAmount() {
+				return socket.writableLength || 0;
+			},
+			get onMessage() {
+				return reader;
+			},
+			set onMessage(value) {
+				reader = value;
+				if (value) for (const text of pending.splice(0)) value(text);
+			},
+			get onClose() {
+				return closeHandler;
+			},
+			set onClose(value) {
+				closeHandler = value;
+				if (closed) value?.();
+			},
+			send(text) {
+				if (closed || typeof text !== "string" || !text.length || Buffer.byteLength(text) > 61440 || this.bufferedAmount > 122880) throw new Error("Native channel is closed or exceeds its frame budget");
+				const payload = Buffer.from(text);
+				const header = Buffer.alloc(4);
+				header.writeUInt32BE(payload.length);
+				socket.write(Buffer.concat([header, payload]));
+			},
+			drained() {
+				if (!this.bufferedAmount) return Promise.resolve();
+				return new Promise((resolve, reject) => {
+					const done = () => {
+						socket.off("close", gone);
+						resolve();
+					};
+					const gone = () => {
+						socket.off("drain", done);
+						reject(/* @__PURE__ */ new Error("Native channel closed"));
+					};
+					socket.once("drain", done);
+					socket.once("close", gone);
+				});
+			},
+			close() {
+				socket.destroy();
+			}
+		};
+		channels.add(channel);
+		socket.on("error", (error) => rejectOpen(error));
+		socket.on("close", () => {
+			closed = true;
+			pending = [];
+			clearTimeout(timer);
+			channels.delete(channel);
+			rejectOpen(/* @__PURE__ */ new Error("Native channel closed"));
+			closeHandler?.();
+		});
+		const opened = () => {
+			if (socket.handshakeHash?.length !== 64 || socket.publicKey?.length !== 32 || socket.remotePublicKey?.length !== 32) {
+				socket.destroy(/* @__PURE__ */ new Error("Noise session binding unavailable"));
+				return;
+			}
+			channel.send(PREFACE);
+		};
+		socket.on("data", (chunk) => {
+			buffer = Buffer.concat([buffer, chunk]);
+			while (buffer.length >= 4) {
+				const length = buffer.readUInt32BE(0);
+				if (length === 0 || length > 61440) {
+					socket.destroy(/* @__PURE__ */ new Error("Invalid frame length"));
+					return;
+				}
+				if (buffer.length < 4 + length) break;
+				let text;
+				try {
+					text = new TextDecoder("utf-8", { fatal: true }).decode(buffer.subarray(4, 4 + length));
+				} catch {
+					socket.destroy(/* @__PURE__ */ new Error("Invalid UTF-8 frame"));
+					return;
+				}
+				buffer = buffer.subarray(4 + length);
+				if (!preface) {
+					if (text !== PREFACE) {
+						socket.destroy(/* @__PURE__ */ new Error("Unexpected application protocol"));
+						return;
+					}
+					preface = true;
+					clearTimeout(timer);
+					resolveOpen({
+						channel,
+						binding: {
+							transport: "hyperdht/1",
+							context: socket.handshakeHash.toString("hex"),
+							identities: [socket.publicKey.toString("hex"), socket.remotePublicKey.toString("hex")].sort()
+						}
+					});
+				} else if (reader) reader(text);
+				else if (pending.length < 64) pending.push(text);
+				else {
+					socket.destroy(/* @__PURE__ */ new Error("Receive queue exceeded"));
+					return;
+				}
+			}
+		});
+		socket.opened.then((ok) => {
+			if (ok) opened();
+			else rejectOpen(/* @__PURE__ */ new Error("Noise handshake failed"));
+		});
+		return ready;
+	}
+	const server = node.createServer((socket) => {
+		attach(socket).then((bound) => {
+			if (stopped) bound.channel.close();
+			else if (incomingHandler) incomingHandler(bound);
+			else waiting.push(bound);
+		}).catch(() => {});
+	});
+	try {
+		await server.listen(keyPair);
+	} catch (error) {
+		await node.destroy();
+		throw error;
+	}
+	return {
+		transport: "hyperdht/1",
+		descriptor,
+		onDescriptor: null,
+		get onConnection() {
+			return incomingHandler;
+		},
+		set onConnection(value) {
+			incomingHandler = value;
+			if (value) for (const bound of waiting.splice(0)) value(bound);
+		},
+		async connect(address) {
+			if (stopped || !address || !/^[a-f0-9]{64}$/.test(address.publicKey)) throw new Error("Invalid HyperDHT endpoint");
+			return attach(node.connect(Buffer.from(address.publicKey, "hex"), { keyPair }));
+		},
+		async close() {
+			stopped = true;
+			for (const channel of channels) channel.close();
+			waiting.length = 0;
+			await server.close();
+			await node.destroy();
+		}
+	};
+}
+//#endregion
+export { MAX_FRAME, createHyperEndpoint };
+
+//# sourceMappingURL=endpoint-h3cqRyRz.js.map

package/dist/assets/endpoint-h3cqRyRz.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"endpoint-h3cqRyRz.js","names":[],"sources":["../../../../native-transports/hyperdht/endpoint.mjs"],"sourcesContent":["import DHT from 'hyperdht'\n\nexport const MAX_FRAME = 60 * 1024\nconst PREFACE = 'ghostly/paired-chat/1'\n\n/** Native UDP + NoiseSecretStream. The binding comes from the authenticated\n * stream itself, never from an application frame supplied by the other peer. */\nexport async function createHyperEndpoint(seed, options = {}) {\n  if (!(seed instanceof Uint8Array) || seed.length !== 32) throw new Error('Invalid HyperDHT seed')\n  const keyPair = DHT.keyPair(Buffer.from(seed))\n  const node = new DHT({ ...options, keyPair })\n  const channels = new Set()\n  let stopped = false\n  let incomingHandler = null\n  const waiting = []\n  const descriptor = { publicKey: keyPair.publicKey.toString('hex') }\n\n  async function attach(socket) {\n    if (stopped || channels.size >= 2) { socket.destroy(); throw new Error('Native connection limit reached') }\n    let reader = null\n    let closeHandler = null\n    let closed = false\n    let pending = []\n    let buffer = Buffer.alloc(0)\n    let preface = false\n    let resolveOpen, rejectOpen\n    const ready = new Promise((resolve, reject) => { resolveOpen = resolve; rejectOpen = reject })\n    const timer = setTimeout(() => { socket.destroy(new Error('HyperDHT handshake timed out')) }, 20000)\n    const channel = {\n      get bufferedAmount() { return socket.writableLength || 0 },\n      get onMessage() { return reader },\n      set onMessage(value) { reader = value; if (value) for (const text of pending.splice(0)) value(text) },\n      get onClose() { return closeHandler },\n      set onClose(value) { closeHandler = value; if (closed) value?.() },\n      send(text) {\n        if (closed || typeof text !== 'string' || !text.length || Buffer.byteLength(text) > MAX_FRAME || this.bufferedAmount > 120 * 1024)\n          throw new Error('Native channel is closed or exceeds its frame budget')\n        const payload = Buffer.from(text)\n        const header = Buffer.alloc(4); header.writeUInt32BE(payload.length)\n        socket.write(Buffer.concat([header, payload]))\n      },\n      drained() {\n        if (!this.bufferedAmount) return Promise.resolve()\n        return new Promise((resolve, reject) => {\n          const done = () => { socket.off('close', gone); resolve() }\n          const gone = () => { socket.off('drain', done); reject(new Error('Native channel closed')) }\n          socket.once('drain', done); socket.once('close', gone)\n        })\n      },\n      close() { socket.destroy() },\n    }\n    channels.add(channel)\n    socket.on('error', error => rejectOpen(error))\n    socket.on('close', () => {\n      closed = true; pending = []; clearTimeout(timer); channels.delete(channel)\n      rejectOpen(new Error('Native channel closed')); closeHandler?.()\n    })\n    const opened = () => {\n      if (socket.handshakeHash?.length !== 64 || socket.publicKey?.length !== 32 || socket.remotePublicKey?.length !== 32) {\n        socket.destroy(new Error('Noise session binding unavailable')); return\n      }\n      channel.send(PREFACE)\n    }\n    socket.on('data', chunk => {\n      // Secretstream chunks are bounded by its record layer. Process all frames\n      // before retaining a partial one; never allocate based on an unchecked size.\n      buffer = Buffer.concat([buffer, chunk])\n      while (buffer.length >= 4) {\n        const length = buffer.readUInt32BE(0)\n        if (length === 0 || length > MAX_FRAME) { socket.destroy(new Error('Invalid frame length')); return }\n        if (buffer.length < 4 + length) break\n        let text\n        try { text = new TextDecoder('utf-8', { fatal: true }).decode(buffer.subarray(4, 4 + length)) }\n        catch { socket.destroy(new Error('Invalid UTF-8 frame')); return }\n        buffer = buffer.subarray(4 + length)\n        if (!preface) {\n          if (text !== PREFACE) { socket.destroy(new Error('Unexpected application protocol')); return }\n          preface = true; clearTimeout(timer)\n          resolveOpen({ channel, binding: { transport: 'hyperdht/1', context: socket.handshakeHash.toString('hex'),\n            identities: [socket.publicKey.toString('hex'), socket.remotePublicKey.toString('hex')].sort() } })\n        } else if (reader) reader(text)\n        else if (pending.length < 64) pending.push(text)\n        else { socket.destroy(new Error('Receive queue exceeded')); return }\n      }\n    })\n    void socket.opened.then(ok => { if (ok) opened(); else rejectOpen(new Error('Noise handshake failed')) })\n    return ready\n  }\n\n  const server = node.createServer(socket => {\n    void attach(socket).then(bound => {\n      if (stopped) bound.channel.close()\n      else if (incomingHandler) incomingHandler(bound)\n      else waiting.push(bound)\n    }).catch(() => {})\n  })\n  try { await server.listen(keyPair) }\n  catch (error) { await node.destroy(); throw error }\n  return {\n    transport: 'hyperdht/1', descriptor, onDescriptor: null,\n    get onConnection() { return incomingHandler },\n    set onConnection(value) { incomingHandler = value; if (value) for (const bound of waiting.splice(0)) value(bound) },\n    async connect(address) {\n      if (stopped || !address || !/^[a-f0-9]{64}$/.test(address.publicKey)) throw new Error('Invalid HyperDHT endpoint')\n      return attach(node.connect(Buffer.from(address.publicKey, 'hex'), { keyPair }))\n    },\n    async close() { stopped = true; for (const channel of channels) channel.close(); waiting.length = 0; await server.close(); await node.destroy() },\n  }\n}\n"],"mappings":";;AAEA,IAAa,YAAY;AACzB,IAAM,UAAU;;;AAIhB,eAAsB,oBAAoB,MAAM,UAAU,CAAC,GAAG;CAC5D,IAAI,EAAE,gBAAgB,eAAe,KAAK,WAAW,IAAI,MAAM,IAAI,MAAM,uBAAuB;CAChG,MAAM,UAAU,IAAI,QAAQ,OAAO,KAAK,IAAI,CAAC;CAC7C,MAAM,OAAO,IAAI,IAAI;EAAE,GAAG;EAAS;CAAQ,CAAC;CAC5C,MAAM,2BAAW,IAAI,IAAI;CACzB,IAAI,UAAU;CACd,IAAI,kBAAkB;CACtB,MAAM,UAAU,CAAC;CACjB,MAAM,aAAa,EAAE,WAAW,QAAQ,UAAU,SAAS,KAAK,EAAE;CAElE,eAAe,OAAO,QAAQ;EAC5B,IAAI,WAAW,SAAS,QAAQ,GAAG;GAAE,OAAO,QAAQ;GAAG,MAAM,IAAI,MAAM,iCAAiC;EAAE;EAC1G,IAAI,SAAS;EACb,IAAI,eAAe;EACnB,IAAI,SAAS;EACb,IAAI,UAAU,CAAC;EACf,IAAI,SAAS,OAAO,MAAM,CAAC;EAC3B,IAAI,UAAU;EACd,IAAI,aAAa;EACjB,MAAM,QAAQ,IAAI,SAAS,SAAS,WAAW;GAAE,cAAc;GAAS,aAAa;EAAO,CAAC;EAC7F,MAAM,QAAQ,iBAAiB;GAAE,OAAO,wBAAQ,IAAI,MAAM,8BAA8B,CAAC;EAAE,GAAG,GAAK;EACnG,MAAM,UAAU;GACd,IAAI,iBAAiB;IAAE,OAAO,OAAO,kBAAkB;GAAE;GACzD,IAAI,YAAY;IAAE,OAAO;GAAO;GAChC,IAAI,UAAU,OAAO;IAAE,SAAS;IAAO,IAAI,OAAO,KAAK,MAAM,QAAQ,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI;GAAE;GACpG,IAAI,UAAU;IAAE,OAAO;GAAa;GACpC,IAAI,QAAQ,OAAO;IAAE,eAAe;IAAO,IAAI,QAAQ,QAAQ;GAAE;GACjE,KAAK,MAAM;IACT,IAAI,UAAU,OAAO,SAAS,YAAY,CAAC,KAAK,UAAU,OAAO,WAAW,IAAI,IAAA,SAAiB,KAAK,iBAAiB,QACrH,MAAM,IAAI,MAAM,sDAAsD;IACxE,MAAM,UAAU,OAAO,KAAK,IAAI;IAChC,MAAM,SAAS,OAAO,MAAM,CAAC;IAAG,OAAO,cAAc,QAAQ,MAAM;IACnE,OAAO,MAAM,OAAO,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;GAC/C;GACA,UAAU;IACR,IAAI,CAAC,KAAK,gBAAgB,OAAO,QAAQ,QAAQ;IACjD,OAAO,IAAI,SAAS,SAAS,WAAW;KACtC,MAAM,aAAa;MAAE,OAAO,IAAI,SAAS,IAAI;MAAG,QAAQ;KAAE;KAC1D,MAAM,aAAa;MAAE,OAAO,IAAI,SAAS,IAAI;MAAG,uBAAO,IAAI,MAAM,uBAAuB,CAAC;KAAE;KAC3F,OAAO,KAAK,SAAS,IAAI;KAAG,OAAO,KAAK,SAAS,IAAI;IACvD,CAAC;GACH;GACA,QAAQ;IAAE,OAAO,QAAQ;GAAE;EAC7B;EACA,SAAS,IAAI,OAAO;EACpB,OAAO,GAAG,UAAS,UAAS,WAAW,KAAK,CAAC;EAC7C,OAAO,GAAG,eAAe;GACvB,SAAS;GAAM,UAAU,CAAC;GAAG,aAAa,KAAK;GAAG,SAAS,OAAO,OAAO;GACzE,2BAAW,IAAI,MAAM,uBAAuB,CAAC;GAAG,eAAe;EACjE,CAAC;EACD,MAAM,eAAe;GACnB,IAAI,OAAO,eAAe,WAAW,MAAM,OAAO,WAAW,WAAW,MAAM,OAAO,iBAAiB,WAAW,IAAI;IACnH,OAAO,wBAAQ,IAAI,MAAM,mCAAmC,CAAC;IAAG;GAClE;GACA,QAAQ,KAAK,OAAO;EACtB;EACA,OAAO,GAAG,SAAQ,UAAS;GAGzB,SAAS,OAAO,OAAO,CAAC,QAAQ,KAAK,CAAC;GACtC,OAAO,OAAO,UAAU,GAAG;IACzB,MAAM,SAAS,OAAO,aAAa,CAAC;IACpC,IAAI,WAAW,KAAK,SAAA,OAAoB;KAAE,OAAO,wBAAQ,IAAI,MAAM,sBAAsB,CAAC;KAAG;IAAO;IACpG,IAAI,OAAO,SAAS,IAAI,QAAQ;IAChC,IAAI;IACJ,IAAI;KAAE,OAAO,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,SAAS,GAAG,IAAI,MAAM,CAAC;IAAE,QACxF;KAAE,OAAO,wBAAQ,IAAI,MAAM,qBAAqB,CAAC;KAAG;IAAO;IACjE,SAAS,OAAO,SAAS,IAAI,MAAM;IACnC,IAAI,CAAC,SAAS;KACZ,IAAI,SAAS,SAAS;MAAE,OAAO,wBAAQ,IAAI,MAAM,iCAAiC,CAAC;MAAG;KAAO;KAC7F,UAAU;KAAM,aAAa,KAAK;KAClC,YAAY;MAAE;MAAS,SAAS;OAAE,WAAW;OAAc,SAAS,OAAO,cAAc,SAAS,KAAK;OACrG,YAAY,CAAC,OAAO,UAAU,SAAS,KAAK,GAAG,OAAO,gBAAgB,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK;MAAE;KAAE,CAAC;IACrG,OAAO,IAAI,QAAQ,OAAO,IAAI;SACzB,IAAI,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI;SAC1C;KAAE,OAAO,wBAAQ,IAAI,MAAM,wBAAwB,CAAC;KAAG;IAAO;GACrE;EACF,CAAC;EACD,OAAY,OAAO,MAAK,OAAM;GAAE,IAAI,IAAI,OAAO;QAAQ,2BAAW,IAAI,MAAM,wBAAwB,CAAC;EAAE,CAAC;EACxG,OAAO;CACT;CAEA,MAAM,SAAS,KAAK,cAAa,WAAU;EACzC,OAAY,MAAM,CAAC,CAAC,MAAK,UAAS;GAChC,IAAI,SAAS,MAAM,QAAQ,MAAM;QAC5B,IAAI,iBAAiB,gBAAgB,KAAK;QAC1C,QAAQ,KAAK,KAAK;EACzB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;CACnB,CAAC;CACD,IAAI;EAAE,MAAM,OAAO,OAAO,OAAO;CAAE,SAC5B,OAAO;EAAE,MAAM,KAAK,QAAQ;EAAG,MAAM;CAAM;CAClD,OAAO;EACL,WAAW;EAAc;EAAY,cAAc;EACnD,IAAI,eAAe;GAAE,OAAO;EAAgB;EAC5C,IAAI,aAAa,OAAO;GAAE,kBAAkB;GAAO,IAAI,OAAO,KAAK,MAAM,SAAS,QAAQ,OAAO,CAAC,GAAG,MAAM,KAAK;EAAE;EAClH,MAAM,QAAQ,SAAS;GACrB,IAAI,WAAW,CAAC,WAAW,CAAC,iBAAiB,KAAK,QAAQ,SAAS,GAAG,MAAM,IAAI,MAAM,2BAA2B;GACjH,OAAO,OAAO,KAAK,QAAQ,OAAO,KAAK,QAAQ,WAAW,KAAK,GAAG,EAAE,QAAQ,CAAC,CAAC;EAChF;EACA,MAAM,QAAQ;GAAE,UAAU;GAAM,KAAK,MAAM,WAAW,UAAU,QAAQ,MAAM;GAAG,QAAQ,SAAS;GAAG,MAAM,OAAO,MAAM;GAAG,MAAM,KAAK,QAAQ;EAAE;CAClJ;AACF"}

package/dist/assets/fedimintWorker.mjs

@@ -0,0 +1,95 @@
+/**
+ * One Fedimint client database on Node, in a `worker_threads` worker of its own: the browser's worker
+ * (packages/browser/src/engine/paymentAdapters/fedimintWorker.ts) with a file of the profile in place of the
+ * origin-private file system. Plain JavaScript: it runs as it is, from the workspace and beside the bundle.
+ *
+ * The client's WebAssembly reads and writes its database through a sync access handle, and calls only `read`,
+ * `write` (each with `{ at }`), `getSize`, `truncate`, `flush` and `close` on it: `SyncFile` is those, on a file
+ * descriptor. Its network is `fetch` and `WebSocket`, which Node has; `CloseEvent`, which Node 22 lacks, is given here.
+ *
+ * `workerData`: `{ dir, glue }`, the folder of the databases and the `file:` URL of the wasm-bindgen glue. Messages
+ * are the SDK's transport protocol, as in the browser; `init` brings the compiled module and the database's name.
+ */
+import { closeSync, constants, fstatSync, fsyncSync, ftruncateSync, openSync, readSync, writeSync } from "node:fs";
+import { join } from "node:path";
+import { parentPort, workerData } from "node:worker_threads";
+
+const RPC_TYPES = new Set(["set_mnemonic", "generate_mnemonic", "get_mnemonic", "join_federation", "open_client", "close_client", "client_rpc", "cancel_rpc",
+  "parse_invite_code", "parse_bolt11_invoice", "preview_federation", "parse_oob_notes", "has_mnemonic_set"]);
+
+/** A FileSystemSyncAccessHandle, as much of one as the client uses. */
+class SyncFile {
+  position = 0;
+  constructor(path) { this.fd = openSync(path, constants.O_RDWR | constants.O_CREAT, 0o600); }
+  read(buffer, options) {
+    let at = options?.at ?? this.position, done = 0;
+    while (done < buffer.byteLength) {
+      const n = readSync(this.fd, buffer, done, buffer.byteLength - done, at + done);
+      if (n === 0) break;
+      done += n;
+    }
+    this.position = at + done;
+    return done;
+  }
+  write(buffer, options) {
+    const at = options?.at ?? this.position;
+    let done = 0;
+    while (done < buffer.byteLength) done += writeSync(this.fd, buffer, done, buffer.byteLength - done, at + done);
+    this.position = at + done;
+    return done;
+  }
+  getSize() { return fstatSync(this.fd).size; }
+  truncate(size) { ftruncateSync(this.fd, size); if (this.position > size) this.position = size; }
+  flush() { fsyncSync(this.fd); }
+  close() { if (this.fd !== undefined) closeSync(this.fd); this.fd = undefined; }
+}
+
+globalThis.CloseEvent ??= class CloseEvent extends Event {
+  constructor(type, init = {}) {
+    super(type, init);
+    this.code = init.code ?? 0;
+    this.reason = init.reason ?? "";
+    this.wasClean = !!init.wasClean;
+  }
+};
+
+const glue = await import(workerData.glue);
+let handler, file, database;
+const post = (message) => parentPort.postMessage(message);
+
+parentPort.on("message", async ({ type, payload, requestId }) => {
+  try {
+    if (type === "init") {
+      if (handler) { post({ type: "data", data: { filename: database }, request_id: requestId }); return; }
+      const module = payload?.module;
+      const dbPath = payload?.dbPath;
+      if (!(module instanceof WebAssembly.Module) || typeof dbPath !== "string" || !/^ghostly-fedimint-[\w-]{1,80}\.db$/.test(dbPath)) throw new Error("Invalid Fedimint worker init");
+      const instance = await WebAssembly.instantiate(module, { "./fedimint_client_wasm_bg.js": glue });
+      glue.__wbg_set_wasm(instance.exports);
+      instance.exports.__wbindgen_start?.();
+      file = new SyncFile(join(workerData.dir, dbPath));
+      // wasm-bindgen's async constructor: `new` hands back a promise of the handler.
+      handler = await new glue.RpcHandler(file);
+      database = dbPath;
+      post({ type: "data", data: { filename: dbPath }, request_id: requestId });
+    } else if (RPC_TYPES.has(type)) {
+      if (!handler) { post({ type: "error", error: "The Fedimint client is not initialized", request_id: requestId }); return; }
+      handler.rpc(JSON.stringify({ request_id: requestId, type, ...payload }), (response) => post(JSON.parse(response)));
+    } else if (type === "cleanup") {
+      file?.close();
+      handler?.free();
+      handler = undefined; file = undefined;
+      post({ type: "data", data: { filename: database }, request_id: requestId });
+      parentPort.close();
+    } else {
+      post({ type: "error", error: "Unknown message type", request_id: requestId });
+    }
+  } catch (error) {
+    post({ type: "error", error: error instanceof Error ? error.message : String(error), request_id: requestId });
+  }
+});
+
+// As in the browser: a panic fails every request waiting on this worker (no request id), rather than leave it to hang.
+const stopped = (error) => post({ type: "error", error: `The Fedimint client stopped: ${error instanceof Error ? error.message : String(error)}` });
+process.on("uncaughtException", stopped);
+process.on("unhandledRejection", stopped);

package/dist/assets/fedimint_client_wasm_bg-BtHHlFpp.js

@@ -0,0 +1,6 @@
+//#region ../../node_modules/@fedimint/fedimint-client-wasm-bundler/fedimint_client_wasm_bg.wasm?url
+var fedimint_client_wasm_bg_default = new URL("./fedimint_client_wasm_bg-DeFtkIv6.wasm", import.meta.url).href;
+//#endregion
+export { fedimint_client_wasm_bg_default as default };
+
+//# sourceMappingURL=fedimint_client_wasm_bg-BtHHlFpp.js.map

package/dist/assets/fedimint_client_wasm_bg-BtHHlFpp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fedimint_client_wasm_bg-BtHHlFpp.js","names":["import.meta.ROLLDOWN_FILE_URL_VRAku6fjghkApIISiBWPzg"],"sources":["../../../../node_modules/@fedimint/fedimint-client-wasm-bundler/fedimint_client_wasm_bg.wasm?url"],"sourcesContent":["export default import.meta.ROLLDOWN_FILE_URL_VRAku6fjghkApIISiBWPzg"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAA,kCAAe,IAAA,IAAA,2CAAA,YAAA,GAAmD,CAAA,CAAnDA"}

package/dist/assets/fileBytes-ByS16quP.js

@@ -0,0 +1,154 @@
+import { _t as fileSpace, bt as digestText, mt as checkFileId, yt as FILE_BYTES_STEP } from "../ghostly.mjs";
+import { mkdir, open, readdir, rm, stat, statfs } from "node:fs/promises";
+import { join } from "node:path";
+import { createHash } from "node:crypto";
+//#region src/runtime/fileBytes.ts
+/**
+* Files as real files in the profile's folder (`files/<space>/<id>`, 0600 in 0700 folders), the Node twin of the
+* Desktop's `native` backend (`shared/fileBytesNative.ts`, which goes through Rust). Registered as `native` and
+* preferred, so every file of any size is a file on disk, read and written a step at a time.
+*/
+var NodeFileBytes = class {
+	root;
+	kind = "native";
+	writers = /* @__PURE__ */ new Map();
+	constructor(root) {
+		this.root = root;
+	}
+	folder(space = fileSpace()) {
+		return join(this.root, space);
+	}
+	path(id) {
+		return join(this.folder(), checkFileId(id));
+	}
+	writer(id) {
+		const path = this.path(id);
+		let handle = this.writers.get(path);
+		if (!handle) {
+			handle = mkdir(this.folder(), {
+				recursive: true,
+				mode: 448
+			}).then(() => open(path, "a", 384));
+			this.writers.set(path, handle);
+			handle.catch(() => this.writers.delete(path));
+		}
+		return handle;
+	}
+	async stage(id, source, onProgress) {
+		await this.remove(id);
+		try {
+			for (let offset = 0; offset < source.size; offset += FILE_BYTES_STEP) {
+				const bytes = new Uint8Array(await source.slice(offset, offset + FILE_BYTES_STEP).arrayBuffer());
+				await this.append(id, offset, bytes);
+				onProgress?.(offset + bytes.length);
+			}
+			if (source.size === 0) await this.append(id, 0, /* @__PURE__ */ new Uint8Array());
+			await this.close(id);
+			return await this.digest(id);
+		} catch (error) {
+			await this.remove(id).catch(() => {});
+			throw error;
+		}
+	}
+	async append(id, offset, bytes) {
+		const size = await this.size(id) ?? 0;
+		if (offset !== size) throw new Error(`Append at ${offset}, but the file holds ${size} bytes`);
+		const handle = await this.writer(id);
+		if (bytes.length) await handle.write(bytes);
+	}
+	async flush(id) {
+		const handle = this.writers.get(this.path(id));
+		if (handle) await (await handle).sync();
+	}
+	async close(id) {
+		const path = this.path(id);
+		const handle = this.writers.get(path);
+		if (!handle) return;
+		this.writers.delete(path);
+		const file = await handle;
+		await file.sync();
+		await file.close();
+	}
+	async size(id) {
+		const path = this.path(id);
+		try {
+			return (await stat(path)).size;
+		} catch {
+			return null;
+		}
+	}
+	async truncate(id, size) {
+		await this.close(id);
+		const handle = await open(this.path(id), "r+");
+		try {
+			await handle.truncate(size);
+			await handle.sync();
+		} finally {
+			await handle.close();
+		}
+	}
+	async read(id, offset, length) {
+		const handle = await open(this.path(id), "r");
+		try {
+			const buffer = Buffer.alloc(Math.min(length, 16 * FILE_BYTES_STEP));
+			const { bytesRead } = await handle.read(buffer, 0, buffer.length, offset);
+			return new Uint8Array(buffer.subarray(0, bytesRead));
+		} finally {
+			await handle.close();
+		}
+	}
+	async digest(id) {
+		const hash = createHash("sha256");
+		const handle = await open(this.path(id), "r");
+		try {
+			for await (const chunk of handle.createReadStream({ highWaterMark: FILE_BYTES_STEP })) hash.update(chunk);
+		} finally {
+			await handle.close().catch(() => {});
+		}
+		return digestText(new Uint8Array(hash.digest()));
+	}
+	/** The file read into memory, to show; a large one only ever goes to disk (`ghostly file save`). */
+	async blob(id, type) {
+		const size = await this.size(id);
+		if (size === null || size > 67108864) return null;
+		const parts = [];
+		for (let offset = 0; offset < size; offset += FILE_BYTES_STEP) parts.push(await this.read(id, offset, FILE_BYTES_STEP));
+		return new Blob(parts, { type });
+	}
+	async remove(id) {
+		await this.close(id).catch(() => {});
+		await rm(this.path(id), { force: true });
+	}
+	async removeWhere(prefix) {
+		if (prefix && !/^[A-Za-z0-9_-]{1,200}$/.test(prefix)) throw new Error("Invalid file id");
+		let names;
+		try {
+			names = await readdir(this.folder());
+		} catch {
+			return;
+		}
+		await Promise.all(names.filter((name) => name.startsWith(prefix)).map((name) => this.remove(name)));
+	}
+	async room() {
+		try {
+			await mkdir(this.root, {
+				recursive: true,
+				mode: 448
+			});
+			const fs = await statfs(this.root);
+			return fs.bavail * fs.bsize;
+		} catch {
+			return null;
+		}
+	}
+	async dropSpace(space) {
+		await rm(this.folder(space), {
+			recursive: true,
+			force: true
+		});
+	}
+};
+//#endregion
+export { NodeFileBytes };
+
+//# sourceMappingURL=fileBytes-ByS16quP.js.map

package/dist/assets/fileBytes-ByS16quP.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fileBytes-ByS16quP.js","names":[],"sources":["../../src/runtime/fileBytes.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { mkdir, open, readdir, rm, stat, statfs, type FileHandle } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { FILE_BYTES_STEP, checkFileId, digestText, fileSpace, type FileBytes } from \"@ghostly/browser/shared/fileBytes\";\n\n/**\n * Files as real files in the profile's folder (`files/<space>/<id>`, 0600 in 0700 folders), the Node twin of the\n * Desktop's `native` backend (`shared/fileBytesNative.ts`, which goes through Rust). Registered as `native` and\n * preferred, so every file of any size is a file on disk, read and written a step at a time.\n */\nexport class NodeFileBytes implements FileBytes {\n  readonly kind = \"native\" as const;\n  private readonly writers = new Map<string, Promise<FileHandle>>();\n\n  constructor(private readonly root: string) {}\n\n  private folder(space = fileSpace()): string { return join(this.root, space); }\n  private path(id: string): string { return join(this.folder(), checkFileId(id)); }\n\n  private writer(id: string): Promise<FileHandle> {\n    const path = this.path(id);\n    let handle = this.writers.get(path);\n    if (!handle) {\n      handle = mkdir(this.folder(), { recursive: true, mode: 0o700 }).then(() => open(path, \"a\", 0o600));\n      this.writers.set(path, handle);\n      handle.catch(() => this.writers.delete(path));\n    }\n    return handle;\n  }\n\n  async stage(id: string, source: Blob, onProgress?: (copied: number) => void): Promise<string> {\n    await this.remove(id);\n    try {\n      for (let offset = 0; offset < source.size; offset += FILE_BYTES_STEP) {\n        const bytes = new Uint8Array(await source.slice(offset, offset + FILE_BYTES_STEP).arrayBuffer());\n        await this.append(id, offset, bytes);\n        onProgress?.(offset + bytes.length);\n      }\n      if (source.size === 0) await this.append(id, 0, new Uint8Array());\n      await this.close(id);\n      return await this.digest(id);\n    } catch (error) {\n      await this.remove(id).catch(() => {});\n      throw error;\n    }\n  }\n\n  async append(id: string, offset: number, bytes: Uint8Array): Promise<void> {\n    const size = (await this.size(id)) ?? 0;\n    if (offset !== size) throw new Error(`Append at ${offset}, but the file holds ${size} bytes`);\n    const handle = await this.writer(id);\n    if (bytes.length) await handle.write(bytes);\n  }\n\n  async flush(id: string): Promise<void> {\n    const handle = this.writers.get(this.path(id));\n    if (handle) await (await handle).sync();\n  }\n\n  async close(id: string): Promise<void> {\n    const path = this.path(id);\n    const handle = this.writers.get(path);\n    if (!handle) return;\n    this.writers.delete(path);\n    const file = await handle;\n    await file.sync();\n    await file.close();\n  }\n\n  async size(id: string): Promise<number | null> {\n    const path = this.path(id);\n    try { return (await stat(path)).size; } catch { return null; }\n  }\n\n  async truncate(id: string, size: number): Promise<void> {\n    await this.close(id);\n    const handle = await open(this.path(id), \"r+\");\n    try { await handle.truncate(size); await handle.sync(); } finally { await handle.close(); }\n  }\n\n  async read(id: string, offset: number, length: number): Promise<Uint8Array> {\n    const handle = await open(this.path(id), \"r\");\n    try {\n      const buffer = Buffer.alloc(Math.min(length, 16 * FILE_BYTES_STEP));\n      const { bytesRead } = await handle.read(buffer, 0, buffer.length, offset);\n      return new Uint8Array(buffer.subarray(0, bytesRead));\n    } finally { await handle.close(); }\n  }\n\n  async digest(id: string): Promise<string> {\n    const hash = createHash(\"sha256\");\n    const handle = await open(this.path(id), \"r\");\n    try {\n      for await (const chunk of handle.createReadStream({ highWaterMark: FILE_BYTES_STEP })) hash.update(chunk as Buffer);\n    } finally { await handle.close().catch(() => {}); }\n    return digestText(new Uint8Array(hash.digest()));\n  }\n\n  /** The file read into memory, to show; a large one only ever goes to disk (`ghostly file save`). */\n  async blob(id: string, type: string): Promise<Blob | null> {\n    const size = await this.size(id);\n    if (size === null || size > 64 * 1024 * 1024) return null;\n    const parts: Uint8Array[] = [];\n    for (let offset = 0; offset < size; offset += FILE_BYTES_STEP) parts.push(await this.read(id, offset, FILE_BYTES_STEP));\n    return new Blob(parts as BlobPart[], { type });\n  }\n\n  async remove(id: string): Promise<void> {\n    await this.close(id).catch(() => {});\n    await rm(this.path(id), { force: true });\n  }\n\n  async removeWhere(prefix: string): Promise<void> {\n    if (prefix && !/^[A-Za-z0-9_-]{1,200}$/.test(prefix)) throw new Error(\"Invalid file id\");\n    let names: string[];\n    try { names = await readdir(this.folder()); } catch { return; }\n    await Promise.all(names.filter((name) => name.startsWith(prefix)).map((name) => this.remove(name)));\n  }\n\n  async room(): Promise<number | null> {\n    try {\n      await mkdir(this.root, { recursive: true, mode: 0o700 });\n      const fs = await statfs(this.root);\n      return fs.bavail * fs.bsize;\n    } catch { return null; }\n  }\n\n  async dropSpace(space: string): Promise<void> {\n    await rm(this.folder(space), { recursive: true, force: true });\n  }\n}\n"],"mappings":";;;;;;;;;;AAUA,IAAa,gBAAb,MAAgD;CAIjB;CAH7B,OAAgB;CAChB,0BAA2B,IAAI,IAAiC;CAEhE,YAAY,MAA+B;EAAd,KAAA,OAAA;CAAe;CAE5C,OAAe,QAAQ,UAAU,GAAW;EAAE,OAAO,KAAK,KAAK,MAAM,KAAK;CAAG;CAC7E,KAAa,IAAoB;EAAE,OAAO,KAAK,KAAK,OAAO,GAAG,YAAY,EAAE,CAAC;CAAG;CAEhF,OAAe,IAAiC;EAC9C,MAAM,OAAO,KAAK,KAAK,EAAE;EACzB,IAAI,SAAS,KAAK,QAAQ,IAAI,IAAI;EAClC,IAAI,CAAC,QAAQ;GACX,SAAS,MAAM,KAAK,OAAO,GAAG;IAAE,WAAW;IAAM,MAAM;GAAM,CAAC,CAAC,CAAC,WAAW,KAAK,MAAM,KAAK,GAAK,CAAC;GACjG,KAAK,QAAQ,IAAI,MAAM,MAAM;GAC7B,OAAO,YAAY,KAAK,QAAQ,OAAO,IAAI,CAAC;EAC9C;EACA,OAAO;CACT;CAEA,MAAM,MAAM,IAAY,QAAc,YAAwD;EAC5F,MAAM,KAAK,OAAO,EAAE;EACpB,IAAI;GACF,KAAK,IAAI,SAAS,GAAG,SAAS,OAAO,MAAM,UAAU,iBAAiB;IACpE,MAAM,QAAQ,IAAI,WAAW,MAAM,OAAO,MAAM,QAAQ,SAAS,eAAe,CAAC,CAAC,YAAY,CAAC;IAC/F,MAAM,KAAK,OAAO,IAAI,QAAQ,KAAK;IACnC,aAAa,SAAS,MAAM,MAAM;GACpC;GACA,IAAI,OAAO,SAAS,GAAG,MAAM,KAAK,OAAO,IAAI,mBAAG,IAAI,WAAW,CAAC;GAChE,MAAM,KAAK,MAAM,EAAE;GACnB,OAAO,MAAM,KAAK,OAAO,EAAE;EAC7B,SAAS,OAAO;GACd,MAAM,KAAK,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;GACpC,MAAM;EACR;CACF;CAEA,MAAM,OAAO,IAAY,QAAgB,OAAkC;EACzE,MAAM,OAAQ,MAAM,KAAK,KAAK,EAAE,KAAM;EACtC,IAAI,WAAW,MAAM,MAAM,IAAI,MAAM,aAAa,OAAO,uBAAuB,KAAK,OAAO;EAC5F,MAAM,SAAS,MAAM,KAAK,OAAO,EAAE;EACnC,IAAI,MAAM,QAAQ,MAAM,OAAO,MAAM,KAAK;CAC5C;CAEA,MAAM,MAAM,IAA2B;EACrC,MAAM,SAAS,KAAK,QAAQ,IAAI,KAAK,KAAK,EAAE,CAAC;EAC7C,IAAI,QAAQ,OAAO,MAAM,OAAA,CAAQ,KAAK;CACxC;CAEA,MAAM,MAAM,IAA2B;EACrC,MAAM,OAAO,KAAK,KAAK,EAAE;EACzB,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EACpC,IAAI,CAAC,QAAQ;EACb,KAAK,QAAQ,OAAO,IAAI;EACxB,MAAM,OAAO,MAAM;EACnB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,MAAM;CACnB;CAEA,MAAM,KAAK,IAAoC;EAC7C,MAAM,OAAO,KAAK,KAAK,EAAE;EACzB,IAAI;GAAE,QAAQ,MAAM,KAAK,IAAI,EAAA,CAAG;EAAM,QAAQ;GAAE,OAAO;EAAM;CAC/D;CAEA,MAAM,SAAS,IAAY,MAA6B;EACtD,MAAM,KAAK,MAAM,EAAE;EACnB,MAAM,SAAS,MAAM,KAAK,KAAK,KAAK,EAAE,GAAG,IAAI;EAC7C,IAAI;GAAE,MAAM,OAAO,SAAS,IAAI;GAAG,MAAM,OAAO,KAAK;EAAG,UAAU;GAAE,MAAM,OAAO,MAAM;EAAG;CAC5F;CAEA,MAAM,KAAK,IAAY,QAAgB,QAAqC;EAC1E,MAAM,SAAS,MAAM,KAAK,KAAK,KAAK,EAAE,GAAG,GAAG;EAC5C,IAAI;GACF,MAAM,SAAS,OAAO,MAAM,KAAK,IAAI,QAAQ,KAAK,eAAe,CAAC;GAClE,MAAM,EAAE,cAAc,MAAM,OAAO,KAAK,QAAQ,GAAG,OAAO,QAAQ,MAAM;GACxE,OAAO,IAAI,WAAW,OAAO,SAAS,GAAG,SAAS,CAAC;EACrD,UAAU;GAAE,MAAM,OAAO,MAAM;EAAG;CACpC;CAEA,MAAM,OAAO,IAA6B;EACxC,MAAM,OAAO,WAAW,QAAQ;EAChC,MAAM,SAAS,MAAM,KAAK,KAAK,KAAK,EAAE,GAAG,GAAG;EAC5C,IAAI;GACF,WAAW,MAAM,SAAS,OAAO,iBAAiB,EAAE,eAAe,gBAAgB,CAAC,GAAG,KAAK,OAAO,KAAe;EACpH,UAAU;GAAE,MAAM,OAAO,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;EAAG;EAClD,OAAO,WAAW,IAAI,WAAW,KAAK,OAAO,CAAC,CAAC;CACjD;;CAGA,MAAM,KAAK,IAAY,MAAoC;EACzD,MAAM,OAAO,MAAM,KAAK,KAAK,EAAE;EAC/B,IAAI,SAAS,QAAQ,OAAO,UAAkB,OAAO;EACrD,MAAM,QAAsB,CAAC;EAC7B,KAAK,IAAI,SAAS,GAAG,SAAS,MAAM,UAAU,iBAAiB,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,QAAQ,eAAe,CAAC;EACtH,OAAO,IAAI,KAAK,OAAqB,EAAE,KAAK,CAAC;CAC/C;CAEA,MAAM,OAAO,IAA2B;EACtC,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;EACnC,MAAM,GAAG,KAAK,KAAK,EAAE,GAAG,EAAE,OAAO,KAAK,CAAC;CACzC;CAEA,MAAM,YAAY,QAA+B;EAC/C,IAAI,UAAU,CAAC,yBAAyB,KAAK,MAAM,GAAG,MAAM,IAAI,MAAM,iBAAiB;EACvF,IAAI;EACJ,IAAI;GAAE,QAAQ,MAAM,QAAQ,KAAK,OAAO,CAAC;EAAG,QAAQ;GAAE;EAAQ;EAC9D,MAAM,QAAQ,IAAI,MAAM,QAAQ,SAAS,KAAK,WAAW,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,KAAK,OAAO,IAAI,CAAC,CAAC;CACpG;CAEA,MAAM,OAA+B;EACnC,IAAI;GACF,MAAM,MAAM,KAAK,MAAM;IAAE,WAAW;IAAM,MAAM;GAAM,CAAC;GACvD,MAAM,KAAK,MAAM,OAAO,KAAK,IAAI;GACjC,OAAO,GAAG,SAAS,GAAG;EACxB,QAAQ;GAAE,OAAO;EAAM;CACzB;CAEA,MAAM,UAAU,OAA8B;EAC5C,MAAM,GAAG,KAAK,OAAO,KAAK,GAAG;GAAE,WAAW;GAAM,OAAO;EAAK,CAAC;CAC/D;AACF"}