@mindpeeker/negentropy 0.1.0

package/dist/stats/network.js

@@ -0,0 +1,119 @@
+import { NegentropyError } from '../errors.js';
+import { KahanSum } from '../internal/kahan.js';
+import { chiSquareP, normalP } from './pvalues.js';
+import { stoufferZ } from './zscores.js';
+/**
+ * All network statistics consume a "z matrix": one Float64Array of z-scores
+ * per source, all the same length (steps), step-aligned across sources.
+ * Useful identity relating the three: Z_s(t)² = [Σᵢzᵢ² + 2S(t)] / N — netvar
+ * is a specific mixture of device variance and covariance.
+ */
+function checkMatrix(zBySource, sources) {
+    if (zBySource.length === 0 || zBySource.length !== sources.length) {
+        throw new NegentropyError('invalid_config', `need one z array per source: got ${zBySource.length} arrays for ${sources.length} sources`);
+    }
+    const steps = zBySource[0].length;
+    for (let i = 1; i < zBySource.length; i++) {
+        if (zBySource[i].length !== steps) {
+            throw new NegentropyError('invalid_config', `z arrays must be step-aligned: ${sources[i]} has ${zBySource[i].length} steps, ${sources[0]} has ${steps}`);
+        }
+    }
+    if (steps === 0) {
+        throw new NegentropyError('insufficient_data', 'network statistics need at least one step');
+    }
+    return steps;
+}
+/**
+ * Network variance — the GCP standard event statistic: Σₜ Z_s(t)² where
+ * Z_s(t) is the per-step Stouffer Z across sources; ~ χ²(steps) under H0.
+ * Sensitive to a common signal shared across sources and to mean shifts.
+ */
+export function netvar(zBySource, sources) {
+    const steps = checkMatrix(zBySource, sources);
+    const acc = new KahanSum();
+    const zAt = new Float64Array(zBySource.length);
+    for (let t = 0; t < steps; t++) {
+        for (let i = 0; i < zBySource.length; i++)
+            zAt[i] = zBySource[i][t];
+        const z = stoufferZ(zAt);
+        acc.add(z * z);
+    }
+    const statistic = acc.value;
+    return {
+        statistic,
+        df: steps,
+        pValue: chiSquareP(statistic, steps),
+        n: steps,
+        sources: [...sources],
+    };
+}
+/**
+ * Device variance: Σₜ Σᵢ zᵢ(t)² ~ χ²(steps × sources) under H0. Sensitive to
+ * individual sources changing variance; blind to cross-source correlation.
+ */
+export function devvar(zBySource, sources) {
+    const steps = checkMatrix(zBySource, sources);
+    const acc = new KahanSum();
+    for (const zs of zBySource) {
+        for (let t = 0; t < steps; t++) {
+            const z = zs[t];
+            acc.add(z * z);
+        }
+    }
+    const df = steps * zBySource.length;
+    const statistic = acc.value;
+    return {
+        statistic,
+        df,
+        pValue: chiSquareP(statistic, df),
+        n: steps,
+        sources: [...sources],
+    };
+}
+/**
+ * Inter-source correlation: per step S(t) = Σᵢ<ⱼ zᵢzⱼ = ((Σz)² − Σz²)/2;
+ * statistic = ΣₜS(t) / √(steps·N(N−1)/2), treated as N(0,1) by the CLT.
+ * Not valid for tiny steps×pairs — expect ≥ ~100 products before trusting
+ * the normal approximation. `df` reports that product count for context; the
+ * p-value comes from the normal tail (one-sided: excess correlation).
+ */
+export function interSourceCorrelation(zBySource, sources) {
+    const steps = checkMatrix(zBySource, sources);
+    const n = zBySource.length;
+    if (n < 2) {
+        throw new NegentropyError('invalid_config', 'interSourceCorrelation needs at least 2 sources');
+    }
+    const total = new KahanSum();
+    for (let t = 0; t < steps; t++) {
+        let sum = 0;
+        let sumSq = 0;
+        for (let i = 0; i < n; i++) {
+            const z = zBySource[i][t];
+            sum += z;
+            sumSq += z * z;
+        }
+        total.add((sum * sum - sumSq) / 2);
+    }
+    const pairCount = (n * (n - 1)) / 2;
+    const statistic = total.value / Math.sqrt(steps * pairCount);
+    const pairs = [];
+    for (let i = 0; i < n; i++) {
+        for (let j = i + 1; j < n; j++) {
+            const za = zBySource[i];
+            const zb = zBySource[j];
+            const acc = new KahanSum();
+            for (let t = 0; t < steps; t++)
+                acc.add(za[t] * zb[t]);
+            pairs.push({ a: sources[i], b: sources[j], r: acc.value / steps });
+        }
+    }
+    return {
+        statistic,
+        df: steps * pairCount,
+        pValue: normalP(statistic, 'upper'),
+        n: steps,
+        sources: [...sources],
+        pairs,
+    };
+}
+//# sourceMappingURL=network.js.map

package/dist/stats/network.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network.js","sourceRoot":"","sources":["../../src/stats/network.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAC9C,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAA;AAE/C,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAA;AAExC;;;;;GAKG;AACH,SAAS,WAAW,CAAC,SAAkC,EAAE,OAA0B;IACjF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QAClE,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,oCAAoC,SAAS,CAAC,MAAM,eAAe,OAAO,CAAC,MAAM,UAAU,CAC5F,CAAA;IACH,CAAC;IACD,MAAM,KAAK,GAAI,SAAS,CAAC,CAAC,CAAkB,CAAC,MAAM,CAAA;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAK,SAAS,CAAC,CAAC,CAAkB,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;YACpD,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,kCAAkC,OAAO,CAAC,CAAC,CAAC,QAAS,SAAS,CAAC,CAAC,CAAkB,CAAC,MAAM,WAAW,OAAO,CAAC,CAAC,CAAC,QAAQ,KAAK,EAAE,CAC9H,CAAA;QACH,CAAC;IACH,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,eAAe,CAAC,mBAAmB,EAAE,2CAA2C,CAAC,CAAA;IAC7F,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,SAAkC,EAAE,OAA0B;IACnF,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,GAAG,GAAG,IAAI,QAAQ,EAAE,CAAA;IAC1B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAI,SAAS,CAAC,CAAC,CAAkB,CAAC,CAAC,CAAW,CAAA;QAC/F,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAA;QACxB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAChB,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAA;IAC3B,OAAO;QACL,SAAS;QACT,EAAE,EAAE,KAAK;QACT,MAAM,EAAE,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC;QACpC,CAAC,EAAE,KAAK;QACR,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;KACtB,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,SAAkC,EAAE,OAA0B;IACnF,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,GAAG,GAAG,IAAI,QAAQ,EAAE,CAAA;IAC1B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAW,CAAA;YACzB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IACD,MAAM,EAAE,GAAG,KAAK,GAAG,SAAS,CAAC,MAAM,CAAA;IACnC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAA;IAC3B,OAAO;QACL,SAAS;QACT,EAAE;QACF,MAAM,EAAE,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;QACjC,CAAC,EAAE,KAAK;QACR,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;KACtB,CAAA;AACH,CAAC;AASD;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAAkC,EAClC,OAA0B;IAE1B,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAA;IAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,MAAM,IAAI,eAAe,CAAC,gBAAgB,EAAE,iDAAiD,CAAC,CAAA;IAChG,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,QAAQ,EAAE,CAAA;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAI,SAAS,CAAC,CAAC,CAAkB,CAAC,CAAC,CAAW,CAAA;YACrD,GAAG,IAAI,CAAC,CAAA;YACR,KAAK,IAAI,CAAC,GAAG,CAAC,CAAA;QAChB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IACpC,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACnC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAA;IAC5D,MAAM,KAAK,GAAsB,EAAE,CAAA;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAiB,CAAA;YACvC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAiB,CAAA;YACvC,MAAM,GAAG,GAAG,IAAI,QAAQ,EAAE,CAAA;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC,CAAC,CAAY,GAAI,EAAE,CAAC,CAAC,CAAY,CAAC,CAAA;YAC9E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAW,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAW,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC,CAAA;QACxF,CAAC;IACH,CAAC;IACD,OAAO;QACL,SAAS;QACT,EAAE,EAAE,KAAK,GAAG,SAAS;QACrB,MAAM,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC;QACnC,CAAC,EAAE,KAAK;QACR,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,KAAK;KACN,CAAA;AACH,CAAC"}

package/dist/stats/pvalues.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Floor applied to every public p-value so downstream probit conversion
+ * (composites) never sees an exact zero.
+ */
+export declare const P_FLOOR = 1e-300;
+export type Tail = 'two' | 'upper' | 'lower';
+/** p-value of a standard-normal statistic. Default two-sided. */
+export declare function normalP(z: number, tail?: Tail): number;
+/** Upper-tail p-value of a chi-square statistic (the GCP convention: variance excess). */
+export declare function chiSquareP(statistic: number, df: number): number;
+//# sourceMappingURL=pvalues.d.ts.map

package/dist/stats/pvalues.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pvalues.d.ts","sourceRoot":"","sources":["../../src/stats/pvalues.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,eAAO,MAAM,OAAO,SAAS,CAAA;AAE7B,MAAM,MAAM,IAAI,GAAG,KAAK,GAAG,OAAO,GAAG,OAAO,CAAA;AAE5C,iEAAiE;AACjE,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,GAAE,IAAY,GAAG,MAAM,CAM7D;AAED,0FAA0F;AAC1F,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAEhE"}

package/dist/stats/pvalues.js

@@ -0,0 +1,18 @@
+import { chi2Sf, normCdf, normSf } from '../internal/special.js';
+/**
+ * Floor applied to every public p-value so downstream probit conversion
+ * (composites) never sees an exact zero.
+ */
+export const P_FLOOR = 1e-300;
+/** p-value of a standard-normal statistic. Default two-sided. */
+export function normalP(z, tail = 'two') {
+    const upper = normSf(z);
+    const lower = normCdf(z);
+    const p = tail === 'upper' ? upper : tail === 'lower' ? lower : Math.min(1, 2 * Math.min(upper, lower));
+    return Math.max(p, P_FLOOR);
+}
+/** Upper-tail p-value of a chi-square statistic (the GCP convention: variance excess). */
+export function chiSquareP(statistic, df) {
+    return Math.max(chi2Sf(statistic, df), P_FLOOR);
+}
+//# sourceMappingURL=pvalues.js.map

package/dist/stats/pvalues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pvalues.js","sourceRoot":"","sources":["../../src/stats/pvalues.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAA;AAEhE;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAA;AAI7B,iEAAiE;AACjE,MAAM,UAAU,OAAO,CAAC,CAAS,EAAE,OAAa,KAAK;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACvB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACxB,MAAM,CAAC,GACL,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;IAC/F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;AAC7B,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,EAAU;IACtD,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,CAAA;AACjD,CAAC"}

package/dist/stats/trials.d.ts

@@ -0,0 +1,34 @@
+import type { Trial, TrialConfig, TrialSeries, TrialSource } from '../types.js';
+export declare const DEFAULT_BITS_PER_TRIAL = 200;
+/**
+ * Batch trial extraction: slice a recorded byte buffer into trial sums — the
+ * number of one-bits among each run of `bitsPerTrial` consecutive bits
+ * (MSB-first). Under H0 each sum ~ Binomial(bitsPerTrial, ½). Trailing bits
+ * that do not fill a whole trial are dropped and reported via `leftoverBits`,
+ * never zero-padded.
+ */
+export declare function trialsFromBytes(bytes: Uint8Array, source: string, config?: TrialConfig): TrialSeries;
+export interface TrialStreamConfig extends TrialConfig {
+    signal?: AbortSignal;
+    /** Desired chunk size passed through to the source's stream. */
+    chunkBytes?: number;
+    /** Clock used by interval mode — injectable for deterministic tests. */
+    now?: () => number;
+}
+/**
+ * Live trial extraction from a byte source. Lazy and pull-based: no I/O
+ * happens before the first `next()`, and a slow consumer slows the source
+ * (the backpressure convention of `@mindpeeker/entropy` streams).
+ *
+ * Count mode (default) completes a trial every `bitsPerTrial` bits. Interval
+ * mode is GCP-style wall-clock bucketing: the first `bitsPerTrial` bits
+ * arriving inside each `intervalMs` bucket form that bucket's trial, extra
+ * bits in the bucket are discarded, and an underfilled bucket yields no trial
+ * — `Trial.index` is bucket-relative there, so missing buckets appear as
+ * index gaps.
+ *
+ * The source ending simply ends this stream; a source error is rethrown as
+ * `source_failed` (or `aborted` when the caller's signal fired).
+ */
+export declare function trialStream(source: TrialSource, config?: TrialStreamConfig): AsyncGenerator<Trial>;
+//# sourceMappingURL=trials.d.ts.map

package/dist/stats/trials.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trials.d.ts","sourceRoot":"","sources":["../../src/stats/trials.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAE/E,eAAO,MAAM,sBAAsB,MAAM,CAAA;AAczC;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,MAAM,EACd,MAAM,GAAE,WAAgB,GACvB,WAAW,CAiCb;AAED,MAAM,WAAW,iBAAkB,SAAQ,WAAW;IACpD,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,gEAAgE;IAChE,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,wEAAwE;IACxE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;CACnB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAuB,WAAW,CAChC,MAAM,EAAE,WAAW,EACnB,MAAM,GAAE,iBAAsB,GAC7B,cAAc,CAAC,KAAK,CAAC,CA0EvB"}

package/dist/stats/trials.js

@@ -0,0 +1,149 @@
+import { NegentropyError } from '../errors.js';
+import { POPCOUNT } from '../internal/bytes.js';
+export const DEFAULT_BITS_PER_TRIAL = 200;
+function validateBitsPerTrial(bitsPerTrial, source) {
+    const k = bitsPerTrial ?? DEFAULT_BITS_PER_TRIAL;
+    if (!Number.isInteger(k) || k < 8) {
+        throw new NegentropyError('invalid_config', `bitsPerTrial must be an integer ≥ 8, got ${bitsPerTrial}`, { source });
+    }
+    return k;
+}
+/**
+ * Batch trial extraction: slice a recorded byte buffer into trial sums — the
+ * number of one-bits among each run of `bitsPerTrial` consecutive bits
+ * (MSB-first). Under H0 each sum ~ Binomial(bitsPerTrial, ½). Trailing bits
+ * that do not fill a whole trial are dropped and reported via `leftoverBits`,
+ * never zero-padded.
+ */
+export function trialsFromBytes(bytes, source, config = {}) {
+    const k = validateBitsPerTrial(config.bitsPerTrial, source);
+    const totalBits = bytes.length * 8;
+    const count = Math.floor(totalBits / k);
+    const sums = new Float64Array(count);
+    if (k % 8 === 0) {
+        // fast path: trials are byte-aligned — sum popcounts
+        const bytesPerTrial = k / 8;
+        for (let t = 0; t < count; t++) {
+            let sum = 0;
+            const base = t * bytesPerTrial;
+            for (let i = 0; i < bytesPerTrial; i++)
+                sum += POPCOUNT[bytes[base + i] & 0xff];
+            sums[t] = sum;
+        }
+    }
+    else {
+        let sum = 0;
+        let bits = 0;
+        let t = 0;
+        for (let i = 0; i < bytes.length && t < count; i++) {
+            const byte = bytes[i];
+            for (let b = 7; b >= 0; b--) {
+                sum += (byte >> b) & 1;
+                if (++bits === k) {
+                    sums[t++] = sum;
+                    sum = 0;
+                    bits = 0;
+                    if (t === count)
+                        break;
+                }
+            }
+        }
+    }
+    return { source, bitsPerTrial: k, sums, leftoverBits: totalBits - count * k };
+}
+/**
+ * Live trial extraction from a byte source. Lazy and pull-based: no I/O
+ * happens before the first `next()`, and a slow consumer slows the source
+ * (the backpressure convention of `@mindpeeker/entropy` streams).
+ *
+ * Count mode (default) completes a trial every `bitsPerTrial` bits. Interval
+ * mode is GCP-style wall-clock bucketing: the first `bitsPerTrial` bits
+ * arriving inside each `intervalMs` bucket form that bucket's trial, extra
+ * bits in the bucket are discarded, and an underfilled bucket yields no trial
+ * — `Trial.index` is bucket-relative there, so missing buckets appear as
+ * index gaps.
+ *
+ * The source ending simply ends this stream; a source error is rethrown as
+ * `source_failed` (or `aborted` when the caller's signal fired).
+ */
+export async function* trialStream(source, config = {}) {
+    const k = validateBitsPerTrial(config.bitsPerTrial, source.name);
+    const clock = config.clock ?? { mode: 'count' };
+    if (clock.mode === 'interval' && (!Number.isFinite(clock.intervalMs) || clock.intervalMs <= 0)) {
+        throw new NegentropyError('invalid_config', `intervalMs must be > 0, got ${clock.intervalMs}`, {
+            source: source.name,
+        });
+    }
+    const now = config.now ?? (() => Date.now());
+    const signal = config.signal;
+    const abortError = () => new NegentropyError('aborted', 'trial stream aborted', { source: source.name });
+    if (signal?.aborted)
+        throw abortError();
+    let sum = 0;
+    let bits = 0;
+    let index = 0;
+    // interval-mode state
+    let activeBucket = Number.NEGATIVE_INFINITY;
+    let bucketFilled = false;
+    let firstBucket;
+    try {
+        for await (const chunk of source.stream({ signal, chunkBytes: config.chunkBytes })) {
+            if (signal?.aborted)
+                throw abortError();
+            const at = now();
+            if (clock.mode === 'interval') {
+                const bucket = Math.floor(at / clock.intervalMs);
+                if (bucket !== activeBucket) {
+                    activeBucket = bucket;
+                    sum = 0;
+                    bits = 0;
+                    bucketFilled = false;
+                }
+                if (bucketFilled)
+                    continue;
+            }
+            for (let i = 0; i < chunk.length; i++) {
+                const byte = chunk[i];
+                if (bits + 8 < k) {
+                    sum += POPCOUNT[byte & 0xff];
+                    bits += 8;
+                    continue;
+                }
+                for (let b = 7; b >= 0; b--) {
+                    sum += (byte >> b) & 1;
+                    if (++bits === k) {
+                        if (clock.mode === 'interval') {
+                            firstBucket ??= activeBucket;
+                            bucketFilled = true;
+                            yield { sum, index: activeBucket - firstBucket, at };
+                        }
+                        else {
+                            yield { sum, index: index++, at };
+                        }
+                        sum = 0;
+                        bits = 0;
+                        if (clock.mode === 'interval')
+                            break;
+                    }
+                }
+                if (clock.mode === 'interval' && bucketFilled)
+                    break;
+            }
+        }
+    }
+    catch (error) {
+        if (error instanceof NegentropyError)
+            throw error;
+        if (signal?.aborted) {
+            throw new NegentropyError('aborted', 'trial stream aborted', {
+                source: source.name,
+                cause: error,
+            });
+        }
+        throw new NegentropyError('source_failed', `${source.name} stream failed`, {
+            source: source.name,
+            cause: error,
+        });
+    }
+}
+//# sourceMappingURL=trials.js.map

package/dist/stats/trials.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trials.js","sourceRoot":"","sources":["../../src/stats/trials.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAC9C,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAA;AAG/C,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAEzC,SAAS,oBAAoB,CAAC,YAAgC,EAAE,MAAe;IAC7E,MAAM,CAAC,GAAG,YAAY,IAAI,sBAAsB,CAAA;IAChD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,4CAA4C,YAAY,EAAE,EAC1D,EAAE,MAAM,EAAE,CACX,CAAA;IACH,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAiB,EACjB,MAAc,EACd,SAAsB,EAAE;IAExB,MAAM,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAA;IAC3D,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;IACvC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAA;IACpC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAChB,qDAAqD;QACrD,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,CAAA;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,GAAG,GAAG,CAAC,CAAA;YACX,MAAM,IAAI,GAAG,CAAC,GAAG,aAAa,CAAA;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;gBACpC,GAAG,IAAI,QAAQ,CAAE,KAAK,CAAC,IAAI,GAAG,CAAC,CAAY,GAAG,IAAI,CAAW,CAAA;YAC/D,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;QACf,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAA;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;gBACtB,IAAI,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;oBACjB,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAA;oBACf,GAAG,GAAG,CAAC,CAAA;oBACP,IAAI,GAAG,CAAC,CAAA;oBACR,IAAI,CAAC,KAAK,KAAK;wBAAE,MAAK;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,GAAG,KAAK,GAAG,CAAC,EAAE,CAAA;AAC/E,CAAC;AAUD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,WAAW,CAChC,MAAmB,EACnB,SAA4B,EAAE;IAE9B,MAAM,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;IAChE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IAC/C,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/F,MAAM,IAAI,eAAe,CAAC,gBAAgB,EAAE,+BAA+B,KAAK,CAAC,UAAU,EAAE,EAAE;YAC7F,MAAM,EAAE,MAAM,CAAC,IAAI;SACpB,CAAC,CAAA;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;IAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAA;IAC5B,MAAM,UAAU,GAAG,GAAG,EAAE,CACtB,IAAI,eAAe,CAAC,SAAS,EAAE,sBAAsB,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAA;IACjF,IAAI,MAAM,EAAE,OAAO;QAAE,MAAM,UAAU,EAAE,CAAA;IAEvC,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,sBAAsB;IACtB,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAA;IAC3C,IAAI,YAAY,GAAG,KAAK,CAAA;IACxB,IAAI,WAA+B,CAAA;IAEnC,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC;YACnF,IAAI,MAAM,EAAE,OAAO;gBAAE,MAAM,UAAU,EAAE,CAAA;YACvC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAA;YAChB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAA;gBAChD,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;oBAC5B,YAAY,GAAG,MAAM,CAAA;oBACrB,GAAG,GAAG,CAAC,CAAA;oBACP,IAAI,GAAG,CAAC,CAAA;oBACR,YAAY,GAAG,KAAK,CAAA;gBACtB,CAAC;gBACD,IAAI,YAAY;oBAAE,SAAQ;YAC5B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAA;gBAC/B,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjB,GAAG,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAW,CAAA;oBACtC,IAAI,IAAI,CAAC,CAAA;oBACT,SAAQ;gBACV,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5B,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;oBACtB,IAAI,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;wBACjB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;4BAC9B,WAAW,KAAK,YAAY,CAAA;4BAC5B,YAAY,GAAG,IAAI,CAAA;4BACnB,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,GAAG,WAAW,EAAE,EAAE,EAAE,CAAA;wBACtD,CAAC;6BAAM,CAAC;4BACN,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAA;wBACnC,CAAC;wBACD,GAAG,GAAG,CAAC,CAAA;wBACP,IAAI,GAAG,CAAC,CAAA;wBACR,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;4BAAE,MAAK;oBACtC,CAAC;gBACH,CAAC;gBACD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,YAAY;oBAAE,MAAK;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,eAAe;YAAE,MAAM,KAAK,CAAA;QACjD,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,MAAM,IAAI,eAAe,CAAC,SAAS,EAAE,sBAAsB,EAAE;gBAC3D,MAAM,EAAE,MAAM,CAAC,IAAI;gBACnB,KAAK,EAAE,KAAK;aACb,CAAC,CAAA;QACJ,CAAC;QACD,MAAM,IAAI,eAAe,CAAC,eAAe,EAAE,GAAG,MAAM,CAAC,IAAI,gBAAgB,EAAE;YACzE,MAAM,EAAE,MAAM,CAAC,IAAI;YACnB,KAAK,EAAE,KAAK;SACb,CAAC,CAAA;IACJ,CAAC;AACH,CAAC"}

package/dist/stats/zscores.d.ts

@@ -0,0 +1,10 @@
+import type { Calibration, TrialSeries } from '../types.js';
+/** z_i = (sum_i − cal.mean) / cal.sd for every trial in the series. */
+export declare function zScores(series: TrialSeries, cal: Calibration): Float64Array;
+/**
+ * Stouffer's combined z: Σz / √n. Assumes the inputs are independent —
+ * correlated sources inflate its variance, which is exactly what
+ * `interSourceCorrelation` measures; do not "fix" it here.
+ */
+export declare function stoufferZ(zs: ArrayLike<number>): number;
+//# sourceMappingURL=zscores.d.ts.map

package/dist/stats/zscores.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"zscores.d.ts","sourceRoot":"","sources":["../../src/stats/zscores.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAE3D,uEAAuE;AACvE,wBAAgB,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,WAAW,GAAG,YAAY,CAW3E;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAOvD"}

package/dist/stats/zscores.js

@@ -0,0 +1,26 @@
+import { NegentropyError } from '../errors.js';
+/** z_i = (sum_i − cal.mean) / cal.sd for every trial in the series. */
+export function zScores(series, cal) {
+    if (cal.source !== series.source || cal.bitsPerTrial !== series.bitsPerTrial) {
+        throw new NegentropyError('calibration_required', `calibration is for ${cal.source}@${cal.bitsPerTrial} bits, series is ${series.source}@${series.bitsPerTrial} bits`, { source: series.source });
+    }
+    const zs = new Float64Array(series.sums.length);
+    for (let i = 0; i < zs.length; i++)
+        zs[i] = (series.sums[i] - cal.mean) / cal.sd;
+    return zs;
+}
+/**
+ * Stouffer's combined z: Σz / √n. Assumes the inputs are independent —
+ * correlated sources inflate its variance, which is exactly what
+ * `interSourceCorrelation` measures; do not "fix" it here.
+ */
+export function stoufferZ(zs) {
+    if (zs.length === 0) {
+        throw new NegentropyError('insufficient_data', 'stoufferZ needs at least one z-score');
+    }
+    let sum = 0;
+    for (let i = 0; i < zs.length; i++)
+        sum += zs[i];
+    return sum / Math.sqrt(zs.length);
+}
+//# sourceMappingURL=zscores.js.map

package/dist/stats/zscores.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zscores.js","sourceRoot":"","sources":["../../src/stats/zscores.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAG9C,uEAAuE;AACvE,MAAM,UAAU,OAAO,CAAC,MAAmB,EAAE,GAAgB;IAC3D,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;QAC7E,MAAM,IAAI,eAAe,CACvB,sBAAsB,EACtB,sBAAsB,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,YAAY,oBAAoB,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,YAAY,OAAO,EACnH,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAC1B,CAAA;IACH,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAY,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,CAAA;IAC5F,OAAO,EAAE,CAAA;AACX,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,EAAqB;IAC7C,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,eAAe,CAAC,mBAAmB,EAAE,sCAAsC,CAAC,CAAA;IACxF,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAW,CAAA;IAC1D,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;AACnC,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Minimal structural view of a live byte source. Any `@mindpeeker/entropy`
+ * EntropyProvider satisfies this — no import required.
+ */
+export interface TrialSource {
+    readonly name: string;
+    stream(opts?: TrialStreamOptions): AsyncIterable<Uint8Array>;
+}
+export interface TrialStreamOptions {
+    signal?: AbortSignal;
+    /** Desired chunk size in bytes. Passed through to the source. */
+    chunkBytes?: number;
+}
+/** How raw bits are grouped into trials. */
+export type TrialClock = {
+    mode: 'count';
+} | {
+    mode: 'interval';
+    intervalMs: number;
+};
+export interface TrialConfig {
+    /** Bits summed per trial. Default 200 (GCP convention → Binomial(200, ½)). Minimum 8. */
+    bitsPerTrial?: number;
+    clock?: TrialClock;
+}
+/** One trial: the number of one-bits among bitsPerTrial raw bits. */
+export interface Trial {
+    sum: number;
+    index: number;
+    /** Epoch ms of trial completion — set in live mode, absent in batch. */
+    at?: number;
+}
+/** A source's recorded trial data — the archival unit every analysis consumes. */
+export interface TrialSeries {
+    readonly source: string;
+    readonly bitsPerTrial: number;
+    readonly sums: Float64Array;
+    readonly timestamps?: Float64Array;
+    /** Trailing bits that did not fill a whole trial (batch extraction only). */
+    readonly leftoverBits?: number;
+}
+/** Normalization parameters mapping one source's trial sums to z-scores. */
+export interface Calibration {
+    readonly source: string;
+    readonly bitsPerTrial: number;
+    /** Trials the calibration was fit on (0 for theoretical). */
+    readonly trials: number;
+    readonly mean: number;
+    readonly sd: number;
+    readonly basis: 'empirical' | 'theoretical';
+}
+/** A test statistic with honest attribution of what went into it. */
+export interface StatResult {
+    statistic: number;
+    df: number;
+    pValue: number;
+    /** Trials (or steps) that entered the statistic. */
+    n: number;
+    sources: readonly string[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,MAAM,CAAC,IAAI,CAAC,EAAE,kBAAkB,GAAG,aAAa,CAAC,UAAU,CAAC,CAAA;CAC7D;AAED,MAAM,WAAW,kBAAkB;IACjC,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,iEAAiE;IACjE,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED,4CAA4C;AAC5C,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAA;AAE5C,MAAM,WAAW,WAAW;IAC1B,yFAAyF;IACzF,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,KAAK,CAAC,EAAE,UAAU,CAAA;CACnB;AAED,qEAAqE;AACrE,MAAM,WAAW,KAAK;IACpB,GAAG,EAAE,MAAM,CAAA;IACX,KAAK,EAAE,MAAM,CAAA;IACb,wEAAwE;IACxE,EAAE,CAAC,EAAE,MAAM,CAAA;CACZ;AAED,kFAAkF;AAClF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,UAAU,CAAC,EAAE,YAAY,CAAA;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAC/B;AAED,4EAA4E;AAC5E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,aAAa,CAAA;CAC5C;AAED,qEAAqE;AACrE,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAA;IACjB,EAAE,EAAE,MAAM,CAAA;IACV,MAAM,EAAE,MAAM,CAAA;IACd,oDAAoD;IACpD,CAAC,EAAE,MAAM,CAAA;IACT,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;CAC3B"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/package.json

@@ -0,0 +1,46 @@
+{
+  "name": "@mindpeeker/negentropy",
+  "version": "0.1.0",
+  "description": "Measure order in noise and manufacture order from noise — GCP-style network statistics, negentropy estimators, and SP 800-90B extraction over any byte stream.",
+  "type": "module",
+  "sideEffects": false,
+  "license": "MIT",
+  "engines": {
+    "node": ">=20.3"
+  },
+  "files": [
+    "dist"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    },
+    "./numerics": {
+      "types": "./dist/numerics.d.ts",
+      "default": "./dist/numerics.js"
+    }
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "typecheck": "tsc -p tsconfig.json",
+    "test": "bun test"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "keywords": [
+    "negentropy",
+    "entropy",
+    "randomness",
+    "statistics",
+    "gcp",
+    "rng",
+    "randomness-extractor",
+    "toeplitz",
+    "min-entropy",
+    "sp800-90b",
+    "stouffer",
+    "anomaly-detection"
+  ]
+}