@mikeargento/bitgraph-player 0.13.0 → 0.15.0

package/package.json

@@ -1,13 +1,21 @@
 {
   "name": "@mikeargento/bitgraph-player",
-  "version": "0.13.0",
+  "version": "0.15.0",
   "description": "Deterministic evaluation of causal rules over BitGraph proof bundles: a pure function from (rule, verified evidence) to a reproducible verdict.",
+  "keywords": [
+    "bitgraph",
+    "rules",
+    "deterministic",
+    "evidence",
+    "ai-audit",
+    "verification"
+  ],
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
   "bin": {
-    "bitgraph-play": "./dist/cli.js"
+    "bitgraph-play": "dist/cli.js"
   },
   "exports": {
     ".": {
@@ -20,22 +28,22 @@
     "dist-web",
     "src",
     "SPEC.md",
-        "README.md",
+    "README.md",
     "LICENSE"
   ],
   "scripts": {
     "build": "tsc",
     "prepack": "tsc && npm run build:web",
     "typecheck": "tsc --noEmit",
-    "test": "tsc && node --test \"dist/__tests__/*.test.js\"",
-    "build:web": "node scripts/build-verify-html.mjs --out ../../website/public/verify.html",
+    "test": "tsc && node --test dist/__tests__/*.test.js",
+    "build:web": "node scripts/build-verify-html.mjs",
     "typecheck:web": "tsc -p web/tsconfig.json"
   },
   "engines": {
     "node": ">=20"
   },
   "dependencies": {
-    "@mikeargento/bitgraph-audit": "^0.4.1",
+    "@mikeargento/bitgraph-audit": "^0.7.0",
     "@mikeargento/bitgraph-verify": "^1.7.0"
   },
   "devDependencies": {

package/src/__tests__/cast-order.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 import { strict as assert } from "node:assert";
 import { test } from "node:test";

package/src/__tests__/check.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * `check` tests.
@@ -147,7 +147,7 @@ describe("check: real export fixture (disk)", () => {
   it("recognizes the enclave v5 measurement from PINS.md", () => {
     const enclave = report.recordings[0]!.lines.find((l) => l.name === "enclave")!;
     assert.match(enclave.detail, /enclave v5/);
-    assert.equal(KNOWN_ENCLAVE_MEASUREMENTS.length, 6);
+    assert.equal(KNOWN_ENCLAVE_MEASUREMENTS.length, 8);
   });
 
   it("serializes deterministically: no timestamps, no machine paths", async () => {

package/src/__tests__/evaluate-verdict.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 import { strict as assert } from "node:assert";
 import { test } from "node:test";

package/src/__tests__/fixtures.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Synthetic AuditResult fixtures for unit tests.

package/src/__tests__/fuse-check.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * `check` over fused recordings (profile bitgraph-fuse/1, working name).
@@ -55,7 +55,7 @@ describe("fused recordings in check", () => {
     assert.equal(rec.fused!.floor, null);
     assert.match(rec.fused!.floorDetail, /floor undetermined: no anchor precedes this slot in its epoch/);
     assert.equal(rec.fused!.statements.length, 2);
-    assert.match(rec.fused!.statements[1]!, /at position \d+, and were committed no later than position \d+/);
+    assert.match(rec.fused!.statements[1]!, /position \d+ was reserved and signed for them, and were committed no later than position \d+/);
     assert.ok(rec.fused!.span && BigInt(rec.fused!.span.positions) >= 1n);
     // The harness attests with a fake document, so the attestation line is FALSE
     // here; that is the harness, not the fused check, and it is reported on its

package/src/__tests__/init-play.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Tests for the init scaffolder and the play() one-call pipeline.

package/src/__tests__/logic-rule.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 import { strict as assert } from "node:assert";
 import { test } from "node:test";

package/src/__tests__/sig-v2.test.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Format 2: trustedKeys + signedBy.

package/src/cast.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Cast resolution: digest -> recording.

package/src/check.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * `check`: what a bundle establishes about the recordings it holds, said
@@ -109,7 +109,17 @@ export const KNOWN_ENCLAVE_MEASUREMENTS: ReadonlyArray<{ pcr0: string; label: st
   {
     pcr0: "394c3cf515651dc27187d85e4716c12dfeb99c1227f1fe0eacfaa427d80018e1a28ebba9469e99c7936601f901d74e1d",
     label: "enclave v7 (reproducible, authenticated anchors)",
-    period: "2026-09-06 onward",
+    period: "2026-09-06 to 2026-09-07",
+  },
+  {
+    pcr0: "eccfc1c78006f4b74f929c992785575c908a0f60eca08ff638cd6c0842f993f182ebb002457b8ef3e732a6a10805c72b",
+    label: "enclave v8 (reproducible, authenticated anchors and the floor gate)",
+    period: "2026-09-07 to 2026-09-30",
+  },
+  {
+    pcr0: "934feb8bb6f4f7e2d2f85d902a7d5edd0981f706d9d2385638988ac096a05ea0583c3d00eef2a7947865ec66efc1fcf8",
+    label: "enclave v9 (reproducible; the allocation returns the floor anchor, for bitgraph-fuse/2)",
+    period: "2026-09-30 onward",
   },
 ];
 
@@ -752,7 +762,7 @@ function boundsPhrase(
     case "lower-bounded":
       return `after Ethereum block ${blockRef(notBefore as CheckBound)} (header verified in this bundle); no verified upper bound here` + weakerSuffix((notBefore as CheckBound).weaker);
     case "upper-bounded":
-      return `before Ethereum block ${blockRef(notAfter as CheckBound)} (header verified in this bundle); no verified lower bound here` + weakerSuffix((notAfter as CheckBound).weaker);
+      return `with no verified lower bound in this bundle; an anchor that consumed block ${blockRef(notAfter as CheckBound)} followed (header verified), which is not an upper bound` + weakerSuffix((notAfter as CheckBound).weaker);
     default:
       return "with no verified Ethereum bound in this bundle";
   }
@@ -795,7 +805,7 @@ function shortBoundsPhrase(b: CheckBounds): string {
     case "lower-bounded":
       return `after Ethereum block ${blockRef(b.notBefore as CheckBound)}`;
     case "upper-bounded":
-      return `before Ethereum block ${blockRef(b.notAfter as CheckBound)}`;
+      return `with no lower bound in this bundle, then an anchor at block ${blockRef(b.notAfter as CheckBound)} (not an upper bound)`;
     default:
       return "with no Ethereum bound in this bundle";
   }
@@ -932,7 +942,7 @@ function collectNotes(audit: AuditResult, recordings: CheckRecording[], anchors:
   }
   if (missingPositions > 0n) {
     notes.push(
-      `${missingPositions} causal position${missingPositions === 1n ? "" : "s"} between the earliest and latest recording here ${missingPositions === 1n ? "is" : "are"} not in this bundle: normal for an export, which is an excerpt of the chain; a full-epoch audit checks them`
+      `${missingPositions} causal position${missingPositions === 1n ? "" : "s"} between the earliest and latest recording here ${missingPositions === 1n ? "is" : "are"} not in this bundle: normal for an export, which is an excerpt of the chain; the positions between belong to whoever holds those recordings`
     );
   }
   if (predecessorsAbsent > 0) {
@@ -946,7 +956,7 @@ function collectNotes(audit: AuditResult, recordings: CheckRecording[], anchors:
   const originals = audit.ingest.artifacts.filter((a) => a.matchedProofHashes.length === 0 && fuseOriginHexes?.has(a.sha256Hex) === true);
   if (originals.length > 0) {
     notes.push(
-      `${originals.length} file${originals.length === 1 ? "" : "s"} in this bundle ${originals.length === 1 ? "is" : "are"} the original of a fused recording: ${originals.slice(0, 5).map((a) => a.paths[0] ?? "(unnamed)").join(", ")}${originals.length > 5 ? ", …" : ""}. The original itself receives only the ceiling (it existed no later than the commit); the fused bytes receive the interval`
+      `${originals.length} file${originals.length === 1 ? "" : "s"} in this bundle ${originals.length === 1 ? "is" : "are"} the original of a fused recording: ${originals.slice(0, 5).map((a) => a.paths[0] ?? "(unnamed)").join(", ")}${originals.length > 5 ? ", …" : ""}. The original carries no floor of its own: the commit that consumed its digest shows it existed by that position, an order, not a time ceiling. The fused bytes carry the floor`
     );
   }
   const unmatched = audit.ingest.artifacts.filter((a) => a.matchedProofHashes.length === 0 && fuseOriginHexes?.has(a.sha256Hex) !== true);
@@ -998,7 +1008,7 @@ function collectNotChecked(hasAnchors: boolean): string[] {
     );
   }
   out.push(
-    "whether the public ledger holds these exact recordings at these positions: this is an offline check; drop the file on bitgraph.ing to compare against the ledger"
+    "whether the anchors in this bundle are the ones BitGraph published: this is an offline check; the published anchors are listed at bitgraph.ing/ledger"
   );
   out.push("whether an epoch key was later quarantined: that is published outside any bundle");
   return out;

package/src/cli.ts

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * bitgraph-play <rule.json> <bundle> [--out <file>] [--summary]

package/src/evaluate.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * The evaluator: walks the claim tree over resolved recordings and the

package/src/index.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * @mikeargento/bitgraph-player

package/src/init.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Rule scaffolding: from a list of (filename, digest) pairs to a rule

package/src/logic.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Strong Kleene three-valued connectives.

package/src/order.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * The ordering adapter. Player does not reimplement causal reconstruction —

package/src/play.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * One-call evaluation: play(rulePath, bundlePath) -> verdict.

package/src/rule.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Rule parsing and validation for bitgraph-player/1.

package/src/sig.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * bitgraph-sig/1: detached signature evidence over a digest.

package/src/types.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * @mikeargento/bitgraph-player

package/src/verdict.ts

@@ -1,4 +1,4 @@
-// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
 
 /**
  * Verdict construction and serialization.
@@ -31,7 +31,7 @@ import type { DeclaredEntry, Resolution, Rule, Verdict } from "./types.js";
  * A unit test asserts this equals package.json's version, so the
  * constant cannot drift silently across releases.
  */
-export const PLAYER_VERSION = "0.13.0";
+export const PLAYER_VERSION = "0.15.0";
 
 /** The player package's own version. */
 export function playerVersion(): string {