@l1yp/file-viewer 0.1.0

package/dist/lib/sevenZip.js

@@ -0,0 +1,395 @@
+import { aesCbcDecrypt as e } from "./aes.js";
+import { Sha256 as t } from "./sha256.js";
+import { bcjX86Decode as n, lzma2Decode as r, lzmaDecode as i } from "./lzma.js";
+//#region src/lib/sevenZip.ts
+var a = [
+	55,
+	122,
+	188,
+	175,
+	39,
+	28
+], o = 32, s = 0, c = 1, l = 4, u = 5, d = 6, f = 7, p = 8, m = 9, h = 10, g = 11, _ = 12, v = 13, y = 14, b = 15, x = 17, S = 23, C = "06f10701", w = class extends Error {
+	constructor() {
+		super("该 7z 已加密，需要密码"), this.name = "SevenZipEncryptedError";
+	}
+}, T = class extends Error {
+	constructor() {
+		super("密码错误，无法解压"), this.name = "SevenZipPasswordError";
+	}
+}, E = class {
+	buf;
+	pos = 0;
+	constructor(e) {
+		this.buf = e;
+	}
+	byte() {
+		if (this.pos >= this.buf.length) throw Error("7z 头部意外结束");
+		return this.buf[this.pos++];
+	}
+	bytes(e) {
+		let t = this.buf.subarray(this.pos, this.pos + e);
+		return this.pos += e, t;
+	}
+	number() {
+		let e = this.byte(), t = 128, n = 0;
+		for (let r = 0; r < 8; r++) {
+			if ((e & t) === 0) {
+				n += (e & t - 1) * 2 ** (8 * r);
+				break;
+			}
+			n += this.byte() * 2 ** (8 * r), t >>= 1;
+		}
+		return n;
+	}
+	bitVector(e) {
+		let t = [], n = 0, r = 0;
+		for (let i = 0; i < e; i++) r === 0 && (n = this.byte(), r = 128), t.push((n & r) !== 0), r >>= 1;
+		return t;
+	}
+	boolVectorWithAll(e) {
+		return this.byte() === 0 ? this.bitVector(e) : Array.from({ length: e }, () => !0);
+	}
+};
+function D(e, t) {
+	return e.getUint32(t + 4, !0) * 4294967296 + e.getUint32(t, !0);
+}
+function O(e) {
+	let t = e.number(), n = [], r = 0, i = 0;
+	for (let a = 0; a < t; a++) {
+		let t = e.byte(), a = t & 15, o = e.bytes(a), s = "";
+		for (let e of o) s += e.toString(16).padStart(2, "0");
+		let c = 1, l = 1;
+		t & 16 && (c = e.number(), l = e.number());
+		let u = new Uint8Array();
+		t & 32 && (u = e.bytes(e.number()).slice()), n.push({
+			id: s,
+			numIn: c,
+			numOut: l,
+			props: u
+		}), r += c, i += l;
+	}
+	let a = i - 1, o = [];
+	for (let t = 0; t < a; t++) o.push({
+		inIndex: e.number(),
+		outIndex: e.number()
+	});
+	let s = r - a, c = [];
+	if (s === 1) {
+		for (let e = 0; e < r; e++) if (!o.some((t) => t.inIndex === e)) {
+			c.push(e);
+			break;
+		}
+	} else for (let t = 0; t < s; t++) c.push(e.number());
+	return {
+		coders: n,
+		bindPairs: o,
+		packedIndices: c,
+		unpackSizes: [],
+		numPackStreams: s,
+		packStreams: []
+	};
+}
+function k(e) {
+	let t = 0;
+	for (let n of e.coders) t += n.numOut;
+	for (let n = 0; n < t; n++) if (!e.bindPairs.some((e) => e.outIndex === n)) return n;
+	return t - 1;
+}
+function A(e) {
+	return e.unpackSizes[k(e)] ?? 0;
+}
+function j(e) {
+	let t = {
+		packPos: 0,
+		packSizes: [],
+		folders: [],
+		numUnpackStreamsInFolders: [],
+		subSizes: [],
+		folderHasCrc: []
+	}, n = e.byte();
+	if (n === d) {
+		t.packPos = e.number();
+		let r = e.number(), i = e.byte();
+		for (; i !== s;) {
+			if (i === m) for (let n = 0; n < r; n++) t.packSizes.push(e.number());
+			else if (i === h) N(e, r);
+			else throw Error(`7z PackInfo 未知字段 0x${i.toString(16)}`);
+			i = e.byte();
+		}
+		n = e.byte();
+	}
+	if (n === f) {
+		if (e.byte() !== g) throw Error("7z UnpackInfo 缺少 Folder");
+		let r = e.number();
+		if (e.byte() !== 0) throw Error("7z 不支持外部 Folder 定义");
+		for (let n = 0; n < r; n++) t.folders.push(O(e));
+		if (e.byte() !== _) throw Error("7z 缺少 CodersUnpackSize");
+		for (let n of t.folders) {
+			let t = 0;
+			for (let e of n.coders) t += e.numOut;
+			for (let r = 0; r < t; r++) n.unpackSizes.push(e.number());
+		}
+		t.folderHasCrc = t.folders.map(() => !1);
+		let i = e.byte();
+		for (; i !== s;) {
+			if (i === h) t.folderHasCrc = N(e, t.folders.length);
+			else throw Error(`7z UnpackInfo 未知字段 0x${i.toString(16)}`);
+			i = e.byte();
+		}
+		n = e.byte();
+	}
+	if (t.numUnpackStreamsInFolders = t.folders.map(() => 1), n === p ? (M(e, t), n = e.byte()) : t.subSizes = t.folders.map((e) => A(e)), n !== s) throw Error(`7z StreamsInfo 未以 End 结束 (0x${n.toString(16)})`);
+	let r = 0, i = o + t.packPos, a = [];
+	for (let e of t.packSizes) a.push(i), i += e;
+	for (let e of t.folders) for (let n = 0; n < e.numPackStreams; n++) e.packStreams.push({
+		offset: a[r],
+		size: t.packSizes[r]
+	}), r++;
+	return t;
+}
+function M(e, t) {
+	let n = e.byte();
+	n === v ? (t.numUnpackStreamsInFolders = t.folders.map(() => e.number()), n = e.byte()) : t.numUnpackStreamsInFolders = t.folders.map(() => 1);
+	let r = [];
+	for (let i = 0; i < t.folders.length; i++) {
+		let a = t.numUnpackStreamsInFolders[i];
+		if (a === 0) continue;
+		let o = 0;
+		if (n === m) for (let t = 1; t < a; t++) {
+			let t = e.number();
+			r.push(t), o += t;
+		}
+		r.push(A(t.folders[i]) - o);
+	}
+	t.subSizes = r, n === m && (n = e.byte());
+	let i = 0;
+	for (let e = 0; e < t.folders.length; e++) {
+		let n = t.numUnpackStreamsInFolders[e];
+		(n !== 1 || !t.folderHasCrc[e]) && (i += n);
+	}
+	for (n === h && (N(e, i), n = e.byte()); n !== s;) n = e.byte();
+}
+function N(e, t) {
+	let n = e.boolVectorWithAll(t);
+	for (let t of n) t && e.bytes(4);
+	return n;
+}
+function P(e) {
+	let t = e.number(), n = {
+		names: Array.from({ length: t }, () => ""),
+		emptyStream: Array.from({ length: t }, () => !1),
+		emptyFile: []
+	}, r = 0;
+	for (;;) {
+		let i = e.number();
+		if (i === s) break;
+		let a = e.number(), o = e.pos + a;
+		switch (i) {
+			case y:
+				n.emptyStream = e.bitVector(t), r = n.emptyStream.filter(Boolean).length, n.emptyFile = Array.from({ length: r }, () => !1);
+				break;
+			case b:
+				n.emptyFile = e.bitVector(r);
+				break;
+			case x:
+				if (e.byte() !== 0) throw Error("7z 不支持外部文件名");
+				n.names = F(e, o, t);
+				break;
+			default: break;
+		}
+		e.pos = o;
+	}
+	return n;
+}
+function F(e, t, n) {
+	let r = [], i = "";
+	for (; e.pos + 1 < t && r.length < n;) {
+		let t = e.byte() | e.byte() << 8;
+		t === 0 ? (r.push(i), i = "") : i += String.fromCharCode(t);
+	}
+	return r;
+}
+function I(e, t) {
+	let n = [], r = t.names.length, i = 0, a = 0, o = 0, s = 0, c = 0, l = () => {
+		for (; e && i < e.folders.length && a >= e.numUnpackStreamsInFolders[i];) i++, a = 0, o = 0;
+	};
+	for (let u = 0; u < r; u++) {
+		let r = t.names[u].replace(/\\/g, "/"), d = r.replace(/\/+$/, "").split("/").pop() ?? r;
+		if (t.emptyStream[u]) {
+			let e = t.emptyFile[c++] === !0;
+			n.push({
+				path: r,
+				name: d,
+				size: 0,
+				isDir: !e,
+				encrypted: !1,
+				folderIndex: -1,
+				offsetInFolder: 0
+			});
+		} else {
+			l();
+			let t = e ? e.subSizes[s++] : 0;
+			n.push({
+				path: r,
+				name: d,
+				size: t,
+				isDir: !1,
+				encrypted: e ? R(e.folders[i]) : !1,
+				folderIndex: i,
+				offsetInFolder: o
+			}), o += t, a++;
+		}
+	}
+	return n;
+}
+function L(e) {
+	let t = e.byte();
+	if (t !== c) throw Error(`7z 头部类型异常 (0x${t.toString(16)})`);
+	let n = e.byte(), r = null, i = {
+		names: [],
+		emptyStream: [],
+		emptyFile: []
+	};
+	return n === l && (r = j(e), n = e.byte()), n === u && (i = P(e), n = e.byte()), {
+		entries: I(r, i),
+		folders: r?.folders ?? []
+	};
+}
+function R(e) {
+	return e.coders.some((e) => e.id === C);
+}
+function z(e) {
+	let t = new Uint8Array(e.length * 2);
+	for (let n = 0; n < e.length; n++) {
+		let r = e.charCodeAt(n);
+		t[2 * n] = r & 255, t[2 * n + 1] = r >> 8 & 255;
+	}
+	return t;
+}
+function B(e, n) {
+	let r = e[0] ?? 0, i = r & 63, a = r >> 7 & 1, o = r >> 6 & 1;
+	if (e.length >= 2) {
+		let t = e[1];
+		a += t >> 4, o += t & 15;
+	}
+	let s = e.subarray(2, 2 + a), c = new Uint8Array(16);
+	c.set(e.subarray(2 + a, 2 + a + o));
+	let l = z(n), u = new Uint8Array(32);
+	if (i === 63) {
+		let e = 0;
+		for (let t = 0; t < s.length && e < 32; t++) u[e++] = s[t];
+		for (let t = 0; t < l.length && e < 32; t++) u[e++] = l[t];
+		return {
+			key: u,
+			iv: c
+		};
+	}
+	let d = 2 ** i, f = new t(), p = new Uint8Array(8);
+	for (let e = 0; e < d; e++) {
+		s.length && f.update(s), f.update(l), f.update(p);
+		for (let e = 0; e < 8 && (p[e] = p[e] + 1 & 255, p[e] === 0); e++);
+	}
+	return u.set(f.digest()), {
+		key: u,
+		iv: c
+	};
+}
+function V(t, a, o, s) {
+	switch (t.id) {
+		case "00": return a[0].length === o ? a[0] : a[0].subarray(0, o);
+		case "21": return r(a[0], t.props, o);
+		case "030101": return i(a[0], t.props, o);
+		case "03030103": {
+			let e = a[0].slice(0, o);
+			return n(e), e;
+		}
+		case C: {
+			if (!s?.password) throw new w();
+			let { key: n, iv: r } = B(t.props, s.password), i = e(n, r, a[0]);
+			return i.length === o ? i : i.subarray(0, o);
+		}
+		default: throw Error(`不支持的压缩方式 (coder ${t.id})`);
+	}
+}
+function H(e, t, n) {
+	let r = [], i = [], a = 0, o = 0;
+	for (let e of t.coders) r.push(a), i.push(o), a += e.numIn, o += e.numOut;
+	let s = (e) => {
+		for (let n = 0; n < t.coders.length; n++) if (e >= i[n] && e < i[n] + t.coders[n].numOut) return n;
+		throw Error("7z folder 输出流索引越界");
+	}, c = /* @__PURE__ */ new Map(), l = (i) => {
+		let a = c.get(i);
+		if (a) return a;
+		let o = s(i), u = t.coders[o], d = [];
+		for (let n = 0; n < u.numIn; n++) {
+			let i = r[o] + n, a = t.bindPairs.find((e) => e.inIndex === i);
+			if (a) d.push(l(a.outIndex));
+			else {
+				let n = t.packedIndices.indexOf(i);
+				if (n < 0) throw Error("7z folder 输入流未绑定也非打包流");
+				let r = t.packStreams[n];
+				d.push(e.subarray(r.offset, r.offset + r.size));
+			}
+		}
+		let f = V(u, d, t.unpackSizes[i], n);
+		return c.set(i, f), f;
+	};
+	return l(k(t));
+}
+function U(e) {
+	if (e.byteLength < o) return !1;
+	let t = new Uint8Array(e, 0, a.length);
+	return a.every((e, n) => t[n] === e);
+}
+function W(e, t) {
+	if (!U(e)) throw Error("不是有效的 7z 文件");
+	let n = new DataView(e), r = new Uint8Array(e), i = D(n, 12), a = D(n, 20);
+	if (a === 0) return {
+		entries: [],
+		folders: []
+	};
+	let s = o + i;
+	if (s + a > e.byteLength) throw Error("7z 头部超出文件范围");
+	let l = r.subarray(s, s + a), u = new E(l), d = u.byte(), f = !1;
+	if (d === S) {
+		let e = j(u);
+		if (e.folders.length !== 1) throw Error("7z 编码头部格式异常");
+		f = R(e.folders[0]);
+		try {
+			l = H(r, e.folders[0], { password: t });
+		} catch (e) {
+			throw f && t && !(e instanceof w) ? new T() : e;
+		}
+		u = new E(l), d = u.byte();
+	}
+	if (d !== c) throw f && t ? new T() : Error(`7z 头部类型异常 (0x${d.toString(16)})`);
+	u.pos = 0;
+	try {
+		return L(u);
+	} catch (e) {
+		throw f && t ? new T() : e;
+	}
+}
+var G = null, K = null;
+function q(e, t, n, r) {
+	if (n.isDir || n.folderIndex < 0 || n.size === 0) return new Uint8Array();
+	let i = t.folders[n.folderIndex];
+	if (!i) throw Error("7z 条目缺少对应 folder");
+	let a;
+	if (K && G && G.buf === e && G.index === n.folderIndex) a = K;
+	else {
+		try {
+			a = H(new Uint8Array(e), i, { password: r });
+		} catch (e) {
+			throw R(i) && r && !(e instanceof w) ? new T() : e;
+		}
+		G = {
+			buf: e,
+			index: n.folderIndex
+		}, K = a;
+	}
+	return a.subarray(n.offsetInFolder, n.offsetInFolder + n.size).slice();
+}
+//#endregion
+export { w as SevenZipEncryptedError, T as SevenZipPasswordError, q as extractSevenZipEntry, W as readSevenZip };

package/dist/lib/sha1.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Minimal synchronous SHA-1 (FIPS 180-4) — no dependency, no WASM.
+ *
+ * JKS / JCEKS keystores lean on SHA-1 in two synchronous, tight loops (see lib/jks.ts): the store-integrity
+ * MAC — SHA1(passwordUtf16BE ‖ "Mighty Aphrodite" ‖ storeBytes) — and Sun's KeyProtector, which chains SHA-1
+ * over password‖runningDigest once per 20 bytes of key material. WebCrypto's digest is async + one-shot, which
+ * would turn the whole parse path async and force a throwaway buffer each round; this incremental hasher stays
+ * synchronous and lets the KeyProtector feed the password + running digest directly, mirroring {@link Sha256}.
+ *
+ * SHA-1 is broken for collision resistance — used here ONLY because the JKS on-disk format mandates it, never
+ * as a security primitive for anything new. Not constant-time (fine for reading a keystore locally).
+ */
+export declare class Sha1 {
+    private readonly h;
+    private readonly block;
+    private readonly w;
+    private blen;
+    private total;
+    update(data: Uint8Array): this;
+    digest(): Uint8Array;
+    private compress;
+}
+/** One-shot convenience: SHA-1 of a single buffer. */
+export declare function sha1(data: Uint8Array): Uint8Array;

package/dist/lib/sha1.js

@@ -0,0 +1,53 @@
+//#region src/lib/sha1.ts
+var e = class {
+	h = new Uint32Array([
+		1732584193,
+		4023233417,
+		2562383102,
+		271733878,
+		3285377520
+	]);
+	block = new Uint8Array(64);
+	w = new Uint32Array(80);
+	blen = 0;
+	total = 0;
+	update(e) {
+		this.total += e.length;
+		for (let t = 0; t < e.length; t++) this.block[this.blen++] = e[t], this.blen === 64 && (this.compress(), this.blen = 0);
+		return this;
+	}
+	digest() {
+		let e = this.total * 8;
+		if (this.block[this.blen++] = 128, this.blen > 56) {
+			for (; this.blen < 64;) this.block[this.blen++] = 0;
+			this.compress(), this.blen = 0;
+		}
+		for (; this.blen < 56;) this.block[this.blen++] = 0;
+		let t = Math.floor(e / 4294967296), n = e >>> 0;
+		this.block[56] = t >>> 24 & 255, this.block[57] = t >>> 16 & 255, this.block[58] = t >>> 8 & 255, this.block[59] = t & 255, this.block[60] = n >>> 24 & 255, this.block[61] = n >>> 16 & 255, this.block[62] = n >>> 8 & 255, this.block[63] = n & 255, this.compress();
+		let r = new Uint8Array(20);
+		for (let e = 0; e < 5; e++) r[4 * e] = this.h[e] >>> 24 & 255, r[4 * e + 1] = this.h[e] >>> 16 & 255, r[4 * e + 2] = this.h[e] >>> 8 & 255, r[4 * e + 3] = this.h[e] & 255;
+		return r;
+	}
+	compress() {
+		let e = this.w, t = this.block;
+		for (let n = 0; n < 16; n++) e[n] = t[4 * n] << 24 | t[4 * n + 1] << 16 | t[4 * n + 2] << 8 | t[4 * n + 3];
+		for (let t = 16; t < 80; t++) {
+			let n = e[t - 3] ^ e[t - 8] ^ e[t - 14] ^ e[t - 16];
+			e[t] = n << 1 | n >>> 31;
+		}
+		let n = this.h[0], r = this.h[1], i = this.h[2], a = this.h[3], o = this.h[4];
+		for (let t = 0; t < 80; t++) {
+			let s, c;
+			t < 20 ? (s = r & i | ~r & a, c = 1518500249) : t < 40 ? (s = r ^ i ^ a, c = 1859775393) : t < 60 ? (s = r & i | r & a | i & a, c = 2400959708) : (s = r ^ i ^ a, c = 3395469782);
+			let l = (n << 5 | n >>> 27) + s + o + c + e[t] | 0;
+			o = a, a = i, i = r << 30 | r >>> 2, r = n, n = l;
+		}
+		this.h[0] = this.h[0] + n | 0, this.h[1] = this.h[1] + r | 0, this.h[2] = this.h[2] + i | 0, this.h[3] = this.h[3] + a | 0, this.h[4] = this.h[4] + o | 0;
+	}
+};
+function t(t) {
+	return new e().update(t).digest();
+}
+//#endregion
+export { e as Sha1, t as sha1 };

package/dist/lib/sha256.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Minimal synchronous SHA-256 (FIPS 180-4) — no dependency, no WASM.
+ *
+ * WebCrypto's digest is async and one-shot (no streaming), which is awkward for the 7z key-derivation loop
+ * that hashes salt‖password‖counter hundreds of thousands of times: a one-shot API would force a ~10 MB
+ * throwaway buffer AND make the whole 7z decode path async. This incremental hasher lets {@link lib/sevenZip}
+ * feed each round's bytes directly and stay synchronous. Not constant-time — fine for archive key derivation,
+ * not for anything that must resist timing attacks.
+ */
+export declare class Sha256 {
+    private readonly h;
+    private readonly block;
+    private readonly w;
+    private blen;
+    private total;
+    update(data: Uint8Array): this;
+    digest(): Uint8Array;
+    private compress;
+}
+/** One-shot convenience: SHA-256 of a single buffer. */
+export declare function sha256(data: Uint8Array): Uint8Array;

package/dist/lib/sha256.js

@@ -0,0 +1,119 @@
+//#region src/lib/sha256.ts
+var e = /* @__PURE__ */ new Uint32Array([
+	1116352408,
+	1899447441,
+	3049323471,
+	3921009573,
+	961987163,
+	1508970993,
+	2453635748,
+	2870763221,
+	3624381080,
+	310598401,
+	607225278,
+	1426881987,
+	1925078388,
+	2162078206,
+	2614888103,
+	3248222580,
+	3835390401,
+	4022224774,
+	264347078,
+	604807628,
+	770255983,
+	1249150122,
+	1555081692,
+	1996064986,
+	2554220882,
+	2821834349,
+	2952996808,
+	3210313671,
+	3336571891,
+	3584528711,
+	113926993,
+	338241895,
+	666307205,
+	773529912,
+	1294757372,
+	1396182291,
+	1695183700,
+	1986661051,
+	2177026350,
+	2456956037,
+	2730485921,
+	2820302411,
+	3259730800,
+	3345764771,
+	3516065817,
+	3600352804,
+	4094571909,
+	275423344,
+	430227734,
+	506948616,
+	659060556,
+	883997877,
+	958139571,
+	1322822218,
+	1537002063,
+	1747873779,
+	1955562222,
+	2024104815,
+	2227730452,
+	2361852424,
+	2428436474,
+	2756734187,
+	3204031479,
+	3329325298
+]), t = class {
+	h = new Uint32Array([
+		1779033703,
+		3144134277,
+		1013904242,
+		2773480762,
+		1359893119,
+		2600822924,
+		528734635,
+		1541459225
+	]);
+	block = new Uint8Array(64);
+	w = new Uint32Array(64);
+	blen = 0;
+	total = 0;
+	update(e) {
+		this.total += e.length;
+		for (let t = 0; t < e.length; t++) this.block[this.blen++] = e[t], this.blen === 64 && (this.compress(), this.blen = 0);
+		return this;
+	}
+	digest() {
+		let e = this.total * 8;
+		if (this.block[this.blen++] = 128, this.blen > 56) {
+			for (; this.blen < 64;) this.block[this.blen++] = 0;
+			this.compress(), this.blen = 0;
+		}
+		for (; this.blen < 56;) this.block[this.blen++] = 0;
+		let t = Math.floor(e / 4294967296), n = e >>> 0;
+		this.block[56] = t >>> 24 & 255, this.block[57] = t >>> 16 & 255, this.block[58] = t >>> 8 & 255, this.block[59] = t & 255, this.block[60] = n >>> 24 & 255, this.block[61] = n >>> 16 & 255, this.block[62] = n >>> 8 & 255, this.block[63] = n & 255, this.compress();
+		let r = new Uint8Array(32);
+		for (let e = 0; e < 8; e++) r[4 * e] = this.h[e] >>> 24 & 255, r[4 * e + 1] = this.h[e] >>> 16 & 255, r[4 * e + 2] = this.h[e] >>> 8 & 255, r[4 * e + 3] = this.h[e] & 255;
+		return r;
+	}
+	compress() {
+		let t = this.w, n = this.block;
+		for (let e = 0; e < 16; e++) t[e] = n[4 * e] << 24 | n[4 * e + 1] << 16 | n[4 * e + 2] << 8 | n[4 * e + 3];
+		for (let e = 16; e < 64; e++) {
+			let n = t[e - 15], r = t[e - 2], i = (n >>> 7 | n << 25) ^ (n >>> 18 | n << 14) ^ n >>> 3, a = (r >>> 17 | r << 15) ^ (r >>> 19 | r << 13) ^ r >>> 10;
+			t[e] = t[e - 16] + i + t[e - 7] + a | 0;
+		}
+		let r = this.h[0], i = this.h[1], a = this.h[2], o = this.h[3], s = this.h[4], c = this.h[5], l = this.h[6], u = this.h[7];
+		for (let n = 0; n < 64; n++) {
+			let d = (s >>> 6 | s << 26) ^ (s >>> 11 | s << 21) ^ (s >>> 25 | s << 7), f = s & c ^ ~s & l, p = u + d + f + e[n] + t[n] | 0, m = ((r >>> 2 | r << 30) ^ (r >>> 13 | r << 19) ^ (r >>> 22 | r << 10)) + (r & i ^ r & a ^ i & a) | 0;
+			u = l, l = c, c = s, s = o + p | 0, o = a, a = i, i = r, r = p + m | 0;
+		}
+		this.h[0] = this.h[0] + r | 0, this.h[1] = this.h[1] + i | 0, this.h[2] = this.h[2] + a | 0, this.h[3] = this.h[3] + o | 0, this.h[4] = this.h[4] + s | 0, this.h[5] = this.h[5] + c | 0, this.h[6] = this.h[6] + l | 0, this.h[7] = this.h[7] + u | 0;
+	}
+};
+function n(e) {
+	return new t().update(e).digest();
+}
+//#endregion
+export { t as Sha256, n as sha256 };

package/dist/lib/speechAudio.d.ts

@@ -0,0 +1,36 @@
+/**
+ * 语音编解码（3GPP AMR / 腾讯 SILK）→ WAV 的浏览器内解码器 —— 按需懒加载 WASM。
+ *
+ * 浏览器原生 <audio> 不认 3GPP AMR，也不认腾讯 SILK（微信 / QQ 语音；文件常见 `.silk` / `.slk`，也
+ * 大量以 `.amr` 为扩展名而内容其实是 SILK）。两者都是 CELP 系语音编解码，无法手搓，故各引一个编译好的
+ * WASM 解码器（与 lib/brotli、lib/sqlite 的 wasm 同思路：仅在真正播放这类文件时才 `import()`）：
+ *   - AMR-NB(8kHz) / AMR-WB(16kHz)：`@audio/decode-amr`（opencore-amr 编译；wasm 内联进 .cjs，无独立资源）
+ *   - SILK v3：`silk-wasm`（腾讯 SILK 编解码；独立 `silk.wasm`，Vite 经 `import.meta.url` 产出同源资源）
+ *
+ * 解出 PCM(s16le) 后用手写的 44 字节 PCM WAV 头包成 WAV，交给 <audio> 原生播放（同 QMC 解密后播放）。
+ * 识别一律按**文件头魔数**而非扩展名 —— 微信 `.amr` 实为 SILK，故 `.amr` 既可能是真 AMR 也可能是 SILK。
+ */
+export type SpeechCodec = 'silk' | 'amr-nb' | 'amr-wb';
+/**
+ * 按文件头判别语音编解码；非语音编解码（普通 mp3/wav/… 或无法识别）返回 null。
+ * SILK 容器有两种头：Skype 裸头 `#!SILK_V3`（偏移 0）与腾讯头 `\x02#!SILK_V3`（偏移 1）。
+ * AMR-WB 必须先于 AMR-NB 判断（`#!AMR` 是 `#!AMR-WB` 的前缀）。
+ */
+export declare function sniffSpeechCodec(bytes: Uint8Array): SpeechCodec | null;
+export interface DecodedSpeech {
+    /** 完整 WAV 字节（44 字节头 + PCM s16le）。 */
+    wav: Uint8Array;
+    codec: SpeechCodec;
+    sampleRate: number;
+    channels: number;
+    durationSec: number;
+}
+export declare class SpeechDecodeError extends Error {
+}
+/** 用 PCM s16le 数据包出一段标准 44 字节头的 WAV（单声道、16 位）。 */
+export declare function wavFromPcmS16le(pcm: Uint8Array, sampleRate: number, channels?: number): Uint8Array;
+/**
+ * 把一段 AMR / SILK 语音字节解码成可播放的 WAV：先 {@link sniffSpeechCodec} 判型，再懒加载对应 WASM
+ * 解码器解出 PCM 并包成 WAV。非 AMR/SILK 抛 {@link SpeechDecodeError}（调用方据此回退原生播放）。
+ */
+export declare function decodeSpeechToWav(input: ArrayBuffer | Uint8Array): Promise<DecodedSpeech>;