base985161 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 NoaxH
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,52 @@
+# BASE-985161 — Binary-to-Text via Big-Integer Conversion
+
+**BASE-985161** encodes any byte stream as text using a Unicode alphabet of 985,161 symbols (from U+10000 upward). It preserves leading zero bytes and performs true base conversion (256 <-> 985,161), similar to Base58 but at a much larger radix.
+
+## Why
+- **Unicode-friendly:** copy/paste-safe in editors, browsers, and chats.
+- **Compact-ish:** larger radix -> fewer characters than Base64 for many inputs.
+- **Reversible:** lossless round-trip; leading zeros preserved.
+
+## Web (one-page)
+Open `index.html` in your browser. Type text or upload a file -> **ENCODE**. Paste encoded text -> **DECODE**.
+
+## Python
+```bash
+python base985161.py enc input.bin out.b985161
+python base985161.py dec out.b985161 restored.bin
+```
+```python
+import base985161  # if placed on PYTHONPATH
+s = base985161.encode(b"Hello")
+raw = base985161.decode(s)
+```
+
+## Node / JavaScript
+```bash
+npm install base-985161
+# or: npm install -g base-985161
+```
+```bash
+node base985161.js enc input.bin out.b985161
+node base985161.js dec out.b985161 restored.bin
+# or via npm bin:
+base985161 enc input.bin out.b985161
+base985161 dec out.b985161 restored.bin
+```
+```js
+import { encode, decode } from 'base-985161';
+const s = encode(new TextEncoder().encode('Hello'));
+const raw = decode(s);
+```
+
+## Design Notes
+- Alphabet: contiguous Unicode range **U+10000 .. U+10000+985160** (avoids surrogates).
+- Method: big-integer division (repeated div/mod) for 256<->985161, preserving leading 0x00 bytes via leading zero-digits.
+- No padding header is needed because conversion is exact in base arithmetic.
+
+## Caveats
+- Some glyphs may render as tofu; that's fine—decoding uses code points, not glyph shapes.
+- Not encryption: this is an encoding, not a security mechanism.
+
+## License
+MIT

package/base985161.js

@@ -0,0 +1,103 @@
+#!/usr/bin/env node
+// Base-985161 encoder/decoder (ES module + simple CLI)
+// Radix: 985,161 (not a power of two)
+// Alphabet: U+10000 .. U+10000+985160 (avoids surrogates)
+// Method: big-integer base conversion (256 <-> 985,161) with leading-zero preservation
+
+export const BASE = 985161;
+export const CP_START = 0x10000;
+export const CP_END   = CP_START + BASE - 1;
+
+export function valToChar(v){
+  if (v < 0 || v >= BASE) throw new RangeError('digit out of range');
+  return String.fromCodePoint(CP_START + v);
+}
+export function charToVal(ch){
+  const cp = ch.codePointAt(0);
+  if (cp < CP_START || cp > CP_END) throw new Error(`Invalid Base-985161 character U+${cp.toString(16).toUpperCase()}`);
+  return cp - CP_START;
+}
+
+// Divide big-int represented as digits[] (baseFrom, MSB-first) by divisor; return [quotientDigits, remainder]
+function divmodNumber(digits, baseFrom, divisor){
+  const q = [];
+  let rem = 0;
+  for (let i=0;i<digits.length;i++){
+    const acc = rem * baseFrom + digits[i];
+    const d = Math.floor(acc / divisor);
+    rem = acc % divisor;
+    if (q.length || d !== 0) q.push(d);
+  }
+  return [q, rem];
+}
+
+export function encode(bytes){
+  if (!bytes || bytes.length === 0) return valToChar(0);
+
+  // Count leading zero bytes
+  let zeros = 0; while (zeros < bytes.length && bytes[zeros] === 0) zeros++;
+
+  let digits256 = Array.from(bytes); // MSB-first
+  const outVals = [];
+  while (digits256.length){
+    const [q, rem] = divmodNumber(digits256, 256, BASE);
+    outVals.push(rem);
+    digits256 = q;
+  }
+  // Add markers for leading zero bytes
+  for (let i=0;i<zeros;i++) outVals.push(0);
+  outVals.reverse();
+  return outVals.map(valToChar).join('');
+}
+
+export function decode(text){
+  if (!text || text.length === 0) return new Uint8Array();
+  const digitsB = [];
+  for (let i=0;i<text.length;){
+    const cp = text.codePointAt(i);
+    i += (cp > 0xFFFF ? 2 : 1);
+    if (cp < CP_START || cp > CP_END) throw new Error(`Invalid Base-985161 digit U+${cp.toString(16).toUpperCase()}`);
+    digitsB.push(cp - CP_START);
+  }
+  // Count leading zero-digits
+  let zeros = 0; for (const v of digitsB){ if (v===0) zeros++; else break; }
+
+  const out = [];
+  let arr = digitsB.slice();
+  while (arr.length){
+    const [q, rem] = divmodNumber(arr, BASE, 256);
+    out.push(rem);
+    arr = q;
+  }
+  for (let i=0;i<zeros;i++) out.push(0);
+  out.reverse();
+  return new Uint8Array(out);
+}
+
+// -------------- CLI (Node) --------------
+if (typeof process !== 'undefined' && import.meta.url === `file://${process.argv[1]}`){
+  const fs = await import('node:fs');
+  const args = process.argv.slice(2);
+  if (args.length < 1 || !['enc','dec'].includes(args[0])){
+    console.error('Usage: node base985161.js enc|dec [infile|-] [outfile|-]');
+    process.exit(2);
+  }
+  const mode = args[0];
+  const inf  = args[1] ?? '-';
+  const outf = args[2] ?? '-';
+
+  if (mode === 'enc'){
+    const data = inf === '-' ? await readStdinBin() : fs.readFileSync(inf);
+    const text = encode(new Uint8Array(data));
+    if (outf === '-') process.stdout.write(text);
+    else fs.writeFileSync(outf, text, 'utf8');
+  } else {
+    const text = inf === '-' ? await readStdinTxt() : fs.readFileSync(inf, 'utf8');
+    const bytes = decode(text);
+    if (outf === '-') process.stdout.write(Buffer.from(bytes));
+    else fs.writeFileSync(outf, Buffer.from(bytes));
+  }
+}
+
+async function readStdinBin(){ const chunks=[]; for await (const c of process.stdin) chunks.push(c); return Buffer.concat(chunks); }
+async function readStdinTxt(){ const buf = await readStdinBin(); return buf.toString('utf8'); }

package/package.json

@@ -0,0 +1,37 @@
+{
+  "name": "base985161",
+  "version": "0.1.0",
+  "description": "Binary-to-text encoding using a 985,161-symbol Unicode alphabet (U+10000..).",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/NoahenVic/BASE985161.git"
+  },
+  "homepage": "https://github.com/NoahenVic/BASE985161#readme",
+  "bugs": {
+    "url": "https://github.com/NoahenVic/BASE985161/issues"
+  },
+  "type": "module",
+  "main": "./base985161.js",
+  "exports": {
+    ".": "./base985161.js"
+  },
+  "bin": {
+    "base985161": "./base985161.js"
+  },
+  "files": [
+    "base985161.js",
+    "README.md",
+    "LICENSE"
+  ],
+  "keywords": [
+    "base",
+    "encoding",
+    "unicode",
+    "binary",
+    "bigint"
+  ],
+  "engines": {
+    "node": ">=18"
+  }
+}