finitefields 0.0.3 → 0.0.4

package/README.md

@@ -0,0 +1,4 @@
+## finitefields
+
+Polynomials, Galois fields and Elliptic curves - in JS
+

package/galois.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"galois.d.ts","sourceRoot":"","sources":["galois.ts"],"names":[],"mappings":"AAWA,QAAA,IAAI,IAAI,EAAC,KAAK,CAAC;AAwFf,UAAU,OAAO;IACb,MAAM,EAAC,MAAI,IAAI,CAAC;IAChB,WAAW,EAAC,QAAQ,CAAC;CACxB;AAED,UAAU,KAAK;IACX,OAAO,EAAE,CAAC,CAAC,EAAC,MAAM,EAAC,MAAM,CAAC,EAAC,MAAM,EAAC,CAAC,CAAC,EAAC,MAAM,KAAG,OAAO,CAAC;IACtD,SAAS,EAAE,CAAC,CAAC,EAAC,MAAM,KAAG,MAAM,CAAC;IAC9B,GAAG,EAAE,CAAC,MAAM,EAAC,MAAM,EAAC,GAAG,EAAC,MAAM,KAAG,MAAM,CAAC;CAC3C;AAED,cAAM,EAAG,YAAW,OAAO;IACvB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,GAAG,CAA8B;IACzC,OAAO,CAAC,GAAG,CAAkB;IAC7B,OAAO,CAAC,GAAG,CAAkB;IAC7B,OAAO,CAAC,GAAG,CAAkB;IAEtB,MAAM,IAAI,IAAI;gBAST,KAAK,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM;CAazC;AAED,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC"}

package/galois.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"galois.js","sourceRoot":"","sources":["galois.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,IAAI,GAAsB,CAAC;AAC3B,IAAI,IAAwB,CAAC;AAC7B,IAAI,IAAU,CAAC;AAEf,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;AAClB,IAAI,GAAG,CAAC,GAAG,IAAU,EAAS,EAAE;IAC5B,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;IACvB,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAEjC,OAAO,KAAK,CAAU,CAAC;AAC3B,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,CAAQ,EAAC,EAAW,EAAE,EAAE,CACzC,CAAC,EAAE,IAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACb,CAAC,CAAQ,EAAC,CAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IACxC,CAAC,EAAE,IAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACb,CAAC,CAAQ,EAAC,CAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACxC,CAAC,EAAE,IAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,CAAC,CAAQ,EAAC,CAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;YACxC,CAAC,EAAE,IAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;gBACb,CAAC,CAAQ,EAAC,CAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAA,CAAC,CAAA,IAAI,EAAE,CAAC,CAAC;gBACjD,IAAI,EAAE,CAAC;AAGf,IAAI,GAAG;IACH,SAAS,CAAC,CAAQ;QACd,IAAI,CAAQ,CAAC;QACb,IAAI,CAAQ,CAAC;QAEb,KAAK,CAAC,GAAC,EAAE,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAG,EAAE,EAAE,CAAC,EAAE;YAAC,CAAC;QAEhC,OAAO,CAAC,CAAC;IACb,CAAC;IAED,OAAO,CAAC,CAAQ,EAAE,SAAc,IAAI,EAAE,IAAS,EAAE;QAC7C,IAAI,CAAQ,CAAC;QACb,IAAI,CAAQ,CAAC;QACb,IAAI,GAAW,CAAC;QAEhB,IAAI,CAAC,GAAC,EAAE;YACJ,OAAO,IAAI,CAAC;QAEhB,KAAK,CAAC,GAAC,CAAC,EAAE,GAAG,GAAC,IAAI,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC,IAAI,EAAE,CAAC;YACR,IAAI,CAAC,CAAC,CAAC,IAAE,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACxB,GAAG,GAAG,KAAK,CAAC;gBACZ,MAAM;YACV,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED,GAAG,CAAC,MAAa,EAAE,MAAW,EAAE;QAC5B,IAAI,IAAgC,CAAC;QACrC,IAAI,KAAgB,CAAC;QACrB,IAAI,GAAU,CAAC;QAEf,KAAK,GAAG,GAAW,EAAE,CACjB,MAAM,CACF,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAC,iBAAiB,CAAC,CAAC,CAChD,CAAC;QAEN,IAAI,GAAG,CAAC,CAAQ,EAAC,CAAQ,EAAU,EAAE;YACjC,IAAI,CAAC,GAAG,CAAC;gBACL,OAAO,CAAC,CAAC;;gBAET,OAAO,IAAI,CAAC,CAAC,CAAC,IAAE,GAAG,CAAC,EAChB,CAAC,CAAC,CAAC,IAAE,GAAG,CAAC;sBACP,KAAK,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC,CAAA;QAED,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,KAAG,EAAE,CAAC,GAAC,MAAM;YAAC,CAAC;QAExC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAC,GAAG,CAAC;YAChB,OAAO,CAAC,GAAG,GAAC,GAAG,CAAC,CAAC;;YAEjB,OAAO,GAAG,CAAC;IACnB,CAAC;CACJ,CAAA;AAED,IAAK,QAKJ;AALD,WAAK,QAAQ;IACT,uCAAI,CAAA;IACJ,uCAAI,CAAA;IACJ,uCAAI,CAAA;IACJ,uCAAI,CAAA;AACR,CAAC,EALI,QAAQ,KAAR,QAAQ,QAKZ;AAaD,MAAM,EAAE;IACI,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,GAAG,CAA8B;IACjC,GAAG,CAAkB;IACrB,GAAG,CAAkB;IACrB,GAAG,CAAkB;IAEtB,MAAM;QACT,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;YAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,mBAAmB,CAAC,CAAC;aAC9C,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM;YAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,yBAAyB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAEtE,OAAO,KAAK,CAAC,CAAC;IAClB,CAAC;IAED,YAAY,KAAY,EAAC,MAAa;QAClC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QAEpD,OAAO,IAAI,CAAC;IAChB,CAAC;CAEJ;AAED,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC"}

package/galois.ts

@@ -0,0 +1,143 @@
+/*
+ * galois fields
+ *
+ * finitefields package by @dr-Jonas-Birch
+ *
+ * 2026
+ *
+ */
+
+let log:(...x:any[])=>void;
+let fail:(...x:any[])=>never;
+let Util:Iutil;
+
+log = console.log;
+fail = (...args:any[]): never => {
+    console.error(...args);
+    throw new Error(args.toString());
+
+    return void 0 as never;
+}
+
+const arithmetics = (p:bigint,op:fieldops) =>
+    (op==fieldops.$add) ?
+            (a:bigint,b:bigint) => (a+b)%p :
+    (op==fieldops.$sub) ?
+            (a:bigint,b:bigint) => (a-b)%p :
+    (op==fieldops.$mul) ?
+            (a:bigint,b:bigint) => (a*b)%p :
+    (op==fieldops.$div) ?
+            (a:bigint,b:bigint) => (b%p)?(a/b)%p:fail() :
+        fail();
+
+
+Util = {
+    countbits(x:bigint): bigint {
+        let n:bigint;
+        let y:bigint;
+
+        for (n=0n, y=x; y; y>>=1n, n++);
+
+        return n;
+    },
+
+    isprime(p:bigint, bitlen:bigint=256n, s:number=12): boolean {
+        let n:number;
+        let r:bigint;
+        let ret:boolean;
+
+        if (p<2n)
+            return true;
+
+        for (n=0, ret=true; n<s; n++) {
+            r = this.rnd(bitlen,(p-1n));
+            r += 1n;
+            if (((r**(p-1n))%p) != 1n) {
+                ret = false;
+                break;
+            }
+        }
+
+        return ret;
+    },
+
+    rnd(bitlen:bigint, max:bigint=0n): bigint {
+        let rnd_:(b:bigint,n:bigint)=>bigint;
+        let mkrnd:()=>bigint;
+        let val:bigint;
+
+        mkrnd = (): bigint =>
+            BigInt(
+                (Math.floor(Math.random()*10000000000000000))
+            );
+
+        rnd_ = (b:bigint,n:bigint): bigint => {
+            if (b < 1)
+                return n;
+            else
+                return rnd_((b-=58n),
+                    ((n<<58n)
+                     |mkrnd()));
+        }
+
+        val = rnd_(bitlen, mkrnd());
+        while (this.countbits(val>>=1n)>bitlen);
+
+        if (max && (val>max))
+            return (val%max);
+        else
+            return val;
+    }
+}
+
+enum fieldops {
+    $add,
+    $sub,
+    $mul,
+    $div
+}
+
+interface Igalois {
+    verify:()=>void;
+    constructor:Function;
+}
+
+interface Iutil {
+    isprime: (p:bigint,bitlen?:bigint,s?:number)=>boolean;
+    countbits: (x:bigint)=>bigint;
+    rnd: (bitlen:bigint,max:bigint)=>bigint;
+}
+
+class GF implements Igalois {
+    private modulus: bigint;
+    private bitlen: bigint;
+    private add: (a:bigint,b:bigint)=>bigint;
+    private sub: typeof this.add;
+    private mul: typeof this.add;
+    private div: typeof this.add;
+
+    public verify(): void {
+        if (!Util.isprime(this.modulus))
+            return fail(this.modulus, 'needs to be prime');
+        else if (Util.countbits(this.modulus) > this.bitlen)
+            return fail(this.modulus, 'does not fit in bitlen:', this.bitlen);
+
+        return void 0;
+    }
+
+    constructor(field:bigint,bitlen:bigint) {
+        this.modulus = field;
+        this.bitlen = bitlen;
+        this.verify();
+
+        this.add = arithmetics(this.modulus, fieldops.$add);
+        this.sub = arithmetics(this.modulus, fieldops.$sub);
+        this.mul = arithmetics(this.modulus, fieldops.$mul);
+        this.div = arithmetics(this.modulus, fieldops.$div);
+
+        return this;
+    }
+
+}
+
+export { Util, GF };

package/main.js

@@ -17,7 +17,7 @@ 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);
+p3 = new Polynomial(1n << 254n, 2n);
 log(p3, p3.eval());
 // log(p3.eval());
 //# sourceMappingURL=main.js.map

package/main.js.map

@@ -1 +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"}
+{"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,EAAE,IAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AAElC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACnB,kBAAkB"}

package/main.ts

@@ -21,7 +21,7 @@ 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);
+p3 = new Polynomial(1n<<254n, 2n);
 
 log(p3, p3.eval());
 // log(p3.eval());

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "finitefields",
   "type": "module",
-  "version": "0.0.3",
+  "version": "0.0.4",
   "description": "Galois/Finite field crypto and raw elliptic curves",
   "main": "main.js",
   "scripts": {

package/.lesshst

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

package/.viminfo

@@ -1,112 +0,0 @@
-# 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

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

package/main.d.ts

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

package/polynomial.d.ts

@@ -1,37 +0,0 @@
-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.js

@@ -1,129 +0,0 @@
-/*
- * 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