pdf-parser.js 4.8.6 → 4.8.8

package/dist/crypto/sha2.cjs

@@ -5,7 +5,6 @@ const SHA256_ROUNDS = 64;
 const SHA512_BLOCK_BYTES = 128;
 const SHA512_ROUNDS = 80;
 const WORDS_PER_BLOCK = 16;
-const MASK64 = 18446744073709551615n;
 const K512 = [
 	4794697086780616226n,
 	8158064640168781261n,
@@ -110,6 +109,9 @@ const H384 = [
 ];
 const K256 = Uint32Array.from(K512.slice(0, SHA256_ROUNDS), (k) => Number(k >> 32n));
 const H256 = Uint32Array.from(H512, (h) => Number(h >> 32n));
+const K512_HIGH = Uint32Array.from(K512, (k) => Number(k >> 32n));
+const K512_LOW = Uint32Array.from(K512, (k) => Number(BigInt.asUintN(32, k)));
+const TWO_POW_32 = 4294967296;
 function padBigEndian(bytes, blockBytes, lengthBytes) {
 	const paddedLength = (Math.floor((bytes.length + lengthBytes) / blockBytes) + 1) * blockBytes;
 	const padded = new Uint8Array(paddedLength);
@@ -185,69 +187,115 @@ function sha256(bytes) {
 	}
 	return digest;
 }
-function rotr64(value, bits) {
-	return (value >> bits | value << 64n - bits) & MASK64;
+function readWord32(bytes, offset) {
+	return (bytes[offset] << 24 | bytes[offset + 1] << 16 | bytes[offset + 2] << 8 | bytes[offset + 3]) >>> 0;
 }
 function sha512Core(bytes, initialState, outputWords) {
 	const padded = padBigEndian(bytes, SHA512_BLOCK_BYTES, 16);
-	const state = Array.from(initialState);
-	const w = new Array(SHA512_ROUNDS).fill(0n);
+	const stateHigh = Uint32Array.from(initialState, (word) => Number(word >> 32n));
+	const stateLow = Uint32Array.from(initialState, (word) => Number(BigInt.asUintN(32, word)));
+	const wHigh = new Uint32Array(SHA512_ROUNDS);
+	const wLow = new Uint32Array(SHA512_ROUNDS);
 	for (let offset = 0; offset < padded.length; offset += SHA512_BLOCK_BYTES) {
-		for (let t = 0; t < WORDS_PER_BLOCK; t++) {
-			let word = 0n;
-			for (let i = 0; i < 8; i++) word = word << 8n | BigInt(padded[offset + t * 8 + i]);
-			w[t] = word;
-		}
-		for (let t = WORDS_PER_BLOCK; t < SHA512_ROUNDS; t++) {
-			const x = w[t - 15];
-			const y = w[t - 2];
-			const s0 = rotr64(x, 1n) ^ rotr64(x, 8n) ^ x >> 7n;
-			const s1 = rotr64(y, 19n) ^ rotr64(y, 61n) ^ y >> 6n;
-			w[t] = w[t - 16] + s0 + w[t - 7] + s1 & MASK64;
-		}
-		let a = state[0];
-		let b = state[1];
-		let c = state[2];
-		let d = state[3];
-		let e = state[4];
-		let f = state[5];
-		let g = state[6];
-		let h = state[7];
+		wHigh.forEach((_word, t) => {
+			if (t < WORDS_PER_BLOCK) {
+				const at = offset + t * 8;
+				wHigh[t] = readWord32(padded, at);
+				wLow[t] = readWord32(padded, at + 4);
+				return;
+			}
+			const xh = wHigh[t - 15];
+			const xl = wLow[t - 15];
+			const yh = wHigh[t - 2];
+			const yl = wLow[t - 2];
+			const s0h = (xh >>> 1 | xl << 31) ^ (xh >>> 8 | xl << 24) ^ xh >>> 7;
+			const s0l = (xl >>> 1 | xh << 31) ^ (xl >>> 8 | xh << 24) ^ (xl >>> 7 | xh << 25);
+			const s1h = (yh >>> 19 | yl << 13) ^ (yl >>> 29 | yh << 3) ^ yh >>> 6;
+			const s1l = (yl >>> 19 | yh << 13) ^ (yh >>> 29 | yl << 3) ^ (yl >>> 6 | yh << 26);
+			const low = wLow[t - 16] + (s0l >>> 0) + wLow[t - 7] + (s1l >>> 0);
+			const carry = Math.floor(low / TWO_POW_32);
+			wLow[t] = low;
+			wHigh[t] = wHigh[t - 16] + (s0h >>> 0) + wHigh[t - 7] + (s1h >>> 0) + carry;
+		});
+		let ah = stateHigh[0];
+		let al = stateLow[0];
+		let bh = stateHigh[1];
+		let bl = stateLow[1];
+		let ch = stateHigh[2];
+		let cl = stateLow[2];
+		let dh = stateHigh[3];
+		let dl = stateLow[3];
+		let eh = stateHigh[4];
+		let el = stateLow[4];
+		let fh = stateHigh[5];
+		let fl = stateLow[5];
+		let gh = stateHigh[6];
+		let gl = stateLow[6];
+		let hh = stateHigh[7];
+		let hl = stateLow[7];
 		for (let t = 0; t < SHA512_ROUNDS; t++) {
-			const bigS1 = rotr64(e, 14n) ^ rotr64(e, 18n) ^ rotr64(e, 41n);
-			const ch = e & f ^ ~e & MASK64 & g;
-			const t1 = h + bigS1 + ch + K512[t] + w[t] & MASK64;
-			const t2 = (rotr64(a, 28n) ^ rotr64(a, 34n) ^ rotr64(a, 39n)) + (a & b ^ a & c ^ b & c) & MASK64;
-			h = g;
-			g = f;
-			f = e;
-			e = d + t1 & MASK64;
-			d = c;
-			c = b;
-			b = a;
-			a = t1 + t2 & MASK64;
+			const bigS1h = (eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (el >>> 9 | eh << 23);
+			const bigS1l = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (eh >>> 9 | el << 23);
+			const chh = eh & fh ^ ~eh & gh;
+			const chl = el & fl ^ ~el & gl;
+			const t1Sum = hl + (bigS1l >>> 0) + (chl >>> 0) + K512_LOW[t] + wLow[t];
+			const t1l = t1Sum >>> 0;
+			const t1h = hh + (bigS1h >>> 0) + (chh >>> 0) + K512_HIGH[t] + wHigh[t] + Math.floor(t1Sum / TWO_POW_32) >>> 0;
+			const bigS0h = (ah >>> 28 | al << 4) ^ (al >>> 2 | ah << 30) ^ (al >>> 7 | ah << 25);
+			const bigS0l = (al >>> 28 | ah << 4) ^ (ah >>> 2 | al << 30) ^ (ah >>> 7 | al << 25);
+			const majh = ah & bh ^ ah & ch ^ bh & ch;
+			const majl = al & bl ^ al & cl ^ bl & cl;
+			const t2Sum = (bigS0l >>> 0) + (majl >>> 0);
+			const t2l = t2Sum >>> 0;
+			const t2h = (bigS0h >>> 0) + (majh >>> 0) + Math.floor(t2Sum / TWO_POW_32) >>> 0;
+			hh = gh;
+			hl = gl;
+			gh = fh;
+			gl = fl;
+			fh = eh;
+			fl = el;
+			const eSum = dl + t1l;
+			eh = dh + t1h + Math.floor(eSum / TWO_POW_32) >>> 0;
+			el = eSum >>> 0;
+			dh = ch;
+			dl = cl;
+			ch = bh;
+			cl = bl;
+			bh = ah;
+			bl = al;
+			const aSum = t1l + t2l;
+			ah = t1h + t2h + Math.floor(aSum / TWO_POW_32) >>> 0;
+			al = aSum >>> 0;
 		}
-		const next = [
-			a,
-			b,
-			c,
-			d,
-			e,
-			f,
-			g,
-			h
+		const nextHigh = [
+			ah,
+			bh,
+			ch,
+			dh,
+			eh,
+			fh,
+			gh,
+			hh
 		];
-		for (let i = 0; i < state.length; i++) state[i] = state[i] + next[i] & MASK64;
-	}
-	const digest = new Uint8Array(outputWords * 8);
-	for (let i = 0; i < outputWords; i++) {
-		let word = state[i];
-		for (let j = 7; j >= 0; j--) {
-			digest[i * 8 + j] = Number(word & 255n);
-			word >>= 8n;
-		}
+		const nextLow = [
+			al,
+			bl,
+			cl,
+			dl,
+			el,
+			fl,
+			gl,
+			hl
+		];
+		stateHigh.forEach((word, i) => {
+			const sum = stateLow[i] + nextLow[i];
+			stateHigh[i] = word + nextHigh[i] + Math.floor(sum / TWO_POW_32);
+			stateLow[i] = sum;
+		});
 	}
-	return digest;
+	return Uint8Array.from({ length: outputWords * 8 }, (_unused, index) => {
+		return (index % 8 < 4 ? stateHigh : stateLow)[Math.floor(index / 8)] >>> 24 - 8 * (index % 4) & 255;
+	});
 }
 function sha512(bytes) {
 	return sha512Core(bytes, H512, 8);

package/dist/crypto/sha2.js

@@ -4,7 +4,6 @@ const SHA256_ROUNDS = 64;
 const SHA512_BLOCK_BYTES = 128;
 const SHA512_ROUNDS = 80;
 const WORDS_PER_BLOCK = 16;
-const MASK64 = 18446744073709551615n;
 const K512 = [
 	4794697086780616226n,
 	8158064640168781261n,
@@ -109,6 +108,9 @@ const H384 = [
 ];
 const K256 = Uint32Array.from(K512.slice(0, SHA256_ROUNDS), (k) => Number(k >> 32n));
 const H256 = Uint32Array.from(H512, (h) => Number(h >> 32n));
+const K512_HIGH = Uint32Array.from(K512, (k) => Number(k >> 32n));
+const K512_LOW = Uint32Array.from(K512, (k) => Number(BigInt.asUintN(32, k)));
+const TWO_POW_32 = 4294967296;
 function padBigEndian(bytes, blockBytes, lengthBytes) {
 	const paddedLength = (Math.floor((bytes.length + lengthBytes) / blockBytes) + 1) * blockBytes;
 	const padded = new Uint8Array(paddedLength);
@@ -184,69 +186,115 @@ function sha256(bytes) {
 	}
 	return digest;
 }
-function rotr64(value, bits) {
-	return (value >> bits | value << 64n - bits) & MASK64;
+function readWord32(bytes, offset) {
+	return (bytes[offset] << 24 | bytes[offset + 1] << 16 | bytes[offset + 2] << 8 | bytes[offset + 3]) >>> 0;
 }
 function sha512Core(bytes, initialState, outputWords) {
 	const padded = padBigEndian(bytes, SHA512_BLOCK_BYTES, 16);
-	const state = Array.from(initialState);
-	const w = new Array(SHA512_ROUNDS).fill(0n);
+	const stateHigh = Uint32Array.from(initialState, (word) => Number(word >> 32n));
+	const stateLow = Uint32Array.from(initialState, (word) => Number(BigInt.asUintN(32, word)));
+	const wHigh = new Uint32Array(SHA512_ROUNDS);
+	const wLow = new Uint32Array(SHA512_ROUNDS);
 	for (let offset = 0; offset < padded.length; offset += SHA512_BLOCK_BYTES) {
-		for (let t = 0; t < WORDS_PER_BLOCK; t++) {
-			let word = 0n;
-			for (let i = 0; i < 8; i++) word = word << 8n | BigInt(padded[offset + t * 8 + i]);
-			w[t] = word;
-		}
-		for (let t = WORDS_PER_BLOCK; t < SHA512_ROUNDS; t++) {
-			const x = w[t - 15];
-			const y = w[t - 2];
-			const s0 = rotr64(x, 1n) ^ rotr64(x, 8n) ^ x >> 7n;
-			const s1 = rotr64(y, 19n) ^ rotr64(y, 61n) ^ y >> 6n;
-			w[t] = w[t - 16] + s0 + w[t - 7] + s1 & MASK64;
-		}
-		let a = state[0];
-		let b = state[1];
-		let c = state[2];
-		let d = state[3];
-		let e = state[4];
-		let f = state[5];
-		let g = state[6];
-		let h = state[7];
+		wHigh.forEach((_word, t) => {
+			if (t < WORDS_PER_BLOCK) {
+				const at = offset + t * 8;
+				wHigh[t] = readWord32(padded, at);
+				wLow[t] = readWord32(padded, at + 4);
+				return;
+			}
+			const xh = wHigh[t - 15];
+			const xl = wLow[t - 15];
+			const yh = wHigh[t - 2];
+			const yl = wLow[t - 2];
+			const s0h = (xh >>> 1 | xl << 31) ^ (xh >>> 8 | xl << 24) ^ xh >>> 7;
+			const s0l = (xl >>> 1 | xh << 31) ^ (xl >>> 8 | xh << 24) ^ (xl >>> 7 | xh << 25);
+			const s1h = (yh >>> 19 | yl << 13) ^ (yl >>> 29 | yh << 3) ^ yh >>> 6;
+			const s1l = (yl >>> 19 | yh << 13) ^ (yh >>> 29 | yl << 3) ^ (yl >>> 6 | yh << 26);
+			const low = wLow[t - 16] + (s0l >>> 0) + wLow[t - 7] + (s1l >>> 0);
+			const carry = Math.floor(low / TWO_POW_32);
+			wLow[t] = low;
+			wHigh[t] = wHigh[t - 16] + (s0h >>> 0) + wHigh[t - 7] + (s1h >>> 0) + carry;
+		});
+		let ah = stateHigh[0];
+		let al = stateLow[0];
+		let bh = stateHigh[1];
+		let bl = stateLow[1];
+		let ch = stateHigh[2];
+		let cl = stateLow[2];
+		let dh = stateHigh[3];
+		let dl = stateLow[3];
+		let eh = stateHigh[4];
+		let el = stateLow[4];
+		let fh = stateHigh[5];
+		let fl = stateLow[5];
+		let gh = stateHigh[6];
+		let gl = stateLow[6];
+		let hh = stateHigh[7];
+		let hl = stateLow[7];
 		for (let t = 0; t < SHA512_ROUNDS; t++) {
-			const bigS1 = rotr64(e, 14n) ^ rotr64(e, 18n) ^ rotr64(e, 41n);
-			const ch = e & f ^ ~e & MASK64 & g;
-			const t1 = h + bigS1 + ch + K512[t] + w[t] & MASK64;
-			const t2 = (rotr64(a, 28n) ^ rotr64(a, 34n) ^ rotr64(a, 39n)) + (a & b ^ a & c ^ b & c) & MASK64;
-			h = g;
-			g = f;
-			f = e;
-			e = d + t1 & MASK64;
-			d = c;
-			c = b;
-			b = a;
-			a = t1 + t2 & MASK64;
+			const bigS1h = (eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (el >>> 9 | eh << 23);
+			const bigS1l = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (eh >>> 9 | el << 23);
+			const chh = eh & fh ^ ~eh & gh;
+			const chl = el & fl ^ ~el & gl;
+			const t1Sum = hl + (bigS1l >>> 0) + (chl >>> 0) + K512_LOW[t] + wLow[t];
+			const t1l = t1Sum >>> 0;
+			const t1h = hh + (bigS1h >>> 0) + (chh >>> 0) + K512_HIGH[t] + wHigh[t] + Math.floor(t1Sum / TWO_POW_32) >>> 0;
+			const bigS0h = (ah >>> 28 | al << 4) ^ (al >>> 2 | ah << 30) ^ (al >>> 7 | ah << 25);
+			const bigS0l = (al >>> 28 | ah << 4) ^ (ah >>> 2 | al << 30) ^ (ah >>> 7 | al << 25);
+			const majh = ah & bh ^ ah & ch ^ bh & ch;
+			const majl = al & bl ^ al & cl ^ bl & cl;
+			const t2Sum = (bigS0l >>> 0) + (majl >>> 0);
+			const t2l = t2Sum >>> 0;
+			const t2h = (bigS0h >>> 0) + (majh >>> 0) + Math.floor(t2Sum / TWO_POW_32) >>> 0;
+			hh = gh;
+			hl = gl;
+			gh = fh;
+			gl = fl;
+			fh = eh;
+			fl = el;
+			const eSum = dl + t1l;
+			eh = dh + t1h + Math.floor(eSum / TWO_POW_32) >>> 0;
+			el = eSum >>> 0;
+			dh = ch;
+			dl = cl;
+			ch = bh;
+			cl = bl;
+			bh = ah;
+			bl = al;
+			const aSum = t1l + t2l;
+			ah = t1h + t2h + Math.floor(aSum / TWO_POW_32) >>> 0;
+			al = aSum >>> 0;
 		}
-		const next = [
-			a,
-			b,
-			c,
-			d,
-			e,
-			f,
-			g,
-			h
+		const nextHigh = [
+			ah,
+			bh,
+			ch,
+			dh,
+			eh,
+			fh,
+			gh,
+			hh
 		];
-		for (let i = 0; i < state.length; i++) state[i] = state[i] + next[i] & MASK64;
-	}
-	const digest = new Uint8Array(outputWords * 8);
-	for (let i = 0; i < outputWords; i++) {
-		let word = state[i];
-		for (let j = 7; j >= 0; j--) {
-			digest[i * 8 + j] = Number(word & 255n);
-			word >>= 8n;
-		}
+		const nextLow = [
+			al,
+			bl,
+			cl,
+			dl,
+			el,
+			fl,
+			gl,
+			hl
+		];
+		stateHigh.forEach((word, i) => {
+			const sum = stateLow[i] + nextLow[i];
+			stateHigh[i] = word + nextHigh[i] + Math.floor(sum / TWO_POW_32);
+			stateLow[i] = sum;
+		});
 	}
-	return digest;
+	return Uint8Array.from({ length: outputWords * 8 }, (_unused, index) => {
+		return (index % 8 < 4 ? stateHigh : stateLow)[Math.floor(index / 8)] >>> 24 - 8 * (index % 4) & 255;
+	});
 }
 function sha512(bytes) {
 	return sha512Core(bytes, H512, 8);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pdf-parser.js",
-  "version": "4.8.6",
+  "version": "4.8.8",
   "description": "Hand-written, dependency-minimal PDF codec: parses arbitrary real-world PDFs and generates new ones, built on its own codec-owned LayoutDocument item model and Zod 4 codecs.",
   "type": "module",
   "repository": {
@@ -72,7 +72,7 @@
   ],
   "license": "MIT",
   "dependencies": {
-    "byte-codec": "1.5.5",
+    "byte-codec": "1.5.6",
     "document-schema.js": "7.11.3",
     "fflate": "0.8.3",
     "zod": "4.4.3"