@torrent-tv/proxy 2.80.18 → 2.81.0

package/test/read-window.test.js

@@ -154,7 +154,7 @@ test("a read that is not stopped claims nothing", async () => {
     await iterator.return();
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 
@@ -165,7 +165,7 @@ test("a finished read leaves nothing selected", async () => {
     assert.deepEqual(torrent.held, [], "the read kept its claim after finishing");
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 
@@ -188,7 +188,7 @@ test("an abandoned read leaves nothing selected", async () => {
     assert.deepEqual(torrent.held, [], "an abandoned read kept its claim forever");
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 
@@ -238,7 +238,7 @@ test("two stopped readers add up, and one leaving takes only its own", async ()
     assert.deepEqual(torrent.held, [], "the last reader left something behind");
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 
@@ -275,7 +275,7 @@ test("criticality marks the window being waited for, not the whole range", async
     await iterator.return();
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 
@@ -306,7 +306,7 @@ test("a reader that is abandoned mid-fragment does not keep the piece pinned", a
     );
   } finally {
     store.destroy(() => undefined);
-    await fs.rm(directory, { recursive: true, force: true });
+    await fs.rm(directory, { recursive: true, force: true, maxRetries: 10, retryDelay: 20 });
   }
 });
 

package/test/run-intervals.test.js

@@ -1,100 +1,100 @@
-/**
- * @file How far a run may work, and who decides it.
- *
- * These cases used to be asked of `planRunInterval`, a second authority inside
- * the session manager that answered by its own rules: it walked the whole track
- * for the first free number, MOVED the start there, and counted every live run
- * as claiming up to `head + look-ahead`. It contradicted the plan directly, and
- * the two together produced the field oscillation of 2026-09-05 — the plan
- * commanded a start at #46, this moved it to #78, the plan killed the run for
- * standing outside the window it had asked for, and the same start was
- * commanded again, 350-700ms per cycle, no segment ever produced, the viewer's
- * picture stopped for 125 seconds.
- *
- * It is gone. WHERE a run starts is the plan's decision and nothing moves it;
- * HOW FAR it may work is a fact of the one coverage map, and that is what these
- * cases now ask. The map is the same object the plan reads, so there is no
- * second set of rules for the two to disagree about.
- */
-
-import test from "node:test";
-import assert from "node:assert/strict";
-import { CoverageMap } from "../services/encode/CoverageMap.js";
-
-/** A stand-in for a run: the map identifies one by being it. */
-function run(name) {
-  return { name };
-}
-
-test("with nothing made, a run gets everything from where it was asked", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-
-  assert.equal(coverage.freeRunFrom(0), 100, "the whole track is free");
-  assert.equal(coverage.firstGapFrom(0), 0);
-});
-
-test("a run stops before material that is already made", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-  coverage.setReady([10, 11, 12, 13, 14, 15, 16, 17, 18, 19]);
-
-  assert.equal(coverage.freeRunFrom(0), 10, "0..9, and it stops where 10 begins");
-});
-
-test("a run stops before a stretch another live run was given", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-  const other = run("other");
-  coverage.claim(other, 40, 60);
-
-  assert.equal(coverage.freeRunFrom(0), 40, "0..39, and the other run's claim begins at 40");
-  assert.equal(coverage.firstGapFrom(45), 61, "the first thing nobody holds after it");
-});
-
-test("a run's own claim does not hold it back", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-  const mine = run("mine");
-  coverage.claim(mine, 40, 60);
-
-  assert.equal(
-    coverage.freeRunFrom(40, mine),
-    60,
-    "asked by the run that holds it, the stretch is its own to work through"
-  );
-});
-
-test("a run that has ended holds nothing back", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-  const dead = run("dead");
-  coverage.claim(dead, 40, 60);
-  coverage.release(dead);
-
-  assert.equal(coverage.freeRunFrom(0), 100, "what it did not finish is free again");
-});
-
-test("what a dead run DID finish stays made", () => {
-  const coverage = new CoverageMap({ segmentCount: 100 });
-  const dead = run("dead");
-  coverage.claim(dead, 40, 60);
-  coverage.setReady([40, 41, 42]);
-  coverage.release(dead);
-
-  assert.equal(coverage.firstGapFrom(40), 43, "a closed file is closed whoever made it");
-});
-
-test("nothing left to make is answered with nothing", () => {
-  const coverage = new CoverageMap({ segmentCount: 5 });
-  coverage.setReady([0, 1, 2, 3, 4]);
-
-  assert.equal(coverage.firstGapFrom(0), null, "and a run started here would only repeat somebody's work");
-});
-
-test("a run without an end does not take the film away from a viewer further in", () => {
-  // The case that used to need a second authority's `head + look-ahead` guess.
-  // A run's claim is now the stretch the plan GAVE it, so a viewer opening the
-  // same film in the middle finds their own position free.
-  const coverage = new CoverageMap({ segmentCount: 1000 });
-  const first = run("first");
-  coverage.claim(first, 0, 499);
-
-  assert.equal(coverage.firstGapFrom(500), 500, "the second viewer's own position is free");
-  assert.equal(coverage.freeRunFrom(500), 500, "and everything from there to the end");
-});
+/**
+ * @file How far a run may work, and who decides it.
+ *
+ * These cases used to be asked of `planRunInterval`, a second authority inside
+ * the session manager that answered by its own rules: it walked the whole track
+ * for the first free number, MOVED the start there, and counted every live run
+ * as claiming up to `head + look-ahead`. It contradicted the plan directly, and
+ * the two together produced the field oscillation of 2026-09-05 — the plan
+ * commanded a start at #46, this moved it to #78, the plan killed the run for
+ * standing outside the window it had asked for, and the same start was
+ * commanded again, 350-700ms per cycle, no segment ever produced, the viewer's
+ * picture stopped for 125 seconds.
+ *
+ * It is gone. WHERE a run starts is the plan's decision and nothing moves it;
+ * HOW FAR it may work is a fact of the one coverage map, and that is what these
+ * cases now ask. The map is the same object the plan reads, so there is no
+ * second set of rules for the two to disagree about.
+ */
+
+import test from "node:test";
+import assert from "node:assert/strict";
+import { CoverageMap } from "../services/encode/CoverageMap.js";
+
+/** A stand-in for a run: the map identifies one by being it. */
+function run(name) {
+  return { name };
+}
+
+test("with nothing made, a run gets everything from where it was asked", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+
+  assert.equal(coverage.freeRunFrom(0), 100, "the whole track is free");
+  assert.equal(coverage.firstGapFrom(0), 0);
+});
+
+test("a run stops before material that is already made", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+  coverage.setReady([10, 11, 12, 13, 14, 15, 16, 17, 18, 19]);
+
+  assert.equal(coverage.freeRunFrom(0), 10, "0..9, and it stops where 10 begins");
+});
+
+test("a run stops before a stretch another live run was given", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+  const other = run("other");
+  coverage.claim(other, 40, 60);
+
+  assert.equal(coverage.freeRunFrom(0), 40, "0..39, and the other run's claim begins at 40");
+  assert.equal(coverage.firstGapFrom(45), 61, "the first thing nobody holds after it");
+});
+
+test("a run's own claim does not hold it back", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+  const mine = run("mine");
+  coverage.claim(mine, 40, 60);
+
+  assert.equal(
+    coverage.freeRunFrom(40, mine),
+    60,
+    "asked by the run that holds it, the stretch is its own to work through"
+  );
+});
+
+test("a run that has ended holds nothing back", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+  const dead = run("dead");
+  coverage.claim(dead, 40, 60);
+  coverage.release(dead);
+
+  assert.equal(coverage.freeRunFrom(0), 100, "what it did not finish is free again");
+});
+
+test("what a dead run DID finish stays made", () => {
+  const coverage = new CoverageMap({ segmentCount: 100 });
+  const dead = run("dead");
+  coverage.claim(dead, 40, 60);
+  coverage.setReady([40, 41, 42]);
+  coverage.release(dead);
+
+  assert.equal(coverage.firstGapFrom(40), 43, "a closed file is closed whoever made it");
+});
+
+test("nothing left to make is answered with nothing", () => {
+  const coverage = new CoverageMap({ segmentCount: 5 });
+  coverage.setReady([0, 1, 2, 3, 4]);
+
+  assert.equal(coverage.firstGapFrom(0), null, "and a run started here would only repeat somebody's work");
+});
+
+test("a run without an end does not take the film away from a viewer further in", () => {
+  // The case that used to need a second authority's `head + look-ahead` guess.
+  // A run's claim is now the stretch the plan GAVE it, so a viewer opening the
+  // same film in the middle finds their own position free.
+  const coverage = new CoverageMap({ segmentCount: 1000 });
+  const first = run("first");
+  coverage.claim(first, 0, 499);
+
+  assert.equal(coverage.firstGapFrom(500), 500, "the second viewer's own position is free");
+  assert.equal(coverage.freeRunFrom(500), 500, "and everything from there to the end");
+});

package/test/seek-landing.test.js

@@ -1,109 +1,109 @@
-/**
- * @file Ask ffmpeg late enough that it lands where we meant.
- *
- * `fftools/ffmpeg_demux.c` moves an input seek back by `3*AV_TIME_BASE / 23` —
- * 130.435 ms — whenever the container does not declare `AVFMT_SEEK_TO_PTS` and
- * a stream carries B-frames. So asking for a keyframe lands on the one before
- * it, and since `-segment_times` is measured from where the run really began,
- * every cut of that run inherits the shift.
- *
- * Measured 2026-08-21 on Matroska with keyframes every 2 s: `-ss 10` produced a
- * first segment starting at 8.000, `-ss 10.130435` one starting at 10.000. On
- * MP4, where the heuristic does not fire, 10, 10.130435 and 10.2 all produced
- * 10.000 — right in one case, harmless in the other.
- */
-
-import assert from "node:assert/strict";
-import { SourceFile } from "../services/source/SourceFile.js";
-import test from "node:test";
-
-import { seekLandingOffsetFor } from "../services/hls-session-manager.js";
-
-const OFFSET = 3 / 23;
-
-test("a copied picture is asked for one heuristic later than the keyframe", () => {
-  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004, 6.006] }) };
-  assert.equal(seekLandingOffsetFor(session, 2.002), OFFSET);
-});
-
-test("a re-encode is asked for exactly what it should produce", () => {
-  // It decodes from the keyframe and discards frames up to the requested time,
-  // so pushing the request later would start its output late.
-  const session = { transcodeVideo: true, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004] }) };
-  assert.equal(seekLandingOffsetFor(session, 2.002), 0);
-});
-
-test("the offset never reaches the next keyframe", () => {
-  // Keyframes 0.1 s apart: half of that is the most that can be added without
-  // risking a landing on the NEXT one where the heuristic does not fire.
-  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 0.1, 0.2, 0.3] }) };
-  assert.equal(seekLandingOffsetFor(session, 0.1), 0.05);
-});
-
-test("the last keyframe has nothing after it to collide with", () => {
-  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004] }) };
-  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET);
-});
-
-test("no keyframe list is still answered", () => {
-  assert.equal(seekLandingOffsetFor({ transcodeVideo: false }, 5), OFFSET);
-  assert.equal(seekLandingOffsetFor(null, 5), OFFSET);
-});
-
-test("a grid whose times are approximate is asked for that much later again", () => {
-  // AVI names a keyframe by its frame NUMBER and the time is that number times
-  // the frame duration, so a name can sit just BELOW the keyframe it refers to
-  // — measured 2026-08-21, 10-44 ms out on two files, always under one frame.
-  // Asking at the name alone would seek to before the real keyframe and land on
-  // the one before that, which is the fault this offset exists for.
-  const session = {
-    transcodeVideo: false,
-    file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0.04 })
-  };
-  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET + 0.04);
-});
-
-test("an exact grid claims no tolerance", () => {
-  // Matroska and MP4 state instants outright — measured the same day, nine
-  // files and 11 665 keyframes with not one disagreement.
-  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 4.004, 8.008], keyframeTolerance: 0 }) };
-  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET);
-});
-
-test("the bound still holds once a tolerance is added", () => {
-  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 0.1, 0.2], keyframeTolerance: 1 }) };
-  assert.equal(seekLandingOffsetFor(session, 0.1), 0.05);
-});
-
-test("an output carrying only sound is not pushed past what it asked for", () => {
-  // The field failure of 2026-09-06: the sound played 130 ms ahead of the
-  // picture from every restart onward, and the viewer saw lips out of step with
-  // the voice from two minutes in.
-  //
-  // The offset exists because ffmpeg's demuxer moves a seek target back for a
-  // container it reads in decode order, after which a COPY lands on the previous
-  // keyframe. A re-encode trims to the requested time itself and is excluded —
-  // and an output with no picture is exactly that, since its one track is
-  // `-c:a aac`. It was not excluded, because the test asked whether the PICTURE
-  // is re-encoded and an output with no picture answers no.
-  const soundtrack = {
-    audioOnly: true,
-    transcodeVideo: false,
-    file: new SourceFile({ sourceKey: "s", fileIndex: 0 })
-      .learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0 })
-  };
-  assert.equal(seekLandingOffsetFor(soundtrack, 4.004), 0);
-});
-
-test("the picture of the same film still gets the offset", () => {
-  // The pair to the check above: the two outputs are repositioned to one
-  // boundary and must be given DIFFERENT requests, because one is copied and one
-  // is re-encoded. Given the same request they land 130 ms apart.
-  const picture = {
-    audioOnly: false,
-    transcodeVideo: false,
-    file: new SourceFile({ sourceKey: "s", fileIndex: 0 })
-      .learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0 })
-  };
-  assert.equal(seekLandingOffsetFor(picture, 4.004), OFFSET);
-});
+/**
+ * @file Ask ffmpeg late enough that it lands where we meant.
+ *
+ * `fftools/ffmpeg_demux.c` moves an input seek back by `3*AV_TIME_BASE / 23` —
+ * 130.435 ms — whenever the container does not declare `AVFMT_SEEK_TO_PTS` and
+ * a stream carries B-frames. So asking for a keyframe lands on the one before
+ * it, and since `-segment_times` is measured from where the run really began,
+ * every cut of that run inherits the shift.
+ *
+ * Measured 2026-08-21 on Matroska with keyframes every 2 s: `-ss 10` produced a
+ * first segment starting at 8.000, `-ss 10.130435` one starting at 10.000. On
+ * MP4, where the heuristic does not fire, 10, 10.130435 and 10.2 all produced
+ * 10.000 — right in one case, harmless in the other.
+ */
+
+import assert from "node:assert/strict";
+import { SourceFile } from "../services/source/SourceFile.js";
+import test from "node:test";
+
+import { seekLandingOffsetFor } from "../services/hls-session-manager.js";
+
+const OFFSET = 3 / 23;
+
+test("a copied picture is asked for one heuristic later than the keyframe", () => {
+  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004, 6.006] }) };
+  assert.equal(seekLandingOffsetFor(session, 2.002), OFFSET);
+});
+
+test("a re-encode is asked for exactly what it should produce", () => {
+  // It decodes from the keyframe and discards frames up to the requested time,
+  // so pushing the request later would start its output late.
+  const session = { transcodeVideo: true, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004] }) };
+  assert.equal(seekLandingOffsetFor(session, 2.002), 0);
+});
+
+test("the offset never reaches the next keyframe", () => {
+  // Keyframes 0.1 s apart: half of that is the most that can be added without
+  // risking a landing on the NEXT one where the heuristic does not fire.
+  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 0.1, 0.2, 0.3] }) };
+  assert.equal(seekLandingOffsetFor(session, 0.1), 0.05);
+});
+
+test("the last keyframe has nothing after it to collide with", () => {
+  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 2.002, 4.004] }) };
+  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET);
+});
+
+test("no keyframe list is still answered", () => {
+  assert.equal(seekLandingOffsetFor({ transcodeVideo: false }, 5), OFFSET);
+  assert.equal(seekLandingOffsetFor(null, 5), OFFSET);
+});
+
+test("a grid whose times are approximate is asked for that much later again", () => {
+  // AVI names a keyframe by its frame NUMBER and the time is that number times
+  // the frame duration, so a name can sit just BELOW the keyframe it refers to
+  // — measured 2026-08-21, 10-44 ms out on two files, always under one frame.
+  // Asking at the name alone would seek to before the real keyframe and land on
+  // the one before that, which is the fault this offset exists for.
+  const session = {
+    transcodeVideo: false,
+    file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0.04 })
+  };
+  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET + 0.04);
+});
+
+test("an exact grid claims no tolerance", () => {
+  // Matroska and MP4 state instants outright — measured the same day, nine
+  // files and 11 665 keyframes with not one disagreement.
+  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 4.004, 8.008], keyframeTolerance: 0 }) };
+  assert.equal(seekLandingOffsetFor(session, 4.004), OFFSET);
+});
+
+test("the bound still holds once a tolerance is added", () => {
+  const session = { transcodeVideo: false, file: new SourceFile({ sourceKey: "s", fileIndex: 0 }).learn({ keyframeTimes: [0, 0.1, 0.2], keyframeTolerance: 1 }) };
+  assert.equal(seekLandingOffsetFor(session, 0.1), 0.05);
+});
+
+test("an output carrying only sound is not pushed past what it asked for", () => {
+  // The field failure of 2026-09-06: the sound played 130 ms ahead of the
+  // picture from every restart onward, and the viewer saw lips out of step with
+  // the voice from two minutes in.
+  //
+  // The offset exists because ffmpeg's demuxer moves a seek target back for a
+  // container it reads in decode order, after which a COPY lands on the previous
+  // keyframe. A re-encode trims to the requested time itself and is excluded —
+  // and an output with no picture is exactly that, since its one track is
+  // `-c:a aac`. It was not excluded, because the test asked whether the PICTURE
+  // is re-encoded and an output with no picture answers no.
+  const soundtrack = {
+    audioOnly: true,
+    transcodeVideo: false,
+    file: new SourceFile({ sourceKey: "s", fileIndex: 0 })
+      .learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0 })
+  };
+  assert.equal(seekLandingOffsetFor(soundtrack, 4.004), 0);
+});
+
+test("the picture of the same film still gets the offset", () => {
+  // The pair to the check above: the two outputs are repositioned to one
+  // boundary and must be given DIFFERENT requests, because one is copied and one
+  // is re-encoded. Given the same request they land 130 ms apart.
+  const picture = {
+    audioOnly: false,
+    transcodeVideo: false,
+    file: new SourceFile({ sourceKey: "s", fileIndex: 0 })
+      .learn({ keyframeTimes: [0, 4.004, 8.008, 12.012], keyframeTolerance: 0 })
+  };
+  assert.equal(seekLandingOffsetFor(picture, 4.004), OFFSET);
+});

package/test/segment-serve-wiring.test.js

@@ -290,12 +290,12 @@ test("a run's FIRST segment is served once the encoder has passed it, without wa
   // successor and nothing is producing one. Waiting for that successor is what
   // held #317 for 46 s and then answered 404 to a browser that had given up.
   await rm(path.join(dirPath, "segment-00001.mp4"));
-  // WHAT PROVES IT INSTEAD: the encoder named it. ffmpeg writes the name of each
-  // piece on a channel of its own as it closes it, so a run's own first piece is
-  // proven the moment it is finished and the absence of a next one says nothing.
-  // This used to be inferred from the encoder's reported position instead, which
-  // is a different question — where it has read to, not what it has closed.
-  manager.segmentStore.markClosed(OUTPUT_KEY, 0);
+  // WHAT PROVES IT INSTEAD: its own NAME. A piece is called something else while
+  // it is being written and takes its served name when its writer says it is
+  // closed, so a run's first piece is proven the moment it is finished and the
+  // absence of a next one says nothing. This used to be inferred from the
+  // encoder's reported position — a different question, where it has read to
+  // rather than what it has closed.
 
   const result = await manager.getFileStream(SESSION_ID, "segment-00000.mp4", { requestSeq: 1 });
 
@@ -345,10 +345,9 @@ test("serving a run's own segment moves the run out of STARTING", async (t) => {
   // ITS OWN PIECE, AND FILM STILL TO MAKE BEHIND IT. A run standing on material
   // that already exists is moved forward — correctly — so a fixture that wants a
   // live run has to put it where the work is. #1 is what it is making; #2..#4
-  // are unmade, so it is wanted; and the encoder has named #1 on its ready
-  // channel, which is what makes the piece servable at all.
+  // are unmade, so it is wanted; and #1 stands under its served name, which is
+  // what makes the piece servable at all.
   const run = startRunOn(session, { from: 1, producing: false, usesExplicitCuts: true, speedX: 2 });
-  manager.segmentStore.markClosed(OUTPUT_KEY, 1);
   assert.equal(run.state, ENCODE_RUN_STATE.STARTING);
   assert.deepEqual(run.produced, [], "it has made nothing yet");