@mindpeeker/negentropy 0.1.0

package/dist/extract/debias.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Von Neumann debiasing: consume bit pairs, 01→0, 10→1, 00/11 discarded.
+ * Output is exactly unbiased WHEN INPUT BITS ARE IID — correlated input
+ * yields biased output. Yield is pq ≤ 25%; a trailing unpaired bit is dropped.
+ */
+export declare function vonNeumann(bits: ArrayLike<number>): number[];
+/**
+ * Peres iterated von Neumann (Peres 1992, Ann. Statist. 20(1)): recursively
+ * recycles what von Neumann throws away — the pair-XOR sequence U and the
+ * equal-pair values V — as Peres(x) = VN(x) ++ Peres(U) ++ Peres(V) (that
+ * concatenation order is this implementation's frozen convention). Extraction
+ * rate approaches the full Shannon entropy H(p) as depth grows, vs von
+ * Neumann's pq ceiling. Same iid-input requirement as von Neumann.
+ */
+export declare function peres(bits: ArrayLike<number>, maxDepth?: number): number[];
+/**
+ * Expected Peres output rate (bits out per bit in) at recursion depth d for
+ * iid input bias p, via the exact recurrence
+ * R₍d₊₁₎(p) = pq + ½·R_d(2pq) + ((p²+q²)/2)·R_d(p²/(p²+q²)), R₀ = 0.
+ * R₁ = pq is von Neumann; R_d → H(p) as d → ∞. Exact values at p = ½:
+ * ¼, 7/16, 37/64, … Cost is O(2^depth) — the recursion branches on distinct
+ * biases — hence the depth ≤ 25 cap.
+ */
+export declare function peresRate(p: number, depth: number): number;
+//# sourceMappingURL=debias.d.ts.map

package/dist/extract/debias.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"debias.d.ts","sourceRoot":"","sources":["../../src/extract/debias.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAQ5D;AAED;;;;;;;GAOG;AACH,wBAAgB,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,QAAQ,SAA2B,GAAG,MAAM,EAAE,CAY5F;AAkBD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAW1D"}

package/dist/extract/debias.js

@@ -0,0 +1,80 @@
+import { NegentropyError } from '../errors.js';
+/**
+ * Von Neumann debiasing: consume bit pairs, 01→0, 10→1, 00/11 discarded.
+ * Output is exactly unbiased WHEN INPUT BITS ARE IID — correlated input
+ * yields biased output. Yield is pq ≤ 25%; a trailing unpaired bit is dropped.
+ */
+export function vonNeumann(bits) {
+    const out = [];
+    for (let i = 0; i + 1 < bits.length; i += 2) {
+        const a = bits[i] & 1;
+        const b = bits[i + 1] & 1;
+        if (a !== b)
+            out.push(a);
+    }
+    return out;
+}
+/**
+ * Peres iterated von Neumann (Peres 1992, Ann. Statist. 20(1)): recursively
+ * recycles what von Neumann throws away — the pair-XOR sequence U and the
+ * equal-pair values V — as Peres(x) = VN(x) ++ Peres(U) ++ Peres(V) (that
+ * concatenation order is this implementation's frozen convention). Extraction
+ * rate approaches the full Shannon entropy H(p) as depth grows, vs von
+ * Neumann's pq ceiling. Same iid-input requirement as von Neumann.
+ */
+export function peres(bits, maxDepth = Number.POSITIVE_INFINITY) {
+    if (maxDepth !== Number.POSITIVE_INFINITY && (!Number.isInteger(maxDepth) || maxDepth < 1)) {
+        throw new NegentropyError('invalid_config', `maxDepth must be a positive integer, got ${maxDepth}`);
+    }
+    const input = new Uint8Array(bits.length);
+    for (let i = 0; i < bits.length; i++)
+        input[i] = bits[i] & 1;
+    const out = [];
+    peresInto(input, maxDepth, out);
+    return out;
+}
+function peresInto(bits, depth, out) {
+    if (bits.length < 2 || depth < 1)
+        return;
+    const pairs = bits.length >> 1;
+    const u = new Uint8Array(pairs);
+    const v = [];
+    for (let i = 0; i < pairs; i++) {
+        const a = bits[2 * i];
+        const b = bits[2 * i + 1];
+        if (a !== b)
+            out.push(a);
+        u[i] = a ^ b;
+        if (a === b)
+            v.push(a);
+    }
+    peresInto(u, depth - 1, out);
+    peresInto(Uint8Array.from(v), depth - 1, out);
+}
+/**
+ * Expected Peres output rate (bits out per bit in) at recursion depth d for
+ * iid input bias p, via the exact recurrence
+ * R₍d₊₁₎(p) = pq + ½·R_d(2pq) + ((p²+q²)/2)·R_d(p²/(p²+q²)), R₀ = 0.
+ * R₁ = pq is von Neumann; R_d → H(p) as d → ∞. Exact values at p = ½:
+ * ¼, 7/16, 37/64, … Cost is O(2^depth) — the recursion branches on distinct
+ * biases — hence the depth ≤ 25 cap.
+ */
+export function peresRate(p, depth) {
+    if (!(p > 0 && p < 1)) {
+        throw new NegentropyError('invalid_config', `bias p must be in (0, 1), got ${p}`);
+    }
+    if (!Number.isInteger(depth) || depth < 0 || depth > 25) {
+        throw new NegentropyError('invalid_config', `depth must be an integer in [0, 25] (cost grows as 2^depth), got ${depth}`);
+    }
+    return rate(p, depth);
+}
+function rate(p, depth) {
+    // repeated p²/(p²+q²) mapping drives extreme biases to exactly 0 or 1 in
+    // float64 — those branches are deterministic and carry zero extractable entropy
+    if (depth === 0 || p <= 0 || p >= 1)
+        return 0;
+    const q = 1 - p;
+    const equal = p * p + q * q;
+    return p * q + 0.5 * rate(2 * p * q, depth - 1) + (equal / 2) * rate((p * p) / equal, depth - 1);
+}
+//# sourceMappingURL=debias.js.map

package/dist/extract/debias.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debias.js","sourceRoot":"","sources":["../../src/extract/debias.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAE9C;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAuB;IAChD,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAI,IAAI,CAAC,CAAC,CAAY,GAAG,CAAC,CAAA;QACjC,MAAM,CAAC,GAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAY,GAAG,CAAC,CAAA;QACrC,IAAI,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,KAAK,CAAC,IAAuB,EAAE,QAAQ,GAAG,MAAM,CAAC,iBAAiB;IAChF,IAAI,QAAQ,KAAK,MAAM,CAAC,iBAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3F,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,4CAA4C,QAAQ,EAAE,CACvD,CAAA;IACH,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,CAAY,GAAG,CAAC,CAAA;IACxE,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAA;IAC/B,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,SAAS,CAAC,IAAgB,EAAE,KAAa,EAAE,GAAa;IAC/D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAM;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAA;IAC9B,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;IAC/B,MAAM,CAAC,GAAa,EAAE,CAAA;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAW,CAAA;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAA;QACnC,IAAI,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACxB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACZ,IAAI,CAAC,KAAK,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACxB,CAAC;IACD,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;IAC5B,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,KAAa;IAChD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,eAAe,CAAC,gBAAgB,EAAE,iCAAiC,CAAC,EAAE,CAAC,CAAA;IACnF,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACxD,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,oEAAoE,KAAK,EAAE,CAC5E,CAAA;IACH,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AACvB,CAAC;AAED,SAAS,IAAI,CAAC,CAAS,EAAE,KAAa;IACpC,yEAAyE;IACzE,gFAAgF;IAChF,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACf,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;AAClG,CAAC"}

package/dist/extract/health.d.ts

@@ -0,0 +1,44 @@
+/** SP 800-90B §4.4.1 Repetition Count Test cutoff: C = 1 + ⌈20/H⌉ at α = 2⁻²⁰. */
+export declare function rctCutoff(h: number): number;
+/**
+ * SP 800-90B §4.4.2 Adaptive Proportion Test cutoff:
+ * 1 + smallest k with P(Binomial(W, 2⁻ᴴ) ≤ k) ≥ 1 − 2⁻²⁰. The pmf terms are
+ * computed in log space — at low H the lower binomial tail underflows float64
+ * (e.g. 0.19⁵¹² ≈ 1e-371), which would silently disable the test.
+ */
+export declare function aptCutoff(h: number, windowSize: number): number;
+export interface HealthConfig {
+    /** Assessed min-entropy H in bits per raw sample byte. May be fractional. */
+    minEntropyPerSample: number;
+    /** APT window: 512 (default, non-binary samples) or 1024 (binary sources). */
+    windowSize?: 512 | 1024;
+    /**
+     * strict: throw NegentropyError('health_test') on the first alarm — the
+     * randomness-supplier behavior. Default false: record alarms and keep
+     * running — the anomaly-logger behavior (an alarm resets that test's
+     * counter so one long run is one alarm, not one per sample).
+     */
+    strict?: boolean;
+}
+export interface HealthAlarm {
+    test: 'rct' | 'apt';
+    /** Global index of the sample that tripped the test (0-based). */
+    sample: number;
+    count: number;
+    cutoff: number;
+}
+/**
+ * SP 800-90B §4.4 continuous health tests (Repetition Count + Adaptive
+ * Proportion) over raw samples, in an observational shell.
+ */
+export declare class ContinuousHealth {
+    #private;
+    readonly rctCutoff: number;
+    readonly aptCutoff: number;
+    constructor(config: HealthConfig, source?: string);
+    get alarms(): readonly HealthAlarm[];
+    get samplesSeen(): number;
+    /** Feed raw samples; returns the alarms THIS call raised ([] = healthy). */
+    push(samples: Uint8Array): HealthAlarm[];
+}
+//# sourceMappingURL=health.d.ts.map

package/dist/extract/health.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"health.d.ts","sourceRoot":"","sources":["../../src/extract/health.ts"],"names":[],"mappings":"AAKA,kFAAkF;AAClF,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3C;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAa/D;AAED,MAAM,WAAW,YAAY;IAC3B,6EAA6E;IAC7E,mBAAmB,EAAE,MAAM,CAAA;IAC3B,8EAA8E;IAC9E,UAAU,CAAC,EAAE,GAAG,GAAG,IAAI,CAAA;IACvB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,KAAK,GAAG,KAAK,CAAA;IACnB,kEAAkE;IAClE,MAAM,EAAE,MAAM,CAAA;IACd,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;CACf;AAED;;;GAGG;AACH,qBAAa,gBAAgB;;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;gBAgBd,MAAM,EAAE,YAAY,EAAE,MAAM,CAAC,EAAE,MAAM;IAYjD,IAAI,MAAM,IAAI,SAAS,WAAW,EAAE,CAEnC;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAiBD,4EAA4E;IAC5E,IAAI,CAAC,OAAO,EAAE,UAAU,GAAG,WAAW,EAAE;CAqCzC"}

package/dist/extract/health.js

@@ -0,0 +1,115 @@
+import { NegentropyError } from '../errors.js';
+import { lnGamma } from '../internal/special.js';
+const ALPHA = 2 ** -20; // false-positive rate for both tests (SP 800-90B recommendation)
+/** SP 800-90B §4.4.1 Repetition Count Test cutoff: C = 1 + ⌈20/H⌉ at α = 2⁻²⁰. */
+export function rctCutoff(h) {
+    return 1 + Math.ceil(20 / h);
+}
+/**
+ * SP 800-90B §4.4.2 Adaptive Proportion Test cutoff:
+ * 1 + smallest k with P(Binomial(W, 2⁻ᴴ) ≤ k) ≥ 1 − 2⁻²⁰. The pmf terms are
+ * computed in log space — at low H the lower binomial tail underflows float64
+ * (e.g. 0.19⁵¹² ≈ 1e-371), which would silently disable the test.
+ */
+export function aptCutoff(h, windowSize) {
+    const p = 2 ** -h;
+    const lnP = Math.log(p);
+    const lnQ = Math.log1p(-p);
+    const lnChooseBase = lnGamma(windowSize + 1);
+    let cdf = 0;
+    for (let k = 0; k <= windowSize; k++) {
+        const logPmf = lnChooseBase - lnGamma(k + 1) - lnGamma(windowSize - k + 1) + k * lnP + (windowSize - k) * lnQ;
+        cdf += Math.exp(logPmf);
+        if (cdf >= 1 - ALPHA)
+            return 1 + k;
+    }
+    return 1 + windowSize;
+}
+/**
+ * SP 800-90B §4.4 continuous health tests (Repetition Count + Adaptive
+ * Proportion) over raw samples, in an observational shell.
+ */
+export class ContinuousHealth {
+    rctCutoff;
+    aptCutoff;
+    #windowSize;
+    #strict;
+    #source;
+    #alarms = [];
+    #samplesSeen = 0;
+    // Repetition Count Test state
+    #lastSample = -1;
+    #runLength = 0;
+    // Adaptive Proportion Test state
+    #windowIndex = 0;
+    #reference = -1;
+    #referenceCount = 0;
+    constructor(config, source) {
+        const { minEntropyPerSample, windowSize = 512, strict = false } = config;
+        if (!(minEntropyPerSample > 0)) {
+            throw new NegentropyError('invalid_config', 'minEntropyPerSample must be > 0', { source });
+        }
+        this.rctCutoff = rctCutoff(minEntropyPerSample);
+        this.aptCutoff = aptCutoff(minEntropyPerSample, windowSize);
+        this.#windowSize = windowSize;
+        this.#strict = strict;
+        this.#source = source;
+    }
+    get alarms() {
+        return this.#alarms;
+    }
+    get samplesSeen() {
+        return this.#samplesSeen;
+    }
+    #alarm(test, count, cutoff) {
+        const alarm = { test, sample: this.#samplesSeen, count, cutoff };
+        this.#alarms.push(alarm);
+        if (this.#strict) {
+            throw new NegentropyError('health_test', test === 'rct'
+                ? `repetition count test failed: ${count} identical samples (cutoff ${cutoff})`
+                : `adaptive proportion test failed: value seen ${count}× in a ${this.#windowSize}-sample window (cutoff ${cutoff})`, { source: this.#source });
+        }
+        return alarm;
+    }
+    /** Feed raw samples; returns the alarms THIS call raised ([] = healthy). */
+    push(samples) {
+        const raised = [];
+        for (const sample of samples) {
+            // Repetition Count Test
+            if (sample === this.#lastSample) {
+                this.#runLength++;
+                if (this.#runLength >= this.rctCutoff) {
+                    raised.push(this.#alarm('rct', this.#runLength, this.rctCutoff));
+                    this.#runLength = 1; // observational: restart the run so alarms don't flood
+                }
+            }
+            else {
+                this.#lastSample = sample;
+                this.#runLength = 1;
+            }
+            // Adaptive Proportion Test
+            if (this.#windowIndex === 0) {
+                this.#reference = sample;
+                this.#referenceCount = 1;
+                this.#windowIndex = 1;
+            }
+            else {
+                if (sample === this.#reference) {
+                    this.#referenceCount++;
+                    if (this.#referenceCount >= this.aptCutoff) {
+                        raised.push(this.#alarm('apt', this.#referenceCount, this.aptCutoff));
+                        this.#windowIndex = 0; // observational: restart the window
+                        this.#samplesSeen++;
+                        continue;
+                    }
+                }
+                this.#windowIndex++;
+                if (this.#windowIndex === this.#windowSize)
+                    this.#windowIndex = 0;
+            }
+            this.#samplesSeen++;
+        }
+        return raised;
+    }
+}
+//# sourceMappingURL=health.js.map

package/dist/extract/health.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"health.js","sourceRoot":"","sources":["../../src/extract/health.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAA;AAEhD,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA,CAAC,iEAAiE;AAExF,kFAAkF;AAClF,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,UAAkB;IACrD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;IACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACvB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1B,MAAM,YAAY,GAAG,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,CAAA;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,MAAM,GACV,YAAY,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;QAChG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACvB,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IACpC,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAA;AACvB,CAAC;AAwBD;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAClB,SAAS,CAAQ;IACjB,SAAS,CAAQ;IACjB,WAAW,CAAQ;IACnB,OAAO,CAAS;IAChB,OAAO,CAAS;IAChB,OAAO,GAAkB,EAAE,CAAA;IACpC,YAAY,GAAG,CAAC,CAAA;IAEhB,8BAA8B;IAC9B,WAAW,GAAG,CAAC,CAAC,CAAA;IAChB,UAAU,GAAG,CAAC,CAAA;IAEd,iCAAiC;IACjC,YAAY,GAAG,CAAC,CAAA;IAChB,UAAU,GAAG,CAAC,CAAC,CAAA;IACf,eAAe,GAAG,CAAC,CAAA;IAEnB,YAAY,MAAoB,EAAE,MAAe;QAC/C,MAAM,EAAE,mBAAmB,EAAE,UAAU,GAAG,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,CAAA;QACxE,IAAI,CAAC,CAAC,mBAAmB,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,eAAe,CAAC,gBAAgB,EAAE,iCAAiC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAA;QAC5F,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,mBAAmB,CAAC,CAAA;QAC/C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,mBAAmB,EAAE,UAAU,CAAC,CAAA;QAC3D,IAAI,CAAC,WAAW,GAAG,UAAU,CAAA;QAC7B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;QACrB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;IACvB,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,IAAmB,EAAE,KAAa,EAAE,MAAc;QACvD,MAAM,KAAK,GAAgB,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;QAC7E,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,eAAe,CACvB,aAAa,EACb,IAAI,KAAK,KAAK;gBACZ,CAAC,CAAC,iCAAiC,KAAK,8BAA8B,MAAM,GAAG;gBAC/E,CAAC,CAAC,+CAA+C,KAAK,UAAU,IAAI,CAAC,WAAW,0BAA0B,MAAM,GAAG,EACrH,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CACzB,CAAA;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,4EAA4E;IAC5E,IAAI,CAAC,OAAmB;QACtB,MAAM,MAAM,GAAkB,EAAE,CAAA;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,wBAAwB;YACxB,IAAI,MAAM,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;gBAChC,IAAI,CAAC,UAAU,EAAE,CAAA;gBACjB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;oBACtC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;oBAChE,IAAI,CAAC,UAAU,GAAG,CAAC,CAAA,CAAC,uDAAuD;gBAC7E,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,MAAM,CAAA;gBACzB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAA;YACrB,CAAC;YAED,2BAA2B;YAC3B,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,UAAU,GAAG,MAAM,CAAA;gBACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAA;gBACxB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,IAAI,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;oBAC/B,IAAI,CAAC,eAAe,EAAE,CAAA;oBACtB,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;wBAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;wBACrE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA,CAAC,oCAAoC;wBAC1D,IAAI,CAAC,YAAY,EAAE,CAAA;wBACnB,SAAQ;oBACV,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,YAAY,EAAE,CAAA;gBACnB,IAAI,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,WAAW;oBAAE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;YACnE,CAAC;YACD,IAAI,CAAC,YAAY,EAAE,CAAA;QACrB,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;CACF"}

package/dist/extract/toeplitz.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Seeded Toeplitz-hashing (2-universal) strong extractor over GF(2).
+ * T[i][j] = seed bit (i − j) + (n − 1); output yᵢ = ⊕ⱼ T[i][j]·xⱼ.
+ * Leftover hash lemma: with input min-entropy ≥ k bits, choosing
+ * m ≤ k − 2·log₂(1/ε) output bits puts the output within statistical
+ * distance ε of uniform — EVEN IF THE SEED IS PUBLIC (strong extractor;
+ * the seed is reusable). The seed must be uniform and independent of the
+ * input — never derive it from the stream being extracted.
+ */
+export interface ToeplitzExtractor {
+    readonly inputBits: number;
+    readonly outputBits: number;
+    /** Extract from exactly ⌈inputBits/8⌉ bytes (MSB-first; trailing pad bits ignored). */
+    extract(input: Uint8Array): Uint8Array;
+}
+/** Leftover-hash-lemma output length: m = ⌊k − 2·log₂(1/ε)⌋. Default ε = 2⁻³². */
+export declare function toeplitzOutputBits(minEntropyBits: number, epsilon?: number): number;
+export declare function toeplitzExtractor(seed: Uint8Array, inputBits: number, outputBits: number): ToeplitzExtractor;
+//# sourceMappingURL=toeplitz.d.ts.map

package/dist/extract/toeplitz.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toeplitz.d.ts","sourceRoot":"","sources":["../../src/extract/toeplitz.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,uFAAuF;IACvF,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,CAAA;CACvC;AAED,kFAAkF;AAClF,wBAAgB,kBAAkB,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,SAAW,GAAG,MAAM,CAKrF;AA0BD,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,iBAAiB,CA6DnB"}

package/dist/extract/toeplitz.js

@@ -0,0 +1,83 @@
+import { NegentropyError } from '../errors.js';
+/** Leftover-hash-lemma output length: m = ⌊k − 2·log₂(1/ε)⌋. Default ε = 2⁻³². */
+export function toeplitzOutputBits(minEntropyBits, epsilon = 2 ** -32) {
+    if (!(epsilon > 0 && epsilon < 1)) {
+        throw new NegentropyError('invalid_config', `epsilon must be in (0, 1), got ${epsilon}`);
+    }
+    return Math.floor(minEntropyBits - 2 * Math.log2(1 / epsilon));
+}
+/** Read bit t (global MSB-first order) from a byte array. */
+function bitAt(bytes, t) {
+    return (bytes[t >> 3] >> (7 - (t & 7))) & 1;
+}
+/** Pack bits[0..count) (MSB-first order) into 32-bit words, bit t at word t>>5, position t&31. */
+function packWords(bytes, count) {
+    const words = new Uint32Array(Math.ceil(count / 32));
+    for (let t = 0; t < count; t++) {
+        if (bitAt(bytes, t))
+            words[t >> 5] = (words[t >> 5] | (1 << (t & 31))) >>> 0;
+    }
+    return words;
+}
+function parity32(v) {
+    let x = v;
+    x ^= x >>> 16;
+    x ^= x >>> 8;
+    x ^= x >>> 4;
+    x ^= x >>> 2;
+    x ^= x >>> 1;
+    return x & 1;
+}
+export function toeplitzExtractor(seed, inputBits, outputBits) {
+    if (!Number.isInteger(inputBits) || inputBits < 2) {
+        throw new NegentropyError('invalid_config', `inputBits must be an integer ≥ 2, got ${inputBits}`);
+    }
+    if (!Number.isInteger(outputBits) || outputBits < 1 || outputBits >= inputBits) {
+        throw new NegentropyError('invalid_config', `outputBits must be an integer in [1, inputBits), got ${outputBits}`);
+    }
+    const seedBits = inputBits + outputBits - 1;
+    const expectedSeedBytes = Math.ceil(seedBits / 8);
+    if (seed.length !== expectedSeedBytes) {
+        throw new NegentropyError('invalid_config', `seed must be exactly ${expectedSeedBytes} bytes (${seedBits} bits), got ${seed.length}`);
+    }
+    // yᵢ = parity over t of seed[i + t]·xrev[t], xrev[t] = x[n−1−t]: row i of T is a
+    // sliding n-bit window of the seed against the reversed input — word-wise below.
+    const inputWords = Math.ceil(inputBits / 32);
+    const seedWords = packWords(seed, seedBits);
+    const lastMask = inputBits % 32 === 0 ? 0xffffffff : (1 << (inputBits % 32)) - 1; // valid bits of the last window word
+    return {
+        inputBits,
+        outputBits,
+        extract(input) {
+            if (input.length !== Math.ceil(inputBits / 8)) {
+                throw new NegentropyError('invalid_config', `input must be exactly ${Math.ceil(inputBits / 8)} bytes, got ${input.length}`);
+            }
+            // pack reversed input bits into words
+            const xrev = new Uint32Array(inputWords);
+            for (let t = 0; t < inputBits; t++) {
+                if (bitAt(input, inputBits - 1 - t)) {
+                    xrev[t >> 5] = (xrev[t >> 5] | (1 << (t & 31))) >>> 0;
+                }
+            }
+            const out = new Uint8Array(Math.ceil(outputBits / 8));
+            for (let i = 0; i < outputBits; i++) {
+                const base = i >> 5;
+                const off = i & 31;
+                let acc = 0;
+                for (let w = 0; w < inputWords; w++) {
+                    let window = seedWords[base + w] >>> off;
+                    if (off !== 0)
+                        window |= (seedWords[base + w + 1] ?? 0) << (32 - off);
+                    window >>>= 0;
+                    if (w === inputWords - 1)
+                        window &= lastMask;
+                    acc ^= window & xrev[w];
+                }
+                if (parity32(acc))
+                    out[i >> 3] = out[i >> 3] | (1 << (7 - (i & 7)));
+            }
+            return out;
+        },
+    };
+}
+//# sourceMappingURL=toeplitz.js.map

package/dist/extract/toeplitz.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toeplitz.js","sourceRoot":"","sources":["../../src/extract/toeplitz.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAkB9C,kFAAkF;AAClF,MAAM,UAAU,kBAAkB,CAAC,cAAsB,EAAE,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE;IAC3E,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,eAAe,CAAC,gBAAgB,EAAE,kCAAkC,OAAO,EAAE,CAAC,CAAA;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAA;AAChE,CAAC;AAED,6DAA6D;AAC7D,SAAS,KAAK,CAAC,KAAiB,EAAE,CAAS;IACzC,OAAO,CAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAY,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;AACzD,CAAC;AAED,kGAAkG;AAClG,SAAS,SAAS,CAAC,KAAiB,EAAE,KAAa;IACjD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAY,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;IAC1F,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;IACb,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACZ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACZ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACZ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACZ,OAAO,CAAC,GAAG,CAAC,CAAA;AACd,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,IAAgB,EAChB,SAAiB,EACjB,UAAkB;IAElB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,yCAAyC,SAAS,EAAE,CACrD,CAAA;IACH,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;QAC/E,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,wDAAwD,UAAU,EAAE,CACrE,CAAA;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,SAAS,GAAG,UAAU,GAAG,CAAC,CAAA;IAC3C,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;IACjD,IAAI,IAAI,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;QACtC,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,wBAAwB,iBAAiB,WAAW,QAAQ,eAAe,IAAI,CAAC,MAAM,EAAE,CACzF,CAAA;IACH,CAAC;IACD,iFAAiF;IACjF,iFAAiF;IACjF,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC,CAAA;IAC5C,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC3C,MAAM,QAAQ,GAAG,SAAS,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,qCAAqC;IAEtH,OAAO;QACL,SAAS;QACT,UAAU;QACV,OAAO,CAAC,KAAiB;YACvB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9C,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,yBAAyB,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,eAAe,KAAK,CAAC,MAAM,EAAE,CAC/E,CAAA;YACH,CAAC;YACD,sCAAsC;YACtC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAA;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,KAAK,CAAC,KAAK,EAAE,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACpC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAY,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;gBACnE,CAAC;YACH,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAA;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;gBACnB,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,CAAA;gBAClB,IAAI,GAAG,GAAG,CAAC,CAAA;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;oBACpC,IAAI,MAAM,GAAI,SAAS,CAAC,IAAI,GAAG,CAAC,CAAY,KAAK,GAAG,CAAA;oBACpD,IAAI,GAAG,KAAK,CAAC;wBAAE,MAAM,IAAK,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAY,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAA;oBACjF,MAAM,MAAM,CAAC,CAAA;oBACb,IAAI,CAAC,KAAK,UAAU,GAAG,CAAC;wBAAE,MAAM,IAAI,QAAQ,CAAA;oBAC5C,GAAG,IAAI,MAAM,GAAI,IAAI,CAAC,CAAC,CAAY,CAAA;gBACrC,CAAC;gBACD,IAAI,QAAQ,CAAC,GAAG,CAAC;oBAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAY,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACjF,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,39 @@
+export type { NegentropyErrorCode, NegentropyErrorOptions } from './errors.js';
+export { NegentropyError } from './errors.js';
+export { markovMinEntropyPerBit, mcvMinEntropy, shannonEntropy, toBits, } from './estimators/entropy.js';
+export { chiSquareBytes, monobit, runsTest, serialCorrelation } from './estimators/frequency.js';
+export type { ContrastNegentropy, MomentNegentropy } from './estimators/negentropy.js';
+export { EXP_GAUSSIAN_MEAN, EXP_GAUSSIAN_VARIANCE, EXP_NULL_VARIANCE, LOGCOSH_GAUSSIAN_MEAN, LOGCOSH_GAUSSIAN_VARIANCE, LOGCOSH_NULL_VARIANCE, negentropyExp, negentropyKurtosis, negentropyLogcosh, } from './estimators/negentropy.js';
+export type { DitherOptions } from './estimators/pipeline.js';
+export { ditheredTrialZ, probitBytes } from './estimators/pipeline.js';
+export { negentropyVasicek, vasicekEntropy } from './estimators/vasicek.js';
+export type { WindowedEstimator, WindowedNegentropyOptions, WindowedNegentropyPoint, } from './estimators/windowed.js';
+export { windowedNegentropy } from './estimators/windowed.js';
+export { analyzeBytes, analyzeTrials } from './experiment/batch.js';
+export { bonferroni, compositeZ } from './experiment/composite.js';
+export type { RegisteredExperiment } from './experiment/registration.js';
+export { canonicalJson, registerExperiment } from './experiment/registration.js';
+export type { Session, SessionOptions, SessionTick } from './experiment/session.js';
+export { session } from './experiment/session.js';
+export type { EventResult, EventSpec, EventStatistic, ExperimentComposite, ExperimentConfig, ExperimentResult, } from './experiment/types.js';
+export type { AccountedBytes, EntropyClaim, PipelineOp, PipelineStep, } from './extract/accounting.js';
+export { claimBytes, conditionAccounted, debiasAccounted, extractAccounted, vettedOutputEntropy, } from './extract/accounting.js';
+export type { ConditionStreamOptions } from './extract/condition.js';
+export { conditionStream, hmacCondition, sha256Condition } from './extract/condition.js';
+export { peres, peresRate, vonNeumann } from './extract/debias.js';
+export type { HealthAlarm, HealthConfig } from './extract/health.js';
+export { aptCutoff, ContinuousHealth, rctCutoff } from './extract/health.js';
+export type { ToeplitzExtractor } from './extract/toeplitz.js';
+export { toeplitzExtractor, toeplitzOutputBits } from './extract/toeplitz.js';
+export type { CalibrateOptions } from './stats/calibration.js';
+export { calibrate, theoreticalCalibration } from './stats/calibration.js';
+export { cumulativeDeviation, significanceEnvelope } from './stats/cumdev.js';
+export type { PairCorrelation } from './stats/network.js';
+export { devvar, interSourceCorrelation, netvar } from './stats/network.js';
+export type { Tail } from './stats/pvalues.js';
+export { chiSquareP, normalP, P_FLOOR } from './stats/pvalues.js';
+export type { TrialStreamConfig } from './stats/trials.js';
+export { DEFAULT_BITS_PER_TRIAL, trialStream, trialsFromBytes } from './stats/trials.js';
+export { stoufferZ, zScores } from './stats/zscores.js';
+export type { Calibration, StatResult, Trial, TrialClock, TrialConfig, TrialSeries, TrialSource, TrialStreamOptions, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAA;AAE9E,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,cAAc,EACd,MAAM,GACP,MAAM,yBAAyB,CAAA;AAChC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAA;AAChG,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AACtF,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,iBAAiB,EACjB,qBAAqB,EACrB,yBAAyB,EACzB,qBAAqB,EACrB,aAAa,EACb,kBAAkB,EAClB,iBAAiB,GAClB,MAAM,4BAA4B,CAAA;AACnC,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAA;AAC7D,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AACtE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC3E,YAAY,EACV,iBAAiB,EACjB,yBAAyB,EACzB,uBAAuB,GACxB,MAAM,0BAA0B,CAAA;AACjC,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAC7D,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AACnE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAA;AAClE,YAAY,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAA;AACxE,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAA;AAChF,YAAY,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAA;AACnF,OAAO,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAA;AACjD,YAAY,EACV,WAAW,EACX,SAAS,EACT,cAAc,EACd,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,uBAAuB,CAAA;AAC9B,YAAY,EACV,cAAc,EACd,YAAY,EACZ,UAAU,EACV,YAAY,GACb,MAAM,yBAAyB,CAAA;AAChC,OAAO,EACL,UAAU,EACV,kBAAkB,EAClB,eAAe,EACf,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,yBAAyB,CAAA;AAChC,YAAY,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AACpE,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AACxF,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAA;AAClE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAA;AACpE,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAC5E,YAAY,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAA;AAC9D,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAA;AAC7E,YAAY,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AAC9D,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAC1E,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAA;AAC7E,YAAY,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAA;AACzD,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAA;AAC3E,YAAY,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAA;AAC9C,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AACjE,YAAY,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAC1D,OAAO,EAAE,sBAAsB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AACxF,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AACvD,YAAY,EACV,WAAW,EACX,UAAU,EACV,KAAK,EACL,UAAU,EACV,WAAW,EACX,WAAW,EACX,WAAW,EACX,kBAAkB,GACnB,MAAM,YAAY,CAAA"}

package/dist/index.js

@@ -0,0 +1,23 @@
+export { NegentropyError } from './errors.js';
+export { markovMinEntropyPerBit, mcvMinEntropy, shannonEntropy, toBits, } from './estimators/entropy.js';
+export { chiSquareBytes, monobit, runsTest, serialCorrelation } from './estimators/frequency.js';
+export { EXP_GAUSSIAN_MEAN, EXP_GAUSSIAN_VARIANCE, EXP_NULL_VARIANCE, LOGCOSH_GAUSSIAN_MEAN, LOGCOSH_GAUSSIAN_VARIANCE, LOGCOSH_NULL_VARIANCE, negentropyExp, negentropyKurtosis, negentropyLogcosh, } from './estimators/negentropy.js';
+export { ditheredTrialZ, probitBytes } from './estimators/pipeline.js';
+export { negentropyVasicek, vasicekEntropy } from './estimators/vasicek.js';
+export { windowedNegentropy } from './estimators/windowed.js';
+export { analyzeBytes, analyzeTrials } from './experiment/batch.js';
+export { bonferroni, compositeZ } from './experiment/composite.js';
+export { canonicalJson, registerExperiment } from './experiment/registration.js';
+export { session } from './experiment/session.js';
+export { claimBytes, conditionAccounted, debiasAccounted, extractAccounted, vettedOutputEntropy, } from './extract/accounting.js';
+export { conditionStream, hmacCondition, sha256Condition } from './extract/condition.js';
+export { peres, peresRate, vonNeumann } from './extract/debias.js';
+export { aptCutoff, ContinuousHealth, rctCutoff } from './extract/health.js';
+export { toeplitzExtractor, toeplitzOutputBits } from './extract/toeplitz.js';
+export { calibrate, theoreticalCalibration } from './stats/calibration.js';
+export { cumulativeDeviation, significanceEnvelope } from './stats/cumdev.js';
+export { devvar, interSourceCorrelation, netvar } from './stats/network.js';
+export { chiSquareP, normalP, P_FLOOR } from './stats/pvalues.js';
+export { DEFAULT_BITS_PER_TRIAL, trialStream, trialsFromBytes } from './stats/trials.js';
+export { stoufferZ, zScores } from './stats/zscores.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,cAAc,EACd,MAAM,GACP,MAAM,yBAAyB,CAAA;AAChC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAA;AAEhG,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,iBAAiB,EACjB,qBAAqB,EACrB,yBAAyB,EACzB,qBAAqB,EACrB,aAAa,EACb,kBAAkB,EAClB,iBAAiB,GAClB,MAAM,4BAA4B,CAAA;AAEnC,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AACtE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAM3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAC7D,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AACnE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAA;AAElE,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAA;AAEhF,OAAO,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAA;AAejD,OAAO,EACL,UAAU,EACV,kBAAkB,EAClB,eAAe,EACf,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,yBAAyB,CAAA;AAEhC,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AACxF,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAA;AAElE,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAE5E,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAA;AAE7E,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAC1E,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAA;AAE7E,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAA;AAE3E,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAEjE,OAAO,EAAE,sBAAsB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AACxF,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA"}

package/dist/internal/bytes.d.ts

@@ -0,0 +1,6 @@
+/** Number of one-bits in each byte value. */
+export declare const POPCOUNT: Uint8Array;
+/** Unpack bytes into bits, MSB first (the SDK-wide bit order). */
+export declare function toBits(data: Uint8Array): Uint8Array;
+export declare function concatBytes(chunks: readonly Uint8Array[]): Uint8Array;
+//# sourceMappingURL=bytes.d.ts.map

package/dist/internal/bytes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.d.ts","sourceRoot":"","sources":["../../src/internal/bytes.ts"],"names":[],"mappings":"AAAA,6CAA6C;AAC7C,eAAO,MAAM,QAAQ,EAAE,UAYnB,CAAA;AAEJ,kEAAkE;AAClE,wBAAgB,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAMnD;AAED,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,GAAG,UAAU,CAUrE"}

package/dist/internal/bytes.js

@@ -0,0 +1,36 @@
+/** Number of one-bits in each byte value. */
+export const POPCOUNT = (() => {
+    const table = new Uint8Array(256);
+    for (let i = 0; i < 256; i++) {
+        let v = i;
+        let count = 0;
+        while (v) {
+            count += v & 1;
+            v >>= 1;
+        }
+        table[i] = count;
+    }
+    return table;
+})();
+/** Unpack bytes into bits, MSB first (the SDK-wide bit order). */
+export function toBits(data) {
+    const bits = new Uint8Array(data.length * 8);
+    for (let i = 0; i < data.length; i++) {
+        for (let b = 0; b < 8; b++)
+            bits[i * 8 + b] = (data[i] >> (7 - b)) & 1;
+    }
+    return bits;
+}
+export function concatBytes(chunks) {
+    let total = 0;
+    for (const chunk of chunks)
+        total += chunk.length;
+    const out = new Uint8Array(total);
+    let offset = 0;
+    for (const chunk of chunks) {
+        out.set(chunk, offset);
+        offset += chunk.length;
+    }
+    return out;
+}
+//# sourceMappingURL=bytes.js.map

package/dist/internal/bytes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.js","sourceRoot":"","sources":["../../src/internal/bytes.ts"],"names":[],"mappings":"AAAA,6CAA6C;AAC7C,MAAM,CAAC,MAAM,QAAQ,GAAe,CAAC,GAAG,EAAE;IACxC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,OAAO,CAAC,EAAE,CAAC;YACT,KAAK,IAAI,CAAC,GAAG,CAAC,CAAA;YACd,CAAC,KAAK,CAAC,CAAA;QACT,CAAC;QACD,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAC,EAAE,CAAA;AAEJ,kEAAkE;AAClE,MAAM,UAAU,MAAM,CAAC,IAAgB;IACrC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAE,IAAI,CAAC,CAAC,CAAY,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACpF,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,MAA6B;IACvD,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,KAAK,IAAI,KAAK,CAAC,MAAM,CAAA;IACjD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;IACjC,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QACtB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;IACxB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/dist/internal/kahan.d.ts

@@ -0,0 +1,7 @@
+/** Kahan-compensated summation — keeps long accumulations at O(ε) error. */
+export declare class KahanSum {
+    #private;
+    add(x: number): void;
+    get value(): number;
+}
+//# sourceMappingURL=kahan.d.ts.map

package/dist/internal/kahan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kahan.d.ts","sourceRoot":"","sources":["../../src/internal/kahan.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,qBAAa,QAAQ;;IAInB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAOpB,IAAI,KAAK,IAAI,MAAM,CAElB;CACF"}

package/dist/internal/kahan.js

@@ -0,0 +1,15 @@
+/** Kahan-compensated summation — keeps long accumulations at O(ε) error. */
+export class KahanSum {
+    #sum = 0;
+    #compensation = 0;
+    add(x) {
+        const y = x - this.#compensation;
+        const t = this.#sum + y;
+        this.#compensation = t - this.#sum - y;
+        this.#sum = t;
+    }
+    get value() {
+        return this.#sum;
+    }
+}
+//# sourceMappingURL=kahan.js.map

package/dist/internal/kahan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kahan.js","sourceRoot":"","sources":["../../src/internal/kahan.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,MAAM,OAAO,QAAQ;IACnB,IAAI,GAAG,CAAC,CAAA;IACR,aAAa,GAAG,CAAC,CAAA;IAEjB,GAAG,CAAC,CAAS;QACX,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAA;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACvB,IAAI,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;IACf,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;CACF"}

package/dist/internal/prng.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Deterministic xorshift32 uniform stream in (0, 1) exclusive. Used for
+ * dither noise — dither must be reproducible and must NEVER spend the
+ * randomness under test.
+ */
+export declare function uniformStream(seed?: number): () => number;
+//# sourceMappingURL=prng.d.ts.map

package/dist/internal/prng.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prng.d.ts","sourceRoot":"","sources":["../../src/internal/prng.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,SAAa,GAAG,MAAM,MAAM,CAS7D"}

package/dist/internal/prng.js

@@ -0,0 +1,16 @@
+/**
+ * Deterministic xorshift32 uniform stream in (0, 1) exclusive. Used for
+ * dither noise — dither must be reproducible and must NEVER spend the
+ * randomness under test.
+ */
+export function uniformStream(seed = 0x9e3779b9) {
+    let state = seed >>> 0 || 1;
+    return () => {
+        state ^= state << 13;
+        state ^= state >>> 17;
+        state ^= state << 5;
+        state >>>= 0;
+        return (state + 0.5) / 4294967296;
+    };
+}
+//# sourceMappingURL=prng.js.map

package/dist/internal/prng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prng.js","sourceRoot":"","sources":["../../src/internal/prng.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAI,GAAG,UAAU;IAC7C,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;IAC3B,OAAO,GAAG,EAAE;QACV,KAAK,IAAI,KAAK,IAAI,EAAE,CAAA;QACpB,KAAK,IAAI,KAAK,KAAK,EAAE,CAAA;QACrB,KAAK,IAAI,KAAK,IAAI,CAAC,CAAA;QACnB,KAAK,MAAM,CAAC,CAAA;QACZ,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,UAAU,CAAA;IACnC,CAAC,CAAA;AACH,CAAC"}