functionalscript 0.28.0 → 0.29.1

package/fs/ci/bun/module.f.js

@@ -16,7 +16,7 @@ const installBun = installOnWindowsArm({
 });
 export const bunSteps = (extra) => (v, a) => clean([
     installBun(v)(a),
-    test({ run: 'bun install' }),
+    test({ run: 'bun install --frozen-lockfile' }),
     test({ run: 'bun test --timeout 20000' }),
     ...extra,
 ]);

package/fs/ci/node/module.f.js

@@ -34,10 +34,11 @@ export const nodeVersions = Object.fromEntries(node.others.map(v => [
     `node${major(v)}`,
     ubuntu(nodeSteps(v))
 ]));
+const tsgoName = `@typescript/native-preview@${tsgo}`;
 export const nodeMainSteps = (extra) => nodeTests(node.default)([
     // TypeScript Preview
-    install({ run: `npm install -g @typescript/native-preview@${tsgo}` }),
-    test({ run: 'tsgo' }),
+    install({ run: `npm cache add ${tsgoName}` }),
+    test({ run: `npx npm:${tsgoName}` }),
     // extra
     ...extra,
 ]);

package/fs/emergent_testing/module.f.js

@@ -130,6 +130,8 @@ const runModule = ({ result, test }) => (k, v) => (ts) => {
         .step(delta => pure(mergeState(ts, delta)));
 };
 const { entries } = Object;
+const proofEntries = (moduleMap) => entries(moduleMap)
+    .flatMap(([k, v]) => v.proof !== undefined ? [[k, v.proof]] : []);
 /**
  * Runs all test modules in `moduleMap` whose names pass `isTest`, accumulates
  * pass/fail/time via `reporter`, and returns an exit code (0 = all passed,
@@ -137,8 +139,7 @@ const { entries } = Object;
  */
 export const runModuleMap = (reporter) => (moduleMap) => {
     const { summary } = reporter;
-    const modules = entries(moduleMap)
-        .flatMap(([k, v]) => v.proof !== undefined ? [[k, v.proof]] : []);
+    const modules = proofEntries(moduleMap);
     return all(...modules.map(([k, v]) => runModule(reporter)(k, v)(zero)))
         .step(m => pure(m.reduce(mergeState, zero)))
         .step(ts => summary(ts.pass, ts.fail, ts.time)
@@ -155,8 +156,7 @@ export const testAll = (reporter) => options => loadModuleMap(options.env).step(
  * `ctx`. Delegates to `registerModule` for each matching entry.
  */
 const registerModuleMap = (ctx, star) => (moduleMap) => {
-    const modules = entries(moduleMap)
-        .flatMap(([k, v]) => v.proof !== undefined ? [[k, v.proof]] : []);
+    const modules = proofEntries(moduleMap);
     if (modules.length === 0) {
         return pure(undefined);
     }

package/fs/text/ascii/proof.f.d.ts

@@ -1,3 +1,4 @@
 export declare const proof: {
     range: () => void;
+    oneThrowsOnEmpty: () => void;
 };

package/fs/text/ascii/proof.f.js

@@ -1,4 +1,4 @@
-import { range } from "./module.f.js";
+import { one, range } from "./module.f.js";
 import { stringify as jsonStringify } from "../../json/module.f.js";
 import { sort } from "../../types/object/module.f.js";
 const stringify = jsonStringify(sort);
@@ -8,5 +8,17 @@ export const proof = {
         if (r !== '[65,65]') {
             throw r;
         }
-    }
+    },
+    oneThrowsOnEmpty: () => {
+        let threw = false;
+        try {
+            one('');
+        }
+        catch (_) {
+            threw = true;
+        }
+        if (!threw) {
+            throw 'expected throw';
+        }
+    },
 };

package/fs/types/prime_field/module.f.d.ts

@@ -26,7 +26,13 @@ export type PrimeField = {
     readonly pow3: Unary;
     /** Reduces an arbitrary `bigint` into `[0, p)`. */
     readonly reduce: Unary;
-    /** Euler criterion: `true` when `x` is a quadratic residue mod `p`. */
+    /**
+     * `true` when `x` is a square modulo `p`, including `0`.
+     *
+     * Nonzero values are tested with Euler's criterion:
+     * `x^((p - 1) / 2) === 1 (mod p)`.
+     * For `p === 2n`, both field elements are squares.
+     */
     readonly quadRes: (x: bigint) => boolean;
 };
 /**

package/fs/types/prime_field/module.f.js

@@ -42,12 +42,19 @@ export const prime_field = (p) => {
         const r = x % p;
         return r < 0n ? add(p)(r) : r;
     };
-    const half = (p - 1n) / 2n;
-    const quadRes = (x) => pow(half)(reduce(x)) === 1n;
+    const max = p - 1n;
+    // Euler's exponent is `(p - 1) / 2`; use `max`, not `p`, so `p === 2n`
+    // gives exponent `0n` instead of `1n`.
+    // 0 is a square mod p; Euler's criterion needs a separate case because 0^e = 0.
+    const powHalf = pow(max >> 1n);
+    const quadRes = (x) => {
+        const v = reduce(x);
+        return v === 0n || powHalf(v) === 1n;
+    };
     return {
         p,
         middle,
-        max: p - 1n,
+        max,
         neg: a => a === 0n ? 0n : p - a,
         sub,
         add,

package/fs/types/prime_field/proof.f.js

@@ -153,12 +153,25 @@ export const proof = {
                 }
             },
             quadRes: () => {
+                if (!f.quadRes(0n)) {
+                    throw 0n;
+                }
                 if (!f.quadRes(1n)) {
                     throw 1n;
                 }
+                if (!f.quadRes(p)) {
+                    throw p;
+                }
                 if (f.quadRes(3n)) {
                     throw 3n;
                 }
+                const f2 = prime_field(2n);
+                if (!f2.quadRes(0n)) {
+                    throw '0 mod 2';
+                }
+                if (!f2.quadRes(1n)) {
+                    throw '1 mod 2';
+                }
             },
             modSqrt: () => {
                 const root = modSqrt(f);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "functionalscript",
-  "version": "0.28.0",
+  "version": "0.29.1",
   "type": "module",
   "files": [
     "**/*.js",
@@ -13,12 +13,12 @@
     "cov": "node --test --experimental-test-coverage --test-coverage-include=**/module.f.ts",
     "start": "node ./fs/fjs/module.ts",
     "ci-update": "node ./fs/fjs/module.ts ci",
-    "update": "npx npm-check-updates -u && npm install && deno install && npm run ci-update",
+    "update": "npx npm-check-updates -u && npm install && deno install && bun install && npm run ci-update",
     "index-html": "node ./fs/fjs/module.ts r ./fs/website/module.f.ts",
-    "website": "npm run prepack &&npm run index-html"
+    "website": "npm run prepack && npm run index-html"
   },
   "engines": {
-    "node": ">=24"
+    "node": ">=22"
   },
   "bin": {
     "fjs": "fs/fjs/module.js"