finitefields 0.0.3

package/.lesshst

@@ -0,0 +1,3 @@
+.less-history-file:
+.search
+"token

package/.viminfo

@@ -0,0 +1,112 @@
+# This viminfo file was generated by Vim 9.0.
+# You may edit it if you're careful!
+
+# Viminfo version
+|1,4
+
+# Value of 'encoding' when this file was written
+*encoding=latin1
+
+
+# hlsearch on (H) or off (h):
+~h
+# Command Line History (newest to oldest):
+:wq
+|2,0,1770671027,,"wq"
+
+# Search String History (newest to oldest):
+
+# Expression History (newest to oldest):
+
+# Input Line History (newest to oldest):
+
+# Debug Line History (newest to oldest):
+
+# Registers:
+""-	CHAR	0
+	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
+|3,1,36,0,1,0,1770671022,"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"
+
+# File marks:
+'0  1  72  ~/.npmrc
+|4,48,1,72,1770671027,"~/.npmrc"
+'1  1  39  /home/jobj/token
+|4,49,1,39,1770670606,"/home/jobj/token"
+'2  5  11  ~/.gitignore
+|4,50,5,11,1770670071,"~/.gitignore"
+'3  4  8  ~/.gitignore
+|4,51,4,8,1770670048,"~/.gitignore"
+'4  4  8  ~/.gitignore
+|4,52,4,8,1770670048,"~/.gitignore"
+
+# Jumplist (newest first):
+-'  1  72  ~/.npmrc
+|4,39,1,72,1770671027,"~/.npmrc"
+-'  1  39  /home/jobj/token
+|4,39,1,39,1770670606,"/home/jobj/token"
+-'  1  39  /home/jobj/token
+|4,39,1,39,1770670606,"/home/jobj/token"
+-'  5  11  ~/.gitignore
+|4,39,5,11,1770670071,"~/.gitignore"
+-'  5  11  ~/.gitignore
+|4,39,5,11,1770670071,"~/.gitignore"
+-'  5  11  ~/.gitignore
+|4,39,5,11,1770670071,"~/.gitignore"
+-'  5  11  ~/.gitignore
+|4,39,5,11,1770670071,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670065,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670065,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670065,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670065,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670048,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670048,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670048,"~/.gitignore"
+-'  4  8  ~/.gitignore
+|4,39,4,8,1770670048,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+-'  1  0  ~/.gitignore
+|4,39,1,0,1770670030,"~/.gitignore"
+
+# History of marks within files (newest to oldest):
+
+> ~/.npmrc
+	*	1770671026	0
+	"	1	72
+	^	1	73
+	.	1	57
+	+	1	57
+
+> /home/jobj/token
+	*	1770670605	0
+	"	1	39
+	^	1	40
+	.	1	24
+	+	1	24
+
+> ~/.gitignore
+	*	1770670070	0
+	"	5	11
+	^	5	12
+	.	5	11
+	+	4	8
+	+	5	11

package/Makefile

@@ -0,0 +1,13 @@
+.PHONY: run clean
+
+all: build
+
+build:
+	npm run build
+
+run:
+	npm run start
+
+clean:
+	rm -f *.js
+

package/main.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=main.d.ts.map

package/main.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["main.ts"],"names":[],"mappings":""}

package/main.js

@@ -0,0 +1,23 @@
+/* main.ts */
+import { Polynomial } from './polynomial.js';
+let log;
+log = console.log;
+let p1;
+let p2;
+let p3;
+let x0;
+let x1;
+let x2;
+let x3;
+x0 = BigInt(1);
+x1 = BigInt(0);
+x2 = BigInt(1);
+x3 = BigInt(0);
+p1 = new Polynomial([x0, x1, x2, x3], 2n);
+p2 = new Polynomial({ tobject: 0n, x3: 1n, x2: 0n, x: 1n, 1: 1n }, 2n);
+// log(p1, " + ", p2, " =");
+// p3 = Polynomial.add(p1,p2);
+p3 = new Polynomial(256n, 2n);
+log(p3, p3.eval());
+// log(p3.eval());
+//# sourceMappingURL=main.js.map

package/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sourceRoot":"","sources":["main.ts"],"names":[],"mappings":"AAAA,aAAa;AACb,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,IAAI,GAAsB,CAAC;AAC3B,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;AAElB,IAAI,EAAa,CAAC;AAClB,IAAI,EAAa,CAAC;AAClB,IAAI,EAAa,CAAC;AAClB,IAAI,EAAS,CAAC;AACd,IAAI,EAAS,CAAC;AACd,IAAI,EAAS,CAAC;AACd,IAAI,EAAS,CAAC;AAEd,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACf,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACf,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACf,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAEf,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAC1C,EAAE,GAAG,IAAI,UAAU,CAAC,EAAE,OAAO,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAE,CAAC,EAAC,EAAE,EAAE,CAAC,EAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AAClE,4BAA4B;AAC5B,8BAA8B;AAC9B,EAAE,GAAG,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAE9B,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACnB,kBAAkB"}

package/main.ts

@@ -0,0 +1,28 @@
+/* main.ts */
+import { Polynomial } from './polynomial.js';
+
+let log:(...x:any[])=>void;
+log = console.log;
+
+let p1:Polynomial;
+let p2:Polynomial;
+let p3:Polynomial;
+let x0:bigint;
+let x1:bigint;
+let x2:bigint;
+let x3:bigint;
+
+x0 = BigInt(1);
+x1 = BigInt(0);
+x2 = BigInt(1);
+x3 = BigInt(0);
+
+p1 = new Polynomial([x0, x1, x2, x3], 2n);
+p2 = new Polynomial({ tobject:0n, x3:1n, x2:0n, x:1n, 1:1n }, 2n);
+// log(p1, " + ", p2, " =");
+// p3 = Polynomial.add(p1,p2);
+p3 = new Polynomial(256n, 2n);
+
+log(p3, p3.eval());
+// log(p3.eval());
+

package/package.json

@@ -0,0 +1,26 @@
+{
+  "name": "finitefields",
+  "type": "module",
+  "version": "0.0.3",
+  "description": "Galois/Finite field crypto and raw elliptic curves",
+  "main": "main.js",
+  "scripts": {
+    "build": "tsc",
+    "start": "node .",
+    "pub": "npm version patch && npm publish"
+  },
+  "keywords": [
+    "galois",
+    "galois fields",
+    "finite fields",
+    "cryptography",
+    "elliptic curves"
+  ],
+  "author": "@dr-Jonas-Birch",
+  "license": "MIT",
+  "dependencies": {
+    "@types/node": "^25.2.2",
+    "@types/typescript": "^2.0.0",
+    "typescript": "^5.9.3"
+  }
+}

package/polynomial.d.ts

@@ -0,0 +1,37 @@
+declare let zip: (xs: bigint[], ys: bigint[]) => zipped;
+type zipitem = {
+    x: bigint;
+    y: bigint;
+};
+type zipped = zipitem[];
+type xs = 'tobject' | '1' | 'x' | 'x2' | 'x3' | 'x4' | 'x5' | 'x6' | 'x7';
+type Polysource = bigint | bigint[] | Tobject;
+type Tobject = {
+    [K in xs]?: bigint;
+};
+interface Ipolynomial {
+    fromarr(src: bigint[]): void;
+    fromobj(src: Tobject): void;
+    fromint(src: bigint): void;
+    verifyorder(order: bigint): boolean;
+    eval(): bigint;
+    constructor: Function;
+}
+declare class Polynomial implements Ipolynomial {
+    private data;
+    private degree;
+    private order;
+    static int2pol(src: bigint): bigint[];
+    static int2pol_(val: bigint, arr: bigint[]): bigint[];
+    static evaluate(src: bigint[], order: bigint): bigint;
+    static evaluate_(src: bigint[], order: bigint, val: bigint): bigint;
+    static add(a: Polynomial, b: Polynomial): Polynomial;
+    constructor(src: Polysource, order: bigint);
+    fromarr(src: bigint[]): void;
+    fromobj(src: Tobject): void;
+    fromint(src: bigint): void;
+    verifyorder(order: bigint): boolean;
+    eval(): bigint;
+}
+export { Polynomial, zip };
+//# sourceMappingURL=polynomial.d.ts.map

package/polynomial.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["polynomial.ts"],"names":[],"mappings":"AAWA,QAAA,IAAI,GAAG,EAAC,CAAC,EAAE,EAAC,MAAM,EAAE,EAAC,EAAE,EAAC,MAAM,EAAE,KAAG,MAAM,CAAC;AAc1C,KAAK,OAAO,GAAG;IAAC,CAAC,EAAC,MAAM,CAAC;IAAA,CAAC,EAAC,MAAM,CAAA;CAAC,CAAC;AACnC,KAAK,MAAM,GAAG,OAAO,EAAE,CAAC;AAExB,KAAK,EAAE,GACD,SAAS,GACT,GAAG,GACH,GAAG,GACH,IAAI,GACJ,IAAI,GACJ,IAAI,GACJ,IAAI,GACJ,IAAI,GACJ,IAAI,CAAC;AAEX,KAAK,UAAU,GACT,MAAM,GACN,MAAM,EAAE,GACR,OAAO,CAAC;AAEd,KAAK,OAAO,GAAG;KACV,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM;CACrB,CAAA;AAED,UAAU,WAAW;IACjB,OAAO,CAAC,GAAG,EAAC,MAAM,EAAE,GAAG,IAAI,CAAC;IAC5B,OAAO,CAAC,GAAG,EAAC,OAAO,GAAG,IAAI,CAAC;IAC3B,OAAO,CAAC,GAAG,EAAC,MAAM,GAAG,IAAI,CAAC;IAC1B,WAAW,CAAC,KAAK,EAAC,MAAM,GAAG,OAAO,CAAC;IACnC,IAAI,IAAI,MAAM,CAAC;IACf,WAAW,EAAE,QAAQ,CAAC;CACzB;AAED,cAAM,UAAW,YAAW,WAAW;IACnC,OAAO,CAAC,IAAI,CAAU;IACtB,OAAO,CAAC,MAAM,CAAQ;IACtB,OAAO,CAAC,KAAK,CAAQ;IAErB,MAAM,CAAC,OAAO,CAAC,GAAG,EAAC,MAAM,GAAG,MAAM,EAAE;IAIpC,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAC,MAAM,EAAE,GAAG,EAAC,MAAM,EAAE,GAAG,MAAM,EAAE;IAenD,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAC,MAAM,EAAE,EAAE,KAAK,EAAC,MAAM,GAAG,MAAM;IAInD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAC,MAAM,EAAE,EAAE,KAAK,EAAC,MAAM,EAAE,GAAG,EAAC,MAAM,GAAG,MAAM;IAmBhE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAC,UAAU,EAAE,CAAC,EAAC,UAAU,GAAG,UAAU;gBAa/B,GAAG,EAAC,UAAU,EAAE,KAAK,EAAC,MAAM;IAmCxC,OAAO,CAAC,GAAG,EAAC,MAAM,EAAE,GAAG,IAAI;IAS3B,OAAO,CAAC,GAAG,EAAC,OAAO,GAAG,IAAI;IAW1B,OAAO,CAAC,GAAG,EAAC,MAAM,GAAG,IAAI;IASzB,WAAW,CAAC,KAAK,EAAC,MAAM,GAAG,OAAO;IAclC,IAAI,IAAI,MAAM;CAGxB;AAED,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC"}

package/polynomial.js

@@ -0,0 +1,129 @@
+/*
+ * polynomial data structure
+ *
+ * finitefields package by @dr-Jonas-Birch
+ *
+ * 2026
+ *
+ */
+let fail;
+let log;
+let zip;
+fail = () => {
+    throw new Error();
+    return void 0;
+};
+zip = (xs, ys) => (xs.length == ys.length) ? xs
+    .map((x, idx) => ({ x, y: (ys[idx] || 0n) })) :
+    fail();
+log = console.log;
+class Polynomial {
+    data;
+    degree;
+    order;
+    static int2pol(src) {
+        return Polynomial.int2pol_(src, []);
+    }
+    static int2pol_(val, arr) {
+        let x;
+        let y;
+        let bit;
+        if (!val)
+            return arr;
+        y = (val >> 1n);
+        bit = (val & 1n);
+        x = new Array(bit, ...arr);
+        return Polynomial.int2pol_(y, x);
+    }
+    static evaluate(src, order) {
+        return Polynomial.evaluate_(src, order, 0n);
+    }
+    static evaluate_(src, order, val) {
+        let x;
+        let y;
+        let z;
+        let arr;
+        if (!src.length)
+            return val;
+        else
+            y = (order * val);
+        arr = new Array(...src);
+        z = arr.shift()
+            || 0n;
+        x = (y + z);
+        return Polynomial.evaluate_(arr, order, x);
+    }
+    static add(a, b) {
+        let z;
+        let p;
+        let arr;
+        z = zip(a.data, b.data);
+        arr = z
+            .map(({ x, y }) => ((x + y) % BigInt(a.order)));
+        return new Polynomial(arr, a.order);
+    }
+    constructor(src, order) {
+        this.data = [];
+        this.degree = 0;
+        if (!src)
+            fail();
+        switch (true) {
+            case src instanceof Array:
+                this.fromarr(src);
+                break;
+            case typeof src === 'bigint':
+                if (order != 2n)
+                    fail();
+                this.fromint(src);
+                break;
+            case ((typeof src !== 'bigint') && ('tobject' in src)):
+                this.fromobj(src);
+                break;
+            default:
+                fail();
+                break;
+        }
+        if (this.verifyorder(order))
+            this.order = order;
+        else
+            fail();
+        return this;
+    }
+    fromarr(src) {
+        if (!src)
+            fail();
+        this.data = src;
+        this.degree = this.data.length;
+        return void 0;
+    }
+    fromobj(src) {
+        if (!src)
+            fail();
+        const { tobject, ...obj } = src;
+        this.data = Object.values(obj);
+        this.degree = this.data.length;
+        return void 0;
+    }
+    fromint(src) {
+        if (!src)
+            fail();
+        this.data = Polynomial.int2pol(src);
+        this.degree = this.data.length;
+        return void 0;
+    }
+    verifyorder(order) {
+        let arr;
+        if (!order)
+            fail();
+        else if (!this.degree)
+            return true;
+        arr = this.data
+            .map((x) => !(x >= order));
+        return arr.every((x) => x);
+    }
+    eval() {
+        return Polynomial.evaluate(this.data, this.order);
+    }
+}
+export { Polynomial, zip };
+//# sourceMappingURL=polynomial.js.map

package/polynomial.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.js","sourceRoot":"","sources":["polynomial.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,IAAI,IAAc,CAAC;AACnB,IAAI,GAAsB,CAAC;AAC3B,IAAI,GAAqC,CAAC;AAE1C,IAAI,GAAG,GAAU,EAAE;IACf,MAAM,IAAI,KAAK,EAAE,CAAC;IAElB,OAAO,KAAK,CAAU,CAAC;AAC3B,CAAC,CAAA;AAED,GAAG,GAAG,CAAC,EAAW,EAAC,EAAW,EAAU,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,IAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;KAChE,GAAG,CAAC,CAAC,CAAQ,EAAC,GAAU,EAAuB,EAAE,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAE,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,EAAE,CAAC;AAEX,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;AAkClB,MAAM,UAAU;IACJ,IAAI,CAAU;IACd,MAAM,CAAQ;IACd,KAAK,CAAQ;IAErB,MAAM,CAAC,OAAO,CAAC,GAAU;QACrB,OAAO,UAAU,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,GAAU,EAAE,GAAY;QACpC,IAAI,CAAU,CAAC;QACf,IAAI,CAAQ,CAAC;QACb,IAAI,GAAU,CAAC;QAEf,IAAI,CAAC,GAAG;YACJ,OAAO,GAAG,CAAC;QAEf,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;QAChB,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACjB,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC;QAE3B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,GAAY,EAAE,KAAY;QACtC,OAAO,UAAU,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,GAAY,EAAE,KAAY,EAAE,GAAU;QACnD,IAAI,CAAQ,CAAC;QACb,IAAI,CAAQ,CAAC;QACb,IAAI,CAAQ,CAAC;QACb,IAAI,GAAY,CAAC;QAEjB,IAAI,CAAC,GAAG,CAAC,MAAM;YACX,OAAO,GAAG,CAAC;;YAEX,CAAC,GAAG,CAAC,KAAK,GAAC,GAAG,CAAC,CAAC;QAEpB,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;QACxB,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE;eACR,EAAE,CAAC;QACV,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAEV,OAAO,UAAU,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAY,EAAE,CAAY;QACjC,IAAI,CAAQ,CAAC;QACb,IAAI,CAAY,CAAC;QACjB,IAAI,GAAY,CAAC;QAEjB,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,GAAG,GAAG,CAAC;aACF,GAAG,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAU,EAAU,EAAE,CAC5B,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEjC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IAED,YAAmB,GAAc,EAAE,KAAY;QAC3C,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAEhB,IAAI,CAAC,GAAG;YACJ,IAAI,EAAE,CAAC;QAEX,QAAQ,IAAI,EAAE,CAAC;YACX,KAAK,GAAG,YAAY,KAAK;gBACrB,IAAI,CAAC,OAAO,CAAC,GAAe,CAAC,CAAC;gBAC9B,MAAM;YAEV,KAAK,OAAO,GAAG,KAAK,QAAQ;gBACxB,IAAI,KAAK,IAAI,EAAE;oBACX,IAAI,EAAE,CAAC;gBACX,IAAI,CAAC,OAAO,CAAC,GAAa,CAAC,CAAC;gBAC5B,MAAM;YAEV,KAAK,CAAC,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,IAAI,CAAC,SAAS,IAAK,GAAe,CAAC,CAAC;gBAC/D,IAAI,CAAC,OAAO,CAAC,GAAc,CAAC,CAAC;gBAC7B,MAAM;YAEV;gBACI,IAAI,EAAE,CAAC;gBACP,MAAM;QACd,CAAC;QAED,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;;YAEnB,IAAI,EAAE,CAAC;QAEX,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,GAAY;QACvB,IAAI,CAAC,GAAG;YACJ,IAAI,EAAE,CAAC;QACX,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAE/B,OAAO,KAAK,CAAC,CAAC;IAClB,CAAC;IAEM,OAAO,CAAC,GAAW;QACtB,IAAI,CAAC,GAAG;YACJ,IAAI,EAAE,CAAC;QAEX,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAE/B,OAAO,KAAK,CAAC,CAAC;IAClB,CAAC;IAEM,OAAO,CAAC,GAAU;QACrB,IAAI,CAAC,GAAG;YACJ,IAAI,EAAE,CAAC;QACX,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAE/B,OAAO,KAAK,CAAC,CAAC;IAClB,CAAC;IAEM,WAAW,CAAC,KAAY;QAC3B,IAAI,GAAa,CAAC;QAElB,IAAI,CAAC,KAAK;YACN,IAAI,EAAE,CAAC;aACN,IAAI,CAAC,IAAI,CAAC,MAAM;YACjB,OAAO,IAAI,CAAC;QAEhB,GAAG,GAAG,IAAI,CAAC,IAAI;aACV,GAAG,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,IAAE,KAAK,CAAC,CAAC,CAAC;QAE7C,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,IAAI;QACP,OAAO,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;CACJ;AAED,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC"}

package/polynomial.ts

@@ -0,0 +1,201 @@
+/*
+ * polynomial data structure
+ *
+ * finitefields package by @dr-Jonas-Birch
+ *
+ * 2026
+ *
+ */
+
+let fail:()=>never;
+let log:(...x:any[])=>void;
+let zip:(xs:bigint[],ys:bigint[])=>zipped;
+
+fail = (): never => {
+    throw new Error();
+
+    return void 0 as never;
+}
+
+zip = (xs:bigint[],ys:bigint[]): zipped => (xs.length==ys.length) ? xs
+     .map((x:bigint,idx:number): {x:bigint,y:bigint} => ({x,y:(ys[idx]||0n)})) :
+    fail();
+
+log = console.log;
+
+type zipitem = {x:bigint,y:bigint};
+type zipped = zipitem[];
+
+type xs =
+    | 'tobject'
+    | '1'
+    | 'x'
+    | 'x2'
+    | 'x3'
+    | 'x4'
+    | 'x5'
+    | 'x6'
+    | 'x7';
+
+type Polysource =
+    | bigint
+    | bigint[]
+    | Tobject;
+
+type Tobject = {
+    [K in xs]?: bigint;
+}
+
+interface Ipolynomial {
+    fromarr(src:bigint[]): void;
+    fromobj(src:Tobject): void;
+    fromint(src:bigint): void;
+    verifyorder(order:bigint): boolean;
+    eval(): bigint;
+    constructor: Function;
+}
+
+class Polynomial implements Ipolynomial {
+    private data:bigint[];
+    private degree:number;
+    private order:bigint;
+
+    static int2pol(src:bigint): bigint[] {
+        return Polynomial.int2pol_(src, []);
+    }
+
+    static int2pol_(val:bigint, arr:bigint[]): bigint[] {
+        let x:bigint[];
+        let y:bigint;
+        let bit:bigint;
+
+        if (!val)
+            return arr;
+
+        y = (val >> 1n);
+        bit = (val & 1n);
+        x = new Array(bit, ...arr);
+
+        return Polynomial.int2pol_(y, x);
+    }
+
+    static evaluate(src:bigint[], order:bigint): bigint {
+        return Polynomial.evaluate_(src, order, 0n);
+    }
+
+    static evaluate_(src:bigint[], order:bigint, val:bigint): bigint {
+        let x:bigint;
+        let y:bigint;
+        let z:bigint;
+        let arr:bigint[];
+
+        if (!src.length)
+            return val;
+        else
+            y = (order*val);
+
+        arr = new Array(...src);
+        z = arr.shift()
+            || 0n;
+        x = (y+z);
+
+        return Polynomial.evaluate_(arr, order, x);
+    }
+
+    static add(a:Polynomial, b:Polynomial): Polynomial {
+        let z:zipped;
+        let p:Polynomial;
+        let arr:bigint[];
+
+        z = zip(a.data, b.data);
+        arr = z
+            .map(({x,y}: zipitem): bigint =>
+                ((x+y)%BigInt(a.order)));
+    
+        return new Polynomial(arr, a.order);
+    }
+
+    public constructor(src:Polysource, order:bigint) {
+        this.data = [];
+        this.degree = 0;
+
+        if (!src)
+            fail();
+
+        switch (true) {
+            case src instanceof Array:
+                this.fromarr(src as bigint[]);
+                break;
+
+            case typeof src === 'bigint':
+                if (order != 2n)
+                    fail();
+                this.fromint(src as bigint);
+                break;
+            
+            case ((typeof src !== 'bigint') && ('tobject' in (src as Tobject))):
+                this.fromobj(src as Tobject);
+                break;
+            
+            default:
+                fail();
+                break;
+        }
+
+        if (this.verifyorder(order))
+            this.order = order;
+        else
+            fail();
+    
+        return this;
+    }
+
+    public fromarr(src:bigint[]): void {
+        if (!src)
+            fail();
+        this.data = src;
+        this.degree = this.data.length;
+
+        return void 0;
+    }
+
+    public fromobj(src:Tobject): void {
+        if (!src)
+            fail();
+
+        const { tobject, ...obj } = src;
+        this.data = Object.values(obj);
+        this.degree = this.data.length;
+
+        return void 0;
+    }
+
+    public fromint(src:bigint): void {
+        if (!src)
+            fail();
+        this.data = Polynomial.int2pol(src);
+        this.degree = this.data.length;
+
+        return void 0;
+    }
+
+    public verifyorder(order:bigint): boolean {
+        let arr:boolean[];
+
+        if (!order)
+            fail();
+        else if (!this.degree)
+            return true;
+
+        arr = this.data
+            .map((x:bigint): boolean => !(x>=order));
+
+        return arr.every((x:boolean):boolean => x);
+    }
+
+    public eval(): bigint {
+        return Polynomial.evaluate(this.data, this.order);
+    }
+}
+
+export { Polynomial, zip };

package/tsconfig.json

@@ -0,0 +1,43 @@
+{
+  // Visit https://aka.ms/tsconfig to read more about this file
+  "compilerOptions": {
+    // File Layout
+    // "rootDir": "./src",
+    // "outDir": "./dist",
+
+    // Environment Settings
+    // See also https://aka.ms/tsconfig/module
+    "module": "nodenext",
+    "target": "esnext",
+    // For nodejs:
+    "lib": ["esnext","dom"],
+    "types": ["node"],
+    // and npm install -D @types/node
+
+    // Other Outputs
+    "sourceMap": true,
+    "declaration": true,
+    "declarationMap": true,
+
+    // Stricter Typechecking Options
+    "noUncheckedIndexedAccess": true,
+    "exactOptionalPropertyTypes": false,
+
+    // Style Options
+    // "noImplicitReturns": true,
+    // "noImplicitOverride": true,
+    // "noUnusedLocals": true,
+    // "noUnusedParameters": true,
+    // "noFallthroughCasesInSwitch": true,
+    // "noPropertyAccessFromIndexSignature": true,
+
+    // Recommended Options
+    "strict": true,
+    "jsx": "react-jsx",
+    "verbatimModuleSyntax": true,
+    "isolatedModules": true,
+    "noUncheckedSideEffectImports": true,
+    "moduleDetection": "force",
+    "skipLibCheck": true,
+  }
+}