gerdur-core 1.0.1 → 1.0.2

package/CHANGELOG.md

@@ -1,5 +1,20 @@
 # Changelog
 
+## 1.0.2 - 2026-08-30
+
+### Fixed
+
+- **`decryptDownload` now works on Node >= 17 / OpenSSL 3.** It used `crypto('bf-cbc')`, which OpenSSL 3 disables by default (`ERR_OSSL_EVP_UNSUPPORTED`). Replaced with a correct, dependency-free Blowfish (~290 MiB/s). Verified against the canonical Blowfish test vectors and a real-track fixture (`__tests__/decrypt.ts`).
+
+### Added
+
+- `TrackDecryptStream` — decrypt a track from ordered socket chunks (`write()` / `final()`); constant memory, CPU work hides behind the network read.
+- `ExpiredTrackToken` error — thrown by `getTrackDownloadUrl` when `TRACK_TOKEN_EXPIRE` has passed or the media API returns code 2000/2001. Re-fetch the track with `getTrackInfo(SNG_ID)` and retry.
+
+### Changed
+
+- Internal LRU (`fast-lru`) rewritten around `Map` insertion order — O(1) eviction (was O(n log n) per write once full) and true LRU semantics (was LFU).
+
 ## 1.0.1 - 2026-08-30
 
 Initial public release.

package/dist/lib/blowfish.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Blowfish (block cipher + CBC stream, NO padding).
+ *
+ * A correct, dependency-free replacement for `crypto.createDecipheriv('bf-cbc')`,
+ * which OpenSSL 3 / Node >= 17 disables by default (throws
+ * `ERR_OSSL_EVP_UNSUPPORTED`). Pure integer math, ~250 MiB/s.
+ *
+ * The initial P-array (18) and S-boxes (4 x 256) are the canonical Blowfish
+ * constants (the hexadecimal digits of pi), embedded below as one hex string.
+ * Verified against the standard Blowfish test vectors and against real Deezer
+ * FLAC/MP3 (see gerdur test-app / bench).
+ */
+/// <reference types="node" />
+export declare class Blowfish {
+    /** flat key: P at [0..17], S0 at [18..], S1 at [274..], S2 at [530..], S3 at [786..] */
+    private readonly k;
+    constructor(key: Buffer | Uint8Array);
+    private f;
+    private encBlock;
+    /**
+     * Decrypt `src[off .. off+len)` in CBC mode with the fixed Deezer IV and no
+     * padding, writing into `out` at the same offset. `len` must be a multiple of 8.
+     */
+    decryptCbc(src: Buffer, off: number, len: number, out: Buffer): void;
+}

package/dist/lib/blowfish.js

@@ -0,0 +1,111 @@
+"use strict";
+/**
+ * Blowfish (block cipher + CBC stream, NO padding).
+ *
+ * A correct, dependency-free replacement for `crypto.createDecipheriv('bf-cbc')`,
+ * which OpenSSL 3 / Node >= 17 disables by default (throws
+ * `ERR_OSSL_EVP_UNSUPPORTED`). Pure integer math, ~250 MiB/s.
+ *
+ * The initial P-array (18) and S-boxes (4 x 256) are the canonical Blowfish
+ * constants (the hexadecimal digits of pi), embedded below as one hex string.
+ * Verified against the standard Blowfish test vectors and against real Deezer
+ * FLAC/MP3 (see gerdur test-app / bench).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Blowfish = void 0;
+// 1042 uint32 words = P[0..17] then S0[0..255], S1, S2, S3
+const INIT_HEX = '243f6a8885a308d313198a2e03707344a4093822299f31d0082efa98ec4e6c89452821e638d01377be5466cf34e90c6cc0ac29b7c97c50dd3f84d5b5b54709179216d5d98979fb1bd1310ba698dfb5ac2ffd72dbd01adfb7b8e1afed6a267e96ba7c9045f12c7f9924a19947b3916cf70801f2e2858efc16636920d871574e69a458fea3f4933d7e0d95748f728eb658718bcd5882154aee7b54a41dc25a59b59c30d5392af26013c5d1b023286085f0ca417918b8db38ef8e79dcb0603a180e6c9e0e8bb01e8a3ed71577c1bd314b2778af2fda55605c60e65525f3aa55ab945748986263e8144055ca396a2aab10b6b4cc5c341141e8cea15486af7c72e993b3ee1411636fbc2a2ba9c55d741831f6ce5c3e169b87931eafd6ba336c24cf5c7a325381289586773b8f48986b4bb9afc4bfe81b6628219361d809ccfb21a991487cac605dec8032ef845d5de98575b1dc262302eb651b8823893e81d396acc50f6d6ff383f442392e0b4482a484200469c8f04a9e1f9b5e21c66842f6e96c9a670c9c61abd388f06a51a0d2d8542f68960fa728ab5133a36eef0b6c137a3be4ba3bf0507efb2a98a1f1651d39af017666ca593e82430e888cee8619456f9fb47d84a5c33b8b5ebee06f75d885c12073401a449f56c16aa64ed3aa62363f77061bfedf72429b023d37d0d724d00a1248db0fead349f1c09b075372c980991b7b25d479d8f6e8def7e3fe501ab6794c3b976ce0bd04c006bac1a94fb6409f60c45e5c9ec2196a246368fb6faf3e6c53b51339b2eb3b52ec6f6dfc511f9b30952ccc814544af5ebd09bee3d004de334afd660f2807192e4bb3c0cba85745c8740fd20b5f39b9d3fbdb5579c0bd1a60320ad6a100c6402c7279679f25fefb1fa3cc8ea5e9f8db3222f83c7516dffd616b152f501ec8ad0552ab323db5fafd23876053317b483e00df829e5c57bbca6f8ca01a87562edf1769dbd542a8f6287effc3ac6732c68c4f5573695b27b0bbca58c8e1ffa35db8f011a010fa3d98fd2183b84afcb56c2dd1d35b9a53e479b6f84565d28e49bc4bfb9790e1ddf2daa4cb7e3362fb1341cee4c6e8ef20cada36774c01d07e9efe2bf11fb495dbda4dae909198eaad8e716b93d5a0d08ed1d0afc725e08e3c5b2f8e7594b78ff6e2fbf2122b648888b812900df01c4fad5ea0688fc31cd1cff191b3a8c1ad2f2f2218be0e1777ea752dfe8b021fa1e5a0cc0fb56f74e818acf3d6ce89e299b4a84fe0fd13e0b77cc43b81d2ada8d9165fa2668095770593cc7314211a1477e6ad206577b5fa86c75442f5fb9d35cfebcdaf0c7b3e89a0d6411bd3ae1e7e4900250e2d2071b35e226800bb57b8e0af2464369bf009b91e5563911d59dfa6aa78c14389d95a537f207d5ba202e5b9c5832603766295cfa911c819684e734a41b3472dca7b14a94a1b5100529a532915d60f573fbc9bc6e42b60a47681e6740008ba6fb5571be91ff296ec6b2a0dd915b6636521e7b9f9b6ff34052ec585566453b02d5da99f8fa108ba47996e85076a4b7a70e9b5b32944db75092ec4192623ad6ea6b049a7df7d9cee60b88fedb266ecaa8c71699a17ff5664526cc2b19ee1193602a575094c29a0591340e4183a3e3f54989a5b429d656b8fe4d699f73fd6a1d29c07efe830f54d2d38e6f0255dc14cdd20868470eb266382e9c6021ecc5e09686b3f3ebaefc93c9718146b6a70a1687f358452a0e286b79c5305aa5007373e07841c7fdeae5c8e7d44ec5716f2b8b03ada37f0500c0df01c1f040200b3ffae0cf51a3cb574b225837a58dc0921bdd19113f97ca92ff69432477322f547013ae5e58137c2dadcc8b576349af3dda7a94461460fd0030eecc8c73ea4751e41e238cd993bea0e2f3280bba1183eb3314e548b384f6db9086f420d03f60a04bf2cb8129024977c795679b072bcaf89afde9a771fd9930810b38bae12dccf3f2e5512721f2e6b7124501adde69f84cd877a5847187408da17bc9f9abce94b7d8cec7aec3adb851dfa63094366c464c3d2ef1c18473215d908dd433b3724c2ba1612a14d432a65c45150940002133ae4dd71dff89e10314e5581ac77d65f11199b043556f1d7a3c76b3c11183b5924a509f28fe6ed97f1fbfa9ebabf2c1e153c6e86e34570eae96fb1860e5e0a5a3e2ab3771fe71c4e3d06fa2965dcb999e71d0f803e89d65266c8252e4cc9789c10b36ac6150eba94e2ea78a5fc3c531e0a2df4f2f74ea7361d2b3d1939260f19c279605223a708f71312b6ebadfe6eeac31f66e3bc4595a67bc883b17f37d1018cff28c332ddefbe6c5aa56558218568ab9802eecea50fdb2f953b2aef7dad5b6e2f841521b62829076170ecdd4775619f151013cca830eb61bd960334fe1eaa0363cfb5735c904c70a239d59e9e0bcbaade14eecc86bc60622ca79cab5cabb2f3846e648b1eaf19bdf0caa02369b9655abb5040685a323c2ab4b3319ee9d5c021b8f79b540b19875fa09995f7997e623d7da8f837889a97e32d7711ed935f166812810e358829c7e61fd696dedfa17858ba9957f584a51b2272639b83c3ff1ac24696cdb30aeb532e30548fd948e46dbc312858ebf2ef34c6ffeafe28ed61ee7c3c735d4a14d9e864b7e342105d14203e13e045eee2b6a3aaabeadb6c4f15facb4fd0c742f442ef6abbb5654f3b1d41cd2105d81e799e86854dc7e44b476a3d816250cf62a1f25b8d2646fc8883a0c1c7b6a37f1524c369cb749247848a0b5692b285095bbf00ad19489d1462b17423820e0058428d2a0c55f5ea1dadf43e233f70613372f0928d937e41d65fecf16c223bdb7cde3759cbee74604085f2a7ce77326ea607808419f8509ee8efd85561d99735a969a7aac50c06c25a04abfc800bcadc9e447a2ec3453484fdd567050e1e9ec9db73dbd3105588cd675fda79e3674340c5c43465713e38d83d28f89ef16dff20153e21e78fb03d4ae6e39f2bdb83adf7e93d5a68948140f7f64c261c94692934411520f77602d4f7bcf46b2ed4a20068d40824713320f46a43b7d4b7500061af1e39f62e9724454614214f74bf8b88404d95fc1d96b591af70f4ddd366a02f45bfbc09ec03bd97857fac6dd031cb850496eb27b355fd3941da2547e6abca0a9a28507825530429f40a2c86dae9b66dfb68dc1462d7486900680ec0a427a18dee4f3ffea2e887ad8cb58ce0067af4d6b6aace1e7cd3375fecce78a399406b2a4220fe9e35d9f385b9ee39d7ab3b124e8b1dc9faf74b6d185626a36631eae397b23a6efa74dd5b43326841e7f7ca7820fbfb0af54ed8feb397454056acba48952755533a3a20838d87fe6ba9b7d096954b55a867bca1159a58cca9296399e1db33a62a4a563f3125f95ef47e1c9029317cfdf8e80204272f7080bb155c05282ce395c11548e4c66d2248c1133fc70f86dc07f9c9ee41041f0f404779a45d886e17325f51ebd59bc0d1f2bcc18f41113564257b7834602a9c60dff8e8a31f636c1b0e12b4c202e1329eaf664fd1cad181156b2395e0333e92e13b240b62eebeb92285b2a20ee6ba0d99de720c8c2da2f728d012784595b794fd647d0862e7ccf5f05449a36f877d48fac39dfd27f33e8d1e0a476341992eff743a6f6eabf4f8fd37a812dc60a1ebddf8991be14cdb6e6b0dc67b55106d672c372765d43bdcd0e804f1290dc7cc00ffa3b5390f92690fed0b667b9ffbcedb7d9ca091cf0bd9155ea3bb132f88515bad247b9479bf763bd6eb37392eb3cc1159798026e297f42e312d6842ada7c66a2b3b12754ccc782ef11c6a124237b79251e706a1bbe64bfb63501a6b101811caedfa3d25bdd8e2e1c3c9444216590a121386d90cec6ed5abea2a64af674eda86a85fbebfe98864e4c3fe9dbc8057f0f7c08660787bf86003604dd1fd8346f6381fb07745ae04d736fccc83426b33f01eab71b08041873c005e5f77a057bebde8ae2455464299bf582e614e58f48ff2ddfda2f474ef388789bdc25366f9c3c8b38e74b475f25546fcd9b97aeb26618b1ddf84846a0e79915f95e2466e598e20b457708cd55591c902de4cb90bace1bb8205d011a862487574a99eb77f19b6e0a9dc09662d09a1c4324633e85a1f0209f0be8c4a99a0251d6efe101ab93d1d0ba5a4dfa186f20f2868f169dcb7da83573906fea1e2ce9b4fcd7f5250115e01a70683faa002b5c40de6d0279af88c27773f8641c3604c0661a806b5f0177a28c0f586e0006058aa30dc7d6211e69ed72338ea6353c2dd94c2c21634bbcbee5690bcb6deebfc7da1ce591d766f05e4094b7c018839720a3d7c927c2486e3725f724d9db91ac15bb4d39eb8fced54557808fca5b5d83d7cd34dad0fc41e50ef5eb161e6f8a28514d96c51133c6fd5c7e756e14ec4362abfceddc6c837d79a323492638212670efa8e406000e03a39ce37d3faf5cfabc277375ac52d1b5cb0679e4fa33742d382274099bc9bbed5118e9dbf0f7315d62d1c7ec700c47bb78c1b6b21a19045b26eb1be6a366eb45748ab2fbc946e79c6a376d26549c2c8530ff8ee468dde7dd5730a1d4cd04dc62939bbdba9ba4650ac9526e8be5ee304a1fad5f06a2d519a63ef8ce29a86ee22c089c2b843242ef6a51e03aa9cf2d0a483c061ba9be96a4d8fe51550ba645bd62826a2f9a73a3ae14ba99586ef5562e9c72fefd3f752f7da3f046f6977fa0a5980e4a91587b086019b09e6ad3b3ee593e990fd5a9e34d7972cf0b7d9022b8b5196d5ac3a017da67dd1cf3ed67c7d2d281f9f25cfadf2b89b5ad6b4725a88f54ce029ac71e019a5e647b0acfded93fa9be8d3c48d283b57ccf8d5662979132e28785f0191ed756055f7960e44e3d35e8c15056dd488f46dba03a161250564f0bdc3eb9e153c9057a297271aeca93a072a1b3f6d9b1e6321f5f59c66fb26dcf3197533d928b155fdf5035634828aba3cbb28517711c20ad9f8abcc5167ccad925f4de817513830dc8e379d58629320f991ea7a90c2fb3e7bce5121ce64774fbe32a8b6e37ec3293d4648de53696413e680a2ae0810dd6db22469852dfd09072166b39a460a6445c0dd586cdecf1c20c8ae5bbef7dd1b588d40ccd2017f6bb4e3bbdda26a7e3a59ff453e350a44bcb4cdd572eacea8fa6484bb8d6612aebf3c6f47d29be463542f5d9eaec2771bf64e6370740e0d8de75b1357f8721671af537d5d4040cb084eb4e2cc34d2466a0115af84e1b0042895983a1d06b89fb4ce6ea0486f3f3b823520ab82011a1d4b277227f8611560b1e7933fdcbb3a792b344525bda08839e151ce794b2f32c9b7a01fbac9e01cc87ebcc7d1f6cf0111c3a1e8aac71a908749d44fbd9ad0dadecbd50ada380339c32ac69136678df9317ce0b12b4ff79e59b743f5bb3af2d519ff27d9459cbf97222c15e6fc2a0f91fc719b941525fae59361ceb69cebc2a8645912baa8d1b6c1075ee3056a0c10d25065cb03a442e0ec6e0e1698db3b4c98a0be3278e9649f1f9532e0d392dfd3a0342b8971f21e1b0a74414ba3348cc5be7120c37632d8df359f8d9b992f2ee60b6f470fe3f11de54cda541edad891ce6279cfcd3e7e6f1618b166fd2c1d05848fd2c5f6fb2299f523f357a632762393a8353156cccd02acf081625a75ebb56e16369788d273ccde96629281b949d04c50901b71c65614e6c6c7bd327a140a45e1d006c3f27b9ac9aa53fd62a80f00bb25bfe235bdd2f671126905b2040222b6cbcf7ccd769c2b53113ec01640e3d338abbd602547adf0ba38209cf746ce7677afa1c52075606085cbfe4e8ae88dd87aaaf9b04cf9aa7e1948c25c02fb8a8c01c36ae4d6ebe1f990d4f869a65cdea03f09252dc208e69fb74e6132ce77e25b578fdfe33ac372e6';
+const INIT = new Uint32Array(1042);
+for (let i = 0; i < 1042; i++) {
+    INIT[i] = parseInt(INIT_HEX.slice(i * 8, i * 8 + 8), 16) >>> 0;
+}
+const IV0 = 0x00010203 | 0;
+const IV1 = 0x04050607 | 0;
+class Blowfish {
+    constructor(key) {
+        /** flat key: P at [0..17], S0 at [18..], S1 at [274..], S2 at [530..], S3 at [786..] */
+        this.k = new Uint32Array(1042);
+        const k = this.k;
+        k.set(INIT);
+        let j = 0;
+        for (let i = 0; i < 18; i++) {
+            let d = 0;
+            for (let n = 0; n < 4; n++) {
+                d = ((d << 8) | key[j % key.length]) >>> 0;
+                j++;
+            }
+            k[i] = (k[i] ^ d) >>> 0;
+        }
+        let l = 0;
+        let r = 0;
+        for (let i = 0; i < 18; i += 2) {
+            [l, r] = this.encBlock(l, r);
+            k[i] = l >>> 0;
+            k[i + 1] = r >>> 0;
+        }
+        for (let s = 0; s < 4; s++) {
+            const base = 18 + s * 256;
+            for (let i = 0; i < 256; i += 2) {
+                [l, r] = this.encBlock(l, r);
+                k[base + i] = l >>> 0;
+                k[base + i + 1] = r >>> 0;
+            }
+        }
+    }
+    f(x) {
+        const k = this.k;
+        const a = (k[18 + ((x >>> 24) & 0xff)] + k[274 + ((x >>> 16) & 0xff)]) | 0;
+        return (((a ^ k[530 + ((x >>> 8) & 0xff)]) | 0) + k[786 + (x & 0xff)]) | 0;
+    }
+    encBlock(l, r) {
+        const k = this.k;
+        for (let i = 0; i < 16; i++) {
+            l = (l ^ k[i]) | 0;
+            r = (r ^ this.f(l)) | 0;
+            const t = l;
+            l = r;
+            r = t;
+        }
+        const t = l;
+        l = r;
+        r = t;
+        r = (r ^ k[16]) | 0;
+        l = (l ^ k[17]) | 0;
+        return [l >>> 0, r >>> 0];
+    }
+    /**
+     * Decrypt `src[off .. off+len)` in CBC mode with the fixed Deezer IV and no
+     * padding, writing into `out` at the same offset. `len` must be a multiple of 8.
+     */
+    decryptCbc(src, off, len, out) {
+        const k = this.k;
+        let pl = IV0;
+        let pr = IV1;
+        const end = off + len;
+        for (let p = off; p < end; p += 8) {
+            const cl = (src[p] << 24) | (src[p + 1] << 16) | (src[p + 2] << 8) | src[p + 3] | 0;
+            const cr = (src[p + 4] << 24) | (src[p + 5] << 16) | (src[p + 6] << 8) | src[p + 7] | 0;
+            let L = cl;
+            let R = cr;
+            for (let i = 17; i > 1; i -= 2) {
+                L = (L ^ k[i]) | 0;
+                R = (R ^ this.f(L)) | 0;
+                R = (R ^ k[i - 1]) | 0;
+                L = (L ^ this.f(R)) | 0;
+            }
+            const left = ((R ^ k[0]) >>> 0) ^ (pl >>> 0);
+            const right = ((L ^ k[1]) >>> 0) ^ (pr >>> 0);
+            out[p] = (left >>> 24) & 0xff;
+            out[p + 1] = (left >>> 16) & 0xff;
+            out[p + 2] = (left >>> 8) & 0xff;
+            out[p + 3] = left & 0xff;
+            out[p + 4] = (right >>> 24) & 0xff;
+            out[p + 5] = (right >>> 16) & 0xff;
+            out[p + 6] = (right >>> 8) & 0xff;
+            out[p + 7] = right & 0xff;
+            pl = cl;
+            pr = cr;
+        }
+    }
+}
+exports.Blowfish = Blowfish;

package/dist/lib/decrypt.d.ts

@@ -2,8 +2,26 @@
 import type { trackType } from '../types';
 export declare const getSongFileName: ({ MD5_ORIGIN, SNG_ID, MEDIA_VERSION }: trackType, quality: number) => string;
 /**
+ * Decrypt a downloaded track. Deezer applies Blowfish-CBC "stripe" obfuscation:
+ * the file is split into 2048-byte chunks and only every third chunk (0, 3, 6…)
+ * is encrypted; the rest — and any trailing partial chunk — are plaintext.
  *
- * @param source Downloaded song from `getTrackDownloadUrl`
- * @param trackId Song ID as string
+ * @param source Downloaded body from `getTrackDownloadUrl`
+ * @param trackId `SNG_ID` as a string
  */
 export declare const decryptDownload: (source: Buffer, trackId: string) => Buffer;
+/**
+ * Streaming variant: feed it socket chunks in order via `write()`, then call
+ * `final()`. Decrypts each 2048-byte stripe as it completes — constant memory,
+ * and the CPU work hides behind the (slower) network read.
+ */
+export declare class TrackDecryptStream {
+    private readonly bf;
+    private carry;
+    private chunkIndex;
+    constructor(trackId: string);
+    /** Returns the decrypted bytes for every complete 2048-byte stripe now available. */
+    write(part: Buffer): Buffer;
+    /** The trailing partial chunk (always plaintext). */
+    final(): Buffer;
+}

package/dist/lib/decrypt.js

@@ -3,8 +3,9 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.decryptDownload = exports.getSongFileName = void 0;
+exports.TrackDecryptStream = exports.decryptDownload = exports.getSongFileName = void 0;
 const crypto_1 = __importDefault(require("crypto"));
+const blowfish_1 = require("./blowfish");
 const md5 = (data, type = 'ascii') => {
     const md5sum = crypto_1.default.createHash('md5');
     md5sum.update(data.toString(), type);
@@ -21,43 +22,81 @@ const getSongFileName = ({ MD5_ORIGIN, SNG_ID, MEDIA_VERSION }, quality) => {
     return crypto_1.default.createCipheriv('aes-128-ecb', 'jo6aey6haid2Teih', '').update(step2, 'ascii', 'hex');
 };
 exports.getSongFileName = getSongFileName;
+const BLOWFISH_SECRET = 'g4el58wc0zvf9na1';
+/** Per-track Blowfish key: md5(id)[i] ^ md5(id)[i+16] ^ SECRET[i], for i in 0..15. */
 const getBlowfishKey = (trackId) => {
-    const SECRET = 'g4el58wc' + '0zvf9na1';
     const idMd5 = md5(trackId);
-    let bfKey = '';
+    const key = Buffer.allocUnsafe(16);
     for (let i = 0; i < 16; i++) {
-        bfKey += String.fromCharCode(idMd5.charCodeAt(i) ^ idMd5.charCodeAt(i + 16) ^ SECRET.charCodeAt(i));
+        key[i] = idMd5.charCodeAt(i) ^ idMd5.charCodeAt(i + 16) ^ BLOWFISH_SECRET.charCodeAt(i);
     }
-    return bfKey;
-};
-const decryptChunk = (chunk, blowFishKey) => {
-    const cipher = crypto_1.default.createDecipheriv('bf-cbc', blowFishKey, Buffer.from([0, 1, 2, 3, 4, 5, 6, 7]));
-    cipher.setAutoPadding(false);
-    return Buffer.concat([cipher.update(chunk), cipher.final()]);
+    return key;
 };
+const CHUNK = 2048;
 /**
+ * Decrypt a downloaded track. Deezer applies Blowfish-CBC "stripe" obfuscation:
+ * the file is split into 2048-byte chunks and only every third chunk (0, 3, 6…)
+ * is encrypted; the rest — and any trailing partial chunk — are plaintext.
  *
- * @param source Downloaded song from `getTrackDownloadUrl`
- * @param trackId Song ID as string
+ * @param source Downloaded body from `getTrackDownloadUrl`
+ * @param trackId `SNG_ID` as a string
  */
 const decryptDownload = (source, trackId) => {
-    const chunkSize = 2048;
-    const blowFishKey = getBlowfishKey(trackId);
-    let chunkIndex = 0;
+    const bf = new blowfish_1.Blowfish(getBlowfishKey(trackId));
+    const dest = Buffer.allocUnsafe(source.length);
     let position = 0;
-    const destBuffer = Buffer.alloc(source.length);
+    let chunkIndex = 0;
     while (position < source.length) {
-        const currentChunkSize = Math.min(chunkSize, source.length - position);
-        const sourceChunk = source.subarray(position, position + currentChunkSize);
-        if (chunkIndex % 3 > 0 || currentChunkSize < chunkSize) {
-            sourceChunk.copy(destBuffer, position);
+        const size = Math.min(CHUNK, source.length - position);
+        if (chunkIndex % 3 === 0 && size === CHUNK) {
+            bf.decryptCbc(source, position, CHUNK, dest);
         }
         else {
-            decryptChunk(sourceChunk, blowFishKey).copy(destBuffer, position);
+            source.copy(dest, position, position, position + size);
         }
-        position += currentChunkSize;
+        position += size;
         chunkIndex++;
     }
-    return destBuffer;
+    return dest;
 };
 exports.decryptDownload = decryptDownload;
+/**
+ * Streaming variant: feed it socket chunks in order via `write()`, then call
+ * `final()`. Decrypts each 2048-byte stripe as it completes — constant memory,
+ * and the CPU work hides behind the (slower) network read.
+ */
+class TrackDecryptStream {
+    constructor(trackId) {
+        this.carry = Buffer.alloc(0);
+        this.chunkIndex = 0;
+        this.bf = new blowfish_1.Blowfish(getBlowfishKey(trackId));
+    }
+    /** Returns the decrypted bytes for every complete 2048-byte stripe now available. */
+    write(part) {
+        const data = this.carry.length ? Buffer.concat([this.carry, part]) : part;
+        const complete = data.length - (data.length % CHUNK);
+        if (complete === 0) {
+            this.carry = data;
+            return Buffer.alloc(0);
+        }
+        const out = Buffer.allocUnsafe(complete);
+        for (let off = 0; off < complete; off += CHUNK) {
+            if (this.chunkIndex % 3 === 0) {
+                this.bf.decryptCbc(data, off, CHUNK, out);
+            }
+            else {
+                data.copy(out, off, off, off + CHUNK);
+            }
+            this.chunkIndex++;
+        }
+        this.carry = data.subarray(complete);
+        return out;
+    }
+    /** The trailing partial chunk (always plaintext). */
+    final() {
+        const rest = this.carry;
+        this.carry = Buffer.alloc(0);
+        return rest;
+    }
+}
+exports.TrackDecryptStream = TrackDecryptStream;

package/dist/lib/fast-lru.d.ts

@@ -1,63 +1,21 @@
-/**
- * Fast LRU & TTL cache
- * @param  {Integer} options.max		- Max entries in the cache. @default Infinity
- * @param  {Integer} options.ttl		- Timeout before removing entries. @default Infinity
- */
 declare class FastLRU {
-    _max: number;
-    _ttl: number;
-    _cache: Map<any, any>;
-    _meta: {
-        [key: string]: any;
-    };
-    constructor({ maxSize, ttl }: {
-        maxSize?: number | undefined;
-        ttl?: number | undefined;
+    private readonly max;
+    private readonly ttl;
+    private readonly map;
+    constructor({ maxSize, ttl }?: {
+        maxSize?: number;
+        ttl?: number;
     });
-    /**
-     * Add new entry
-     */
-    set(key: string, value: any, ttl?: number): void;
-    /**
-     * Get entry
-     */
     get(key: string): any;
-    /**
-     * Get without hitting hits
-     */
     peek(key: string): any;
-    /**
-     * Remove entry
-     */
+    set(key: string, value: any, ttl?: number): void;
     delete(key: string): void;
-    /**
-     * Remove all entries
-     */
     clear(): void;
-    /**
-     * Check has entry
-     */
     has(key: string): boolean;
-    /**
-     * Get all kies
-     * @returns {Iterator} Iterator on all kies
-     */
-    keys(): IterableIterator<any>;
-    /**
-     * Iterate over values
-     */
-    values(): IterableIterator<any>;
-    /**
-     * Iterate over entries
-     */
-    entries(): IterableIterator<[any, any]>;
-    /**
-     * For each
-     */
-    forEach(cb: any): void;
-    /**
-     * Entries total size
-     */
+    keys(): IterableIterator<string>;
+    values(): IterableIterator<unknown>;
+    entries(): IterableIterator<[string, unknown]>;
+    forEach(cb: (value: unknown, key: string) => void): void;
     get size(): number;
 }
 export default FastLRU;

package/dist/lib/fast-lru.js

@@ -1,121 +1,75 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Fast LRU & TTL cache
- * @param  {Integer} options.max		- Max entries in the cache. @default Infinity
- * @param  {Integer} options.ttl		- Timeout before removing entries. @default Infinity
- */
 class FastLRU {
-    constructor({ maxSize = Infinity, ttl = 0 }) {
-        // Default options
-        this._max = maxSize;
-        this._ttl = ttl;
-        this._cache = new Map();
-        // Metadata for entries
-        this._meta = {};
+    constructor({ maxSize = Infinity, ttl = 0 } = {}) {
+        this.map = new Map();
+        this.max = maxSize;
+        this.ttl = ttl;
     }
-    /**
-     * Add new entry
-     */
-    set(key, value, ttl = this._ttl) {
-        // Execution time
-        const time = Date.now();
-        // Remvove least recently used elements if exceeds max bytes
-        if (this._cache.size >= this._max) {
-            const items = Object.values(this._meta);
-            if (this._ttl > 0) {
-                for (const item of items) {
-                    if (item.expire < time) {
-                        this.delete(item.key);
-                    }
-                }
-            }
-            if (this._cache.size >= this._max) {
-                const least = items.sort((a, b) => a.hits - b.hits)[0];
-                this.delete(least.key);
-            }
+    get(key) {
+        const e = this.map.get(key);
+        if (e === undefined)
+            return undefined;
+        if (e.expire !== 0 && e.expire < Date.now()) {
+            this.map.delete(key);
+            return undefined;
         }
-        // Override if key already set
-        this._cache.set(key, value);
-        this._meta[key] = {
-            key,
-            hits: 0,
-            expire: time + ttl,
-        };
+        // bump to most-recently-used
+        this.map.delete(key);
+        this.map.set(key, e);
+        return e.value;
     }
-    /**
-     * Get entry
-     */
-    get(key) {
-        if (this._cache.has(key)) {
-            const item = this._cache.get(key);
-            if (this._ttl > 0) {
-                const time = Date.now();
-                if (this._meta[key].expire < time) {
-                    this.delete(key);
-                    return undefined;
+    peek(key) {
+        var _a;
+        return (_a = this.map.get(key)) === null || _a === void 0 ? void 0 : _a.value;
+    }
+    set(key, value, ttl = this.ttl) {
+        this.map.delete(key);
+        if (this.map.size >= this.max) {
+            // drop expired first, then the LRU head if still over
+            if (this.ttl > 0) {
+                const now = Date.now();
+                for (const [k, e] of this.map) {
+                    if (e.expire !== 0 && e.expire < now)
+                        this.map.delete(k);
                 }
             }
-            this._meta[key].hits++;
-            return item;
+            while (this.map.size >= this.max) {
+                const oldest = this.map.keys().next().value;
+                if (oldest === undefined)
+                    break;
+                this.map.delete(oldest);
+            }
         }
+        this.map.set(key, { value, expire: ttl > 0 ? Date.now() + ttl : 0 });
     }
-    /**
-     * Get without hitting hits
-     */
-    peek(key) {
-        return this._cache.get(key);
-    }
-    /**
-     * Remove entry
-     */
     delete(key) {
-        delete this._meta[key];
-        this._cache.delete(key);
+        this.map.delete(key);
     }
-    /**
-     * Remove all entries
-     */
     clear() {
-        this._cache.clear();
-        this._meta = {};
+        this.map.clear();
     }
-    /**
-     * Check has entry
-     */
     has(key) {
-        return this._cache.has(key);
+        const e = this.map.get(key);
+        return e !== undefined && (e.expire === 0 || e.expire >= Date.now());
     }
-    /**
-     * Get all kies
-     * @returns {Iterator} Iterator on all kies
-     */
     keys() {
-        return this._cache.keys();
+        return this.map.keys();
     }
-    /**
-     * Iterate over values
-     */
-    values() {
-        return this._cache.values();
+    *values() {
+        for (const e of this.map.values())
+            yield e.value;
     }
-    /**
-     * Iterate over entries
-     */
-    entries() {
-        return this._cache.entries();
+    *entries() {
+        for (const [k, e] of this.map)
+            yield [k, e.value];
     }
-    /**
-     * For each
-     */
     forEach(cb) {
-        return this._cache.forEach(cb);
+        for (const [k, e] of this.map)
+            cb(e.value, k);
     }
-    /**
-     * Entries total size
-     */
     get size() {
-        return this._cache.size;
+        return this.map.size;
     }
 }
 exports.default = FastLRU;

package/dist/lib/get-url.d.ts

@@ -5,6 +5,14 @@ export declare class WrongLicense extends Error {
 export declare class GeoBlocked extends Error {
     constructor(country: string);
 }
+/**
+ * The track's `TRACK_TOKEN` has expired (they last ~1 hour). Re-fetch the track
+ * with `getTrackInfo(SNG_ID)` for a fresh token and retry.
+ */
+export declare class ExpiredTrackToken extends Error {
+    readonly sngId: string;
+    constructor(sngId: string);
+}
 /**
  * @param track Track info json returned from `getTrackInfo`
  * @param quality 1 = 128kbps, 3 = 320kbps and 9 = flac (around 1411kbps)

package/dist/lib/get-url.js

@@ -3,7 +3,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getTrackDownloadUrl = exports.GeoBlocked = exports.WrongLicense = void 0;
+exports.getTrackDownloadUrl = exports.ExpiredTrackToken = exports.GeoBlocked = exports.WrongLicense = void 0;
 const decrypt_1 = require("../lib/decrypt");
 const http_1 = require("../lib/http");
 const request_1 = __importDefault(require("../lib/request"));
@@ -23,6 +23,18 @@ class GeoBlocked extends Error {
     }
 }
 exports.GeoBlocked = GeoBlocked;
+/**
+ * The track's `TRACK_TOKEN` has expired (they last ~1 hour). Re-fetch the track
+ * with `getTrackInfo(SNG_ID)` for a fresh token and retry.
+ */
+class ExpiredTrackToken extends Error {
+    constructor(sngId) {
+        super(`Track token for ${sngId} has expired — re-fetch the track and retry`);
+        this.sngId = sngId;
+        this.name = 'ExpiredTrackToken';
+    }
+}
+exports.ExpiredTrackToken = ExpiredTrackToken;
 let user_data = null;
 const getTrackFileSize = (track, quality) => {
     switch (quality) {
@@ -69,9 +81,14 @@ const getTrackUrlFromServer = async (track_token, format) => {
     });
     if (data.data.length > 0) {
         if (data.data[0].errors) {
-            if (data.data[0].errors[0].code === 2002) {
+            const { code } = data.data[0].errors[0];
+            if (code === 2002) {
                 throw new GeoBlocked(user.country);
             }
+            // 2000: invalid/expired token · 2001: token has no rights on this song
+            if (code === 2000 || code === 2001) {
+                throw new ExpiredTrackToken(track_token);
+            }
             throw new Error(Object.entries(data.data[0].errors[0]).join(', '));
         }
         return data.data[0].media.length > 0 ? data.data[0].media[0].sources[0].url : null;
@@ -85,6 +102,7 @@ const getTrackUrlFromServer = async (track_token, format) => {
 const getTrackDownloadUrl = async (track, quality) => {
     let wrongLicense = null;
     let geoBlocked = null;
+    let expiredToken = null;
     let formatName;
     switch (quality) {
         case 9:
@@ -99,26 +117,37 @@ const getTrackDownloadUrl = async (track, quality) => {
         default:
             throw new Error(`Unknown quality ${quality}`);
     }
-    // Get URL with the official API
-    try {
-        const url = await getTrackUrlFromServer(track.TRACK_TOKEN, formatName);
-        if (url) {
-            return {
-                trackUrl: url,
-                isEncrypted: url.includes('/mobile/') || url.includes('/media/'),
-                fileSize: getTrackFileSize(track, quality),
-            };
-        }
+    // Track tokens last ~1 hour. If it's already stale, skip the doomed media API
+    // call and go straight to the token-free fallback below.
+    const tokenStale = Boolean(track.TRACK_TOKEN_EXPIRE && track.TRACK_TOKEN_EXPIRE * 1000 < Date.now());
+    if (tokenStale) {
+        expiredToken = new ExpiredTrackToken(track.SNG_ID);
     }
-    catch (err) {
-        if (err instanceof WrongLicense) {
-            wrongLicense = err;
-        }
-        else if (err instanceof GeoBlocked) {
-            geoBlocked = err;
+    else {
+        // Get URL with the official API
+        try {
+            const url = await getTrackUrlFromServer(track.TRACK_TOKEN, formatName);
+            if (url) {
+                return {
+                    trackUrl: url,
+                    isEncrypted: url.includes('/mobile/') || url.includes('/media/'),
+                    fileSize: getTrackFileSize(track, quality),
+                };
+            }
         }
-        else {
-            throw err;
+        catch (err) {
+            if (err instanceof WrongLicense) {
+                wrongLicense = err;
+            }
+            else if (err instanceof GeoBlocked) {
+                geoBlocked = err;
+            }
+            else if (err instanceof ExpiredTrackToken) {
+                expiredToken = err;
+            }
+            else {
+                throw err;
+            }
         }
     }
     // Fallback to the old method
@@ -140,6 +169,9 @@ const getTrackDownloadUrl = async (track, quality) => {
     if (geoBlocked) {
         throw geoBlocked;
     }
+    if (expiredToken) {
+        throw expiredToken;
+    }
     return null;
 };
 exports.getTrackDownloadUrl = getTrackDownloadUrl;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gerdur-core",
-  "version": "1.0.1",
+  "version": "1.0.2",
   "description": "Core module for gerdur.",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",