@torrent-tv/proxy 2.89.17 → 2.89.19

package/test/subtitle-track-numbering.test.js

@@ -1,391 +0,0 @@
-/**
- * @file The number a subtitle track is asked for by, and one walk per file.
- *
- * Two rules, both found by reading on 2026-08-26 after the report that embedded
- * subtitles appear late (`research/subtitle-delay-2026-08-26.md`):
- *
- * 1. The browser names a track by ffmpeg's `0:s:N`, which counts EVERY subtitle
- *    stream. The container plan drops the picture-based ones — PGS, VobSub —
- *    because they cannot become WebVTT, so counting the kept ones is a
- *    different numbering as soon as a file carries one of each. What that cost:
- *    the push landed on a track the browser does not know, and the browser's
- *    own request found no track at all and fell through to the ffmpeg
- *    extraction, which reads the whole film (752 s measured, 2026-08-19).
- * 2. A file is walked once at a time. The walk marks a cluster as read only
- *    after two suspension points, and it is started both on every verified
- *    piece and on a 3 s timer, so two passes could read and parse the same
- *    cluster and push the same line twice.
- */
-
-import test from "node:test";
-import assert from "node:assert/strict";
-import { Readable } from "node:stream";
-import { MatroskaContainer } from "../services/media/container/MatroskaContainer.js";
-import { cuesHeldFor, forgetSubtitles } from "../services/media/SubtitleCues.js";
-import { heldFileOver } from "./helpers/held-file.js";
-
-const ID_EBML = 0x1a45dfa3;
-const ID_SEGMENT = 0x18538067;
-const ID_SEEK_HEAD = 0x114d9b74;
-const ID_SEEK = 0x4dbb;
-const ID_SEEK_ID = 0x53ab;
-const ID_SEEK_POSITION = 0x53ac;
-const ID_INFO = 0x1549a966;
-const ID_TIMESTAMP_SCALE = 0x2ad7b1;
-const ID_TRACKS = 0x1654ae6b;
-const ID_TRACK_ENTRY = 0xae;
-const ID_TRACK_NUMBER = 0xd7;
-const ID_TRACK_TYPE = 0x83;
-const ID_CODEC_ID = 0x86;
-const ID_LANGUAGE = 0x22b59c;
-const ID_LANGUAGE_BCP47 = 0x22b59d;
-const ID_FLAG_ENABLED = 0xb9;
-const ID_FLAG_FORCED = 0x55aa;
-const ID_FLAG_HEARING_IMPAIRED = 0x55ab;
-const ID_CUES = 0x1c53bb6b;
-const ID_CUE_POINT = 0xbb;
-const ID_CUE_TIME = 0xb3;
-const ID_CUE_TRACK_POSITIONS = 0xb7;
-const ID_CUE_TRACK = 0xf7;
-const ID_CUE_CLUSTER_POSITION = 0xf1;
-const ID_CLUSTER = 0x1f43b675;
-const ID_TIMESTAMP = 0xe7;
-
-/** An element id, as the bytes the specification gives it. */
-function idBytes(id) {
-  const bytes = [];
-  let rest = id;
-  while (rest > 0) {
-    bytes.unshift(rest & 0xff);
-    rest = Math.floor(rest / 256);
-  }
-  return Buffer.from(bytes);
-}
-
-/** A size, as a four-byte EBML variable-length integer. */
-function sizeBytes(size) {
-  const buffer = Buffer.alloc(4);
-  buffer.writeUInt32BE(size, 0);
-  buffer[0] |= 0x10;
-  return buffer;
-}
-
-function element(id, payload) {
-  return Buffer.concat([idBytes(id), sizeBytes(payload.length), payload]);
-}
-
-function uintElement(id, value) {
-  const bytes = [];
-  let rest = value;
-  do {
-    bytes.unshift(rest & 0xff);
-    rest = Math.floor(rest / 256);
-  } while (rest > 0);
-  return element(id, Buffer.from(bytes));
-}
-
-function stringElement(id, value) {
-  return element(id, Buffer.from(value, "utf8"));
-}
-
-/**
- * An unsigned value at a FIXED four bytes. A cue's cluster position has to be
- * written twice — once to measure the table, once with the position that
- * measurement produced — and a value-sized element would make the second table
- * a different length from the first, moving the very cluster it names.
- */
-function uint32Element(id, value) {
-  const payload = Buffer.alloc(4);
-  payload.writeUInt32BE(value, 0);
-  return element(id, payload);
-}
-
-function trackEntry({ number, type, codecId, language, flags = {}, languageBcp47 = null }) {
-  const parts = [
-    uintElement(ID_TRACK_NUMBER, number),
-    uintElement(ID_TRACK_TYPE, type),
-    stringElement(ID_CODEC_ID, codecId)
-  ];
-  if (language !== undefined && language !== null) {
-    parts.push(stringElement(ID_LANGUAGE, language));
-  }
-  if (languageBcp47 !== null) {
-    parts.push(stringElement(ID_LANGUAGE_BCP47, languageBcp47));
-  }
-  for (const [id, value] of [
-    [ID_FLAG_ENABLED, flags.enabled],
-    [ID_FLAG_FORCED, flags.forced],
-    [ID_FLAG_HEARING_IMPAIRED, flags.hearingImpaired]
-  ]) {
-    if (value !== undefined) {
-      parts.push(uintElement(id, value ? 1 : 0));
-    }
-  }
-  return element(ID_TRACK_ENTRY, Buffer.concat(parts));
-}
-
-/**
- * A file whose subtitle tracks are, in the container's own order: a picture
- * one, then two text ones. ffmpeg numbers those `0:s:0`, `0:s:1`, `0:s:2`;
- * the plan can only read the last two.
- *
- * The Cues table points both text tracks at one cluster, which is written after
- * the table so its position can be stated.
- *
- * @returns {{ file: Buffer, clusterAt: number }}
- */
-function buildFile() {
-  const info = element(ID_INFO, uintElement(ID_TIMESTAMP_SCALE, 1_000_000));
-  const tracks = element(ID_TRACKS, Buffer.concat([
-    trackEntry({ number: 1, type: 1, codecId: "V_MPEG4/ISO/AVC", language: "und" }),
-    trackEntry({ number: 2, type: 17, codecId: "S_HDMV/PGS", language: "eng" }),
-    trackEntry({ number: 3, type: 17, codecId: "S_TEXT/UTF8", language: "rus" }),
-    trackEntry({ number: 4, type: 17, codecId: "S_TEXT/ASS", language: "eng" })
-  ]));
-
-  // Built twice: the cue points state where the cluster is, and that position
-  // is only known once everything before it has its final length. Every size
-  // and position here is written at a fixed width, so the draft and the final
-  // table are the same length.
-  const cuesWith = (clusterAt) => element(ID_CUES, Buffer.concat([
-    element(ID_CUE_POINT, Buffer.concat([
-      uintElement(ID_CUE_TIME, 1000),
-      element(ID_CUE_TRACK_POSITIONS, Buffer.concat([
-        uintElement(ID_CUE_TRACK, 3),
-        uint32Element(ID_CUE_CLUSTER_POSITION, clusterAt)
-      ])),
-      element(ID_CUE_TRACK_POSITIONS, Buffer.concat([
-        uintElement(ID_CUE_TRACK, 4),
-        uint32Element(ID_CUE_CLUSTER_POSITION, clusterAt)
-      ]))
-    ]))
-  ]));
-
-  const seekEntry = (targetId, position) => element(ID_SEEK, Buffer.concat([
-    element(ID_SEEK_ID, idBytes(targetId)),
-    element(ID_SEEK_POSITION, (() => {
-      const buffer = Buffer.alloc(4);
-      buffer.writeUInt32BE(position, 0);
-      return buffer;
-    })())
-  ]));
-  const seekHeadWith = (infoAt, tracksAt, cuesAt) => element(ID_SEEK_HEAD, Buffer.concat([
-    seekEntry(ID_INFO, infoAt),
-    seekEntry(ID_TRACKS, tracksAt),
-    seekEntry(ID_CUES, cuesAt)
-  ]));
-
-  const headLength = seekHeadWith(0, 0, 0).length;
-  const infoAt = headLength;
-  const tracksAt = infoAt + info.length;
-  const cuesAt = tracksAt + tracks.length;
-  // A position in the Cues table is measured from the Segment's payload, and so
-  // is the one the reader turns it into.
-  const clusterRelative = cuesAt + cuesWith(0).length;
-
-  // Enough of a cluster to be read and recognised: its own header and a
-  // timestamp. No blocks, so it yields no cues — what the walk test counts is
-  // that its bytes are fetched once, and that does not depend on their content.
-  const cluster = element(ID_CLUSTER, uintElement(ID_TIMESTAMP, 1000));
-
-  const segmentPayload = Buffer.concat([
-    seekHeadWith(infoAt, tracksAt, cuesAt),
-    info,
-    tracks,
-    cuesWith(clusterRelative),
-    cluster
-  ]);
-  const ebml = element(ID_EBML, Buffer.from([0x42, 0x86, 0x81, 0x01]));
-  const segment = element(ID_SEGMENT, segmentPayload);
-  const segmentDataOffset = ebml.length + segment.length - segmentPayload.length;
-  return {
-    file: Buffer.concat([ebml, segment]),
-    clusterAt: segmentDataOffset + clusterRelative
-  };
-}
-
-function readerOver(file) {
-  return async (start, end) => {
-    const last = Math.min(end, file.length - 1);
-    return start > last ? null : file.subarray(start, last + 1);
-  };
-}
-
-test("a text track is numbered as ffmpeg numbers it, past the picture ones", async () => {
-  const { file } = buildFile();
-
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(file), file.length);
-
-  assert.equal(plan.declared.length, 3, "all three subtitle tracks are declared");
-  assert.deepEqual(plan.tracks.map((track) => track.trackNumber), [3, 4], "only the text ones are readable");
-  assert.deepEqual(
-    plan.tracks.map((track) => track.declaredIndex),
-    [1, 2],
-    "the PGS track is 0:s:0, so the text tracks are 0:s:1 and 0:s:2 — not 0 and 1"
-  );
-});
-
-/**
- * A torrent holding one file entirely, counting the byte ranges read from it.
- *
- * @param {Buffer} bytes
- * @returns {{ torrent: object, reads: Array<{ start: number, end: number }> }}
- */
-function torrentOver(bytes) {
-  const reads = [];
-  const file = {
-    name: "film.mkv",
-    length: bytes.length,
-    offset: 0,
-    createReadStream({ start = 0, end = bytes.length - 1 } = {}) {
-      reads.push({ start, end });
-      // Asynchronous on purpose: a read that resolves in the same tick would
-      // hide exactly the interleaving this test is about.
-      return Readable.from((async function* chunks() {
-        await new Promise((resolve) => setImmediate(resolve));
-        yield bytes.subarray(start, end + 1);
-      })());
-    }
-  };
-  return {
-    reads,
-    torrent: {
-      pieceLength: 1024,
-      bitfield: { get: () => true },
-      files: [file]
-    }
-  };
-}
-
-test("two walks of one file at the same time read each cluster once", async () => {
-  const { file, clusterAt } = buildFile();
-  const { torrent, reads } = torrentOver(file);
-  const sourceKey = "torrent:numbering-test";
-  forgetSubtitles(sourceKey);
-
-  // Both text tracks at once, which is what the warmup does on every verified
-  // piece and every three seconds.
-  const [first, second] = await Promise.all([
-    cuesHeldFor(heldFileOver(torrent, 0, sourceKey), 3),
-    cuesHeldFor(heldFileOver(torrent, 0, sourceKey), 4)
-  ]);
-
-  assert.equal(first.coveredClusters, 1, "the cluster the table names was walked");
-  assert.equal(second.coveredClusters, 1, "and the second track sees the same walk, not its own");
-  const clusterReads = reads.filter((range) => range.start === clusterAt);
-  assert.equal(
-    clusterReads.length,
-    2,
-    "one probe of the cluster's header and one read of its body — not two of each"
-  );
-  forgetSubtitles(sourceKey);
-});
-
-/**
- * A file whose subtitle tracks carry the flags RFC 9559 defines for them: one
- * forced, one for viewers who cannot hear, one the file marks unusable, one
- * writing its language as RFC 5646 alongside the three-letter code, and one
- * relying on Matroska's default language.
- *
- * @returns {Buffer}
- */
-function fileWithFlags() {
-  const info = element(ID_INFO, uintElement(ID_TIMESTAMP_SCALE, 1_000_000));
-  const tracks = element(ID_TRACKS, Buffer.concat([
-    trackEntry({ number: 1, type: 1, codecId: "V_MPEG4/ISO/AVC", language: "und" }),
-    trackEntry({ number: 2, type: 17, codecId: "S_TEXT/UTF8", language: "rus", flags: { forced: true } }),
-    trackEntry({ number: 3, type: 17, codecId: "S_TEXT/UTF8", language: "eng", flags: { hearingImpaired: true } }),
-    trackEntry({ number: 4, type: 17, codecId: "S_TEXT/UTF8", language: "fre", flags: { enabled: false } }),
-    trackEntry({ number: 5, type: 17, codecId: "S_TEXT/ASS", language: "por", languageBcp47: "pt-BR" }),
-    trackEntry({ number: 6, type: 17, codecId: "S_TEXT/UTF8", language: null })
-  ]));
-  const seekEntry = (targetId, position) => element(ID_SEEK, Buffer.concat([
-    element(ID_SEEK_ID, idBytes(targetId)),
-    uint32Element(ID_SEEK_POSITION, position)
-  ]));
-  const seekHeadWith = (infoAt, tracksAt) => element(ID_SEEK_HEAD, Buffer.concat([
-    seekEntry(ID_INFO, infoAt),
-    seekEntry(ID_TRACKS, tracksAt)
-  ]));
-  const headLength = seekHeadWith(0, 0).length;
-  const segmentPayload = Buffer.concat([
-    seekHeadWith(headLength, headLength + info.length),
-    info,
-    tracks
-  ]);
-  const ebml = element(ID_EBML, Buffer.from([0x42, 0x86, 0x81, 0x01]));
-  return Buffer.concat([ebml, element(ID_SEGMENT, segmentPayload)]);
-}
-
-test("the flags the file states about a track are read, not guessed from its name", async () => {
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(fileWithFlags()), fileWithFlags().length);
-
-  const forced = plan.tracks.find((track) => track.trackNumber === 2);
-  assert.equal(forced.isForced, true, "FlagForced 0x55AA");
-  assert.equal(forced.isHearingImpaired, false);
-
-  const sdh = plan.tracks.find((track) => track.trackNumber === 3);
-  assert.equal(sdh.isHearingImpaired, true, "FlagHearingImpaired 0x55AB");
-  assert.equal(sdh.isForced, false);
-});
-
-test("a track the file marks unusable is not offered, but is still counted", async () => {
-  // FlagEnabled (0xB9): "Set to 1 if the track is usable." Track 4 says 0, so
-  // it is not offered — but it KEEPS its place in the numbering, because ffmpeg
-  // keeps it: `matroskadec.c` parses MATROSKA_ID_TRACKFLAGENABLED as EBML_NONE,
-  // reading the element and storing nothing, so the stream is created and gets
-  // its own `0:s:N`. Dropping it here would shift every track after it.
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(fileWithFlags()), fileWithFlags().length);
-
-  assert.equal(plan.tracks.some((track) => track.trackNumber === 4), false, "not offered for extraction");
-  const counted = plan.declared.find((track) => track.trackNumber === 4);
-  assert.ok(counted, "still declared, so the numbering does not move");
-  assert.equal(counted.isEnabled, false);
-});
-
-test("an unusable track keeps its place, so the tracks after it keep theirs", async () => {
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(fileWithFlags()), fileWithFlags().length);
-
-  // s:0 forced, s:1 SDH, s:2 the unusable one, s:3 the Brazilian track.
-  assert.deepEqual(
-    plan.tracks.map((track) => [track.trackNumber, track.declaredIndex]),
-    [[2, 0], [3, 1], [5, 3], [6, 4]]
-  );
-});
-
-test("the list ffmpeg is lined up against still speaks ffmpeg's language codes", async () => {
-  // `declared` exists to be paired with the `-i` banner, which prints the
-  // three-letter code; reporting "pt-BR" there would break the pairing and cost
-  // the FlagDefault reading with it.
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(fileWithFlags()), fileWithFlags().length);
-
-  const declared = plan.declared.find((track) => track.trackNumber === 5);
-  assert.equal(declared.language, "por");
-  assert.equal(declared.languageBcp47, "pt-BR");
-});
-
-test("where the file writes RFC 5646, that is the language", async () => {
-  // "If this element is used, then any Language elements used in the same
-  // TrackEntry MUST be ignored."
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(fileWithFlags()), fileWithFlags().length);
-
-  const track = plan.tracks.find((entry) => entry.trackNumber === 5);
-  assert.equal(track.language, "pt-BR", "not the three-letter por");
-  assert.equal(track.languageBcp47, "pt-BR");
-});
-
-test("an omitted Matroska Language element is the format's default, `eng`, and says it was not written", async () => {
-  // RFC 9559 §5.1.4.1.19 gives Language the default `eng`; RFC 8794 §11.1.19
-  // says an element equal to its default need not be written, and a reader MUST
-  // read the default. Until 2026-10-01 such a track was offered as Unknown.
-  const file = fileWithFlags();
-  const plan = await MatroskaContainer.readSubtitlePlan(readerOver(file), file.length);
-
-  const track = plan.tracks.find((entry) => entry.trackNumber === 6);
-  const declared = plan.declared.find((entry) => entry.trackNumber === 6);
-  assert.equal(track.language, "eng");
-  assert.equal(track.languageSource, "default");
-  assert.equal(track.declaresLanguage, false, "the element itself was not written");
-  assert.equal(declared.language, "eng");
-  assert.equal(declared.declaresLanguage, false);
-});

package/test/supply-margin.test.js

@@ -1,190 +0,0 @@
-/**
- * @file The margin and the buffer, checked against the session they were
- * derived from.
- *
- * The figures in these tests are the field measurements of 2026-08-17, so a
- * change that breaks the arithmetic fails against reality rather than against
- * an example someone invented.
- */
-
-import assert from "node:assert/strict";
-import test from "node:test";
-
-import { minimumBufferFrom, requiredSpeedFrom } from "../services/torrent/supply-margin.js";
-
-/**
- * Waits spaced by `intervalSec`, each lasting `waitSec`.
- *
- * @param {number} count
- * @param {number} intervalSec
- * @param {number} waitSec
- * @returns {Array<{ waitedMs: number, at: number }>}
- */
-function evenlySpaced(count, intervalSec, waitSec) {
-  const waits = [];
-  for (let index = 0; index < count; index += 1) {
-    waits.push({ waitedMs: waitSec * 1000, at: 1_000_000 + index * intervalSec * 1000 });
-  }
-  return waits;
-}
-
-test("the margin is what the supply's own interruptions demand", () => {
-  // The field torrent: waits of 1.49 s with 0.73 s of running between them, and
-  // the worst of them 3.16 s. Written out rather than generated, because the
-  // point of the test is that these exact spans give that exact answer.
-  const waits = [
-    { waitedMs: 1490, at: 1490 },   // 0.00..1.49
-    { waitedMs: 1490, at: 3710 },   // 2.22..3.71
-    { waitedMs: 1490, at: 5930 },   // 4.44..5.93
-    { waitedMs: 3160, at: 9820 },   // 6.66..9.82  ← the worst
-    { waitedMs: 1490, at: 12_040 }, // 10.55..12.04
-    { waitedMs: 1490, at: 14_260 }  // 12.77..14.26
-  ];
-
-  const answer = requiredSpeedFrom(waits);
-
-  assert.ok(answer);
-  assert.equal(answer.worstWaitSec, 3.16);
-  // 2.22 s from one wait's end to the next one's END, of which 1.49 s was spent
-  // waiting — so the encoder ran for 0.73 s. That running stretch is what the
-  // derivation calls T: `(v - 1) x T > W` prices what is GAINED between
-  // interruptions, and nothing is gained during one.
-  assert.ok(Math.abs(answer.medianIntervalSec - 0.73) < 0.001, `got ${answer.medianIntervalSec}`);
-  // THE SHARE OF ITS TIME THE SUPPLY LOST, over whole cycles: from the first
-  // interruption's start to the last one's, 12.77 s, of which 9.12 s was
-  // interruption. So the reading delivered for 3.65 s of every 12.77, and
-  // producing film at that share costs 1/(1 - 0.714) = 3.50x.
-  //
-  // The formula it replaced divided the WORST interruption by the TYPICAL gap —
-  // 1 + 3.16/0.73 = 5.33 — which asks what would happen if the worst recurred
-  // at the typical rate, a case that never occurred in this data, and which
-  // divides by a gap that goes to zero whenever interruptions arrive in a burst.
-  // Field 2026-09-08: 0.79 s over 0.01 s gave 158.60x on a file already
-  // downloaded whole, and every quality step was refused against it.
-  //
-  // The failure this file was written for is still caught: a step admitted at
-  // 1.5 ran at 1.05x and stalled, and 3.91x refuses 1.5 exactly as 5.33x did.
-  assert.ok(Math.abs(answer.lostShare - 0.7142) < 0.001, `got ${answer.lostShare}`);
-  assert.ok(Math.abs(answer.requiredSpeed - 3.4986) < 0.001, `got ${answer.requiredSpeed}`);
-});
-
-test("one stall seen by three readers is one interruption, not three", () => {
-  // The picture and two audio renditions walk the same file, so a piece that
-  // has not arrived blocks all three, and their waits end within milliseconds
-  // of each other. Field 2026-08-31: `worst wait 13.26s, one every 0.00s,
-  // 2 measured` produced a required speed of 4422.00x, and every quality step
-  // was refused against it.
-  const answer = requiredSpeedFrom([
-    { waitedMs: 13_260, at: 1_000_000 },
-    { waitedMs: 13_257, at: 1_000_003 }
-  ]);
-
-  // Two overlapping waits are one interruption, and one interruption shows no
-  // interval — so the honest answer is that it is not known yet.
-  assert.equal(answer, null);
-});
-
-test("overlapping waits merge, and the gap between stalls is what is left", () => {
-  const answer = requiredSpeedFrom([
-    // First stall: 10s..20s, noticed by two readers a moment apart.
-    { waitedMs: 10_000, at: 20_000 },
-    { waitedMs: 9_000, at: 19_500 },
-    // Second stall: 30s..34s, again seen twice.
-    { waitedMs: 4_000, at: 34_000 },
-    { waitedMs: 3_500, at: 33_800 }
-  ]);
-
-  assert.ok(answer);
-  assert.equal(answer.samples, 2, "two interruptions");
-  assert.equal(answer.waits, 4, "from four waits");
-  assert.equal(answer.worstWaitSec, 10, "the merged stall, not one reader's view of it");
-  assert.equal(answer.medianIntervalSec, 10, "20s to 30s is when the encoder ran");
-  // One whole cycle: 10 s to 30 s, of which the 10 s interruption is half. The
-  // supply delivered for the other half, so a step must run at twice realtime.
-  assert.equal(answer.spanSec, 20);
-  assert.equal(answer.lostSec, 10);
-  assert.equal(answer.requiredSpeed, 2);
-});
-
-test("a copy at 8x clears its own supply with room to spare", () => {
-  // The same file's copied stream: waits up to 4.82 s, and it never stalled.
-  const waits = evenlySpaced(6, 15.5, 4.82);
-  const answer = requiredSpeedFrom(waits);
-  assert.ok(answer);
-  // Waits end 15.5 s apart and last 4.82 s, so the supply delivers for 10.68 s
-  // of every 15.5: 0.311 of its time lost, and 1/(1 - 0.311) = 1.45 against the
-  // 8x measured. Which is why a copy is the step a stranded viewer is always
-  // able to return to.
-  assert.ok(answer.requiredSpeed < 1.5, `got ${answer.requiredSpeed}`);
-});
-
-test("with too little evidence it says so instead of inventing a number", () => {
-  assert.equal(requiredSpeedFrom([]), null);
-  assert.equal(requiredSpeedFrom([{ waitedMs: 1500, at: 1 }]), null, "one wait shows no interval");
-  assert.equal(requiredSpeedFrom(null), null);
-  // Every wait at the same instant: no interval was observed, so no interval
-  // may be stated.
-  assert.equal(
-    requiredSpeedFrom([
-      { waitedMs: 1000, at: 5 },
-      { waitedMs: 1000, at: 5 }
-    ]),
-    null
-  );
-});
-
-test("readings that are not measurements are ignored, not averaged in", () => {
-  const answer = requiredSpeedFrom([
-    { waitedMs: 0, at: 1000 },
-    { waitedMs: Number.NaN, at: 2000 },
-    { waitedMs: 1000, at: 3000 },
-    { waitedMs: 2000, at: 5000 },
-    { waitedMs: 1500, at: 7000 }
-  ]);
-  assert.ok(answer);
-  assert.equal(answer.waits, 3, "only the three real waits count");
-});
-
-test("the buffer is one segment plus the worst interruption, and names which", () => {
-  const answer = minimumBufferFrom({
-    segmentSeconds: 4,
-    worstSupplyWaitSec: 3.16,
-    worstProductionGapSec: 1.2,
-    worstTransferSec: 0.066
-  });
-  assert.ok(answer);
-  assert.equal(answer.seconds, 7.16, "7.16 s against the 25 s that was chosen by hand");
-  assert.equal(answer.from, "supply");
-});
-
-test("a step that cannot keep up sets the buffer itself", () => {
-  const answer = minimumBufferFrom({
-    segmentSeconds: 4,
-    worstSupplyWaitSec: 1.4,
-    worstProductionGapSec: 6.5,
-    worstTransferSec: 0.05
-  });
-  assert.equal(answer.seconds, 10.5);
-  assert.equal(answer.from, "production", "the encoder, not the swarm, is what the viewer is waiting for");
-});
-
-test("a term with nothing observed contributes nothing", () => {
-  const answer = minimumBufferFrom({ segmentSeconds: 4 });
-  assert.equal(answer.seconds, 4, "one whole segment is the floor: the one being played");
-  assert.equal(answer.from, "none");
-  assert.equal(minimumBufferFrom({}), null, "without a segment duration nothing can be said");
-  assert.equal(minimumBufferFrom({ segmentSeconds: 0 }), null);
-});
-
-test("a supply that delivered for a sliver of the time asks for what it measured, uncut", () => {
-  // Two stalls of 99.9 s with 0.1 s of delivery between them: the share lost is
-  // 0.999, and the speed asked for is a thousand times realtime. A cap at a
-  // chosen 0.99 used to report a hundred.
-  const answer = requiredSpeedFrom([
-    { waitedMs: 99_900, at: 99_900 },
-    { waitedMs: 99_900, at: 199_900 }
-  ]);
-  assert.ok(answer);
-  assert.ok(Math.abs(answer.lostShare - 0.999) < 1e-9, `got ${answer.lostShare}`);
-  assert.ok(Math.abs(answer.requiredSpeed - 1000) < 1e-6, `got ${answer.requiredSpeed}`);
-});