subtlepq 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,50 @@
+# pqfill
+
+Post-quantum polyfill for the Web Cryptography API: ML-KEM (FIPS 203) and ML-DSA (FIPS 204) per the [WICG Modern Algorithms draft](https://wicg.github.io/webcrypto-modern-algos/), with native delegation where the platform already supports it.
+
+**Status: P1 — engine + core JS layer.** Raw key formats only (`raw-public`, `raw-seed`); spki/pkcs8/jwk, wrapKey, and DHKEM are on the way.
+
+## Use
+
+Ponyfill (no globals touched):
+
+```js
+import { subtle } from "pqfill";
+
+const { publicKey, privateKey } = await subtle.generateKey("ML-KEM-768", false,
+    ["encapsulateKey", "decapsulateKey"]);
+const { sharedKey, ciphertext } = await subtle.encapsulateKey("ML-KEM-768", publicKey,
+    { name: "AES-GCM", length: 256 }, false, ["encrypt"]);
+// sharedKey is a genuine native CryptoKey; all downstream crypto is native
+```
+
+True polyfill (patches `crypto.subtle`, delegates everything non-ML to the platform, self-retires where native support exists):
+
+```js
+import { install } from "pqfill";
+install();
+const kp = await crypto.subtle.generateKey("ML-DSA-65", false, ["sign", "verify"]);
+const sig = await crypto.subtle.sign({ name: "ML-DSA-65", context: ctx }, kp.privateKey, data);
+```
+
+Known limits (inherent to a script polyfill, made loud rather than silent): ML-* keys are not structured-cloneable — `postMessage`/IndexedDB throws `DataCloneError`; export the 32–64-byte seed and re-import instead. Key material lives in wasm linear memory: `extractable: false` is API-level enforcement, not platform isolation.
+
+## Engine
+
+`wasm/` builds a minimal [liboqs](https://github.com/open-quantum-safe/liboqs) (pinned submodule, ML-KEM + ML-DSA only) plus a thin shim (`pqfill_engine.c`) to WebAssembly:
+
+```
+git submodule update --init
+wasm/build.sh          # needs emsdk; override location with EMSDK=...
+npm test
+```
+
+Outputs `wasm/dist/pqfill-engine.mjs` (+ `.wasm` sidecar, CSP-clean) and `pqfill-engine.single.mjs` (self-contained, requires `'wasm-unsafe-eval'` under strict CSP). 75 KB wasm covers all six parameter sets.
+
+Seeded operations liboqs does not expose publicly (ML-DSA keygen from seed, KAT-deterministic encapsulation/signing) use a bracketed RNG-playback override — the same technique liboqs' own ACVP tests use.
+
+Tests run NIST ACVP known-answer vectors (subset, see `test/vectors/acvp-subset.json`) for all six parameter sets, plus roundtrip, implicit-rejection, context, and polyfill-routing checks.
+
+## License
+
+Apache-2.0, (c) 2026 VESvault Corp.

package/package.json

@@ -0,0 +1,37 @@
+{
+    "name": "subtlepq",
+    "version": "0.1.0",
+    "description": "Post-quantum polyfill for the Web Cryptography API: ML-KEM (FIPS 203) and ML-DSA (FIPS 204) per the WICG Modern Algorithms draft, with native delegation",
+    "type": "module",
+    "license": "Apache-2.0",
+    "author": "VESvault Corp",
+    "repository": {
+        "type": "git",
+        "url": "git+https://github.com/vesvault/pqfill.git"
+    },
+    "homepage": "https://github.com/vesvault/pqfill#readme",
+    "bugs": {
+        "url": "https://github.com/vesvault/pqfill/issues"
+    },
+    "engines": {
+        "node": ">=18"
+    },
+    "sideEffects": false,
+    "files": [
+        "src",
+        "wasm/dist"
+    ],
+    "exports": {
+        ".": "./src/index.js",
+        "./install": "./src/install.js"
+    },
+    "scripts": {
+        "build": "wasm/build.sh",
+        "test": "node test/engine-test.mjs && node test/polyfill-test.mjs"
+    },
+    "keywords": [
+        "ml-kem", "ml-dsa", "webcrypto", "polyfill", "post-quantum",
+        "fips203", "fips204", "kyber", "dilithium", "subtlecrypto",
+        "encapsulation", "kem"
+    ]
+}

package/src/algorithms.js

@@ -0,0 +1,35 @@
+/***************************************************************************
+ * pqfill: algorithm registry and AlgorithmIdentifier normalization
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ ***************************************************************************/
+
+const NAMES = [
+    "ML-KEM-512", "ML-KEM-768", "ML-KEM-1024",
+    "ML-DSA-44", "ML-DSA-65", "ML-DSA-87",
+];
+
+export const KEM_PUB_USAGES = ["encapsulateBits", "encapsulateKey"];
+export const KEM_PRIV_USAGES = ["decapsulateBits", "decapsulateKey"];
+
+/* WebCrypto algorithm names are matched case-insensitively.
+ * Returns { name, kind, context? } with the canonical name, or null. */
+export function normalizeAlg(alg) {
+    let name, context;
+    if (typeof alg === "string") {
+        name = alg;
+    } else if (alg && typeof alg.name === "string") {
+        name = alg.name;
+        context = alg.context;
+    } else {
+        return null;
+    }
+    const canonical = NAMES.find((n) => n.toLowerCase() === name.toLowerCase());
+    if (!canonical) return null;
+    return {
+        name: canonical,
+        kind: canonical.startsWith("ML-KEM") ? "kem" : "sig",
+        context,
+    };
+}

package/src/engine.js

@@ -0,0 +1,160 @@
+/***************************************************************************
+ * pqfill: lazy wasm engine loader + typed wrappers over pqfill_engine.c
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * All byte outputs are fresh Uint8Array copies; secret material in wasm
+ * linear memory is zeroed before the temporary allocations are freed.
+ ***************************************************************************/
+
+import * as E from "./errors.js";
+
+let enginePromise = null;
+
+export function getEngine() {
+    if (!enginePromise) enginePromise = load();
+    return enginePromise;
+}
+
+async function load() {
+    const { default: init } = await import("../wasm/dist/pqfill-engine.mjs");
+    return new Engine(await init());
+}
+
+class Engine {
+    constructor(M) {
+        this.M = M;
+        this.lens = new Map();
+    }
+
+    put(bytes) {
+        const p = this.M._malloc(bytes.length);
+        this.M.HEAPU8.set(bytes, p);
+        return p;
+    }
+    str(s) {
+        return this.put(new TextEncoder().encode(s + "\0"));
+    }
+    take(p, n) {
+        return this.M.HEAPU8.slice(p, p + n);
+    }
+    wipe(p, n) {
+        this.M.HEAPU8.fill(0, p, p + n);
+    }
+    drop(...ps) {
+        for (const p of ps) this.M._free(p);
+    }
+    u32(p) {
+        return new DataView(this.M.HEAPU8.buffer, p, 4).getUint32(0, true);
+    }
+    setU32(p, v) {
+        new DataView(this.M.HEAPU8.buffer, p, 4).setUint32(0, v, true);
+    }
+
+    kemLengths(name) {
+        let L = this.lens.get(name);
+        if (!L) {
+            const a = this.str(name), o = this.M._malloc(20);
+            const rc = this.M._pqf_kem_lengths(a, o);
+            if (rc === 0) {
+                L = { pk: this.u32(o), sk: this.u32(o + 4), ct: this.u32(o + 8),
+                      ss: this.u32(o + 12), seed: this.u32(o + 16) };
+                this.lens.set(name, L);
+            }
+            this.drop(a, o);
+            if (!L) throw E.notSupported("unknown KEM algorithm " + name);
+        }
+        return L;
+    }
+
+    sigLengths(name) {
+        let L = this.lens.get(name);
+        if (!L) {
+            const a = this.str(name), o = this.M._malloc(12);
+            const rc = this.M._pqf_sig_lengths(a, o);
+            if (rc === 0) {
+                L = { pk: this.u32(o), sk: this.u32(o + 4), sig: this.u32(o + 8), seed: 32 };
+                this.lens.set(name, L);
+            }
+            this.drop(a, o);
+            if (!L) throw E.notSupported("unknown signature algorithm " + name);
+        }
+        return L;
+    }
+
+    kemKeypairDerand(name, seed) {
+        const L = this.kemLengths(name);
+        const a = this.str(name), s = this.put(seed);
+        const pk = this.M._malloc(L.pk), sk = this.M._malloc(L.sk);
+        const rc = this.M._pqf_kem_keypair_derand(a, s, pk, sk);
+        const out = rc === 0 ? { pub: this.take(pk, L.pk), sk: this.take(sk, L.sk) } : null;
+        this.wipe(s, seed.length);
+        this.wipe(sk, L.sk);
+        this.drop(a, s, pk, sk);
+        if (!out) throw E.opError(name + " key generation failed");
+        return out;
+    }
+
+    kemEncaps(name, pub) {
+        const L = this.kemLengths(name);
+        const a = this.str(name), p = this.put(pub);
+        const ct = this.M._malloc(L.ct), ss = this.M._malloc(L.ss);
+        const rc = this.M._pqf_kem_encaps(a, p, ct, ss);
+        const out = rc === 0 ? { ct: this.take(ct, L.ct), ss: this.take(ss, L.ss) } : null;
+        this.wipe(ss, L.ss);
+        this.drop(a, p, ct, ss);
+        if (!out) throw E.opError(name + " encapsulation failed");
+        return out;
+    }
+
+    kemDecaps(name, sk, ct) {
+        const L = this.kemLengths(name);
+        const a = this.str(name), k = this.put(sk), c = this.put(ct);
+        const ss = this.M._malloc(L.ss);
+        const rc = this.M._pqf_kem_decaps(a, k, c, ss);
+        const out = rc === 0 ? this.take(ss, L.ss) : null;
+        this.wipe(k, sk.length);
+        this.wipe(ss, L.ss);
+        this.drop(a, k, c, ss);
+        if (!out) throw E.opError(name + " decapsulation failed");
+        return out;
+    }
+
+    sigKeypairDerand(name, seed) {
+        const L = this.sigLengths(name);
+        const a = this.str(name), s = this.put(seed);
+        const pk = this.M._malloc(L.pk), sk = this.M._malloc(L.sk);
+        const rc = this.M._pqf_sig_keypair_derand(a, s, seed.length, pk, sk);
+        const out = rc === 0 ? { pub: this.take(pk, L.pk), sk: this.take(sk, L.sk) } : null;
+        this.wipe(s, seed.length);
+        this.wipe(sk, L.sk);
+        this.drop(a, s, pk, sk);
+        if (!out) throw E.opError(name + " key generation failed");
+        return out;
+    }
+
+    sigSign(name, sk, msg, ctx) {
+        const L = this.sigLengths(name);
+        const a = this.str(name), k = this.put(sk);
+        const m = this.put(msg), c = this.put(ctx.length ? ctx : new Uint8Array(1));
+        const sig = this.M._malloc(L.sig), slp = this.M._malloc(4);
+        this.setU32(slp, L.sig);
+        const rc = this.M._pqf_sig_sign(a, k, m, msg.length, c, ctx.length, sig, slp);
+        const out = rc === 0 ? this.take(sig, this.u32(slp)) : null;
+        this.wipe(k, sk.length);
+        this.drop(a, k, m, c, sig, slp);
+        if (!out) throw E.opError(name + " signing failed");
+        return out;
+    }
+
+    sigVerify(name, pub, msg, ctx, sig) {
+        const a = this.str(name), p = this.put(pub);
+        const m = this.put(msg), c = this.put(ctx.length ? ctx : new Uint8Array(1));
+        const s = this.put(sig);
+        const rc = this.M._pqf_sig_verify(a, p, m, msg.length, c, ctx.length, s, sig.length);
+        this.drop(a, p, m, c, s);
+        if (rc < 0) throw E.opError(name + " verification failed");
+        return rc === 0;
+    }
+}

package/src/errors.js

@@ -0,0 +1,14 @@
+/***************************************************************************
+ * pqfill: DOMException helpers with WebCrypto-mandated error names
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ ***************************************************************************/
+
+const err = (name, message) => new DOMException(message, name);
+
+export const notSupported = (m) => err("NotSupportedError", m);
+export const invalidAccess = (m) => err("InvalidAccessError", m);
+export const dataError = (m) => err("DataError", m);
+export const opError = (m) => err("OperationError", m);
+export const syntaxError = (m) => err("SyntaxError", m);

package/src/index.js

@@ -0,0 +1,46 @@
+/***************************************************************************
+ * pqfill: post-quantum polyfill for the Web Cryptography API
+ * ML-KEM (FIPS 203) + ML-DSA (FIPS 204) per the WICG Modern Algorithms
+ * draft, with native delegation.
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * Default import is a ponyfill: `subtle` mirrors crypto.subtle plus the
+ * WICG methods, handling ML-* here and delegating everything else to the
+ * platform. No globals are touched unless install() is called.
+ ***************************************************************************/
+
+import * as ours from "./subtle.js";
+import { ROUTES } from "./router.js";
+import * as E from "./errors.js";
+
+export { install, uninstall } from "./install.js";
+export { supports } from "./subtle.js";
+
+const routedFns = {};
+function routed(op) {
+    if (!routedFns[op]) {
+        routedFns[op] = function (...args) {
+            if (ROUTES[op](args)) return ours[op](...args);
+            const ns = globalThis.crypto && globalThis.crypto.subtle;
+            if (ns && typeof ns[op] === "function") return ns[op](...args);
+            return Promise.reject(E.notSupported(op + " is not supported"));
+        };
+        Object.defineProperty(routedFns[op], "name", { value: op });
+    }
+    return routedFns[op];
+}
+
+export const subtle = new Proxy(Object.create(null), {
+    get(_, prop) {
+        if (typeof prop === "string" && ROUTES[prop]) return routed(prop);
+        const ns = globalThis.crypto && globalThis.crypto.subtle;
+        const v = ns && ns[prop];
+        return typeof v === "function" ? v.bind(ns) : v;
+    },
+    has(_, prop) {
+        const ns = globalThis.crypto && globalThis.crypto.subtle;
+        return (typeof prop === "string" && !!ROUTES[prop]) || (ns ? prop in ns : false);
+    },
+});

package/src/install.js

@@ -0,0 +1,81 @@
+/***************************************************************************
+ * pqfill: true-polyfill installer -- patches globalThis.crypto.subtle
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * install() wraps SubtleCrypto.prototype methods so ML-* algorithms and
+ * pqfill keys are handled here while every other call reaches the saved
+ * native original with untouched arguments. Methods and algorithms the
+ * platform already supports natively are left alone (self-retiring).
+ * uninstall() restores the originals.
+ ***************************************************************************/
+
+import * as ours from "./subtle.js";
+import { ROUTES } from "./router.js";
+import * as E from "./errors.js";
+
+let saved = null;
+
+function nativeSupports(ctor, operation, algorithm) {
+    try {
+        return typeof ctor.supports === "function" &&
+            ctor.supports(operation, algorithm) === true;
+    } catch {
+        return false;
+    }
+}
+
+export function install() {
+    if (saved) return;
+    const subtle = globalThis.crypto && globalThis.crypto.subtle;
+    if (!subtle) {
+        throw new Error("pqfill: crypto.subtle is unavailable (insecure context?)");
+    }
+    const proto = Object.getPrototypeOf(subtle);
+    const ctor = subtle.constructor;
+    saved = { proto, ctor, methods: {}, supports: Object.getOwnPropertyDescriptor(ctor, "supports") };
+
+    /* nothing to do on platforms that already do ML-KEM + ML-DSA natively */
+    if (nativeSupports(ctor, "encapsulateBits", "ML-KEM-768") &&
+        nativeSupports(ctor, "sign", "ML-DSA-65")) {
+        return;
+    }
+
+    for (const [op, isOurs] of Object.entries(ROUTES)) {
+        const orig = proto[op];
+        saved.methods[op] = Object.getOwnPropertyDescriptor(proto, op);
+        const wrapped = async function (...args) {
+            if (isOurs(args)) return ours[op](...args);
+            if (typeof orig === "function") return orig.apply(this, args);
+            throw E.notSupported(op + " is not supported");
+        };
+        Object.defineProperty(wrapped, "name", { value: op });
+        Object.defineProperty(proto, op, {
+            value: wrapped, writable: true, configurable: true,
+        });
+    }
+
+    const origSupports = ctor.supports;
+    const supports = function (operation, algorithm, ...rest) {
+        if (ours.supports(operation, algorithm)) return true;
+        if (typeof origSupports === "function") {
+            return origSupports.call(this, operation, algorithm, ...rest);
+        }
+        return false;
+    };
+    Object.defineProperty(ctor, "supports", {
+        value: supports, writable: true, configurable: true,
+    });
+}
+
+export function uninstall() {
+    if (!saved) return;
+    for (const [op, desc] of Object.entries(saved.methods)) {
+        if (desc) Object.defineProperty(saved.proto, op, desc);
+        else delete saved.proto[op];
+    }
+    if (saved.supports) Object.defineProperty(saved.ctor, "supports", saved.supports);
+    else delete saved.ctor.supports;
+    saved = null;
+}

package/src/keystore.js

@@ -0,0 +1,47 @@
+/***************************************************************************
+ * pqfill: forged CryptoKey factory + private key-material store
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * Keys are Object.create(CryptoKey.prototype) with own data properties, so
+ * they pass instanceof and structural checks. Key material never lives on
+ * the key object: it is held in a closure-scoped WeakMap, which doubles as
+ * the "is this key ours" dispatch test.
+ *
+ * Forged keys cannot survive structured clone (postMessage/IndexedDB) --
+ * the material would not travel. Left alone they would clone SILENTLY
+ * into a dead plain object, so each key carries an enumerable
+ * symbol-valued marker property: symbols are not serializable, making
+ * every clone attempt fail loudly with DataCloneError instead.
+ ***************************************************************************/
+
+const store = new WeakMap();
+
+const KeyProto =
+    typeof CryptoKey !== "undefined" ? CryptoKey.prototype : Object.prototype;
+
+/* material: { pub: Uint8Array, seed?: Uint8Array, sk?: Uint8Array } */
+export function forgeKey(type, algName, extractable, usages, material) {
+    const key = Object.create(KeyProto);
+    Object.defineProperties(key, {
+        type: { value: type, enumerable: true },
+        extractable: { value: !!extractable, enumerable: true },
+        algorithm: { value: Object.freeze({ name: algName }), enumerable: true },
+        usages: { value: Object.freeze([...usages]), enumerable: true },
+        __pqfill: {
+            value: Symbol("pqfill key: not structured-cloneable; export and re-import instead"),
+            enumerable: true,
+        },
+    });
+    store.set(key, material);
+    return key;
+}
+
+export function materialOf(key) {
+    return store.get(key);
+}
+
+export function isOurKey(key) {
+    return typeof key === "object" && key !== null && store.has(key);
+}

package/src/router.js

@@ -0,0 +1,32 @@
+/***************************************************************************
+ * pqfill: dispatch rules shared by the ponyfill (index.js) and the
+ * polyfill installer (install.js)
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * Key provenance beats algorithm name: a key forged by this polyfill is
+ * always handled here; otherwise an ML-* algorithm name routes here and
+ * everything else goes to the platform untouched.
+ ***************************************************************************/
+
+import { normalizeAlg } from "./algorithms.js";
+import { isOurKey } from "./keystore.js";
+
+const ours = (alg) => !!normalizeAlg(alg);
+
+/* args => should pqfill handle this call? -- keyed by SubtleCrypto method */
+export const ROUTES = {
+    /* wrapped existing methods */
+    generateKey: (args) => ours(args[0]),
+    importKey: (args) => ours(args[2]),
+    exportKey: (args) => isOurKey(args[1]),
+    sign: (args) => isOurKey(args[1]) || ours(args[0]),
+    verify: (args) => isOurKey(args[1]) || ours(args[0]),
+    /* methods added by the WICG draft */
+    encapsulateBits: (args) => ours(args[0]) || isOurKey(args[1]),
+    encapsulateKey: (args) => ours(args[0]) || isOurKey(args[1]),
+    decapsulateBits: (args) => ours(args[0]) || isOurKey(args[1]),
+    decapsulateKey: (args) => ours(args[0]) || isOurKey(args[1]),
+    getPublicKey: (args) => isOurKey(args[0]),
+};

package/src/subtle.js

@@ -0,0 +1,230 @@
+/***************************************************************************
+ * pqfill: spec-shaped ML-KEM / ML-DSA operations
+ * per https://wicg.github.io/webcrypto-modern-algos/
+ *
+ * (c) 2026 VESvault Corp
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * These functions implement only the ML-* algorithms; routing between them
+ * and the platform's native SubtleCrypto lives in index.js / install.js.
+ * Shared secrets from encapsulateKey/decapsulateKey are imported through
+ * the native SubtleCrypto, so the returned sharedKey is a genuine platform
+ * CryptoKey and all downstream crypto is native.
+ ***************************************************************************/
+
+import { getEngine } from "./engine.js";
+import {
+    normalizeAlg, KEM_PUB_USAGES, KEM_PRIV_USAGES,
+} from "./algorithms.js";
+import { forgeKey, materialOf, isOurKey } from "./keystore.js";
+import * as E from "./errors.js";
+
+const rng = (n) => globalThis.crypto.getRandomValues(new Uint8Array(n));
+
+function toBytes(src, what) {
+    if (ArrayBuffer.isView(src)) {
+        return new Uint8Array(
+            src.buffer.slice(src.byteOffset, src.byteOffset + src.byteLength));
+    }
+    if (src instanceof ArrayBuffer) return new Uint8Array(src.slice(0));
+    throw E.dataError(what + " must be a BufferSource");
+}
+
+function requireAlg(alg, kind) {
+    const a = normalizeAlg(alg);
+    if (!a) throw E.notSupported("unrecognized algorithm");
+    if (kind && a.kind !== kind) {
+        throw E.notSupported(a.name + " does not support this operation");
+    }
+    return a;
+}
+
+function requireKey(key, a, type, usage) {
+    if (!isOurKey(key)) {
+        throw E.invalidAccess("key is not a " + a.name + " key from this polyfill");
+    }
+    if (key.algorithm.name !== a.name) {
+        throw E.invalidAccess("key algorithm does not match " + a.name);
+    }
+    if (key.type !== type) throw E.invalidAccess("expected a " + type + " key");
+    if (usage && !key.usages.includes(usage)) {
+        throw E.invalidAccess("key does not permit " + usage);
+    }
+    return materialOf(key);
+}
+
+function checkUsages(usages, allowed) {
+    for (const u of usages) {
+        if (!allowed.includes(u)) throw E.syntaxError("unsupported key usage " + u);
+    }
+}
+
+function signContext(a) {
+    const ctx = a.context === undefined
+        ? new Uint8Array(0) : toBytes(a.context, "context");
+    if (ctx.length > 255) throw E.opError("context must be at most 255 bytes");
+    return ctx;
+}
+
+async function importSharedKey(ssBytes, sharedKeyAlgorithm, extractable, keyUsages) {
+    const ns = globalThis.crypto && globalThis.crypto.subtle;
+    if (!ns) throw E.notSupported("no native SubtleCrypto to hold the shared key");
+    try {
+        return await ns.importKey("raw", ssBytes, sharedKeyAlgorithm, extractable, keyUsages);
+    } finally {
+        ssBytes.fill(0);
+    }
+}
+
+/* ---- key management ---- */
+
+export async function generateKey(algorithm, extractable, keyUsages = []) {
+    const a = requireAlg(algorithm);
+    const eng = await getEngine();
+    if (a.kind === "kem") {
+        checkUsages(keyUsages, [...KEM_PUB_USAGES, ...KEM_PRIV_USAGES]);
+        const pubU = keyUsages.filter((u) => KEM_PUB_USAGES.includes(u));
+        const privU = keyUsages.filter((u) => KEM_PRIV_USAGES.includes(u));
+        if (!privU.length) throw E.syntaxError("private key usages must not be empty");
+        const seed = rng(eng.kemLengths(a.name).seed);
+        const { pub, sk } = eng.kemKeypairDerand(a.name, seed);
+        return {
+            publicKey: forgeKey("public", a.name, true, pubU, { pub }),
+            privateKey: forgeKey("private", a.name, extractable, privU, { pub, seed, sk }),
+        };
+    }
+    checkUsages(keyUsages, ["sign", "verify"]);
+    if (!keyUsages.includes("sign")) {
+        throw E.syntaxError("private key usages must not be empty");
+    }
+    const seed = rng(eng.sigLengths(a.name).seed);
+    const { pub, sk } = eng.sigKeypairDerand(a.name, seed);
+    return {
+        publicKey: forgeKey("public", a.name, true,
+            keyUsages.includes("verify") ? ["verify"] : [], { pub }),
+        privateKey: forgeKey("private", a.name, extractable, ["sign"], { pub, seed, sk }),
+    };
+}
+
+export async function importKey(format, keyData, algorithm, extractable, keyUsages = []) {
+    const a = requireAlg(algorithm);
+    const eng = await getEngine();
+    const L = a.kind === "kem" ? eng.kemLengths(a.name) : eng.sigLengths(a.name);
+    const pubUsages = a.kind === "kem" ? KEM_PUB_USAGES : ["verify"];
+    const privUsages = a.kind === "kem" ? KEM_PRIV_USAGES : ["sign"];
+
+    if (format === "raw-public") {
+        checkUsages(keyUsages, pubUsages);
+        const pub = toBytes(keyData, "keyData");
+        if (pub.length !== L.pk) throw E.dataError("bad " + a.name + " public key length");
+        return forgeKey("public", a.name, extractable, keyUsages, { pub });
+    }
+    if (format === "raw-seed") {
+        checkUsages(keyUsages, privUsages);
+        if (!keyUsages.length) throw E.syntaxError("private key usages must not be empty");
+        const seed = toBytes(keyData, "keyData");
+        if (seed.length !== L.seed) throw E.dataError("bad " + a.name + " seed length");
+        const { pub, sk } = a.kind === "kem"
+            ? eng.kemKeypairDerand(a.name, seed)
+            : eng.sigKeypairDerand(a.name, seed);
+        return forgeKey("private", a.name, extractable, keyUsages, { pub, seed, sk });
+    }
+    /* spki / pkcs8 / jwk land in P2 */
+    throw E.notSupported("key format " + format + " is not supported yet");
+}
+
+export async function exportKey(format, key) {
+    const a = requireAlg(key && key.algorithm && key.algorithm.name);
+    const m = requireKey(key, a, key.type, null);
+    if (!key.extractable) throw E.invalidAccess("key is not extractable");
+    if (format === "raw-public") {
+        if (key.type !== "public") throw E.invalidAccess("raw-public exports public keys");
+        return m.pub.slice().buffer;
+    }
+    if (format === "raw-seed") {
+        if (key.type !== "private") throw E.invalidAccess("raw-seed exports private keys");
+        return m.seed.slice().buffer;
+    }
+    throw E.notSupported("key format " + format + " is not supported yet");
+}
+
+export async function getPublicKey(key, keyUsages = []) {
+    if (!isOurKey(key)) throw E.invalidAccess("key is not from this polyfill");
+    const a = requireAlg(key.algorithm.name);
+    if (key.type !== "private") throw E.invalidAccess("expected a private key");
+    checkUsages(keyUsages, a.kind === "kem" ? KEM_PUB_USAGES : ["verify"]);
+    return forgeKey("public", a.name, true, keyUsages, { pub: materialOf(key).pub });
+}
+
+/* ---- KEM operations ---- */
+
+export async function encapsulateBits(algorithm, encapsulationKey) {
+    const a = requireAlg(algorithm, "kem");
+    const m = requireKey(encapsulationKey, a, "public", "encapsulateBits");
+    const { ct, ss } = (await getEngine()).kemEncaps(a.name, m.pub);
+    return { sharedKey: ss.buffer, ciphertext: ct.buffer };
+}
+
+export async function encapsulateKey(algorithm, encapsulationKey,
+                                     sharedKeyAlgorithm, extractable, keyUsages) {
+    const a = requireAlg(algorithm, "kem");
+    const m = requireKey(encapsulationKey, a, "public", "encapsulateKey");
+    const { ct, ss } = (await getEngine()).kemEncaps(a.name, m.pub);
+    const sharedKey = await importSharedKey(ss, sharedKeyAlgorithm, extractable, keyUsages);
+    return { sharedKey, ciphertext: ct.buffer };
+}
+
+export async function decapsulateBits(algorithm, decapsulationKey, ciphertext) {
+    const a = requireAlg(algorithm, "kem");
+    const m = requireKey(decapsulationKey, a, "private", "decapsulateBits");
+    const eng = await getEngine();
+    const ct = toBytes(ciphertext, "ciphertext");
+    if (ct.length !== eng.kemLengths(a.name).ct) {
+        throw E.opError("bad " + a.name + " ciphertext length");
+    }
+    return eng.kemDecaps(a.name, m.sk, ct).buffer;
+}
+
+export async function decapsulateKey(algorithm, decapsulationKey, ciphertext,
+                                     sharedKeyAlgorithm, extractable, keyUsages) {
+    const a = requireAlg(algorithm, "kem");
+    const m = requireKey(decapsulationKey, a, "private", "decapsulateKey");
+    const eng = await getEngine();
+    const ct = toBytes(ciphertext, "ciphertext");
+    if (ct.length !== eng.kemLengths(a.name).ct) {
+        throw E.opError("bad " + a.name + " ciphertext length");
+    }
+    const ss = eng.kemDecaps(a.name, m.sk, ct);
+    return importSharedKey(ss, sharedKeyAlgorithm, extractable, keyUsages);
+}
+
+/* ---- ML-DSA operations ---- */
+
+export async function sign(algorithm, key, data) {
+    const a = requireAlg(algorithm, "sig");
+    const ctx = signContext(a);
+    const m = requireKey(key, a, "private", "sign");
+    return (await getEngine())
+        .sigSign(a.name, m.sk, toBytes(data, "data"), ctx).buffer;
+}
+
+export async function verify(algorithm, key, signature, data) {
+    const a = requireAlg(algorithm, "sig");
+    const ctx = signContext(a);
+    const m = requireKey(key, a, "public", "verify");
+    return (await getEngine()).sigVerify(
+        a.name, m.pub, toBytes(data, "data"), ctx, toBytes(signature, "signature"));
+}
+
+/* ---- feature detection ---- */
+
+const OPS = {
+    kem: ["generateKey", "importKey", "exportKey", "getPublicKey",
+        "encapsulateBits", "encapsulateKey", "decapsulateBits", "decapsulateKey"],
+    sig: ["generateKey", "importKey", "exportKey", "getPublicKey", "sign", "verify"],
+};
+
+export function supports(operation, algorithm) {
+    const a = normalizeAlg(algorithm);
+    return a ? OPS[a.kind].includes(operation) : false;
+}