treefmt: apply prettier

Pure `nix fmt` output from the commit before this one — no hand edits.
203 files: 52 md, 42 tsx, 32 js, 32 css, 21 ts, 13 html, 8 json, 3 mjs.

Reproduce with `nix develop -c nix fmt` on the parent commit; the result
should be byte-identical to this tree.

None of the 13 `.prettierignore` entries appears here — verified by
intersecting the changed-file list against the ignore file, with a
control proving the intersection finds a match when one exists.

hive-jobq/README.md

@@ -23,12 +23,12 @@ its reconcile sweep.
 
 One **shared graph** for the whole system, not a DAG per job. Enqueuing
 inserts a self-contained sub-DAG and returns the ids of the nodes the job
-*asked* for, in the order it named them; the scheduler runs a continuous loop,
+_asked_ for, in the order it named them; the scheduler runs a continuous loop,
 starting every node whose deps are satisfied:
 
 - **Resource deps** are named counting semaphores over a caller-chosen type `R`
   — e.g. `build-slot` (capacity N), `agent/<name>` (capacity 1), or any
-  unconfigured name (capacity 1, created on use). A node acquires *all* its
+  unconfigured name (capacity 1, created on use). A node acquires _all_ its
   resource deps atomically at start (all-or-nothing) — no hold-and-wait, so no
   deadlock.
 - **Node deps** wait on another node per `DepWhen`: `AfterOk` needs success (a
@@ -37,7 +37,7 @@ starting every node whose deps are satisfied:
 A node carries two independent axes: its `Dep`s (ordering + resource needs) and
 its `parent` (structural grouping). The **parent chain**, not the node edges, is
 what the scheduler consults for resource re-entrancy: a resource unit is held
-for the acquiring node *plus its whole parent subtree*, and a descendant needing
+for the acquiring node _plus its whole parent subtree_, and a descendant needing
 a resource an ancestor already holds re-uses that grant (a re-entrant borrow,
 one branch at a time) rather than taking a fresh unit.
 
@@ -53,7 +53,7 @@ single-threaded — it owns the resource table and mutates it directly.
   choke point (and where each node's lifecycle timestamps —
   `started_at` / `finished_at`, `DateTime<Utc>` — are stamped).
 - **`Node<N, R>`** — `{ id, parent, payload, deps, state, started_at,
-  finished_at, error }`. All fields public; derives serde for the wire
+finished_at, error }`. All fields public; derives serde for the wire
   projection (and so a store could be added — nothing calls one today).
 - **`Scheduler<N, R>`** — drives the graph: `settle()` starts every ready node
   (acquiring resources atomically), `complete(id, outcome)` reports a finished