@bigdreamsweb3/wordbin 1.0.2 → 1.0.4

package/README.md

@@ -6,10 +6,6 @@
 
 Optimized for **Web3, blockchain, QR codes, IoT, URLs, and other space-sensitive applications**, WordBin ensures short sequences of words can be stored efficiently and recovered reliably.
 
-**npm description (for publishing):**
-
-> Deterministic word-to-binary encoder: compress short phrases for blockchain, Web3, IoT, QR codes, or space-sensitive storage.
-
 ---
 
 ## Why WordBin

package/dist/core.d.ts

@@ -7,10 +7,13 @@ export declare class WordBin {
     private log;
     static createFromWords(words: string[]): Promise<WordBin>;
     static createFromJson(dictJson: WordBinDictionary): Promise<WordBin>;
-    static create(): Promise<WordBin>;
+    static create(options?: {
+        debug?: boolean;
+    }): Promise<WordBin>;
     private getReverseMapForVersion;
     encode(text: string | EncodeResult | Uint8Array, options?: {
         dictVersion?: number;
     }): Promise<EncodeResult>;
     decode(data: Uint8Array | string): Promise<string>;
+    private tryDecode;
 }

package/dist/index.mjs

@@ -96,9 +96,9 @@ class WordBin {
   static async createFromJson(dictJson) {
     return new WordBin(dictJson);
   }
-  static async create() {
+  static async create(options) {
     const latestDict = await loadLatestDictionary();
-    return new WordBin(latestDict);
+    return new WordBin(latestDict, options);
   }
   async getReverseMapForVersion(version) {
     const dict = await loadDictionaryByVersion(version);
@@ -143,6 +143,7 @@ class WordBin {
       const id = await generateWordId(w);
       const key = toHex(id);
       this.log(`  "${w}" → ID bytes: [${[...id].join(", ")}] | hex: ${key}`);
+      console.log(`  "${w}" → ID bytes: [${[...id].join(", ")}] | hex: ${key}`);
       if (reverseMap.has(key)) {
         reverseMap.get(key);
         this.log(`    → Found in dictionary → using ${id.length}-byte ID`);
@@ -194,53 +195,125 @@ class WordBin {
   async decode(data) {
     let buffer;
     if (typeof data === "string") {
+      this.log(
+        `[decode] Input is base64 string: "${data.substring(0, 20)}..."`
+      );
       buffer = fromBase64(data);
+      this.log(`[decode] Decoded to ${buffer.length} bytes`);
     } else {
       buffer = data;
+      this.log(`[decode] Input is Uint8Array with ${buffer.length} bytes`);
     }
+    this.log(`[decode] Full buffer hex: ${toHex(buffer)}`);
+    this.log(
+      `[decode] First 16 bytes: [${[...buffer.subarray(0, Math.min(16, buffer.length))].join(", ")}]`
+    );
     if (buffer.length < 3) {
       throw new Error("Data too short");
     }
+    const magicReceived = [buffer[0], buffer[1]];
+    this.log(
+      `[decode] Magic bytes: expected [${MAGIC[0]}, ${MAGIC[1]}], got [${magicReceived.join(", ")}]`
+    );
     if (buffer[0] !== MAGIC[0] || buffer[1] !== MAGIC[1]) {
       throw new Error("Invalid magic bytes");
     }
     const version = buffer[2];
-    let pos = 3;
+    this.log(`[decode] Dictionary version from header: ${version}`);
+    const pos = 3;
+    this.log(`[decode] Starting decode at position ${pos}`);
     const reverseMap = await this.getReverseMapForVersion(version);
+    this.log(
+      `[decode] Reverse map loaded for v${version} — size: ${reverseMap.size} entries`
+    );
+    this.log(`[decode] ===== STARTING DECODE LOOP =====`);
     const result = [];
-    while (pos < buffer.length) {
-      let matched = false;
-      if (buffer[pos] === LITERAL) {
-        const { value: byteLen, bytesRead } = decodeVarint(buffer, pos + 1);
-        const start = pos + 1 + bytesRead;
-        const end = start + byteLen;
-        if (end > buffer.length) {
-          throw new Error("Truncated literal block");
-        }
-        const word = utf8Decode(buffer.subarray(start, end));
-        result.push(word);
-        pos = end;
-        matched = true;
+    const decoded = this.tryDecode(pos, buffer, reverseMap, result, 0);
+    if (decoded === null) {
+      throw new Error(
+        "No valid decode path found — possible corruption or dictionary mismatch"
+      );
+    }
+    this.log(`
+[decode] ===== DECODE COMPLETE =====`);
+    this.log(`[decode] Total words decoded: ${result.length}`);
+    this.log(`[decode] Final result: "${decoded}"`);
+    return decoded;
+  }
+  tryDecode(pos, buffer, reverseMap, result, depth) {
+    const indent = "  ".repeat(depth);
+    this.log(`${indent}[tryDecode] At position ${pos} (depth ${depth})`);
+    if (pos === buffer.length) {
+      this.log(`${indent}[tryDecode] Reached end successfully`);
+      return result.join(" ");
+    }
+    const previewLen = Math.min(8, buffer.length - pos);
+    const preview = [...buffer.subarray(pos, pos + previewLen)].map((b) => `0x${b.toString(16).padStart(2, "0")}`).join(" ");
+    this.log(`${indent}[tryDecode] Next ${previewLen} bytes: ${preview}`);
+    if (buffer[pos] === LITERAL) {
+      this.log(
+        `${indent}[tryDecode] Found LITERAL marker (0x${LITERAL.toString(16)})`
+      );
+      const { value: byteLen, bytesRead } = decodeVarint(buffer, pos + 1);
+      this.log(
+        `${indent}[tryDecode] Varint: value=${byteLen}, bytesRead=${bytesRead}`
+      );
+      const start = pos + 1 + bytesRead;
+      const end = start + byteLen;
+      this.log(
+        `${indent}[tryDecode] Literal range: [${start}..${end}) (${byteLen} bytes)`
+      );
+      if (end > buffer.length) {
+        this.log(`${indent}[tryDecode] Truncated literal — failing path`);
+        return null;
       }
-      if (!matched) {
-        for (const len of [4, 3, 2]) {
-          if (pos + len > buffer.length) continue;
-          const slice = buffer.subarray(pos, pos + len);
-          const key = toHex(slice);
-          if (reverseMap.has(key)) {
-            result.push(reverseMap.get(key));
-            pos += len;
-            matched = true;
-            break;
-          }
-        }
+      const literalBytes = buffer.subarray(start, end);
+      const word = utf8Decode(literalBytes);
+      this.log(`${indent}[tryDecode] Decoded literal: "${word}"`);
+      result.push(word);
+      const res = this.tryDecode(end, buffer, reverseMap, result, depth + 1);
+      if (res !== null) {
+        return res;
+      }
+      result.pop();
+      this.log(`${indent}[tryDecode] Backtracking from literal`);
+      return null;
+    }
+    for (const len of [4, 3, 2]) {
+      if (pos + len > buffer.length) {
+        this.log(
+          `${indent}[tryDecode] Skipping ${len}-byte (would exceed: need ${pos + len}, have ${buffer.length})`
+        );
+        continue;
       }
-      if (!matched) {
-        result.push(`[??:${buffer[pos].toString(16).padStart(2, "0")}]`);
-        pos += 1;
+      const slice = buffer.subarray(pos, pos + len);
+      const key = toHex(slice);
+      const keyBytes = [...slice].map((b) => `0x${b.toString(16).padStart(2, "0")}`).join(" ");
+      this.log(
+        `${indent}[tryDecode] Trying ${len}-byte: [${keyBytes}] hex=${key}`
+      );
+      if (reverseMap.has(key)) {
+        const word = reverseMap.get(key);
+        this.log(`${indent}[tryDecode] Match: "${word}" (ID: ${key})`);
+        result.push(word);
+        const res = this.tryDecode(
+          pos + len,
+          buffer,
+          reverseMap,
+          result,
+          depth + 1
+        );
+        if (res !== null) {
+          return res;
+        }
+        result.pop();
+        this.log(`${indent}[tryDecode] Backtracking from "${word}"`);
+      } else {
+        this.log(`${indent}[tryDecode] No match for ${key}`);
       }
     }
-    return result.join(" ");
+    this.log(`${indent}[tryDecode] No valid branches — failing path`);
+    return null;
   }
 }
 export {

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":["../src/constants.ts","../src/dictionary-loader.ts","../src/core.ts"],"sourcesContent":["// wordbin\\src\\constants.ts\r\nexport const MAGIC = new Uint8Array([87, 66]) // 'W''B'\r\nexport const LITERAL = 0xff\r\n","import fs from \"fs/promises\";\r\nimport path from \"path\";\r\nimport { fileURLToPath } from \"url\";\r\nimport type { WordBinDictionary } from \"./types.js\";\r\n\r\nconst __filename = fileURLToPath(import.meta.url);\r\nconst __dirname = path.dirname(__filename);\r\n\r\n// 1️⃣ Bundled dictionaries inside the package (dist/data)\r\nconst PACKAGE_DATA_DIR = path.join(__dirname, \"data\");\r\n\r\n// 2️⃣ User project dictionaries (built via CLI)\r\nconst LOCAL_DATA_DIR = path.join(process.cwd(), \"data\");\r\n\r\n/**\r\n * Get all dictionary directories that exist\r\n * Priority: LOCAL first, then PACKAGE fallback\r\n */\r\nasync function getExistingDataDirs(): Promise<string[]> {\r\n  const dirs: string[] = [];\r\n\r\n  try {\r\n    await fs.access(LOCAL_DATA_DIR);\r\n    dirs.push(LOCAL_DATA_DIR);\r\n  } catch {}\r\n\r\n  try {\r\n    await fs.access(PACKAGE_DATA_DIR);\r\n    dirs.push(PACKAGE_DATA_DIR);\r\n  } catch {}\r\n\r\n  return dirs;\r\n}\r\n\r\n/**\r\n * Scan all available dictionary versions from all data dirs\r\n */\r\nexport async function getAllAvailableDictionaryVersions(): Promise<number[]> {\r\n  const dirs = await getExistingDataDirs();\r\n  const versions = new Set<number>();\r\n\r\n  for (const dir of dirs) {\r\n    try {\r\n      const files = await fs.readdir(dir);\r\n\r\n      for (const file of files) {\r\n        const match = file.match(/wordbin-v(\\d+)/i);\r\n        if (match) {\r\n          versions.add(parseInt(match[1], 10));\r\n        }\r\n      }\r\n    } catch {\r\n      // Ignore invalid dirs silently\r\n    }\r\n  }\r\n\r\n  return Array.from(versions).sort((a, b) => a - b);\r\n}\r\n\r\n/**\r\n * Load a specific dictionary version\r\n * LOCAL dictionaries override PACKAGE ones\r\n */\r\nexport async function loadDictionaryByVersion(\r\n  version: number,\r\n): Promise<WordBinDictionary> {\r\n  const dirs = await getExistingDataDirs();\r\n\r\n  if (dirs.length === 0) {\r\n    throw new Error(\r\n      `No dictionary directories found. Expected ./data or bundled package data.`,\r\n    );\r\n  }\r\n\r\n  for (const dir of dirs) {\r\n    const files = await fs.readdir(dir);\r\n\r\n    const versionFile = files.find((f) =>\r\n      f.match(new RegExp(`wordbin-v${version}(?:\\\\.|-)`, \"i\")),\r\n    );\r\n\r\n    if (versionFile) {\r\n      const filePath = path.join(dir, versionFile);\r\n      const data = await fs.readFile(filePath, \"utf-8\");\r\n      const dict = JSON.parse(data) as WordBinDictionary;\r\n\r\n      if (dict.version !== version) {\r\n        throw new Error(\r\n          `Version mismatch: file ${versionFile} claims v${dict.version} but expected v${version}`,\r\n        );\r\n      }\r\n\r\n      return dict;\r\n    }\r\n  }\r\n\r\n  const available = await getAllAvailableDictionaryVersions();\r\n\r\n  throw new Error(\r\n    `Dictionary version ${version} not found. Available versions: ${available.join(\", \")}`,\r\n  );\r\n}\r\n\r\n/**\r\n * Load the latest available dictionary version\r\n */\r\nexport async function loadLatestDictionary(): Promise<WordBinDictionary> {\r\n  const versions = await getAllAvailableDictionaryVersions();\r\n\r\n  if (versions.length === 0) {\r\n    throw new Error(\r\n      `No dictionary files found. Run \"npx wordbin build\" or use bundled v1.`,\r\n    );\r\n  }\r\n\r\n  const latestVersion = Math.max(...versions);\r\n\r\n  console.log(\r\n    `Loading latest dictionary: v${latestVersion} (available: ${versions.join(\", \")})`,\r\n  );\r\n\r\n  return loadDictionaryByVersion(latestVersion);\r\n}\r\n\r\n/**\r\n * Check if a specific version exists\r\n */\r\nexport async function hasDictionaryVersion(version: number): Promise<boolean> {\r\n  const versions = await getAllAvailableDictionaryVersions();\r\n  return versions.includes(version);\r\n}\r\n","import { MAGIC, LITERAL } from \"./constants.js\";\r\nimport { generateWordId } from \"./core/id.js\";\r\nimport {\r\n  toHex,\r\n  toBase64,\r\n  fromBase64,\r\n  encodeVarint,\r\n  decodeVarint,\r\n  utf8Encode,\r\n  utf8Decode,\r\n} from \"./utils/buffer.js\";\r\nimport type { EncodeResult, WordBinDictionary } from \"./types\";\r\nimport { buildDictionary } from \"./dictionary.js\";\r\nimport {\r\n  loadDictionaryByVersion,\r\n  loadLatestDictionary,\r\n} from \"./dictionary-loader.js\";\r\n\r\nexport class WordBin {\r\n  private primaryDictVersion: number;\r\n  // private debug: boolean;\r\n\r\n  constructor(initialDict?: WordBinDictionary, options?: { debug?: boolean }) {\r\n    this.primaryDictVersion = initialDict?.version ?? 2;\r\n    this.log = options?.debug\r\n      ? (...args) => console.log(\"[WordBin]\", ...args)\r\n      : () => {};\r\n  }\r\n\r\n  private log: (...args: any[]) => void;\r\n\r\n  static async createFromWords(words: string[]): Promise<WordBin> {\r\n    console.warn(\"Building dictionary from scratch – consider pre-built files\");\r\n    const dict = await buildDictionary(words);\r\n    return new WordBin(dict);\r\n  }\r\n\r\n  static async createFromJson(dictJson: WordBinDictionary): Promise<WordBin> {\r\n    return new WordBin(dictJson);\r\n  }\r\n\r\n  static async create(): Promise<WordBin> {\r\n    const latestDict = await loadLatestDictionary();\r\n    return new WordBin(latestDict);\r\n  }\r\n\r\n  private async getReverseMapForVersion(\r\n    version: number,\r\n  ): Promise<Map<string, string>> {\r\n    const dict = await loadDictionaryByVersion(version);\r\n    const reverseMap = new Map<string, string>();\r\n    for (const [hex, words] of Object.entries(dict.words)) {\r\n      if (words.length > 0) reverseMap.set(hex, words[0]);\r\n    }\r\n    return reverseMap;\r\n  }\r\n\r\n  async encode(\r\n    text: string | EncodeResult | Uint8Array,\r\n    options: { dictVersion?: number } = {},\r\n  ): Promise<EncodeResult> {\r\n    let textStr: string;\r\n    if (typeof text === \"string\") textStr = text;\r\n    else if (text instanceof Uint8Array) textStr = toBase64(text);\r\n    else textStr = text.encodedBase64;\r\n\r\n    if (!textStr.trim()) {\r\n      return {\r\n        originalText: \"\",\r\n        encoded: new Uint8Array(0),\r\n        payload: \"\",\r\n        encodedBase64: \"\",\r\n        originalBytes: 0,\r\n        encodedBytes: 0,\r\n        bytesSaved: 0,\r\n        ratioPercent: 100,\r\n      };\r\n    }\r\n\r\n    const words = textStr.split(/\\s+/).filter(Boolean);\r\n    this.log(`[encode] Input words (${words.length}):`, words);\r\n\r\n    const useVersion = options.dictVersion ?? this.primaryDictVersion;\r\n    this.log(`[encode] Using dictionary version: ${useVersion}`);\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Header creation\r\n    // ──────────────────────────────────────────────\r\n    const header = new Uint8Array([MAGIC[0], MAGIC[1], useVersion]);\r\n    this.log(`[encode] Header bytes: [${[...header].join(\", \")}]`);\r\n    this.log(`[encode] Header hex: ${toHex(header)}`);\r\n    this.log(\r\n      `[encode] Header as text (non-printable chars expected): \"${new TextDecoder().decode(header)}\"`,\r\n    );\r\n\r\n    const chunks: Uint8Array[] = [header];\r\n\r\n    const reverseMap = await this.getReverseMapForVersion(useVersion);\r\n    this.log(`[encode] Reverse map loaded — size: ${reverseMap.size} entries`);\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Process each word → show ID mapping\r\n    // ──────────────────────────────────────────────\r\n    this.log(\"[encode] Word → ID mapping:\");\r\n\r\n    for (const w of words) {\r\n      const id = await generateWordId(w); // Uint8Array (usually 2–4 bytes)\r\n      const key = toHex(id); // hex string for lookup\r\n\r\n      this.log(`  \"${w}\" → ID bytes: [${[...id].join(\", \")}] | hex: ${key}`);\r\n\r\n      if (reverseMap.has(key)) {\r\n        const mappedWord = reverseMap.get(key);\r\n        this.log(`    → Found in dictionary → using ${id.length}-byte ID`);\r\n        chunks.push(id);\r\n      } else {\r\n        const utf8 = utf8Encode(w);\r\n        const lenVarint = encodeVarint(utf8.length);\r\n        this.log(`    → NOT in dictionary → literal mode`);\r\n        this.log(\r\n          `      Literal length varint bytes: [${[...lenVarint].join(\", \")}] (value = ${utf8.length})`,\r\n        );\r\n        this.log(`      Word UTF-8 bytes length: ${utf8.length}`);\r\n\r\n        const out = new Uint8Array(1 + lenVarint.length + utf8.length);\r\n        out[0] = LITERAL;\r\n        out.set(lenVarint, 1);\r\n        out.set(utf8, 1 + lenVarint.length);\r\n\r\n        this.log(`      Literal chunk bytes: [${[...out].join(\", \")}]`);\r\n        chunks.push(out);\r\n      }\r\n    }\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Final assembly\r\n    // ──────────────────────────────────────────────\r\n    const totalLength = chunks.reduce((n, c) => n + c.length, 0);\r\n    const result = new Uint8Array(totalLength);\r\n\r\n    this.log(`[encode] Total encoded length: ${totalLength} bytes`);\r\n\r\n    let off = 0;\r\n    chunks.forEach((chunk, i) => {\r\n      result.set(chunk, off);\r\n      off += chunk.length;\r\n      this.log(\r\n        `  Chunk ${i}: ${chunk.length} bytes → offset ${off - chunk.length}`,\r\n      );\r\n    });\r\n\r\n    this.log(\r\n      `[encode] Final encoded bytes (first 32): [${[...result.subarray(0, Math.min(32, result.length))].join(\", \")}]`,\r\n    );\r\n\r\n    const originalBytes = new TextEncoder().encode(textStr).length;\r\n\r\n    const base64Result = toBase64(result);\r\n    this.log(`[encode] Base64 starts with: ${base64Result.slice(0, 12)}...`);\r\n\r\n    return {\r\n      originalText: textStr,\r\n      encoded: result,\r\n      payload: base64Result,\r\n      encodedBase64: base64Result,\r\n      originalBytes,\r\n      encodedBytes: totalLength,\r\n      bytesSaved: originalBytes - totalLength,\r\n      ratioPercent:\r\n        totalLength === 0\r\n          ? 100\r\n          : Math.round((totalLength / originalBytes) * 100),\r\n    };\r\n  }\r\n\r\n  async decode(data: Uint8Array | string): Promise<string> {\r\n    let buffer: Uint8Array;\r\n    if (typeof data === \"string\") {\r\n      buffer = fromBase64(data);\r\n    } else {\r\n      buffer = data;\r\n    }\r\n\r\n    if (buffer.length < 3) {\r\n      throw new Error(\"Data too short\");\r\n    }\r\n\r\n    if (buffer[0] !== MAGIC[0] || buffer[1] !== MAGIC[1]) {\r\n      throw new Error(\"Invalid magic bytes\");\r\n    }\r\n\r\n    const version = buffer[2];\r\n    let pos = 3; // start right after version byte\r\n\r\n    const reverseMap = await this.getReverseMapForVersion(version);\r\n\r\n    const result: string[] = [];\r\n\r\n    while (pos < buffer.length) {\r\n      let matched = false;\r\n\r\n      // Literal block\r\n      if (buffer[pos] === LITERAL) {\r\n        const { value: byteLen, bytesRead } = decodeVarint(buffer, pos + 1);\r\n        const start = pos + 1 + bytesRead;\r\n        const end = start + byteLen;\r\n\r\n        if (end > buffer.length) {\r\n          throw new Error(\"Truncated literal block\");\r\n        }\r\n\r\n        const word = utf8Decode(buffer.subarray(start, end));\r\n        result.push(word);\r\n        pos = end;\r\n        matched = true;\r\n      }\r\n\r\n      // Known word reference\r\n      if (!matched) {\r\n        for (const len of [4, 3, 2]) {\r\n          if (pos + len > buffer.length) continue;\r\n          const slice = buffer.subarray(pos, pos + len);\r\n          const key = toHex(slice);\r\n\r\n          if (reverseMap.has(key)) {\r\n            result.push(reverseMap.get(key)!);\r\n            pos += len;\r\n            matched = true;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      if (!matched) {\r\n        result.push(`[??:${buffer[pos].toString(16).padStart(2, \"0\")}]`);\r\n        pos += 1;\r\n      }\r\n    }\r\n\r\n    return result.join(\" \");\r\n  }\r\n}\r\n"],"names":["__filename","__dirname"],"mappings":";;;;AACO,MAAM,QAAQ,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;AACrC,MAAM,UAAU;ACGvB,MAAMA,eAAa,cAAc,YAAY,GAAG;AAChD,MAAMC,cAAY,KAAK,QAAQD,YAAU;AAGzC,MAAM,mBAAmB,KAAK,KAAKC,aAAW,MAAM;AAGpD,MAAM,iBAAiB,KAAK,KAAK,QAAQ,IAAA,GAAO,MAAM;AAMtD,eAAe,sBAAyC;AACtD,QAAM,OAAiB,CAAA;AAEvB,MAAI;AACF,UAAM,GAAG,OAAO,cAAc;AAC9B,SAAK,KAAK,cAAc;AAAA,EAC1B,QAAQ;AAAA,EAAC;AAET,MAAI;AACF,UAAM,GAAG,OAAO,gBAAgB;AAChC,SAAK,KAAK,gBAAgB;AAAA,EAC5B,QAAQ;AAAA,EAAC;AAET,SAAO;AACT;AAKA,eAAsB,oCAAuD;AAC3E,QAAM,OAAO,MAAM,oBAAA;AACnB,QAAM,+BAAe,IAAA;AAErB,aAAW,OAAO,MAAM;AACtB,QAAI;AACF,YAAM,QAAQ,MAAM,GAAG,QAAQ,GAAG;AAElC,iBAAW,QAAQ,OAAO;AACxB,cAAM,QAAQ,KAAK,MAAM,iBAAiB;AAC1C,YAAI,OAAO;AACT,mBAAS,IAAI,SAAS,MAAM,CAAC,GAAG,EAAE,CAAC;AAAA,QACrC;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,QAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAClD;AAMA,eAAsB,wBACpB,SAC4B;AAC5B,QAAM,OAAO,MAAM,oBAAA;AAEnB,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAEA,aAAW,OAAO,MAAM;AACtB,UAAM,QAAQ,MAAM,GAAG,QAAQ,GAAG;AAElC,UAAM,cAAc,MAAM;AAAA,MAAK,CAAC,MAC9B,EAAE,MAAM,IAAI,OAAO,YAAY,OAAO,aAAa,GAAG,CAAC;AAAA,IAAA;AAGzD,QAAI,aAAa;AACf,YAAM,WAAW,KAAK,KAAK,KAAK,WAAW;AAC3C,YAAM,OAAO,MAAM,GAAG,SAAS,UAAU,OAAO;AAChD,YAAM,OAAO,KAAK,MAAM,IAAI;AAE5B,UAAI,KAAK,YAAY,SAAS;AAC5B,cAAM,IAAI;AAAA,UACR,0BAA0B,WAAW,YAAY,KAAK,OAAO,kBAAkB,OAAO;AAAA,QAAA;AAAA,MAE1F;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,YAAY,MAAM,kCAAA;AAExB,QAAM,IAAI;AAAA,IACR,sBAAsB,OAAO,mCAAmC,UAAU,KAAK,IAAI,CAAC;AAAA,EAAA;AAExF;AAKA,eAAsB,uBAAmD;AACvE,QAAM,WAAW,MAAM,kCAAA;AAEvB,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAEA,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ;AAE1C,UAAQ;AAAA,IACN,+BAA+B,aAAa,gBAAgB,SAAS,KAAK,IAAI,CAAC;AAAA,EAAA;AAGjF,SAAO,wBAAwB,aAAa;AAC9C;ACxGO,MAAM,QAAQ;AAAA;AAAA,EAInB,YAAY,aAAiC,SAA+B;AAC1E,SAAK,qBAAqB,aAAa,WAAW;AAClD,SAAK,MAAM,SAAS,QAChB,IAAI,SAAS,QAAQ,IAAI,aAAa,GAAG,IAAI,IAC7C,MAAM;AAAA,IAAC;AAAA,EACb;AAAA,EAIA,aAAa,gBAAgB,OAAmC;AAC9D,YAAQ,KAAK,6DAA6D;AAC1E,UAAM,OAAO,MAAM,gBAAgB,KAAK;AACxC,WAAO,IAAI,QAAQ,IAAI;AAAA,EACzB;AAAA,EAEA,aAAa,eAAe,UAA+C;AACzE,WAAO,IAAI,QAAQ,QAAQ;AAAA,EAC7B;AAAA,EAEA,aAAa,SAA2B;AACtC,UAAM,aAAa,MAAM,qBAAA;AACzB,WAAO,IAAI,QAAQ,UAAU;AAAA,EAC/B;AAAA,EAEA,MAAc,wBACZ,SAC8B;AAC9B,UAAM,OAAO,MAAM,wBAAwB,OAAO;AAClD,UAAM,iCAAiB,IAAA;AACvB,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,UAAI,MAAM,SAAS,EAAG,YAAW,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OACJ,MACA,UAAoC,IACb;AACvB,QAAI;AACJ,QAAI,OAAO,SAAS,SAAU,WAAU;AAAA,aAC/B,gBAAgB,WAAY,WAAU,SAAS,IAAI;AAAA,mBAC7C,KAAK;AAEpB,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO;AAAA,QACL,cAAc;AAAA,QACd,SAAS,IAAI,WAAW,CAAC;AAAA,QACzB,SAAS;AAAA,QACT,eAAe;AAAA,QACf,eAAe;AAAA,QACf,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,cAAc;AAAA,MAAA;AAAA,IAElB;AAEA,UAAM,QAAQ,QAAQ,MAAM,KAAK,EAAE,OAAO,OAAO;AACjD,SAAK,IAAI,yBAAyB,MAAM,MAAM,MAAM,KAAK;AAEzD,UAAM,aAAa,QAAQ,eAAe,KAAK;AAC/C,SAAK,IAAI,sCAAsC,UAAU,EAAE;AAK3D,UAAM,SAAS,IAAI,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,UAAU,CAAC;AAC9D,SAAK,IAAI,2BAA2B,CAAC,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG;AAC7D,SAAK,IAAI,wBAAwB,MAAM,MAAM,CAAC,EAAE;AAChD,SAAK;AAAA,MACH,4DAA4D,IAAI,YAAA,EAAc,OAAO,MAAM,CAAC;AAAA,IAAA;AAG9F,UAAM,SAAuB,CAAC,MAAM;AAEpC,UAAM,aAAa,MAAM,KAAK,wBAAwB,UAAU;AAChE,SAAK,IAAI,uCAAuC,WAAW,IAAI,UAAU;AAKzE,SAAK,IAAI,6BAA6B;AAEtC,eAAW,KAAK,OAAO;AACrB,YAAM,KAAK,MAAM,eAAe,CAAC;AACjC,YAAM,MAAM,MAAM,EAAE;AAEpB,WAAK,IAAI,MAAM,CAAC,kBAAkB,CAAC,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,YAAY,GAAG,EAAE;AAErE,UAAI,WAAW,IAAI,GAAG,GAAG;AACJ,mBAAW,IAAI,GAAG;AACrC,aAAK,IAAI,qCAAqC,GAAG,MAAM,UAAU;AACjE,eAAO,KAAK,EAAE;AAAA,MAChB,OAAO;AACL,cAAM,OAAO,WAAW,CAAC;AACzB,cAAM,YAAY,aAAa,KAAK,MAAM;AAC1C,aAAK,IAAI,wCAAwC;AACjD,aAAK;AAAA,UACH,uCAAuC,CAAC,GAAG,SAAS,EAAE,KAAK,IAAI,CAAC,cAAc,KAAK,MAAM;AAAA,QAAA;AAE3F,aAAK,IAAI,kCAAkC,KAAK,MAAM,EAAE;AAExD,cAAM,MAAM,IAAI,WAAW,IAAI,UAAU,SAAS,KAAK,MAAM;AAC7D,YAAI,CAAC,IAAI;AACT,YAAI,IAAI,WAAW,CAAC;AACpB,YAAI,IAAI,MAAM,IAAI,UAAU,MAAM;AAElC,aAAK,IAAI,+BAA+B,CAAC,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG;AAC9D,eAAO,KAAK,GAAG;AAAA,MACjB;AAAA,IACF;AAKA,UAAM,cAAc,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC3D,UAAM,SAAS,IAAI,WAAW,WAAW;AAEzC,SAAK,IAAI,kCAAkC,WAAW,QAAQ;AAE9D,QAAI,MAAM;AACV,WAAO,QAAQ,CAAC,OAAO,MAAM;AAC3B,aAAO,IAAI,OAAO,GAAG;AACrB,aAAO,MAAM;AACb,WAAK;AAAA,QACH,WAAW,CAAC,KAAK,MAAM,MAAM,mBAAmB,MAAM,MAAM,MAAM;AAAA,MAAA;AAAA,IAEtE,CAAC;AAED,SAAK;AAAA,MACH,6CAA6C,CAAC,GAAG,OAAO,SAAS,GAAG,KAAK,IAAI,IAAI,OAAO,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,IAAA;AAG9G,UAAM,gBAAgB,IAAI,YAAA,EAAc,OAAO,OAAO,EAAE;AAExD,UAAM,eAAe,SAAS,MAAM;AACpC,SAAK,IAAI,gCAAgC,aAAa,MAAM,GAAG,EAAE,CAAC,KAAK;AAEvE,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS;AAAA,MACT,SAAS;AAAA,MACT,eAAe;AAAA,MACf;AAAA,MACA,cAAc;AAAA,MACd,YAAY,gBAAgB;AAAA,MAC5B,cACE,gBAAgB,IACZ,MACA,KAAK,MAAO,cAAc,gBAAiB,GAAG;AAAA,IAAA;AAAA,EAExD;AAAA,EAEA,MAAM,OAAO,MAA4C;AACvD,QAAI;AACJ,QAAI,OAAO,SAAS,UAAU;AAC5B,eAAS,WAAW,IAAI;AAAA,IAC1B,OAAO;AACL,eAAS;AAAA,IACX;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,IAAI,MAAM,gBAAgB;AAAA,IAClC;AAEA,QAAI,OAAO,CAAC,MAAM,MAAM,CAAC,KAAK,OAAO,CAAC,MAAM,MAAM,CAAC,GAAG;AACpD,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AAEA,UAAM,UAAU,OAAO,CAAC;AACxB,QAAI,MAAM;AAEV,UAAM,aAAa,MAAM,KAAK,wBAAwB,OAAO;AAE7D,UAAM,SAAmB,CAAA;AAEzB,WAAO,MAAM,OAAO,QAAQ;AAC1B,UAAI,UAAU;AAGd,UAAI,OAAO,GAAG,MAAM,SAAS;AAC3B,cAAM,EAAE,OAAO,SAAS,UAAA,IAAc,aAAa,QAAQ,MAAM,CAAC;AAClE,cAAM,QAAQ,MAAM,IAAI;AACxB,cAAM,MAAM,QAAQ;AAEpB,YAAI,MAAM,OAAO,QAAQ;AACvB,gBAAM,IAAI,MAAM,yBAAyB;AAAA,QAC3C;AAEA,cAAM,OAAO,WAAW,OAAO,SAAS,OAAO,GAAG,CAAC;AACnD,eAAO,KAAK,IAAI;AAChB,cAAM;AACN,kBAAU;AAAA,MACZ;AAGA,UAAI,CAAC,SAAS;AACZ,mBAAW,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG;AAC3B,cAAI,MAAM,MAAM,OAAO,OAAQ;AAC/B,gBAAM,QAAQ,OAAO,SAAS,KAAK,MAAM,GAAG;AAC5C,gBAAM,MAAM,MAAM,KAAK;AAEvB,cAAI,WAAW,IAAI,GAAG,GAAG;AACvB,mBAAO,KAAK,WAAW,IAAI,GAAG,CAAE;AAChC,mBAAO;AACP,sBAAU;AACV;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,SAAS;AACZ,eAAO,KAAK,OAAO,OAAO,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,GAAG;AAC/D,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,GAAG;AAAA,EACxB;AACF;"}
+{"version":3,"file":"index.mjs","sources":["../src/constants.ts","../src/dictionary-loader.ts","../src/core.ts"],"sourcesContent":["// wordbin\\src\\constants.ts\r\nexport const MAGIC = new Uint8Array([87, 66]) // 'W''B'\r\nexport const LITERAL = 0xff\r\n","import fs from \"fs/promises\";\r\nimport path from \"path\";\r\nimport { fileURLToPath } from \"url\";\r\nimport type { WordBinDictionary } from \"./types.js\";\r\n\r\nconst __filename = fileURLToPath(import.meta.url);\r\nconst __dirname = path.dirname(__filename);\r\n\r\n// 1️⃣ Bundled dictionaries inside the package (dist/data)\r\nconst PACKAGE_DATA_DIR = path.join(__dirname, \"data\");\r\n\r\n// 2️⃣ User project dictionaries (built via CLI)\r\nconst LOCAL_DATA_DIR = path.join(process.cwd(), \"data\");\r\n\r\n/**\r\n * Get all dictionary directories that exist\r\n * Priority: LOCAL first, then PACKAGE fallback\r\n */\r\nasync function getExistingDataDirs(): Promise<string[]> {\r\n  const dirs: string[] = [];\r\n\r\n  try {\r\n    await fs.access(LOCAL_DATA_DIR);\r\n    dirs.push(LOCAL_DATA_DIR);\r\n  } catch {}\r\n\r\n  try {\r\n    await fs.access(PACKAGE_DATA_DIR);\r\n    dirs.push(PACKAGE_DATA_DIR);\r\n  } catch {}\r\n\r\n  return dirs;\r\n}\r\n\r\n/**\r\n * Scan all available dictionary versions from all data dirs\r\n */\r\nexport async function getAllAvailableDictionaryVersions(): Promise<number[]> {\r\n  const dirs = await getExistingDataDirs();\r\n  const versions = new Set<number>();\r\n\r\n  for (const dir of dirs) {\r\n    try {\r\n      const files = await fs.readdir(dir);\r\n\r\n      for (const file of files) {\r\n        const match = file.match(/wordbin-v(\\d+)/i);\r\n        if (match) {\r\n          versions.add(parseInt(match[1], 10));\r\n        }\r\n      }\r\n    } catch {\r\n      // Ignore invalid dirs silently\r\n    }\r\n  }\r\n\r\n  return Array.from(versions).sort((a, b) => a - b);\r\n}\r\n\r\n/**\r\n * Load a specific dictionary version\r\n * LOCAL dictionaries override PACKAGE ones\r\n */\r\nexport async function loadDictionaryByVersion(\r\n  version: number,\r\n): Promise<WordBinDictionary> {\r\n  const dirs = await getExistingDataDirs();\r\n\r\n  if (dirs.length === 0) {\r\n    throw new Error(\r\n      `No dictionary directories found. Expected ./data or bundled package data.`,\r\n    );\r\n  }\r\n\r\n  for (const dir of dirs) {\r\n    const files = await fs.readdir(dir);\r\n\r\n    const versionFile = files.find((f) =>\r\n      f.match(new RegExp(`wordbin-v${version}(?:\\\\.|-)`, \"i\")),\r\n    );\r\n\r\n    if (versionFile) {\r\n      const filePath = path.join(dir, versionFile);\r\n      const data = await fs.readFile(filePath, \"utf-8\");\r\n      const dict = JSON.parse(data) as WordBinDictionary;\r\n\r\n      if (dict.version !== version) {\r\n        throw new Error(\r\n          `Version mismatch: file ${versionFile} claims v${dict.version} but expected v${version}`,\r\n        );\r\n      }\r\n\r\n      return dict;\r\n    }\r\n  }\r\n\r\n  const available = await getAllAvailableDictionaryVersions();\r\n\r\n  throw new Error(\r\n    `Dictionary version ${version} not found. Available versions: ${available.join(\", \")}`,\r\n  );\r\n}\r\n\r\n/**\r\n * Load the latest available dictionary version\r\n */\r\nexport async function loadLatestDictionary(): Promise<WordBinDictionary> {\r\n  const versions = await getAllAvailableDictionaryVersions();\r\n\r\n  if (versions.length === 0) {\r\n    throw new Error(\r\n      `No dictionary files found. Run \"npx wordbin build\" or use bundled v1.`,\r\n    );\r\n  }\r\n\r\n  const latestVersion = Math.max(...versions);\r\n\r\n  console.log(\r\n    `Loading latest dictionary: v${latestVersion} (available: ${versions.join(\", \")})`,\r\n  );\r\n\r\n  return loadDictionaryByVersion(latestVersion);\r\n}\r\n\r\n/**\r\n * Check if a specific version exists\r\n */\r\nexport async function hasDictionaryVersion(version: number): Promise<boolean> {\r\n  const versions = await getAllAvailableDictionaryVersions();\r\n  return versions.includes(version);\r\n}\r\n","import { MAGIC, LITERAL } from \"./constants.js\";\r\nimport { generateWordId } from \"./core/id.js\";\r\nimport {\r\n  toHex,\r\n  toBase64,\r\n  fromBase64,\r\n  encodeVarint,\r\n  decodeVarint,\r\n  utf8Encode,\r\n  utf8Decode,\r\n} from \"./utils/buffer.js\";\r\nimport type { EncodeResult, WordBinDictionary } from \"./types\";\r\nimport { buildDictionary } from \"./dictionary.js\";\r\nimport {\r\n  loadDictionaryByVersion,\r\n  loadLatestDictionary,\r\n} from \"./dictionary-loader.js\";\r\n\r\nexport class WordBin {\r\n  private primaryDictVersion: number;\r\n  // private debug: boolean;\r\n\r\n  constructor(initialDict?: WordBinDictionary, options?: { debug?: boolean }) {\r\n    this.primaryDictVersion = initialDict?.version ?? 2;\r\n    this.log = options?.debug\r\n      ? (...args) => console.log(\"[WordBin]\", ...args)\r\n      : () => {};\r\n  }\r\n\r\n  private log: (...args: any[]) => void;\r\n\r\n  static async createFromWords(words: string[]): Promise<WordBin> {\r\n    console.warn(\"Building dictionary from scratch – consider pre-built files\");\r\n    const dict = await buildDictionary(words);\r\n    return new WordBin(dict);\r\n  }\r\n\r\n  static async createFromJson(dictJson: WordBinDictionary): Promise<WordBin> {\r\n    return new WordBin(dictJson);\r\n  }\r\n\r\n  static async create(options?: { debug?: boolean }): Promise<WordBin> {\r\n    const latestDict = await loadLatestDictionary();\r\n    return new WordBin(latestDict, options);\r\n  }\r\n\r\n  private async getReverseMapForVersion(\r\n    version: number,\r\n  ): Promise<Map<string, string>> {\r\n    const dict = await loadDictionaryByVersion(version);\r\n    const reverseMap = new Map<string, string>();\r\n    for (const [hex, words] of Object.entries(dict.words)) {\r\n      if (words.length > 0) reverseMap.set(hex, words[0]);\r\n    }\r\n    return reverseMap;\r\n  }\r\n\r\n  async encode(\r\n    text: string | EncodeResult | Uint8Array,\r\n    options: { dictVersion?: number } = {},\r\n  ): Promise<EncodeResult> {\r\n    let textStr: string;\r\n    if (typeof text === \"string\") textStr = text;\r\n    else if (text instanceof Uint8Array) textStr = toBase64(text);\r\n    else textStr = text.encodedBase64;\r\n\r\n    if (!textStr.trim()) {\r\n      return {\r\n        originalText: \"\",\r\n        encoded: new Uint8Array(0),\r\n        payload: \"\",\r\n        encodedBase64: \"\",\r\n        originalBytes: 0,\r\n        encodedBytes: 0,\r\n        bytesSaved: 0,\r\n        ratioPercent: 100,\r\n      };\r\n    }\r\n\r\n    const words = textStr.split(/\\s+/).filter(Boolean);\r\n    this.log(`[encode] Input words (${words.length}):`, words);\r\n\r\n    const useVersion = options.dictVersion ?? this.primaryDictVersion;\r\n    this.log(`[encode] Using dictionary version: ${useVersion}`);\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Header creation\r\n    // ──────────────────────────────────────────────\r\n    const header = new Uint8Array([MAGIC[0], MAGIC[1], useVersion]);\r\n    this.log(`[encode] Header bytes: [${[...header].join(\", \")}]`);\r\n    this.log(`[encode] Header hex: ${toHex(header)}`);\r\n    this.log(\r\n      `[encode] Header as text (non-printable chars expected): \"${new TextDecoder().decode(header)}\"`,\r\n    );\r\n\r\n    const chunks: Uint8Array[] = [header];\r\n\r\n    const reverseMap = await this.getReverseMapForVersion(useVersion);\r\n    this.log(`[encode] Reverse map loaded — size: ${reverseMap.size} entries`);\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Process each word → show ID mapping\r\n    // ──────────────────────────────────────────────\r\n    this.log(\"[encode] Word → ID mapping:\");\r\n\r\n    for (const w of words) {\r\n      const id = await generateWordId(w); // Uint8Array (usually 2–4 bytes)\r\n      const key = toHex(id); // hex string for lookup\r\n\r\n      this.log(`  \"${w}\" → ID bytes: [${[...id].join(\", \")}] | hex: ${key}`);\r\n\r\n      console.log(`  \"${w}\" → ID bytes: [${[...id].join(\", \")}] | hex: ${key}`);\r\n\r\n      if (reverseMap.has(key)) {\r\n        const mappedWord = reverseMap.get(key);\r\n        this.log(`    → Found in dictionary → using ${id.length}-byte ID`);\r\n        chunks.push(id);\r\n      } else {\r\n        const utf8 = utf8Encode(w);\r\n        const lenVarint = encodeVarint(utf8.length);\r\n        this.log(`    → NOT in dictionary → literal mode`);\r\n        this.log(\r\n          `      Literal length varint bytes: [${[...lenVarint].join(\", \")}] (value = ${utf8.length})`,\r\n        );\r\n        this.log(`      Word UTF-8 bytes length: ${utf8.length}`);\r\n\r\n        const out = new Uint8Array(1 + lenVarint.length + utf8.length);\r\n        out[0] = LITERAL;\r\n        out.set(lenVarint, 1);\r\n        out.set(utf8, 1 + lenVarint.length);\r\n\r\n        this.log(`      Literal chunk bytes: [${[...out].join(\", \")}]`);\r\n        chunks.push(out);\r\n      }\r\n    }\r\n\r\n    // ──────────────────────────────────────────────\r\n    // Final assembly\r\n    // ──────────────────────────────────────────────\r\n    const totalLength = chunks.reduce((n, c) => n + c.length, 0);\r\n    const result = new Uint8Array(totalLength);\r\n\r\n    this.log(`[encode] Total encoded length: ${totalLength} bytes`);\r\n\r\n    let off = 0;\r\n    chunks.forEach((chunk, i) => {\r\n      result.set(chunk, off);\r\n      off += chunk.length;\r\n      this.log(\r\n        `  Chunk ${i}: ${chunk.length} bytes → offset ${off - chunk.length}`,\r\n      );\r\n    });\r\n\r\n    this.log(\r\n      `[encode] Final encoded bytes (first 32): [${[...result.subarray(0, Math.min(32, result.length))].join(\", \")}]`,\r\n    );\r\n\r\n    const originalBytes = new TextEncoder().encode(textStr).length;\r\n\r\n    const base64Result = toBase64(result);\r\n    this.log(`[encode] Base64 starts with: ${base64Result.slice(0, 12)}...`);\r\n\r\n    return {\r\n      originalText: textStr,\r\n      encoded: result,\r\n      payload: base64Result,\r\n      encodedBase64: base64Result,\r\n      originalBytes,\r\n      encodedBytes: totalLength,\r\n      bytesSaved: originalBytes - totalLength,\r\n      ratioPercent:\r\n        totalLength === 0\r\n          ? 100\r\n          : Math.round((totalLength / originalBytes) * 100),\r\n    };\r\n  }\r\n\r\n  async decode(data: Uint8Array | string): Promise<string> {\r\n    let buffer: Uint8Array;\r\n    if (typeof data === \"string\") {\r\n      this.log(\r\n        `[decode] Input is base64 string: \"${data.substring(0, 20)}...\"`,\r\n      );\r\n      buffer = fromBase64(data);\r\n      this.log(`[decode] Decoded to ${buffer.length} bytes`);\r\n    } else {\r\n      buffer = data;\r\n      this.log(`[decode] Input is Uint8Array with ${buffer.length} bytes`);\r\n    }\r\n\r\n    this.log(`[decode] Full buffer hex: ${toHex(buffer)}`);\r\n    this.log(\r\n      `[decode] First 16 bytes: [${[...buffer.subarray(0, Math.min(16, buffer.length))].join(\", \")}]`,\r\n    );\r\n\r\n    if (buffer.length < 3) {\r\n      throw new Error(\"Data too short\");\r\n    }\r\n\r\n    // Check magic bytes\r\n    const magicReceived = [buffer[0], buffer[1]];\r\n    this.log(\r\n      `[decode] Magic bytes: expected [${MAGIC[0]}, ${MAGIC[1]}], got [${magicReceived.join(\", \")}]`,\r\n    );\r\n\r\n    if (buffer[0] !== MAGIC[0] || buffer[1] !== MAGIC[1]) {\r\n      throw new Error(\"Invalid magic bytes\");\r\n    }\r\n\r\n    const version = buffer[2];\r\n    this.log(`[decode] Dictionary version from header: ${version}`);\r\n\r\n    const pos = 3; // start right after version byte\r\n    this.log(`[decode] Starting decode at position ${pos}`);\r\n\r\n    const reverseMap = await this.getReverseMapForVersion(version);\r\n    this.log(\r\n      `[decode] Reverse map loaded for v${version} — size: ${reverseMap.size} entries`,\r\n    );\r\n\r\n    this.log(`[decode] ===== STARTING DECODE LOOP =====`);\r\n\r\n    const result: string[] = [];\r\n    const decoded = this.tryDecode(pos, buffer, reverseMap, result, 0); // 0 is depth for logging\r\n\r\n    if (decoded === null) {\r\n      throw new Error(\r\n        \"No valid decode path found — possible corruption or dictionary mismatch\",\r\n      );\r\n    }\r\n\r\n    this.log(`\\n[decode] ===== DECODE COMPLETE =====`);\r\n    this.log(`[decode] Total words decoded: ${result.length}`);\r\n    this.log(`[decode] Final result: \"${decoded}\"`);\r\n\r\n    return decoded;\r\n  }\r\n\r\n  private tryDecode(\r\n    pos: number,\r\n    buffer: Uint8Array,\r\n    reverseMap: Map<string, string>,\r\n    result: string[],\r\n    depth: number, // for indented logging\r\n  ): string | null {\r\n    const indent = \"  \".repeat(depth);\r\n    this.log(`${indent}[tryDecode] At position ${pos} (depth ${depth})`);\r\n\r\n    if (pos === buffer.length) {\r\n      this.log(`${indent}[tryDecode] Reached end successfully`);\r\n      return result.join(\" \");\r\n    }\r\n\r\n    // Show context\r\n    const previewLen = Math.min(8, buffer.length - pos);\r\n    const preview = [...buffer.subarray(pos, pos + previewLen)]\r\n      .map((b) => `0x${b.toString(16).padStart(2, \"0\")}`)\r\n      .join(\" \");\r\n    this.log(`${indent}[tryDecode] Next ${previewLen} bytes: ${preview}`);\r\n\r\n    // Try literal first\r\n    if (buffer[pos] === LITERAL) {\r\n      this.log(\r\n        `${indent}[tryDecode] Found LITERAL marker (0x${LITERAL.toString(16)})`,\r\n      );\r\n\r\n      const { value: byteLen, bytesRead } = decodeVarint(buffer, pos + 1);\r\n      this.log(\r\n        `${indent}[tryDecode] Varint: value=${byteLen}, bytesRead=${bytesRead}`,\r\n      );\r\n\r\n      const start = pos + 1 + bytesRead;\r\n      const end = start + byteLen;\r\n      this.log(\r\n        `${indent}[tryDecode] Literal range: [${start}..${end}) (${byteLen} bytes)`,\r\n      );\r\n\r\n      if (end > buffer.length) {\r\n        this.log(`${indent}[tryDecode] Truncated literal — failing path`);\r\n        return null;\r\n      }\r\n\r\n      const literalBytes = buffer.subarray(start, end);\r\n      const word = utf8Decode(literalBytes);\r\n      this.log(`${indent}[tryDecode] Decoded literal: \"${word}\"`);\r\n\r\n      result.push(word);\r\n      const res = this.tryDecode(end, buffer, reverseMap, result, depth + 1);\r\n      if (res !== null) {\r\n        return res;\r\n      }\r\n      result.pop();\r\n      this.log(`${indent}[tryDecode] Backtracking from literal`);\r\n      return null;\r\n    }\r\n\r\n    // Try dictionary matches (long to short, but backtrack allows exploring shorter if long fails downstream)\r\n    for (const len of [4, 3, 2]) {\r\n      if (pos + len > buffer.length) {\r\n        this.log(\r\n          `${indent}[tryDecode] Skipping ${len}-byte (would exceed: need ${pos + len}, have ${buffer.length})`,\r\n        );\r\n        continue;\r\n      }\r\n\r\n      const slice = buffer.subarray(pos, pos + len);\r\n      const key = toHex(slice);\r\n      const keyBytes = [...slice]\r\n        .map((b) => `0x${b.toString(16).padStart(2, \"0\")}`)\r\n        .join(\" \");\r\n\r\n      this.log(\r\n        `${indent}[tryDecode] Trying ${len}-byte: [${keyBytes}] hex=${key}`,\r\n      );\r\n\r\n      if (reverseMap.has(key)) {\r\n        const word = reverseMap.get(key)!;\r\n        this.log(`${indent}[tryDecode] Match: \"${word}\" (ID: ${key})`);\r\n\r\n        result.push(word);\r\n        const res = this.tryDecode(\r\n          pos + len,\r\n          buffer,\r\n          reverseMap,\r\n          result,\r\n          depth + 1,\r\n        );\r\n        if (res !== null) {\r\n          return res;\r\n        }\r\n        result.pop();\r\n        this.log(`${indent}[tryDecode] Backtracking from \"${word}\"`);\r\n      } else {\r\n        this.log(`${indent}[tryDecode] No match for ${key}`);\r\n      }\r\n    }\r\n\r\n    // If no branches worked, fail this path\r\n    this.log(`${indent}[tryDecode] No valid branches — failing path`);\r\n    return null;\r\n  }\r\n}\r\n"],"names":["__filename","__dirname"],"mappings":";;;;AACO,MAAM,QAAQ,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;AACrC,MAAM,UAAU;ACGvB,MAAMA,eAAa,cAAc,YAAY,GAAG;AAChD,MAAMC,cAAY,KAAK,QAAQD,YAAU;AAGzC,MAAM,mBAAmB,KAAK,KAAKC,aAAW,MAAM;AAGpD,MAAM,iBAAiB,KAAK,KAAK,QAAQ,IAAA,GAAO,MAAM;AAMtD,eAAe,sBAAyC;AACtD,QAAM,OAAiB,CAAA;AAEvB,MAAI;AACF,UAAM,GAAG,OAAO,cAAc;AAC9B,SAAK,KAAK,cAAc;AAAA,EAC1B,QAAQ;AAAA,EAAC;AAET,MAAI;AACF,UAAM,GAAG,OAAO,gBAAgB;AAChC,SAAK,KAAK,gBAAgB;AAAA,EAC5B,QAAQ;AAAA,EAAC;AAET,SAAO;AACT;AAKA,eAAsB,oCAAuD;AAC3E,QAAM,OAAO,MAAM,oBAAA;AACnB,QAAM,+BAAe,IAAA;AAErB,aAAW,OAAO,MAAM;AACtB,QAAI;AACF,YAAM,QAAQ,MAAM,GAAG,QAAQ,GAAG;AAElC,iBAAW,QAAQ,OAAO;AACxB,cAAM,QAAQ,KAAK,MAAM,iBAAiB;AAC1C,YAAI,OAAO;AACT,mBAAS,IAAI,SAAS,MAAM,CAAC,GAAG,EAAE,CAAC;AAAA,QACrC;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,QAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAClD;AAMA,eAAsB,wBACpB,SAC4B;AAC5B,QAAM,OAAO,MAAM,oBAAA;AAEnB,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAEA,aAAW,OAAO,MAAM;AACtB,UAAM,QAAQ,MAAM,GAAG,QAAQ,GAAG;AAElC,UAAM,cAAc,MAAM;AAAA,MAAK,CAAC,MAC9B,EAAE,MAAM,IAAI,OAAO,YAAY,OAAO,aAAa,GAAG,CAAC;AAAA,IAAA;AAGzD,QAAI,aAAa;AACf,YAAM,WAAW,KAAK,KAAK,KAAK,WAAW;AAC3C,YAAM,OAAO,MAAM,GAAG,SAAS,UAAU,OAAO;AAChD,YAAM,OAAO,KAAK,MAAM,IAAI;AAE5B,UAAI,KAAK,YAAY,SAAS;AAC5B,cAAM,IAAI;AAAA,UACR,0BAA0B,WAAW,YAAY,KAAK,OAAO,kBAAkB,OAAO;AAAA,QAAA;AAAA,MAE1F;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,YAAY,MAAM,kCAAA;AAExB,QAAM,IAAI;AAAA,IACR,sBAAsB,OAAO,mCAAmC,UAAU,KAAK,IAAI,CAAC;AAAA,EAAA;AAExF;AAKA,eAAsB,uBAAmD;AACvE,QAAM,WAAW,MAAM,kCAAA;AAEvB,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAEA,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ;AAE1C,UAAQ;AAAA,IACN,+BAA+B,aAAa,gBAAgB,SAAS,KAAK,IAAI,CAAC;AAAA,EAAA;AAGjF,SAAO,wBAAwB,aAAa;AAC9C;ACxGO,MAAM,QAAQ;AAAA;AAAA,EAInB,YAAY,aAAiC,SAA+B;AAC1E,SAAK,qBAAqB,aAAa,WAAW;AAClD,SAAK,MAAM,SAAS,QAChB,IAAI,SAAS,QAAQ,IAAI,aAAa,GAAG,IAAI,IAC7C,MAAM;AAAA,IAAC;AAAA,EACb;AAAA,EAIA,aAAa,gBAAgB,OAAmC;AAC9D,YAAQ,KAAK,6DAA6D;AAC1E,UAAM,OAAO,MAAM,gBAAgB,KAAK;AACxC,WAAO,IAAI,QAAQ,IAAI;AAAA,EACzB;AAAA,EAEA,aAAa,eAAe,UAA+C;AACzE,WAAO,IAAI,QAAQ,QAAQ;AAAA,EAC7B;AAAA,EAEA,aAAa,OAAO,SAAiD;AACnE,UAAM,aAAa,MAAM,qBAAA;AACzB,WAAO,IAAI,QAAQ,YAAY,OAAO;AAAA,EACxC;AAAA,EAEA,MAAc,wBACZ,SAC8B;AAC9B,UAAM,OAAO,MAAM,wBAAwB,OAAO;AAClD,UAAM,iCAAiB,IAAA;AACvB,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,UAAI,MAAM,SAAS,EAAG,YAAW,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OACJ,MACA,UAAoC,IACb;AACvB,QAAI;AACJ,QAAI,OAAO,SAAS,SAAU,WAAU;AAAA,aAC/B,gBAAgB,WAAY,WAAU,SAAS,IAAI;AAAA,mBAC7C,KAAK;AAEpB,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO;AAAA,QACL,cAAc;AAAA,QACd,SAAS,IAAI,WAAW,CAAC;AAAA,QACzB,SAAS;AAAA,QACT,eAAe;AAAA,QACf,eAAe;AAAA,QACf,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,cAAc;AAAA,MAAA;AAAA,IAElB;AAEA,UAAM,QAAQ,QAAQ,MAAM,KAAK,EAAE,OAAO,OAAO;AACjD,SAAK,IAAI,yBAAyB,MAAM,MAAM,MAAM,KAAK;AAEzD,UAAM,aAAa,QAAQ,eAAe,KAAK;AAC/C,SAAK,IAAI,sCAAsC,UAAU,EAAE;AAK3D,UAAM,SAAS,IAAI,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,UAAU,CAAC;AAC9D,SAAK,IAAI,2BAA2B,CAAC,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG;AAC7D,SAAK,IAAI,wBAAwB,MAAM,MAAM,CAAC,EAAE;AAChD,SAAK;AAAA,MACH,4DAA4D,IAAI,YAAA,EAAc,OAAO,MAAM,CAAC;AAAA,IAAA;AAG9F,UAAM,SAAuB,CAAC,MAAM;AAEpC,UAAM,aAAa,MAAM,KAAK,wBAAwB,UAAU;AAChE,SAAK,IAAI,uCAAuC,WAAW,IAAI,UAAU;AAKzE,SAAK,IAAI,6BAA6B;AAEtC,eAAW,KAAK,OAAO;AACrB,YAAM,KAAK,MAAM,eAAe,CAAC;AACjC,YAAM,MAAM,MAAM,EAAE;AAEpB,WAAK,IAAI,MAAM,CAAC,kBAAkB,CAAC,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,YAAY,GAAG,EAAE;AAErE,cAAQ,IAAI,MAAM,CAAC,kBAAkB,CAAC,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,YAAY,GAAG,EAAE;AAExE,UAAI,WAAW,IAAI,GAAG,GAAG;AACJ,mBAAW,IAAI,GAAG;AACrC,aAAK,IAAI,qCAAqC,GAAG,MAAM,UAAU;AACjE,eAAO,KAAK,EAAE;AAAA,MAChB,OAAO;AACL,cAAM,OAAO,WAAW,CAAC;AACzB,cAAM,YAAY,aAAa,KAAK,MAAM;AAC1C,aAAK,IAAI,wCAAwC;AACjD,aAAK;AAAA,UACH,uCAAuC,CAAC,GAAG,SAAS,EAAE,KAAK,IAAI,CAAC,cAAc,KAAK,MAAM;AAAA,QAAA;AAE3F,aAAK,IAAI,kCAAkC,KAAK,MAAM,EAAE;AAExD,cAAM,MAAM,IAAI,WAAW,IAAI,UAAU,SAAS,KAAK,MAAM;AAC7D,YAAI,CAAC,IAAI;AACT,YAAI,IAAI,WAAW,CAAC;AACpB,YAAI,IAAI,MAAM,IAAI,UAAU,MAAM;AAElC,aAAK,IAAI,+BAA+B,CAAC,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG;AAC9D,eAAO,KAAK,GAAG;AAAA,MACjB;AAAA,IACF;AAKA,UAAM,cAAc,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC3D,UAAM,SAAS,IAAI,WAAW,WAAW;AAEzC,SAAK,IAAI,kCAAkC,WAAW,QAAQ;AAE9D,QAAI,MAAM;AACV,WAAO,QAAQ,CAAC,OAAO,MAAM;AAC3B,aAAO,IAAI,OAAO,GAAG;AACrB,aAAO,MAAM;AACb,WAAK;AAAA,QACH,WAAW,CAAC,KAAK,MAAM,MAAM,mBAAmB,MAAM,MAAM,MAAM;AAAA,MAAA;AAAA,IAEtE,CAAC;AAED,SAAK;AAAA,MACH,6CAA6C,CAAC,GAAG,OAAO,SAAS,GAAG,KAAK,IAAI,IAAI,OAAO,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,IAAA;AAG9G,UAAM,gBAAgB,IAAI,YAAA,EAAc,OAAO,OAAO,EAAE;AAExD,UAAM,eAAe,SAAS,MAAM;AACpC,SAAK,IAAI,gCAAgC,aAAa,MAAM,GAAG,EAAE,CAAC,KAAK;AAEvE,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS;AAAA,MACT,SAAS;AAAA,MACT,eAAe;AAAA,MACf;AAAA,MACA,cAAc;AAAA,MACd,YAAY,gBAAgB;AAAA,MAC5B,cACE,gBAAgB,IACZ,MACA,KAAK,MAAO,cAAc,gBAAiB,GAAG;AAAA,IAAA;AAAA,EAExD;AAAA,EAEA,MAAM,OAAO,MAA4C;AACvD,QAAI;AACJ,QAAI,OAAO,SAAS,UAAU;AAC5B,WAAK;AAAA,QACH,qCAAqC,KAAK,UAAU,GAAG,EAAE,CAAC;AAAA,MAAA;AAE5D,eAAS,WAAW,IAAI;AACxB,WAAK,IAAI,uBAAuB,OAAO,MAAM,QAAQ;AAAA,IACvD,OAAO;AACL,eAAS;AACT,WAAK,IAAI,qCAAqC,OAAO,MAAM,QAAQ;AAAA,IACrE;AAEA,SAAK,IAAI,6BAA6B,MAAM,MAAM,CAAC,EAAE;AACrD,SAAK;AAAA,MACH,6BAA6B,CAAC,GAAG,OAAO,SAAS,GAAG,KAAK,IAAI,IAAI,OAAO,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,IAAA;AAG9F,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,IAAI,MAAM,gBAAgB;AAAA,IAClC;AAGA,UAAM,gBAAgB,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAC3C,SAAK;AAAA,MACH,mCAAmC,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,WAAW,cAAc,KAAK,IAAI,CAAC;AAAA,IAAA;AAG7F,QAAI,OAAO,CAAC,MAAM,MAAM,CAAC,KAAK,OAAO,CAAC,MAAM,MAAM,CAAC,GAAG;AACpD,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AAEA,UAAM,UAAU,OAAO,CAAC;AACxB,SAAK,IAAI,4CAA4C,OAAO,EAAE;AAE9D,UAAM,MAAM;AACZ,SAAK,IAAI,wCAAwC,GAAG,EAAE;AAEtD,UAAM,aAAa,MAAM,KAAK,wBAAwB,OAAO;AAC7D,SAAK;AAAA,MACH,oCAAoC,OAAO,YAAY,WAAW,IAAI;AAAA,IAAA;AAGxE,SAAK,IAAI,2CAA2C;AAEpD,UAAM,SAAmB,CAAA;AACzB,UAAM,UAAU,KAAK,UAAU,KAAK,QAAQ,YAAY,QAAQ,CAAC;AAEjE,QAAI,YAAY,MAAM;AACpB,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAAA,IAEJ;AAEA,SAAK,IAAI;AAAA,qCAAwC;AACjD,SAAK,IAAI,iCAAiC,OAAO,MAAM,EAAE;AACzD,SAAK,IAAI,2BAA2B,OAAO,GAAG;AAE9C,WAAO;AAAA,EACT;AAAA,EAEQ,UACN,KACA,QACA,YACA,QACA,OACe;AACf,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,SAAK,IAAI,GAAG,MAAM,2BAA2B,GAAG,WAAW,KAAK,GAAG;AAEnE,QAAI,QAAQ,OAAO,QAAQ;AACzB,WAAK,IAAI,GAAG,MAAM,sCAAsC;AACxD,aAAO,OAAO,KAAK,GAAG;AAAA,IACxB;AAGA,UAAM,aAAa,KAAK,IAAI,GAAG,OAAO,SAAS,GAAG;AAClD,UAAM,UAAU,CAAC,GAAG,OAAO,SAAS,KAAK,MAAM,UAAU,CAAC,EACvD,IAAI,CAAC,MAAM,KAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,EACjD,KAAK,GAAG;AACX,SAAK,IAAI,GAAG,MAAM,oBAAoB,UAAU,WAAW,OAAO,EAAE;AAGpE,QAAI,OAAO,GAAG,MAAM,SAAS;AAC3B,WAAK;AAAA,QACH,GAAG,MAAM,uCAAuC,QAAQ,SAAS,EAAE,CAAC;AAAA,MAAA;AAGtE,YAAM,EAAE,OAAO,SAAS,UAAA,IAAc,aAAa,QAAQ,MAAM,CAAC;AAClE,WAAK;AAAA,QACH,GAAG,MAAM,6BAA6B,OAAO,eAAe,SAAS;AAAA,MAAA;AAGvE,YAAM,QAAQ,MAAM,IAAI;AACxB,YAAM,MAAM,QAAQ;AACpB,WAAK;AAAA,QACH,GAAG,MAAM,+BAA+B,KAAK,KAAK,GAAG,MAAM,OAAO;AAAA,MAAA;AAGpE,UAAI,MAAM,OAAO,QAAQ;AACvB,aAAK,IAAI,GAAG,MAAM,8CAA8C;AAChE,eAAO;AAAA,MACT;AAEA,YAAM,eAAe,OAAO,SAAS,OAAO,GAAG;AAC/C,YAAM,OAAO,WAAW,YAAY;AACpC,WAAK,IAAI,GAAG,MAAM,iCAAiC,IAAI,GAAG;AAE1D,aAAO,KAAK,IAAI;AAChB,YAAM,MAAM,KAAK,UAAU,KAAK,QAAQ,YAAY,QAAQ,QAAQ,CAAC;AACrE,UAAI,QAAQ,MAAM;AAChB,eAAO;AAAA,MACT;AACA,aAAO,IAAA;AACP,WAAK,IAAI,GAAG,MAAM,uCAAuC;AACzD,aAAO;AAAA,IACT;AAGA,eAAW,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG;AAC3B,UAAI,MAAM,MAAM,OAAO,QAAQ;AAC7B,aAAK;AAAA,UACH,GAAG,MAAM,wBAAwB,GAAG,6BAA6B,MAAM,GAAG,UAAU,OAAO,MAAM;AAAA,QAAA;AAEnG;AAAA,MACF;AAEA,YAAM,QAAQ,OAAO,SAAS,KAAK,MAAM,GAAG;AAC5C,YAAM,MAAM,MAAM,KAAK;AACvB,YAAM,WAAW,CAAC,GAAG,KAAK,EACvB,IAAI,CAAC,MAAM,KAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,EACjD,KAAK,GAAG;AAEX,WAAK;AAAA,QACH,GAAG,MAAM,sBAAsB,GAAG,WAAW,QAAQ,SAAS,GAAG;AAAA,MAAA;AAGnE,UAAI,WAAW,IAAI,GAAG,GAAG;AACvB,cAAM,OAAO,WAAW,IAAI,GAAG;AAC/B,aAAK,IAAI,GAAG,MAAM,uBAAuB,IAAI,UAAU,GAAG,GAAG;AAE7D,eAAO,KAAK,IAAI;AAChB,cAAM,MAAM,KAAK;AAAA,UACf,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,QAAA;AAEV,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACT;AACA,eAAO,IAAA;AACP,aAAK,IAAI,GAAG,MAAM,kCAAkC,IAAI,GAAG;AAAA,MAC7D,OAAO;AACL,aAAK,IAAI,GAAG,MAAM,4BAA4B,GAAG,EAAE;AAAA,MACrD;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,MAAM,8CAA8C;AAChE,WAAO;AAAA,EACT;AACF;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@bigdreamsweb3/wordbin",
-  "version": "1.0.2",
+  "version": "1.0.4",
   "description": "WordBin – Encode words & short text into tiny, reversible binary for storage, URLs, IoT, QR codes, metadata, blockchain, or Web3 apps.",
   "author": "Agbaka Daniel Ugonna <99cratson@gmail.com>",
   "license": "MIT",