@henols/vice-mcp 0.1.12 → 0.2.1

package/r2000-confidence.ts

@@ -0,0 +1,233 @@
+#!/usr/bin/env node
+// r2000-confidence.ts -- the ONE authoritative place in this repo for D-25's
+// confidence-grade convention: a machine-readable bracket-token prefix inside
+// an r2000 line comment (e.g. `[confirmed-code] observed executing at $0810`).
+//
+// WHY THIS MODULE EXISTS: r2000's own `BlockType` (twelve variants -- Code,
+// Byte, Word, Address, PETSCII, Screencode, four split-table variants,
+// ExternalFile, Undefined; `types.rs:314-331`) carries CLASSIFICATION but no
+// CONFIDENCE axis. `Code` cannot distinguish "PC observed executing" from
+// "reachable via a JSR, never run" -- that distinction is
+// `memory-map.template.md`'s most deliberate feature, and its own text
+// forbids promoting a row by editing its grade (re-verify and restate the
+// evidence instead). Measured (D-25): r2000 line comments persist through
+// save/reload (`user_line_comments`), and both `r2000_get_comments` and
+// `r2000_search_disassembly` (which searches comments by default) can filter
+// on a leading token -- so "show me everything still [unknown]" is a real
+// query today, with NO new storage.
+//
+// WHAT THIS IS THE ONE AUTHORITATIVE PLACE FOR:
+//   - the five-grade vocabulary (`CONFIDENCE_GRADES`), copied verbatim from
+//     `.claude/skills/c64-program-recon/templates/memory-map.template.md`'s
+//     own confidence table -- nowhere else in this repo may hand-write one
+//     of these five phrases or bracket tokens as a second copy;
+//   - the parser (`parseConfidencePrefix`) that decides whether a comment
+//     carries a grade, an ungraded plain comment, or a TYPO'D near-miss that
+//     must fail loudly;
+//   - the composer (`formatConfidenceComment`) that writes a graded comment,
+//     so no caller invents its own spelling of a bracket token;
+//   - the query builder (`searchQueryForGrade`) that gives the "still
+//     [grade]" search exactly one spelling.
+//
+// THE POINT OF THIS MODULE, STATED PLAINLY: a comment beginning with a
+// bracket token that is NOT exactly one of the five valid tokens must THROW,
+// naming the offending token and listing the five valid ones. A comment with
+// no leading bracket at all is a legal, ungraded comment (`grade: null`) --
+// that is not an error. What must NEVER happen is a TYPO silently degrading
+// into an ungraded comment, because that is exactly how an `[unknown]` row
+// could disappear from the "still unknown" query without anyone noticing.
+//
+// WHAT NOT TO DO, named concretely:
+//   - Never accept a near-miss token (wrong case, an underscore instead of a
+//     hyphen, a plural, extra whitespace inside the brackets, a genuine
+//     typo). Every one of those must throw `R2000ConfidenceGradeError`, not
+//     silently degrade to `grade: null`.
+//   - Never add a second, address-keyed sidecar store for grades (T-11-
+//     SECOND-STORE). Grades live ONLY as this bracket-token prefix inside
+//     r2000's own line comments -- a second store keyed by address is
+//     exactly the drift class criterion 1 exists to close, and it would not
+//     be queryable through the same `r2000_get_comments` /
+//     `r2000_search_disassembly` tools this module's whole design depends
+//     on.
+//   - Never promote a row by editing its grade in place. The template's own
+//     text says so, and this module has no "upgrade" or "promote" function
+//     by design -- a caller who wants to change a grade calls
+//     `r2000_set_comment` again with a freshly composed
+//     `formatConfidenceComment()` string, leaving a new comment (or
+//     replacing the old one explicitly), never a silent in-place mutation
+//     this module would hide.
+//   - Never widen `CONFIDENCE_GRADES` without updating
+//     `memory-map.template.md`'s own table first -- the template is the
+//     source of the vocabulary, this module is its one authoritative
+//     runtime copy, and the non-vacuity test below fails if the two drift.
+
+export interface ConfidenceGrade {
+  /** The bracket token's inner text, e.g. `"confirmed-code"` -- no brackets. */
+  readonly token: string;
+  /** The full bracket token as it appears in a comment, e.g. `"[confirmed-code]"`. */
+  readonly bracket: string;
+  /** The human phrase from `memory-map.template.md`'s own confidence table,
+   * e.g. `"confirmed code"` (no hyphen -- this is prose, not an identifier). */
+  readonly phrase: string;
+  /** What the grade means, copied verbatim from the template's "Means" column. */
+  readonly meaning: string;
+}
+
+/**
+ * The five grades from `memory-map.template.md`'s confidence table, in the
+ * template's own order. This is the ONE place the vocabulary is written
+ * down -- see the module header's "what NOT to do" list.
+ */
+export const CONFIDENCE_GRADES: readonly ConfidenceGrade[] = [
+  {
+    token: "confirmed-code",
+    bracket: "[confirmed-code]",
+    phrase: "confirmed code",
+    meaning: "Executed during tracing, PC observed inside it",
+  },
+  {
+    token: "probable-code",
+    bracket: "[probable-code]",
+    phrase: "probable code",
+    meaning: "Reachable through a JSR/JMP/vector, not yet observed executing",
+  },
+  {
+    token: "confirmed-data",
+    bracket: "[confirmed-data]",
+    phrase: "confirmed data",
+    meaning: "Never hit as an instruction stream across full gameplay coverage",
+  },
+  {
+    token: "probable-data",
+    bracket: "[probable-data]",
+    phrase: "probable data",
+    meaning:
+      "Indexed-load target, or matches a data shape (sprite blocks, PETSCII, address tables)",
+  },
+  {
+    token: "unknown",
+    bracket: "[unknown]",
+    phrase: "unknown",
+    meaning: "No reliable interpretation yet",
+  },
+] as const;
+
+/** Every valid bracket token, e.g. `["[confirmed-code]", ..., "[unknown]"]`. */
+const VALID_BRACKETS: readonly string[] = CONFIDENCE_GRADES.map((g) => g.bracket);
+
+/** Every valid inner token, e.g. `["confirmed-code", ..., "unknown"]`. */
+const VALID_TOKENS: readonly string[] = CONFIDENCE_GRADES.map((g) => g.token);
+
+const GRADE_BY_TOKEN: ReadonlyMap<string, ConfidenceGrade> = new Map(
+  CONFIDENCE_GRADES.map((g) => [g.token, g]),
+);
+
+export interface R2000ConfidenceGradeErrorOptions {
+  /** The raw text found between the leading `[` and `]`, verbatim -- may
+   * carry the wrong case, stray whitespace, an underscore, or a plural, so a
+   * caller can see exactly what was rejected. */
+  offendingToken: string;
+}
+
+/**
+ * Thrown by `parseConfidencePrefix()` when a comment begins with a bracket
+ * token that is not exactly one of `CONFIDENCE_GRADES`'s five. Named,
+ * carries the offending token as a field, and its message lists all five
+ * valid tokens -- mirroring `r2000-launch.ts`'s `R2000ViceFlagError` shape
+ * (a named error over a malformed token, rather than a silent strip).
+ */
+export class R2000ConfidenceGradeError extends Error {
+  offendingToken: string;
+
+  constructor(message: string, { offendingToken }: R2000ConfidenceGradeErrorOptions) {
+    super(message);
+    this.name = "R2000ConfidenceGradeError";
+    this.offendingToken = offendingToken;
+  }
+}
+
+export interface ParsedConfidencePrefix {
+  /** The matched grade, or `null` for a legal, ungraded plain comment. */
+  grade: ConfidenceGrade | null;
+  /** The comment text with the leading bracket token (and one following
+   * run of whitespace, if any) stripped. Equal to the input when `grade` is
+   * `null`. */
+  rest: string;
+}
+
+/**
+ * Extracts a leading `[...]` bracket token from `comment` and resolves it
+ * against `CONFIDENCE_GRADES`.
+ *
+ * - No leading bracket at all (the comment does not start with `[`, or has
+ *   no closing `]`): returns `{ grade: null, rest: comment }`. A comment
+ *   with no attempted grade token is legal and ungraded -- this is not an
+ *   error.
+ * - A leading bracket token that matches exactly one of the five valid
+ *   tokens: returns `{ grade, rest }` with `rest` being the remainder after
+ *   the bracket and one run of following whitespace.
+ * - A leading bracket token that does NOT match exactly one of the five
+ *   (wrong case, an underscore, a plural, stray whitespace inside the
+ *   brackets, or a plain typo): THROWS `R2000ConfidenceGradeError`, naming
+ *   the offending token and listing the five valid ones. This is the whole
+ *   point of the module -- see the header comment.
+ */
+export function parseConfidencePrefix(comment: string): ParsedConfidencePrefix {
+  const match = /^\[([^[\]]*)\](\s*)/.exec(comment);
+  if (!match) {
+    return { grade: null, rest: comment };
+  }
+
+  const innerToken = match[1]!;
+  const grade = GRADE_BY_TOKEN.get(innerToken);
+  if (!grade) {
+    throw new R2000ConfidenceGradeError(
+      `"[${innerToken}]" is not a valid confidence grade -- the five valid tokens are ` +
+        `${VALID_BRACKETS.join(", ")}. A near-miss (wrong case, an underscore instead of a hyphen, a ` +
+        "plural, stray whitespace inside the brackets, or a plain typo) is refused rather than " +
+        "silently treated as an ungraded comment, because that is exactly how an [unknown] row " +
+        "could disappear from the \"still unknown\" query without anyone noticing.",
+      { offendingToken: innerToken },
+    );
+  }
+
+  const consumed = match[0]!.length;
+  return { grade, rest: comment.slice(consumed) };
+}
+
+/**
+ * Composes a graded comment: the grade's bracket token, one space, then
+ * `evidence`. The ONE place a graded comment is assembled, so no caller
+ * invents its own spelling of a bracket token.
+ */
+export function formatConfidenceComment(grade: string, evidence: string): string {
+  const found = GRADE_BY_TOKEN.get(grade);
+  if (!found) {
+    throw new R2000ConfidenceGradeError(
+      `"${grade}" is not a valid confidence grade token -- the five valid tokens are ` +
+        `${VALID_TOKENS.join(", ")}.`,
+      { offendingToken: grade },
+    );
+  }
+  return `${found.bracket} ${evidence}`;
+}
+
+/**
+ * Returns the literal search string that appears verbatim in every comment
+ * carrying `grade` -- the bracket token itself, e.g. `"[unknown]"`. Passing
+ * this to `r2000_search_disassembly`'s `query` (with `use_regex` left
+ * false/omitted) lists every address still carrying that grade. One
+ * spelling, so "show me everything still [unknown]" never has two competing
+ * queries drifting apart.
+ */
+export function searchQueryForGrade(grade: string): string {
+  const found = GRADE_BY_TOKEN.get(grade);
+  if (!found) {
+    throw new R2000ConfidenceGradeError(
+      `"${grade}" is not a valid confidence grade token -- the five valid tokens are ` +
+        `${VALID_TOKENS.join(", ")}.`,
+      { offendingToken: grade },
+    );
+  }
+  return found.bracket;
+}

package/r2000-d64.ts

@@ -0,0 +1,310 @@
+#!/usr/bin/env node
+// Pure, offline `.d64` directory listing and named-entry byte extraction --
+// the container-side half of D-02's ".d64 is a first-class bootstrap input"
+// requirement.
+//
+// WHY THIS FILE EXISTS HERE, AND NOT AS AN EXTENSION OF
+// `.claude/skills/c64-ram-capture/scripts/d64-parse.mjs`: the researcher's
+// own recommendation (RESEARCH.md Open Question #2) was to extend
+// `d64-parse.mjs` in place, since it already walks the directory chain. That
+// is not reachable in practice: this MCP server ships as `@henols/vice-mcp`,
+// whose `files[]` in `package.json` lists only `.claude/mcp/vice/` contents,
+// while `.claude/skills/**` ships in the *other* package
+// (`@henols/c64-re-tools`). An import from this seam into a skill script
+// cannot resolve on either npm-installer route (neither copies the sibling
+// package's source tree onto disk next to it), and
+// `scripts/check-npm-packages.mjs`'s transitive-closure walk over `files[]`
+// would fail the pack the moment a reachable module sat outside the listed
+// set. So this is a SECOND, independent copy of the sector-chain-walk
+// algorithm, container-side, scoped to exactly what the r2000 bootstrap
+// needs -- not a shared library and not an import of the skill-side module.
+//
+// `d64-parse.mjs` REMAINS the skill-side owner of the algorithm and is left
+// entirely untouched by this phase; this module's job is not to grow beyond
+// the bootstrap's needs, and neither copy should silently drift into a
+// general-purpose disk-image library. If the two ever need to diverge in
+// behaviour, that is a deliberate, documented decision, not an accident of
+// two files existing.
+//
+// WHAT NOT TO DO:
+//   - Never auto-pick a directory entry when the caller does not name one
+//     (D-02). A silent auto-pick would happily hand a cracktro or loader
+//     stub's bytes to the analyser instead of the actual game -- precisely
+//     the failure `c64-provenance-diff` exists to prevent elsewhere in this
+//     project. Zero matches and multiple matches both throw here; neither
+//     returns a guess.
+//   - Never walk a sector chain (the directory's own, or an entry's) without
+//     the visited-set cycle guard below. A corrupt or adversarial
+//     next-track/next-sector pointer must be caught, not looped on.
+//   - Never call the process's exit hook or any console-printing function
+//     from this module. The fail-loud "no name given -> print the directory
+//     listing -> exit non-zero" CLI contract belongs to the caller (plan
+//     10-04's CLI seam),
+//     not here -- this module is a pure, offline byte transform with no
+//     process-level side effects.
+//
+// Inherited, documented limits (from `d64-parse.mjs`'s own header, carried
+// forward unchanged): plain 174848-byte, 35-track 1541 images only. No
+// error-info-byte variant (175531 bytes) and no 40-track variant are
+// supported -- `assertPlainImage()` below enforces the 174848-byte length
+// and throws naming the actual length otherwise.
+
+/** The four sector-count zones of a standard 35-track 1541 image. */
+export function sectorsPerTrack(track: number): number {
+  if (!Number.isInteger(track) || track < 1 || track > 35) {
+    throw new Error(`sectorsPerTrack: track ${track} out of range 1-35`);
+  }
+  if (track <= 17) return 21;
+  if (track <= 24) return 19;
+  if (track <= 30) return 18;
+  return 17;
+}
+
+/** Byte offset of the start of {track, sector} in a flat 35-track image. */
+export function tsToOffset(track: number, sector: number): number {
+  if (!Number.isInteger(track) || track < 1 || track > 35) {
+    throw new Error(`tsToOffset: track ${track} out of range 1-35`);
+  }
+  const spt = sectorsPerTrack(track);
+  if (!Number.isInteger(sector) || sector < 0 || sector >= spt) {
+    throw new Error(
+      `tsToOffset: sector ${sector} out of range for track ${track} (0-${spt - 1}, this track has ${spt} sectors)`,
+    );
+  }
+  let offset = 0;
+  for (let t = 1; t < track; t++) offset += sectorsPerTrack(t) * 256;
+  return offset + sector * 256;
+}
+
+function isInImage(track: number, sector: number): boolean {
+  if (!Number.isInteger(track) || track < 1 || track > 35) return false;
+  if (!Number.isInteger(sector) || sector < 0) return false;
+  return sector < sectorsPerTrack(track);
+}
+
+/**
+ * WR-05: bounds every sector read against the actual buffer length, not just
+ * disk geometry. `isInImage()` above only validates {track, sector} against
+ * the standard 35-track zone table -- it has no access to the image bytes
+ * and cannot catch a truncated or non-plain image whose geometry is
+ * otherwise valid. Without this bound check, a bare subarray read clamps
+ * silently to whatever bytes exist, and a caller reading past that point
+ * (e.g. `sec[0]`/`sec[1]` for chain pointers, or the payload slice) reads
+ * `undefined` and derived garbage with no diagnostic. Used at BOTH sector
+ * read sites (the directory walk and the file-chain walk) so the bound
+ * check is part of the walk itself, not a separate opt-in the caller can
+ * forget -- see `assertPlainImage()` below, which stays a distinct,
+ * unrelated whole-image-length check for its one existing caller.
+ */
+function sectorSlice(image: Uint8Array, track: number, sector: number, what: string): Uint8Array {
+  const off = tsToOffset(track, sector);
+  if (off + 256 > image.length) {
+    throw new Error(
+      `${what}: sector ${track}/${sector} needs bytes ${off}..${off + 255} but the image is only ` +
+        `${image.length} bytes -- truncated or non-plain image`,
+    );
+  }
+  return image.subarray(off, off + 256);
+}
+
+/**
+ * Directory/disk-name bytes are PETSCII, padded with $A0 OR $00 (WR-06: some
+ * disk-writing tools, and any image where a slot was partially rewritten,
+ * pad with NUL instead). As in `d64-parse.mjs`, every byte this project's
+ * disks actually use in a name (A-Z, digits, space, parens) sits at the same
+ * code point in PETSCII as in ASCII/Latin-1, so only padding needs
+ * stripping -- there is no general PETSCII<->ASCII table here, deliberately,
+ * since one is not needed for what these disks contain.
+ *
+ * This function's padding definition MUST agree with the inline
+ * `isEmptySlot` check in `listEntries()` below, which already treats both
+ * `0xa0` and `0x00` as filler: a name this function prints (via
+ * `listEntries()`) must be a name `extractEntry()`'s `--entry` argument can
+ * select, or the printed listing is a dead end (WR-06's reproduced
+ * incident).
+ */
+function petsciiName(bytes: Uint8Array): string {
+  let end = bytes.length;
+  while (end > 0 && (bytes[end - 1] === 0xa0 || bytes[end - 1] === 0x00)) end--;
+  return Buffer.from(bytes.subarray(0, end)).toString("latin1");
+}
+
+const FILE_TYPES: Record<number, string> = { 0: "DEL", 1: "SEQ", 2: "PRG", 3: "USR", 4: "REL" };
+
+export interface D64Entry {
+  name: string;
+  type: string;
+  track: number;
+  sector: number;
+  sizeBlocks: number;
+}
+
+/**
+ * Walk the directory chain from track 18 sector 1, exactly as
+ * `d64-parse.mjs`'s `parseDirectory()` does, returning the flat listing the
+ * caller can print. Never picks a "best" or "likely" entry -- that decision
+ * belongs to the caller and to `extractEntry()`'s exact-name match below.
+ */
+export function listEntries(image: Uint8Array): D64Entry[] {
+  const entries: D64Entry[] = [];
+  const visited = new Set<string>();
+  let track = 18;
+  let sector = 1;
+
+  for (;;) {
+    const key = `${track}/${sector}`;
+    if (visited.has(key)) {
+      throw new Error(
+        `listEntries: directory chain revisited ${key} -- stopped to avoid an infinite loop (self-referential or cyclic next-sector pointer)`,
+      );
+    }
+    visited.add(key);
+    if (!isInImage(track, sector)) {
+      throw new Error(`listEntries: directory chain pointer ${key} is outside the image -- stopped`);
+    }
+
+    const sec = sectorSlice(image, track, sector, "listEntries");
+    const nextTrack = sec[0];
+    const nextSector = sec[1];
+
+    for (let i = 0; i < 8; i++) {
+      const e = sec.subarray(i * 32, i * 32 + 32);
+      const typeByte = e[2];
+      const firstTrack = e[3];
+      const firstSector = e[4];
+      const nameBytes = e.subarray(5, 21);
+      const blocks = e[30] | (e[31] << 8);
+
+      // An all-zero type byte with a blank/padded name is an unused slot,
+      // not a file -- never listed as an entry.
+      const isEmptySlot =
+        typeByte === 0 && firstTrack === 0 && firstSector === 0 &&
+        [...nameBytes].every((b) => b === 0xa0 || b === 0x00);
+      if (isEmptySlot) continue;
+
+      entries.push({
+        name: petsciiName(nameBytes),
+        type: FILE_TYPES[typeByte & 0x0f] ?? `unknown(0x${(typeByte & 0x0f).toString(16)})`,
+        track: firstTrack,
+        sector: firstSector,
+        sizeBlocks: blocks,
+      });
+    }
+
+    if (nextTrack === 0) break; // end of chain, by DOS convention
+    track = nextTrack;
+    sector = nextSector;
+  }
+
+  return entries;
+}
+
+/**
+ * Resolve `entryName` against `listEntries(image)` by exact,
+ * case-insensitive match. Zero matches and multiple matches both throw --
+ * D-02's whole point is that this function never guesses. On success,
+ * follows that entry's OWN sector chain (starting at its own
+ * first_track/first_sector, NOT the fixed directory-chain start) and
+ * concatenates each sector's 254 payload bytes, honouring the 1541 DOS
+ * end-of-chain convention: when a sector's next-track byte is 0, its
+ * next-sector byte instead holds the zero-based offset of the LAST used
+ * byte in that final 256-byte sector (so the last sector contributes
+ * `usedByte - 1` payload bytes, not 254 -- the payload runs from byte 2 up
+ * to and INCLUDING byte `usedByte`).
+ *
+ * The returned bytes are the file's RAW content INCLUDING its leading 2-byte
+ * PRG load address, unmodified -- that is deliberate, since the whole point
+ * of this module is to hand bytes straight to `parsePrg()` in
+ * `r2000-project.ts`, which expects that same 2-byte header.
+ */
+export function extractEntry(image: Uint8Array, entryName: string): Uint8Array {
+  const entries = listEntries(image);
+  const needle = entryName.toLowerCase();
+  const matches = entries.filter((e) => e.name.toLowerCase() === needle);
+
+  if (matches.length === 0) {
+    const available = entries.map((e) => e.name).join(", ") || "(no entries)";
+    throw new Error(
+      `extractEntry: no entry named "${entryName}" found. Available entries: ${available}`,
+    );
+  }
+  if (matches.length > 1) {
+    throw new Error(
+      `extractEntry: entry name "${entryName}" is ambiguous -- ${matches.length} entries share this name (at ` +
+        `${matches.map((m) => `${m.track}/${m.sector}`).join(", ")}). Refusing to pick one; rename or disambiguate on disk.`,
+    );
+  }
+
+  const entry = matches[0];
+  const chunks: Uint8Array[] = [];
+  const visited = new Set<string>();
+  let track = entry.track;
+  let sector = entry.sector;
+
+  for (;;) {
+    const key = `${track}/${sector}`;
+    if (visited.has(key)) {
+      throw new Error(
+        `extractEntry: sector chain for "${entryName}" revisited ${key} -- stopped to avoid an infinite loop (self-referential or cyclic next-sector pointer)`,
+      );
+    }
+    visited.add(key);
+    if (!isInImage(track, sector)) {
+      throw new Error(`extractEntry: sector chain for "${entryName}" points to ${key}, which is outside the image`);
+    }
+
+    const sec = sectorSlice(image, track, sector, `extractEntry: "${entryName}"`);
+    const nextTrack = sec[0];
+    const nextSector = sec[1];
+
+    if (nextTrack === 0) {
+      // Last sector: byte 1 is the zero-based offset of the last used byte
+      // in this 256-byte sector (not a next-sector pointer). Payload runs
+      // from byte 2 up to and including that offset, so its length is
+      // `usedByte - 1` -- e.g. usedByte === 255 means the whole sector past
+      // the 2-byte header is payload (254 bytes), matching a non-final
+      // sector; a smaller usedByte means fewer payload bytes than that.
+      // WR-05: a corrupt/truncated `usedByte` of 0 or 1 previously silently
+      // clamped to a zero-length payload via a floor-at-2 clamp, which
+      // surfaced downstream only as the confusing
+      // `parsePrg: input is 0 byte(s)`. Throw here instead, naming the
+      // sector and the observed value.
+      const usedByte = nextSector;
+      if (usedByte < 2) {
+        throw new Error(
+          `extractEntry: "${entryName}" final sector ${track}/${sector} reports usedByte ${usedByte}, ` +
+            "which is less than the minimum valid value of 2 -- corrupt or non-plain image",
+        );
+      }
+      chunks.push(sec.subarray(2, usedByte + 1));
+      break;
+    }
+
+    chunks.push(sec.subarray(2, 256));
+    track = nextTrack;
+    sector = nextSector;
+  }
+
+  const total = chunks.reduce((n, c) => n + c.length, 0);
+  const out = new Uint8Array(total);
+  let pos = 0;
+  for (const c of chunks) {
+    out.set(c, pos);
+    pos += c.length;
+  }
+  return out;
+}
+
+/**
+ * Enforce the inherited, documented limits: plain 174848-byte, 35-track
+ * images only. 40-track and error-info-byte (175531-byte) variants are
+ * deliberately out of scope for this phase, exactly as `d64-parse.mjs`
+ * documents for the skill-side reader.
+ */
+export function assertPlainImage(image: Uint8Array): void {
+  if (image.length !== 174848) {
+    throw new Error(
+      `assertPlainImage: expected a plain 174848-byte, 35-track .d64 image with no error-info bytes, got ${image.length} bytes`,
+    );
+  }
+}