ths-csprng 1.0.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 2026 Aries Harbinger
+
+   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
+
+       https://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,99 @@
+<div align="center">
+<img src="./media/banner.png" alt="Banner" width="1250">
+</div>
+
+<br />
+
+Standard RNGs are built on the naive assumption that once a seed is "randomized," the history of its creation just... disappears.
+
+In reality, if an observer can violate causality or reconstruct the precise physical state of a system, your "randomness" is just an entry in a ledger.
+
+<br />
+
+If you are on to a **Block Universe** or **Superdeterministic** model, your "random" seed is just a static coordinate in spacetime. To an observer with enough compute or a vantage point further down the temporal axis, your private key isn't a secret — it’s a historical fact.
+
+**THS (Temporal-Hardening Solution)** is an attempt to fix this. It is a cryptographic wrapper that forces an adversary to move from attacking logic to attacking physical work, which makes “retrocausal observation” or state reconstruction exponentially challenging.
+
+To put it simply, it is a “Macroscopic Chaos as a defense against Microscopic Observation.”
+
+<br />
+
+---
+
+<br />
+
+<div align="center">
+<img src="./media/illustration.png" alt="Illustration" width="1250">
+</div>
+
+<br />
+
+## The "Observer from the Future" Problem
+
+Information doesn't just vanish (shout out to the **[Quantum No-Hiding Theorem](https://en.wikipedia.org/wiki/No-hiding_theorem)**). It leaks into the environment. If someone compromises your hardware or develops a way to reconstruct historical system states, your static seeds are toast.
+
+THS creates **Computational Fog**. Instead of a mathematical point, it binds your secret to the "metabolic noise" of your CPU at a specific nanosecond.
+
+<br />
+
+### How it actually works:
+
+* **Micro-Architectural Jitter:** Harvesting the tiny, unpredictable timing variances in your CPU clock caused by interrupts and thread scheduling.
+* **Physical Binding:** Capturing "ghost data" from uninitialized memory, we inject artifacts of the machine's immediate past into the entropy pool.
+* **Memory-Hardened Anchors:** We use **Argon2id** to spin up a shifting memory state. This forces an attacker to simulate a massive slice of physical RAM history just to see what happened in that one millisecond.
+
+<br />
+
+---
+
+<br />
+
+## Getting Started
+
+```bash
+npm install ths-csprng
+```
+
+<br />
+
+### Quick Start
+
+```javascript
+import THS from 'ths-csprng';
+
+(async () => {
+  // Get a 512-bit seed tied to this specific moment in hardware history
+  const seed = await THS.random(64);
+
+  // Deep hardening for keys meant to outlast the current paradigm
+  const key = await THS.random(32, { 
+    layers: 500,     // Increase the temporal iterations (slices)
+    harden: 3,       // Full metabolic collection + Argon2id
+    mem: 256 * 1024, // Prevents the "Cold Start Problem"
+    memoryH: 1,      // Run Argon2id at once
+    trng: true       // Use randomness from /dev/urandom directly (Unix-like only)
+  });
+})();
+```
+
+<br />
+
+## Why should you care?
+
+Most people **don't need this**.
+
+If you're building a todo app, move on. If you believe that the future cannot affect the past, that hardware manufacturers never lie, and that “random” numbers are truly disconnected from the physical state of the machine, then this tool is just a very complex way to waste CPU cycles.
+
+Temporal-Hardening Solution (THS) is designed for high-integrity cryptographic secrets where the threat model includes **historical state reconstruction** or **backdoored hardware**. It is a defense against the reality that even if your randomness is 100% deterministic within a closed system, it must be **Computationally Irreducible** to an outsider.
+
+<br />
+
+## License
+
+Licensed under the **Apache License, Version 2.0**; a robust, permissive license that includes an explicit grant of patent rights and provides protection against contributor liability.
+
+Copyright © 2026 Aries Harbinger. See the **[LICENSE](./LICENSE)** file for full details.
+
+<br />
+<br />
+<br />

package/package.json

@@ -0,0 +1,41 @@
+{
+  "name": "ths-csprng",
+  "version": "1.0.0",
+  "description": "Temporal-Hardening Solution: A CSPRNG wrapper designed to resist historical state reconstruction and hardware backdoors.",
+  "type": "module",
+  "main": "./src/index.js",
+  "exports": {
+    ".": "./src/index.js"
+  },
+  "author": "Aries Harbinger",
+  "license": "Apache-2.0",
+  "homepage": "https://github.com/harnuma9/temporal-hardening-solution-csprng",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/harnuma9/temporal-hardening-solution-csprng.git"
+  },
+  "bugs": {
+    "url": "https://github.com/harnuma9/temporal-hardening-solution-csprng/issues"
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "keywords": [
+    "csprng",
+    "cryptography",
+    "entropy",
+    "random",
+    "temporal-hardening",
+    "argon2",
+    "sha3",
+    "keccak",
+    "security",
+    "kmac"
+  ],
+  "dependencies": {
+    "@noble/hashes": "^2.2.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}

package/src/index.js

@@ -0,0 +1,124 @@
+/**
+ * THS (Temporal-Hardening Solution)
+ *
+ * Copyright 2026 Aries Harbinger
+ *
+ * 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.
+ */
+
+import Utils from './util.js';
+import { kmac256 } from '@noble/hashes/sha3-addons.js';
+import { createHash } from 'node:crypto';
+
+
+/**
+ * Temporal-Hardening Solution - Applied in Random Number Generator
+ */
+export const THS = {
+    /**
+     * Generates cryptographically secure random bytes with temporal hardening.
+     */
+    async random(length = 32, {
+
+        layers = 128,             // number of timeline slices (iterations)
+        harden = 2,               // levels: 0 (hrtime), 1 (+entropy), 2 (+internal), 3 (+Argon2id)
+        trng = false,             // attempts to read /dev/urandom, fallback to randomBytes()
+        hashOut = true,           // whether to hash every moments instead of processing it as raw data
+
+        memoryH = 1,              // number of Argon2id runs        (requires harden=3 level)
+        mem = 16384,              // memory hardness of Argon2id    (default: 16MB)
+        label = 'THS-Default-v1'  // kmac label
+
+    } = {}) {
+
+        if (length <= 0)
+            return Buffer.alloc(0);
+
+        if (layers < 2 || layers > 65536)
+            throw new Error(`Layer count [${layers}] is invalid. Requires a temporal span of 2-65536 cycles to ensure metabolic variance.`);
+
+        if (harden < 0 || harden > 3)
+            throw new Error(`Hardening level [${harden}] is unknown. Use 0 (Basic) through 3 (Heavy).`);
+
+        if (harden >= 3 && (memoryH < 1 || memoryH > layers))
+            throw new Error(`Memory hardening cycle count [${memoryH}] exceeds available temporal layers [${layers}].`);
+
+        if ('number' !== typeof mem || mem < 1024)
+            throw new Error(`Memory set [${mem}] for Argon2id must be a valid number and not be less than 1024 or 1KB.`);
+
+
+        // Collector for metabolic moments (The Message)
+        const moments = [];
+        let seed;
+
+        try {
+            for (let i = 0; i < layers; i++) {
+                const moment = await Utils.snapshot(harden, memoryH, mem, i, trng);
+
+                if (!hashOut) { moments.push(moment); }
+
+                else {
+                  const h = createHash('sha3-512')  // Structurally immune to length-extension attacks
+                    .update(moment)
+                    .digest();
+
+                  moment.fill(0);  // immediate wipe
+                  moments.push(h);
+                }
+
+                // Supplemental entropy injected into the moment collection
+                if (harden >= 1) {
+                    const sup = await Utils.getRandom(12, trng);
+                    moments.push(sup);
+                }
+
+                if (i < layers - 1) await Utils.jitter(trng);
+            }
+
+            // Initial KMAC Key
+            seed = await Utils.getRandom(32, trng);
+
+            // Finalize with KMAC256
+            const result = kmac256(seed, Buffer.concat(moments), { 
+                personalization: Utils.toBytes(label),
+                dkLen: length
+            });
+
+            return Buffer.from(result);
+        }
+
+        catch (e) { throw e }
+
+        finally {
+            // Cleanup sensitive memory
+            seed && seed.fill(0);
+
+            for (const m of moments) {
+                (m && typeof m.fill === 'function') && m.fill(0);
+            }
+        }
+    },
+
+    async rand(len, o) { return await THS.random(len, o) },
+    async rnd (len, o) { return await THS.random(len, o) },
+
+    // direct use raw random (fallback to randomBytes)
+    async raw(len)     { return await Utils.getRandom(len, true) }
+};
+
+// Must use await
+export const randomBytes = async (len, o) => {
+    return await THS.random(len, o);
+};
+
+export default THS;

package/src/util.js

@@ -0,0 +1,169 @@
+/**
+ * THS (Temporal-Hardening Solution)
+ *
+ * Copyright 2026 Aries Harbinger
+ *
+ * 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.
+ */
+
+import fs from 'node:fs/promises';
+import { promisify } from 'node:util';
+import { randomBytes, timingSafeEqual, argon2 as _argon2 } from 'node:crypto';
+
+const argon2 = promisify(_argon2);
+const defined_past = process.hrtime.bigint();
+
+
+export const Utils = {
+    /**
+     * Captures a high-resolution snapshot of the Node.js metabolic state.
+     * Uses concatenation to prevent entropy collisions.
+     */
+    async snapshot(h, mh, mem, s, useUrandom) {
+        // Level 1: Minimal data
+        if (h <= 1) return this.bigIntToBuffer(process.hrtime.bigint());
+
+        const u = process.resourceUsage();
+        const m = process.memoryUsage();
+
+        // Primary metabolic collection (Machine State)
+        // We use an array to preserve individual entropy of each metric
+        const metrics = [
+            process.hrtime.bigint(),                            // CPU Nanoseconds
+            BigInt(Math.round(process.uptime() * 1_000_000)), 
+            BigInt(u.userCPUTime),                              // User-space CPU usage
+            BigInt(u.systemCPUTime),                            // Kernel-space CPU usage
+            BigInt(u.minorPageFault),                           // Soft memory faults
+            BigInt(u.majorPageFault),                           // Hard I/O faults
+            BigInt(u.voluntaryContextSwitches),
+            BigInt(u.involuntaryContextSwitches),
+            BigInt(m.heapUsed),                                 // V8 actual usage
+            BigInt(m.heapTotal),                                // V8 allocated total
+            BigInt(m.external),                                 // C++ object memory
+            BigInt(m.arrayBuffers || 0),                        // Raw buffer memory
+            BigInt(m.rss),                                      // Resident Set Size (Physical RAM)
+            BigInt(Math.round(performance.now() * 1_000_000)),
+            defined_past,                                       // Process start anchor
+            BigInt(Date.now()),                                 // Wall clock (Temporal anchor)
+            BigInt(s)                                           // Sequential salt
+        ].map(n => this.bigIntToBuffer(n));
+
+        // Map metrics to uniquely structured buffers
+        const b = Buffer.concat([
+
+            // Inject 128 bytes of raw, uninitialized system memory 
+            // (May contain fragments of previous internal function calls/pointers)
+            Buffer.allocUnsafe(128),
+
+            ...metrics
+        ]);
+
+        if (h <= 2 || s >= mh) return b;
+
+        // Level 3: Argon2id Memory-Hardening
+        const nonce = await this.getRandom(16, useUrandom);
+
+        try {
+            const memHard = await argon2('argon2id', {
+                nonce,
+                message: b,
+                memory: mem,
+                passes: 3,
+                parallelism: 4,
+                tagLength: 64
+            });
+
+            return (h <= 3)
+                ? Buffer.concat([b, memHard])
+                : memHard;
+        }
+
+        catch (e) { throw e }
+        finally   { nonce.fill(0); }
+    },
+
+    /**
+     * Attempts to harvest raw entropy from the OS device.
+     * Fallback to hardware-backed Node.js randomBytes on failure.
+     */
+    async getRandom(len, useUrandom) {
+        if (!useUrandom) return randomBytes(len);
+
+        let fd;
+        try {
+            fd = await fs.open('/dev/urandom', 'r');
+            const buffer = Buffer.allocUnsafe(len);
+            const { bytesRead } = await fd.read(buffer, 0, len, 0);
+
+            // If we didn't read enough bytes for some reason, fallback
+            return (bytesRead < len)
+                ? randomBytes(len)
+                : buffer;
+        }
+
+        catch (e) { return randomBytes(len);  }
+        finally   { if (fd) await fd.close(); }
+    },
+
+    /**
+     * Micro-architectural noise generator.
+     */
+    async jitter(useUrandom) {
+        const b = await this.getRandom(64, useUrandom);
+        timingSafeEqual(b, b);
+        b.fill(0); 
+    },
+
+    /**
+     * Optimized BigInt to Buffer conversion with 16-bit Length Header.
+     * Prepends a 2-byte length header (Big-Endian) followed by the data.
+     */
+    bigIntToBuffer(n) {
+        if (typeof n !== 'bigint') n = BigInt(n);
+        if (n < 0n) throw new RangeError('Negative values not supported');
+
+        // Fast path for zero: [Length: 0x0001] [Value: 0x00]
+        if (n === 0n) {
+            const buf = Buffer.allocUnsafe(3);
+            buf.writeUInt16BE(1, 0); // Length is 1 byte
+            buf[2] = 0;              // Value is 0
+            return buf;
+        }
+
+        // Convert BigInt to Buffer via Hex
+        let hex = n.toString(16);
+        if (hex.length % 2 !== 0) hex = '0' + hex;
+        const data = Buffer.from(hex, 'hex');
+
+        // Safety check for 16-bit overflow
+        if (data.length > 0xFFFF)
+            throw new RangeError('BigInt exceeds 16-bit length header capacity');
+
+        // Structure: [Header (2 bytes)] + [Data]
+        const header = Buffer.allocUnsafe(2);
+        header.writeUInt16BE(data.length, 0);
+
+        return Buffer.concat([header, data]);
+    },
+
+    /**
+     * Normalizes various input types into a Uint8Array.
+     */
+    toBytes(input) {
+        if (input instanceof Uint8Array) return input;
+        if (typeof input === 'string') return new TextEncoder().encode(input);
+        return new TextEncoder().encode(JSON.stringify(input) || '');
+    }
+};
+
+export default Utils;