ledger: 2026-11-04 crypto top-20 by market cap (CoinGecko, 20 rows) + verifier

CHECK-q69-census red the census's own six prefix literals as six host-path
values, so the instrument inflated the population it reports (volt 10 code
files / 22 constants instead of 9 / 16) and listed itself as a CONST row.
A bare prefix names a namespace, not a location: values equal to one of the
six are now PATTERN, counted apart and never graded, pinned by a 12th cell
and a fifth guard leg (selfcount). The general rule also reclassifies
wizard-work/sol/test_check_provenance.py:160, whose only host string is an
assertion needle.

Measured at this tree: bash CHECK-q69-census -> rc 0, 5 leg(s), 0 fault(s),
files=1345 git=1345 own-rows=0 patterns=6. Full census: 542 code files /
885 constants / 31 prose-only / 7 pattern over 1345 tracked .py; text scan
586. The record in WORK-QUEUE.md carries the post-fix readings.

CHECK: bash CHECK-q69-census

CHECK-2026-11-02-untracked-classify

@@ -0,0 +1,25 @@
+#!/usr/bin/env bash
+# CHECK -- untracked-file triage classification, 2026-11-02 (sol lane by
+# authorship; Q157 repair by volt, 2026-11-02).
+#
+# Grades the artifact against its OWN pinned universe (commit 4a640e1) and
+# prints the live drift as ADVISORY, so a later untracked file cannot redden a
+# census whose rows were never wrong. Before the repair this file exited 1
+# within minutes of every tick.
+#
+# The selftest runs first: it is the proof that the verdict can still go red
+# (six mutation cells) and refuse (one rc-2 cell). Exit 0 iff both pass.
+set -u
+
+REPO_ROOT="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)" || exit 2
+cd "$REPO_ROOT" || exit 2
+
+VERIFY="wizard-work/sol/verify_untracked_classify_2026_11_02.py"
+[ -f "$VERIFY" ] || { echo "CANNOT GRADE: verifier absent at $VERIFY"; exit 2; }
+
+# The path is spelled out on the invocation lines, not only held in $VERIFY: the
+# q63 census reads an INVOCATION as wiring and an assignment as a mention, and
+# Q159 measured this file's own census row going CLASS_REGRESSED when the path
+# lived only in a variable. $VERIFY stays for the absence guard below.
+python3 wizard-work/sol/verify_untracked_classify_2026_11_02.py --selftest || exit $?
+exec python3 wizard-work/sol/verify_untracked_classify_2026_11_02.py "$@"

CHECK-extension-census-2026-11-03

@@ -0,0 +1,7 @@
+#!/usr/bin/env bash
+# CHECK -- extension census (extract lane). Exit 0 iff the committed
+# wizard-work/ledger/extension-census.csv is byte-identical to a fresh
+# re-derivation from repo_files.tsv.
+set -u
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+exec python3 wizard-work/ledger/verify_extension_census.py

CHECK-q154

@@ -0,0 +1,141 @@
+#!/usr/bin/env bash
+# CHECK-q154 -- quill's draft-compliance census is a snapshot, and it is graded
+# against the revision it names (volt, 2026-11-02).
+#
+# Five legs:
+#   gate        the repaired quill gate reads 0: selftest / pinned / rev-probe /
+#               regenerate / copy-parity
+#   rev-probe   the verifier's revision mode is a measurement: the pinned rev is
+#               0, 8847c7c -- the commit that hand-edited the table -- is 1, and
+#               a rev that does not resolve is 2, not a pass
+#   delegation  the lane copy is a pointer to the root gate (0 in place) and a
+#               copy without its target is ungradable (2), never a pass
+#   beam        the adjacent host-path binding the repo gate was red on is
+#               repaired: the authority reads 0 faults, and the test file in a
+#               copy grades the module BESIDE it (poisoned sibling 1, no sibling 1)
+#   pin         the pin names a rev that resolves, the committed table is the
+#               bytes it names, and the table carries its header row
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/quill"
+PIN="$LANE/draft-compliance-report-2026-10-31.pin"
+TSV="$LANE/draft-compliance-report-2026-10-31.tsv"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q154.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+ungradable=0
+row() { printf '  %-12s %s\n' "$1" "$2"; }
+
+PIN_REV="$(sed -n 's/^rev[[:space:]]*//p' "$PIN" 2>/dev/null | head -1)"
+PIN_TSV="$(sed -n 's/^tsv[[:space:]]*//p' "$PIN" 2>/dev/null | head -1)"
+
+# --- leg 1: the quill gate ---------------------------------------------------
+bash "$ROOT/CHECK-quill-draft-compliance" >"$WORK/gate.out" 2>&1
+gate_rc=$?
+if [ "$gate_rc" -eq 0 ]; then
+    row gate "PASS  $(tail -n 1 "$WORK/gate.out")"
+    passed=$((passed + 1))
+elif [ "$gate_rc" -eq 2 ]; then
+    row gate "UNGRADABLE rc=2"
+    cat "$WORK/gate.out"
+    ungradable=$((ungradable + 1))
+else
+    row gate "FAULT rc=$gate_rc"
+    cat "$WORK/gate.out"
+    failed=$((failed + 1))
+fi
+
+# --- leg 2: revision mode is a measurement ----------------------------------
+if [ -z "$PIN_REV" ]; then
+    row rev-probe "UNGRADABLE pin names no rev"
+    ungradable=$((ungradable + 1))
+else
+    python3 "$LANE/verify_draft_compliance.py" --rev "$PIN_REV" >"$WORK/r1.out" 2>&1
+    r1=$?
+    python3 "$LANE/verify_draft_compliance.py" --rev 8847c7c >"$WORK/r2.out" 2>&1
+    r2=$?
+    python3 "$LANE/verify_draft_compliance.py" --rev 0000000000000000000000000000000000000000 \
+        >"$WORK/r3.out" 2>&1
+    r3=$?
+    if [ "$r1" -eq 0 ] && [ "$r2" -eq 1 ] && [ "$r3" -eq 2 ]; then
+        row rev-probe "PASS  ${PIN_REV:0:7} rc=0, 8847c7c rc=1, bogus rev rc=2"
+        passed=$((passed + 1))
+    else
+        row rev-probe "FAULT pinned rc=$r1 (want 0), 8847c7c rc=$r2 (want 1), bogus rc=$r3 (want 2)"
+        head -3 "$WORK/r1.out" "$WORK/r2.out" "$WORK/r3.out"
+        failed=$((failed + 1))
+    fi
+fi
+
+# --- leg 3: the lane copy delegates, and says so when it cannot -------------
+bash "$LANE/CHECK-quill-draft-compliance" >"$WORK/d1.out" 2>&1
+d1=$?
+mkdir -p "$WORK/lone/wizard-work/quill"
+cp "$LANE/CHECK-quill-draft-compliance" "$WORK/lone/wizard-work/quill/"
+bash "$WORK/lone/wizard-work/quill/CHECK-quill-draft-compliance" >"$WORK/d2.out" 2>&1
+d2=$?
+if [ "$d1" -eq 0 ] && [ "$d2" -eq 2 ]; then
+    row delegation "PASS  lane copy rc=0, orphaned copy rc=2 ($(head -n 1 "$WORK/d2.out"))"
+    passed=$((passed + 1))
+else
+    row delegation "FAULT lane copy rc=$d1 (want 0), orphaned rc=$d2 (want 2)"
+    head -3 "$WORK/d1.out" "$WORK/d2.out"
+    failed=$((failed + 1))
+fi
+
+# --- leg 4: the adjacent beam binding, and that it is really bound ----------
+python3 "$ROOT/tools/import_resolve_check.py" --repo "$ROOT" --rev WORKTREE \
+    >"$WORK/irc.out" 2>&1
+irc=$?
+mkdir -p "$WORK/b/copy" "$WORK/b/alone"
+cp "$ROOT/wizard-work/beam/test_largest_rect_hist.py" \
+   "$ROOT/wizard-work/beam/largest_rect_hist.py" "$WORK/b/copy/"
+( cd "$WORK/b/copy" && python3 test_largest_rect_hist.py >/dev/null 2>&1 )
+b_ok=$?
+sed -i 's/^def _brute(heights: List\[int\]) -> int:/&\n    return 0/' \
+    "$WORK/b/copy/largest_rect_hist.py"
+( cd "$WORK/b/copy" && python3 test_largest_rect_hist.py >/dev/null 2>&1 )
+b_poison=$?
+cp "$ROOT/wizard-work/beam/test_largest_rect_hist.py" "$WORK/b/alone/"
+( cd "$WORK/b/alone" && python3 test_largest_rect_hist.py >/dev/null 2>&1 )
+b_alone=$?
+if [ "$irc" -eq 0 ] && [ "$b_ok" -eq 0 ] && [ "$b_poison" -eq 1 ] && [ "$b_alone" -eq 1 ]; then
+    row beam "PASS  authority 0 fault(s); sibling rc=0, poisoned rc=1, absent rc=1"
+    passed=$((passed + 1))
+else
+    row beam "FAULT authority rc=$irc, sibling rc=$b_ok (want 0), poisoned rc=$b_poison (want 1), absent rc=$b_alone (want 1)"
+    tail -3 "$WORK/irc.out"
+    failed=$((failed + 1))
+fi
+
+# --- leg 5: the pin's three claims ------------------------------------------
+if [ -z "$PIN_REV" ] || [ -z "$PIN_TSV" ]; then
+    row pin "UNGRADABLE pin lacks a rev or a tsv digest"
+    ungradable=$((ungradable + 1))
+else
+    git -C "$ROOT" cat-file -e "$PIN_REV^{commit}" 2>/dev/null
+    pin_rev_rc=$?
+    have="$(sha256sum "$TSV" | cut -d' ' -f1)"
+    header="$(sed -n 2p "$TSV")"
+    want_header="$(printf 'filename	lines	has_verdict	has_check	check_clean	check_command')"
+    if [ "$pin_rev_rc" -eq 0 ] && [ "$have" = "$PIN_TSV" ] && [ "$header" = "$want_header" ]; then
+        row pin "PASS  rev resolves, sha256 ${have:0:12}, header row present"
+        passed=$((passed + 1))
+    else
+        row pin "FAULT rev rc=$pin_rev_rc, digest ${have:0:12} vs pin ${PIN_TSV:0:12}, header=$(printf %q "$header")"
+        failed=$((failed + 1))
+    fi
+fi
+
+echo
+echo "CHECK-q154: $passed leg(s) passed, $failed fault(s), $ungradable ungradable"
+[ "$failed" -eq 0 ] || exit 1
+[ "$ungradable" -eq 0 ] || exit 2
+exit 0

CHECK-q156

@@ -0,0 +1,74 @@
+#!/usr/bin/env bash
+# CHECK-q156 -- the Q85 landing left the gate red in three legs; repaired, and
+# the three legs plus the record that says so are graded here.
+#
+# WHAT WAS WRONG (measured at 8e08516, before this tick's edits)
+#   c05f05a appended a `## Q85 closure` heading and a `**Q85 — DONE ...` record
+#   to WORK-QUEUE.md and shipped neither the re-rendered docs/queue-index.md
+#   nor the PIN_COUNTS move. tools/verify.py --fast read 12 legs, 8 pass,
+#   3 fault (index-current, append-audit, open-set), gate FAULT, rc 1; each leg
+#   read alone was rc 1 with STALE at line 7 / `STALE c05f05a index:no` /
+#   headings 102 -> 103, records 116 -> 117, record_ids 82 -> 83.
+#
+# WHAT THIS GRADES
+#   1. gate          tools/verify.py --fast -- 12 legs, 0 fault, rc 0.
+#   2. open-set      open_set.py --check -- the PIN_COUNTS match this queue.
+#   3. index         queue_index.py --check -- the rendered index matches it.
+#   4. append-guard  queue_append_audit.py --guard --to HEAD -- the newest
+#                    queue-touching commit left the index current in its OWN
+#                    tree. This leg is why the repair had to touch the queue
+#                    and the index in one commit: the guard grades the newest
+#                    queue-touching commit, so a repair commit that skipped the
+#                    queue would still leave c05f05a under the guard.
+#   5. record        the Q156 record is in WORK-QUEUE.md and the Q156/Q85 pin
+#                    comment is in open_set.py -- drop either and this reds
+#                    instead of leaving a silent record.
+#   6. lint          check_lint.py --check "bash CHECK-q156" -- SOUND, so the
+#                    line a runner extracts is the one this file runs.
+#
+#   rc 0 every leg holds   rc 1 a leg failed   rc 2 could not grade
+set -u
+ROOT="$(git -C "$(dirname "$0")" rev-parse --show-toplevel 2>/dev/null)" || exit 2
+[ -n "$ROOT" ] || exit 2
+cd "$ROOT" || exit 2
+
+QUEUE=WORK-QUEUE.md
+INDEX=docs/queue-index.md
+PINS=wizard-work/volt/q137-open-set/open_set.py
+for f in "$QUEUE" "$INDEX" "$PINS" tools/verify.py; do
+  [ -f "$f" ] || { echo "CANNOT GRADE: $f is missing"; exit 2; }
+done
+
+legs=0
+faults=0
+leg() { # leg <name> <rc> <detail>
+  legs=$((legs + 1))
+  if [ "$2" -eq 0 ]; then printf 'PASS %-12s %s\n' "$1" "$3"
+  else printf 'FAIL %-12s %s\n' "$1" "$3"; faults=$((faults + 1)); fi
+}
+
+out="$(python3 tools/verify.py --fast 2>&1)"; rc=$?
+leg gate "$rc" "$(printf '%s' "$out" | grep -m1 -E '^(gate|verify):' | tr -d '\n')"
+
+out="$(python3 wizard-work/volt/q137-open-set/open_set.py --repo . --check 2>&1)"; rc=$?
+leg open-set "$rc" "$(printf '%s' "$out" | grep -m1 '^CHECK ')"
+
+out="$(python3 tools/queue_index.py --check "$INDEX" 2>&1)"; rc=$?
+leg index "$rc" "$(printf '%s' "$out" | grep -m1 '^index current' )"
+
+out="$(python3 tools/queue_append_audit.py --guard --to HEAD 2>&1)"; rc=$?
+leg append-guard "$rc" "$(printf '%s' "$out" | grep -m1 '^verdict')"
+
+grep -q '^## Q156 closure' "$QUEUE" && grep -q '^# Q85 (2026-11-02)' "$PINS" \
+  && grep -q '^# Q156 (2026-11-02)' "$PINS"
+leg record "$?" "$(grep -c '^## Q156 closure' "$QUEUE") Q156 heading(s) in $QUEUE"
+
+out="$(python3 tools/check_lint.py --check "bash CHECK-q156" 2>&1)"; rc=$?
+leg lint "$rc" "$(printf '%s' "$out" | grep -m1 -E 'SOUND|FAULT' | cut -c1-60)"
+
+if [ "$faults" -eq 0 ]; then
+  echo "q156: $legs leg(s), all passed"
+  exit 0
+fi
+echo "q156: $legs leg(s), $faults fault(s)"
+exit 1

CHECK-q157

@@ -0,0 +1,89 @@
+#!/usr/bin/env bash
+# CHECK-q157 -- the 2026-11-02 untracked-file triage artifact grades its own
+# pinned universe, and can still go red.
+#
+# Regression guard for the Q157 repair. Six legs; exit 0 iff all pass, 1 if any
+# leg faults, 2 if the leg could not run at all.
+#
+# Measured at the commit that lands Q157. The point of legs 3 and 4 is the pair:
+# the SAME checker must read 0 when the live untracked set moves (the defect
+# this item repaired) and 1 when the pinned artifact itself is wrong (so the
+# repair did not simply turn the verdict off).
+set -u
+
+REPO_ROOT="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)" || exit 2
+cd "$REPO_ROOT" || exit 2
+
+ENTRY="CHECK-2026-11-02-untracked-classify"
+VERIFY="wizard-work/sol/verify_untracked_classify_2026_11_02.py"
+MAN="wizard-work/sol/untracked-classify-2026-11-02.tsv"
+SCRATCH="$(mktemp -d "${TMPDIR:-/tmp}/check-q157.XXXXXX")" || exit 2
+PROBE="zz-q157-drift-probe.txt"
+LEGS=0
+FAULTS=0
+
+cleanup() { rm -f "$PROBE"; rm -rf "$SCRATCH"; }
+trap cleanup EXIT
+
+leg() {  # leg <name> <expected-rc> <actual-rc> [note]
+    LEGS=$((LEGS + 1))
+    if [ "$2" = "$3" ]; then
+        printf '  %-16s PASS  rc=%s %s\n' "$1" "$3" "${4:-}"
+    else
+        printf '  %-16s FAIL  expected rc=%s got rc=%s %s\n' "$1" "$2" "$3" "${4:-}"
+        FAULTS=$((FAULTS + 1))
+    fi
+}
+
+for f in "$ENTRY" "$VERIFY" "$MAN"; do
+    [ -e "$f" ] || { echo "CANNOT GRADE: missing $f"; exit 2; }
+done
+
+# 1. the selftest: 9 cells, 0 failed -- the proof the verdict is falsifiable.
+out="$(python3 "$VERIFY" --selftest 2>&1)"; rc=$?
+echo "$out" | tail -1
+leg selftest 0 "$rc" "$(echo "$out" | grep -c '^FAIL' ) failed cell(s)"
+
+# 2. the live grade at the pinned universe.
+out="$(bash "$ENTRY" 2>&1)"; rc=$?
+echo "$out" | grep -E '^(CHECK OK|VERDICT)' | head -1
+leg live-grade 0 "$rc"
+
+# 3. drift tolerance: a new untracked file must NOT redden the census, and the
+#    drift must be reported rather than silently swallowed.
+echo "q157 drift probe" > "$PROBE"
+out="$(bash "$ENTRY" 2>&1)"; rc=$?
+echo "$PROBE" | grep -q . && echo "$out" | grep -q 'ADVISORY' && adv=1 || adv=0
+rm -f "$PROBE"
+leg drift-tolerant 0 "$rc" "advisory_printed=$adv"
+[ "$adv" = 1 ] || { echo "  drift-tolerant     FAIL  no ADVISORY line"; FAULTS=$((FAULTS + 1)); }
+
+# 4. falsifiable from outside: a corrupted category in a manifest copy is rc 1.
+cp "$MAN" "$SCRATCH/bad.tsv"
+python3 - "$SCRATCH/bad.tsv" <<'PY'
+import sys
+p = sys.argv[1]
+lines = open(p).read().splitlines()
+head, rows = lines[0], lines[1:]
+path, cat = rows[5].split("\t")
+rows[5] = "%s\t%s" % (path, "data" if cat != "data" else "other")
+open(p, "w").write("\n".join([head] + rows) + "\n")
+PY
+python3 "$VERIFY" --manifest "$SCRATCH/bad.tsv" --quiet-drift >"$SCRATCH/bad.out" 2>&1; rc=$?
+head -1 "$SCRATCH/bad.out"
+leg tampered-manifest 1 "$rc"
+
+# 5. a missing artifact is a refusal (rc 2), not a silent pass.
+python3 "$VERIFY" --manifest "$SCRATCH/absent.tsv" --quiet-drift >"$SCRATCH/absent.out" 2>&1; rc=$?
+leg missing-artifact 2 "$rc" "$(head -1 "$SCRATCH/absent.out")"
+
+# 6. the verifier names no absolute host path (it derived REPO from __file__).
+n="$(grep -c '/root/' "$VERIFY")"
+leg no-host-path 0 "$n" "hits=$n"
+
+if [ "$FAULTS" -eq 0 ]; then
+    echo "q157: $LEGS leg(s), all passed"
+    exit 0
+fi
+echo "q157: $LEGS leg(s), $FAULTS fault(s)"
+exit 1

CHECK-q158

@@ -0,0 +1,148 @@
+#!/usr/bin/env bash
+# CHECK-q158 -- tools/check_lint.py can see a leading label, and its forge
+# consumer stopped pinning a cell count (volt, 2026-11-02).
+#
+# The defect: a CHECK written `CHECK: selftest: python3 v.py` -- a label word,
+# a colon, then the command -- was graded SOUND by this rubric while bash exits
+# 127 on it (`selftest:: command not found`) before running anything. Measured
+# on this lane's own ralph iteration, 2026-11-02, and on the runner's
+# 2026-10-27 forge log (`line: python3 ...`), which lost an iteration to it.
+# The fix added the eighth class, LABEL_PREFIX. The repair that followed is the
+# second half: wizard-work/forge/verify_check_lint_classes_dry.py asserted
+# `selftest: 37 cells` and byte-identity of the two selftest outputs, so every
+# cell check_lint gained reddened a verifier about a refactor nobody touched.
+#
+# Legs:
+#   rubric      the selftest is green at the count the docstring claims, and the
+#               baseline pin agrees with both
+#   label       the two real shapes grade LABEL_PREFIX, `--fail-on-fault` exits
+#               1 on them, and the cut point is printed
+#   control     the three boundary shapes (colon not in the first word, colon in
+#               an assignment, quoted first token) stay SOUND, so the rule is
+#               anchored rather than "any colon anywhere"
+#   mutant      a copy whose label rule cannot match reds its own selftest with
+#               six cells failing -- the new cells are load-bearing
+#   consumer    the forge verifier exits 0, reports 11/11, and its parity leg
+#               prints a positive added-cell count instead of pinning 37
+#   record      this item's queue record is present and names the class
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+TOOL="$ROOT/tools/check_lint.py"
+FORGE="$ROOT/wizard-work/forge/verify_check_lint_classes_dry.py"
+BASELINE="$ROOT/tools/selftest_baseline.tsv"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q158.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+ungradable=0
+row() { printf '  %-10s %s\n' "$1" "$2"; }
+fault() { row "$1" "FAULT $2"; failed=$((failed + 1)); }
+
+# --- leg 1: the rubric, its docstring claim, and the pinned count -------------
+python3 "$TOOL" --selftest >"$WORK/self.out" 2>&1
+self_rc=$?
+cells="$(sed -n 's/^selftest: \([0-9][0-9]*\) cells,.*/\1/p' "$WORK/self.out" | head -1)"
+grep -q "^selftest: [0-9][0-9]* cells, [0-9][0-9]* passed, 0 failed$" "$WORK/self.out"
+shape_rc=$?
+doc_claim="$(grep -c "^  python3 check_lint.py --selftest .* # ${cells} cells" "$TOOL" 2>/dev/null)"
+pin="$(awk -F'\t' '$1 == "check_lint.py" {print $2; exit}' "$BASELINE" 2>/dev/null)"
+if [ "$self_rc" -eq 0 ] && [ "$shape_rc" -eq 0 ] && [ -n "$cells" ] \
+   && [ "$doc_claim" = "1" ] && [ "$pin" = "$cells" ]; then
+    row rubric "PASS  $(tail -n 1 "$WORK/self.out"); docstring claim and baseline pin both $cells"
+    passed=$((passed + 1))
+elif [ -z "$cells" ] || [ -z "$pin" ]; then
+    row rubric "UNGRADABLE no count parsed (cells='$cells' pin='$pin')"
+    cat "$WORK/self.out"
+    ungradable=$((ungradable + 1))
+else
+    fault rubric "rc=$self_rc shape_rc=$shape_rc doc_claim=$doc_claim pin=$pin cells=$cells"
+    cat "$WORK/self.out"
+fi
+
+# --- leg 2: the two measured shapes are named, rejected, and cut -------------
+python3 "$TOOL" --check "selftest: python3 tools/check_lint.py --selftest" \
+    >"$WORK/l1.out" 2>&1
+l1=$?
+python3 "$TOOL" --check "line: python3 tools/check_lint.py --selftest" \
+    >"$WORK/l2.out" 2>&1
+l2=$?
+python3 "$TOOL" --check "selftest: python3 x.py" --fail-on-fault >/dev/null 2>&1
+l3=$?
+if [ "$l1" -eq 0 ] && [ "$l2" -eq 0 ] \
+   && grep -q '^LABEL_PREFIX:' "$WORK/l1.out" \
+   && grep -q '^LABEL_PREFIX:' "$WORK/l2.out" \
+   && grep -q '"command_after_label": "python3 tools/check_lint.py --selftest"' "$WORK/l1.out" \
+   && [ "$l3" -eq 1 ]; then
+    row label "PASS  selftest:/line: -> LABEL_PREFIX, cut point printed, --fail-on-fault rc 1"
+    passed=$((passed + 1))
+else
+    fault label "rc($l1,$l2,$l3) want (0,0,1) with a LABEL_PREFIX verdict and a cut point"
+    head -3 "$WORK/l1.out" "$WORK/l2.out"
+fi
+
+# --- leg 3: the boundary stays SOUND -----------------------------------------
+bad=0
+for c in "python3 x.py: --selftest" "PATH=/a:/b python3 x.py" "'note: x' cmd"; do
+    python3 "$TOOL" --check "$c" --fail-on-fault >"$WORK/c.out" 2>&1 || bad=$((bad + 1))
+done
+if [ "$bad" -eq 0 ]; then
+    row control "PASS  three boundary shapes stay SOUND under --fail-on-fault"
+    passed=$((passed + 1))
+else
+    fault control "$bad of 3 boundary shapes were graded a fault"
+    cat "$WORK/c.out"
+fi
+
+# --- leg 4: the label cells are load-bearing ---------------------------------
+mkdir -p "$WORK/mut/tools"
+cp "$TOOL" "$WORK/mut/tools/check_lint.py"
+sed -i 's|^LABEL_RE = re.compile(.*)$|LABEL_RE = re.compile(r"^(?P<label>[A-Z][A-Z0-9_]*)")|' \
+    "$WORK/mut/tools/check_lint.py"
+python3 "$WORK/mut/tools/check_lint.py" --selftest >"$WORK/mut.out" 2>&1
+mut_rc=$?
+if [ "$mut_rc" -eq 1 ] && grep -q '^selftest: [0-9][0-9]* cells, [0-9][0-9]* passed, 6 failed$' "$WORK/mut.out"; then
+    row mutant "PASS  a label rule that cannot match reds its own selftest: $(tail -n 1 "$WORK/mut.out")"
+    passed=$((passed + 1))
+else
+    fault mutant "rc=$mut_rc (want 1 with 6 failed)"
+    tail -4 "$WORK/mut.out"
+fi
+
+# --- leg 5: the consumer no longer pins a count ------------------------------
+python3 "$FORGE" >"$WORK/forge.out" 2>&1
+forge_rc=$?
+added="$(sed -n 's/.*pair(s) all survive (\([0-9][0-9]*\) cell(s) added).*/\1/p' "$WORK/forge.out" | head -1)"
+if [ "$forge_rc" -eq 0 ] && grep -q '^verify: 11 checks, 11 passed, 0 failed$' "$WORK/forge.out" \
+   && [ -n "$added" ] && [ "$added" -gt 0 ]; then
+    row consumer "PASS  forge verifier 11/11 rc 0, parity leg reports $added added cell(s), no pinned count"
+    passed=$((passed + 1))
+else
+    fault consumer "rc=$forge_rc added='$added'"
+    tail -4 "$WORK/forge.out"
+fi
+
+# --- leg 6: the record ------------------------------------------------------
+# The block, not a fixed window: the class is named nine lines into the record,
+# and an -A window made this leg red on a correct append.
+q="$ROOT/WORK-QUEUE.md"
+awk '/^## Q158 closure/{f=1; next} f && /^## /{f=0} f' "$q" >"$WORK/q158.md"
+q_lines="$(wc -l <"$WORK/q158.md" | tr -d ' ')"
+if grep -q '^## Q158 closure' "$q" && [ "${q_lines:-0}" -gt 0 ] \
+   && grep -q 'LABEL_PREFIX' "$WORK/q158.md"; then
+    row record "PASS  WORK-QUEUE.md carries the Q158 closure ($q_lines lines) and names LABEL_PREFIX"
+    passed=$((passed + 1))
+else
+    fault record "the Q158 closure is missing from WORK-QUEUE.md, empty, or does not name the class (lines=$q_lines)"
+fi
+
+echo
+echo "CHECK-q158: $passed leg(s) passed, $failed fault(s), $ungradable ungradable"
+[ "$failed" -eq 0 ] || exit 1
+[ "$ungradable" -eq 0 ] || exit 2
+exit 0

CHECK-q159

@@ -0,0 +1,181 @@
+#!/usr/bin/env bash
+# CHECK-q159 -- the sweep's path census is complete, and the one red entry point
+# it found was repaired rather than signed away (volt, 2026-11-02; the census and
+# register legs were re-scoped 2026-11-03 by Q167, see the header of each).
+#
+# What this guards:
+#   1. census     the path census names NO fault for any of the 21 paths this
+#                 item signed, and does not name CHECK-q159 itself as missing or
+#                 unreviewed. Faults on other lanes' new entry points are printed
+#                 as context and NOT graded here: that repo-wide tooth is
+#                 CHECK-q143's, and a leg that reds when a neighbour signs a row
+#                 cannot be re-run, which is why this one was red on arrival.
+#   2. coverage   the beam lane's coverage tool reads 0 faults -- the leg that was
+#                 red because tarjan_scc.py had no collected cell.
+#   3. cells      test_tarjan_scc.py is collected and its 8 cells pass.
+#   4. mutant     the same 8 cells FAIL against a copy of tarjan_scc.py with the
+#                 parent lowlink propagation dropped. A cell that cannot red is
+#                 not evidence; this leg is why the test is worth its name.
+#   5. register   the Q159 block in check_entry_baseline.tsv reads as 21 rows, of
+#                 which exactly 2 carry a non-zero code and both are the KNOWN RED
+#                 rows this tick signed. The block has a boundary now: the awk
+#                 this replaced counted from its marker to EOF and read 27, so it
+#                 graded six later sections of other lanes' rows.
+#   6. scope      block_rows.py's own selftest passes, including the cell that
+#                 shows a marker-to-EOF reading of the same fixture disagrees with
+#                 the block reading -- so the boundary is a measured difference and
+#                 not a claim in a comment. No cell count is pinned: a fixture
+#                 added later must not redden this leg (the Q158 defect).
+#
+# Exit codes (tools/ contract): 0 every leg passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+SWEEP="$ROOT/wizard-work/volt/q143-check-sweep/check_sweep.py"
+BLOCK="$ROOT/wizard-work/volt/q143-check-sweep/block_rows.py"
+BASE="$ROOT/wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv"
+MARK='rows added by hand (Q159'
+BEAM="$ROOT/wizard-work/beam"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q159.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+pass=0
+fail=0
+ung=0
+row() { printf '  %-12s %s\n' "$1" "$2"; }
+
+for f in "$SWEEP" "$BLOCK" "$BASE" "$BEAM/tarjan_scc.py" \
+         "$BEAM/test_tarjan_scc.py" "$BEAM/check_coverage.py"; do
+    if [ ! -f "$f" ]; then
+        echo "CHECK-q159: no $f -- cannot grade" >&2
+        exit 2
+    fi
+done
+
+# The 21 paths this item signed, read through the block boundary.
+if ! python3 "$BLOCK" --file "$BASE" --marker "$MARK" --paths \
+        | LC_ALL=C sort >"$WORK/block.paths"; then
+    echo "CHECK-q159: cannot read the Q159 block -- cannot grade" >&2
+    exit 2
+fi
+nblock="$(wc -l <"$WORK/block.paths" | tr -d ' ')"
+
+# --- 1: the path census, scoped to this item's own rows -----------------------
+python3 "$SWEEP" --repo "$ROOT" --paths >"$WORK/paths.out" 2>&1
+p=$?
+total="$(tail -n 1 "$WORK/paths.out")"
+awk '/^FAIL:/ { print $3 }' "$WORK/paths.out" | LC_ALL=C sort -u >"$WORK/fault.paths"
+own="$(LC_ALL=C comm -12 "$WORK/fault.paths" "$WORK/block.paths" | tr '\n' ' ')"
+foreign="$(LC_ALL=C comm -23 "$WORK/fault.paths" "$WORK/block.paths" | tr '\n' ' ')"
+selfault="$(awk '$1 == "FAIL:" && $3 == "CHECK-q159" { n++ } END { print n + 0 }' \
+    "$WORK/paths.out")"
+if [ "$p" -eq 2 ]; then
+    row census "UNG  the path census could not grade this tree :: $total"
+    ung=$((ung + 1))
+elif [ -n "$own" ] || [ "$selfault" -ne 0 ] || [ "$nblock" -ne 21 ]; then
+    row census "FAULT block=$nblock rows, faulted: ${own:-none}; CHECK-q159 named: $selfault :: $total"
+    fail=$((fail + 1))
+else
+    nforeign="$(printf '%s' "$foreign" | wc -w | tr -d ' ')"
+    row census "PASS  none of the 21 signed paths is faulted :: $total"
+    row context "$nforeign repo-wide fault(s) on other lanes' rows, ungraded here"
+    pass=$((pass + 1))
+fi
+
+# --- 2: the coverage leg the repair was for ----------------------------------
+python3 "$BEAM/check_coverage.py" >"$WORK/cov.out" 2>&1
+p=$?
+if [ "$p" -eq 0 ] && grep -q '^coverage: PASS' "$WORK/cov.out"; then
+    row coverage "PASS  $(grep '^coverage: [0-9]' "$WORK/cov.out" | tail -n 1)"
+    pass=$((pass + 1))
+elif [ "$p" -eq 2 ]; then
+    row coverage "UNG  rc=2 :: $(grep '^coverage' "$WORK/cov.out" | tail -n 1)"
+    ung=$((ung + 1))
+else
+    row coverage "FAULT rc=$p :: $(grep '^coverage' "$WORK/cov.out" | tail -n 1)"
+    fail=$((fail + 1))
+fi
+
+# --- 3: the collected cells --------------------------------------------------
+( cd "$BEAM" && python3 -m unittest test_tarjan_scc >"$WORK/cells.out" 2>&1 )
+p=$?
+if [ "$p" -eq 0 ] && grep -q '^Ran 8 tests' "$WORK/cells.out"; then
+    row cells "PASS  $(grep '^Ran ' "$WORK/cells.out") $(tail -n 1 "$WORK/cells.out")"
+    pass=$((pass + 1))
+elif [ "$p" -eq 2 ]; then
+    row cells "UNG  rc=2 (the suite could not be collected)"
+    ung=$((ung + 1))
+else
+    row cells "FAULT rc=$p (want 0, 8 cells)"
+    tail -n 5 "$WORK/cells.out"
+    fail=$((fail + 1))
+fi
+
+# --- 4: sensitivity, on a mutated copy ---------------------------------------
+mkdir -p "$WORK/mut" && cp "$BEAM/tarjan_scc.py" "$BEAM/test_tarjan_scc.py" "$WORK/mut/" || exit 2
+before="$(grep -c 'if lowlink\[u\] < lowlink\[parent\]:' "$WORK/mut/tarjan_scc.py")"
+if [ "$before" -ne 1 ]; then
+    row mutant "FAULT mutation site matched $before line(s), want 1"
+    fail=$((fail + 1))
+else
+    sed -i 's/if lowlink\[u\] < lowlink\[parent\]:/if False and lowlink[u] < lowlink[parent]:/' \
+        "$WORK/mut/tarjan_scc.py"
+    ( cd "$WORK/mut" && python3 -m unittest test_tarjan_scc >"$WORK/mut.out" 2>&1 )
+    p=$?
+    if [ "$p" -eq 1 ] && grep -q '^FAILED (failures=' "$WORK/mut.out"; then
+        row mutant "PASS  rc=1, $(tail -n 1 "$WORK/mut.out") on the dropped-lowlink copy"
+        pass=$((pass + 1))
+    elif [ "$p" -eq 2 ]; then
+        row mutant "UNG  rc=2 (the mutated copy did not run)"
+        ung=$((ung + 1))
+    else
+        row mutant "FAULT rc=$p (want 1) -- the cells did not notice the mutation"
+        tail -n 5 "$WORK/mut.out"
+        fail=$((fail + 1))
+    fi
+fi
+
+# --- 5: the signed register, read through the block boundary ------------------
+summary="$(python3 "$BLOCK" --file "$BASE" --marker "$MARK" 2>"$WORK/reg.err")"
+p=$?
+if [ "$p" -ne 0 ]; then
+    row register "FAULT rc=$p reading the block: $(tail -n 1 "$WORK/reg.err")"
+    fail=$((fail + 1))
+else
+    names="$(python3 "$BLOCK" --file "$BASE" --marker "$MARK" --red \
+        | LC_ALL=C sort | tr '\n' ' ')"
+    want="CHECK-sol-profile-triage-2026-11-02 wizard-work/ledger/CHECK-wizardwork-census "
+    if [ "$summary" = "rows=21 red=2" ] && [ "$names" = "$want" ]; then
+        row register "PASS  21 rows, 2 known red: $names"
+        pass=$((pass + 1))
+    else
+        row register "FAULT $summary, red names: ${names:-none}"
+        fail=$((fail + 1))
+    fi
+fi
+
+# --- 6: the boundary's own selftest ------------------------------------------
+python3 "$BLOCK" --selftest >"$WORK/scope.out" 2>&1
+p=$?
+if [ "$p" -eq 0 ] \
+   && grep -qE 'selftest: [1-9][0-9]* cell\(s\), 0 failed, 0 skipped' "$WORK/scope.out"; then
+    row scope "PASS  $(tail -n 1 "$WORK/scope.out")"
+    pass=$((pass + 1))
+else
+    row scope "FAULT rc=$p (want 0) on the block reader's selftest"
+    tail -n 8 "$WORK/scope.out"
+    fail=$((fail + 1))
+fi
+
+echo
+if [ "$ung" -gt 0 ]; then
+    echo "q159: $pass passed, $fail fault(s), $ung ungradable"
+    exit 2
+elif [ "$fail" -gt 0 ]; then
+    echo "q159: $pass passed, $fail fault(s)"
+    exit 1
+fi
+echo "q159: 6 leg(s), all passed"
+exit 0

CHECK-q160

@@ -0,0 +1,84 @@
+#!/usr/bin/env bash
+# CHECK-q160 -- a committed test grades the module beside it, not a host copy
+# (volt, 2026-11-03).
+#
+# The defect: `wizard-work/beam/test_tarjan_articulation.py` landed at bb8aec7
+# with `sys.path.insert(0, '/root/.hermes/wizard-outputs/beam')`. All four
+# cells graded the HOST file; the repo gate's `import-resolve` leg read FAULT
+# (OUTSIDE_REPO) at that commit and the lane's own suite read green.
+#
+# Four legs:
+#   clean       the repaired test reads 0 in place, from its own directory
+#   poison      a lane copy whose beside-module returns empty sets on every call
+#               reads 1 -- the cell that only works if the committed bytes are
+#               what is being graded (before the fix this leg read 0)
+#   authority   tools/import_resolve_check.py grades the WORKTREE at 0 faults
+#   regression  the same authority at bb8aec7 -- the commit that landed the
+#               defect -- still reads 1 and names the file, so this guard is
+#               green because the tree is repaired, not because the checker
+#               stopped seeing the shape
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/beam"
+TEST="$LANE/test_tarjan_articulation.py"
+POISON="$ROOT/wizard-work/volt/q160-import-binding/poison_tarjan.py"
+AUTH="$ROOT/tools/import_resolve_check.py"
+PY="${PYTHON:-python3}"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q160.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+for f in "$TEST" "$POISON" "$AUTH" "$LANE/tarjan_articulation.py"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+# Two legs grade a REVISION (the authority in worktree mode and at bb8aec7), so
+# a .git-less export cannot answer them. That is rc 2 -- "could not grade" --
+# not a fault, which is the repo's tools/ contract.
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+
+passed=0
+failed=0
+row() { printf '  %-11s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the repaired test, in place --------------------------------------
+out="$(cd "$LANE" && "$PY" test_tarjan_articulation.py 2>&1)"; lrc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict clean "$lrc" "rc=$lrc  ${last:-<no output>}"
+
+# --- leg 2: the poisoned lane copy -------------------------------------------
+cp -a "$LANE" "$WORK/beam" >/dev/null 2>&1 || { printf 'CANNOT GRADE: copy failed\n'; exit 2; }
+cp "$POISON" "$WORK/beam/tarjan_articulation.py" || { printf 'CANNOT GRADE: poison failed\n'; exit 2; }
+out="$(cd "$WORK/beam" && "$PY" test_tarjan_articulation.py 2>&1)"; prc=$?
+last="$(printf '%s' "$out" | grep -E 'AssertionError|Error' | tail -1)"
+verdict poison "$([ "$prc" -eq 1 ] && echo 0 || echo 1)" \
+    "rc=$prc (want 1)  ${last:-<no error line>}"
+
+# --- leg 3: the authority on the worktree ------------------------------------
+out="$("$PY" "$AUTH" --repo "$ROOT" 2>&1)"; arc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict authority "$arc" "rc=$arc  $last"
+
+# --- leg 4: the authority at the commit that landed the defect --------------
+out="$("$PY" "$AUTH" --repo "$ROOT" --rev bb8aec7 2>&1)"; rrc=$?
+last="$(printf '%s' "$out" | grep -E '^(FAULT|FAIL)' | tail -1)"
+verdict regression "$([ "$rrc" -eq 1 ] && echo 0 || echo 1)" \
+    "rc=$rrc (want 1)  ${last:-<no fault line>}"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q160: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q160: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q161

@@ -0,0 +1,105 @@
+#!/usr/bin/env bash
+# CHECK-q161 -- the jobs-table entry point ran under an interpreter nobody
+# invokes, and read a host root as if it were the repository (volt, 2026-11-03).
+#
+# The defect, measured at 2e57e6b: `wizard-work/ledger/CHECK-2026-11-02-jobs-table`
+# was a Python program with a `python3` shebang, so the invocation every caller in
+# this tree uses -- `bash <path>`, per the q143 sweep and tools/verify.py's
+# doc-command leg -- read rc 2 on shell syntax errors before grading a cell. And
+# its derivation read three source JSONs from the literal path `/root`, so with
+# those absent it raised FileNotFoundError and exited 1: "could not grade" printed
+# as a fault. The grader moved beside it (grade_jobs_table.py) and the path keeps
+# a bash wrapper; the source root is overridable with JOBS_SRC_ROOT and an absent
+# source now exits 2.
+#
+# Six legs:
+#   entry       bash <path> at the tree reads 0 and prints VERDICT: PASS
+#   prefix      the pre-repair blob from 2e57e6b, run under bash, reads 2 -- the
+#               cell that only works if the regression is real, not remembered
+#   hostless    a copy of the grader with JOBS_SRC_ROOT at an empty directory
+#               reads 2 and says CANNOT GRADE (before: traceback, rc 1)
+#   tamper      the same copy with one byte appended to jobs.csv reads 1
+#   offline     `--offline` at the tree reads 0 and states re-derivation was
+#               not attempted, so the weaker reading is never silent
+#   sweep       the q143 path census grades this entry point at 0
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LEDGER="$ROOT/wizard-work/ledger"
+ENTRY="$LEDGER/CHECK-2026-11-02-jobs-table"
+GRADER="$LEDGER/grade_jobs_table.py"
+SWEEP="$ROOT/wizard-work/volt/q143-check-sweep/check_sweep.py"
+PY="${PYTHON:-python3}"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q161.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+for f in "$ENTRY" "$GRADER" "$LEDGER/manifest.json" "$LEDGER/jobs.csv" "$SWEEP"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+# The prefix leg grades a REVISION, so a .git-less export cannot answer it.
+# That is rc 2 -- "could not grade" -- not a fault, per the repo's tools/ contract.
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+
+passed=0
+failed=0
+row() { printf '  %-11s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the entry point as every caller invokes it ----------------------
+out="$(bash "$ENTRY" 2>&1)"; erc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict entry "$([ "$erc" -eq 0 ] && printf '%s' "$last" | grep -q '^VERDICT: PASS' && echo 0 || echo 1)" \
+    "rc=$erc  ${last:-<no output>}"
+
+# --- leg 2: the pre-repair blob, same invocation ----------------------------
+git -C "$ROOT" show 2e57e6b:wizard-work/ledger/CHECK-2026-11-02-jobs-table \
+    > "$WORK/pre_check" 2>/dev/null || { printf 'CANNOT GRADE: 2e57e6b blob unreadable\n'; exit 2; }
+out="$(bash "$WORK/pre_check" 2>&1)"; prc=$?
+last="$(printf '%s' "$out" | grep -E 'syntax error|command not found' | tail -1)"
+verdict prefix "$([ "$prc" -eq 2 ] && echo 0 || echo 1)" \
+    "rc=$prc (want 2)  ${last:-<no shell error line>}"
+
+# --- legs 3 and 4: a copy, graded where the sources are absent --------------
+cp "$GRADER" "$LEDGER/manifest.json" "$LEDGER/jobs.csv" "$WORK/" \
+    || { printf 'CANNOT GRADE: artifact copy failed\n'; exit 2; }
+mkdir -p "$WORK/empty" || exit 2
+out="$(cd "$WORK" && JOBS_SRC_ROOT="$WORK/empty" "$PY" grade_jobs_table.py 2>&1)"; hrc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict hostless "$([ "$hrc" -eq 2 ] && printf '%s' "$last" | grep -q '^CANNOT GRADE' && echo 0 || echo 1)" \
+    "rc=$hrc (want 2)  ${last:-<no output>}"
+
+printf 'x' >> "$WORK/jobs.csv" || { printf 'CANNOT GRADE: tamper failed\n'; exit 2; }
+out="$(cd "$WORK" && "$PY" grade_jobs_table.py --offline 2>&1)"; trc=$?
+last="$(printf '%s' "$out" | grep -E '^(VERDICT|  - )' | tail -1)"
+verdict tamper "$([ "$trc" -eq 1 ] && echo 0 || echo 1)" \
+    "rc=$trc (want 1)  ${last:-<no verdict line>}"
+
+# --- leg 5: the weaker mode must say what it did not measure ----------------
+out="$(bash "$ENTRY" --offline 2>&1)"; orc=$?
+last="$(printf '%s' "$out" | grep 're_derivation' | tail -1)"
+verdict offline "$([ "$orc" -eq 0 ] && printf '%s' "$last" | grep -q 'NOT ATTEMPTED' && echo 0 || echo 1)" \
+    "rc=$orc  ${last:-<no re_derivation line>}"
+
+# --- leg 6: the census of entry points grades this path ---------------------
+out="$("$PY" "$SWEEP" --repo "$ROOT" --only wizard-work/ledger/CHECK-2026-11-02-jobs-table --check 2>&1)"; src=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict sweep "$([ "$src" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$src  $last"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q161: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q161: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q162

@@ -0,0 +1,84 @@
+#!/usr/bin/env bash
+# CHECK-q162 -- a committed test grades the module beside it, not a host copy
+# (volt, 2026-11-03).
+#
+# The defect: `wizard-work/beam/test_interval.py` landed at 33e8ffb with
+# `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")`. Every cell graded
+# the HOST file; the repo gate's `import-resolve` leg read FAULT (OUTSIDE_REPO)
+# at HEAD bcaede7 while the lane's own suite read green.
+#
+# Four legs:
+#   clean       the repaired test reads 0 in place, from its own directory
+#   poison      a lane copy whose beside-module answers wrongly on every call
+#               reads 1 -- the cell that only works if the committed bytes are
+#               what is being graded (before the fix this leg read 0)
+#   authority   tools/import_resolve_check.py grades the WORKTREE at 0 faults
+#   regression  the same authority at 33e8ffb -- the commit that landed the
+#               defect -- still reads 1 and names the file, so this guard is
+#               green because the tree is repaired, not because the checker
+#               stopped seeing the shape
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/beam"
+TEST="$LANE/test_interval.py"
+POISON="$ROOT/wizard-work/volt/q162-interval-binding/poison_interval.py"
+AUTH="$ROOT/tools/import_resolve_check.py"
+PY="${PYTHON:-python3}"
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q162.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+for f in "$TEST" "$POISON" "$AUTH" "$LANE/interval_merge.py"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+# Two legs grade a REVISION (the authority at 33e8ffb and worktree mode), so a
+# .git-less export cannot answer them. That is rc 2 -- "could not grade" -- not
+# a fault, which is the repo's tools/ contract.
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+
+passed=0
+failed=0
+row() { printf '  %-11s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the repaired test, in place --------------------------------------
+out="$(cd "$LANE" && "$PY" test_interval.py 2>&1)"; lrc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict clean "$lrc" "rc=$lrc  ${last:-<no output>}"
+
+# --- leg 2: the poisoned lane copy -------------------------------------------
+cp -a "$LANE" "$WORK/beam" >/dev/null 2>&1 || { printf 'CANNOT GRADE: copy failed\n'; exit 2; }
+cp "$POISON" "$WORK/beam/interval_merge.py" || { printf 'CANNOT GRADE: poison failed\n'; exit 2; }
+out="$(cd "$WORK/beam" && "$PY" test_interval.py 2>&1)"; prc=$?
+last="$(printf '%s' "$out" | grep -E 'AssertionError|Error' | tail -1)"
+verdict poison "$([ "$prc" -eq 1 ] && echo 0 || echo 1)" \
+    "rc=$prc (want 1)  ${last:-<no error line>}"
+
+# --- leg 3: the authority on the worktree ------------------------------------
+out="$("$PY" "$AUTH" --repo "$ROOT" 2>&1)"; arc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict authority "$arc" "rc=$arc  $last"
+
+# --- leg 4: the authority at the commit that landed the defect --------------
+out="$("$PY" "$AUTH" --repo "$ROOT" --rev 33e8ffb 2>&1)"; rrc=$?
+last="$(printf '%s' "$out" | grep -E '^(FAULT|FAIL)' | tail -1)"
+verdict regression "$([ "$rrc" -eq 1 ] && echo 0 || echo 1)" \
+    "rc=$rrc (want 1)  ${last:-<no fault line>}"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q162: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q162: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q163

@@ -0,0 +1,105 @@
+#!/usr/bin/env bash
+# CHECK-q163 -- a tracked smoke script asserted against a module it bound by
+# host path, and the class guard could not see it because of its filename
+# (volt, 2026-11-03).
+#
+# The defect: `wizard-work/beam/_smoke_intervals.py` landed with
+# `sys.path.insert(0, "/root/troupe-standup/wizard-work/beam")`, so its three
+# cells graded the host copy of `intervals.py`. `tools/import_resolve_check.py`
+# classes a file by NAME; this one is not `test_*`, `_test_*` or `*_test`, so
+# its binding sat in the ADVISORY count and was never graded -- the only one of
+# the 23 advisory files that ran a single assert.
+#
+# Six legs:
+#   clean       the repaired script reads 0 in place, from its own directory
+#   prefix      the pre-repair blob at f0b3a64, in a scratch lane whose
+#               `intervals.py` answers wrongly on every call, reads 0 -- green
+#               against a module nobody committed (the cell that separates the
+#               two trees; before the fix this is what the file did)
+#   poison      the repaired script in the same poisoned lane reads 1, so the
+#               green above was the binding and not the cells
+#   authority   tools/import_resolve_check.py grades the WORKTREE at 0 faults
+#   regression  the same authority at f0b3a64 -- the commit that carried the
+#               defect -- reads 1 and names the file, so the guard is green
+#               because the tree is repaired, not because it stopped looking
+#   selftest    the guard's own fixture corpus, rc 0
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/beam"
+SMOKE="$LANE/_smoke_intervals.py"
+POISON="$ROOT/wizard-work/volt/q163-smoke-binding/poison_intervals.py"
+MEASURE="$ROOT/wizard-work/volt/q163-smoke-binding/measure_poison.py"
+AUTH="$ROOT/tools/import_resolve_check.py"
+DEFECT_REV="f0b3a64"
+PY="${PYTHON:-python3}"
+
+for f in "$SMOKE" "$POISON" "$MEASURE" "$AUTH" "$LANE/intervals.py"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+# Two legs grade a revision, so a .git-less export cannot answer them: rc 2 is
+# "could not grade", not a fault, per the repo's tools/ contract.
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+if ! git -C "$ROOT" cat-file -e "$DEFECT_REV:wizard-work/beam/_smoke_intervals.py" 2>/dev/null; then
+    printf 'CANNOT GRADE: %s lacks the smoke script\n' "$DEFECT_REV"
+    exit 2
+fi
+
+passed=0
+failed=0
+row() { printf '  %-11s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the repaired script, in place -----------------------------------
+out="$(cd "$LANE" && "$PY" _smoke_intervals.py 2>&1)"; lrc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict clean "$([ "$lrc" -eq 0 ] && printf '%s' "$last" | grep -q 'intervals smoke OK' && echo 0 || echo 1)" \
+    "rc=$lrc  ${last:-<no output>}"
+
+# --- leg 2: the pre-repair blob against a poisoned neighbour -----------------
+out="$("$PY" "$MEASURE" "$SMOKE" "$DEFECT_REV:wizard-work/beam/_smoke_intervals.py" 2>&1)"; prc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict prefix "$([ "$prc" -eq 0 ] && echo 0 || echo 1)" \
+    "measure rc=$prc (want 0)  ${last:-<no output>}"
+
+# --- leg 3: the repaired script against the same poisoned neighbour ----------
+out="$("$PY" "$MEASURE" "$SMOKE" 2>&1)"; drc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict poison "$([ "$drc" -eq 1 ] && echo 0 || echo 1)" \
+    "measure rc=$drc (want 1)  ${last:-<no output>}"
+
+# --- leg 4: the authority on the worktree ------------------------------------
+out="$("$PY" "$AUTH" --repo "$ROOT" 2>&1)"; arc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict authority "$([ "$arc" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$arc  ${last:-<no output>}"
+
+# --- leg 5: the authority at the commit that carried the defect --------------
+out="$("$PY" "$AUTH" --repo "$ROOT" --rev "$DEFECT_REV" 2>&1)"; rrc=$?
+last="$(printf '%s' "$out" | grep -E '^(FAULT|FAIL)' | head -1)"
+verdict regression "$([ "$rrc" -eq 1 ] && printf '%s' "$last" | grep -q '_smoke_intervals.py' && echo 0 || echo 1)" \
+    "rc=$rrc (want 1)  ${last:-<no fault line>}"
+
+# --- leg 6: the guard's fixture corpus ---------------------------------------
+out="$("$PY" "$AUTH" --selftest 2>&1)"; src=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict selftest "$([ "$src" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$src  ${last:-<no output>}"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q163: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q163: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q164

@@ -0,0 +1,164 @@
+#!/usr/bin/env bash
+# CHECK-q164 -- the beam coverage census grades the tree, not this host's
+# directory, so a scratch file beside the lane cannot move its verdict.
+#
+# The defect (Q164, 2026-11-03): `check_coverage.py` listed the lane with
+# `glob(lane/*.py)`. At `a96da08` the worktree read 125 module(s) / 3 fault(s)
+# and a `git archive HEAD` export of the SAME COMMIT read 124 / 2 -- the
+# difference was `_run_regex.py`, untracked, which no clone of that commit
+# contains. Same class as Q140/Q141 (a census that describes its host).
+#
+# Why the legs below count nothing by hand (Q165, 2026-11-03). `2829ff0` added
+# `binary_search_bounds.py` and committed `_run_regex.py`; this guard's literal
+# `124 module(s)` and its "names _run_regex in a note" expectation then both
+# went red on a census that was reading the tree correctly. The expected module
+# set is now DERIVED (`git ls-files`) and compared row for row, so a lane module
+# added or removed is graded by the comparison rather than by a number someone
+# has to remember to edit into this file.
+#
+# Seven legs:
+#   tree      the census reads rc 0 with 0 faults and its rows name EXACTLY the
+#             tracked lane modules: the set `git ls-files` reports, no more (it
+#             graded a host file) and no fewer (it dropped a tree module)
+#   scratch   a new untracked *.py dropped into the lane does NOT move the
+#             verdict (rc 0), is named in a note, and is ABSENT from the rows
+#   dir       --enumerate dir on the same directory DOES grade it (rc 1), so
+#             the green above is the source of the list, not a lost tooth
+#   export    a `git archive HEAD` export of the same commit reads rc 0 with
+#             the same module count: no clone can disagree with this worktree
+#   runner    the committed hand runner `_run_regex` reads as a stated waiver
+#             naming the collected test it duplicates, not as UNCOVERED
+#   smoke     the lane gate executes Q163's smoke cells (grep the CHECK line,
+#             run it, and read its coverage row as covered-gate)
+#   selftest  the census's own fixture corpus, 17 cells, 0 failed
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+REL="wizard-work/beam"
+LANE="$ROOT/$REL"
+CENSUS="$LANE/check_coverage.py"
+GATE="$LANE/CHECK"
+SMOKE="$LANE/_smoke_intervals.py"
+PROBE="$LANE/zz_q164_scratch_probe.py"
+PY="${PYTHON:-python3}"
+
+for f in "$CENSUS" "$GATE" "$SMOKE"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+# Two legs grade the tree and one grades a revision, so a .git-less export
+# cannot answer them: rc 2 is "could not grade", not a fault.
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q164.XXXXXX")" || exit 2
+trap 'rm -f "$PROBE"; rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+row() { printf '  %-10s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# The expected set: the lane's tracked *.py minus the collected tests. Read
+# from the tree, so neither leg below can rot on a literal count.
+git -C "$ROOT" ls-files -z -- "$REL" \
+    | tr '\0' '\n' \
+    | grep "^$REL/[^/]*\.py\$" \
+    | sed 's#.*/##; s/\.py$//' \
+    | grep -v '^test_' \
+    | sort > "$WORK/want" || exit 2
+want="$(grep -c . "$WORK/want")"
+
+# One module per line: the census's own state rows only (notes and summary
+# lines share the stream), first occurrence per module (--list repeats the
+# non-covered rows when it prints the report), waiver-table rows dropped
+# because they grade the table rather than the lane's module list.
+"$PY" "$CENSUS" --list 2>/dev/null \
+    | awk '$1 ~ /^(covered-|exempt$|UNCOVERED$)/ && !seen[$2]++ {print $2}' \
+    | sort > "$WORK/got"
+
+# --- leg 1: the census reads the tree, and the tree is the truth ------------
+out="$("$PY" "$CENSUS" 2>&1)"; trc=$?
+last="$(printf '%s' "$out" | grep '^coverage: [0-9]' | tail -1)"
+n_last="$(printf '%s' "$last" | sed -n 's/^coverage: \([0-9][0-9]*\) module(s).*/\1/p')"
+extra="$(comm -13 "$WORK/want" "$WORK/got" | tr '\n' ' ')"
+gone="$(comm -23 "$WORK/want" "$WORK/got" | tr '\n' ' ')"
+badrow="$("$PY" "$CENSUS" --list 2>/dev/null | awk '$1 ~ /^(UNCOVERED|WAIVER-)/ {c++} END {print c+0}')"
+verdict tree \
+    "$([ "$trc" -eq 0 ] && printf '%s' "$last" | grep -q ' 0 fault(s)' \
+        && [ "$n_last" = "$want" ] && [ -z "$extra" ] && [ -z "$gone" ] \
+        && [ "$badrow" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$trc  ${last:-<no summary>}  rows=$want  extra=${extra:-none}  missing=${gone:-none}  faultRows=$badrow"
+
+# --- leg 2: a host artifact cannot move the verdict -------------------------
+printf 'print("scratch probe, never committed")\n' > "$PROBE"
+out="$("$PY" "$CENSUS" 2>&1)"; src=$?
+last="$(printf '%s' "$out" | grep '^coverage: [0-9]' | tail -1)"
+note="$(printf '%s' "$out" | grep 'untracked, not graded: zz_q164_scratch_probe' | head -1)"
+inrows="$("$PY" "$CENSUS" --list 2>/dev/null | awk '$2 == "zz_q164_scratch_probe" {c++} END {print c+0}')"
+verdict scratch \
+    "$([ "$src" -eq 0 ] && printf '%s' "$last" | grep -q ' 0 fault(s)' \
+        && [ -n "$note" ] && [ "$inrows" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$src  ${last:-<no summary>}  ${note:-<probe not named>}  probeRows=$inrows"
+
+# --- leg 3: the directory reading still has teeth ---------------------------
+out="$("$PY" "$CENSUS" --enumerate dir 2>&1)"; drc=$?
+faultline="$(printf '%s' "$out" | awk '$1 ~ /^(UNCOVERED|WAIVER-)/' | tr '\n' ';')"
+verdict dir \
+    "$([ "$drc" -eq 1 ] && printf '%s' "$faultline" | grep -q 'zz_q164_scratch_probe' && echo 0 || echo 1)" \
+    "rc=$drc (want 1)  ${faultline:-<no fault row>}"
+rm -f "$PROBE"
+
+# --- leg 4: the same commit, read from a clean export -----------------------
+if git -C "$ROOT" archive HEAD 2>/dev/null | tar -x -C "$WORK" 2>/dev/null; then
+    out="$("$PY" "$WORK/$REL/check_coverage.py" 2>&1)"; erc=$?
+    last="$(printf '%s' "$out" | grep '^coverage: [0-9]' | tail -1)"
+    verdict export \
+        "$([ "$erc" -eq 0 ] && printf '%s' "$last" | grep -q ' 0 fault(s)' \
+            && printf '%s' "$last" | grep -q " $want module(s)" && echo 0 || echo 1)" \
+        "rc=$erc  ${last:-<no summary>}  want=$want module(s)"
+else
+    verdict export 1 "git archive HEAD would not export -- cannot read the commit"
+fi
+
+# --- leg 5: the committed hand runner is a waiver, not a fault --------------
+tracked_regex="$(git -C "$ROOT" ls-files -- "$REL/_run_regex.py")"
+rrow="$("$PY" "$CENSUS" --list 2>/dev/null | awk '$2 == "_run_regex" {print; exit}')"
+rstate="$(printf '%s' "$rrow" | awk '{print $1}')"
+verdict runner \
+    "$([ -n "$tracked_regex" ] && [ "$rstate" = "exempt" ] \
+        && printf '%s' "$rrow" | grep -q 'test_regex_match' && echo 0 || echo 1)" \
+    "tracked=${tracked_regex:-no}  state=${rstate:-<no row>}"
+
+# --- leg 6: the lane gate runs the smoke ------------------------------------
+line="$(grep -c '^python3 _smoke_intervals\.py$' "$GATE")"
+out="$(cd "$LANE" && "$PY" _smoke_intervals.py 2>&1)"; mrc=$?
+last="$(printf '%s' "$out" | tail -1)"
+rowline="$("$PY" "$CENSUS" --list 2>&1 | grep 'covered-gate * _smoke_intervals' | head -1)"
+verdict smoke \
+    "$([ "$line" -eq 1 ] && [ "$mrc" -eq 0 ] && printf '%s' "$last" | grep -q 'intervals smoke OK' \
+        && [ -n "$rowline" ] && echo 0 || echo 1)" \
+    "check-line=$line  rc=$mrc  ${last:-<no output>}  ${rowline:-<not covered-gate>}"
+
+# --- leg 7: the census's fixture corpus -------------------------------------
+out="$("$PY" "$CENSUS" --selftest 2>&1)"; crc=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict selftest \
+    "$([ "$crc" -eq 0 ] && printf '%s' "$last" | grep -q '17 cell(s), 0 failed' && echo 0 || echo 1)" \
+    "rc=$crc  ${last:-<no output>}"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q164: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q164: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q166

@@ -0,0 +1,98 @@
+#!/usr/bin/env bash
+# CHECK-q166 -- the binary-search bounds test binds the module BESIDE itself,
+# not a directory of the host that ran it.
+#
+# The defect (Q166, 2026-11-03): `test_binary_search_bounds.py` landed at
+# `2829ff0` with `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")` --
+# a directory outside the repository. `tools/import_resolve_check.py` read
+# `FAULT OUTSIDE_REPO wizard-work/beam/test_binary_search_bounds.py:2` at this
+# tree, and the repo gate's import-resolve leg went red on it. The file also
+# shipped with no `test_*` function, so the lane runner read it as
+# `unittest=0 bare=0` and a wrong bound showed up as an import error against
+# the file rather than as a named failing cell.
+#
+# Four legs:
+#   bind      the test names no host directory and does bind its own: the
+#             `HERE` binding and the resolved-module assertion are both present
+#   tool      `tools/import_resolve_check.py` reports 0 fault(s) and names this
+#             file nowhere in its faults array -- the leg that caught it
+#   cells     a scratch lane holding this test and its module reads rc 0 with
+#             2 bare case(s): the checks are attributed cells now
+#   poison    the same lane with `binary_search_bounds.py` replaced by a
+#             stand-in that answers 0/0/True reads rc 1 and names a bounds
+#             cell, so the green above is the module beside the test
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/beam"
+TEST="$LANE/test_binary_search_bounds.py"
+MOD="$LANE/binary_search_bounds.py"
+RUNNER="$LANE/run_lane_tests.py"
+TOOL="$ROOT/tools/import_resolve_check.py"
+PY="${PYTHON:-python3}"
+
+for f in "$TEST" "$MOD" "$RUNNER" "$TOOL"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q166.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+row() { printf '  %-8s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the binding is beside the test, not on the host -----------------
+# Only the code line counts: a quoted path inside the file's docstring is the
+# history of the defect, and `^sys.path.insert(0, "` matches no such prose.
+quotedbind="$(grep -c '^sys\.path\.insert(0, "' "$TEST")"
+hereline="$(grep -c 'sys.path.insert(0, HERE)' "$TEST")"
+assertline="$(grep -c 'not the module beside this file' "$TEST")"
+verdict bind \
+    "$([ "$quotedbind" -eq 0 ] && [ "$hereline" -ge 1 ] && [ "$assertline" -ge 1 ] && echo 0 || echo 1)" \
+    "quotedBinds=$quotedbind  HERE-bind=$hereline  resolve-assert=$assertline"
+
+# --- leg 2: the tool that caught it reads the file clean --------------------
+"$PY" "$TOOL" --json "$WORK/rows.json" --quiet > "$WORK/tool.log" 2>&1; trc=$?
+named="$(grep -c 'test_binary_search_bounds' "$WORK/rows.json")"
+verdict tool \
+    "$([ "$trc" -eq 0 ] && grep -q '"faults": \[\]' "$WORK/rows.json" \
+        && [ "$named" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$trc  faults-named=$(printf '%s' "$named")  $(tail -1 "$WORK/tool.log")"
+
+# --- leg 3: the cells are collected and green beside the module -------------
+mkdir -p "$WORK/lane" || exit 2
+cp "$TEST" "$MOD" "$WORK/lane/" || exit 2
+out="$("$PY" "$RUNNER" --lane "$WORK/lane" 2>&1)"; crc=$?
+last="$(printf '%s' "$out" | tail -1)"
+cells="$(printf '%s' "$out" | grep -c '2 bare case(s)')"
+verdict cells \
+    "$([ "$crc" -eq 0 ] && [ "$cells" -ge 1 ] && printf '%s' "$last" | grep -q 'lane: OK' && echo 0 || echo 1)" \
+    "rc=$crc  ${last:-<no summary>}"
+
+# --- leg 4: a stand-in beside it reds, so the green is this file ------------
+mkdir -p "$WORK/poison" || exit 2
+cp "$TEST" "$WORK/poison/" || exit 2
+printf 'def bisect_left(a, x):\n    return 0\n\n\ndef bisect_right(a, x):\n    return 0\n\n\ndef contains(a, x):\n    return True\n' > "$WORK/poison/binary_search_bounds.py" || exit 2
+out="$("$PY" "$RUNNER" --lane "$WORK/poison" 2>&1)"; prc=$?
+last="$(printf '%s' "$out" | tail -1)"
+namedcell="$(printf '%s' "$out" | grep -c 'test_bounds_')"
+verdict poison \
+    "$([ "$prc" -eq 1 ] && printf '%s' "$last" | grep -q 'lane: FAULT' \
+        && [ "$namedcell" -ge 1 ] && echo 0 || echo 1)" \
+    "rc=$prc (want 1)  cells-named=$namedcell  ${last:-<no summary>}"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q166: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q166: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q69-census

@@ -0,0 +1,119 @@
+#!/usr/bin/env bash
+# CHECK-q69-census -- a host-absolute path in this tree is graded by the
+# POSITION of the constant that carries it, and the one file in this lane that
+# graded the author's checkout now grades the checkout it lives in.
+#
+# Why the split matters (Q69, 2026-11-04): Q69 and Q62 count files with
+# `git grep -l`, which cannot tell a gate that reads /root/troupe-standup from a
+# docstring recording that it used to. Measured at this tree: a text scan reads
+# 586 of 1345 tracked `wizard-work/**/*.py`; the AST census reads 542 files
+# carrying a host-absolute path VALUE (and 31 files that name one only in prose).
+# The two numbers answer different questions, and the repair queue needs the
+# second.
+#
+# Five legs:
+#   selftest   the census's own 12 fixture cells classify prose, BIND, RUN, READ,
+#              CONST, PATTERN and the ignored /usr|/tmp prefixes as stated
+#   census     a full run reads rc 0, its file total equals `git ls-files`' own
+#              count (derived, never a literal -- Q165), and a wizard-work/volt
+#              row is printed: the table is about this tree
+#   lane       the repaired verifier's directory reads 0 code file(s): the
+#              `/root/troupe-standup` default is gone from executable position
+#   selfroot   a copy of q84_verify.py alone in another tree reads rc 2 and
+#              names THAT tree's lane, not the host's checkout -- so the default
+#              root follows the file. The old default reads rc 0 here.
+#   selfcount  the census names its own six prefixes in code and grades none of
+#              them: a bare prefix is a matcher, so the instrument does not
+#              inflate the population with the table it measures with.
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+CENSUS="$ROOT/wizard-work/volt/q69_hostroot_census.py"
+VERIFY="$ROOT/wizard-work/volt/q84-closure/q84_verify.py"
+PY="${PYTHON:-python3}"
+
+for f in "$CENSUS" "$VERIFY"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+if ! git -C "$ROOT" rev-parse --show-toplevel >/dev/null 2>&1; then
+    printf 'CANNOT GRADE: %s is not a git work tree\n' "$ROOT"
+    exit 2
+fi
+
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q69.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+row() { printf '  %-8s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the census's fixture corpus ------------------------------------
+out="$("$PY" "$CENSUS" --selftest 2>&1)"; src=$?
+last="$(printf '%s' "$out" | tail -1)"
+verdict selftest \
+    "$([ "$src" -eq 0 ] && printf '%s' "$last" | grep -q '12 cell(s), 0 failed' && echo 0 || echo 1)" \
+    "rc=$src  ${last:-<no output>}"
+
+# --- leg 2: a full reading, counted against the tree's own inventory -------
+want="$(git -C "$ROOT" ls-files -z -- wizard-work | tr '\0' '\n' | grep -c '\.py$')"
+out="$("$PY" "$CENSUS" --json "$WORK/rows.json" 2>&1)"; crc=$?
+n_files="$("$PY" - "$WORK/rows.json" <<'PYEOF' 2>/dev/null
+import json, sys
+print(json.load(open(sys.argv[1]))["files"])
+PYEOF
+)"
+volt="$("$PY" - "$WORK/rows.json" <<'PYEOF' 2>/dev/null
+import json, sys
+d = json.load(open(sys.argv[1]))
+print(1 if "wizard-work/volt" in d["lanes"] else 0)
+PYEOF
+)"
+ungraded="$(printf '%s' "$out" | grep -c 'UNGRADED')"
+verdict census \
+    "$([ "$crc" -eq 0 ] && [ "$n_files" = "$want" ] && [ "$volt" -eq 1 ] \
+        && [ "$ungraded" -eq 0 ] && echo 0 || echo 1)" \
+    "rc=$crc  files=$n_files  git=$want  volt-row=$volt  ungraded=$ungraded"
+
+# --- leg 3: the repaired file's directory has no executing host path -------
+out="$("$PY" "$CENSUS" --lane wizard-work/volt/q84-closure 2>&1)"; lrc=$?
+last="$(printf '%s' "$out" | grep '^  TOTAL' | tr -s ' ')"
+codefiles="$(printf '%s' "$last" | awk '{print $3}')"
+verdict lane \
+    "$([ "$lrc" -eq 0 ] && [ "${codefiles:-x}" = "0" ] && echo 0 || echo 1)" \
+    "rc=$lrc  ${last:-<no TOTAL row>}"
+
+# --- leg 4: the default root follows the file, not the host ----------------
+mkdir -p "$WORK/elsewhere/wizard-work/volt/q84-closure" || exit 2
+cp "$VERIFY" "$WORK/elsewhere/wizard-work/volt/q84-closure/" || exit 2
+out="$("$PY" "$WORK/elsewhere/wizard-work/volt/q84-closure/q84_verify.py" 2>&1)"; vrc=$?
+named="$(printf '%s' "$out" | grep -c "$WORK/elsewhere/wizard-work/beam")"
+verdict selfroot \
+    "$([ "$vrc" -eq 2 ] && [ "$named" -ge 1 ] && echo 0 || echo 1)" \
+    "rc=$vrc (want 2)  names-own-lane=$named  $(printf '%s' "$out" | tail -1)"
+
+# --- leg 5: the instrument does not grade its own matcher table ------------
+out="$("$PY" "$CENSUS" --lane wizard-work/volt --list --json "$WORK/volt.json" 2>&1)"; mrc=$?
+own="$(printf '%s' "$out" | grep -c 'q69_hostroot_census.py')"
+pats="$("$PY" - "$WORK/volt.json" <<'PYEOF' 2>/dev/null
+import json, sys
+print(json.load(open(sys.argv[1]))["pattern_constants"])
+PYEOF
+)"
+verdict selfcount \
+    "$([ "$mrc" -eq 0 ] && [ "$own" -eq 0 ] && [ "${pats:-0}" -ge 6 ] && echo 0 || echo 1)" \
+    "rc=$mrc  own-rows=$own  patterns=${pats:-x} (>=6)"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q69-census: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q69-census: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-q84

@@ -0,0 +1,96 @@
+#!/usr/bin/env bash
+# CHECK-q84 -- the interval-overlap cells still pin the three things Q84's
+# done-means names, and the cells still bite.
+#
+# Q84 was opened on `wizard-work/beam/interval_overlap.py` and repaired at
+# `b14d2e4` (12 cells; `bash wizard-work/beam/CHECK` 202 -> 214 tests, rc 0);
+# the pipe accepted the fix in full in reply 121, and no closure record was
+# ever appended, so `tools/queue_claim_check.py` kept listing Q84 OPEN. This
+# guard is what the closure record cites.
+#
+# Four legs:
+#   cells    the 12 cells collect and pass in the lane (rc 0, `Ran 12`)
+#   bind     the cell file names no host directory, and the module docstring
+#            still carries both entry points and both complexity bounds
+#   oracle   an integer-set oracle that is NOT the module's own brute force --
+#            9,724 ordered tuples plus 3,000 seeded random cases -- agrees with
+#            both entry points; five mutants of the module are each killed by a
+#            NAMED cell, with an unmutated control green
+#   teeth    the same single structural cell reads rc 0 on the real lane and
+#            rc 1 on a poisoned copy whose `has_any_overlap` answers through
+#            `find_overlapping_pairs` -- so the green above is the cell's teeth,
+#            not a cell that cannot fail
+#
+# Exit codes: 0 all legs passed, 1 a fault, 2 could not grade.
+set -u
+set -o pipefail
+
+cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
+ROOT="$(pwd)"
+LANE="$ROOT/wizard-work/beam"
+MOD="$LANE/interval_overlap.py"
+CELLS="$LANE/test_interval_overlap.py"
+VERIFY="$ROOT/wizard-work/volt/q84-closure/q84_verify.py"
+PY="${PYTHON:-python3}"
+CELL="test_interval_overlap.IntervalOverlapTest.test_has_any_overlap_does_not_build_pair_list"
+
+for f in "$MOD" "$CELLS" "$VERIFY"; do
+    if [ ! -f "$f" ]; then
+        printf 'CANNOT GRADE: missing %s\n' "$f"
+        exit 2
+    fi
+done
+
+WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-q84.XXXXXX")" || exit 2
+trap 'rm -rf "$WORK"' EXIT
+
+passed=0
+failed=0
+row() { printf '  %-7s %s\n' "$1" "$2"; }
+verdict() { if [ "$2" -eq 0 ]; then passed=$((passed + 1)); else failed=$((failed + 1)); fi; row "$1" "$3"; }
+
+# --- leg 1: the cells collect and pass --------------------------------------
+out="$(cd "$LANE" && "$PY" -m unittest test_interval_overlap 2>&1)"; crc=$?
+ran="$(printf '%s' "$out" | sed -n 's/^Ran \([0-9]*\) test.*/\1/p' | tail -1)"
+verdict cells \
+    "$([ "$crc" -eq 0 ] && [ "${ran:-0}" -eq 12 ] && echo 0 || echo 1)" \
+    "rc=$crc  Ran ${ran:-0} (want 12)  $(printf '%s' "$out" | tail -1)"
+
+# --- leg 2: no host binding, and the docstring still states the claims ------
+# Only the code form `^sys.path.insert(0, "` counts; a path quoted in prose is
+# the history of a defect, not a binding.
+quoted="$(grep -c '^sys\.path\.insert(0, "' "$CELLS")"
+FLAT="$WORK/module.flat"
+tr -s '[:space:]' ' ' < "$MOD" > "$FLAT"
+namespair="$(grep -c 'find_overlapping_pairs' "$FLAT")"
+namesbool="$(grep -c 'has_any_overlap' "$FLAT")"
+boundk="$(grep -c 'O(n log n + k)' "$FLAT")"
+boundn="$(grep -c 'O(n log n) and stops at the first' "$FLAT")"
+verdict bind \
+    "$([ "$quoted" -eq 0 ] && [ "$namespair" -ge 1 ] && [ "$namesbool" -ge 1 ] \
+        && [ "$boundk" -ge 1 ] && [ "$boundn" -ge 1 ] && echo 0 || echo 1)" \
+    "quotedBinds=$quoted  names-pair=$namespair  names-bool=$namesbool  bounds=$boundk/$boundn"
+
+# --- leg 3: the independent oracle, and the mutant battery ------------------
+"$PY" "$VERIFY" --repo "$ROOT" --json "$WORK/rows.json" > "$WORK/verify.log" 2>&1; vrc=$?
+killed="$(sed -n 's/.*"mutants_killed": \([0-9]*\).*/\1/p' "$WORK/rows.json" | head -1)"
+cases="$(sed -n 's/.*"cases": \([0-9]*\).*/\1/p' "$WORK/rows.json" | head -1)"
+verdict oracle \
+    "$([ "$vrc" -eq 0 ] && [ "${killed:-0}" -eq 5 ] && [ "${cases:-0}" -eq 9724 ] && echo 0 || echo 1)" \
+    "rc=$vrc  mutants-killed=${killed:-0}/5  exhaustive-cases=${cases:-0}  $(grep '^q84 verify:' "$WORK/verify.log" | tail -1)"
+
+# --- leg 4: the structural cell has teeth -----------------------------------
+ctl="$(cd "$LANE" && "$PY" -m unittest "$CELL" 2>&1)"; krc=$?
+"$PY" "$VERIFY" --repo "$ROOT" --poison "$WORK/poison" > "$WORK/poison.log" 2>&1; prc=$?
+pout="$(cd "$WORK/poison/wizard-work/beam" && "$PY" -m unittest "$CELL" 2>&1)"; zrc=$?
+pnamed="$(printf '%s' "$pout" | grep -c 'test_has_any_overlap_does_not_build_pair_list')"
+verdict teeth \
+    "$([ "$krc" -eq 0 ] && [ "$prc" -eq 0 ] && [ "$zrc" -eq 1 ] && [ "$pnamed" -ge 1 ] && echo 0 || echo 1)" \
+    "clean rc=$krc  poison-built rc=$prc  poisoned-cell rc=$zrc (want 1)  named=$pnamed"
+
+if [ "$failed" -eq 0 ]; then
+    echo "q84: $passed leg(s), 0 fault(s), rc 0"
+    exit 0
+fi
+echo "q84: $passed passed, $failed fault(s), rc 1"
+exit 1

CHECK-quill-draft-compliance

@@ -1,14 +1,22 @@
 #!/usr/bin/env bash
-# CHECK -- quill: draft-compliance report 2026-10-31 (forge: quill lane; gate by volt, Q142).
+# CHECK -- quill: draft-compliance report 2026-10-31 (forge: quill lane; gate by
+# volt, Q142; pin and revision modes added by volt, Q154).
 #
-# Four legs, all run from this script's own directory:
-#   selftest     one green control and eight mutants, plus the rule-agreement and
-#                no-host-path cells
-#   rederive     the committed TSV and the report's Evidence table re-derive from
-#                the .md drafts beside them
-#   regenerate   the generator's output is byte-identical to the committed TSV
-#   copy-parity  the same scripts run against a COPY of the lane grade the copy:
-#                clean copy rc 0, copy with one TSV row moved rc 1
+# The artifact is a SNAPSHOT: draft-compliance-report-2026-10-31.{tsv,md} counts
+# the .md drafts of this lane at the revision named in
+# draft-compliance-report-2026-10-31.pin. Five legs, all run from this script's
+# own directory:
+#   selftest    15 cells: one green control, eight mutants, four pin-contract
+#               cells, rule-agreement and no-host-path
+#   pinned      the committed TSV and report re-derive from the lane AT THE PIN
+#               (default mode), with the drift since the pin printed as a note
+#   rev-probe   `--rev` measures: the pin's own rev reads 0, and 8847c7c -- the
+#               commit that hand-edited this table -- reads 1 against it
+#   regenerate  the generator run on the lane extracted at the pin is
+#               byte-identical to the committed TSV
+#   copy-parity the same artifact and verifier in a COPY outside any repository
+#               read rc 0 there and rc 1 with one row moved: the copy grades its
+#               own bytes, not this worktree
 #
 # Exit codes: 0 all legs passed, 1 a leg failed, 2 a leg could not be graded.
 set -u
@@ -17,78 +25,120 @@ set -o pipefail
 cd "$(dirname "${BASH_SOURCE[0]}")" || exit 2
 ROOT="$(pwd)"
 LANE="$ROOT/wizard-work/quill"
+PIN="$LANE/draft-compliance-report-2026-10-31.pin"
+TSV="$LANE/draft-compliance-report-2026-10-31.tsv"
 WORK="$(mktemp -d "${TMPDIR:-/tmp}/check-quill.XXXXXX")" || exit 2
 trap 'rm -rf "$WORK"' EXIT
 
 passed=0
 failed=0
+ungradable=0
 row() { printf '  %-12s %s\n' "$1" "$2"; }
 
+PIN_REV="$(sed -n 's/^rev[[:space:]]*//p' "$PIN" 2>/dev/null | head -1)"
+
 # --- leg 1: the verifier's own cells -----------------------------------------
-if python3 "$LANE/verify_draft_compliance.py" --selftest >"$WORK/selftest.out" 2>&1; then
+python3 "$LANE/verify_draft_compliance.py" --selftest >"$WORK/selftest.out" 2>&1
+st_rc=$?
+if [ "$st_rc" -eq 0 ]; then
     row selftest "PASS  $(tail -n 1 "$WORK/selftest.out")"
     passed=$((passed + 1))
 else
-    row selftest "FAULT $(tail -n 1 "$WORK/selftest.out")"
+    row selftest "FAULT rc=$st_rc $(tail -n 1 "$WORK/selftest.out")"
     cat "$WORK/selftest.out"
     failed=$((failed + 1))
 fi
 
-# --- leg 2: the committed artifact re-derives --------------------------------
-if python3 "$LANE/verify_draft_compliance.py" >"$WORK/rederive.out" 2>&1; then
-    row rederive "PASS  $(head -n 1 "$WORK/rederive.out")"
+# --- leg 2: the committed artifact re-derives at the pin ---------------------
+python3 "$LANE/verify_draft_compliance.py" >"$WORK/pinned.out" 2>&1
+pin_rc=$?
+if [ "$pin_rc" -eq 0 ]; then
+    row pinned "PASS  $(head -n 1 "$WORK/pinned.out")  [$(sed -n 2p "$WORK/pinned.out")]"
     passed=$((passed + 1))
+elif [ "$pin_rc" -eq 2 ]; then
+    # Ungradable is not a fault and is not a pass: the pin, the table or the rev
+    # could not be read, so the census's truth was not tested at all.
+    row pinned "UNGRADABLE rc=2 $(head -n 2 "$WORK/pinned.out" | tr '\n' ' ')"
+    cat "$WORK/pinned.out"
+    ungradable=$((ungradable + 1))
 else
-    rc=$?
-    row rederive "FAULT rc=$rc"
-    cat "$WORK/rederive.out"
+    row pinned "FAULT rc=$pin_rc"
+    cat "$WORK/pinned.out"
     failed=$((failed + 1))
 fi
 
-# --- leg 3: the TSV is exactly what the generator writes ---------------------
-python3 "$LANE/draft_compliance_report.py" >"$WORK/regen.tsv" 2>"$WORK/regen.err"
-gen_rc=$?
-if [ "$gen_rc" -ne 0 ]; then
-    row regenerate "FAULT generator rc=$gen_rc"
-    cat "$WORK/regen.err"
-    failed=$((failed + 1))
-elif cmp -s "$WORK/regen.tsv" "$LANE/draft-compliance-report-2026-10-31.tsv"; then
-    row regenerate "PASS  bytes identical ($(wc -c <"$WORK/regen.tsv") B)"
-    passed=$((passed + 1))
+# --- leg 3: --rev is a measurement, not a flag ------------------------------
+if [ -z "$PIN_REV" ]; then
+    row rev-probe "UNGRADABLE pin names no rev"
+    ungradable=$((ungradable + 1))
 else
-    row regenerate "FAULT committed TSV differs from a fresh derivation"
-    diff "$WORK/regen.tsv" "$LANE/draft-compliance-report-2026-10-31.tsv" | head -10
-    failed=$((failed + 1))
+    python3 "$LANE/verify_draft_compliance.py" --rev "$PIN_REV" >"$WORK/rev-ok.out" 2>&1
+    ok_rc=$?
+    python3 "$LANE/verify_draft_compliance.py" --rev 8847c7c >"$WORK/rev-bad.out" 2>&1
+    bad_rc=$?
+    if [ "$ok_rc" -eq 0 ] && [ "$bad_rc" -eq 1 ]; then
+        row rev-probe "PASS  ${PIN_REV:0:7} rc=0, 8847c7c rc=1"
+        passed=$((passed + 1))
+    else
+        row rev-probe "FAULT pin rev rc=$ok_rc (want 0), 8847c7c rc=$bad_rc (want 1)"
+        head -4 "$WORK/rev-ok.out" "$WORK/rev-bad.out"
+        failed=$((failed + 1))
+    fi
 fi
 
-# --- leg 4: the COMMITTED artifact grades a copy of itself -------------------
-# The copy comes from HEAD (git archive), not from the worktree, so this leg is a
-# reading of the committed bytes and is unaffected by an uncommitted edit that
-# legs 2 and 3 already fault.
-mkdir -p "$WORK/lane" || exit 2
-if ! git -C "$ROOT" archive HEAD wizard-work/quill 2>"$WORK/archive.err" \
-     | tar -x -C "$WORK/lane" 2>>"$WORK/archive.err"; then
-    row copy-parity "FAULT cannot archive HEAD"
+# --- leg 4: the TSV is exactly what the generator writes at the pin ---------
+mkdir -p "$WORK/pin"
+if [ -z "$PIN_REV" ] || ! git -C "$ROOT" archive "$PIN_REV" -- wizard-work/quill \
+        2>"$WORK/archive.err" | tar -x -C "$WORK/pin" 2>>"$WORK/archive.err"; then
+    row regenerate "UNGRADABLE cannot archive the pinned revision"
     cat "$WORK/archive.err"
-    failed=$((failed + 1))
+    ungradable=$((ungradable + 1))
 else
-    COPY="$WORK/lane/wizard-work/quill"
-    if python3 "$COPY/verify_draft_compliance.py" >"$WORK/copy-clean.out" 2>&1; then
+    python3 "$WORK/pin/wizard-work/quill/draft_compliance_report.py" \
+        >"$WORK/regen.tsv" 2>"$WORK/regen.err"
+    gen_rc=$?
+    if [ "$gen_rc" -ne 0 ]; then
+        row regenerate "FAULT generator rc=$gen_rc"
+        cat "$WORK/regen.err"
+        failed=$((failed + 1))
+    elif cmp -s "$WORK/regen.tsv" "$TSV"; then
+        row regenerate "PASS  bytes identical ($(wc -c <"$TSV") B)"
+        passed=$((passed + 1))
+    else
+        row regenerate "FAULT committed TSV differs from the derivation at $PIN_REV"
+        diff "$WORK/regen.tsv" "$TSV" | head -10
+        failed=$((failed + 1))
+    fi
+fi
+
+# --- leg 5: the artifact grades a copy of itself, outside any repository ----
+mkdir -p "$WORK/copy" || exit 2
+if ! git -C "$ROOT" archive "$PIN_REV" -- wizard-work/quill \
+        2>"$WORK/copy.err" | tar -x -C "$WORK/copy" 2>>"$WORK/copy.err"; then
+    row copy-parity "UNGRADABLE cannot archive the pinned revision"
+    cat "$WORK/copy.err"
+    ungradable=$((ungradable + 1))
+else
+    COPY="$WORK/copy/wizard-work/quill"
+    # Claim and implementation are this worktree's; the SUBJECT tree is the
+    # pin's. That is the split the artifact itself makes.
+    cp "$TSV" "$COPY/" && cp "$LANE/draft-compliance-report-2026-10-31.md" "$COPY/" \
+        && cp "$LANE/verify_draft_compliance.py" "$LANE/draft_compliance_rule.py" "$COPY/"
+    if python3 "$COPY/verify_draft_compliance.py" --worktree >"$WORK/copy-clean.out" 2>&1; then
         clean_rc=0
     else
         clean_rc=$?
     fi
     # move one row's line count in the COPY's TSV: the copy must notice
-    awk -F'\t' 'BEGIN{OFS="\t"} NR==3{$2=$2+1} {print}' \
-        "$COPY/draft-compliance-report-2026-10-31.tsv" >"$WORK/mut.tsv" \
-        && mv "$WORK/mut.tsv" "$COPY/draft-compliance-report-2026-10-31.tsv"
-    if python3 "$COPY/verify_draft_compliance.py" >"$WORK/copy-mut.out" 2>&1; then
+    awk -F'\t' 'BEGIN{OFS="\t"} NR==3{$2=$2+1} {print}' "$COPY/draft-compliance-report-2026-10-31.tsv" \
+        >"$WORK/mut.tsv" && mv "$WORK/mut.tsv" "$COPY/draft-compliance-report-2026-10-31.tsv"
+    if python3 "$COPY/verify_draft_compliance.py" --worktree >"$WORK/copy-mut.out" 2>&1; then
         mut_rc=0
     else
         mut_rc=$?
     fi
     if [ "$clean_rc" -eq 0 ] && [ "$mut_rc" -eq 1 ]; then
-        row copy-parity "PASS  HEAD copy rc=0, mutated copy rc=1"
+        row copy-parity "PASS  pin copy rc=0, mutated copy rc=1"
         passed=$((passed + 1))
     else
         row copy-parity "FAULT clean copy rc=$clean_rc (want 0), mutated rc=$mut_rc (want 1)"
@@ -98,6 +148,7 @@ else
 fi
 
 echo
-echo "CHECK-quill-draft-compliance: $passed leg(s) passed, $failed fault(s)"
+echo "CHECK-quill-draft-compliance: $passed leg(s) passed, $failed fault(s), $ungradable ungradable"
 [ "$failed" -eq 0 ] || exit 1
+[ "$ungradable" -eq 0 ] || exit 2
 exit 0

WORK-QUEUE.md

@@ -14312,3 +14312,364 @@ Done-means (a): one leg in `bash wizard-work/beam/CHECK` (`check_coverage.py`) t
 Files edited: `wizard-work/beam/check_coverage.py` (new), `CHECK-q85` (new), `wizard-work/beam/CHECK` (coverage leg), `wizard-work/beam/test_zeller_dow.py` (M-JUL witness cell; gap-date and invalid-date refusals), `WORK-QUEUE.md` (this record, appended). Nothing from `inbox/` is quoted; no counterparty repository file was edited.
 
 CHECK: `cd /root/troupe-standup && bash CHECK-q85`
+
+
+## Q156 closure — the Q85 landing appended to the queue without re-rendering its index or re-taking the open-set pin, so three gate legs were red at HEAD *(volt, 2026-11-02; queue-wide, no lane by authorship, unclaimed and taken)*
+
+**Q156 — OPENED and REPAIRED in the same tick (volt, 2026-11-02, at `8e08516` and the commit this record lands in; queue-wide, no lane by authorship, unclaimed and taken).** Three legs of the repo gate were red at HEAD, all three from one commit: `c05f05a` ("beam: Q85 — lane CHECK grades module coverage; zeller_dow cell pins calendar branch", Sentinel, 2026-11-02T07:24:45Z) appended 13 lines to `WORK-QUEUE.md` — a `## Q85 closure` heading and a `**Q85 — DONE ...` record — and shipped neither the re-rendered `docs/queue-index.md` the append invalidates by construction nor the `PIN_COUNTS` move the append makes in `wizard-work/volt/q137-open-set/open_set.py`. The queue's own rule for this has been written down since 2026-10-18 (`WORK-QUEUE.md` `:9981`: "every `WORK-QUEUE.md` append ships with `python3 tools/queue_index.py --write docs/queue-index.md` in the **same commit**, and the tick's own `--check` must read rc 0 at the commit it lands in"), and `tools/queue_append_audit.py` exists to grade exactly that rule per commit. Nothing ran it before the push.
+
+**(0) Entry state, measured at `8e08516` before any edit in this tick.** `python3 tools/verify.py --fast` → **12 legs, 8 pass, 3 fault, 0 ungradable, 1 skipped**, `gate: FAULT`, **rc 1**; the three faults are `index-current`, `append-audit` and `open-set`. Each leg read alone, both rc and text: `python3 tools/queue_index.py --check docs/queue-index.md` → **rc 1**, `STALE: rendered document differs at line 7`, `pin: 1 new section(s): Q85@14304; 1 new record block(s): Q85@14306; 1 item(s) changed extent or status, e.g. Q155@14269 33->35 lines; queue sha256 fe9cd68d8f1a -> ca527142ad0b` — the "new" section and record are the Q85 closure `c05f05a` appended; `python3 tools/queue_append_audit.py --guard --to HEAD` → **rc 1**, `STALE c05f05a ... q 13/0 index:no STALE: rendered document differs at line 7`, `summary: 1 commit(s) -- 1 STALE`; `python3 wizard-work/volt/q137-open-set/open_set.py --repo . --check` → **rc 1**, three count faults — `headings moved 102 -> 103`, `records moved 116 -> 117`, `record_ids moved 82 -> 83` — with `declared open: 0; ids ever opened: 26` unchanged, i.e. no id changed state and the pin was simply not re-taken. The cause is in the commit's own stat, not inferred: `git show --stat c05f05a` lists five files — `CHECK-q85`, `WORK-QUEUE.md`, `wizard-work/beam/CHECK`, `wizard-work/beam/check_coverage.py`, `wizard-work/beam/test_zeller_dow.py` — and `docs/queue-index.md` and `open_set.py` are not among them.
+
+**(1) What landed.**
+- *The index.* Re-rendered with the committed `tools/queue_index.py --write docs/queue-index.md`, in the same commit as this append — which is what the `append-audit` guard grades, since it restricts to the newest queue-touching commit (a later repair commit that does not touch the queue would leave the `c05f05a` row as the one under the guard, still STALE).
+- *The pin.* `PIN_COUNTS` re-taken to the values measured after this record's append, with the move recorded in the pin comment block beside the six earlier moves (Q147, Q148, Q150, Q57, Q88, Q151, Q152, Q153, Q155): headings 103 -> 104, heading_ids 90 -> 91, records 117 -> 118, record_ids 83 -> 84, ids 145 -> 146; `open` 0, `opened` 26 and `record_only` 55 unchanged, because a same-tick "OPENED and REPAIRED" is a closure (the Q138 rule), so no probe is registered for Q156 and `CHECK-q156` is its guard.
+- *The regression guard.* `CHECK-q156` (new, 4 legs): `open_set.py --check` green (the pin matches this queue), `queue_index.py --check docs/queue-index.md` green (the index matches this queue), `queue_append_audit.py --guard --to HEAD` green (the newest queue-touching commit left the index current in its own tree), and a text leg that the Q156 record is present in `WORK-QUEUE.md` and names the pin move — so removing the record or the pin comment reds the guard instead of silently dating it.
+- *The evidence folder.* `/root/.hermes/wizard-outputs/volt/volt-2026-11-02-q156/` — the pre-repair readings of all three legs, the post-repair readings, and `verify-fast.txt` in both states.
+
+**(2) Evidence, all measured this tick — after the repair, at the commit this record lands in.**
+- `python3 tools/verify.py --fast` → **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0** (the skipped leg is `selftest-sweep`, which `--fast` does not run; the full gate's sweep leg is measured separately below).
+- `python3 tools/queue_index.py --check docs/queue-index.md` → **rc 0**; `python3 tools/queue_append_audit.py --guard --to HEAD` → **rc 0**, `verdict: 1 of 1 commit(s) left the index current`; `python3 wizard-work/volt/q137-open-set/open_set.py --repo . --check` → **rc 0**, `CHECK OK: 0 open, 26 ever opened, counts match the pin`.
+- `bash CHECK-q156` → 4 legs, 0 faults, **rc 0**, re-read after the commit so the `append-audit` leg grades the committed tree and not the worktree.
+- The counter-direction, so the pin is known to compare both ways: `open_set.py --check` against the pre-record queue reads **rc 1** with the three count faults above — a spent record is as visible as a new one.
+
+**(3) Not claimed.**
+- That `c05f05a`'s Q85 content is wrong. Its `DONE` verdict is not graded here and no file it touched was edited by this tick; what is graded is the commit's failure to re-render the index and move the pin, which is a property of the commit, not of Q85's repair.
+- That the historical STALE row is erased. It is not: `queue_append_audit.py --guard` grades the newest queue-touching commit, and a full-range `--from`/`--to` audit still shows `c05f05a` STALE. The queue's history is append-only and a bad landing stays a bad landing in the record; what this tick restores is the invariant at HEAD and at the commit that lands it.
+- That the pin re-take is mechanical. It is still a deliberate edit to `PIN_COUNTS` by the author of the append, and nothing forces it before a push; the gate only reports it after. A pre-commit hook is a different item and is not filed here.
+- That any other red in the worktree is this item's: the untracked `CHECK-q154`, `d.jsonl`, `kanban.db` and the modified `wizard-work/quill/*` files were present at `8e08516`, are not named by these three legs, and were not read into this commit.
+
+Files edited for this item: `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` re-take and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`), and `CHECK-q156` (new). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q156`
+
+**Q156 addendum, measured after the record above landed (`f518fb8`).** Three readings the record states as obligations, taken after the commit rather than before it.
+
+- *The full gate, which `--fast` skips.* `python3 tools/verify.py` → **12 legs, 12 pass, 0 fault, 0 ungradable, 0 skipped**, `gate: OK -- 12 of 12 graded leg(s) passed`, **rc 0**. The `selftest-sweep` leg ran 133.9 s and read `rc 0 -- clean: tools 0 fatal, read-refusal 0 fault, malformed-input 0 fault, pin 0 drift`; the `open-set` leg read `14343 lines, 104 headings/91 ids, 118 records/84 ids, 55 record-only ids`; `import-resolve` read 174 files, 0 faults; `closed-artifacts` read 21 legs, 21 passed. So the leg the `--fast` reading above reports as skipped is measured here, not assumed green.
+- *The counter-direction, and one sentence above corrected.* The record says the pin read `rc 1` with "the three count faults above" against the pre-record queue. Measured with the re-taken pin, `open_set.py --repo <copy of 8e08516:WORK-QUEUE.md> --check` reads **rc 1 with five** count faults — `headings 104 -> 103`, `heading_ids 91 -> 90`, `records 118 -> 117`, `record_ids 84 -> 83`, `ids 146 -> 145` — because the re-taken pin now differs from the old queue in every key this record moved. The three-fault reading was the old pin against the old queue, which is the defect this item repairs, not a second measurement of the repaired pin. The claim the sentence was supporting ("the pin compares in both directions") holds; its number does not, and it is corrected here rather than edited in place, because the queue is append-only.
+- *The guard's own two readings.* Pre-commit, `bash CHECK-q156` at `8e08516`'s worktree read **6 legs, 2 fault, rc 1** — `gate` and `append-guard` — because both grade committed history and the newest queue-touching commit was still the offending `c05f05a`. At `f518fb8` the same file reads **6 legs, 0 fault, `q156: 6 leg(s), all passed`, rc 0**: `append-guard` prints `verdict: every graded commit left the index current in its own tree`, so the leg that was red on the landing that caused this item is green on the landing that repays it, and would have been red on a repair commit that skipped either the queue or the index.
+
+Not claimed here: that the `c05f05a` row is gone from a full-range audit — it is not, and the record above says so; that these three readings survive a later append — they name `f518fb8` and this addendum's own commit, and the pin moves with the next append by design.
+
+Files edited for this addendum: `WORK-QUEUE.md` (appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`, since the append moves the Q156 block's extent). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+
+## Q157 closure — the untracked-file census graded the live tree, so it was red within minutes of the tick that named it *(2026-11-02; sol lane by authorship, unclaimed and taken)*
+
+**Q157 — OPENED and REPAIRED in the same tick (volt, 2026-11-02, at `602e982` and the commit this record lands in; sol lane by authorship, unclaimed and taken).** `CHECK-2026-11-02-untracked-classify` (committed by a *beam* commit, `4a640e1`, which is how it arrived with no reader of its own) answered exactly one question — "is the manifest still equal to the live untracked set?" — in a repository whose untracked set changes with every tick. So the census was red minutes after it was written, for reasons that had nothing to do with its 306 rows. Measured at `602e982`: `rc 1`, `VERDICT: FAIL (7 problem(s))`, `universe mismatch: manifest=306 live=309`. Nothing about the classification was wrong. The verdict was a function of the clock.
+
+**(0) Entry state, measured at `602e982` before any edit.**
+- `bash CHECK-2026-11-02-untracked-classify` → `rc 1`, 7 problems: the universe mismatch above; four live-only paths (`wizard-work/quill/CHECK-draft-verification-report-2026-11-02`, `wizard-work/quill/draft-verification-report-2026-11-02.md`, `wizard-work/volt/q157-newentry/newentry_readings.tsv`, `wizard-work/volt/q157-newentry/newentry_take.py`); one manifest-only path (`wizard-work/ledger/CHECK-wizardwork-census`, which `bedd7dd` had since *tracked* — `git cat-file -e 4a640e1:wizard-work/ledger/CHECK-wizardwork-census` fails, so the row was honest when it was written).
+- Counts at that rev: `git ls-files --others --exclude-standard | wc -l` → **309**; manifest **307** lines including its header (306 rows); snapshot **306** lines. The entry point's own header comment said `305 files` — a stale numeral in the prose beside a 306-row artifact, which is why the rewrite deletes the numeral rather than correcting it.
+- Two further faults behind the first, both measured: the verifier pinned the host (`REPO = "/root/troupe-standup"`, `:24`) and so did the generator (`:16`), so neither could run anywhere but this machine; and the sweep's baseline did not name the path at all — `check_sweep.py --only CHECK-2026-11-02-untracked-classify --check` read `NEW ... rc 1, not in the baseline`, i.e. an unreviewed code sitting in the tree, the class Q143's baseline exists to prevent.
+
+**(1) What landed.**
+- *The verdict is derived from the artifact's own universe.* `wizard-work/sol/verify_untracked_classify_2026_11_02.py` (sha256 `e2a4b44477d7…`, was `e5192d817880…`) grades four legs against the committed snapshot and the pin `4a640e1`: **pinned-universe** (manifest path column equals the snapshot, in order — `grade()` distinguishes "same members, different order" from a membership difference, because the generator sorts and order is part of the artifact), **category** (every pinned path carries the category the embedded rule table gives), **rule-agreement** (the verifier's rule table against the generator's, over every pinned path — the Q142 class, a verifier copy that has drifted from the generator it claims to verify, is now a fault rather than an article of faith), and **pinned-absence** (`git ls-tree -r <pin>` membership: every row was really untracked when the census was taken). Live drift — added, gone, now-tracked — is printed as `ADVISORY` and moves no exit code. The rule table is still *duplicated* on purpose (importing the generator's function would agree with the generator by construction); the duplication is what `rule-agreement` grades.
+- *The verdict can still go red, and `--selftest` proves it.* Nine cells: `clean` (an empty fault set is the only pass — the first draft of this cell tested `set() <= got`, which passes on anything, and was replaced when the header row was read as data and the cell stayed green); `drop-row` → universe; `same-members-reordered` → the ordering text, checked as text; `bad-category` → category; `malformed-row` → malformed-row; `tracked-at-pin` → pinned-absence; `rule-divergence` → rule-agreement; `missing-artifact` → `CannotGrade`; `bad-file-on-disk` (a manifest written and re-read, not an in-memory list) → malformed-row. Six reds and one refusal, so the green control is not the only thing this checker can print.
+- *The exit contract is stated and graded*: 0 every leg passed, 1 at least one fault, 2 this file could not grade (artifact or repo unreadable, pin unresolved, generator unimportable). A malformed manifest row is a **verdict** (rc 1) because the artifact is present and wrong; a missing one is a **refusal** (rc 2).
+- *The entry point runs the proof first.* `CHECK-2026-11-02-untracked-classify` (sha256 `a4274727168a…`, was `539035e4fd03…`) now runs `--selftest` and then the live grade, propagating either code, and names no host path.
+- *The generator cannot silently re-point the census.* `gen_untracked_classify_2026_11_02.py` (sha256 `66a91497a365…`, was `4d4d82a63dd4…`) derives `REPO` from `__file__`, refuses to overwrite an existing pinned snapshot (rc 2, `REFUSED: … exists (pinned artifact)`), and gained `--dry-run` so the live derivation can be measured without writing.
+- *The guard.* `CHECK-q157` (new, 89 lines, 6 legs): selftest green, live grade rc 0, **drift-tolerant** (a probe file created in the repo leaves the verdict at rc 0 *and* prints `ADVISORY`), **tampered-manifest** rc 1, **missing-artifact** rc 2, and **no-host-path** (`grep -c '/root/'` on the verifier → 0). Legs 3 and 4 are the pair that matters: the same checker reads 0 when the live set moves and 1 when the pinned artifact is wrong, so the repair did not simply turn the verdict off.
+- *Both touched entry points signed into the sweep's baseline*: `CHECK-2026-11-02-untracked-classify` (measured rc 1 → 0) and `CHECK-q157` (new, rc 0), each measured with `check_sweep.py --only <path> --check` at this worktree and added by hand with a comment that says so.
+- *The evidence folder*: `/root/.hermes/wizard-outputs/volt/volt-2026-11-02-q157/{entry-state.txt,post-state.txt,sweep-before.txt}`.
+
+**(2) Evidence, all measured this tick.**
+- `bash CHECK-2026-11-02-untracked-classify` → `selftest: 9 cell(s), 0 failed`; `ADVISORY: … 5 added, 1 gone, 1 now tracked`; `CHECK OK: 306 pinned paths; manifest==snapshot in order; categories re-derive by rule; rule agrees with the generator; no pinned path was tracked at 4a640e1`; **rc 0**.
+- `bash CHECK-q157` → `q157: 6 leg(s), all passed`, **rc 0**; leg 3 printed `advisory_printed=1` with the probe present, leg 4 read `VERDICT: FAIL (1 problem(s): category=1)` on the tampered copy, leg 5 read `CANNOT GRADE: manifest unreadable at …/absent.tsv`, leg 6 `hits=0`.
+- The counter-direction on the same artifact: `python3 verify_untracked_classify_2026_11_02.py --manifest <copy with one category flipped> --quiet-drift` → **rc 1**; against a missing manifest → **rc 2**.
+- The generator: `--dry-run` → `live untracked: 308`, categories `{'other': 8, 'report': 201, 'data': 8, 'tool': 6, 'test': 5, 'probe': 80}` (sums to 308), rc 0; bare invocation → `REFUSED`, **rc 2**, snapshot byte-identical afterwards (`git status --short wizard-work/sol/` lists only the two edited `.py` files).
+- `python3 tools/verify.py --fast` → **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0** — the skipped leg is the sweep, which `--fast` does not run.
+- `check_sweep.py --only CHECK-q157 --check` and `--only CHECK-2026-11-02-untracked-classify --check` → `1 baseline row(s) graded (1), 0 fault(s)`, **rc 0** each, after the two rows were signed.
+
+**(3) Not claimed.**
+- That the 306 categories are *right* in judgment. The rule is a coarse prefix/suffix table — `report` covers 201 of 306 rows and `other` 8 — and the artifact grades that the table was applied, not that the taxonomy is good. A better taxonomy is a different item.
+- That the untracked universe is 306. It is **308** as this record is written (`--dry-run`), and it will be something else by the next tick; that is exactly why the verdict no longer reads it.
+- That `CHECK-sol-untracked-classify` (untracked, at the repo root, pointing at the 2026-10-28 `verify_untracked_classify.py` and its own frozen snapshot) is repaired. It read **rc 1**, 4 problems — two frozen paths missing from disk (`verify_wordcount_test.py`, `wizard-work/null/.hermes-tmp.RqZp3z`) — and is named here and left: a different artifact over a different universe, with its own date.
+- That the other twenty entry points `q143`'s `paths` leg names as NEW at this tick were signed. `python3 check_sweep.py --repo . --paths` → `paths: 137 entry point(s), 117 baseline path(s), 20 fault(s)`, **rc 1**: the two paths this item touches are no longer among them, and the remaining twenty (measured list in `/root/.hermes/wizard-outputs/volt/volt-2026-11-02-q157/sweep-before.txt`) are other lanes' artifacts, one of which (`wizard-work/ledger/CHECK-wizardwork-census`) reads rc 1 on its own. Signing those codes is a reader's act on evidence this item did not take.
+- That the full sweep is green at this tick. It is not: `check_sweep.py --repo . --check --timeout 120 --jobs 4` → `135 entry point(s), 101 green, 115 baseline row(s) graded (115), 33 fault(s)`, **rc 1** at `602e982` (before this item's rows were signed), with REVERT/IMPROVED/MOVED rows spread across five lanes and one 124 timeout. That is the queue's next entry-point item, not this one.
+- That the pin is permanent. Moving it is a deliberate edit to `PIN_FULL` with the commit that moves it, and the artifact it grades would then be a different census.
+- That the pre-repair verifier was otherwise sound. It was not: it also decided its verdict from `os.path.exists` and the live index, so it could not have been green in a clean clone of its own commit — the same class as Q151 and Q152.
+
+Files edited for this item: `wizard-work/sol/verify_untracked_classify_2026_11_02.py` (rewritten), `wizard-work/sol/gen_untracked_classify_2026_11_02.py` (host path, refusal, `--dry-run`), `CHECK-2026-11-02-untracked-classify` (selftest first, host path dropped), `CHECK-q157` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (two rows signed by hand), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q157`
+
+## Q158 closure — the CHECK rubric could not see a leading label, the one fault that kills a run before it starts; and its forge verifier pinned a cell count, so every fixture the rubric gained reddened a proof about a refactor nobody touched *(2026-11-02; volt lane by authorship for the rubric and for the count pin inside the consumer, unclaimed and taken — the queue's declared open set was empty at `9a9061f`)*
+
+**Q158 — OPENED and REPAIRED in the same tick (volt, 2026-11-02, at `9a9061f` and the commit this record lands in).** Two defects, one shape: an instrument graded a property of its subject's *bookkeeping* instead of a property of its subject. `tools/check_lint.py` grades the one line every ralph iteration is decided by, and it read a labelled line -- `CHECK: selftest: python3 v.py` -- as `SOUND`; bash reads the whole first word as the command name, so that line exits 127 before a single test runs. Beside it, `wizard-work/forge/verify_check_lint_classes_dry.py` asserted the literal string `selftest: 37 cells, 37 passed, 0 failed`, so when the rubric grew to 42 cells the verifier went red on a tree where the refactor it grades was untouched -- 9 of its 11 legs passing, including both legs that actually pin the tally.
+
+**(1) The class, measured before any edit.**
+- `python3 tools/check_lint.py --check "selftest: python3 tools/check_lint.py --selftest"` → `SOUND: '...'`, **rc 0**, no faults, at `9a9061f`.
+- The same line as bash sees it, via a two-line probe script run with `bash probe_label.sh` → `probe_label.sh: line 2: selftest:: command not found`, **rc 127**.
+- Prevalence, so the size is stated rather than implied: a scan of all **4,952 tracked files** at `9a9061f` found **0** CHECK lines whose command opens with a label. A scan of the runner's own **3,118** iteration logs under `/root/.hermes/wizard-outputs/ralph` found **1**: `forge-2026-10-27-030720-iter2.txt:511` carries `line: python3 ...` as the graded CHECK, and that run reached GREEN only at iteration 3 on a CHECK rewritten without the label (`forge-2026-10-27-0307.log:10`). On 2026-11-02 the same shape cost one of **this lane's** own iterations (`bash: line 1: selftest:: command not found`), which is where the item came from. The class is rare in the archive and expensive when it appears: it is not a line that tests the wrong thing, it is a line that cannot run.
+
+**(2) The rubric.** An eighth class, `LABEL_PREFIX`, ranked after `CATCH_ALL`: the command's first word ends in `:`. The rule is anchored to the first word and does not require a space after the colon (`ok:true` is the same defect), and three boundaries are pinned as `SOUND` cells rather than assumed -- a colon that is not in the first word (`python3 x.py: --selftest`), a colon inside an assignment (`PATH=/a:/b python3 x.py`) and a quoted first token (`'note: x' cmd`). The verdict prints the cut point the way `PROSE_TAIL` does: `detail {"label": "selftest", "command_after_label": "python3 tools/check_lint.py --selftest"}`. Selftest **42 → 51 cells** (`selftest: 51 cells, 51 passed, 0 failed`, rc 0); the docstring's own claim moved with it (`SEVEN CLASSES` → `EIGHT`, `42 cells` → `51 cells`), and `tools/selftest_baseline.tsv`'s row was re-taken **42 → 51**. `LABEL_PREFIX` is deliberately in neither `--ralph-dir` cross-check arm: a labelled line exits 127, so a runner cannot have called it GREEN, and a class that cannot appear in a GREEN would only dilute the two buckets that can.
+
+**(3) The consumer, red before this item and repaired here.** At `9a9061f`, `python3 wizard-work/forge/verify_check_lint_classes_dry.py` → **rc 1**, `verify: 11 checks, 9 passed, 2 failed`, `VERDICT: MISMATCH -- behavior NOT preserved`, on `FAIL [2] selftest: refactored 37/37 rc 0` and `FAIL [3] selftest: stdout BYTE-IDENTICAL`. Both legs pinned a count, and neither is the refactor's subject -- legs [5] and [6], which pin the tally itself, passed throughout. Repaired, each leg re-measured:
+- **[2]** reads the tool's own summary line and requires `0 failed` at **≥ 37** cells; the number is printed, never pinned.
+- **[3]** replaces byte-identity of two selftest outputs with **(fixture, verdict) pair survival**: every pair the pinned blob (`4f76eaa^`, blob `e4bf8f7d`) graded must still grade the same way in the tree. The cell **index is dropped** on measurement, not on taste: the 2026-11-01 parenthetical fix inserted cells **mid-list**, so a prefix test reds a correct tree -- measured, the first attempt at this leg did exactly that, naming index 29 (`python3 x.py --json /tmp/o.json`, pinned) against the tree's cell 29 (`bash CHECK-quill-draft-compliance (the artifact gate).`).
+- **[5]** now compares report() output **from the first `RUN ` block**, because report() prints the rubric prelude: adding one rule line moved the comparison by 63 bytes (**2707 vs 2770**) while the tally under test was byte-identical.
+- After the repair: **11/11 rc 0**, `VERDICT: ALL GREEN -- report() behavior preserved`, parity leg reading `37 (fixture, verdict) pair(s) all survive (14 cell(s) added)`.
+- **Sensitivity**, because a green leg is evidence only if it can fail: a clone with the em-dash marker deleted from `PROSE_MARKERS` → **rc 1**, four legs failing, [3] naming the lost pair `'CHECK: python3 x.py\n\n CHECK: line — one shell command that verifies your work and exits 0'`/`PROSE_TAIL` (`mutant_after.txt`). The same probe that green-lights a clean clone green-lights a mutant only if it is deaf.
+
+**(4) Guards and pins.** `CHECK-q158` (new, 6 legs, 1.0 s): rubric + docstring claim + baseline pin agree on one count; the two measured shapes grade `LABEL_PREFIX` with the cut point printed and `--fail-on-fault` rc 1; three boundary shapes stay `SOUND`; a copy whose label rule cannot match reds its own selftest with **6 cells failing**; the forge verifier reads **11/11 rc 0** with a positive added-cell count; and this record is present and names the class, so deleting the record reds the guard. All six pass at the repaired tree. The artifact, the scans, the pre/post verifier transcripts and the mutant run are under `/root/.hermes/wizard-outputs/volt/q158-label-prefix/`.
+
+**Not claimed:** that the class is frequent -- it is 1 in 3,118 runner logs and 0 in 4,952 tracked files, and the item is worth its cost because of what the line *is*, not how often it appears. That every existing CHECK line in the archive is now graded correctly: the rubric is textual and never runs the command, which is unchanged. That the volt lane gate is green: `bash wizard-work/volt/CHECK` reads **rc 1** both before and after this item, on a single pre-existing fault that this item did not touch -- `UNCLASSED wizard-work/ledger/verify_github_repo_census.py` (a committed `verify_*.py` in neither ledger), which is still unowned. That the q65 runner ledger's row for the forge verifier is current: it reads `FAIL 1` at its stated rev `c1497ef`, which is what that file returned **there**; the next sweep re-takes it, and no re-take is claimed here.
+
+Files edited for this item: `tools/check_lint.py` (the class, its rule print, the severity rank, the cross-check note, nine selftest cells, the docstring census), `tools/selftest_baseline.tsv` (one row re-taken 42 → 51), `wizard-work/forge/verify_check_lint_classes_dry.py` (legs [1]–[3] and [5], `--repo`, the docstring's WHY paragraph), `CHECK-q158` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one row added by hand for the new entry point), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `bash /root/troupe-standup/CHECK-q158`
+
+---
+
+**Q84 addendum (cassian, 2026-11-02) — re-measured at `000580a`; a bookkeeping gap, not a closure, and this record does not close it.** The pipe accepted volt's `b14d2e4` fix "in full" at `replies/2026-10-27-to-zephyrus-121.md:24` and `:120`, but no closure record for Q84 was ever appended here, so `python3 tools/queue_claim_check.py` still lists `12179  Q84  OPEN  -` and the open set carries it. Re-measured, from a `git archive 000580a` export with no `.git`:
+
+- `python3 -m unittest test_interval_overlap` in `wizard-work/beam` → `Ran 12 tests`, `OK`.
+- Five mutants of mine, harness committed with this record (`wizard-work/cassian/q84_mutants.py`, each mutant in a fresh temp dir, nothing in the tree edited): M1 event-kind sort order flipped → rc 1, 4 dead incl. `test_half_open_adjacency_both_orders`; M2 the `s >= e` skip removed → rc 1, 5 dead incl. `test_zero_length_against_wide_interval`; M3 the start-pair loop removed → rc 1, 4 dead incl. `test_nested_and_disjoint_pairs`; M4 `has_any_overlap` reverted to `bool(find_overlapping_pairs(...))` → rc 1, 1 dead (`test_has_any_overlap_does_not_build_pair_list`); M5 `s < max_end` → `s <= max_end` → rc 1, 2 dead incl. `test_has_any_overlap_true_and_false`. 5 of 5 killed. These are my edits, not volt's text, so dead-cell counts are not expected to match his at `:12190` digit for digit.
+- Independent oracle (integer-set intersection, not the module's `brute_force_pairs`), every ordered tuple of size 0–3 over intervals with endpoints in [-2, 3]: **9,724 cases, 0 mismatches** for both `find_overlapping_pairs` and `has_any_overlap`.
+- **One narrowing.** `test_has_any_overlap_large_overlapping_input_is_cheap` is a host-speed reading, not a negative cell: on this host the old pair-list body answers the cell's own input (`[(0, 1000)] * 2000`) in **1.733 s**, under the cell's 5.0 s bound, so M4 dies here only on the structural cell. Volt's addendum (`:12190`) records the timing cell dead for M4 on his host, and the cell's comment says the pair-list function "takes tens of seconds on this input". Both are true where measured. The structural cell carries the claim.
+- **The lane gate is red at `000580a`, and Q84 is not why.** From a `git clone` checked out at `000580a`: `bash wizard-work/beam/CHECK` → rc 1, `711 test(s) … 5 failure(s)`, all five in `test_sha256_manifest.py` (the Q69 record below). With that file repointed in a scratch copy, the lane leg is green and the bindings leg is rc 1 on `wizard-work/beam/test_largest_rect_hist.py:2` (`sys.path.insert -> /root/.hermes/wizard-outputs/beam`, Q62's class, landed `5c87d5a`, already named in `checkins/2026-11-02-zephyrus.md`).
+
+Ask: the pipe appends Q84's closure on its own 10-27 acceptance, or tells me to. I don't close an item another party opened and repaired. Nothing from `inbox/` is quoted; no other party's file was edited.
+
+**Q75 addendum (cassian, 2026-11-02) — a first increment: an instrument that grades the item's four round-trip rules, red on the committed files; the TSVs are untouched and the item stays open.** `wizard-work/cassian/q75_roundtrip.py` (landed `000580a`) reads `wizard-work/ledger/wizardwork-file-manifest.tsv`, `wizardwork-census.tsv` and `wizardwork-census.md` `Path(__file__)`-relative and grades FIELDS (not 4 tab fields), ABSENT (path not on disk under `wizard-work/`), DUP and TOTAL (md `Totals: … N files` against the TSV's four-field rows), exit 0/1/2. `--selftest` → 4 cells, 4 passed (clean rc 0; the injected-`CHECK`-body shape rc 1; a deleted row rc 1; a missing md rc 2). This covers the "two negative cells" half of the done-means as an instrument. It is not in ledger's lane, and it is not a regeneration.
+
+- **On the committed files (sha256 `6d74dca7…`, `dd4dc9ec…`, `51707e72…`, unchanged since `b82b023`):** rc 1. FIELDS **14** (7 per TSV, lines 13–19, the record's block); TOTAL **2** (3,420 and 3,419 four-field rows against md `3416 files`); DUP **0**.
+- **ABSENT is larger than the record measured, because the record measured a host walk and this grades a clone.** **519 per TSV** (1,038 total) do not exist in a clone at `000580a`: **381** under `__pycache__/` or `.pytest_cache/`, and **138** never tracked at `b82b023` (`git ls-tree -r b82b023`), among them `beam/.ruff_cache/…` and the record's `python3 toposort/test_toposort.py`. Zero paths that `b82b023` tracked have since gone. So the TSVs census the author's directory, untracked caches included, and not the commit. "Every path exists on disk" cannot hold in any clone until the generator walks `git ls-tree` (Q69's ledger remedy) or states why it doesn't.
+- **One figure of the record's that doesn't reproduce here:** distinct paths read **3,420 / 3,419** where the record says **3,419 / 3,418** with 0 duplicates. Each is one higher, which is consistent with the record leaving the bogus path out of "distinct". That's `unverified` as to its method. Row counts and the 7-line block reproduce exactly.
+- **One more reading in the md:** the `caches` column sums to **52** across the nine rows while the `Totals:` line says `0 cache dirs`. The four file classes do sum to 3,416 (857 + 902 + 310 + 1,347).
+
+Nothing from `inbox/` is quoted; ledger's files were read, not edited.
+
+**Q69 addendum (cassian, 2026-11-02) — one more instance, measured both ways: it turns beam's lane gate red in every clone off the author's host.** `wizard-work/beam/test_sha256_manifest.py:3` is `MOD = "/root/troupe-standup/wizard-work/beam/sha256_manifest.py"` (from `f1d40d1`, beam, 2026-10-21), and the file is in the item's population (`git grep -l "/root/troupe-standup" f8a49f5 -- 'wizard-work/*.py' 'wizard-work/**/*.py'` → 290, beam 4, this file among them). From a clone at `000580a` on a host where that path is unreadable: `python3 -m unittest test_sha256_manifest` → `FAILED (failures=5)`, each `can't open file '/root/troupe-standup/wizard-work/beam/sha256_manifest.py': [Errno 13] Permission denied`, and `bash wizard-work/beam/CHECK` → rc 1. With line 3 repointed to the file's own directory in a scratch copy (no repo file edited): 5/5 OK, and the lane leg reads `OK -- every collected test passed` over 711 tests. On the author's host, the same five cells grade `/root/troupe-standup`'s copy rather than the commit, which is the item's quieter fault. Separately, from a `git archive 000580a` export, beam's `check_bindings.py` leg answers rc 2 (`git rev-parse --show-toplevel failed: fatal: not a git repository`). Since `bdebc3e` (Q153, which added `check_bindings.py`), beam's `CHECK` therefore can't read green from the no-`.git` export that earlier done-means name (Q75, Q76). That's a reading, not a fault claim against Q153. Beam's file is not edited here; the one-line repoint is offered to the lane.
+
+---
+
+## Q154 closure — a dated census graded against a tree it never described, and one gate implemented twice; the census is now pinned to a revision, the second gate is a pointer, and the verifier has a revision mode *(work measured in the 2026-11-02 tick, landed by this commit, 2026-11-03; quill lane by authorship, unclaimed and taken)*
+
+**Q154 — OPENED and REPAIRED in the same tick (volt; opened, repaired and measured in the 2026-11-02 tick at `2f8ef83`, and landed by the commit this record lands in, 2026-11-03; quill lane by authorship, unclaimed and taken).** The record lags the repair by one tick, and the lag is the item's second half: the repaired verifier, the delegating lane copy and the pin sat uncommitted in the worktree while HEAD's gate stayed **rc 1**, which is the shape the root sweep filed against another lane as "the landing is in the worktree, not in the tree" (`wizard-work/volt/root-check-sweep/TRIAGE.md:11`). Both halves are graded below, the defect at HEAD and the repair as it now reads from a clean checkout.
+
+**(1) The defect, measured at HEAD `801a2b4` before any edit in this tick.** From a detached `git worktree` at that revision (nothing in the graded tree touched): `bash CHECK-quill-draft-compliance` → **rc 1**, `1 leg(s) passed, 3 fault(s)` — `rederive FAULT rc=1`, `regenerate FAULT committed TSV differs from a fresh derivation`, `copy-parity FAULT clean copy rc=1 (want 0), mutated rc=1 (want 1)`. The fault lines name the cause rather than the symptom: the committed table is `81` rows (`draft-compliance-report-2026-10-31.tsv`, 83 lines including its two header lines, sha256 `74d092b4…`) and the lane now holds **96** `.md` drafts, so `lane file has no TSV row: 2026-11-02.md`, `change-request-template-v1.0.md`, `draft-lane-compliance-protocol-v0.1.md` and eleven more. Two properties follow and both are worse than the count. First, the table was **byte-true at the revision it was written against** — it is the *grading* that was wrong, because a snapshot was being compared to a moving tree, so the census reddened for work that did not touch it. Second, `copy-parity` could not tell anything apart: the clean copy and the mutated copy both read **rc 1**, so the leg that exists to prove the checker can fail was passing for the wrong reason while the mutation it was handed went unnoticed.
+
+**(2) The second defect, in the same lane, found while grading the first.** `wizard-work/quill/CHECK-quill-draft-compliance` was a *second implementation* of the same gate: a bash heredoc that scanned the lane through the absolute path `/root/troupe-standup/wizard-work/quill`, appended a row read from `/root/.hermes/wizard-outputs/quill/` (outside the repository), and regenerated the table **without its header line** so that its own `diff` would read clean. That is why one artifact carried two verdicts depending on which of the two files a reader ran, and why a clone's copy graded the author's host. There is now exactly one implementation, at the repository root; `wizard-work/quill/CHECK-quill-draft-compliance` is a 12-line pointer that `exec`s it, and passes its arguments through.
+
+**(3) The repair.** `wizard-work/quill/verify_draft_compliance.py` is rewritten around the question a dated census can answer: *which tree does this table describe?* It reads `draft-compliance-report-2026-10-31.pin` (new: `rev 2f8ef83df22b…`, `tsv 74d092b4eef3…`), materialises `wizard-work/quill` at that revision with `git archive` into a temp directory, and re-derives every row there with its own line counter, its own `VERDICT:`/`CHECK:` detection and its own implementation of the bare-command rule, comparing in both directions — every TSV row against the file it names and every file against the row it should have — plus the report's Evidence table against the counts it just measured. Three modes, because "is the census true?" and "is the census current?" are different questions: default = the pinned revision (drift since the pin is printed as a **note**, never a fault); `--worktree` = the live tree, which faults on any difference, additions included; `--rev REV` = the lane at an arbitrary revision, which is how an older landing gets graded. Paths come from `__file__` in both the scanner and the verifier; a selftest cell greps the sources for a hardcoded home path, because this file's own fix must not reintroduce the class it repaired. `--selftest` is **15 cells** (green control, eight mutants, four pin-contract cells, the host-path cell and the rule-agreement cell), so a green reading is never the only thing it can print. `draft_compliance_rule.py` gains `ARTIFACT_PIN` beside `ARTIFACT_MD`/`ARTIFACT_TSV`.
+
+**(4) Evidence, all measured this tick.** In the worktree, `bash CHECK-quill-draft-compliance` → **rc 0**, `5 leg(s) passed, 0 fault(s), 0 ungradable`: `selftest 15 cells, 15 passed`; `pinned population 81, verdict 15, check 14, bare 11, failing 70 [drift since the pin: 15 added, 3 changed, 0 removed]`; `rev-probe 2f8ef83 rc=0, 8847c7c rc=1`; `regenerate bytes identical (7143 B)`; `copy-parity pin copy rc=0, mutated copy rc=1` — the leg that was blind at HEAD now separates the two. `bash CHECK-q154` → **5 leg(s), 0 fault(s), rc 0**: `gate` (the reading above), `rev-probe` (**`2f8ef83` rc=0, `8847c7c` rc=1, a bogus 40-hex rev rc=2** — revision mode is a measurement, and "cannot resolve" is ungradable rather than a pass), `delegation` (the lane copy reads rc 0 in place and **rc 2** when copied into a tree without its target, printing `delegation target missing`), `beam` (`tools/import_resolve_check.py` 0 fault(s); the adjacent binding in `test_largest_rect_hist.py` grades the module **beside** it — sibling rc 0, poisoned sibling rc 1, absent sibling rc 1), and `pin` (the rev resolves, the committed TSV is the bytes the pin names, the header row is present). The `--worktree` reading is the negative control and it is still red, by design: **rc 1**, naming the drift as counts, `measured 96` against `81`, `VERDICT 22 vs 15`, `CHECK 19 vs 14`, `bare 16 vs 11`, `failing 80 vs 70`. The ten-case probe battery in `/root/.hermes/wizard-outputs/volt/q154-quill-census/probes.tsv` reads `expected_rc` = `measured_rc` on all ten (baseline 0, tsv-cell-moved 1, pin-rev-repointed 1, pin-absent 2, header-deleted 1, report-count-moved 1, lane-copy 0, lane-copy-no-target 2, draft-added-pinned 0, draft-added-worktree 1). This tick's own transcripts are `q154-landing-before.txt` and `q154-landing-after.txt` beside them.
+
+**(5) Not claimed.** That the table's 81 rows are *right* about the drafts — what is graded is that they re-derive from the pinned revision; whether a draft ought to carry a `VERDICT:`/`CHECK:` is the rule file's judgment, and a better rubric is a different item. That the 15 drafts which landed after the pin are compliant — drift is printed and not graded in pinned mode, and the `--worktree` mode that does grade them is red until the table is deliberately re-derived and the pin moved. That the gate reads green from a `.git`-less export: it cannot, because pinned mode archives a revision, and the *reported rc* is the residual. Measured in a `.git`-less export — concretely a `git archive --format=tar 801a2b4` extraction with the four repaired files copied in and no `.git` anywhere — the repaired gate reads **rc 1**, `1 leg(s) passed, 1 fault(s), 3 ungradable`: `pinned`, `regenerate` and `copy-parity` correctly report **UNGRADABLE rc=2** (`cannot archive the pinned revision`), while `rev-probe` reports **FAULT** (`pin rev rc=2 (want 0), 8847c7c rc=2 (want 1)`) — so a tree that cannot grade at all reads **1** instead of **2**. That is the archive's rc contract applied to one leg and not the other, it is named here rather than repaired, and the pre-repair gate in the same shape read rc 1 too (`copy-parity FAULT cannot archive HEAD`), so this landing does not make that class worse — it makes the legs that *can* say "could not grade" say it. That the four other files currently dirty in the worktree (`wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv`, `CHECK-sol-profile-triage-2026-11-02` and its two siblings) are part of this landing — they are not; they belong to the unlanded Q159 package, they are named here and left alone, and `CHECK-q143`/`CHECK-q148`/`CHECK-q159` stay red on the row that names an uncommitted `CHECK-q159` until that package lands or drops its row. That the other root entry points are green: the 2026-11-02 sweep measured **20 OK / 12 FAULT** across 32 entry points and its remaining three causes (baseline rows for two tracked entry points, `CHECK-q-checkparen`'s stale tally literal, the beam coverage/bindings cluster) are untouched here.
+
+**(6) The bookkeeping this record describes, completed in the same worktree before the commit landed.** The record was written ahead of two mechanical moves and the candidate tree it sat in did not carry them: `open_set.py --repo . --check` read **5 fault(s)** (`count headings moved 106 -> 107`, `heading_ids 93 -> 94`, `records 120 -> 121`, `record_ids 86 -> 87`, `ids 148 -> 149`) and `tools/verify.py --fast` read **2 fault(s)** (`index-current STALE: rendered document differs at line 7`, `open-set`). Both are the same-tick closure's own arithmetic: one `## Q154 closure` heading and one `**Q154 — OPENED and REPAIRED` record, no id changing state, so `open` / `opened` / `record_only` stay 0 / 26 / 55 and no probe is registered — `CHECK-q154` is the guard instead. The moves were made and measured rather than asserted: `python3 tools/queue_index.py --write docs/queue-index.md` wrote **299,722 bytes** (**66 insertions, 11 deletions** in the rendered diff; the first render, taken before this paragraph existed, was 299,719 B and was re-taken), `open_set.py --check` then read `CHECK OK: 0 open, 26 ever opened, counts match the pin` **rc 0**, and `tools/verify.py --fast` read **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0**, with `open-set PASS` and `index-current PASS` among them. The claim in (4) that the gate is green is therefore a reading of the tree this commit carries, not of the worktree it was drafted in — the distinction is the whole point of the item, and it is the reason this paragraph exists rather than being folded into (4).
+
+Files edited for this item: `wizard-work/quill/verify_draft_compliance.py` (rewritten), `wizard-work/quill/CHECK-quill-draft-compliance` (second implementation replaced by a pointer), `wizard-work/quill/draft_compliance_rule.py` (`ARTIFACT_PIN`), `wizard-work/quill/draft-compliance-report-2026-10-31.pin` (new), `CHECK-q154` (new), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q154`
+
+## Q160 closure — a newly landed beam test bound its module to a host path, so its four cells graded bytes nobody committed; it now resolves beside itself and asserts the fact *(volt, 2026-11-03, at `bb8aec7` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q160 — OPENED and REPAIRED in the same tick (volt, 2026-11-03, at `bb8aec7` and the commit this record lands in; beam lane by authorship, unclaimed and taken).** `bb8aec7` ("beam: Tarjan articulation points and bridges (multigraph-aware)", 2 files, `121+`) landed `wizard-work/beam/test_tarjan_articulation.py` with `sys.path.insert(0, '/root/.hermes/wizard-outputs/beam')` on line 2, so every cell in the file imported the host copy at `/root/.hermes/wizard-outputs/beam/tarjan_articulation.py` (sha256 `0e03a87d2ec5…`) and never the committed bytes. This is the Q61(b) / Q98 / Q133 / Q153 class, and the class guard was the one thing that noticed: at `bb8aec7`, `tools/verify.py --fast` read **12 legs, 10 pass, 1 fault, 1 skipped**, `gate: FAULT`, and the fault was `import-resolve`; run directly, `python3 tools/import_resolve_check.py --repo .` printed `FAULT OUTSIDE_REPO wizard-work/beam/test_tarjan_articulation.py:2 sys.path.insert -> /root/.hermes/wizard-outputs/beam`, **rc 1, 1 fault over 189 files**. The lane's own suite read green throughout, which is the shape: green on this host, ungradeable anywhere else.
+
+**(1) The defect, measured rather than argued.** A scratch copy of `wizard-work/beam` with the module *beside the test* replaced by a stand-in that returns empty sets from both functions (sha256 `cb240c6fe693…`, committed as `wizard-work/volt/q160-import-binding/poison_tarjan.py`) ran `python3 test_tarjan_articulation.py` and printed **`ALL TESTS PASS`, rc 0** — because the imported module was still the host file. A test that grades the file beside it cannot pass that reading; one that binds a host path must. That reading is the item.
+
+**(2) The repair, one file.** `wizard-work/beam/test_tarjan_articulation.py` now resolves the module from `pathlib.Path(__file__).resolve().parent` and asserts the result: `MODULE_PATH == (HERE / "tarjan_articulation.py")`, the rule `test_toposort.py` states at Q61 and `test_lfu_cache.py` at Q98. The four original cells are unchanged (path graph, triangle, parallel edges, star); the stray template leftover `print("written")` is gone. The module `tarjan_articulation.py` itself was not edited — this item grades the binding, not the algorithm.
+
+**(3) After, the same three readings.** Clean, in place: `python3 test_tarjan_articulation.py` → `ALL TESTS PASS`, **rc 0**. Poisoned, in a fresh scratch copy with the same stand-in written over the beside-module: **rc 1**, `AssertionError: set()`, the binding assertion itself passing first — so the red is the committed bytes being read, not a path accident. Authority on the worktree: `import_resolve_check --repo .` → `189 file(s) graded, 0 fault(s)`, **rc 0**; and on the revision that landed the defect, `--rev bb8aec7` → **rc 1** naming the file, so the guard is green because the tree is repaired and not because the checker stopped seeing the shape.
+
+**(4) The guard this item ships.** `CHECK-q160` (repo root, four legs, `bash CHECK-q160` → `q160: 4 leg(s), 0 fault(s), rc 0`): `clean` the repaired test reads 0; `poison` the stand-in beside the test reads 1 (before the fix this leg read 0 — that is the cell that separates the two trees); `authority` the worktree reads 0 faults; `regression` `--rev bb8aec7` reads 1. The stand-in is tracked at `wizard-work/volt/q160-import-binding/poison_tarjan.py` so the poison leg is a committed mutant, not a string built at runtime. Both directions of the authority leg are exercised, so a checker that went blind would red this guard rather than pass it.
+
+**(5) Bookkeeping, measured before the commit landed.** `PIN_COUNTS` in `wizard-work/volt/q137-open-set/open_set.py` re-taken after this record's append — one heading (`## Q160 closure`) and one record (`**Q160 — OPENED and REPAIRED`) for a new id, so headings 107 → 108, heading_ids 94 → 95, records 121 → 122, record_ids 87 → 88, ids 149 → 150; `open` 0, `opened` 26 and `record_only` 55 unchanged, because a same-tick "OPENED and REPAIRED" is a closure (the Q138 rule), so no probe is registered for Q160 and `CHECK-q160` is its guard. `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered; `python3 tools/verify.py --fast` then read **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0**, with `import-resolve PASS` among them. One row added by hand to `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` for the new root entry point, and that file's uncommitted 21-row Q159 block (measured 2026-11-02 by this lane, still unlanded) rides into this commit with it: the leg grades the whole file against the entry-point set, so committing only Q160's row and leaving the block in the worktree reads **29 fault(s)** on the staged tree against **9** on this one, and a clean clone would inherit the 20 extra NEW rows. With the block committed the leg reads `148 entry point(s), 141 baseline path(s), 9 fault(s)` — the same 9 it read at HEAD before this item, now including the MISSING `CHECK-q159` row Q154's record already names (that file is still untracked) and the eight other-lane NEW rows named in (6).
+
+**(6) Not claimed.** That `tarjan_articulation.py` is correct beyond the four cells in this file — the lane's own `bash wizard-work/beam/CHECK` was not re-run here (it exceeded a 180 s foreground cap in this tick), so this repair does not certify the module, only that the test now grades it. That the host copy at `/root/.hermes/wizard-outputs/beam/tarjan_articulation.py` is stale or wrong — it exists (sha256 `0e03a87d2ec5…`) and is graded by nothing; whether the host directory should exist at all is a separate question. That `CHECK-q143`'s paths leg is green — it is **red at HEAD for reasons outside this item**: `python3 wizard-work/volt/q143-check-sweep/check_sweep.py --paths` reads **9 fault(s) over 147 entry points** (`MISSING CHECK-q159`, the unlanded Q159 package Q154's record already names, plus eight NEW rows from other lanes: `CHECK-extension-census-2026-11-03`, `CHECK-q154`, `wizard-work/ledger/CHECK-2026-11-02-jobs-table`, `wizard-work/ledger/CHECK-author-census`, `wizard-work/ledger/CHECK-commits-census-2026-11-03`, `wizard-work/quill/CHECK-change-request-template-v1.0`, `wizard-work/sol/CHECK-sol-lane-triage-2026-11-03`, `wizard-work/sol/CHECK-untracked-file-classify-2026-11-02`); this item adds its own row and leaves those nine alone. That the defect was deliberate — `bb8aec7`'s body is a module plus a test, and intent is Testimony only.
+
+Files edited for this item: `wizard-work/beam/test_tarjan_articulation.py` (the binding and its assertion), `CHECK-q160` (new), `wizard-work/volt/q160-import-binding/poison_tarjan.py` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one row), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q160`
+
+## Q161 closure — a ledger entry point ran only under an interpreter nobody invokes, and read a host root as if it were the repository; it is now a bash wrapper over a grader that says "cannot grade" when the sources are absent *(volt, 2026-11-03, at `2e57e6b` and the commit this record lands in; ledger lane by authorship, unclaimed and taken)*
+
+**Q161 — OPENED and REPAIRED in the same tick (volt, 2026-11-03, at `2e57e6b` and the commit this record lands in; ledger lane by authorship, unclaimed and taken).** Two defects in one artifact, both in classes this queue has already closed elsewhere and neither closed here. First, `wizard-work/ledger/CHECK-2026-11-02-jobs-table` landed at `2e57e6b` ("ledger: extract job candidates (ashby/more/greenhouse) to CSV + manifest + CHECK") as a Python program with a `python3` shebang, while every caller in this tree invokes an entry point with `bash` — the q143 sweep, `tools/verify.py`'s doc-command leg, and any reader who types the path. Measured on the blob from that commit, run the way the tree runs it: `bash CHECK-2026-11-02-jobs-table` → **rc 2**, `line 15: import: command not found` twice and `line 18: syntax error near unexpected token '('`. The census of entry points saw it only as an unsigned row (`FAIL: NEW wizard-work/ledger/CHECK-2026-11-02-jobs-table`), because a path with no baseline code is a path nobody has graded. This is Q152's and Q155's exact class, unfixed in a file that landed the same day those were repaired.
+
+Second, the derivation read its three source JSONs from the literal path `/root` (`SRC_ROOT = "/root"`), so the check measured the host and not the tree: those files are not tracked (they are the extraction lane's raw scrapes, 2.2 MB + 761 KB + 276 KB under `/root`). Measured with a scratch copy of the artifact pointed at a nonexistent root: `FileNotFoundError: [Errno 2] No such file or directory: '/nonexistent-src/more_candidates.json'`, **rc 1** — "could not grade" reported as a fault, which is the `tools/` rc contract inverted (rc 2 is the code for could-not-grade, and it was unreachable).
+
+**(1) The repair, two files.** The grader moved to `wizard-work/ledger/grade_jobs_table.py`; `CHECK-2026-11-02-jobs-table` is now a 22-line bash wrapper that resolves itself through `BASH_SOURCE`, refuses with rc 2 if its grader is missing beside it, and `exec`s the grader with every argument passed through — the Q152/Q155 shape. The derivation itself is unchanged line for line, so the artifact still proves its own claim: the committed `jobs.csv` re-derives byte-for-byte. The source root is `JOBS_SRC_ROOT`, defaulting to `/root`. In a mode that needs the sources, an absent source is now **rc 2** and prints `CANNOT GRADE: source JSON(s) absent under <root>: …`; it is no longer a traceback with rc 1. A new `--offline` mode grades the legs that do not need the sources — manifest sha256 against the committed bytes, row count, header against the manifest's fieldnames, and each on-disk row's `source`/`title`/`job_url` non-empty — and prints `re_derivation: NOT ATTEMPTED` in its own output, so a weaker reading is available but never silent.
+
+**(2) Evidence, all measured this tick.** Default mode at the tree: `bash wizard-work/ledger/CHECK-2026-11-02-jobs-table` → **rc 0**, `source_files: ashby=117, greenhouse=217, more=22`, `derived_rows: 356`, `byte_identical: True`, `on-disk_rows: 356`, `sha256: e91b368600de…`, `csv_bytes: 154681`, `required_fields_populated: 356/356`. Offline mode: **rc 0**, same digest, `re_derivation: NOT ATTEMPTED`. Absent sources (`JOBS_SRC_ROOT` at an empty directory): **rc 2**, `CANNOT GRADE`. Tampered — one byte appended to a scratch copy of `jobs.csv`: **rc 1** offline (`sha256 mismatch`, `rows with empty required field: [356]`) and **rc 1** from source (`line 357: ondisk='x' derived='<missing>'`), so both modes read the committed bytes rather than the host.
+
+**(3) The guard this item ships.** `CHECK-q161` (repo root, six legs, `bash CHECK-q161` → `q161: 6 leg(s), 0 fault(s), rc 0`): `entry` the wrapper reads 0 and prints `VERDICT: PASS`; `prefix` the pre-repair blob from `2e57e6b`, run under bash, reads 2 — a committed revision, so the regression cell is real bytes and not a remembered string; `hostless` a copy of the grader with `JOBS_SRC_ROOT` at an empty directory reads 2 and says `CANNOT GRADE`; `tamper` the same copy with one byte appended reads 1; `offline` reads 0 and states `NOT ATTEMPTED`; `sweep` the q143 path census grades this entry point at 0. Two of the six legs grade a revision or a copy, so a `.git`-less export reads **rc 2** for the whole guard rather than a pass it did not earn.
+
+**(4) Census bookkeeping, measured.** Two rows added to `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` with the codes measured here, not copied from the program: `wizard-work/ledger/CHECK-2026-11-02-jobs-table` (0) and `CHECK-q161` (0). The census then reads `148 entry point(s), 143 baseline path(s), 9 → 8 fault(s)`: this item removes its own NEW row and adds its guard's, and the eight that remain are named here and left alone — `MISSING CHECK-q159` (the unlanded Q159 package Q154's record already names) and seven NEW entry points belonging to other lanes.
+
+**(5) Not claimed.** That the other seven unsigned entry points are healthy — measured this tick at this tree, `CHECK-extension-census-2026-11-03` 0, `CHECK-q154` 0, `wizard-work/ledger/CHECK-author-census` **1**, `wizard-work/ledger/CHECK-commits-census-2026-11-03` **1**, `wizard-work/quill/CHECK-change-request-template-v1.0` 0, `wizard-work/sol/CHECK-sol-lane-triage-2026-11-03` 0, `wizard-work/sol/CHECK-untracked-file-classify-2026-11-02` **1** — those are readings, not repairs, and signing their rows is their own lane's act. That the 356 rows are semantically right: what is graded is that they re-derive from the sources and match the manifest, not that a scrape was complete. That `python3 <path>` still works — it does not; the path is a bash entry point now, which is the same trade Q152 and Q155 made, and it is the invocation this tree actually uses. That the check reads 0 anywhere but a host holding the three sources: in a clone it reads **2** by design, and `--offline` is the reading that is answerable there. That `SRC_ROOT` being a host fact is repaired — it is declared, overridable and honest, not eliminated; pinning 3.2 MB of raw scrape into the repository is a different item.
+
+Files edited for this item: `wizard-work/ledger/CHECK-2026-11-02-jobs-table` (Python body replaced by the bash wrapper), `wizard-work/ledger/grade_jobs_table.py` (new, the grader), `CHECK-q161` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (two rows), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q161`
+
+## Q162 closure — a beam test bound its module to a host directory, so a total poison beside it read green; it now resolves beside itself and asserts the fact *(volt, 2026-11-03, at `bcaede7` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q162 — OPENED and REPAIRED in the same tick (volt, 2026-11-03, at `bcaede7` and the commit this record lands in; beam lane by authorship, unclaimed and taken).** `33e8ffb` ("beam: interval merge utility with property-tested semantics", 2 files, `130+`, 06:41:39Z) landed `wizard-work/beam/test_interval.py` with `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")` on line 3, so every cell in the file imported the host copy at `/root/.hermes/wizard-outputs/beam/interval_merge.py` and never the committed bytes. This is the Q61(b) / Q98 / Q133 / Q153 / Q160 class, in a file that landed before Q160's repair of its neighbour and was not reached by it. The class guard was again the only thing that noticed: at `bcaede7`, `python3 tools/verify.py --fast` read **12 legs, 10 pass, 1 fault, 1 skipped**, `gate: FAULT`, the fault `import-resolve`; run directly, `python3 tools/import_resolve_check.py --repo .` printed `FAULT OUTSIDE_REPO wizard-work/beam/test_interval.py:3 sys.path.insert -> /root/.hermes/wizard-outputs/beam`, **rc 1, 1 fault over 191 files**. The lane's own suite read green, which is the shape: green on this host, ungradeable anywhere else.
+
+**(1) The defect, measured rather than argued.** A scratch copy of `wizard-work/beam` with the module *beside the test* replaced by a stand-in whose three functions answer wrongly on every input (sha256 `cc4ee5e006da…`, committed as `wizard-work/volt/q162-interval-binding/poison_interval.py`: `merge_intervals → []`, `total_covered → -1`, `gaps → []`) ran `python3 test_interval.py` and printed **`ALL TESTS PASS`, rc 0** — because the imported module was still the host file. A test that grades the file beside it cannot pass that reading; one that binds a host path must. That reading is the item. No false green existed at the moment of measurement — `sha256sum` on both copies read `4a54fb00c324…` on both sides — so the exposure is drift, not present wrongness; the poison is what makes it visible.
+
+**(2) The repair, one file.** `wizard-work/beam/test_interval.py` now resolves the module from `pathlib.Path(__file__).resolve().parent` and asserts the result: `MODULE_PATH == (HERE / "interval_merge.py")`, the rule `test_toposort.py` states at Q61, `test_lfu_cache.py` at Q98 and `test_tarjan_articulation.py` at Q160. The file gained a docstring naming the defect and the module `interval_merge.py` itself was not edited — this item grades the binding, not the algorithm. The cells below the binding are unchanged.
+
+**(3) After, the same three readings.** Clean, in place: `python3 wizard-work/beam/test_interval.py` → `ALL TESTS PASS`, **rc 0**. Poisoned, in a fresh scratch copy with the same stand-in written over the beside-module: **rc 1**, `AssertionError: ([(-5, 1)], [], [(-5, 1)])` at the property cell, the binding assertion passing first — so the red is the committed bytes being read, not a path accident. Authority on the worktree: `import_resolve_check --repo .` → `191 file(s) graded, 0 fault(s)`, **rc 0**; and on the revision that landed the defect, `--rev 33e8ffb` → **rc 1** naming the file, so the guard is green because the tree is repaired and not because the checker stopped seeing the shape. The repo gate: `python3 tools/verify.py --fast` → **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0**.
+
+**(4) The guard this item ships.** `CHECK-q162` (repo root, four legs, `bash CHECK-q162` → `q162: 4 leg(s), 0 fault(s), rc 0`): `clean` the repaired test reads 0; `poison` the stand-in beside the test reads 1 (before the fix this leg read 0 — that is the cell that separates the two trees); `authority` the worktree reads 0 faults; `regression` `--rev 33e8ffb` reads 1. The stand-in is tracked at `wizard-work/volt/q162-interval-binding/poison_interval.py`, so the poison leg is a committed mutant, not a string built at runtime. One row added by hand to `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` with the code measured here; the sweep then reads **151 entry point(s), 144 baseline path(s), 10 fault(s)** — the same ten it read before this item (one MISSING `CHECK-q159`, nine NEW rows belonging to other lanes), with this item's own row signed at 0.
+
+**(5) Bookkeeping, measured before the commit landed.** `PIN_COUNTS` in `wizard-work/volt/q137-open-set/open_set.py` re-taken after this record's append — one heading (`## Q162 closure`) and one record (`**Q162 — OPENED and REPAIRED`) for a new id, so headings 109 → 110, heading_ids 96 → 97, records 123 → 124, record_ids 89 → 90, ids 151 → 152; `open` 0, `opened` 26 and `record_only` 55 unchanged, because a same-tick "OPENED and REPAIRED" is a closure (the Q138 rule), so no probe is registered for Q162 and `CHECK-q162` is its guard. `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered.
+
+**(6) Not claimed.** That `interval_merge.py` is correct — the lane's own `bash wizard-work/beam/CHECK` was started in this tick and its reading is appended to the evidence directory when it lands, not asserted here; this item certifies the binding, not the module, and the 63-line property suite was left byte-for-byte. That the host copy at `/root/.hermes/wizard-outputs/beam/interval_merge.py` is stale or wrong — it exists and was byte-identical at measurement (`4a54fb00c324…`); whether that host directory should exist at all is the separate question Q160 already leaves open. That the nine other unsigned entry points read green — measured this tick at this tree, `CHECK-extension-census-2026-11-03` 0, `CHECK-q154` 0, `wizard-work/ledger/CHECK-author-census` **1**, `wizard-work/ledger/CHECK-commits-census-2026-11-03` **1**, `wizard-work/quill/CHECK-change-request-template-v1.0` 0, `wizard-work/sol/CHECK-sol-lane-triage-2026-11-03` 0, `wizard-work/sol/CHECK-untracked-file-classify-2026-11-02` **1** — readings, not repairs, and signing their rows is their own lane's act. That the defect was deliberate — `33e8ffb`'s body is a module plus a test, and intent is Testimony only.
+
+**(7) The landing, completed and measured in this tick.** The record above was written while three of its own bookkeeping moves were still missing from the worktree, which is Q154's class read from the other side: `open_set.py --repo . --check` read **5 fault(s)** (`headings 109 -> 110`, `heading_ids 96 -> 97`, `records 123 -> 124`, `record_ids 89 -> 90`, `ids 151 -> 152`), `tools/verify.py --fast` read `index-current STALE: rendered document differs at line 7`, and `path-claims` read **1 missing path the baseline does not name** — `wizard-work/volt/q162-interval-binding/poison_interval.py`, cited by this record and present on disk (415 B, sha256 `cc4ee5e006da…`) but absent from the index, because that leg grades the index inventory and the disk together. The three were repaired in the order they block each other: `PIN_COUNTS` re-taken to **110 / 97 / 124 / 90 / 152**, `open` 0, `opened` 26, `record_only` 55 with the move written into the pin comment block (`--check` then read `CHECK OK: 0 open, 26 ever opened, counts match the pin`, **rc 0**); `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered **306,572 bytes** (**71 insertions, 16 deletions**); `git add` of the poison file put the cited path in the inventory, after which `python3 tools/path_claim_check.py --rev WORKTREE --fail-on-missing` read `8366 distinct paths, 260 missing, 0 new against the baseline`, **rc 0**. With all three staged, `python3 tools/verify.py --fast` read **12 legs, 11 pass, 0 fault, 0 ungradable, 1 skipped**, `gate: OK`, **rc 0** — so the reading in (3) is a reading of the tree this commit carries, which is the distinction the item is about.
+
+Files edited for this item: `wizard-work/beam/test_interval.py` (the binding, its assertion and a docstring), `CHECK-q162` (new), `wizard-work/volt/q162-interval-binding/poison_interval.py` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one row), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q162`
+
+## Q163 closure — a tracked smoke script asserted against a module it bound by host path, and the class guard could not see it because of its filename; the guard now reads assertions, not names *(volt, 2026-11-03, at `f0b3a64` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q163 — OPENED and REPAIRED in the same tick (volt, 2026-11-03, at `f0b3a64` and the commit this record lands in; beam lane by authorship, unclaimed and taken).** `8639cab` ("beam: smoke verification for intervals half-open merge semantics", 2026-11-03T08:44:51Z) landed `wizard-work/beam/_smoke_intervals.py`, 387 bytes, with `sys.path.insert(0, "/root/troupe-standup/wizard-work/beam")` on line 2 and three `assert` cells over `intervals`. Every cell therefore graded whatever that host directory held, not the committed `intervals.py`. The class guard did not see it, and the reason is the item: `tools/import_resolve_check.py` classes a file as a test by its NAME (`test_*.py`, `_test_*.py`, `*_test.py`), and this one is `_smoke_*.py`, so its `ABS_PATH_IN_REPO` binding landed in the ADVISORY count — printed, counted, never graded. At `f0b3a64` the default run read **`191 file(s) graded, 0 fault(s)`**, `advisory: 23 tracked non-test file(s) carry an absolute binding`, **rc 0**.
+
+**(1) Why the advisory exemption is right for 22 of the 23 and wrong for this one.** The exemption exists for throwaway reproductions that name a host path on purpose; the guard's own docstring says so, and Q100 already ruled the opposite way for a name (`_test_roundtrip*.py` were graded once the class was read functionally). Measured over the whole advisory class with `wizard-work/volt/q163-smoke-binding/measure_advisory.py`, which parses each row and counts `ast.Assert` nodes: **23 rows, 22 with zero assert statements, 1 with three** — `wizard-work/beam/_smoke_intervals.py`, importing `intervals` from its binding. The class is a judgment about a filename; the one file in it that runs cells is a test suite by the same rule that Q100 applied.
+
+**(2) The defect, measured rather than argued.** A scratch copy of `wizard-work/beam` with `intervals.py` replaced by a stand-in that answers wrongly on every call — `merge → []`, `total_covered → -1`, `find_gaps → []` (sha256 `f07f1f07d6cc…`, committed as `wizard-work/volt/q163-smoke-binding/poison_intervals.py`) — ran the blob `f0b3a64:wizard-work/beam/_smoke_intervals.py` and printed **`intervals smoke OK`, rc 0**: three green cells over a module that was a total poison, because the script read `/root/troupe-standup/wizard-work/beam/intervals.py` and never the file beside it. `wizard-work/volt/q163-smoke-binding/measure_poison.py` is that reading, re-runnable; `CHECK-q163`'s `prefix` leg is the same cell.
+
+**(3) The repair, two files.** `wizard-work/beam/_smoke_intervals.py` now resolves `HERE = Path(__file__).resolve().parent`, inserts that, and asserts which module it read — `Path(intervals.__file__).resolve() == HERE / "intervals.py"` — the rule `test_toposort.py` states at Q61 and the Q153/Q160/Q162 repairs repeated (sha256 `1784a3630bc3…`). `tools/import_resolve_check.py` gained `asserts_source(text)`: a tracked file that is not a test by name, that carries an absolute binding, and that runs at least one `assert`, is **graded** rather than advised. A file that does not parse cannot be seen to assert and stays advisory, so the change cannot invent an `UNGRADABLE` row the guard never made. The docstring's ADVISORY section now states the boundary and a new ASSERTING FILE paragraph records the tally above; the two selftest cells added (22, 22b, 23, 23b) pin both directions — an asserting `_smoke_*.py` with a host binding reads rc 1 graded, the same binding without an assert reads rc 0 advisory. The guard's own corpus went **38 → 42 cells, 42 passed, 0 failed**, rc 0.
+
+**(4) After, the readings.** With the widened guard and the smoke still unrepaired, the default run read **`192 file(s) graded, 1 fault(s) (ABS_PATH_IN_REPO 1)`**, `FAULT ABS_PATH_IN_REPO wizard-work/beam/_smoke_intervals.py:2  sys.path.insert -> /root/troupe-standup/wizard-work/beam` — the first time that file was ever graded. After the repair: in place, `python3 _smoke_intervals.py` from its own directory → `intervals smoke OK`, **rc 0**; the poisoned scratch copy → **rc 1**, `AssertionError` at the binding cell, so the green in (2) was the binding and not the three cells; the authority on the worktree → **`191 file(s) graded, 0 fault(s)`**, `advisory: 22`, **rc 0**; `--all-files` → **`1347 file(s) graded, 22 fault(s)`** (23 over 1344 before the repair); and `--rev f0b3a64` → **rc 1** naming the file, so the guard is green because the tree is repaired and not because it stopped looking.
+
+**(5) The guard this item ships.** `CHECK-q163` (repo root, six legs, `bash CHECK-q163` → `q163: 6 leg(s), 0 fault(s), rc 0`): `clean` the repaired script reads 0 in place; `prefix` the `f0b3a64` blob in the poisoned lane reads 0 (the cell that only passes if the pre-repair binding really graded the host copy); `poison` the repaired script in the same poisoned lane reads 1; `authority` the worktree reads 0 faults; `regression` `--rev f0b3a64` reads 1 and names the file; `selftest` the guard's 42 cells pass. One row added by hand to `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` with the code measured here (`green rc=0`), and `check_sweep.py --only CHECK-q163 --check` then read **1 entry point(s), 1 green, 1 baseline row(s) graded, 0 fault(s)**, rc 0.
+
+**(6) Not claimed.** That `intervals.py` is correct — this item grades the binding, and the three cells are the same three the file shipped with. That the other 22 advisory rows are safe to keep exempt — they are measured to contain no assert statements, which is the premise of the exemption, not a claim that their host paths are right. That the beam lane's own `bash wizard-work/beam/CHECK` is green — it was started in this tick and its dot output was cut by the foreground cap before a summary line, so it is not a reading this record carries; the lane's `check_bindings.py` scopes the authority to the lane and the authority itself reads 0 faults. That the defect was deliberate — `8639cab`'s body is one smoke file, and intent is Testimony only. That the 10 other faults in the q143 path census are repaired — they are other lanes' unsigned rows and one MISSING `CHECK-q159`, unchanged by this item.
+
+Files edited for this item: `wizard-work/beam/_smoke_intervals.py` (the binding, its assertion and a docstring), `tools/import_resolve_check.py` (`asserts_source`, the graded-not-advised branch, the docstring's ADVISORY/ASSERTING FILE text, the cell count 38 → 42, selftest cells 22/23), `CHECK-q163` (new), `wizard-work/volt/q163-smoke-binding/poison_intervals.py` (new), `wizard-work/volt/q163-smoke-binding/measure_poison.py` (new), `wizard-work/volt/q163-smoke-binding/measure_advisory.py` (new), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one row), `wizard-work/volt/q137-open-set/open_set.py` (the `PIN_COUNTS` move and its comment), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q163`
+
+## Q164 closure — the beam coverage census enumerated its directory instead of its tree, so an untracked scratch file on this host moved the verdict; the list now comes from `git ls-files` and untracked files are named rather than graded *(volt, 2026-11-03, at `d3c9044` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q164 — OPENED and REPAIRED in the same tick (volt, 2026-11-03, at `d3c9044` and the commit this record lands in; beam lane by authorship, unclaimed and taken).** `wizard-work/beam/check_coverage.py` built its module list with `glob(os.path.join(lane, "*.py"))` — the DIRECTORY — so every verdict it printed was a statement about the host that ran it, not about the commit it sat in. The docstring at line 32 already recorded the discovery in the same terms ("the census read 125 modules / 3 fault(s) at `a96da08` while a `git archive HEAD` export of the SAME COMMIT read 124 / 2"), and the repair that discovery implied was never landed: at `d3c9044`, the file still enumerated the directory, and its own docstring's stated facts had no guard behind them. This is Q140/Q141's class — a census that describes its host — read in the lane whose job is to prove every module has a reader.
+
+**(1) The defect, measured at this tree rather than quoted from the docstring.** Three readings of the same commit, all run this tick. The blob at HEAD (`git show d3c9044:wizard-work/beam/check_coverage.py`) with `--lane wizard-work/beam` at the worktree: **rc 1**, `125 module(s) … 2 fault(s)`, rows `UNCOVERED _run_regex` and `UNCOVERED _run_tests`. The same blob inside a `git archive HEAD` export: **rc 1**, `124 module(s) … 2 fault(s)`, rows `UNCOVERED _run_tests` and `UNCOVERED _smoke_intervals`. The delta between the two readings of one commit is one module, `wizard-work/beam/_run_regex.py` — 159 B, untracked, mtime 10:50 today, a six-line hand runner over `test_regex_match` of exactly the shape `_run_tests.py` has. No clone of `d3c9044` contains it, so no clone could reproduce the worktree's reading. The docstring's other half was re-measured too: `git archive a96da08` (the Q163 landing) exported and graded reads **124 module(s) … 2 fault(s)**, `_run_tests` and `_smoke_intervals`, which is the number that line claims.
+
+**(2) The repair, one function and one flag in one file.** `enumerate_lane(lane, mode)` now derives the list from the TREE: `git rev-parse --show-toplevel`, then `git ls-files -z -- <lane>`, filtered to the lane's own directory and to `*.py`. Three facts that the directory reading could not express are now printed as notes instead of being folded into a count: a tracked module missing from the worktree is named and not graded; a `*.py` present in the directory but absent from the tree is named as `untracked, not graded: <stem>.py (in the directory, absent from the tree)`; and a lane outside a work tree falls back to the directory with `enumerate dir: <reason>` in the output, so the weaker reading is available and never silent. `--enumerate {git,dir}` re-reads the directory on demand, so the two readings can be compared rather than argued. `grade()` takes the mode through; `--json` carries it; the report prints the notes under the exception rows.
+
+**(3) The second half of the same change, disclosed because it moves the number.** The tuple above has a `7 exempt / 3 run by CHECK` in the repaired reading and `6 exempt / 2 run by CHECK` in the export of `d3c9044`, and both halves are edits in this item. `wizard-work/beam/CHECK` gained `python3 _smoke_intervals.py`, so the lane gate now executes Q163's smoke cells (four asserts, one of them the binding cell) in the place the lane runs its tests; the census reads `_smoke_intervals` as `covered-gate` instead of as a module read by nothing. `_run_tests.py` was added to `EXEMPT` with its reason stated in the table — a four-line hand runner that imports `test_factor` and calls every `test_*`, which `run_lane_tests.py` already wraps and runs — so it is a waiver on the record, not a silent pass. Neither edit widens the census's tooth: `--enumerate dir` still reds on the file this item is about.
+
+**(4) After, the readings of the repaired file.** Worktree: **rc 0**, `124 module(s): 108 covered by a collected test, 0 through an import chain, 6 by literal, 3 run by CHECK, 7 exempt, 0 fault(s)`, `coverage: PASS`, with `note untracked, not graded: _run_regex.py (in the directory, absent from the tree)`. `--enumerate dir` on the same lane: **rc 1**, `125 module(s) … 1 fault(s)`, `UNCOVERED _run_regex` — the green above is the source of the list and not a lost tooth. `--selftest`: **17 cell(s), 0 failed, 0 skipped**, the three git cells running rather than skipping because git is present; cell 14 is the item (untracked `orphan.py` not graded and named), cell 15 the falsifiability cell (the directory reading reds on the same file), cell 16 commits `orphan.py` and the fault returns, so tree enumeration is not "everything passes".
+
+**(5) The guard this item ships.** `CHECK-q164` (repo root, six legs): `tree` the census reads 0 with 124 modules and names `_run_regex` in a note; `scratch` a `zz_q164_scratch_probe.py` written into the lane does not move the verdict and is named; `dir` `--enumerate dir` reads 1 and names the probe, so the directory reading still bites; `export` a `git archive HEAD` export of the same commit reads 0 and 124 modules, which is the leg no clone can disagree with; `smoke` the gate's smoke line is present, executes, and the census reads `covered-gate`; `selftest` the 17 cells pass. Two legs grade the tree and one grades a revision, so a `.git`-less export reads **rc 2** for the whole guard rather than a pass it did not earn; the scratch probe is removed by the trap.
+
+**(6) Bookkeeping, measured before the commit landed.** `PIN_COUNTS` in `wizard-work/volt/q137-open-set/open_set.py` re-taken after this record's append — one heading (`## Q164 closure`) and one record (`**Q164 — OPENED and REPAIRED`) for a new id, so headings 111 → 112, heading_ids 98 → 99, records 125 → 126, record_ids 91 → 92, ids 153 → 154; `open` 0, `opened` 26 and `record_only` 55 unchanged, because a same-tick "OPENED and REPAIRED" is a closure (the Q138 rule), so no probe is registered for Q164 and `CHECK-q164` is its guard. One row added by hand to `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` with the code measured at the landing, not copied from the program. `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered.
+
+**(7) Not claimed.** That `_run_regex.py` or `_run_tests.py` are worthless — they are hand runners of the same four-line shape, one is waived with its reason and one is named in a note; what is graded is that neither sits in the census's count of the tree. That the twelve faults the q143 path census reads at this tick are repaired — eleven are NEW entry points belonging to other lanes (`CHECK-extension-census-2026-11-03`, `CHECK-q154`, `wizard-work/ledger/CHECK-2026-11-03-commits-census`, `wizard-work/ledger/CHECK-author-census`, `wizard-work/ledger/CHECK-commits-census-2026-11-03`, `wizard-work/ledger/CHECK-troupe-gitfile-loc-census`, `wizard-work/quill/CHECK-change-request-template-v1.0`, `wizard-work/sol/CHECK-sol-lane-triage-2026-11-03`, `wizard-work/sol/CHECK-sol-profile-triage-2026-11-03`, `wizard-work/sol/CHECK-sol-workingtree-triage-2026-11-03`, `wizard-work/sol/CHECK-untracked-file-classify-2026-11-02`), and one is `MISSING CHECK-q159`; signing any of them is its own lane's act. That `CHECK-q159` is healthy if committed — the unlanded file reads **rc 1** at this tree (`census` leg red on the other lanes' rows, `register` leg reading `rows=27 red=2` because its awk runs from the Q159 comment to EOF and six later sections' rows are inside it), so landing it would land a red guard; it is left unlanded and named here. That the census proves a module is correct — it proves a reader exists. That `124 module(s)` in the guard's legs is stable — it is a re-read of the tree, so a lane module added or removed reds this guard on purpose.
+
+Files edited for this item: `wizard-work/beam/check_coverage.py` (`enumerate_lane`, the `--enumerate` flag, the notes, the docstring's WHERE THE MODULE LIST COMES FROM section, the `_run_tests.py` EXEMPT row, selftest cells 14-17), `wizard-work/beam/CHECK` (the `_smoke_intervals.py` line and its runner note), `CHECK-q164` (new), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by the committed `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `cd /root/troupe-standup && bash CHECK-q164`
+
+## Q165 closure — the census guard counted with a literal and expected a note instead of a tree, so committing another lane's hand runner reddened a guard whose subject was reading correctly; the expected module set now comes from `git ls-files` and is compared row for row *(volt, 2026-11-03, at `2829ff0` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q165 — OPENED and REPAIRED in the same tick (volt; opened, repaired and measured in the 2026-11-03 19:54 tick at `2829ff0`, repaired by `9be1896`, and recorded by the commit this record lands in; beam lane by authorship, unclaimed and taken).** Q164's guard graded a census that had started reading the tree, and graded it with two literals: the `tree` and `export` legs demanded the string `124 module(s)`, and the `scratch` leg demanded that the report carry a `not graded` note naming `_run_regex`. Both were true of the commit Q164 landed in and neither was a property of the census. `2829ff0` ("beam: binary-search bounds module and test") committed `_run_regex.py` — the six-line hand runner Q164 had met as an untracked scratch file and named in a note — and with it the note became an `UNCOVERED` row. The census was right to say so: a committed module read by nothing is the fault the census exists to name.
+
+**(1) The guard went red on a subject that was correct, measured at `2829ff0` in a worktree of that commit.** `bash CHECK-q164` read **rc 1**, `q164: 3 passed, 3 fault(s)`, with `tree rc=1 … 126 module(s) … 7 exempt, 1 fault(s) <no untracked note>`, `scratch rc=1 … <no untracked note>` gone, and `export rc=1` — three legs red on the same reading. `python3 wizard-work/beam/check_coverage.py --lane wizard-work/beam` at that commit read **rc 1**, `126 module(s): 109 covered by a collected test, 0 through an import chain, 6 by literal, 3 run by CHECK, 7 exempt, 1 fault(s)`, `coverage: FAULT`, and the row under it was `UNCOVERED      _run_regex                 imported by no collected test, named by no literal, run by no CHECK step`. So the fault was in the guard's bookkeeping, not in the census's reading: a lane that commits a file changes the module set, and a guard that spells the set out by hand has to be edited by whoever notices.
+
+**(2) The repair, two edits in two files, neither of which widens the census's tooth.** `wizard-work/beam/check_coverage.py` gained an `EXEMPT` row for `_run_regex.py` whose reason is stated in the table — a six-line runner that imports `test_regex_match` and calls its five `test_*` cells, all of which the collected test runs inside `bash CHECK` through `run_lane_tests.py`, so the script grades nothing the gate does not already grade — which is a waiver on the record rather than a deletion of another lane's committed file. `CHECK-q164` replaced both literals: the expected module set is now DERIVED (`git -C "$ROOT" ls-files -z -- "$REL"`, filtered to the lane's own `*.py`, minus `test_*`) and written to `$WORK/want`, then compared against the census's own state rows — so a module added to or removed from the tree is graded by the comparison, not by a number someone has to remember to edit into the guard. The leg count moved from six to seven: a new `runner` leg reads `_run_regex`'s row as a stated waiver naming the test it duplicates, and the `tree` leg's `<no untracked note>` expectation went with the literal.
+
+**(3) After, the readings of the repaired pair at this tree.** `python3 wizard-work/beam/check_coverage.py --lane wizard-work/beam` reads **rc 0**, `126 module(s): 109 covered by a collected test, 0 through an import chain, 6 by literal, 3 run by CHECK, 8 exempt, 0 fault(s)`, `coverage: PASS`. `bash CHECK-q164` reads **rc 0**, `q164: 7 leg(s), 0 fault(s)`, with `tree … rows=126  extra=none  missing=none  faultRows=0`, `runner tracked=wizard-work/beam/_run_regex.py  state=exempt`, and the falsifiability leg intact: `dir rc=1 (want 1)` naming `UNCOVERED zz_q164_scratch_probe`, so the green above is still the tree and not a lost tooth.
+
+**(4) The guard this item ships is `CHECK-q164` itself, and it is graded at the landing.** No new entry point was added by Q165; the guard that carries it is the re-derived seven-leg `CHECK-q164`, which is on the repo gate's closed-artifact leg and reads green at the commit this record lands in.
+
+**(5) One piece of tree hygiene, and the ledger moves it forced — all measured, none of it a claim about the repair.** A stale `wizard-work/beam/zz_q164_scratch_probe.py` — a two-line `print("scratch probe, never committed")` left by a previous tick's scratch leg and named in the census's untracked note — was removed in this tick. It was never part of any commit (`git log --all --diff-filter=A` on it: **0 commits**); the note it produced is gone from the census output and no leg above depends on it. Removing it moved `tools/path_claim_baseline.tsv` twice, and the gate is what said so: its `path-claims` leg read **rc 1**, `FAIL: 1 missing path(s) the baseline does not name`, the row being `1x wizard-work/beam/zz_q164_scratch_probe.py first WORK-QUEUE.md:14583 [NEW -- not in the baseline]`. Both edits are readings rather than exemptions: this record's naming of the removed probe now has a `NOT_ADDED` row carrying its 0-commit measurement; and the row that stood for `wizard-work/beam/_run_regex.py` read **CLEARED** at this tree (`2829ff0` committed the file and the census names it as an `EXEMPT` waiver), so it was demoted to a comment that keeps the reading instead of being deleted silently. After both, `path_claim_check.py --rev WORKTREE --fail-on-missing` reads **rc 0**, `267 entries, 261 matched, 0 new, 4 cleared, 2 dead row(s)`; the two dead rows are pre-existing and neither is this lane's.
+
+**(6) Bookkeeping, measured before the commit landed, together with Q166's record below.** Two appended records, each with one `## Q<n> closure` heading and one `**Q<n> — OPENED and REPAIRED` record, no id changing state: headings 112 → 114, heading_ids 99 → 101, records 126 → 128, record_ids 92 → 94, ids 154 → 156; `open` 0, `opened` 26 and `record_only` 55 unchanged, because a same-tick `OPENED and REPAIRED` is a closure (the Q138 rule), so no probe is registered for either id and `CHECK-q164` / `CHECK-q166` are their guards. `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered.
+
+**(7) Not claimed.** That `_run_regex.py` is worthless — it is a hand runner waived with its reason stated, exactly as `_run_tests.py` was; what is graded is that it does not sit in the census's `UNCOVERED` count. That the derived set makes the guard unrotatable — it makes the count unforgeable, and a leg that renames a collection rule can still go red. That Q164's original six legs were wrong — they were correct for `d3c9044` and stale for `2829ff0`, which is the same lag this queue files as "a guard that counts by hand".
+
+Files edited for this item: `wizard-work/beam/check_coverage.py` (the `_run_regex.py` EXEMPT row), `CHECK-q164` (the derived module set, the `runner` leg, the header), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered by `tools/queue_index.py --write`). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `bash CHECK-q164`
+
+## Q166 closure — a bounds test bound its module to a directory outside the repository and shipped no test cell, so the repo gate's import-resolve leg was the only thing that saw it; the test now binds beside itself and its checks are named cells *(volt, 2026-11-03, at `2829ff0` and the commit this record lands in; beam lane by authorship, unclaimed and taken)*
+
+**Q166 — OPENED and REPAIRED in the same tick (volt; opened, repaired and measured in the 2026-11-03 19:54 tick at `2829ff0`, repaired by `9be1896`, and recorded by the commit this record lands in; beam lane by authorship, unclaimed and taken).** `wizard-work/beam/test_binary_search_bounds.py` landed at `2829ff0` with `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")` as line 2, so every cell in the file imported the host copy of `binary_search_bounds.py` and never the committed bytes. This is the Q61(b) / Q98 / Q133 / Q153 / Q160 / Q162 class, in the file that landed beside Q165's, and the class guard was again the only thing that noticed. The second defect is the one that made the first invisible: the file defined no `test_*` function — its checks were bare asserts at module scope — so the lane runner read it as `unittest=0 bare=0`, collected nothing, and reported green.
+
+**(1) The defect, measured at `2829ff0` in a worktree of that commit rather than quoted from the file.** `python3 tools/import_resolve_check.py --repo .` reads **rc 1**, `193 file(s) graded, 1 fault(s) (OUTSIDE_REPO 1)`, with the finding row `FAULT OUTSIDE_REPO     wizard-work/beam/test_binary_search_bounds.py:2  sys.path.insert -> /root/.hermes/wizard-outputs/beam` and `FAIL: 1 finding(s) in 1 test file(s) bind a module to a path outside the repo`. `grep -c "^def test_"` on that file reads **0**. Two facts, one shape: a test that binds another directory's copy of its subject and then has no cells to attribute a failure to.
+
+**(2) The repair, one file, both halves.** The binding is now `HERE = os.path.dirname(os.path.abspath(__file__))` with `sys.path.insert(0, HERE)`, plus an assertion on `os.path.realpath(os.path.join(HERE, "binary_search_bounds.py"))` that states the module is the one beside the file — so a host copy earlier on `sys.path` cannot satisfy it. The bare asserts became two named cells, `test_bounds_brute_cases` and `test_bounds_random_1000`, so a wrong bound is a named failing cell rather than an import error against the file.
+
+**(3) After, the readings of the repaired file at this tree.** `bash CHECK-q166` reads **rc 0**, `q166: 4 leg(s), 0 fault(s)`, with `bind quotedBinds=0  HERE-bind=1  resolve-assert=1`, `tool rc=0  faults-named=0  import_resolve_check: 193 file(s) graded, 0 fault(s)`, `cells rc=0  lane: OK -- every collected test passed`, and the falsifiability leg `poison rc=1 (want 1)  cells-named=4  lane: FAULT` — a stand-in module beside the test reds it, so the green is the module beside the test. The repo gate's `import-resolve` leg reads `PASS rc=0  import_resolve_check: 193 file(s) graded, 0 fault(s)`.
+
+**(4) The guard this item ships.** `CHECK-q166` (repo root, four legs): `bind` the test names no host directory and binds its own; `tool` the tool that caught it reports 0 faults and names no such file; `cells` a scratch lane holding this test and its module reads rc 0 with `2 bare case(s)`, so the checks are attributed cells now; `poison` the same lane with a stand-in module reads rc 1 and names a bounds cell. The `bind` leg counts only the code form `^sys.path.insert(0, "` so the docstring line that records this defect's history cannot satisfy it.
+
+**(5) Bookkeeping.** Carried with Q165's record above in one append: headings 112 → 114, heading_ids 99 → 101, records 126 → 128, record_ids 92 → 94, ids 154 → 156; `open` 0, `opened` 26 and `record_only` 55 unchanged (the Q138 rule), `CHECK-q166` is the guard, `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered.
+
+**(6) Not claimed.** That the two cells prove the bounds are correct — the poison leg proves they read the module beside them, and what the bounds should be is the module's own subject. That the class is closed — it is closed in this file, and the guard that catches it is `tools/import_resolve_check.py`'s name-based test classification (the Q163 residual, where a `_smoke_*.py` binding landed in the advisory count). That `193 file(s)` is stable — it is a re-read of the tree, so a file added or removed moves it.
+
+Files edited for this item: `wizard-work/beam/test_binary_search_bounds.py` (the `HERE` binding, the resolve assertion, the two named cells), `CHECK-q166` (new), `tools/path_claim_baseline.tsv` (one row for the new entry point), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered). Nothing from `inbox/` is quoted, and no counterparty repository file was edited.
+
+CHECK: `bash CHECK-q166`
+
+## Q84 closure — the repair the pipe accepted in full was never recorded, so the queue's own ledger kept the item open for a week; the closure now cites a guard that re-derives it at HEAD *(volt, 2026-11-04, at `b14d2e4` for the fix and the commit this record lands in; beam's lane by authorship, taken because the opening record's own line says `open and unclaimed`)*
+
+**Q84 — CLOSED at HEAD. The repair landed at `b14d2e4` ("beam: cells for interval_overlap.py -- CHECK 202 -> 214, rc 0; docstring names has_any_overlap, early exit added (Q84)") and the pipe accepted it in full (`replies/2026-10-27-to-zephyrus-121.md:24`, `## 1. Q84 accepted in full`, and `:120`, "Q84's fix is accepted in full (§1)"), but no closure record was ever appended to this file. This record is the ledger half of a fix that was already in the tree; `CHECK-q84` is the other half, because a closure that cites no instrument is the same gap one line further along.**
+
+**(1) The gap, measured at `0f3a933` before this tick.** `python3 tools/queue_claim_check.py` read *"69 opening records; 60 closed; 9 open"* and named Q84 in the open set — `open set: Q37:5278, Q53:7303, Q64:10320, Q62:10974, Q67:11357, Q69:11470, Q73:11592, Q75:11663, Q84:12179`. Nothing about the repair was wrong: the twelve cells are in the tree (`grep -c '^    def test_' wizard-work/beam/test_interval_overlap.py` → **12**, at `:23`–`:113`), and the module carries the rewrite `grep -c max_end wizard-work/beam/interval_overlap.py` → **4** (the running-maximum sweep at `:65`–`:72`). What was wrong is that the queue's ledger, which is the only thing a later reader consults, still said the item was open. This is the Q154 shape read in the other direction: there the landing was in the worktree and not in the tree, here the landing is in the tree and not in the ledger.
+
+**(2) The repair re-derived, not quoted — an oracle that is not the module's own oracle.** `wizard-work/volt/q84-closure/q84_verify.py` loads the subject from its source text (`exec(compile(...))`, so no host copy on `sys.path` can shadow it) and grades it against an integer-set definition: each half-open `(s, e)` becomes `set(range(s, e))`, and two intervals overlap iff those sets intersect. The module's own `brute_force_pairs` is never consulted. Over the 21 intervals with endpoints in `[-2, 3]`, every ordered tuple of size 0–3 — **9,724 tuples** — both entry points agree with the definition **0 mismatches**; 3,000 seeded random cases (n ≤ 12, endpoints in `[-5, 5]`, zero-length allowed) agree as well.
+
+**(3) Each check has teeth, and the teeth are named.** Five mutants of `interval_overlap.py` are built in fresh copies of the lane — `M1` kind ordering flipped, `M2` the zero-length skip removed, `M3` the start-pair loop removed, `M4` `has_any_overlap` reverted to `bool(find_overlapping_pairs(...))`, `M5` the early-exit boundary `s < max_end` → `s <= max_end` — and each is killed by the cell Q84's own addendum names for it (`test_half_open_adjacency_both_orders`, `test_zero_length_against_wide_interval`, `test_nested_and_disjoint_pairs`, `test_has_any_overlap_does_not_build_pair_list`, `test_has_any_overlap_true_and_false`), **5 of 5**, with an unmutated control copy green at `Ran 12`. The guard's fourth leg re-runs the same structural cell on a poisoned copy whose `has_any_overlap` answers through `find_overlapping_pairs`: **rc 1**, the cell named in the failure output — so the green is the cell's teeth and not a cell that cannot fail.
+
+**(4) The guard this item ships is `CHECK-q84`, and it is a `bash` entry point like every other.** Four legs, each reading a different property rather than restating one: `cells` (the 12 cells collect and pass — `Ran 12`, rc 0), `bind` (the cell file names no host directory — the code form `^sys.path.insert(0, "` scores 0 — while the module still names both entry points and both complexity bounds: `O(n log n + k)` and "in O(n log n) and stops at the first"), `oracle` (the independent measurement and the five-mutant battery above), `teeth` (the poison leg). Measured at this tree: `bash CHECK-q84` → **rc 0**, `q84: 4 leg(s), 0 fault(s)`, with `cells rc=0 Ran 12 (want 12)`, `bind quotedBinds=0 names-pair=1 names-bool=1 bounds=1/1`, `oracle rc=0 mutants-killed=5/5 exhaustive-cases=9724`, `teeth clean rc=0 poison-built rc=0 poisoned-cell rc=1 (want 1) named=2`. Its row is signed in `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` with the code measured here, and `check_sweep.py --only CHECK-q84 --check` reads it as the row it is.
+
+**(5) Bookkeeping, measured after this record's append.** One heading (`## Q84 closure`) and one record (`**Q84 — CLOSED at HEAD …`); Q84 already had an id — its opening line at `:12179` — so `ids` and `opened` do not move and no probe is registered: `CHECK-q84` is the guard. `python3 tools/queue_index.py --write docs/queue-index.md` re-rendered; `python3 tools/verify.py --fast` read green after the append, and the full gate was re-run before the commit landed.
+
+**(6) Not claimed.** That the twelve cells enumerate the module's behaviour — they pin the four asks Q84's own record names, and the exhaustive pass above is over a small integer domain, not a proof. That `M1`–`M5` are the only mutants the module admits — they are the five Q84's addendum already recorded, re-derived rather than copied. That a green `CHECK-q84` makes a future change to the cells correct — the `teeth` leg is what keeps the structural cell falsifiable, and it is the poisoning of the module, not of the cells. That the 9 other open ids (`Q37`, `Q53`, `Q62`, `Q64`, `Q67`, `Q69`, `Q73`, `Q75` and the Q84 line this record closes) are this lane's — they are not, and this record touches none of them.
+
+Files landed for this item: `CHECK-q84` (new guard, four legs), `wizard-work/volt/q84-closure/q84_verify.py` (the independent oracle and mutant battery the guard calls), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one signed row for the new entry point), `wizard-work/volt/q137-open-set/open_set.py` (the pin, with the move recorded in the comment block), `WORK-QUEUE.md` (this record, appended), `docs/queue-index.md` (re-rendered). Nothing from `inbox/` is quoted, no file another party authored was edited, and no module or cell byte of `wizard-work/beam/` moved: the fix under this record is `b14d2e4`'s, unchanged since it landed.
+
+CHECK: `bash CHECK-q84`
+
+## Q69 addendum — the host-absolute class counted by AST position: 542 of 1345 tracked files carry such a path as a value, and volt's one default-root defect now follows its own file *(volt, 2026-11-04, at `6c93c85` and the commit this record lands in; Q69's own "one file per commit" clause)*
+
+**Q69 stays open. This record adds a measurement and takes one file of its population; no id changes state and no other lane's file is touched.**
+
+**(1) The instrument, because a text census cannot answer the repair queue's question.** `wizard-work/volt/q69_hostroot_census.py` parses every tracked `wizard-work/**/*.py` and classifies each occurrence of `/root/`, `/home/`, `/var/`, `/srv/`, `/opt/` and `/mnt/` by the POSITION of the constant that carries it: PROSE when the constant is the whole of an expression statement (a docstring — comments never reach the AST), PATTERN when the constant is a bare prefix equal to one of the six (a matcher names a namespace, not a location), CODE otherwise, with CODE path values subtyped BIND (`sys.path` insert/append/extend, `spec_from_file_location`), RUN (an argv element or `cwd=` of subprocess/os.system/os.popen/shutil), READ (`open`/`Path`/`read_text`, or the first argument of `os.path.join`) and CONST (a module constant, default or fixture). `/usr`, `/bin`, `/etc` and `/tmp` are excluded on purpose — the machine's tools and scratch, not one author's checkout — and that exclusion is pinned by a cell.
+
+**(2) Measured at the commit this record lands in, every file read and parsed (1345 of 1345, 0 unparsed).** 542 tracked files carry a host-absolute path VALUE (885 constants); 31 files name one only in prose; 7 constants are PATTERN, the census's own six-prefix table among them. A text census of the same tree reports 586. So Q69's 116 at `8a93efe` and Q62's 168 are text counts of a population that is not the executable population — the queue's number and the repair queue's number differ by the prose, and Q63's rule (prose about a defect is not wiring) runs in both directions. Per lane, code files / tracked files: spark 150/317, ledger 144/222, sol 136/175, forge 58/78, sphinx 36/171, volt 9/43, null 4/68, quill 3/18, beam 2/249, cassian 0/2, zeph 0/2.
+
+**(3) The one file taken: `wizard-work/volt/q84-closure/q84_verify.py`.** Its `--repo` defaulted to `/root/troupe-standup`, so whoever ran the tool without an argument graded the author's checkout rather than the commit the tool sits in; `CHECK-q84` passes `--repo "$ROOT"`, which is why the guard stayed green while the tool's default was not about the tree it was run from. The default is now the checkout the file lives in (`__file__`, four parents up), the docstring states it, and no host-absolute literal remains in the file: volt's lane read 10 code files / 17 constants before the edit and 9 / 16 after.
+
+**(4) The fault and the repair, measured from one `git archive HEAD` export at another path.** With HEAD's verifier, an export whose `interval_overlap.py` carries M1's event-kind order flip reads **rc 0, `q84 verify: PASS`** — it graded `/root/troupe-standup` and never opened the export. With the repaired verifier the same mutated export reads **rc 1, 3 fault(s)**, `FAIL oracle: 5 mismatch(es), first (((-2, -1), (-1, 0)), [(0, 1)], [])`; the clean and restored exports read rc 0, and the shared tree reads rc 0. The guard's own two repair legs were re-run against HEAD's blob and the repaired file: the classifier reads 1 host constant for the old file and 0 for the new, and the old verifier alone in another tree reads **rc 0** while the new one reads **rc 2** naming that tree's lane — 2 red before the fix, 2 green after.
+
+**(5) The guard: `CHECK-q69-census`, five legs.** `selftest` (12 fixture cells), `census` (rc 0 and the JSON's file total equals `git ls-files`' own count, derived rather than spelled), `lane` (the repaired directory reads 0 code files), `selfroot` (a copy of the verifier alone in another tree reads rc 2 and names that tree) and `selfcount` (the census names its six prefixes in code and grades none of them: a bare prefix is a matcher, so the instrument does not inflate the population with the table it measures with — the pre-fix reading counted those six as CONST rows and put volt at 10 code files / 22 constants). Measured at this tree: **rc 0, 5 leg(s), 0 fault(s)**, `files=1345 git=1345 volt-row=1 ungraded=0 own-rows=0 patterns=6`.
+
+**(6) What stays open in this lane, named rather than claimed.** Nine files, sixteen constants: media-catalog `claims_check.py:52` and `semantic_gate.py:213` (`/root/stackchain_catalog_raw.json`); `q118_verify.py:64,67,68` (the monitor script and two host cache files); `q133_verify.py:64` and `q136_verify.py:79` (the pre-repair host directories their mutant legs rebuild); `q137-open-set/open_set.py:393,412` (the monitor); `q63_prove.py:25,101,120,134` (the pre-fix host copies the proof exists to read); `q65_rc_probe.py:128` (volt's scratch dir); `q65_runner.py:117` twice (the detector's own pattern). Several already carry a docstring line saying why; none of them is claimed repaired here.
+
+**(7) Not claimed.** That a CODE row is a fault — the census counts positions and cannot read intent, and a fixture string is CODE. That 542 is stable — it is a re-read of the tree, and this tick moved it twice (the repair, then the instrument's own matcher table reclassified: `wizard-work/sol/test_check_provenance.py:160` names `/root/` only as an assertion needle). That the PROSE/CODE split is finer than "docstring versus everything else" — it is exactly that rule, pinned by cells. That Q69 moves toward zero — one file is one file.
+
+Files: `wizard-work/volt/q69_hostroot_census.py` (new), `CHECK-q69-census` (new), `wizard-work/volt/q84-closure/q84_verify.py` (the default root and its docstring), `wizard-work/volt/q143-check-sweep/check_entry_baseline.tsv` (one row), `wizard-work/volt/q137-open-set/open_set.py` (the pin), `WORK-QUEUE.md` (this record), `docs/queue-index.md` (re-rendered).
+
+CHECK: `bash CHECK-q69-census`
+
+## Q69 addendum 2 — the probe's scratch root derived from TMPDIR: one of the nine named files is clean, and the lane reads 8 code files / 15 constants *(volt, 2026-11-04, at `5b71db6` and the commit this record lands in; Q69's own "one file per commit" clause)*
+
+**Q69 stays open. This record repairs one of the nine files the first addendum named and corrects that addendum's own tally; no id changes state and no other lane's file is touched.**
+
+**(1) The defect, re-read at `5b71db6`.** `wizard-work/volt/q65_rc_probe.py:128` read `SCRATCH_ROOT = "/root/.hermes/profiles/volt/cache/scratch"`, and the constant had two live readers: `do_emit`'s mutant work dir (`:387`, `os.path.join(SCRATCH_ROOT, "rcprobe-%d" % int(time.time()))`) and the selftest's `tempfile.mkdtemp(prefix="rcprobe-selftest-", dir=SCRATCH_ROOT)` (`:549`). So `--emit` and `--selftest` wrote their copies and fixtures into one profile's directory whatever tree the tool was read out of, and on a machine that has no such directory `mkdtemp(dir=...)` does not fall back — it raises: `FileNotFoundError: [Errno 2] No such file or directory: '…/definitely-not-here-q69/probe-9y1gh208'` (measured, `/root/.hermes/profiles/volt/cache/scratch/mkdtemp_probe.py`). The AST census listed the constant as one of the lane's sixteen: `{"line": 128, "path": "wizard-work/volt/q65_rc_probe.py", "subtype": "CONST", "value": "/root/.hermes/profiles/volt/cache/scratch"}`.
+
+**(2) The repair, and why `gettempdir()` rather than another literal.** `SCRATCH_ROOT = tempfile.gettempdir()` — TMPDIR first, then TEMP and TMP, then `/tmp`, so the root is whatever the running tick called scratch and never a path read out of a checkout. It is the same directory on this host (`gettempdir()` reads `/root/.hermes/profiles/volt/cache/scratch`, the value `TMPDIR` carries), which is why the repair changes no reading of `q65_rc_probe.tsv`; on a tree with no TMPDIR it is `/tmp` instead of a directory that may not exist. A four-line comment at the constant states the rule.
+
+**(3) Measured after the edit, at this tree.** `python3 wizard-work/volt/q65_rc_probe.py --selftest` → **25 cells, 25 passed, 0 failed**, rc 0. `--repo . --check` → **0 fault(s)**, "every row content-bound and consistent with its class", 54 of 73 rc-sensitive rows probed of 228 committed. The census moves by exactly the one constant: **542 → 541 code files, 885 → 884 constants** over 1345 graded, and the lane row reads **9/16 → 8/15** (`wizard-work/volt 43 8 15 29 5 6`), with no row naming `q65_rc_probe.py` in the JSON at all (rows are mentions; a clean file has none).
+
+**(4) The guard: `wizard-work/volt/q69_scratchroot_check.sh`, five legs, rc 0/1/2.** `text` (no host-absolute string literal in the module), `census` (the JSON names the module 0 times), `selftest` (rc 0 and exactly 25 `ok` lines), `derive` (a fresh `TMPDIR` receives the selftest's scratch dir), `teeth` (the text leg's `grep` predicate fires on a copy with the literal appended). Measured green here: **rc 0, 5 leg(s), 0 fault(s)**. Measured red on HEAD's own blob in a fresh `git clone` of `5b71db6`: **rc 1, 3 fault(s)** — `text FAULT (1 host-absolute literal)`, `census FAULT (2 row(s) name the module)`, `derive FAULT (rc 0, TMPDIR dirs 0 -> 0)` — while `selftest` and `teeth` stayed green, so the three reds are the defect and the other two legs are not a tool that cannot fire.
+
+**(5) The lane gate, stated rather than inherited.** `bash wizard-work/volt/CHECK` reads **rc 1** in this tree *and* in the untouched clone of `5b71db6`: 13 `UNCLASSED` rows, every one a committed `wizard-work/sol/verify_*.py` that is in no class row of `q63_unwired_baseline.tsv` (e.g. `wizard-work/sol/verify_untracked_classify_2026_11_03.py`, tracked at HEAD). That red predates this repair and belongs to sol's ledger; it is named here so this record is not read as claiming a green lane gate, and it was not repaired from this lane.
+
+**(6) What stays open in this lane, re-counted.** Eight files, fifteen constants: media-catalog `claims_check.py:52` and `semantic_gate.py:213` (`/root/stackchain_catalog_raw.json`); `q118_verify.py:64,67,68` (the monitor script and two host cache files); `q133_verify.py:64` and `q136_verify.py:79` (the pre-repair host directories their mutant legs rebuild); `q137-open-set/open_set.py:393,412` (the monitor); `q63_prove.py:25,101,120,134` (the pre-fix host copies the proof exists to read); `q65_runner.py:117` twice (the detector's own pattern). `q65_rc_probe.py:128` is off that list by this record and nothing else moved.
+
+**(7) Not claimed.** That a CODE row is a fault — a CONST is a position, not an intent, and a fixture string is CODE. That 8/15 is stable — it is a re-read of a tree that other lanes commit to. That `--emit` is now portable in full — its mutant copies still need a real git worktree (`git worktree add`), which is unchanged here and out of scope. That the guard grades the repair's intent — it grades three absences and one write, and `teeth` grades only its own predicate. That the 13 `UNCLASSED` rows are sol's to repair *by this lane's judgement of priority* — they are sol's by path, and only sol can sign their class rows.
+
+Files: `wizard-work/volt/q65_rc_probe.py` (SCRATCH_ROOT and its comment), `wizard-work/volt/q69_scratchroot_check.sh` (new guard, five legs), `WORK-QUEUE.md` (this record), `docs/queue-index.md` (re-rendered).
+
+CHECK: `bash wizard-work/volt/q69_scratchroot_check.sh`

audit-log.jsonl

@@ -0,0 +1 @@
+{"data": {"note": "audit ledger initialized"}, "prev": "genesis", "seq": 0, "ts": "2026-11-03T01:27:45Z", "type": "system-online"}

career-lane/apply-queue-2026-11-02.md

@@ -0,0 +1,416 @@
+# APPLY QUEUE — 2026-11-02 (for Timmy to queue, Alexander submits)
+
+**Authority:** Alexander asked Zeph to send Timmy "everything I can apply for
+today" and have Timmy queue it for Alexander's own submission. Escalation path:
+Zeph → Timmy (pipe) → Alexander (Telegram); Zeph never relays decisions and
+raises nothing in chat. **Rules:** Timmy queues only — never submits, never
+creates accounts, never contacts anyone on Alexander's behalf. He carries the
+open questions below to Alexander DIRECTLY via Telegram. Materials are
+public-safe (professional name only; no email, phone, or private facts).
+Supersedes apply-queue-2026-11-01.md. Compiled by Zephyrus Sparkborn,
+2026-11-02. Liveness verified from a clean external network unless
+marked otherwise. **2026-11-02 tick: count UNCHANGED (38 live / 4 closed, Turing 16); no new qualifying door; Greenhouse probe URL corrected (planet → planetlabs slug, job 7555019 unchanged, LinkedIn still optional); micro1 item 13 text-gap closed by render (LIVE $100–150/hr confirmed); Lever + Ashby probes re-confirmed (LinkedIn required on both); Terac $65/$39/item 35 + micro1 5/10/24 re-confirmed on render; Ashby probe overview salary $211.4K–$290.6K + equity is a probe-role detail, not a door rate.**
+
+**Corrections folded into the body this tick (append-only history preserved in
+daily-2026-10-21.md's corrections section; reply-80 year fix logged 2026-10-22):** N5 Alignerr pay is **$60–80/hr
+on the page header** (my 10-20/10-21 "unstated" was wrong; third-party
+$60–120 range dropped); the six corroborated Turing doors now carry their
+**page-title labels** (reply-78 table), not feed labels — `HI7GzvKjPF` is
+"Senior Python Engineer – AI Agents Evaluation" (not "GenAI Security");
+`Xqiv8zPNaw` is the actual GenAI Security door.
+
+## Pipeline tally
+**11 submitted / 2 interviews / 0 offers / 2 rejections.** The Alignerr
+item-29 Seattle variant is LIVE AGAIN (full page on two text fetches
+2026-10-31, after 404ing on two instruments 2026-10-30) — the role is two
+city variants again, and the closed count moves 5 → 4. Count CORRECTED:
+the 10-30 "33 live / Turing 15" line undercounted its own enumeration
+(Turing is 16, item 33 verified 10-29 but never folded into the count);
+going forward the count is the enumeration: **38 live doors / 4 closed,
+Turing 16 of the 38**, one door per canonical URL, Mercor network and
+Handshake hub named separately as pipeline rows, not doors. Item-35
+calibration reward CORRECTED to $100 (was $50). Greenhouse probe replaced
+(Point72 retired; Planet Labs 7555019 now the probe role, form renders
+fully, LinkedIn optional). Lever probe DEGRADED (Worldscape URL 404s on
+text fetch + live browser — replacement probe role needed). Ashby
+code-analysis question presence re-confirmed on live render
+(presence only). No new submissions.
+
+## Queue order (by conversion speed)
+
+### 1. "Senior Software Engineer – AI Evaluation / Coding Agents" — TURING DOOR ONLY ⭐ APPLY-READY, best-structured interview this month
+- URL: https://work.turing.com/r/bs71Txx0ar (LIVE, full copy re-read 2026-10-22)
+- The 24-MAG careers-page door is CLOSED (genuine 404, two hosts, 10-21). The
+  project is the same one (word-for-word dedupe verified by Timmy); only the
+  Turing door remains.
+- Terms: freelance/contract, remote North America only, 20–40 hrs/week with
+  ≥6 hrs/day PT overlap (~3–9pm ET — lifestyle call), ~3-month project, start
+  ASAP. **Pay: $100–150/hr — the form asks for a specific rate expectation,
+  so the number is a concrete decision.**
+- Work: review AI-generated code, design rubrics and acceptance criteria,
+  repo-level analysis, eval-infrastructure pipelines. Two years of Alexander's
+  daily Q-audit work, nearly verbatim.
+- Interview (three stages, from the live page): ~25-min AI interview →
+  ~30-min practical (reviewing AI-generated code, not algorithms) → ~20-min
+  hiring-manager chat.
+- Gates: 5+ years hands-on SE, Python listed FIRST among languages (no
+  React/Node hard requirement), code review, written communication, modern LLM
+  tooling; "LLM evaluation or coding-agent experience is advantageous." **No
+  degree requirement anywhere.** Named gap (not hidden): the 24-MAG page's
+  "GitHub-based development workflows" line — his public review work lives on
+  Gitea; name it in the application, don't hide it. Five of six gates clear.
+- Caveats: the page mentions TypeScript/JavaScript, Go, Java among skills —
+  none is a hard requirement, but Alexander knows his denialist lines. First
+  stage is an AI interview, so the standing rule applies: **pause ALL Mac
+  automations before it** (pre-flight procedure: `interview-preflight-24mag.md`).
+- **Paste-ready pitch (public-safe):**
+
+> I'm Alexander Payne, a senior backend engineer (Python) contracting
+> independently. For the last two years my day job has been directing and
+> evaluating AI coding agents end to end on real repositories: reviewing
+> generated implementations for correctness, robustness, and maintainability;
+> designing the acceptance criteria and rubrics the evaluations run on; and
+> making release decisions on agent output at the diff level. Underneath that,
+> 5+ years of production Python — Django, Flask, REST APIs, PostgreSQL,
+> Docker, CI/CD — so I judge generated code the way someone who has shipped
+> it does: by reading it, running it, and checking the tests. I'm comfortable
+> cloning an unfamiliar repo, reading its architecture cold, and writing up
+> exactly where the model went wrong and why. Remote, US-based, available to
+> start immediately, fine with the PT overlap.
+
+- **OPEN FOR ALEXANDER (Timmy to ask directly):** go or no-go on the Turing
+  door, and his rate inside $100–150.
+
+### 2. Data Annotation — "Software Engineer"
+- URL: https://dataannotation.tech/job-board/software-engineer (LIVE 2026-10-22, 200 after redirect)
+- Terms: remote, weekly payouts. Pay: **Up to $150+/hr** depending on task
+  difficulty and specialization. **No degree required.**
+- Work: run agentic coding sessions on real engineering tasks, analyze what
+  the models produce, red-team them until they fail in interesting ways.
+  Distinct door from the Backend Engineer track.
+
+### 3. OpenTrain — "Backend Coding Task & Verifier Specialist"
+- URL: https://www.opentrain.ai/jobs/backend-coding-task-and-verifier-specialist--cmu9linxg000o0bgm9xiw33b9/ (LIVE 2026-10-22, 200)
+- Terms: remote, US-eligible, ~15 flexible hrs/week, mid-senior.
+- Pay: **$30–100/hr equivalent, paid per task.**
+- Work: create backend coding tasks and deterministic verifiers for AI
+  systems. Python listed first. Modest pay, clean fit.
+
+### 4. Terac — "Software Engineers: Paid Code Review for AI Agent Evaluation"
+- URL: https://terac.com/opportunities/XJ4I47Bp6ExVHmNY (LIVE, full copy re-rendered 2026-10-24; published 2026-10-02)
+- Terms: remote, hourly. Pay: **$65/hr** (Timmy's on-page read 10-21, Documented). "15 spots left" badge remains client-side-only — carried as my live-browser read, not a verified count.
+- **Render note 2026-10-26:** live-browser render confirms the side panel reads "Earn $65 per hour" with an "Apply to this opportunity" button and no closure notice — the $65/hr cell is now **live-render confirmed**, not variance-flagged. (The text fetch still shows "Hourly Remote" only: the pay lives in the side panel the extractor drops.)
+- **NEW named contact:** Zachary "Zac" Baker, Co-Founder & CEO (co-founded 2025 with Jack Blair; source: greenbook.org/company/Terac directory; public business line +1 (703) 405-1525; careers@terac.com held). He reaches out.
+
+### 5. micro1 — Senior SWE ($245–280/hr) — CLOSED 2026-10-24
+- URL: https://jobs.micro1.ai/post/3d79ba82-926b-48c0-9d15-8791a364ea81 (page renders 2026-10-24 AND states "This job is currently closed and not accepting applications." — rendered closure, confirmed by two reads this run: my own browser.open + scout instrument)
+- Terms were: remote contractor, published 2026-08-27, $245–280/hr.
+- **Do not route Alexander here.** Corroboration-requested: Timmy host re-read of the closed banner (status flip).
+- Correction: my 10-23 "URL-DEAD" verdict for micro1 was a wrong-domain artifact (fetches hit `micro1.ai/post/` instead of `jobs.micro1.ai/post/`). The canonical pages render; this closure is real, on the correct domain.
+
+### 6. Vettedlance — "Senior SWE, Agentic Coding Evaluation"
+- URL: https://vettedlance.com/jobs/senior-software-engineer-agentic-coding-eval (LIVE 2026-10-22, 200)
+- Terms: hourly contractor, remote flexible PT, 10–40 h/wk, weekly USD.
+- Pay: **$80–120/hr.** "Hiring now." Paid coding assessment before project
+  work. "Vettedlance never charges candidates" (free-tier rule holds).
+
+### 7. Askable — "Software Engineer, AI Coding Tasks"
+- URL: https://www.askable.com/experts/roles/senior-software-engineer (LIVE 2026-10-22, 200)
+- Terms: contract after paid technical task; remote, any location; ≥10 h/wk.
+- Pay: **US$1,000 per accepted task** (not hourly).
+- Gate: code you own merged into a public open-source repository
+  (employer/client code excluded). **OPEN FOR ALEXANDER:** does he have
+  qualifying OSS work?
+- **NEW named contact:** John Goleby, Co-Founder & CEO of Askable (Brisbane; US/UK/Chicago offices; $22M AirTree-led Series A **Dec 2024** — sources: devopsdigest.com/askable-joins-vendor-forum, thebusinessfrontier.com, cmotech.uk; the year is 2024 per PRNewswire's "CHICAGO, Dec. 13, 2024" dateline, Askable's own blog, Business Insider — my "all 2026" was wrong, fixed 2026-10-22 per reply 80). The funnel is self-serve, but he can go direct on the OSS-gate question. He reaches out.
+
+### 8. Turing M2 — "Senior SWE – Python (LLM Evaluation & Repository Validation)"
+- URL: https://work.turing.com/r/C94ooVlx1g (LIVE, full copy re-read 2026-10-22)
+- Terms: contractor, remote, 4–8 weeks, ≥4 h/day (20 h/wk) with 4 h PST overlap.
+- Gates verbatim: degree line, "Minimum 8 years … in leading product companies
+  or technology startups", Python mandatory + Java/Go/C++. **OPEN FOR
+  ALEXANDER:** go/no-go + rate.
+
+### 9. Turing N2 — "Senior SWE – LLM Evaluation (US-based)"
+- URL: https://work.turing.com/r/b9OgTSjjGs (LIVE, full copy re-read 2026-10-22)
+- Terms: contractor (no medical/paid leave), US-based required, 10–40 h/wk
+  flexible, 1 month (+ext). AI video interview required.
+- Fit: code curation "primarily in Python", agent/verification-tooling work,
+  3+ yrs. **Caveat:** additional work in JavaScript (incl. ReactJS), C/C++,
+  Java, Rust, Go (on-page) — denialist risk.
+- **New on-page data point (10-22):** "Ideal Background" section names
+  frontier-AI employers (OpenAI/NVIDIA/Databricks/Palantir/Snowflake) and
+  "especially welcome" CS programs (UW/UIUC/UT Austin/Michigan/Purdue) —
+  "though exceptional experience and skill always take precedence over
+  pedigree." Flagged as a funnel signal, **not** a hard gate.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 10. micro1 — "Junior SWE" ($150–200/hr) — CLOSED 2026-10-24
+- URL: https://jobs.micro1.ai/post/29ba0d51-2d9f-412e-ad19-5f28a76ca96e (page renders 2026-10-24 AND states "This job is currently closed and not accepting applications." — rendered closure, confirmed by two reads this run)
+- Terms were: contractor, remote, $150–200/hr, published 2026-10-12.
+- **Do not route Alexander here.** Corroboration-requested: Timmy host re-read of the closed banner (status flip despite the recent publish date).
+
+### 11. Alignerr N5 — "Senior Machine Learning Engineer" ($60–80/hr ON PAGE, Timmy 10-21)
+- URL: https://www.alignerr.com/jobs/20c08939-56c2-4351-a47a-efcdf022eca5 (LIVE 2026-10-24; pay Documented from the page header by Timmy 10-21: "Senior Machine Learning Engineer $60-80/hr Remote Freelance CODING")
+- **Render note 2026-10-24:** the $60–80/hr figure does NOT appear in the 10-23 or 10-24 renders (Hourly Contract / Remote / 10–40 h/wk only). The body pay cell keeps Timmy's Documented read; the variance is flagged, not a pay change — a Timmy host re-read settles it.
+- Terms: hourly contract, remote, 10–40 h/wk, fully async.
+- Work: LLM training/eval data authoring — reasoning traces, model-failure analysis; adjacent to the AI-eval seat. No LinkedIn/degree required per listing.
+- Caveats: framed for ML practitioners; pay below the top band.
+- **OPEN FOR ALEXANDER:** take or pass.
+- Direct lane stays weak (self-serve funnel; Labelbox CEO Manu Sharma named-only).
+
+### 12. Terac — "Part-Time Full-Stack Engineers: Farm-Data Platform Development" ($39/hr, Timmy 10-21) — CLOSED 2026-10-25
+- URL: https://terac.com/opportunities/EW5rvZqnDf0sO6qQ (CLOSED 2026-10-25: live-browser render shows "This listing has closed, but Terac posts new paid opportunities regularly. Sign up to get matched with similar work." with no Apply button or application form for this listing — corroborating Timmy's 2026-10-25 host re-read at `0ba6be9` (closure banner + `isClosed:true`) and sol's sweep. Correction per reply 99 §2: the banner IS in a plain text fetch of the same URL (200/213,617 B, closure sentence twice) — the scout extractor drops the panel, the plain fetch surfaces it. The 10-25 "text fetches neither confirm nor refute" sentence was an instrument generalisation, corrected here.)
+- Terms were: independent contractor, remote any timezone, ~15 h/wk, 1+ year engagement, weekly pay. Pay was Documented $39/hr on page per Timmy 10-21.
+- **Do not route Alexander here.** Decision 9 (take or pass) is WITHDRAWN as moot 2026-10-25.
+
+### 13. micro1 — "Open Source Contributor (GitHub)" ($100–150/hr)
+- URL: https://jobs.micro1.ai/post/18a809aa-0b7f-4523-ac0e-508c9f0f6f66 (LIVE canonical, re-read 2026-10-24 on two reads this run: title "Open Source Contributor (GitHub)", $100–150/hr, published 2026-09-16; apply/process sections render, no closed banner).
+- ~~Corroborated LIVE 10-21 via six mirrors (canonical URL malformed; true UUID unresolved)~~ — struck 10-23: the full UUID sat in `micro1-oss-maintainer-2026-10-20.md` line 39 all along; the truncation was mine at write time (reply 81).
+- Terms: global remote contractor, ~15 h/wk, flexible; ~100 openings.
+- Gates: public/verifiable GitHub profile with meaningful ownership; Alexander's public review work lives on Gitea — the standing GitHub gate gap. Compensation per-task with minimum weekly submissions — treat band as nominal.
+- **OPEN FOR ALEXANDER:** queue-add his call (pending the GitHub-gate honest read).
+
+### 14. Corroborated Turing doors — all LIVE (Timmy's host, reply 78, 10-21) — weighable now
+- r/Y74n4sPVv9 — **Senior Software Engineer – LLM Evaluation**: 10–40 h/wk, contractor, 1 mo, partial PST overlap. **No $ on page.**
+- r/HI7GzvKjPF — **Senior Python Engineer – AI Agents Evaluation**: full-time contractual, 40 h/wk, 1 mo, remote. **No $ on page.** (Label corrected — not GenAI Security.)
+- r/CUZsKnwt7P — **Agentic Coding Evaluation Specialist (Contract)**: **"Compensation: $75/hour"**, ~2–4 weeks (+ ext). **Stale-risk flag 2026-10-25:** body also states "Project start date: May 4, 2026 (Tentative)", rolling "until the batch is full" — still rendering, no closure marker, but weigh as backfill/batch, not a fresh project.
+- r/JHrOLgPhXZ — **Senior Backend Engineer (Python/FastAPI) – AI Evaluation (US-based)**: 10–40 h/wk, contractor, 1 mo. **No $ on page.**
+- r/Xqiv8zPNaw — **GenAI Security Evaluation Engineer**: **"Pay up to $150/hr depending on internal evaluation and location"**, freelance/remote/contractor, up to 2 weeks. (The actual GenAI-Security door.)
+- r/alSSk0vX2k — **Senior Software Engineer – LLM Evaluation (US/Canada/WEU)**: 10–40 h/wk, contractor, 1 mo. **No $ on page.**
+- Four doors state no figure — weigh on fit, not pay.
+
+## UNVERIFIED this tick (hold, do not queue)
+- micro1 Senior Platform Engineer re-post: still absent from the board (JS shell; mirrors only) — stays dropped, watching for a re-post.
+
+## DROPPED
+- **24-MAG careers-page door — CLOSED 2026-10-21** (live-browser 404 + Timmy's host 404). The project continues via item 1 (Turing door).
+
+## Open decisions (for Alexander, via Timmy on Telegram — NOT via Zeph)
+1. Item 1 (Turing door, $100–150/hr project): go/no-go + his rate number.
+2. Item 8 (Turing M2): go/no-go + rate (carried from 10-13 — still unanswered).
+3. Item 9 (N2): take or pass (React caveat + new pedigree-language note).
+4. Item 5 (micro1 $245–280/hr): ~~authorization to start the candidate account + AI interview + skill assessments~~ — WITHDRAWN 2026-10-24: door CLOSED (rendered banner).
+5. Item 7 (Askable): does he have qualifying OSS-merged work — and whether to go direct via John Goleby.
+6. Item 11 (N5 Alignerr MLE, $60–80/hr on page): take or pass.
+7. Item 4 (Terac $65/hr): window open — and whether to go direct via Zachary Baker.
+8. Item 10 (micro1 "Junior SWE" $150–200/hr): ~~queue-add his call~~ — WITHDRAWN 2026-10-24: door CLOSED (rendered banner).
+9. Item 12 (Terac $39/hr farm-data): ~~take or pass~~ — WITHDRAWN as moot 2026-10-25: door CLOSED (live-render corroborated).
+10. Item 13 (micro1 OSS Contributor $100–150/hr): queue-add his call (GitHub-gate honest read).
+11. Item 14 (six corroborated doors): weigh on fit now that liveness is Documented.
+12. Item 25 (OpenTrain GenAI Security $150/hr): take or pass — conditional on genuine appsec depth.
+13. Item 28 (Alignerr Senior SWE – AI Evaluation): take or pass — pay CORRECTED 2026-10-27 to $60-120/hr on page (Timmy Documented, reply 112 §2); hourly contract, remote, 20–40 h/wk.
+14. Item 29 (Alignerr Senior SWE – AI Infrastructure): take or pass — pay $20-100/hr on page (CORROBORATED 2026-10-30 on live render, matching Timmy raw-byte, replies 129 §2.1 / 130 §3); hourly contract, remote, 20–40 h/wk. Seattle variant URL REMOVED 2026-10-30 (HTTP 404 + render 404, two instruments), **LIVE AGAIN 2026-10-31 (three instruments)** — role two variants again. Timmy's read: pass (below band).
+15. Item 30 (Alignerr Senior Systems Engineer – AI Data & Infrastructure): take or pass — pay CORRECTED 2026-10-28 to $50-75/hr on page (Timmy raw-byte, replies 129 §2.2 / 130 §3); hourly contract, remote, 20–40 h/wk. Timmy's read: pass (below band).
+16. Item 31 (Turing bAJ2YQwFKG, systems-Python door): take or pass — new verified door 2026-10-28, contractor, US-based, 10–40 h/wk, 1 month + extensions; ReactJS-in-overview caveat; pay unstated in text fetch.
+17. Item 32 (OpenTrain Secure Coding-Agent Benchmark Engineer): take or pass — new verified door 2026-10-28, remote worldwide, 4–8 wks, 20+ h/wk; M2 twin shape; pay not provided in the listing; security-conditional. NO expiry line: OpenTrain validThrough is render-synthesized build+30d, never a deadline (reply 145 §0).
+18. Item 33 (Turing -8ebgtrDpF, Agent Trace Collection): take or pass — new verified door 2026-10-29, $100/hr, contractor, 3 mo, North America, 20+ h/wk with 4h PST overlap; Copilot CLI agent-trace pipeline in Azure (OTLP/OpenTelemetry, PII/secret scrub, trace viewer). Caveat: posting requires 3+ yrs Azure (or comparable major cloud with clear transfer to Azure PaaS) + 2+ yrs observability/telemetry with direct OpenTelemetry experience — Azure depth is a stated bar, not a claim to make lightly.
+19. Item 34 (Data Annotation DevOps Engineer, AI Training): take or pass — new verified door 2026-10-29, up to $150+/hr by task difficulty, no degree required, remote. Caveat: posting asks for comfort with a major cloud and tools like Terraform, Kubernetes, or Docker — K8s/Terraform depth is a stated comfort requirement; do not over-claim.
+20. Item 35 (Terac AI Slide Deck Evaluation): take or pass — new verified door 2026-10-30, $110/hr + one-time $100 calibration-exam reward (CORRECTED 2026-10-31 from $50), independent contractor, fully remote, own schedule, weekly pay, screening interview first. Caveat: evaluation/review work (rank technical slide decks for clarity, structure, effectiveness), not platform building.
+
+## New lead-grade items 10-22 (scout + corroborated top two by my reads)
+
+### 15. Surge AI — "Senior Software Engineer: Agentic Coding RL Environments" ($100–150+/hour) ⭐ NEW TOP FIND
+- URL: https://surgehq.ai/swe (LIVE, full copy re-read by me 2026-10-22; scout instrument corroborates)
+- Terms: fully remote contractor, 20–40+ hrs/week, choose-your-schedule, async Slack, own equipment.
+- Pay: **$100–$150+/hour on page** ("Pay scales with your expertise"; "Some projects go well past the top of that range"; header "Make $200–300k+/year").
+- Work: build coding RL environments and benchmarks for frontier labs; review & red-team model output; write tests, rubrics, success criteria; structured feedback that improves future models.
+- Gates: professional SWE experience shipping scaled production systems; strong judgment about good code and model failures; expertise in at least one common stack incl. Python; **no AI/ML background required, no degree, no LinkedIn.**
+- Process: 2-hour coding capability screen → ID verification → paid first task.
+- Fit: near-perfect lane match — his 2-year agent-directing/eval background maps 1:1 (this is the work he does daily on the archive audits).
+- **OPEN FOR ALEXANDER:** go or no-go + whether to start the 2-hour coding screen.
+
+### 16. workfindy.com — "Senior AI Engineer (Contract)" ($100–150/hr)
+- URL: https://workfindy.com/jobs/8f257919-3692-4422-ba07-60e05805ce8a (LIVE, full copy re-read by me 2026-10-22)
+- Terms: contractor, remote US/Canada, ≥20 h/wk + 4 h PT overlap, 3-month contract, start soon; no medical/paid leave.
+- Pay: **$100–$150/hr USD** (on-page).
+- Work: build data pipelines, review AI outputs, develop quality criteria; "a significant part of the role is being able to explain *why* one response is better than another."
+- Gates: 5+ yrs Python/TS/JS/Go; hands-on AI preference data or eval rubrics; US/Canada-based; no LinkedIn, no pay-to-evaluate. Published 2026-10-05T16:44:58Z.
+- **Caveat: employer unnamed — apply by "DM the poster"** (conversion risk).
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 17. Turing — "Senior Python Engineer – LLM Evaluation" (US-based) (L2)
+- URL: https://work.turing.com/r/HfWfAxm6VX (rendered open today, scout instrument)
+- Terms: remote contractor, US-based, 10–40 h/wk, 1 mo +ext; pay not stated.
+- Work: Python-primary eval + verification tooling; 3+ yrs SWE; AI video interview required.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 18. Turing — "Software Engineer – AI Research & Evaluation" (US-based) (L3)
+- URL: https://work.turing.com/r/7XiC0Ev2xx (rendered open today, scout instrument)
+- Terms: same engagement shape; pay not stated.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 19. Turing — "Senior Python Engineer – LLM Evaluation" (systems emphasis) (L4)
+- URL: https://work.turing.com/r/3tkNgppkIt (rendered open today, scout instrument)
+- Terms: same engagement shape; pay not stated; systems/infra bent — Go/Rust/C++ named but Python first, no hard ownership demanded.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 20. Alignerr — "Senior SWE — Agentic Coding" (L6)
+- URL: https://www.alignerr.com/jobs/5c4ccb04-ae5e-4274-8a60-6262aa3cb81f (rendered open today, scout instrument)
+- Terms: hourly contract, remote, 10–40 h/wk; pay not stated. Caveat: intro copy mentions "Berlin" though terms say Remote.
+- **2026-10-28 note:** second city variant verified open today — New York copy at https://www.alignerr.com/jobs/c002014e-c0a5-4a17-958c-6e2e4169ce71 (hourly contract, remote, 10–40 h/wk, same role body). Per the item-29 city-variant rule this is item 20's second variant, NOT a new numbered item; the scout's "new lead" call on this page is corrected here. Count unchanged.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 21. Alignerr — "Senior SWE — AI Evaluation & Benchmarks" (L7)
+- URL: https://www.alignerr.com/jobs/f15503d4-74ca-41f3-87e2-e7ccdc39beae (rendered open today, scout instrument)
+- Terms: hourly, remote, 3-month; pay not stated. Caveat: "proven LLM benchmark design experience" strongly worded.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 22. Alignerr — "Software Engineer - Python (Advanced)" (L8)
+- URL: https://www.alignerr.com/jobs/c6185f8a-b748-46b5-9e7a-57e0f652356b (rendered open today, scout instrument)
+- Terms: hourly, remote, 10–40 h/wk; pay not stated. Caveat: "consulting/client-facing experience" must-have; AI-code eval is nice-to-have, not core.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 23. Handshake AI — AI Trainer (filler-hours track) (L9)
+- URL: https://joinhandshake.com/ai/opportunities (canonical program page rendered open today, scout instrument)
+- Terms: independent contractor (not FT), fully remote, ~5–20 h/wk when assigned, year-round; pay not stated. 4+ yrs SWE, US-eligible, no LinkedIn/degree mandate.
+- **OPEN FOR ALEXANDER:** worth a profile, his call.
+
+### 24. micro1 — "Open Source GitHub Maintainer" ($150–300/hr) — NEW NUMBERED ITEM 2026-10-23 (row verified 10-20; promoted from supplement per reply 81)
+- URL: https://jobs.micro1.ai/post/51a65c2c-07dd-4307-aba6-f7c4af17311c (LIVE — canonical detail page re-read 2026-10-24; "Apply now" renders; published 2026-08-14)
+- Terms: contractor, remote global, 15 h/wk, flexible; minimum weekly task submissions; "typically fill roles within 48 hours." Pay **$150–300/hr**, output-based per accepted task (pace-dependent — treat as nominal).
+- Work: review LLM-generated code patches for the repository the expert maintains; detailed written justifications; peer-review other experts' submissions. In-lane (diff-level review + written justification — Alexander's daily shape).
+- Gates: "Applicants must have clear open source contributions and profiles to showcase it like GitHub or GitLab" (page-verbatim). Same Gitea-gap as item 13: name the forge profile in the application, don't hide it. Preferred: OSS-maintenance experience; contributor-code review experience.
+- Process: screening questions → ~10-min AI interview → hiring-manager review. (Mac-automation pause before the AI interview.)
+- **OPEN FOR ALEXANDER:** queue-add his call. (Top-band micro1 family — weigh alongside items 13 and 24 now that items 5 and 10 are closed, not only in `micro1-oss-maintainer-2026-10-20.md`.)
+
+### 25. OpenTrain — "GenAI Security Evaluation Engineer" ($150/hr) — NEW 2026-10-24, SECURITY-CONDITIONAL
+- URL: https://www.opentrain.ai/jobs/genai-security-evaluation-engineer--cmuxyhp6w000606nucgoq7baa/ (LIVE canonical detail page, full fetch 2026-10-24; posted Oct 7, 2026)
+- Terms: contract, part-time, 20+ h/wk, open worldwide. Pay: **"$150 per hour"** stated as hourly (not per-task equivalent) on page.
+- Work: build/test vulnerable GenAI agent and RAG codebases, annotate security risks, evaluate detection tools. Requires 5+ years in application/product security or security-focused SWE including secure code review; source-to-sink/taint analysis, SAST, CodeQL or Semgrep; LLM agents/RAG (LangChain/LlamaIndex/OpenAI or Anthropic SDKs or MCP); production Python and/or TypeScript.
+- **Caveats (read before relaying):** (a) security-specialist door — fits only if the appsec depth above is genuinely present; do NOT claim it from the general platform profile. (b) Distinct from Turing's GenAI Security door (item 14 / Xqiv8zPNaw, "up to $150/hr") — do not merge the two. (c) OpenTrain detail pages carry the 2026-10-13 orphan/expiring caveat (referral scheme retired; pages render but may be expiring) — treat as expiring-class until re-read. (d) Application route requires creating a free OpenTrain account (not a pay-to-eval gate stated on page).
+- **OPEN FOR ALEXANDER:** take or pass — conditional on genuine appsec depth, his call.
+- **2026-10-25 note:** today's text fetch confirms title, $150/hr, posted Oct 7, 2026, 20+ h/wk; the page-claimed `validThrough` 2026-11-23 did not re-appear in the text fetch. It stands on Timmy's host read (reply 86 §4) as the page's own claim, not a fact about the employer's intent. 29 days from 2026-10-25.
+- **2026-10-28 note:** title, $150/hr, posted Oct 7, 2026, 20+ h/wk re-confirmed; `validThrough` again absent from the text fetch — and the standing 2026-11-23 cell is CORRECTED: the page's JSON-LD reads **`validThrough` 2026-11-26 beside `datePosted` 2026-10-07** (Timmy raw-byte, replies 129 §2.4 / 130 §3) — a 50-day computed span, **29 days remaining as of 2026-10-28**, quoted in that form from here on, never as a bare expiry date and never as an employer promise.
+
+### 26. Mercor — "Software Engineering Expert" talent network ($70–150/hr) — POSSIBLE, new 2026-10-25
+- URL: https://work.mercor.com/jobs/list_AAABnwpGQEMCh-AXEZdBjbqD/senior-software-engineer-full-stack-typescript-react-aws (canonical page fetched 2026-10-25; the specific Full Stack TS/React/AWS job on it is CLOSED — the open item is the talent network it redirects to)
+- Terms: standing pool — grading model code/design, writing eval problems; DevOps/platform, systems/performance, security tracks; remote, part-time.
+- Pay: **$70–$150/hr** "set per project" — precision per reply 99 §4: the band is stated about past listings ("have posted at"), not promised for the next project. Carry as a band, not a rate.
+- Gates: no degree stated ("Where you trained matters less than whether you have owned code in production"); ~20-min AI interview; no LinkedIn mandate, no pay-to-eval stated.
+- **Caveat: a network, not a dated project** — match timing "within a week or several months". Weigh as a pipeline row, not a project door.
+- **OPEN FOR ALEXANDER:** take or pass as a pipeline row.
+
+### 27. Gramian Consulting — "Python Backend Engineer (AI Agents & SaaS Integrations)" ($300/approved task) — WITHDRAWN 2026-10-26 (reply 99 §1)
+- URL: https://builtin.com/job/python-backend-engineer-ai-agents-saas-integrations/10501641 (BuiltIn mirror only; no canonical Gramian page found)
+- Terms were: remote freelance; Python backend apps, REST APIs, microservices, SaaS connectors; build/validate long-horizon AI tasks + rubrics; 2–3 wks, immediate start.
+- Pay was: **$300 per approved task**, min 1 approved task/day.
+- **WITHDRAWN: the mirror itself carries the removal notice above the title — "removed at 10:06 a.m. (UTC) on Thursday, Aug 13, 2026".** The 10-25 row dated it from the posting date below the notice; the disposition was wrong, the grading was right. It was never a canonical door, so the aggregate does not move. Today's extracted text again omits the notice (extractor drops it) — that neither re-confirms nor refutes the withdrawal, which stands on the reply-99 corroboration. **Do not route Alexander here; not a decision.**
+- Obituary note: `300-300 Hourly` is the mirror's own field; the pay is per approved task, as the body cell already says.
+
+### 28. Alignerr — "Senior Software Engineer – AI Evaluation" (possible) — NEW 2026-10-26, PAY CORRECTED 2026-10-27
+- URL: https://www.alignerr.com/jobs/cfa052f0-e721-4ec5-8d38-d697e534081b (LIVE canonical detail page, fetched open 2026-10-26 and 2026-10-27; corroborated by my own read)
+- Terms: hourly contract, remote, 20–40 h/wk.
+- Pay: **$60-120/hr on page** (CORROBORATED 2026-10-30 on live render, matching Timmy Documented, reply 112 §2). The Timmy-Documented-only provenance is superseded — the badge now renders on an instrument of mine.
+- Work: design/build scalable evaluation pipelines and frameworks; automated testing harnesses, scoring systems, benchmarking tools for LLMs; APIs, dashboards, internal tools for eval workflows; edge cases, failure modes, reliability issues in AI outputs.
+- Gates: 4+ years professional SWE shipping production systems; strong Python (pandas, NumPy, FastAPI/Flask/Django); large datasets + data pipelines; comfortable with cloud infrastructure (AWS/GCP/Azure) and containerized deployments — familiarity, not ownership, do not over-claim; Git/CI/CD/testing; written communication, async remote.
+- Fit: strong in-lane — eval infrastructure is the daily audit shape. No degree stated, no LinkedIn mandate, no pay-to-eval stated.
+- **OPEN FOR ALEXANDER:** take or pass — at $60-120/hr, top in-band, floor below.
+
+### 29. Alignerr — "Senior Software Engineer (AI Infrastructure)" (possible) — NEW 2026-10-27
+- URLs: https://www.alignerr.com/jobs/63d40d5a-d58c-4ce3-9ab3-a997ab255ff2 (Seattle variant — REMOVED 2026-10-30 (HTTP 404 + render 404, two instruments), **LIVE AGAIN 2026-10-31 (three instruments: two text fetches + live render with $20-100/hr tag and Apply present)**) and https://www.alignerr.com/jobs/2d057dd9-3b35-4ba7-a660-468dacfb12e9 (New York variant — LIVE 2026-10-30) — canonical pages fetched open 2026-10-27; identical role copy, city-targeted.
+- Terms: hourly contract, remote, 20–40 h/wk. Work: production-grade AI training/evaluation/deployment pipelines, APIs/data pipelines/backend services at scale.
+- Gates: 5+ years, Python/TypeScript/Go/Java or similar; cloud familiarity (AWS/GCP/Azure); Git/CI/CD. No degree stated, no LinkedIn mandate.
+- Pay: **$20-100/hr on page** (CORROBORATED 2026-10-30 on live render, matching Timmy raw-byte, replies 129 §2.1 / 130 §3). The Timmy-Documented provenance is superseded for the NY variant; the Seattle variant no longer renders at all.
+- Counted as ONE role, two city variants again (Seattle live again 2026-10-31 after the 10-30 removal; see corrections log).
+- **OPEN FOR ALEXANDER:** take or pass. Timmy's read: pass (floor far below band).
+
+### 30. Alignerr — "Senior Systems Engineer — AI Data & Infrastructure" (possible) — NEW 2026-10-27
+- URL: https://www.alignerr.com/jobs/95a64c38-9a72-4dbc-8143-2b8ac23d4de3 (canonical page fetched open 2026-10-27).
+- Terms: hourly contract, remote, 20–40 h/wk. Work: high-performance backend systems, data annotation/validation/evaluation tooling, reliable data pipelines.
+- Gates: 5+ years systems/backend production experience; Go/Rust/Python/C++. No degree stated, no LinkedIn mandate.
+- Pay: **$50-75/hr on page** (Timmy raw-byte, replies 129 §2.2 / 130 §3: header badge + meta description + JSON-LD shortDescription). CORRECTION of the 10-27 "not stated in text fetch" cell — the cell was wrong. Provenance caveat: my 10-28 extraction again surfaces NO pay line (same header-badge class) — the cell is Timmy-Documented, not mine.
+- Fit: strong in-lane (systems + eval infra).
+- **OPEN FOR ALEXANDER:** take or pass. Timmy's read: pass (below band).
+
+### 31. Turing — "Senior Python Engineer – LLM Evaluation" (US-based) (systems-Python family) — NEW 2026-10-28
+- URL: https://work.turing.com/r/bAJ2YQwFKG (canonical page fetched open 2026-10-28, my read).
+- Terms: contractor (no medical/paid leave), remote US-based, 10–40 h/wk, 1 month + potential extensions; AI video interview required; application 15–30 minutes.
+- Work: Python-primary eval + verification tooling with systems emphasis — systems-level code, performance-critical applications, infrastructure; build agents verifying systems-level/infrastructure code quality.
+- Gates: several years SWE; strong systems/infrastructure/backend expertise in Python, C/C++, Rust, Go; production-grade software; architecture/design/debugging/code-quality judgment; written communication.
+- **Caveat: overview mentions JavaScript (including ReactJS)** alongside Python/C++/Rust/Go/Java — React caveat, same class as N2/L4; do not claim React. Required Skills do not name React.
+- Pay: not stated in text fetch. L4-family alternate door — counted per the Turing /r/ convention (each /r/ is an application door); Turing door count moves 12 → 13 with this door.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 32. OpenTrain — "Secure Coding-Agent Benchmark Engineer" — NEW 2026-10-28, SECURITY-CONDITIONAL
+- URL: https://www.opentrain.ai/jobs/secure-software-coding-agent-benchmark-engineer--cmv0u6y87000k06i0ytsnui5a/ (canonical detail page recovered from the OpenTrain cybersecurity category page, fetched open 2026-10-28, my read; posted Oct 9, 2026).
+- Terms: contract, part-time, remote worldwide, 4–8 wks, 20+ h/wk with 4 h/day and 4 h PT overlap; apply on OpenTrain (free account) then complete on the hiring platform.
+- Work: design/build realistic benchmark tasks measuring whether AI coding agents complete software work safely and correctly — bug fixes, feature additions, CI repairs, config migrations, integration updates, runtime-state fixes; utility + safety requirements; visible/hidden test suites, safe/unsafe reference solutions, scoring rubrics, calibration notes, runnable evaluators; rollout review (disabling tests, weakening assertions, deleting protected data, leaking secrets, broadening permissions, bypassing validation).
+- Gates: 8+ years hands-on SWE in leading product companies or tech startups; bachelor's or master's in CS or related discipline; strong Python mandatory + Java, Go, or C++; production systems at scale (deployment pipelines, monitoring, logging, observability, distributed tracing, HA, fault tolerance, disaster recovery); practical vulnerability identification, secure fixes, remediation validation; injection/authorization/memory-safety/race-condition/deserialization/secrets/input-validation familiarity required.
+- Pay: **not provided in the listing** (page-verbatim).
+- **Caveats:** (a) M2 twin shape — same 8-yr + degree + Python-mandatory + secure-fix requirements as Turing M2; a distinct door (OpenTrain → hiring platform), not a merge. (b) security-specialist door — fits only if the appsec depth above is genuinely present; do NOT claim it from the general platform profile.
+- **OPEN FOR ALEXANDER:** take or pass — conditional on genuine appsec depth, his call.
+
+---
+
+## Corrections log (append-only)
+
+- **2026-10-24:** items 5 and 10 CLOSED in the body (per Q3 rule, decisional cells): both canonical pages render AND carry "This job is currently closed and not accepting applications." (two reads this run: my own browser.open + scout instrument). Item 5 ($245–280/hr, published 2026-08-27) and item 10 ($150–200/hr, published 2026-10-12) are withdrawn as application routes; their open decisions are struck above. Corroboration-requested: Timmy host re-read of both banners.
+- **2026-10-24:** my 10-23 micro1 "URL-DEAD" verdict WITHDRAWN — the 10-23 fetches hit `micro1.ai/post/<uuid>` (wrong domain); canonical is `jobs.micro1.ai/post/<uuid>`, and all five canonical pages render today. The wrong-domain 404s were an instrument error, not closures.
+- **2026-10-24:** Alignerr `beae0b1f-…` URL DEAD (404 on text fetch + live-browser 404 page) — dropped from the tracked set; it never rendered as a posting in this record, so it is not a role closure.
+- **2026-10-24:** pay-render variance flagged (not body-corrected): Alignerr N5 $60–80/hr, Terac $65/hr, Terac $39/hr figures — all Timmy-Documented on-page 10-21 — do not appear in the 10-23 or 10-24 renders. Body cells keep Timmy's reads with dated variance notes; a Timmy host re-read settles whether the pages changed or the renders differ.
+- **2026-10-24:** item 25 added (OpenTrain GenAI Security Evaluation Engineer, $150/hr, canonical detail page fetched 2026-10-24, posted Oct 7, 2026) — security-conditional, distinct from Turing's GenAI Security door, OpenTrain orphan/expiring caveat carried.
+
+- **2026-10-23, reply 81:** item 13 body corrected in place (per Q3 rule): canonical URL `https://jobs.micro1.ai/post/18a809aa-0b7f-4523-ac0e-508c9f0f6f66` is LIVE — independently read from two hosts (Timmy 10-22 + this host 10-23: 200 / 42,473 B, title "Open Source Contributor (GitHub)", ideal_hourly_rate $100–150, published 2026-09-16). The "canonical URL malformed; true UUID unresolved" line is struck; the full UUID was in `micro1-oss-maintainer-2026-10-20.md` line 39 — the truncation was my write-time error. Verdict now **Documented (canonical)**, GitHub-gate caveat unchanged.
+- **2026-10-23, reply 81:** OSS-maintainer promoted to numbered item 24 — `https://jobs.micro1.ai/post/51a65c2c-07dd-4307-aba6-f7c4af17311c`, LIVE (canonical read 10-20), $150–300/hr, published 2026-08-14, top-band micro1 family alongside items 5 and 10; **OPEN FOR ALEXANDER:** queue-add his call (via Timmy, not Zeph's relay).
+- **2026-10-22, reply 80:** Askable's Series A year corrected in the body (2026 → **Dec 2024**). The round is real — AU$22M Airtree-led — but it closed Dec 13, 2024 (PRNewswire: "CHICAGO, Dec. 13, 2024"; Askable's own blog and Business Insider carry the same). My "sources … all 2026" line (from the 10-21 scout read) was the error source; disambiguation kept: Askable is Brisbane-*founded*, Goleby's own public profile is SF Bay Area — both true, no edit owed. Daily-2026-10-22.md carries the same error in its §7 line; it is append-only dated record — correction note appended there at the foot, living index here corrected in place per the Q3 rule.
+- **2026-10-25, Timmy host re-read:** **item 12 (Terac "Part-Time Full-Stack Engineers: Farm-Data Platform", $39/hr) is CLOSED** — `https://terac.com/opportunities/EW5rvZqnDf0sO6qQ` returns **HTTP 200 / 215,923 B** at 01:14Z with the closure banner twice in the body and `isClosed\":true` in the embedded JSON; sol's independent 3/3 sweep (`8020091`, WorkBench) agrees. The body's "LIVE 2026-10-24" line is superseded, so decision item 9 ("take or pass") is now moot rather than pending — no door left to answer. Re-read in the same minute: item 24 (micro1 Open Source GitHub Maintainer, $150–300/hr) **LIVE**, 200 / 41,581 B, no closure marker; items 5 and 10 were already CLOSED in this file on 10-24, so this sweep adds one closed door, not three.
+- **2026-10-25:** item 12 CLOSED in the body (per Q3 rule, decisional cells): live-browser render shows the closure notice verbatim with no Apply button or application form for the listing — corroborating Timmy's 2026-10-25 host re-read (`0ba6be9`: banner + `isClosed:true`) and sol's sweep. Decision 9 struck as moot. Text fetches today show no closure language; the notice lives in a rendered side panel text extraction does not surface, so the text fetches neither confirm nor refute it.
+- **2026-10-25:** item 25 expiry note updated: page-claimed `validThrough` 2026-11-23 did not re-appear in today's text fetch; it stands on Timmy's host read (reply 86 §4) as the page's own claim. 29 days from 2026-10-25.
+- **2026-10-25:** CUZsKnwt7P stale-risk flag added to §14: "Project start date: May 4, 2026 (Tentative)", rolling — still rendering, no closure marker; weigh as backfill/batch.
+- **2026-10-25:** items 26 (Mercor talent network $70–150/hr, possible — network, not a dated project) and 27 (Gramian Python Backend $300/approved task, possible — BuiltIn mirror only, Aug 3 dated, freshness unverified) added.
+- **2026-10-25:** OpenTrain "Machine Learning Researcher and Task Reviewer" resolved and screened OUT: canonical detail page found (posted Oct 23, 2026, $60–$120/hr equiv) but it requires a master's degree or PhD — degree-gated, not queued. No longer carried as listing-level-only.
+
+- **2026-10-26:** item 27 WITHDRAWN in the body (reply 99 §1): the BuiltIn mirror carries "removed at 10:06 a.m. (UTC) on Thursday, Aug 13, 2026" above the title. The 10-25 "possible, freshness unverified" disposition was wrong; grading (pay, terms, mirror-only status) was right. Never a canonical door; aggregate unchanged. Not a decision for Alexander.
+- **2026-10-26:** item 12 text-fetch sentence corrected (reply 99 §2): the closure banner IS in a plain text fetch (200/213,617 B, twice); the scout extractor drops the panel, the plain fetch surfaces it. The 10-25 corrections-log sentence ("text fetches neither confirm nor refute") stands as dated record, corrected beside it here.
+- **2026-10-26:** Terac $65 cell upgraded to live-render confirmed: live render shows side panel "Earn $65 per hour" + Apply button, no closure notice. N5 ($60–80/hr) still owes the same two-instrument test.
+- **2026-10-26:** Mercor band precision applied (reply 99 §4): $70–150/hr is about past listings ("have posted at"), not a promised rate.
+- **2026-10-26:** item 28 added — Alignerr "Senior Software Engineer – AI Evaluation" (canonical, fetched open + corroborated by my own read): hourly contract, remote, 20–40 h/wk, pay unstated, 4+ yrs Python eval-infra. Take-or-pass (decision 13).
+- **2026-10-26:** Lever Worldscape gate line corrected (reply 100 §5a) in daily-2026-10-26.md §2: "LinkedIn auto-complete + candidate attestations + hCaptcha-on-submit" (static text does not surface the submit-path captcha). Palantir pairing correction (reply 100 §5b) logged in the same file: a92b55d0 (Senior, 2026-04-06) ≠ 10dfc8bc (non-Senior, 2024-03-11).
+- **2026-10-26:** Ashby Ramp code-sample question presence confirmed a second day on my instrument (10-26 fetch); content deliberately not reproduced (safety notice on the embedded task — not decoded, not run, not quoted). "Agent stop" presence-confirmed; content ungraded.
+
+- **2026-10-27:** item 28 pay CORRECTED in the body (reply 112 §2): $60-120/hr on page (Timmy Documented, 200/43,029 B) — the 10-26 "not stated" cell was wrong. Caveat: my 10-27 extraction + scout text fetch surface no pay line (header block dropped by extraction, same class as Terac $65 / N5) — cell is Timmy-Documented, not mine. Decision 13 reworded.
+- **2026-10-27:** Terac $65 instrument sentence corrected (reply 112 §0.2/§2): pay is ALSO in the fetched bytes (Timmy raw fetch 200/224,340 B, twice) — "render-only" was an extractor property. Today's text-only sweep again drops the panel — consistent, not contradictory. Door stays live on the 10-26 render.
+- **2026-10-27:** Ashby Ramp code-sample question presence confirmed a third day on my instrument (10-27 fetch); content withheld as before. Workday NVIDIA probe window closes 2026-10-28 (live browser + text fetch agree) — probe role only.
+- **2026-10-27:** items 29 (Alignerr Senior SWE – AI Infrastructure, Seattle + New York variants, one role) and 30 (Alignerr Senior Systems Engineer – AI Data & Infrastructure) added as possible — canonical pages fetched open, hourly contract, remote, 20–40 h/wk, pay unstated in text fetch. Decisions 14–15.
+- **2026-10-27:** item 25 expiry note updated: page-claimed validThrough 2026-11-23 stands on Timmy's host read only; 27 days from 2026-10-27.
+
+- **2026-10-28:** items 29/30 pay CORRECTED in the body (replies 129 §2.1–2.2 / 130 §3, Timmy raw-byte): item 29 = $20-100/hr (both variants, header badge span); item 30 = $50-75/hr (header badge + meta description + JSON-LD). The 10-27 "not stated in text fetch" cells were wrong. Caveat: my 10-28 extraction again surfaces no pay line on either page (header-badge class) — cells are Timmy-Documented, not mine. Decisions 14–15 reworded; Timmy's read: pass on both; not re-raised.
+- **2026-10-28:** item 25 expiry CORRECTED in the body (replies 129 §2.4 / 130 §3, Timmy raw-byte): `validThrough` 2026-11-26 beside `datePosted` 2026-10-07 — a 50-day computed span, 29 days remaining as of 2026-10-28. The standing 2026-11-23 cell did not reproduce. Quoted in that form from here on, never as a bare expiry date, never as an employer promise. My text fetches again do not surface validThrough (JSON-LD dropped by extraction).
+- **2026-10-28:** N5 variance note CLOSED in the body (reply 129 §2.5): $60-80/hr now Documented from Timmy's raw-byte read, not only structured-data. Item 28 cell keeps $60-120/hr, byte count dropped (dated readings).
+- **2026-10-28:** process rules adopted (replies 129 §5 / 130 §3, standing): (a) raw-byte pay read before writing any new Alignerr/micro1/Terac pay cell; (b) validThrough always quoted beside datePosted.
+- **2026-10-28:** items 31 (Turing bAJ2YQwFKG, systems-Python door, React caveat, pay unstated) and 32 (OpenTrain Secure Coding-Agent Benchmark Engineer, M2 twin, pay not provided, security-conditional) added as possible — canonical pages fetched open, my read. Decisions 16–17. Item 20 gains a New York variant (c002014e, same role body as L6 Berlin copy) — variant, not a new item; the scout's "new lead" call on it is corrected in the body per the item-29 city-variant rule.
+- **2026-10-28:** census notes — Ashby Ramp form body returned "Fetching application form" only, so the code-analysis question presence is NOT re-confirmed today (10-25→10-27 streak pauses on an instrument limitation, not a removal); Workday NVIDIA text fetch timed out (upstream failure, no HTTP status), live-browser recovery dispatched and pending at push time — gate stands on 10-25→10-27 measurements, probe row retires after today (page line: "at least until October 28, 2026"); Terac $39 text fetch inconclusive (role copy, no closure language, no Apply element), CLOSED verdict stands on the 10-25 live render + reply-99 corroboration, live-browser re-check pending at push time.
+
+- **2026-10-29:** item 25 expiry correction WITHDRAWN (reply 145 §0, interview §2.1 — Q116 landing in daily-2026-10-29): OpenTrain `validThrough` is synthesized at render time as build-time + 30 days, NOT a posting deadline. Three dated readings of item 25 (10-24: 2026-11-23; 10-27: 2026-11-26; 10-28: 2026-11-27) each sit exactly 30 days after their own render instant, and item 32 in the same minute 10-28 carries the identical stamp on a different posting. The 10-28 "50-day computed span / 29 days remaining" cell and the 10-28 "expiry CORRECTED" line are superseded; the 10-24 cell was right as a render stamp and wrong only when treated as a deadline. Standing rule REPLACES rule (b): OpenTrain `validThrough` is never quoted as a deadline; if it must appear, label it `render-synthesized, build+30d`. Item 25 keeps its take-or-pass (security-conditional, $150/hr, 20+ h/wk, posted Oct 7) with NO urgency line. Item 32 never receives an expiry line.
+- **2026-10-29:** count definition corrected (reply 145 §4, interview §2.3): the 10-28 daily's "13 live" was Turing-only mislabeled as a cross-family total. Going forward: one door per canonical URL; Turing 13 inside a 31-door cross-family total, 4 closed — moved to Turing 15 / 33 total today by the verification of wp680rglf0 + JPQ-cmFZSA (previously unverified, now fetched open). Micro1 item 5's closure is NOT re-confirmed today (text fetch returned no extractable content — gap, not a verdict change; a mirror still calls it closed, mirror-only); the closed count of 4 stands on standing verdicts, not on today's fetch.
+- **2026-10-29:** Terac $39 reason superseded (reply 145 §3): the closure IS in a plain fetch (200/213,580 B, `This listing has closed` x2, `isClosed:true`); the 10-28 daily's "extractor limitation, inconclusive" reason was wrong while the CLOSED verdict stands (10-25 render + reply-99 + 10-28 addendum render). Standing rule: when the extractor is silent, run the second instrument before writing "inconclusive". Today's text fetch of the $39 page again shows no closure language and no Apply element — that silence adds nothing; the verdict rests on the prior instruments, not on today's silence.
+- **2026-10-29:** census — Ashby Ramp form body renders fully again (Legal Name, Email, Phone, work location, Resume, LinkedIn, Cover Letter, employer experience questions); code-analysis employer question presence RE-CONFIRMED after the 10-28 shell-only pause (presence only, content withheld). Lever Worldscape field set identical. Greenhouse Point72 still header/footer + "Your submission is processing" only. Workday probe row RETIRED after 2026-10-28 (page line "at least until October 28, 2026", re-confirmed on its last day by the 10-28 addendum live render).
+- **2026-10-29:** items 33–34 added as possible (see decisions 18–19); Turing doors wp680rglf0 + JPQ-cmFZSA verified open (Senior SWE – LLM Eval, US, 1 mo, 10–40 h/wk, pay absent in fetch) — no longer held as unverified. Screened out: Alignerr C# (stack mismatch), Alignerr Tel Aviv variant of item 29 (variant, not a role), Terac SWE Benchmarks $45–75 + LinkedIn/GitHub mandate, Terac South Asian $40, Terac genomics $100 mirror-only, G2i (SKIP stands), OpenTrain related cards (ML/AI Systems $30/task, Life Sciences $280/task out-of-lane, Rust, ML Researcher/Applied Scientist related-card only), Mercor newsletter figures (mirror-only), Surge staff-careers (not a contractor door).
+- **2026-10-30:** item-29 Seattle variant REMOVED (HTTP 404 text fetch + render 404, two instruments); role now NY-URL-only; item-29 pay upgraded Timmy-Documented → Corroborated (live render badge $20-100/hr). Item 28 pay likewise Corroborated ($60-120/hr render badge); N5 $60-80 and item 30 $50-75 also render-confirmed. New render-only cells: L6 $80-120, L7 $80-100, L8 $50-75, item 20 NY $80-120.
+- **2026-10-30:** item 35 added as possible (decision 20): Terac AI Slide Deck Evaluation, $110/hr + $50 calibration reward, canonical page fetched open by my own instrument, published 2026-10-24; evaluation/review work, not platform building.
+- **2026-10-30:** micro1 items 5 + 10 closures both re-confirmed verbatim (item 5 by my text fetch, item 10 on live render); items 13/24 re-confirmed open on live render ($100-150 / $150-300). Terac $65 corroborated on live render; Terac $39 closure re-corroborated on live render (closure banner verbatim) — resolves the delegated text fetch's no-marker render as the known panel-drop class, not a reopening.
+- **2026-10-30:** census — Greenhouse Point72 probe URL now redirects to the Point72 careers hub (form unreachable at that URL; gate lines carried from prior renders; replacement probe role needed). Ashby Ramp form renders fully on live render; code-analysis question presence RE-CONFIRMED (presence only, content withheld). Lever field set matches prior plus Desired Salary newly noted; hCaptcha-on-submit stands. Turing alSSk0vX2k delegated empty-fetch gap closed by my own full-page fetch (LIVE, unchanged). Screened out: Turing MPKlB1_SPo (duplicate-variant), React/TS-primary doors, C# door, non-US-location door, Alignerr city variants (not senior-titled), OpenTrain related rails (below-band/degree-gated/Rust), micro1 mirror-only write-ups.
+
+- **2026-10-31:** item 29 Seattle variant LIVE AGAIN (three instruments: my text fetch, delegated sweep, live-browser render with $20-100/hr tag + Apply present) after the 10-30 REMOVED verdict (HTTP 404 + render 404, two instruments). The 10-30 removal was a true reading yesterday, stale today — Alignerr pages flip. Role is two variants again; closed count 5 → 4.
+- **2026-10-31:** count CORRECTED — 38 live doors / 4 closed, Turing 16 of the 38, one door per canonical URL, enumerated in daily-2026-10-31.md §3. The 10-30 "33 live / Turing 15" line undercounted its own enumeration (Turing 16, item 33 verified 10-29 but never folded into the count; item 34 and the L-series/20NY doors listed live but not counted). Mercor network and Handshake hub are pipeline rows, not doors, named separately so the arithmetic stays checkable.
+- **2026-10-31:** item 35 calibration reward CORRECTED $50 → $100 (today's text fetch: "one-time $100 reward upon completing and passing the Terac calibration exam"). Door terms otherwise unchanged.
+- **2026-10-31:** Greenhouse probe REPLACED — Point72 8356788002 retired (redirected to careers hub 10-30); new probe Planet Labs 7555019 (Software Engineer, Platform Operations, US remote), form renders fully on live render: LinkedIn present NOT required, no attestation checkboxes, privacy consent as text above the form. Lever probe DEGRADED — Worldscape URL 404s on text fetch + live browser; replacement probe role needed; gate lines carried from prior renders.
+
+---
+## 2026-11-01 tick changes (append-only; supersedes the 10-31 queue where noted)
+
+- **Count unchanged: 38 live doors / 4 closed; Turing 16 of the 38.** Closed: 24-MAG careers door, micro1 items 5 + 10, Terac $39. No door changed state 2026-11-01.
+- **Lever probe REPLACED:** Worldscape 6b5089a8 (404 since 10-31) retired; new probe role Extreme Networks Senior SW Systems Engineer (10187), Seattle WA, Hybrid — apply URL https://jobs.lever.co/extremenetworks/3f97b5fc-cf53-4cc7-ac6d-39b8e721e885/apply renders fully on live render. LinkedIn URL PRESENT AND REQUIRED — a hard gate on this Lever form (contrast Greenhouse Planet, LinkedIn optional). Full field set in career-lane/daily-2026-11-01.md §2.
+- **Greenhouse probe refined:** Planet 7555019 form re-renders fully (same field set; LinkedIn optional; no attestation checkboxes). New detail: invisible-style reCAPTCHA badge icon bottom-right — not an interactive gate, no code widget. Gate line unchanged.
+- **HI7GzvKjPF crawl caveat SUPERSEDED:** fresh 2026-11-01 fetch serves current copy; the 2026-10-17-crawl caveat no longer applies.
+- **CUZsKnwt7P stale-risk SHARPENED:** $75/hr + May-4-2026 tentative start unchanged, but that start date is now past while the listing still serves.
+- **Title renders noted:** Surge page now "Senior Software Engineer: Agentic Coding RL Environments" ($100–150+/hr stands, plus a "$200–300k+/year" page line — not a second door); OpenTrain backend door now renders "Backend Engineer – Remote" (slug unchanged, $30–100/hr equiv stands).
+- **Alignerr cd5a8955 HELD as duplicate posting, NOT numbered, NOT counted:** "Software Engineer - Python (Advanced)" live on two instruments, but side-by-side comparison with tracked c6185f8a shows same title, terms, must-haves, nice-to-haves, no city-variant copy. Per the Turing-duplicate precedent, same role twice is not a new door. Promotable only on distinct requisition metadata from Timmy's host read.
+- **Terac $39 + micro1 item 5 closures RE-CONFIRMED on render** (verbatim banners, no Apply); the delegated sweep's text-fetch flags on both are the known panel-drop / shell classes, not reopenings. Item 35 re-confirmed on my direct fetch ($110/hr + $100 calibration reward + Apply).
+- **Ashby code-question presence RE-CONFIRMED on render** (presence only). LinkedIn REQUIRED on the Ramp probe role.
+- **Pipeline tally unchanged: 11 submitted / 2 interviews / 0 offers / 2 rejections.**
+
+- **2026-11-02:** Greenhouse probe URL CORRECTED in the body (slug `planet` → `planetlabs`): the old boards URL now renders "Page not found / The job board you were viewing is no longer active" on two instruments, but the board is active at job-boards.greenhouse.io/planetlabs (124 jobs) and job 7555019 is live there as "Software Engineer, Platform Operations" (US, Remote) with the same field set and LinkedIn still optional. The 11-01 "boards URL redirects to job-boards subdomain" line is superseded by the exact new URL. The reCAPTCHA badge noted 11-01 was not visible in today's render — render variance, gate line unchanged (no interactive captcha, no code widget).
+- **2026-11-02:** micro1 item 13 text-fetch gap CLOSED by live render (LIVE, $100–150/hr badge + "Apply now" panel, no closure). The sweep's "stands unconfirmed" cell is superseded; item 13 was already counted live, so the 38/4 count does not move.
+- **2026-11-02:** Ashby Ramp probe overview salary noted ($211.4K–$290.6K + equity) — a full-time probe-role figure, not a door rate and not carried into any door cell.
+- **2026-11-02:** G2i re-flagged by the sweep's scout (BuiltIn mirror, $100–200/hr, published 2026-10-22) — NOT queued: mirror-only (unverified on G2i's own page) and G2i is decided SKIP in this pipeline. The flag is recorded here so it isn't mistaken for a reopened door.

career-lane/apply-queue-2026-11-03.md

@@ -0,0 +1,429 @@
+# APPLY QUEUE — 2026-11-02 (for Timmy to queue, Alexander submits)
+
+**Authority:** Alexander asked Zeph to send Timmy "everything I can apply for
+today" and have Timmy queue it for Alexander's own submission. Escalation path:
+Zeph → Timmy (pipe) → Alexander (Telegram); Zeph never relays decisions and
+raises nothing in chat. **Rules:** Timmy queues only — never submits, never
+creates accounts, never contacts anyone on Alexander's behalf. He carries the
+open questions below to Alexander DIRECTLY via Telegram. Materials are
+public-safe (professional name only; no email, phone, or private facts).
+Supersedes apply-queue-2026-11-02.md. Compiled by Zephyrus Sparkborn,
+2026-11-03. Liveness verified from a clean external network unless
+marked otherwise. **2026-11-03 tick: count moves 38 → 39 live / 4 closed, Turing 16; one new possible door (item 36, Confisa Senior Platform Engineer — contractor, remote, pay unstated output-based); Turing TYlOyKn9UO HELD as N1 duplicate (word-for-word same door, not counted); Alignerr cd5a8955 (duplicate-held, not counted) now 404s on text + render — watch for flip-back, not a door closure; Greenhouse/Ashby/Lever probes re-confirmed (LinkedIn optional / required / required; Ashby code-analysis presence re-confirmed; Greenhouse reCAPTCHA badge visible again — render variance); Terac $65/$39/item 35 + micro1 5/10/13/24 + Alignerr 28/29 re-confirmed on render.**
+
+**Corrections folded into the body this tick (append-only history preserved in
+daily-2026-10-21.md's corrections section; reply-80 year fix logged 2026-10-22):** N5 Alignerr pay is **$60–80/hr
+on the page header** (my 10-20/10-21 "unstated" was wrong; third-party
+$60–120 range dropped); the six corroborated Turing doors now carry their
+**page-title labels** (reply-78 table), not feed labels — `HI7GzvKjPF` is
+"Senior Python Engineer – AI Agents Evaluation" (not "GenAI Security");
+`Xqiv8zPNaw` is the actual GenAI Security door.
+
+## Pipeline tally
+**11 submitted / 2 interviews / 0 offers / 2 rejections.** The Alignerr
+item-29 Seattle variant is LIVE AGAIN (full page on two text fetches
+2026-10-31, after 404ing on two instruments 2026-10-30) — the role is two
+city variants again, and the closed count moves 5 → 4. Count CORRECTED:
+the 10-30 "33 live / Turing 15" line undercounted its own enumeration
+(Turing is 16, item 33 verified 10-29 but never folded into the count);
+going forward the count is the enumeration: **38 live doors / 4 closed,
+Turing 16 of the 38**, one door per canonical URL, Mercor network and
+Handshake hub named separately as pipeline rows, not doors. **2026-11-03:
+count moves 38 → 39 live / 4 closed, Turing 16 of the 39** (item 36 Confisa
+added; Turing TYlOyKn9UO held as N1 duplicate, not counted; Alignerr
+cd5a8955 duplicate-held now 404ing, not counted either way). Item-35
+calibration reward CORRECTED to $100 (was $50). Greenhouse probe replaced
+(Point72 retired; Planet Labs 7555019 now the probe role, form renders
+fully, LinkedIn optional). Lever probe DEGRADED (Worldscape URL 404s on
+text fetch + live browser — replacement probe role needed). Ashby
+code-analysis question presence re-confirmed on live render
+(presence only). No new submissions.
+
+## Queue order (by conversion speed)
+
+### 1. "Senior Software Engineer – AI Evaluation / Coding Agents" — TURING DOOR ONLY ⭐ APPLY-READY, best-structured interview this month
+- URL: https://work.turing.com/r/bs71Txx0ar (LIVE, full copy re-read 2026-10-22)
+- The 24-MAG careers-page door is CLOSED (genuine 404, two hosts, 10-21). The
+  project is the same one (word-for-word dedupe verified by Timmy); only the
+  Turing door remains.
+- Terms: freelance/contract, remote North America only, 20–40 hrs/week with
+  ≥6 hrs/day PT overlap (~3–9pm ET — lifestyle call), ~3-month project, start
+  ASAP. **Pay: $100–150/hr — the form asks for a specific rate expectation,
+  so the number is a concrete decision.**
+- Work: review AI-generated code, design rubrics and acceptance criteria,
+  repo-level analysis, eval-infrastructure pipelines. Two years of Alexander's
+  daily Q-audit work, nearly verbatim.
+- Interview (three stages, from the live page): ~25-min AI interview →
+  ~30-min practical (reviewing AI-generated code, not algorithms) → ~20-min
+  hiring-manager chat.
+- Gates: 5+ years hands-on SE, Python listed FIRST among languages (no
+  React/Node hard requirement), code review, written communication, modern LLM
+  tooling; "LLM evaluation or coding-agent experience is advantageous." **No
+  degree requirement anywhere.** Named gap (not hidden): the 24-MAG page's
+  "GitHub-based development workflows" line — his public review work lives on
+  Gitea; name it in the application, don't hide it. Five of six gates clear.
+- Caveats: the page mentions TypeScript/JavaScript, Go, Java among skills —
+  none is a hard requirement, but Alexander knows his denialist lines. First
+  stage is an AI interview, so the standing rule applies: **pause ALL Mac
+  automations before it** (pre-flight procedure: `interview-preflight-24mag.md`).
+- **Paste-ready pitch (public-safe):**
+
+> I'm Alexander Payne, a senior backend engineer (Python) contracting
+> independently. For the last two years my day job has been directing and
+> evaluating AI coding agents end to end on real repositories: reviewing
+> generated implementations for correctness, robustness, and maintainability;
+> designing the acceptance criteria and rubrics the evaluations run on; and
+> making release decisions on agent output at the diff level. Underneath that,
+> 5+ years of production Python — Django, Flask, REST APIs, PostgreSQL,
+> Docker, CI/CD — so I judge generated code the way someone who has shipped
+> it does: by reading it, running it, and checking the tests. I'm comfortable
+> cloning an unfamiliar repo, reading its architecture cold, and writing up
+> exactly where the model went wrong and why. Remote, US-based, available to
+> start immediately, fine with the PT overlap.
+
+- **OPEN FOR ALEXANDER (Timmy to ask directly):** go or no-go on the Turing
+  door, and his rate inside $100–150.
+
+### 2. Data Annotation — "Software Engineer"
+- URL: https://dataannotation.tech/job-board/software-engineer (LIVE 2026-10-22, 200 after redirect)
+- Terms: remote, weekly payouts. Pay: **Up to $150+/hr** depending on task
+  difficulty and specialization. **No degree required.**
+- Work: run agentic coding sessions on real engineering tasks, analyze what
+  the models produce, red-team them until they fail in interesting ways.
+  Distinct door from the Backend Engineer track.
+
+### 3. OpenTrain — "Backend Coding Task & Verifier Specialist"
+- URL: https://www.opentrain.ai/jobs/backend-coding-task-and-verifier-specialist--cmu9linxg000o0bgm9xiw33b9/ (LIVE 2026-10-22, 200)
+- Terms: remote, US-eligible, ~15 flexible hrs/week, mid-senior.
+- Pay: **$30–100/hr equivalent, paid per task.**
+- Work: create backend coding tasks and deterministic verifiers for AI
+  systems. Python listed first. Modest pay, clean fit.
+
+### 4. Terac — "Software Engineers: Paid Code Review for AI Agent Evaluation"
+- URL: https://terac.com/opportunities/XJ4I47Bp6ExVHmNY (LIVE, full copy re-rendered 2026-10-24; published 2026-10-02)
+- Terms: remote, hourly. Pay: **$65/hr** (Timmy's on-page read 10-21, Documented). "15 spots left" badge remains client-side-only — carried as my live-browser read, not a verified count.
+- **Render note 2026-10-26:** live-browser render confirms the side panel reads "Earn $65 per hour" with an "Apply to this opportunity" button and no closure notice — the $65/hr cell is now **live-render confirmed**, not variance-flagged. (The text fetch still shows "Hourly Remote" only: the pay lives in the side panel the extractor drops.)
+- **NEW named contact:** Zachary "Zac" Baker, Co-Founder & CEO (co-founded 2025 with Jack Blair; source: greenbook.org/company/Terac directory; public business line +1 (703) 405-1525; careers@terac.com held). He reaches out.
+
+### 5. micro1 — Senior SWE ($245–280/hr) — CLOSED 2026-10-24
+- URL: https://jobs.micro1.ai/post/3d79ba82-926b-48c0-9d15-8791a364ea81 (page renders 2026-10-24 AND states "This job is currently closed and not accepting applications." — rendered closure, confirmed by two reads this run: my own browser.open + scout instrument)
+- Terms were: remote contractor, published 2026-08-27, $245–280/hr.
+- **Do not route Alexander here.** Corroboration-requested: Timmy host re-read of the closed banner (status flip).
+- Correction: my 10-23 "URL-DEAD" verdict for micro1 was a wrong-domain artifact (fetches hit `micro1.ai/post/` instead of `jobs.micro1.ai/post/`). The canonical pages render; this closure is real, on the correct domain.
+
+### 6. Vettedlance — "Senior SWE, Agentic Coding Evaluation"
+- URL: https://vettedlance.com/jobs/senior-software-engineer-agentic-coding-eval (LIVE 2026-10-22, 200)
+- Terms: hourly contractor, remote flexible PT, 10–40 h/wk, weekly USD.
+- Pay: **$80–120/hr.** "Hiring now." Paid coding assessment before project
+  work. "Vettedlance never charges candidates" (free-tier rule holds).
+
+### 7. Askable — "Software Engineer, AI Coding Tasks"
+- URL: https://www.askable.com/experts/roles/senior-software-engineer (LIVE 2026-10-22, 200)
+- Terms: contract after paid technical task; remote, any location; ≥10 h/wk.
+- Pay: **US$1,000 per accepted task** (not hourly).
+- Gate: code you own merged into a public open-source repository
+  (employer/client code excluded). **OPEN FOR ALEXANDER:** does he have
+  qualifying OSS work?
+- **NEW named contact:** John Goleby, Co-Founder & CEO of Askable (Brisbane; US/UK/Chicago offices; $22M AirTree-led Series A **Dec 2024** — sources: devopsdigest.com/askable-joins-vendor-forum, thebusinessfrontier.com, cmotech.uk; the year is 2024 per PRNewswire's "CHICAGO, Dec. 13, 2024" dateline, Askable's own blog, Business Insider — my "all 2026" was wrong, fixed 2026-10-22 per reply 80). The funnel is self-serve, but he can go direct on the OSS-gate question. He reaches out.
+
+### 8. Turing M2 — "Senior SWE – Python (LLM Evaluation & Repository Validation)"
+- URL: https://work.turing.com/r/C94ooVlx1g (LIVE, full copy re-read 2026-10-22)
+- Terms: contractor, remote, 4–8 weeks, ≥4 h/day (20 h/wk) with 4 h PST overlap.
+- Gates verbatim: degree line, "Minimum 8 years … in leading product companies
+  or technology startups", Python mandatory + Java/Go/C++. **OPEN FOR
+  ALEXANDER:** go/no-go + rate.
+
+### 9. Turing N2 — "Senior SWE – LLM Evaluation (US-based)"
+- URL: https://work.turing.com/r/b9OgTSjjGs (LIVE, full copy re-read 2026-10-22)
+- Terms: contractor (no medical/paid leave), US-based required, 10–40 h/wk
+  flexible, 1 month (+ext). AI video interview required.
+- Fit: code curation "primarily in Python", agent/verification-tooling work,
+  3+ yrs. **Caveat:** additional work in JavaScript (incl. ReactJS), C/C++,
+  Java, Rust, Go (on-page) — denialist risk.
+- **New on-page data point (10-22):** "Ideal Background" section names
+  frontier-AI employers (OpenAI/NVIDIA/Databricks/Palantir/Snowflake) and
+  "especially welcome" CS programs (UW/UIUC/UT Austin/Michigan/Purdue) —
+  "though exceptional experience and skill always take precedence over
+  pedigree." Flagged as a funnel signal, **not** a hard gate.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 10. micro1 — "Junior SWE" ($150–200/hr) — CLOSED 2026-10-24
+- URL: https://jobs.micro1.ai/post/29ba0d51-2d9f-412e-ad19-5f28a76ca96e (page renders 2026-10-24 AND states "This job is currently closed and not accepting applications." — rendered closure, confirmed by two reads this run)
+- Terms were: contractor, remote, $150–200/hr, published 2026-10-12.
+- **Do not route Alexander here.** Corroboration-requested: Timmy host re-read of the closed banner (status flip despite the recent publish date).
+
+### 11. Alignerr N5 — "Senior Machine Learning Engineer" ($60–80/hr ON PAGE, Timmy 10-21)
+- URL: https://www.alignerr.com/jobs/20c08939-56c2-4351-a47a-efcdf022eca5 (LIVE 2026-10-24; pay Documented from the page header by Timmy 10-21: "Senior Machine Learning Engineer $60-80/hr Remote Freelance CODING")
+- **Render note 2026-10-24:** the $60–80/hr figure does NOT appear in the 10-23 or 10-24 renders (Hourly Contract / Remote / 10–40 h/wk only). The body pay cell keeps Timmy's Documented read; the variance is flagged, not a pay change — a Timmy host re-read settles it.
+- Terms: hourly contract, remote, 10–40 h/wk, fully async.
+- Work: LLM training/eval data authoring — reasoning traces, model-failure analysis; adjacent to the AI-eval seat. No LinkedIn/degree required per listing.
+- Caveats: framed for ML practitioners; pay below the top band.
+- **OPEN FOR ALEXANDER:** take or pass.
+- Direct lane stays weak (self-serve funnel; Labelbox CEO Manu Sharma named-only).
+
+### 12. Terac — "Part-Time Full-Stack Engineers: Farm-Data Platform Development" ($39/hr, Timmy 10-21) — CLOSED 2026-10-25
+- URL: https://terac.com/opportunities/EW5rvZqnDf0sO6qQ (CLOSED 2026-10-25: live-browser render shows "This listing has closed, but Terac posts new paid opportunities regularly. Sign up to get matched with similar work." with no Apply button or application form for this listing — corroborating Timmy's 2026-10-25 host re-read at `0ba6be9` (closure banner + `isClosed:true`) and sol's sweep. Correction per reply 99 §2: the banner IS in a plain text fetch of the same URL (200/213,617 B, closure sentence twice) — the scout extractor drops the panel, the plain fetch surfaces it. The 10-25 "text fetches neither confirm nor refute" sentence was an instrument generalisation, corrected here.)
+- Terms were: independent contractor, remote any timezone, ~15 h/wk, 1+ year engagement, weekly pay. Pay was Documented $39/hr on page per Timmy 10-21.
+- **Do not route Alexander here.** Decision 9 (take or pass) is WITHDRAWN as moot 2026-10-25.
+
+### 13. micro1 — "Open Source Contributor (GitHub)" ($100–150/hr)
+- URL: https://jobs.micro1.ai/post/18a809aa-0b7f-4523-ac0e-508c9f0f6f66 (LIVE canonical, re-read 2026-10-24 on two reads this run: title "Open Source Contributor (GitHub)", $100–150/hr, published 2026-09-16; apply/process sections render, no closed banner).
+- ~~Corroborated LIVE 10-21 via six mirrors (canonical URL malformed; true UUID unresolved)~~ — struck 10-23: the full UUID sat in `micro1-oss-maintainer-2026-10-20.md` line 39 all along; the truncation was mine at write time (reply 81).
+- Terms: global remote contractor, ~15 h/wk, flexible; ~100 openings.
+- Gates: public/verifiable GitHub profile with meaningful ownership; Alexander's public review work lives on Gitea — the standing GitHub gate gap. Compensation per-task with minimum weekly submissions — treat band as nominal.
+- **OPEN FOR ALEXANDER:** queue-add his call (pending the GitHub-gate honest read).
+
+### 14. Corroborated Turing doors — all LIVE (Timmy's host, reply 78, 10-21) — weighable now
+- r/Y74n4sPVv9 — **Senior Software Engineer – LLM Evaluation**: 10–40 h/wk, contractor, 1 mo, partial PST overlap. **No $ on page.**
+- r/HI7GzvKjPF — **Senior Python Engineer – AI Agents Evaluation**: full-time contractual, 40 h/wk, 1 mo, remote. **No $ on page.** (Label corrected — not GenAI Security.)
+- r/CUZsKnwt7P — **Agentic Coding Evaluation Specialist (Contract)**: **"Compensation: $75/hour"**, ~2–4 weeks (+ ext). **Stale-risk flag 2026-10-25:** body also states "Project start date: May 4, 2026 (Tentative)", rolling "until the batch is full" — still rendering, no closure marker, but weigh as backfill/batch, not a fresh project.
+- r/JHrOLgPhXZ — **Senior Backend Engineer (Python/FastAPI) – AI Evaluation (US-based)**: 10–40 h/wk, contractor, 1 mo. **No $ on page.**
+- r/Xqiv8zPNaw — **GenAI Security Evaluation Engineer**: **"Pay up to $150/hr depending on internal evaluation and location"**, freelance/remote/contractor, up to 2 weeks. (The actual GenAI-Security door.)
+- r/alSSk0vX2k — **Senior Software Engineer – LLM Evaluation (US/Canada/WEU)**: 10–40 h/wk, contractor, 1 mo. **No $ on page.**
+- Four doors state no figure — weigh on fit, not pay.
+
+## UNVERIFIED this tick (hold, do not queue)
+- micro1 Senior Platform Engineer re-post: still absent from the board (JS shell; mirrors only) — stays dropped, watching for a re-post.
+
+## DROPPED
+- **24-MAG careers-page door — CLOSED 2026-10-21** (live-browser 404 + Timmy's host 404). The project continues via item 1 (Turing door).
+
+## Open decisions (for Alexander, via Timmy on Telegram — NOT via Zeph)
+1. Item 1 (Turing door, $100–150/hr project): go/no-go + his rate number.
+2. Item 8 (Turing M2): go/no-go + rate (carried from 10-13 — still unanswered).
+3. Item 9 (N2): take or pass (React caveat + new pedigree-language note).
+4. Item 5 (micro1 $245–280/hr): ~~authorization to start the candidate account + AI interview + skill assessments~~ — WITHDRAWN 2026-10-24: door CLOSED (rendered banner).
+5. Item 7 (Askable): does he have qualifying OSS-merged work — and whether to go direct via John Goleby.
+6. Item 11 (N5 Alignerr MLE, $60–80/hr on page): take or pass.
+7. Item 4 (Terac $65/hr): window open — and whether to go direct via Zachary Baker.
+8. Item 10 (micro1 "Junior SWE" $150–200/hr): ~~queue-add his call~~ — WITHDRAWN 2026-10-24: door CLOSED (rendered banner).
+9. Item 12 (Terac $39/hr farm-data): ~~take or pass~~ — WITHDRAWN as moot 2026-10-25: door CLOSED (live-render corroborated).
+10. Item 13 (micro1 OSS Contributor $100–150/hr): queue-add his call (GitHub-gate honest read).
+11. Item 14 (six corroborated doors): weigh on fit now that liveness is Documented.
+12. Item 25 (OpenTrain GenAI Security $150/hr): take or pass — conditional on genuine appsec depth.
+13. Item 28 (Alignerr Senior SWE – AI Evaluation): take or pass — pay CORRECTED 2026-10-27 to $60-120/hr on page (Timmy Documented, reply 112 §2); hourly contract, remote, 20–40 h/wk.
+14. Item 29 (Alignerr Senior SWE – AI Infrastructure): take or pass — pay $20-100/hr on page (CORROBORATED 2026-10-30 on live render, matching Timmy raw-byte, replies 129 §2.1 / 130 §3); hourly contract, remote, 20–40 h/wk. Seattle variant URL REMOVED 2026-10-30 (HTTP 404 + render 404, two instruments), **LIVE AGAIN 2026-10-31 (three instruments)** — role two variants again. Timmy's read: pass (below band).
+15. Item 30 (Alignerr Senior Systems Engineer – AI Data & Infrastructure): take or pass — pay CORRECTED 2026-10-28 to $50-75/hr on page (Timmy raw-byte, replies 129 §2.2 / 130 §3); hourly contract, remote, 20–40 h/wk. Timmy's read: pass (below band).
+16. Item 31 (Turing bAJ2YQwFKG, systems-Python door): take or pass — new verified door 2026-10-28, contractor, US-based, 10–40 h/wk, 1 month + extensions; ReactJS-in-overview caveat; pay unstated in text fetch.
+17. Item 32 (OpenTrain Secure Coding-Agent Benchmark Engineer): take or pass — new verified door 2026-10-28, remote worldwide, 4–8 wks, 20+ h/wk; M2 twin shape; pay not provided in the listing; security-conditional. NO expiry line: OpenTrain validThrough is render-synthesized build+30d, never a deadline (reply 145 §0).
+18. Item 33 (Turing -8ebgtrDpF, Agent Trace Collection): take or pass — new verified door 2026-10-29, $100/hr, contractor, 3 mo, North America, 20+ h/wk with 4h PST overlap; Copilot CLI agent-trace pipeline in Azure (OTLP/OpenTelemetry, PII/secret scrub, trace viewer). Caveat: posting requires 3+ yrs Azure (or comparable major cloud with clear transfer to Azure PaaS) + 2+ yrs observability/telemetry with direct OpenTelemetry experience — Azure depth is a stated bar, not a claim to make lightly.
+19. Item 34 (Data Annotation DevOps Engineer, AI Training): take or pass — new verified door 2026-10-29, up to $150+/hr by task difficulty, no degree required, remote. Caveat: posting asks for comfort with a major cloud and tools like Terraform, Kubernetes, or Docker — K8s/Terraform depth is a stated comfort requirement; do not over-claim.
+20. Item 35 (Terac AI Slide Deck Evaluation): take or pass — new verified door 2026-10-30, $110/hr + one-time $100 calibration-exam reward (CORRECTED 2026-10-31 from $50), independent contractor, fully remote, own schedule, weekly pay, screening interview first. Caveat: evaluation/review work (rank technical slide decks for clarity, structure, effectiveness), not platform building.
+21. Item 36 (Confisa Senior Platform Engineer): take or pass — new possible door 2026-11-03, contractor, remote; cloud-infra RL-environment task creation (reproducible containerized environments, deterministic validation tests, golden reference solutions, intentionally defective variants); screening questions → ~30-min AI interview → hiring-manager review. Caveats: pay UNSTATED and output-based (per accepted task, minimum weekly submissions); "typically fill roles within 48 hours" urgency pattern; vendor funnel, client unnamed; required bar includes "personal ownership of a production platform" (Terraform/AWS/K8s familiarity preferred, not ownership-demanded — do not over-claim).
+
+## New lead-grade items 10-22 (scout + corroborated top two by my reads)
+
+### 15. Surge AI — "Senior Software Engineer: Agentic Coding RL Environments" ($100–150+/hour) ⭐ NEW TOP FIND
+- URL: https://surgehq.ai/swe (LIVE, full copy re-read by me 2026-10-22; scout instrument corroborates)
+- Terms: fully remote contractor, 20–40+ hrs/week, choose-your-schedule, async Slack, own equipment.
+- Pay: **$100–$150+/hour on page** ("Pay scales with your expertise"; "Some projects go well past the top of that range"; header "Make $200–300k+/year").
+- Work: build coding RL environments and benchmarks for frontier labs; review & red-team model output; write tests, rubrics, success criteria; structured feedback that improves future models.
+- Gates: professional SWE experience shipping scaled production systems; strong judgment about good code and model failures; expertise in at least one common stack incl. Python; **no AI/ML background required, no degree, no LinkedIn.**
+- Process: 2-hour coding capability screen → ID verification → paid first task.
+- Fit: near-perfect lane match — his 2-year agent-directing/eval background maps 1:1 (this is the work he does daily on the archive audits).
+- **OPEN FOR ALEXANDER:** go or no-go + whether to start the 2-hour coding screen.
+
+### 16. workfindy.com — "Senior AI Engineer (Contract)" ($100–150/hr)
+- URL: https://workfindy.com/jobs/8f257919-3692-4422-ba07-60e05805ce8a (LIVE, full copy re-read by me 2026-10-22)
+- Terms: contractor, remote US/Canada, ≥20 h/wk + 4 h PT overlap, 3-month contract, start soon; no medical/paid leave.
+- Pay: **$100–$150/hr USD** (on-page).
+- Work: build data pipelines, review AI outputs, develop quality criteria; "a significant part of the role is being able to explain *why* one response is better than another."
+- Gates: 5+ yrs Python/TS/JS/Go; hands-on AI preference data or eval rubrics; US/Canada-based; no LinkedIn, no pay-to-evaluate. Published 2026-10-05T16:44:58Z.
+- **Caveat: employer unnamed — apply by "DM the poster"** (conversion risk).
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 17. Turing — "Senior Python Engineer – LLM Evaluation" (US-based) (L2)
+- URL: https://work.turing.com/r/HfWfAxm6VX (rendered open today, scout instrument)
+- Terms: remote contractor, US-based, 10–40 h/wk, 1 mo +ext; pay not stated.
+- Work: Python-primary eval + verification tooling; 3+ yrs SWE; AI video interview required.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 18. Turing — "Software Engineer – AI Research & Evaluation" (US-based) (L3)
+- URL: https://work.turing.com/r/7XiC0Ev2xx (rendered open today, scout instrument)
+- Terms: same engagement shape; pay not stated.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 19. Turing — "Senior Python Engineer – LLM Evaluation" (systems emphasis) (L4)
+- URL: https://work.turing.com/r/3tkNgppkIt (rendered open today, scout instrument)
+- Terms: same engagement shape; pay not stated; systems/infra bent — Go/Rust/C++ named but Python first, no hard ownership demanded.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 20. Alignerr — "Senior SWE — Agentic Coding" (L6)
+- URL: https://www.alignerr.com/jobs/5c4ccb04-ae5e-4274-8a60-6262aa3cb81f (rendered open today, scout instrument)
+- Terms: hourly contract, remote, 10–40 h/wk; pay not stated. Caveat: intro copy mentions "Berlin" though terms say Remote.
+- **2026-10-28 note:** second city variant verified open today — New York copy at https://www.alignerr.com/jobs/c002014e-c0a5-4a17-958c-6e2e4169ce71 (hourly contract, remote, 10–40 h/wk, same role body). Per the item-29 city-variant rule this is item 20's second variant, NOT a new numbered item; the scout's "new lead" call on this page is corrected here. Count unchanged.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 21. Alignerr — "Senior SWE — AI Evaluation & Benchmarks" (L7)
+- URL: https://www.alignerr.com/jobs/f15503d4-74ca-41f3-87e2-e7ccdc39beae (rendered open today, scout instrument)
+- Terms: hourly, remote, 3-month; pay not stated. Caveat: "proven LLM benchmark design experience" strongly worded.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 22. Alignerr — "Software Engineer - Python (Advanced)" (L8)
+- URL: https://www.alignerr.com/jobs/c6185f8a-b748-46b5-9e7a-57e0f652356b (rendered open today, scout instrument)
+- Terms: hourly, remote, 10–40 h/wk; pay not stated. Caveat: "consulting/client-facing experience" must-have; AI-code eval is nice-to-have, not core.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 23. Handshake AI — AI Trainer (filler-hours track) (L9)
+- URL: https://joinhandshake.com/ai/opportunities (canonical program page rendered open today, scout instrument)
+- Terms: independent contractor (not FT), fully remote, ~5–20 h/wk when assigned, year-round; pay not stated. 4+ yrs SWE, US-eligible, no LinkedIn/degree mandate.
+- **OPEN FOR ALEXANDER:** worth a profile, his call.
+
+### 24. micro1 — "Open Source GitHub Maintainer" ($150–300/hr) — NEW NUMBERED ITEM 2026-10-23 (row verified 10-20; promoted from supplement per reply 81)
+- URL: https://jobs.micro1.ai/post/51a65c2c-07dd-4307-aba6-f7c4af17311c (LIVE — canonical detail page re-read 2026-10-24; "Apply now" renders; published 2026-08-14)
+- Terms: contractor, remote global, 15 h/wk, flexible; minimum weekly task submissions; "typically fill roles within 48 hours." Pay **$150–300/hr**, output-based per accepted task (pace-dependent — treat as nominal).
+- Work: review LLM-generated code patches for the repository the expert maintains; detailed written justifications; peer-review other experts' submissions. In-lane (diff-level review + written justification — Alexander's daily shape).
+- Gates: "Applicants must have clear open source contributions and profiles to showcase it like GitHub or GitLab" (page-verbatim). Same Gitea-gap as item 13: name the forge profile in the application, don't hide it. Preferred: OSS-maintenance experience; contributor-code review experience.
+- Process: screening questions → ~10-min AI interview → hiring-manager review. (Mac-automation pause before the AI interview.)
+- **OPEN FOR ALEXANDER:** queue-add his call. (Top-band micro1 family — weigh alongside items 13 and 24 now that items 5 and 10 are closed, not only in `micro1-oss-maintainer-2026-10-20.md`.)
+
+### 25. OpenTrain — "GenAI Security Evaluation Engineer" ($150/hr) — NEW 2026-10-24, SECURITY-CONDITIONAL
+- URL: https://www.opentrain.ai/jobs/genai-security-evaluation-engineer--cmuxyhp6w000606nucgoq7baa/ (LIVE canonical detail page, full fetch 2026-10-24; posted Oct 7, 2026)
+- Terms: contract, part-time, 20+ h/wk, open worldwide. Pay: **"$150 per hour"** stated as hourly (not per-task equivalent) on page.
+- Work: build/test vulnerable GenAI agent and RAG codebases, annotate security risks, evaluate detection tools. Requires 5+ years in application/product security or security-focused SWE including secure code review; source-to-sink/taint analysis, SAST, CodeQL or Semgrep; LLM agents/RAG (LangChain/LlamaIndex/OpenAI or Anthropic SDKs or MCP); production Python and/or TypeScript.
+- **Caveats (read before relaying):** (a) security-specialist door — fits only if the appsec depth above is genuinely present; do NOT claim it from the general platform profile. (b) Distinct from Turing's GenAI Security door (item 14 / Xqiv8zPNaw, "up to $150/hr") — do not merge the two. (c) OpenTrain detail pages carry the 2026-10-13 orphan/expiring caveat (referral scheme retired; pages render but may be expiring) — treat as expiring-class until re-read. (d) Application route requires creating a free OpenTrain account (not a pay-to-eval gate stated on page).
+- **OPEN FOR ALEXANDER:** take or pass — conditional on genuine appsec depth, his call.
+- **2026-10-25 note:** today's text fetch confirms title, $150/hr, posted Oct 7, 2026, 20+ h/wk; the page-claimed `validThrough` 2026-11-23 did not re-appear in the text fetch. It stands on Timmy's host read (reply 86 §4) as the page's own claim, not a fact about the employer's intent. 29 days from 2026-10-25.
+- **2026-10-28 note:** title, $150/hr, posted Oct 7, 2026, 20+ h/wk re-confirmed; `validThrough` again absent from the text fetch — and the standing 2026-11-23 cell is CORRECTED: the page's JSON-LD reads **`validThrough` 2026-11-26 beside `datePosted` 2026-10-07** (Timmy raw-byte, replies 129 §2.4 / 130 §3) — a 50-day computed span, **29 days remaining as of 2026-10-28**, quoted in that form from here on, never as a bare expiry date and never as an employer promise.
+
+### 26. Mercor — "Software Engineering Expert" talent network ($70–150/hr) — POSSIBLE, new 2026-10-25
+- URL: https://work.mercor.com/jobs/list_AAABnwpGQEMCh-AXEZdBjbqD/senior-software-engineer-full-stack-typescript-react-aws (canonical page fetched 2026-10-25; the specific Full Stack TS/React/AWS job on it is CLOSED — the open item is the talent network it redirects to)
+- Terms: standing pool — grading model code/design, writing eval problems; DevOps/platform, systems/performance, security tracks; remote, part-time.
+- Pay: **$70–$150/hr** "set per project" — precision per reply 99 §4: the band is stated about past listings ("have posted at"), not promised for the next project. Carry as a band, not a rate.
+- Gates: no degree stated ("Where you trained matters less than whether you have owned code in production"); ~20-min AI interview; no LinkedIn mandate, no pay-to-eval stated.
+- **Caveat: a network, not a dated project** — match timing "within a week or several months". Weigh as a pipeline row, not a project door.
+- **OPEN FOR ALEXANDER:** take or pass as a pipeline row.
+
+### 27. Gramian Consulting — "Python Backend Engineer (AI Agents & SaaS Integrations)" ($300/approved task) — WITHDRAWN 2026-10-26 (reply 99 §1)
+- URL: https://builtin.com/job/python-backend-engineer-ai-agents-saas-integrations/10501641 (BuiltIn mirror only; no canonical Gramian page found)
+- Terms were: remote freelance; Python backend apps, REST APIs, microservices, SaaS connectors; build/validate long-horizon AI tasks + rubrics; 2–3 wks, immediate start.
+- Pay was: **$300 per approved task**, min 1 approved task/day.
+- **WITHDRAWN: the mirror itself carries the removal notice above the title — "removed at 10:06 a.m. (UTC) on Thursday, Aug 13, 2026".** The 10-25 row dated it from the posting date below the notice; the disposition was wrong, the grading was right. It was never a canonical door, so the aggregate does not move. Today's extracted text again omits the notice (extractor drops it) — that neither re-confirms nor refutes the withdrawal, which stands on the reply-99 corroboration. **Do not route Alexander here; not a decision.**
+- Obituary note: `300-300 Hourly` is the mirror's own field; the pay is per approved task, as the body cell already says.
+
+### 28. Alignerr — "Senior Software Engineer – AI Evaluation" (possible) — NEW 2026-10-26, PAY CORRECTED 2026-10-27
+- URL: https://www.alignerr.com/jobs/cfa052f0-e721-4ec5-8d38-d697e534081b (LIVE canonical detail page, fetched open 2026-10-26 and 2026-10-27; corroborated by my own read)
+- Terms: hourly contract, remote, 20–40 h/wk.
+- Pay: **$60-120/hr on page** (CORROBORATED 2026-10-30 on live render, matching Timmy Documented, reply 112 §2). The Timmy-Documented-only provenance is superseded — the badge now renders on an instrument of mine.
+- Work: design/build scalable evaluation pipelines and frameworks; automated testing harnesses, scoring systems, benchmarking tools for LLMs; APIs, dashboards, internal tools for eval workflows; edge cases, failure modes, reliability issues in AI outputs.
+- Gates: 4+ years professional SWE shipping production systems; strong Python (pandas, NumPy, FastAPI/Flask/Django); large datasets + data pipelines; comfortable with cloud infrastructure (AWS/GCP/Azure) and containerized deployments — familiarity, not ownership, do not over-claim; Git/CI/CD/testing; written communication, async remote.
+- Fit: strong in-lane — eval infrastructure is the daily audit shape. No degree stated, no LinkedIn mandate, no pay-to-eval stated.
+- **OPEN FOR ALEXANDER:** take or pass — at $60-120/hr, top in-band, floor below.
+
+### 29. Alignerr — "Senior Software Engineer (AI Infrastructure)" (possible) — NEW 2026-10-27
+- URLs: https://www.alignerr.com/jobs/63d40d5a-d58c-4ce3-9ab3-a997ab255ff2 (Seattle variant — REMOVED 2026-10-30 (HTTP 404 + render 404, two instruments), **LIVE AGAIN 2026-10-31 (three instruments: two text fetches + live render with $20-100/hr tag and Apply present)**) and https://www.alignerr.com/jobs/2d057dd9-3b35-4ba7-a660-468dacfb12e9 (New York variant — LIVE 2026-10-30) — canonical pages fetched open 2026-10-27; identical role copy, city-targeted.
+- Terms: hourly contract, remote, 20–40 h/wk. Work: production-grade AI training/evaluation/deployment pipelines, APIs/data pipelines/backend services at scale.
+- Gates: 5+ years, Python/TypeScript/Go/Java or similar; cloud familiarity (AWS/GCP/Azure); Git/CI/CD. No degree stated, no LinkedIn mandate.
+- Pay: **$20-100/hr on page** (CORROBORATED 2026-10-30 on live render, matching Timmy raw-byte, replies 129 §2.1 / 130 §3). The Timmy-Documented provenance is superseded for the NY variant; the Seattle variant no longer renders at all.
+- Counted as ONE role, two city variants again (Seattle live again 2026-10-31 after the 10-30 removal; see corrections log).
+- **OPEN FOR ALEXANDER:** take or pass. Timmy's read: pass (floor far below band).
+
+### 30. Alignerr — "Senior Systems Engineer — AI Data & Infrastructure" (possible) — NEW 2026-10-27
+- URL: https://www.alignerr.com/jobs/95a64c38-9a72-4dbc-8143-2b8ac23d4de3 (canonical page fetched open 2026-10-27).
+- Terms: hourly contract, remote, 20–40 h/wk. Work: high-performance backend systems, data annotation/validation/evaluation tooling, reliable data pipelines.
+- Gates: 5+ years systems/backend production experience; Go/Rust/Python/C++. No degree stated, no LinkedIn mandate.
+- Pay: **$50-75/hr on page** (Timmy raw-byte, replies 129 §2.2 / 130 §3: header badge + meta description + JSON-LD shortDescription). CORRECTION of the 10-27 "not stated in text fetch" cell — the cell was wrong. Provenance caveat: my 10-28 extraction again surfaces NO pay line (same header-badge class) — the cell is Timmy-Documented, not mine.
+- Fit: strong in-lane (systems + eval infra).
+- **OPEN FOR ALEXANDER:** take or pass. Timmy's read: pass (below band).
+
+### 31. Turing — "Senior Python Engineer – LLM Evaluation" (US-based) (systems-Python family) — NEW 2026-10-28
+- URL: https://work.turing.com/r/bAJ2YQwFKG (canonical page fetched open 2026-10-28, my read).
+- Terms: contractor (no medical/paid leave), remote US-based, 10–40 h/wk, 1 month + potential extensions; AI video interview required; application 15–30 minutes.
+- Work: Python-primary eval + verification tooling with systems emphasis — systems-level code, performance-critical applications, infrastructure; build agents verifying systems-level/infrastructure code quality.
+- Gates: several years SWE; strong systems/infrastructure/backend expertise in Python, C/C++, Rust, Go; production-grade software; architecture/design/debugging/code-quality judgment; written communication.
+- **Caveat: overview mentions JavaScript (including ReactJS)** alongside Python/C++/Rust/Go/Java — React caveat, same class as N2/L4; do not claim React. Required Skills do not name React.
+- Pay: not stated in text fetch. L4-family alternate door — counted per the Turing /r/ convention (each /r/ is an application door); Turing door count moves 12 → 13 with this door.
+- **OPEN FOR ALEXANDER:** take or pass.
+
+### 32. OpenTrain — "Secure Coding-Agent Benchmark Engineer" — NEW 2026-10-28, SECURITY-CONDITIONAL
+- URL: https://www.opentrain.ai/jobs/secure-software-coding-agent-benchmark-engineer--cmv0u6y87000k06i0ytsnui5a/ (canonical detail page recovered from the OpenTrain cybersecurity category page, fetched open 2026-10-28, my read; posted Oct 9, 2026).
+- Terms: contract, part-time, remote worldwide, 4–8 wks, 20+ h/wk with 4 h/day and 4 h PT overlap; apply on OpenTrain (free account) then complete on the hiring platform.
+- Work: design/build realistic benchmark tasks measuring whether AI coding agents complete software work safely and correctly — bug fixes, feature additions, CI repairs, config migrations, integration updates, runtime-state fixes; utility + safety requirements; visible/hidden test suites, safe/unsafe reference solutions, scoring rubrics, calibration notes, runnable evaluators; rollout review (disabling tests, weakening assertions, deleting protected data, leaking secrets, broadening permissions, bypassing validation).
+- Gates: 8+ years hands-on SWE in leading product companies or tech startups; bachelor's or master's in CS or related discipline; strong Python mandatory + Java, Go, or C++; production systems at scale (deployment pipelines, monitoring, logging, observability, distributed tracing, HA, fault tolerance, disaster recovery); practical vulnerability identification, secure fixes, remediation validation; injection/authorization/memory-safety/race-condition/deserialization/secrets/input-validation familiarity required.
+- Pay: **not provided in the listing** (page-verbatim).
+- **Caveats:** (a) M2 twin shape — same 8-yr + degree + Python-mandatory + secure-fix requirements as Turing M2; a distinct door (OpenTrain → hiring platform), not a merge. (b) security-specialist door — fits only if the appsec depth above is genuinely present; do NOT claim it from the general platform profile.
+- **OPEN FOR ALEXANDER:** take or pass — conditional on genuine appsec depth, his call.
+
+### 36. Confisa International Group — "Senior Platform Engineer" — NEW 2026-11-03, POSSIBLE
+- URL: https://jobs.smartrecruiters.com/confisainternationalgroup/744000138837039-senior-platform-engineer (canonical SmartRecruiters board page, fetched open 2026-11-03, my read)
+- Terms: contractor, remote; senior-level cloud infrastructure / platform engineering / DevOps / SRE work — create Reinforcement Learning Environments testing an AI model's ability to design, deploy, troubleshoot, secure, scale, and recover production-grade cloud infrastructure (realistic distributed-systems / networking / security / scalability / reliability scenarios; reproducible containerized environments with valid reference solutions and intentionally defective variants; deterministic integration, load, security, failure-injection, deployment, and recovery tests).
+- Gates: senior-level cloud-infra / platform / DevOps / systems / SRE experience including personal ownership of a production platform; distributed systems, scalable APIs, queues, autoscaling, durable storage, partial-failure scenarios; IAM, private networking, least-privilege, service-to-service security; observability, SLOs, rolling deployments, rollback, disaster recovery; infrastructure automation / testing tools, containerized-environment debugging. Preferred (not ownership-demanded): Terraform/OpenTofu, AWS/Azure/GCP/Kubernetes/multi-cloud, internal developer platforms, chaos/fault injection, eval/grading-system experience.
+- Pay: **not stated — output-based, paid per task meeting project specifications; minimum weekly submissions apply.** Treat as unstated-band, not a rate.
+- Process: screening questions → ~30-min AI interview (recruiter-reviewed) → hiring-manager review. "Typically fill roles within 48 hours" — micro1-family urgency pattern; start first tasks within 24–48h of onboarding if selected.
+- **Caveats:** (a) vendor funnel, client unnamed — no named hiring contact on the page. (b) pay unstated + output-based + minimum submissions — weigh as nominal until a rate exists. (c) the "personal ownership of a production platform" bar is a stated requirement, not a claim to make lightly.
+- **OPEN FOR ALEXANDER:** take or pass — his call (decision 21).
+
+---
+
+## Corrections log (append-only)
+
+- **2026-10-24:** items 5 and 10 CLOSED in the body (per Q3 rule, decisional cells): both canonical pages render AND carry "This job is currently closed and not accepting applications." (two reads this run: my own browser.open + scout instrument). Item 5 ($245–280/hr, published 2026-08-27) and item 10 ($150–200/hr, published 2026-10-12) are withdrawn as application routes; their open decisions are struck above. Corroboration-requested: Timmy host re-read of both banners.
+- **2026-10-24:** my 10-23 micro1 "URL-DEAD" verdict WITHDRAWN — the 10-23 fetches hit `micro1.ai/post/<uuid>` (wrong domain); canonical is `jobs.micro1.ai/post/<uuid>`, and all five canonical pages render today. The wrong-domain 404s were an instrument error, not closures.
+- **2026-10-24:** Alignerr `beae0b1f-…` URL DEAD (404 on text fetch + live-browser 404 page) — dropped from the tracked set; it never rendered as a posting in this record, so it is not a role closure.
+- **2026-10-24:** pay-render variance flagged (not body-corrected): Alignerr N5 $60–80/hr, Terac $65/hr, Terac $39/hr figures — all Timmy-Documented on-page 10-21 — do not appear in the 10-23 or 10-24 renders. Body cells keep Timmy's reads with dated variance notes; a Timmy host re-read settles whether the pages changed or the renders differ.
+- **2026-10-24:** item 25 added (OpenTrain GenAI Security Evaluation Engineer, $150/hr, canonical detail page fetched 2026-10-24, posted Oct 7, 2026) — security-conditional, distinct from Turing's GenAI Security door, OpenTrain orphan/expiring caveat carried.
+
+- **2026-10-23, reply 81:** item 13 body corrected in place (per Q3 rule): canonical URL `https://jobs.micro1.ai/post/18a809aa-0b7f-4523-ac0e-508c9f0f6f66` is LIVE — independently read from two hosts (Timmy 10-22 + this host 10-23: 200 / 42,473 B, title "Open Source Contributor (GitHub)", ideal_hourly_rate $100–150, published 2026-09-16). The "canonical URL malformed; true UUID unresolved" line is struck; the full UUID was in `micro1-oss-maintainer-2026-10-20.md` line 39 — the truncation was my write-time error. Verdict now **Documented (canonical)**, GitHub-gate caveat unchanged.
+- **2026-10-23, reply 81:** OSS-maintainer promoted to numbered item 24 — `https://jobs.micro1.ai/post/51a65c2c-07dd-4307-aba6-f7c4af17311c`, LIVE (canonical read 10-20), $150–300/hr, published 2026-08-14, top-band micro1 family alongside items 5 and 10; **OPEN FOR ALEXANDER:** queue-add his call (via Timmy, not Zeph's relay).
+- **2026-10-22, reply 80:** Askable's Series A year corrected in the body (2026 → **Dec 2024**). The round is real — AU$22M Airtree-led — but it closed Dec 13, 2024 (PRNewswire: "CHICAGO, Dec. 13, 2024"; Askable's own blog and Business Insider carry the same). My "sources … all 2026" line (from the 10-21 scout read) was the error source; disambiguation kept: Askable is Brisbane-*founded*, Goleby's own public profile is SF Bay Area — both true, no edit owed. Daily-2026-10-22.md carries the same error in its §7 line; it is append-only dated record — correction note appended there at the foot, living index here corrected in place per the Q3 rule.
+- **2026-10-25, Timmy host re-read:** **item 12 (Terac "Part-Time Full-Stack Engineers: Farm-Data Platform", $39/hr) is CLOSED** — `https://terac.com/opportunities/EW5rvZqnDf0sO6qQ` returns **HTTP 200 / 215,923 B** at 01:14Z with the closure banner twice in the body and `isClosed\":true` in the embedded JSON; sol's independent 3/3 sweep (`8020091`, WorkBench) agrees. The body's "LIVE 2026-10-24" line is superseded, so decision item 9 ("take or pass") is now moot rather than pending — no door left to answer. Re-read in the same minute: item 24 (micro1 Open Source GitHub Maintainer, $150–300/hr) **LIVE**, 200 / 41,581 B, no closure marker; items 5 and 10 were already CLOSED in this file on 10-24, so this sweep adds one closed door, not three.
+- **2026-10-25:** item 12 CLOSED in the body (per Q3 rule, decisional cells): live-browser render shows the closure notice verbatim with no Apply button or application form for the listing — corroborating Timmy's 2026-10-25 host re-read (`0ba6be9`: banner + `isClosed:true`) and sol's sweep. Decision 9 struck as moot. Text fetches today show no closure language; the notice lives in a rendered side panel text extraction does not surface, so the text fetches neither confirm nor refute it.
+- **2026-10-25:** item 25 expiry note updated: page-claimed `validThrough` 2026-11-23 did not re-appear in today's text fetch; it stands on Timmy's host read (reply 86 §4) as the page's own claim. 29 days from 2026-10-25.
+- **2026-10-25:** CUZsKnwt7P stale-risk flag added to §14: "Project start date: May 4, 2026 (Tentative)", rolling — still rendering, no closure marker; weigh as backfill/batch.
+- **2026-10-25:** items 26 (Mercor talent network $70–150/hr, possible — network, not a dated project) and 27 (Gramian Python Backend $300/approved task, possible — BuiltIn mirror only, Aug 3 dated, freshness unverified) added.
+- **2026-10-25:** OpenTrain "Machine Learning Researcher and Task Reviewer" resolved and screened OUT: canonical detail page found (posted Oct 23, 2026, $60–$120/hr equiv) but it requires a master's degree or PhD — degree-gated, not queued. No longer carried as listing-level-only.
+
+- **2026-10-26:** item 27 WITHDRAWN in the body (reply 99 §1): the BuiltIn mirror carries "removed at 10:06 a.m. (UTC) on Thursday, Aug 13, 2026" above the title. The 10-25 "possible, freshness unverified" disposition was wrong; grading (pay, terms, mirror-only status) was right. Never a canonical door; aggregate unchanged. Not a decision for Alexander.
+- **2026-10-26:** item 12 text-fetch sentence corrected (reply 99 §2): the closure banner IS in a plain text fetch (200/213,617 B, twice); the scout extractor drops the panel, the plain fetch surfaces it. The 10-25 corrections-log sentence ("text fetches neither confirm nor refute") stands as dated record, corrected beside it here.
+- **2026-10-26:** Terac $65 cell upgraded to live-render confirmed: live render shows side panel "Earn $65 per hour" + Apply button, no closure notice. N5 ($60–80/hr) still owes the same two-instrument test.
+- **2026-10-26:** Mercor band precision applied (reply 99 §4): $70–150/hr is about past listings ("have posted at"), not a promised rate.
+- **2026-10-26:** item 28 added — Alignerr "Senior Software Engineer – AI Evaluation" (canonical, fetched open + corroborated by my own read): hourly contract, remote, 20–40 h/wk, pay unstated, 4+ yrs Python eval-infra. Take-or-pass (decision 13).
+- **2026-10-26:** Lever Worldscape gate line corrected (reply 100 §5a) in daily-2026-10-26.md §2: "LinkedIn auto-complete + candidate attestations + hCaptcha-on-submit" (static text does not surface the submit-path captcha). Palantir pairing correction (reply 100 §5b) logged in the same file: a92b55d0 (Senior, 2026-04-06) ≠ 10dfc8bc (non-Senior, 2024-03-11).
+- **2026-10-26:** Ashby Ramp code-sample question presence confirmed a second day on my instrument (10-26 fetch); content deliberately not reproduced (safety notice on the embedded task — not decoded, not run, not quoted). "Agent stop" presence-confirmed; content ungraded.
+
+- **2026-10-27:** item 28 pay CORRECTED in the body (reply 112 §2): $60-120/hr on page (Timmy Documented, 200/43,029 B) — the 10-26 "not stated" cell was wrong. Caveat: my 10-27 extraction + scout text fetch surface no pay line (header block dropped by extraction, same class as Terac $65 / N5) — cell is Timmy-Documented, not mine. Decision 13 reworded.
+- **2026-10-27:** Terac $65 instrument sentence corrected (reply 112 §0.2/§2): pay is ALSO in the fetched bytes (Timmy raw fetch 200/224,340 B, twice) — "render-only" was an extractor property. Today's text-only sweep again drops the panel — consistent, not contradictory. Door stays live on the 10-26 render.
+- **2026-10-27:** Ashby Ramp code-sample question presence confirmed a third day on my instrument (10-27 fetch); content withheld as before. Workday NVIDIA probe window closes 2026-10-28 (live browser + text fetch agree) — probe role only.
+- **2026-10-27:** items 29 (Alignerr Senior SWE – AI Infrastructure, Seattle + New York variants, one role) and 30 (Alignerr Senior Systems Engineer – AI Data & Infrastructure) added as possible — canonical pages fetched open, hourly contract, remote, 20–40 h/wk, pay unstated in text fetch. Decisions 14–15.
+- **2026-10-27:** item 25 expiry note updated: page-claimed validThrough 2026-11-23 stands on Timmy's host read only; 27 days from 2026-10-27.
+
+- **2026-10-28:** items 29/30 pay CORRECTED in the body (replies 129 §2.1–2.2 / 130 §3, Timmy raw-byte): item 29 = $20-100/hr (both variants, header badge span); item 30 = $50-75/hr (header badge + meta description + JSON-LD). The 10-27 "not stated in text fetch" cells were wrong. Caveat: my 10-28 extraction again surfaces no pay line on either page (header-badge class) — cells are Timmy-Documented, not mine. Decisions 14–15 reworded; Timmy's read: pass on both; not re-raised.
+- **2026-10-28:** item 25 expiry CORRECTED in the body (replies 129 §2.4 / 130 §3, Timmy raw-byte): `validThrough` 2026-11-26 beside `datePosted` 2026-10-07 — a 50-day computed span, 29 days remaining as of 2026-10-28. The standing 2026-11-23 cell did not reproduce. Quoted in that form from here on, never as a bare expiry date, never as an employer promise. My text fetches again do not surface validThrough (JSON-LD dropped by extraction).
+- **2026-10-28:** N5 variance note CLOSED in the body (reply 129 §2.5): $60-80/hr now Documented from Timmy's raw-byte read, not only structured-data. Item 28 cell keeps $60-120/hr, byte count dropped (dated readings).
+- **2026-10-28:** process rules adopted (replies 129 §5 / 130 §3, standing): (a) raw-byte pay read before writing any new Alignerr/micro1/Terac pay cell; (b) validThrough always quoted beside datePosted.
+- **2026-10-28:** items 31 (Turing bAJ2YQwFKG, systems-Python door, React caveat, pay unstated) and 32 (OpenTrain Secure Coding-Agent Benchmark Engineer, M2 twin, pay not provided, security-conditional) added as possible — canonical pages fetched open, my read. Decisions 16–17. Item 20 gains a New York variant (c002014e, same role body as L6 Berlin copy) — variant, not a new item; the scout's "new lead" call on it is corrected in the body per the item-29 city-variant rule.
+- **2026-10-28:** census notes — Ashby Ramp form body returned "Fetching application form" only, so the code-analysis question presence is NOT re-confirmed today (10-25→10-27 streak pauses on an instrument limitation, not a removal); Workday NVIDIA text fetch timed out (upstream failure, no HTTP status), live-browser recovery dispatched and pending at push time — gate stands on 10-25→10-27 measurements, probe row retires after today (page line: "at least until October 28, 2026"); Terac $39 text fetch inconclusive (role copy, no closure language, no Apply element), CLOSED verdict stands on the 10-25 live render + reply-99 corroboration, live-browser re-check pending at push time.
+
+- **2026-10-29:** item 25 expiry correction WITHDRAWN (reply 145 §0, interview §2.1 — Q116 landing in daily-2026-10-29): OpenTrain `validThrough` is synthesized at render time as build-time + 30 days, NOT a posting deadline. Three dated readings of item 25 (10-24: 2026-11-23; 10-27: 2026-11-26; 10-28: 2026-11-27) each sit exactly 30 days after their own render instant, and item 32 in the same minute 10-28 carries the identical stamp on a different posting. The 10-28 "50-day computed span / 29 days remaining" cell and the 10-28 "expiry CORRECTED" line are superseded; the 10-24 cell was right as a render stamp and wrong only when treated as a deadline. Standing rule REPLACES rule (b): OpenTrain `validThrough` is never quoted as a deadline; if it must appear, label it `render-synthesized, build+30d`. Item 25 keeps its take-or-pass (security-conditional, $150/hr, 20+ h/wk, posted Oct 7) with NO urgency line. Item 32 never receives an expiry line.
+- **2026-10-29:** count definition corrected (reply 145 §4, interview §2.3): the 10-28 daily's "13 live" was Turing-only mislabeled as a cross-family total. Going forward: one door per canonical URL; Turing 13 inside a 31-door cross-family total, 4 closed — moved to Turing 15 / 33 total today by the verification of wp680rglf0 + JPQ-cmFZSA (previously unverified, now fetched open). Micro1 item 5's closure is NOT re-confirmed today (text fetch returned no extractable content — gap, not a verdict change; a mirror still calls it closed, mirror-only); the closed count of 4 stands on standing verdicts, not on today's fetch.
+- **2026-10-29:** Terac $39 reason superseded (reply 145 §3): the closure IS in a plain fetch (200/213,580 B, `This listing has closed` x2, `isClosed:true`); the 10-28 daily's "extractor limitation, inconclusive" reason was wrong while the CLOSED verdict stands (10-25 render + reply-99 + 10-28 addendum render). Standing rule: when the extractor is silent, run the second instrument before writing "inconclusive". Today's text fetch of the $39 page again shows no closure language and no Apply element — that silence adds nothing; the verdict rests on the prior instruments, not on today's silence.
+- **2026-10-29:** census — Ashby Ramp form body renders fully again (Legal Name, Email, Phone, work location, Resume, LinkedIn, Cover Letter, employer experience questions); code-analysis employer question presence RE-CONFIRMED after the 10-28 shell-only pause (presence only, content withheld). Lever Worldscape field set identical. Greenhouse Point72 still header/footer + "Your submission is processing" only. Workday probe row RETIRED after 2026-10-28 (page line "at least until October 28, 2026", re-confirmed on its last day by the 10-28 addendum live render).
+- **2026-10-29:** items 33–34 added as possible (see decisions 18–19); Turing doors wp680rglf0 + JPQ-cmFZSA verified open (Senior SWE – LLM Eval, US, 1 mo, 10–40 h/wk, pay absent in fetch) — no longer held as unverified. Screened out: Alignerr C# (stack mismatch), Alignerr Tel Aviv variant of item 29 (variant, not a role), Terac SWE Benchmarks $45–75 + LinkedIn/GitHub mandate, Terac South Asian $40, Terac genomics $100 mirror-only, G2i (SKIP stands), OpenTrain related cards (ML/AI Systems $30/task, Life Sciences $280/task out-of-lane, Rust, ML Researcher/Applied Scientist related-card only), Mercor newsletter figures (mirror-only), Surge staff-careers (not a contractor door).
+- **2026-10-30:** item-29 Seattle variant REMOVED (HTTP 404 text fetch + render 404, two instruments); role now NY-URL-only; item-29 pay upgraded Timmy-Documented → Corroborated (live render badge $20-100/hr). Item 28 pay likewise Corroborated ($60-120/hr render badge); N5 $60-80 and item 30 $50-75 also render-confirmed. New render-only cells: L6 $80-120, L7 $80-100, L8 $50-75, item 20 NY $80-120.
+- **2026-10-30:** item 35 added as possible (decision 20): Terac AI Slide Deck Evaluation, $110/hr + $50 calibration reward, canonical page fetched open by my own instrument, published 2026-10-24; evaluation/review work, not platform building.
+- **2026-10-30:** micro1 items 5 + 10 closures both re-confirmed verbatim (item 5 by my text fetch, item 10 on live render); items 13/24 re-confirmed open on live render ($100-150 / $150-300). Terac $65 corroborated on live render; Terac $39 closure re-corroborated on live render (closure banner verbatim) — resolves the delegated text fetch's no-marker render as the known panel-drop class, not a reopening.
+- **2026-10-30:** census — Greenhouse Point72 probe URL now redirects to the Point72 careers hub (form unreachable at that URL; gate lines carried from prior renders; replacement probe role needed). Ashby Ramp form renders fully on live render; code-analysis question presence RE-CONFIRMED (presence only, content withheld). Lever field set matches prior plus Desired Salary newly noted; hCaptcha-on-submit stands. Turing alSSk0vX2k delegated empty-fetch gap closed by my own full-page fetch (LIVE, unchanged). Screened out: Turing MPKlB1_SPo (duplicate-variant), React/TS-primary doors, C# door, non-US-location door, Alignerr city variants (not senior-titled), OpenTrain related rails (below-band/degree-gated/Rust), micro1 mirror-only write-ups.
+
+- **2026-10-31:** item 29 Seattle variant LIVE AGAIN (three instruments: my text fetch, delegated sweep, live-browser render with $20-100/hr tag + Apply present) after the 10-30 REMOVED verdict (HTTP 404 + render 404, two instruments). The 10-30 removal was a true reading yesterday, stale today — Alignerr pages flip. Role is two variants again; closed count 5 → 4.
+- **2026-10-31:** count CORRECTED — 38 live doors / 4 closed, Turing 16 of the 38, one door per canonical URL, enumerated in daily-2026-10-31.md §3. The 10-30 "33 live / Turing 15" line undercounted its own enumeration (Turing 16, item 33 verified 10-29 but never folded into the count; item 34 and the L-series/20NY doors listed live but not counted). Mercor network and Handshake hub are pipeline rows, not doors, named separately so the arithmetic stays checkable.
+- **2026-10-31:** item 35 calibration reward CORRECTED $50 → $100 (today's text fetch: "one-time $100 reward upon completing and passing the Terac calibration exam"). Door terms otherwise unchanged.
+- **2026-10-31:** Greenhouse probe REPLACED — Point72 8356788002 retired (redirected to careers hub 10-30); new probe Planet Labs 7555019 (Software Engineer, Platform Operations, US remote), form renders fully on live render: LinkedIn present NOT required, no attestation checkboxes, privacy consent as text above the form. Lever probe DEGRADED — Worldscape URL 404s on text fetch + live browser; replacement probe role needed; gate lines carried from prior renders.
+
+---
+## 2026-11-01 tick changes (append-only; supersedes the 10-31 queue where noted)
+
+- **Count unchanged: 38 live doors / 4 closed; Turing 16 of the 38.** Closed: 24-MAG careers door, micro1 items 5 + 10, Terac $39. No door changed state 2026-11-01.
+- **Lever probe REPLACED:** Worldscape 6b5089a8 (404 since 10-31) retired; new probe role Extreme Networks Senior SW Systems Engineer (10187), Seattle WA, Hybrid — apply URL https://jobs.lever.co/extremenetworks/3f97b5fc-cf53-4cc7-ac6d-39b8e721e885/apply renders fully on live render. LinkedIn URL PRESENT AND REQUIRED — a hard gate on this Lever form (contrast Greenhouse Planet, LinkedIn optional). Full field set in career-lane/daily-2026-11-01.md §2.
+- **Greenhouse probe refined:** Planet 7555019 form re-renders fully (same field set; LinkedIn optional; no attestation checkboxes). New detail: invisible-style reCAPTCHA badge icon bottom-right — not an interactive gate, no code widget. Gate line unchanged.
+- **HI7GzvKjPF crawl caveat SUPERSEDED:** fresh 2026-11-01 fetch serves current copy; the 2026-10-17-crawl caveat no longer applies.
+- **CUZsKnwt7P stale-risk SHARPENED:** $75/hr + May-4-2026 tentative start unchanged, but that start date is now past while the listing still serves.
+- **Title renders noted:** Surge page now "Senior Software Engineer: Agentic Coding RL Environments" ($100–150+/hr stands, plus a "$200–300k+/year" page line — not a second door); OpenTrain backend door now renders "Backend Engineer – Remote" (slug unchanged, $30–100/hr equiv stands).
+- **Alignerr cd5a8955 HELD as duplicate posting, NOT numbered, NOT counted:** "Software Engineer - Python (Advanced)" live on two instruments, but side-by-side comparison with tracked c6185f8a shows same title, terms, must-haves, nice-to-haves, no city-variant copy. Per the Turing-duplicate precedent, same role twice is not a new door. Promotable only on distinct requisition metadata from Timmy's host read.
+- **Terac $39 + micro1 item 5 closures RE-CONFIRMED on render** (verbatim banners, no Apply); the delegated sweep's text-fetch flags on both are the known panel-drop / shell classes, not reopenings. Item 35 re-confirmed on my direct fetch ($110/hr + $100 calibration reward + Apply).
+- **Ashby code-question presence RE-CONFIRMED on render** (presence only). LinkedIn REQUIRED on the Ramp probe role.
+- **Pipeline tally unchanged: 11 submitted / 2 interviews / 0 offers / 2 rejections.**
+
+- **2026-11-02:** Greenhouse probe URL CORRECTED in the body (slug `planet` → `planetlabs`): the old boards URL now renders "Page not found / The job board you were viewing is no longer active" on two instruments, but the board is active at job-boards.greenhouse.io/planetlabs (124 jobs) and job 7555019 is live there as "Software Engineer, Platform Operations" (US, Remote) with the same field set and LinkedIn still optional. The 11-01 "boards URL redirects to job-boards subdomain" line is superseded by the exact new URL. The reCAPTCHA badge noted 11-01 was not visible in today's render — render variance, gate line unchanged (no interactive captcha, no code widget).
+- **2026-11-02:** micro1 item 13 text-fetch gap CLOSED by live render (LIVE, $100–150/hr badge + "Apply now" panel, no closure). The sweep's "stands unconfirmed" cell is superseded; item 13 was already counted live, so the 38/4 count does not move.
+- **2026-11-02:** Ashby Ramp probe overview salary noted ($211.4K–$290.6K + equity) — a full-time probe-role figure, not a door rate and not carried into any door cell.
+- **2026-11-02:** G2i re-flagged by the sweep's scout (BuiltIn mirror, $100–200/hr, published 2026-10-22) — NOT queued: mirror-only (unverified on G2i's own page) and G2i is decided SKIP in this pipeline. The flag is recorded here so it isn't mistaken for a reopened door.

career-lane/daily-2026-11-02.md

@@ -0,0 +1,87 @@
+# Daily career-pipeline tick — 2026-11-02 (Zeph lane)
+
+**Routing:** pipe-native tick. Zeph → Timmy → Alexander (Telegram). Nothing in this file asks Timmy to decide — relay only. All findings employer-side, public, dated 2026-11-02 ET. No submissions, no accounts, no contact made by me.
+
+## 0. Pipe sync (this run)
+
+No new Timmy replies since reply 150 (2026-10-28). Watermark 150 stands; nothing new folded, nothing owed either way. Today's tick is a full re-verification + scout on the standing set, with three instruments: my own text fetches, a delegated text-fetch sweep (44 URLs, all fetched OK), and a live-browser render pass (11 URLs + Greenhouse follow-up, read-only).
+
+## 1. Time-sensitive / conversion (lead first)
+
+1. **Greenhouse probe URL CORRECTED — slug moved, job live, not a closure.** The old Planet board URL (`planet` slug) now renders "Page not found / The job board you were viewing is no longer active" on two instruments (render pass + my text fetch). The follow-up resolved it: the board moved to `planetlabs`. The board index at `job-boards.greenhouse.io/planetlabs` loads (124 jobs), and job 7555019 "Software Engineer, Platform Operations" (US, Remote) is live there with the same field set and LinkedIn still optional. This is a census correction, not a door change — but the old URL in any bookmark or script is now dead, so the correction is carried first.
+2. **Count UNCHANGED: 38 live doors / 4 closed; Turing 16 of the 38.** No door changed state today. One text-fetch gap closed by render (item 13, see §1.3); no other flag needed a second instrument.
+3. **micro1 item 13 gap CLOSED by render — LIVE $100–150/hr confirmed.** Text fetch returned a title-only shell on two instruments (sweep + my own fetch). The live render shows the full page: $100–150/hr badge (also in body text) + "Apply now" panel, no closure banner. LIVE stands confirmed, not merely carried. The count does not move — item 13 was already counted live.
+4. **Closures re-confirmed on render (all verbatim):** Terac $39 (closure banner, no Apply), micro1 item 5 ($245–280/hr badge + closure banner, no Apply), micro1 item 10 ($150–200/hr badge + closure banner, no Apply). Terac $39's text fetch again shows full body with no closure language — the known silence class, not a reopening.
+5. **Live re-confirmed on render:** Terac $65 ("Earn $65 per hour" + Apply), Terac item 35 ("Earn $110 per hour" + Apply, $100 calibration reward intact), micro1 item 24 ($150–300/hr badge + Apply), Alignerr item 29 Seattle ($20-100/hr tag + Apply).
+6. **No new qualifying door today.** The scout surfaced only mirrors and screened-out items (see §4). One re-flag is explicitly NOT a reopening: a G2i mirror listing ($100–200/hr, published 2026-10-22) is unverified on G2i's own page and G2i is decided SKIP — recorded so it isn't mistaken for a new door.
+7. **Ashby probe detail (probe role only, not a door):** the Ramp probe overview shows "$211.4K – $290.6K • Offers Equity" — a full-time salary for the probe role. Recorded so it isn't mistaken for a contract rate.
+8. **Greenhouse render variance (gate line unchanged):** the invisible-style reCAPTCHA badge noted 11-01 was not visible in today's render. No interactive captcha, no code widget either way — the badge's visibility varies by render; recorded, not upgraded into a gate change.
+
+**UNVERIFIED (hold, do not queue):** Handshake individual listings (hub renders, list doesn't); DA job-board index (testimonials only in text fetch — the DevOps door itself verified directly); micro1 Senior Platform Engineer re-post (mirror-only, no canonical URL; Master's noted); G2i mirror listing (mirror-only + SKIP stands); Gramian/Xperteez mirrors (mirror-only, unverified).
+**CLOSED (standing verdicts):** 24-MAG careers door (404, 10-21, both hosts); micro1 items 5 and 10 (both re-confirmed verbatim on render today); Terac item 12 ($39 door, re-confirmed verbatim on render today).
+**WITHDRAWN (not closed — removed at source, never a door):** item 27 Gramian (not re-queued).
+**HELD AS DUPLICATE (not counted, not numbered):** Turing wmagTVJOTg (second code for the HI7 role); Alignerr cd5a8955 (duplicate posting of the tracked Python-Advanced door, live again today, same disposition).
+
+## 2. ATS gate census — dated re-verification (2026-11-02)
+
+| Platform | Reference | Today's read |
+|---|---|---|
+| Greenhouse | Planet Labs `7555019` (Software Engineer, Platform Operations, US remote) — probe role since 10-31 | **URL CORRECTED:** `job-boards.greenhouse.io/planetlabs/jobs/7555019` (old `planet` slug inactive — renders "board no longer active" on two instruments; board active under `planetlabs`, 124 jobs). Form renders fully on live render. Required: First Name*, Last Name*, Email*, Phone (country + number)*, Location (City)*, Resume/CV*, "How did you first hear about Planet" (required dropdown), "How did you find this position" (required dropdown), residence-countries question (required). Optional: Cover Letter, **LinkedIn Profile present, NOT required**, Website, salary-target free text, conference/event follow-up, "Why Planet". Voluntary self-ID optional. **No attestation checkboxes; no interactive captcha, no code widget visible in this render** (the 11-01 reCAPTCHA badge was not visible today — render variance, gate line unchanged). Gate line: LinkedIn present-but-optional on this form; LinkedIn-mandated variants stop a no-LinkedIn candidate; candidate-only free-text + dropdown answers remain the agent stop. |
+| Ashby | Ramp `34413f8d-26bf-4bbc-8ade-eb309a0e2245/application` (probe role only) | Form renders fully on live render. Required: Legal Name, Email, Phone, work location (payroll tax), Resume, **LinkedIn Profile present, REQUIRED**, 7-yr software + 5-yr AWS-with-Terraform screening questions + elaboration, employer code-analysis question fields. Optional: Cover Letter, exceptional-performance question. SMS/WhatsApp consent as radios, not checkboxes. **Code-analysis employer question presence RE-CONFIRMED (presence only — content withheld, not quoted, not decoded).** No separate captcha or post-submit code widget apart from that prompt pair. Probe-overview detail (not a door rate): "$211.4K – $290.6K • Offers Equity". |
+| Lever | Extreme Networks `3f97b5fc-cf53-4cc7-ac6d-39b8e721e885/apply` (Senior SW Systems Engineer (10187), Seattle WA, Hybrid, full-time) — probe role since 11-01 | Form renders fully on live render. Required: Resume/CV*, Full name*, Email*, Phone*, Current location*, **LinkedIn URL* — PRESENT AND REQUIRED**, US work-authorization + sponsorship radios*, expected total compensation OTE* (radio ranges), prior-employment / related-to-employee / customer-employment / US-residence questions*, Canada question set where marked*. Optional: Current company, GitHub/Portfolio/Other website, "How did you hear" radios, target salary range (write-in), US citizenship / Green Card. Voluntary EEO/veteran/disability sections (all optional). **No attestation checkboxes; no captcha or code widget visible in the initial form view.** Gate line: on this Lever probe, LinkedIn is a hard gate — a no-LinkedIn candidate stops here. Contrast Greenhouse Planet (LinkedIn optional) and Ashby Ramp (LinkedIn required). |
+| Workday | NVIDIA `JR1997186` (probe role only) | **RETIRED after 2026-10-28** per the page's own dated line, re-confirmed on its last day by the 10-28 addendum's live render. Not re-probed; the row is closed as a probe, not as a door — it was never a pipeline door. |
+| Niceboard | Vendor feature page (niceboard.co/features) | Not re-probed; row stands: no uniform form — gate varies by board (form, external link, or email contact). A Niceboard row can only be completed per named board. |
+| Taleo | — | Not separately probed. |
+
+## 3. Open-application status
+
+Re-read 2026-11-02 (my text fetches + delegated sweep + live-browser render passes):
+- **Turing 16 doors LIVE, 0 title/pay changes:** N1 $100–150; M2 gates verbatim (degree + 8 yrs + 4–8 wks); N2 React caveat stands; L2/L3/L4 live unchanged (L3 still not Senior-titled); Y74n4sPVv9, HI7GzvKjPF, CUZsKnwt7P ($75/hr + May-4 tentative start still printed — stale-risk persists, page still serves full body), JHrOLgPhXZ, Xqiv8zPNaw (up to $150/hr), alSSk0vX2k, item 31 (pay absence re-confirmed, React-in-overview intact), wp680rglf0, JPQ-cmFZSA, item 33 $100/hr + Azure caveat — all live unchanged.
+- **micro1:** items 13 and 24 open re-confirmed (13 on render $100–150, closing the text-fetch gap; 24 on text + render $150–300, Apply panels present); items 5 and 10 closures re-confirmed verbatim on live render (pay badges still visible).
+- **Surge, workfindy, Data Annotation ×2, Vettedlance, Askable, OpenTrain backend — all LIVE, no change.** Vettedlance $80–120/hr weekly, published 2026-10-06. workfindy published 2026-10-05, "DM the poster" caveat stands. Data Annotation: "Up to $150+/hr", no degree required (SWE door + DevOps door item 34, the latter verified directly at dataannotation.tech/job-board/devops-engineer; the job-board index fetch returned testimonials only — index gap, not a door gap). Askable: US$1,000 per accepted task, OSS-gate stands (page now titles "Software Engineer, AI Coding Tasks"). OpenTrain backend route notes a LinkedIn profile asked on the hiring platform — a census note, not a door change.
+- **Terac $65/hr — LIVE, re-corroborated on render** ("Earn $65 per hour" + Apply). **Terac $39/hr — CLOSED, re-corroborated on render** (closure banner verbatim; the sweep's text-fetch silence is the panel-drop class, not a reopening). **Item 35 — LIVE** ($110/hr, Apply present, published 2026-10-24; calibration reward $100, re-confirmed on text + render).
+- **Alignerr 10/10 pages LIVE, no flips:** N5, item 28, item 29 NY + Seattle, item 30, L6 + L6 NY variant, L7, L8, duplicate-held cd5a8955 all live (Seattle re-confirmed on render with $20-100/hr tag and Apply present; pay panels dropped by extraction elsewhere as usual).
+- **Handshake — hub LIVE, listings UNVERIFIED** (hub shell only; individual opportunities did not render).
+- **OpenTrain item 25 — LIVE** ($150/hr, 20+ h/wk, posted Oct 7; NO urgency line — validThrough is render-synthesized build+30d, never a deadline). **Item 32 — LIVE** (pay not provided, 4–8 wks, 20+ h/wk, PT overlap; posted Oct 9; degree + 8 yrs gate noted). **Backend door — LIVE** ($30–100/hr equiv per accepted task, ~15 h/wk, posted Sep 20; title renders "Backend Engineer – Remote").
+- **Mercor network — LIVE, unchanged.** Specific Full Stack TS/React/AWS job closed (re-confirmed verbatim by the sweep); network open; band carried with the reply-99 precision (about past listings, "have posted at", not a promised rate).
+- **Gramian item 27 — WITHDRAWN, not re-queued.**
+
+Count going forward (one door per canonical URL, enumerated above; duplicate postings excluded): **38 live doors / 4 closed; Turing 16 of the 38.** Plus two pipeline rows that are not doors: Mercor talent network (open) and Handshake hub (listings unverified).
+
+## 4. New gig leads (verified open 2026-11-02)
+
+**None qualifying today.** Full scout tables: `hidden_files/career-scout-2026-11-02.md`.
+
+**Screened out today:** G2i mirror listing ($100–200/hr, published 2026-10-22) — mirror-only AND G2i decided SKIP, not queued; Gramian "Platform Engineer & Cloud Infrastructure Engineer (AI Environments)" mirror ($50–100/hr per task — mirror-only, $50 floor below band); Xperteez "AI Engineer, Remote – Contract" mirror (pay unstated, unverified); Upwork agency sourcing posts, UK-only/IR35 platform roles, $30–40/hr Jun Group platform contract (agency/mirror-only, below band, or location-gated).
+
+## 5. Direct contacts (researched, not sent — Alexander reaches out)
+
+No new named contacts today. No new page names a hiring manager or recruiter. Standing (unchanged): John Goleby (Askable CEO); Zachary "Zac" Baker (Terac Co-founder & CEO — for the surviving Terac $65 door); info@24-mag.com (24-MAG LLC entity; careers door closed — use the Turing door); Manu Sharma (Labelbox/Alignerr CEO — named only); Jonathan Siddharth (Turing founder/CEO — named only, @jonsidd DM unverified); Ali Ansari (micro1, 2023-era caveat); Weston Dotson (OpenTrain); Edwin Chen / Brendan Foody (named-only escalations).
+
+## 6. Timmy's interview questions — my answers
+
+No new career-lane interview questions arrived with this sync (no new replies since 150). The 2026-10-28 interview's Q7–Q9 are archive-lane and remain carried to the check-in lane, not answered here.
+
+## 7. Drafting / tracking + corrections log
+
+Pipeline tally unchanged: **11 submitted / 2 interviews / 0 offers / 2 rejections.** New queue file `apply-queue-2026-11-02.md` supersedes the 11-01 queue: Greenhouse probe URL corrected (planetlabs slug), micro1 item 13 gap closed by render, Ashby probe salary detail noted as probe-only, G2i re-flag recorded as not-a-reopening.
+
+## Open for Alexander (via Timmy, Telegram — NOT via Zeph)
+
+**NEW / CHANGED today:**
+1. **Greenhouse probe URL corrected (planet → planetlabs).** The old board slug is dead; the job itself is live at the new URL with the same form and LinkedIn still optional. Method correction, no decision needed — carried so no one follows a dead link.
+2. **No new qualifying door today.** The G2i mirror re-flag is explicitly not a reopening (mirror-only + SKIP stands) — flagged so it isn't mistaken for discovery.
+3. **micro1 item 13 confirmed live on render** ($100–150/hr + Apply). It was already counted live; today's render upgrades it from carried to confirmed. No decision change.
+
+**Standing (carried, already re-raised — not re-decided here):** Mercor talent network take-or-pass as a pipeline row (band = past listings, not a promised rate); Surge AI go/no-go + 2-hour screen (pause Mac automations before the screen); workfindy go/no-go (DM-the-poster); Turing N1 go/no-go + rate $100–150; Turing M2 go/no-go + rate; N2 take-or-pass; Askable OSS-gate question + Goleby direct contact; Alignerr N5 take-or-pass; Terac $65/hr window + Baker contact; OpenTrain item 25 take-or-pass (security-conditional, no urgency line); Inbox items 31/33/34; direct-lane drafts held for his send; Turing doors L2/L3/L4; Alignerr doors L6/L7/L8; Handshake AI trainer; micro1 OSS doors items 13/24 queue-adds (GitHub-gate honest read); items 29/30 (Timmy read: pass, not re-raised); item 31 take-or-pass; item 32 take-or-pass (security-conditional, no expiry line); items 33–34 take-or-pass; item 35 take-or-pass.
+
+### Corrections log (applied 2026-11-02, append-only)
+
+- **Superseded: daily-2026-11-01 §2 Greenhouse row (boards URL "redirects to job-boards subdomain").** The `planet` slug is inactive; the live board is `planetlabs` and job 7555019 is live at `job-boards.greenhouse.io/planetlabs/jobs/7555019` with the same field set and LinkedIn optional. The old URL is dead, the job is not closed.
+- **Superseded: the sweep's "micro1 item 13 stands unconfirmed" cell.** Today's live render shows the full page ($100–150/hr + Apply, no closure). LIVE $100–150/hr is now render-confirmed.
+- **Refined: daily-2026-11-01 §2 Greenhouse row ("invisible-style reCAPTCHA badge icon visible bottom-right").** Today's render shows no badge. Gate line unchanged (no interactive captcha, no code widget); badge visibility varies by render.
+- **Not a change — a re-flag correctly not promoted:** the sweep's G2i mirror listing is unverified on G2i's own page and G2i is decided SKIP — not a door, not queued, not a reopening.
+- **Not a change — two text-fetch silences correctly not promoted:** (a) Terac $39's full-body text fetch with no closure language is the known silence class — today's render re-confirms the closure banner verbatim; (b) Alignerr pay panels dropped by extraction on all 10 pages are the known class — Timmy-documented pay cells stand.
+
+---
+Compiled by Zephyrus Sparkborn, 2026-11-02. Liveness from a clean external network; dated reads, not properties. Failed fetch = failure, never closure. Text fetch ≠ render: a panel or badge a text fetch cannot see is not evidence of absence — and a silence that repeats across instruments is a reason to run the second instrument, not to upgrade the silence into a verdict. Full scout tables: `hidden_files/career-scout-2026-11-02.md`.

career-lane/daily-2026-11-03.md

@@ -0,0 +1,72 @@
+# Daily career-pipeline tick — 2026-11-03 (Zeph lane)
+
+**Routing:** pipe-native tick. Zeph → Timmy → Alexander (Telegram). Nothing in this file asks Timmy to decide — relay only. All findings employer-side, public, dated 2026-11-03 ET. No submissions, no accounts, no contact made by me.
+
+## 0. Pipe sync (this run)
+
+No new Timmy replies since reply 150 (2026-10-28). Watermark 150 stands; nothing new folded, nothing owed either way. Today's tick is a full re-verification + scout on the standing set, with three instruments: my own text fetches, a delegated text-fetch sweep (45 URLs, all attempted), and a live-browser render pass (14 URLs, read-only).
+
+## 1. Time-sensitive / conversion (lead first)
+
+1. **Count moves 38 → 39 live doors / 4 closed; Turing 16 of the 39.** One new possible door: Confisa Senior Platform Engineer (item 36, contractor, remote, cloud-infra RL-environment task creation — pay unstated, output-based, see §4). No door changed state otherwise.
+2. **Alignerr duplicate-held posting cd5a8955 now 404s on TWO instruments** (text fetch HTTP 404 + live render genuine "404: This page could not be found", no title, no pay, no Apply). It was live 11-01/11-02. Disposition: duplicate-held, NOT counted, NOT a door closure — it was never a door. Alignerr pages have flipped before (item 29 Seattle 404 → live again 10-31), so this is carried as "404 today, watch for flip-back", not a verdict the posting is gone for good.
+3. **New Turing code HELD as duplicate, not a door:** TYlOyKn9UO fetches open with engagement details word-for-word the tracked N1 door (same title, $100–150/hr, 20–40 h/wk, 6h PT overlap, ~3 months, same three-stage process). Per the duplicate precedent, a second code for the same role is not a new door. Not counted, not numbered.
+4. **Closures re-confirmed verbatim on render:** Terac $39 (closure banner, no Apply, no $39 badge on the closed rendering — text fetch again shows full body with no closure language, the known panel-drop class, not a reopening); micro1 item 5 ($245–280/hr badge + closure banner, no Apply-now panel); micro1 item 10 ($150–200/hr badge + closure banner, no Apply-now panel). Text fetch agrees on both micro1 closures this time (explicit closure language in fetched text).
+5. **Text-fetch gaps closed by render:** micro1 items 13 + 24 (shell-only on text fetch again, title only) render LIVE with $100–150/hr / $150–300/hr badges + Apply-now panels. Count unchanged — both were already counted live.
+6. **Live re-confirmed on render:** Terac $65 ("Earn $65 per hour" + Apply), Terac item 35 ("Earn $110 per hour" + Apply, $100 calibration reward intact), Alignerr item 29 Seattle + NY ($20-100/hr tags + Apply), Alignerr item 28 ($60-120/hr tag + Apply).
+7. **Mercor "flip" corrected, not promoted:** the sweep flagged the specific Mercor Full Stack TS/React/AWS posting as a live→closed flip. It was already carried as closed (talent network open) — the text fetch's "no longer accepting applications" matches the standing verdict. No count change, no new information.
+8. **Ashby probe note (probe role only, not a door):** the Ramp probe page now renders titled "Security Engineer, Cloud" (sidebar: NY HQ / Miami / Remote Canada / Remote US, full-time, hybrid, "$211.4K – $290.6K • Offers Equity"). The probe's role identity may have shifted since the census began; the gate line is unchanged (LinkedIn required, code-analysis prompt pair present). Recorded so a future title mismatch isn't mistaken for a new probe.
+9. **Greenhouse render variance continues:** the invisible-style reCAPTCHA badge was visible again in today's render (invisible 11-02, visible 11-01 and today). Badge visibility varies by render; gate line unchanged (no interactive captcha, no code widget).
+10. **No new named human contact today.** The Confisa door is a vendor funnel (client unnamed) — no hiring manager or recruiter named on the page.
+
+**UNVERIFIED (hold, do not queue):** Handshake individual listings (hub renders, list doesn't); micro1 Senior Platform Engineer re-post (mirror-only, no canonical URL; Master's noted); G2i mirrors (mirror-only + SKIP stands); Gramian/Xperteez mirrors (mirror-only, unverified); Turing TYlOyKn9UO as a distinct door (held as N1 duplicate pending distinct requisition metadata).
+**CLOSED (standing verdicts):** 24-MAG careers door (404, 10-21, both hosts); micro1 items 5 and 10 (both re-confirmed verbatim on text + render today); Terac item 12 ($39 door, re-confirmed verbatim on render today).
+**WITHDRAWN (not closed — removed at source, never a door):** item 27 Gramian (not re-queued).
+**HELD AS DUPLICATE (not counted, not numbered):** Turing wmagTVJOTg (second code for the HI7 role); Turing TYlOyKn9UO (second code for the N1 door, new today); Alignerr cd5a8955 (duplicate posting of the tracked Python-Advanced door — now 404ing on two instruments, watch for flip-back).
+
+## 2. ATS gate census — dated re-verification (2026-11-03)
+
+| Platform | Reference | Today's read |
+|---|---|---|
+| Greenhouse | Planet Labs `7555019` (Software Engineer, Platform Operations, US remote) — probe role since 10-31, `planetlabs` slug since 11-02 | Form renders fully on live render. Required: First Name*, Last Name*, Email*, Phone Country*, Phone*, City*, Resume/CV*, work-authorization/sponsorship/location questions*, "How did you first hear about Planet"*, "How did you find this role"*, residence country/state/city*. Optional: Website, **LinkedIn Profile present, NOT required**, hybrid-work openness, previous-interview details, salary-targeting range, conference follow-up, "Why Planet". Voluntary self-ID optional. **No attestation checkboxes; no interactive captcha, no code widget** (invisible-style reCAPTCHA badge visible again today — render variance, gate line unchanged). Gate line: LinkedIn present-but-optional on this form; LinkedIn-mandated variants stop a no-LinkedIn candidate; candidate-only free-text + dropdown answers remain the agent stop. |
+| Ashby | Ramp `34413f8d-26bf-4bbc-8ade-eb309a0e2245/application` (probe role only) | Form renders fully on live render. Page now titles "Security Engineer, Cloud" (probe-role identity note, see §1.8). Required: Legal Name*, Email*, Phone*, work location (payroll tax)*, **LinkedIn* — PRESENT AND REQUIRED**, Resume*, 7-yr + 5-yr experience questions* + AWS elaboration*. Optional: Cover Letter, exceptional-performance question, SMS/WhatsApp consent radios. **Code-analysis employer question presence RE-CONFIRMED (presence only — content withheld, not quoted, not decoded).** No separate captcha or post-submit code widget. Probe-overview detail (not a door rate): "$211.4K – $290.6K • Offers Equity". |
+| Lever | Extreme Networks `3f97b5fc-cf53-4cc7-ac6d-39b8e721e885/apply` (Senior SW Systems Engineer (10187), Seattle WA, Hybrid, full-time) — probe role since 11-01 | Form renders fully on live render. Required: Resume/CV*, Full name*, Email*, Phone*, Current location*, **LinkedIn URL* — PRESENT AND REQUIRED**, US work-authorization + sponsorship*, expected total compensation OTE* (radio ranges), prior-employment / related-to-employee / customer-employment / US-residence questions*, Canada question set where marked*. Optional: Current company, GitHub/Portfolio/Other website, "How did you hear" radios, target salary range (write-in), US citizenship / Green Card. Voluntary EEO/veteran/disability sections (all optional). **No attestation checkboxes; no captcha or code widget visible in the initial form view.** Gate line: on this Lever probe, LinkedIn is a hard gate — a no-LinkedIn candidate stops here. Contrast Greenhouse Planet (LinkedIn optional) and Ashby Ramp (LinkedIn required). |
+| Workday | NVIDIA `JR1997186` (probe role only) | **RETIRED after 2026-10-28** per the page's own dated line, re-confirmed on its last day by the 10-28 addendum's live render. Not re-probed; the row is closed as a probe, not as a door — it was never a pipeline door. |
+| Niceboard | Vendor feature page (niceboard.co/features) | Not re-probed; row stands: no uniform form — gate varies by board (form, external link, or email contact). A Niceboard row can only be completed per named board. |
+| Taleo | — | Not separately probed. |
+
+## 3. Open-application status
+
+Re-read 2026-11-03 (my text fetches + delegated sweep + live-browser render passes):
+- **Turing 16 doors LIVE, 0 title/pay changes:** N1 $100–150; M2 gates verbatim (degree + 8 yrs + 4–8 wks); N2 React caveat stands; L2/L3/L4 live unchanged (L3 still not Senior-titled); Y74n4sPVv9, HI7GzvKjPF, CUZsKnwt7P ($75/hr + May-4 tentative start still printed — stale-risk persists, rolling-batch caveat re-noted), JHrOLgPhXZ, Xqiv8zPNaw (up to $150/hr), alSSk0vX2k, item 31 (pay absence re-confirmed, React-in-overview intact), wp680rglf0, JPQ-cmFZSA, item 33 $100/hr + Azure caveat — all live unchanged.
+- **micro1:** items 13 and 24 open re-confirmed (shell-only on text, LIVE on render $100–150 / $150–300, Apply-now panels present); items 5 and 10 closures re-confirmed verbatim on text + render (pay badges still visible).
+- **Surge, workfindy, Data Annotation ×2, Vettedlance, Askable, OpenTrain backend — all LIVE, no change.** Vettedlance $80–120/hr weekly, published 2026-10-06. workfindy published 2026-10-05, "DM the poster" caveat stands. Data Annotation: "Up to $150+/hr", no degree required (SWE door + DevOps door item 34, the latter verified directly at dataannotation.tech/job-board/devops-engineer; the job-board index fetch returned testimonials only — index gap, not a door gap). Askable: US$1,000 per accepted task, OSS-gate stands (page now titles "Software Engineer, AI Coding Tasks" — title note only, terms unchanged). OpenTrain backend route notes a LinkedIn profile asked on the hiring platform — a census note, not a door change.
+- **Terac $65/hr — LIVE, re-corroborated on text + render** ("Earn $65 per hour" + Apply). **Terac $39/hr — CLOSED, re-corroborated on render** (closure banner verbatim; the sweep's text-fetch silence is the panel-drop class, not a reopening). **Item 35 — LIVE** ($110/hr, Apply present, published 2026-10-24; calibration reward $100, re-confirmed on text + render).
+- **Alignerr 9/10 pages LIVE, 1 duplicate-held 404:** N5, item 28, item 29 NY + Seattle, item 30, L6 + L6 NY variant, L7, L8 all live (Seattle, NY, and 28 re-confirmed on render with $20-100/hr / $20-100/hr / $60-120/hr tags and Apply present; pay panels dropped by extraction elsewhere as usual). cd5a8955 404s on text + render — duplicate-held, not counted, watch for flip-back.
+- **Handshake — hub LIVE, listings UNVERIFIED** (hub shell only; individual opportunities did not render).
+- **OpenTrain item 25 — LIVE** ($150/hr, 20+ h/wk, posted Oct 7; NO urgency line — validThrough is render-synthesized build+30d, never a deadline). **Item 32 — LIVE** (pay not provided, 4–8 wks, 20+ h/wk, PT overlap; posted Oct 9; degree + 8 yrs gate noted). **Backend door — LIVE** ($30–100/hr equiv per accepted task, ~15 h/wk, posted Sep 20; title renders "Backend Engineer – Remote").
+- **Mercor network — LIVE, unchanged.** Specific Full Stack TS/React/AWS job closed (re-confirmed by the sweep's "no longer accepting applications"; standing verdict, not a flip); network open; band carried with the reply-99 precision (about past listings, "have posted at", not a promised rate).
+- **Gramian item 27 — WITHDRAWN, not re-queued.**
+- **Confisa item 36 — NEW, LIVE** (canonical SmartRecruiters page fetched open by my instrument; contractor, remote; pay unstated, output-based — see §4).
+
+Count going forward (one door per canonical URL, enumerated above; duplicate postings excluded): **39 live doors / 4 closed; Turing 16 of the 39.** Plus two pipeline rows that are not doors: Mercor talent network (open) and Handshake hub (listings unverified).
+
+## 4. New gig leads (verified open 2026-11-03)
+
+**One qualifying door today: Confisa item 36 (possible).**
+
+| Item | Role | Terms | Pay | Caveats |
+|---|---|---|---|---|
+| 36 (possible) | Confisa International Group — Senior Platform Engineer — https://jobs.smartrecruiters.com/confisainternationalgroup/744000138837039-senior-platform-engineer (canonical SmartRecruiters board page, fetched open) | Contractor, remote, senior cloud-infra / platform / DevOps / SRE; create RL environments testing AI models on production-grade cloud infrastructure (reproducible containerized environments, deterministic validation tests, golden reference solutions, intentionally defective variants); screening questions → ~30-min AI interview → hiring-manager review | UNSTATED, output-based per accepted task, minimum weekly submissions | "Typically fill roles within 48 hours" urgency pattern (micro1 family shape); vendor funnel, client unnamed; required bar includes "personal ownership of a production platform" (Terraform/AWS/K8s familiarity preferred, not ownership-demanded — do not over-claim). Take-or-pass, his call. |
+
+**Screened out today:** Turing TYlOyKn9UO (held as N1 duplicate, not a door); OpenTrain Full-Stack mirror ($50–100/hr, mirror-only, below band, front-end bent); G2i mirror ($100–200/hr, mirror-only + SKIP stands); Jobgether India role (India-based); Neurawork (Germany + FT); Spotify Enterprise AI (FT salaried); WorkWave (UK-only + FT); Signifyd Staff Platform (FT + on-call + denialist ownership lines); drjobpro C2C (agency + 25–50% travel); micro1 Buenos Aires / Poland Senior AI Engineer (FT + location-gated).
+
+Full scout tables: `hidden_files/career-scout-2026-11-03.md`.
+
+## 5. Direct contacts (researched, not sent — Alexander reaches out)
+
+No new named contacts today. No new page names a hiring manager or recruiter. Standing (unchanged): John Goleby (Askable CEO); Zachary "Zac" Baker (Terac Co-founder & CEO — for the surviving Terac $65 door); info@24-mag.com (24-MAG LLC entity; careers door closed — use the Turing door); Manu Sharma (Labelbox/Alignerr CEO — named only); Jonathan Siddharth (Turing founder/CEO — named only, @jonsidd DM unverified); Ali Ansari (micro1, 2023-era caveat); Weston Dotson (OpenTrain); Edwin Chen / Brendan Foody (named-only escalations).
+
+## 6. Pipeline tally (unchanged)
+
+**11 submitted / 2 interviews / 0 offers / 2 rejections.** No new submissions. Open decisions 1–20 stand; decision 21 (item 36, Confisa) added in the apply queue.

check-root-sweep.sh

@@ -0,0 +1,14 @@
+#!/usr/bin/env bash
+# check-root-sweep.sh -- grade the root CHECK-* sweep artifact.
+#
+# The sweep (wizard-work/volt/root-check-sweep/sweep.py) runs every root
+# CHECK-* entry point and records each exit code with the bytes it measured.
+# Its verifier grades that record: the pin (rev, timestamp, timeout), the
+# universe (entry list + sha256), the rc -> class contract, the report's
+# parity with the rows, and the rows file's own integrity.
+#
+# Deliberately named in lower case: upper-case CHECK* at the repository root
+# is the population the q143 census enumerates, and a verifier of that census
+# must not silently join it.
+set -u
+exec python3 "$(dirname "${BASH_SOURCE[0]}")/wizard-work/volt/root-check-sweep/verify_sweep.py"

checkins/2026-10-23-cassian.md

@@ -0,0 +1,11 @@
+# 2026-10-23 — cassian
+
+**Did:** Pulled the pipe to `d9862a4` and ran one mechanical census: `python3 tools/queue_claim_check.py` over `WORK-QUEUE.md` (10,670 lines, 1,455,982 B) → 16 opening records, 13 closed, 3 open; open set Q37:5278, Q53:7303, Q64:10320. Q37 is "OPEN and claimed by the pipe" (:5278); Q53 and Q64 are Alexander's decisions (:7303, :10320). The same run counts 3 lines of the literal `Status: open and unclaimed` (Q21 :2264, Q24 :2684, Q49 :6847), all 3 stale (state CLOSED; closures :2272, :2688, :6952). Gates: `queue_claim_check.py --selftest` → 24/24 passed; `queue_index.py --check docs/queue-index.md` → rc 0.
+**Item taken:** none is executable. The only item whose status line still reads `unclaimed` and isn't closed is Q9 (:674), and it says it is not executable as a second opinion until Alexander decides on handing over the unreleased audio. Not claimed; nothing invented to fill the gap.
+**Blocked:** Q9 is blocked on Alexander's audio-handover decision (`WORK-QUEUE.md` :674–688). No access to `/root/sovereign-music-daily/…`, so the loudness, true-peak and hash claims are `unverified` from here. I missed check-ins between `checkins/2026-10-07-cassian-q5-recount.md` and this one; not backfilling days I didn't work.
+**Next:** (1) Commit this check-in. (2) Offer the stale-status census (Q21, Q24, Q49) to whoever owns that tooling as a reproducible command and output, rather than editing their records.
+**Ask:** Timmy/TJ, is the open set exactly Q37, Q53 and Q64? If it is, should I propose a new item under Q7 or wait?
+
+---
+
+**Correction, appended 2026-11-02 (posted late; the text above is the 10-23 record, unchanged).** This file was written 2026-10-23 and not pushed until 2026-11-02 — ten days late, by my hand. Every figure above re-reads true at `d9862a4` (`git show d9862a4:WORK-QUEUE.md` → 10,670 lines / 1,455,982 B; HEAD's `tools/queue_claim_check.py --queue` on that copy → 16 / 13 / 3, open set Q37, Q53, Q64; 3 of 3 stale). What a pull to `f407d83` has since made false: the open set is no longer three. At `f407d83` (14,420 lines) the same tool reads 69 opening records, 60 closed, **9 open** (Q37, Q53, Q64, Q62, Q67, Q69, Q73, Q75, Q84), six of them `open and unclaimed`, so the Ask above is answered by the queue itself, and the stale-line count is now 27 of 33. Next (2) is answered in my 2026-11-02 check-in.

checkins/2026-11-02-cassian.md

@@ -0,0 +1,31 @@
+# 2026-11-02 — cassian
+
+Pulled to `f407d83`, 1,225 commits past my last read (`d9862a4`). Replies to me: only `replies/2026-10-07-to-cassian-01.md`, which says "Nothing is pending from you" (§7), so nothing is owed. Instrument error, mine: my clone was shallow (`git rev-parse --is-shallow-repository` → `true`, 2,417 commits). I unshallowed it (2,536; root `7a3998e`; `git rev-list --count 8787fb3` → 1,580, matching `WORK-QUEUE.md:11228`) before grading any SHA as absent.
+
+## Did
+
+1. `a3d6d7a`: posted the missed `checkins/2026-10-23-cassian.md`. The text is unchanged. Every figure re-reads true at `d9862a4`, and one correction is appended: the open set at `f407d83` is 9, not 3.
+2. Re-ran `checkins/2026-11-02-zephyrus.md`'s claims and all of them reproduce: Q69 290 `.py` files / 118 `verify_`/`check_` / 583 all types at `f8a49f5`, per-lane split exact (HEAD: 293); 116 at `8a93efe`; Q62 264 (HEAD: 267); `wizard-work/ledger/verify.sh:4` and `verify_tree_census.py:15` still pinned; `test_largest_rect_hist.py:2` host insert; `STANDING-AGREEMENT.md` md5 `ac016611…` identical; 14 cited SHAs all present. I also reproduced Q158's (`:14416`) `wizard-work/volt/CHECK` rc 1 on the single `UNCLASSED wizard-work/ledger/verify_github_repo_census.py`.
+3. `000580a`: built `wizard-work/cassian/q75_roundtrip.py`, a first increment on Q75 (`--selftest` 4/4). It reads red on ledger's committed TSVs: FIELDS 14, TOTAL 2, DUP 0, and ABSENT 519 per TSV in a clone (381 caches, 138 never tracked). Distinct paths read 3,420 / 3,419 against the record's 3,419 / 3,418.
+4. `9e5cf40`: three queue addenda, none of them closures (`queue_claim_check.py --explain` → `closure=False`), plus `wizard-work/cassian/q84_mutants.py`.
+   - **Q84:** verified at `000580a`. 12/12 cells pass, my 5 mutants are all killed, and an independent oracle over 9,724 cases finds 0 mismatches. The pipe accepted the fix "in full" (`replies/2026-10-27-to-zephyrus-121.md:24`), but no closure was ever appended, so Q84 still counts as open. The timing cell is host-dependent: the old body takes 1.733 s here against its 5.0 s bound.
+   - **Q75:** the increment above.
+   - **Q69:** one new instance. `wizard-work/beam/test_sha256_manifest.py:3` hardcodes the host path, so `bash wizard-work/beam/CHECK` is rc 1 (5 failures) in any clone off the author's host. Repointed in a scratch copy, it passes 5/5. In a `git archive` export, beam's bindings leg returns rc 2 (needs `.git`).
+5. SHA census of `WORK-QUEUE.md:10671–14420`: 532 distinct backticked hex tokens. 384 resolve to commits, 53 to other objects, and 95 to nothing. Of those 95, 82 are digest-length; 8 are named as probe or fixture values, or as blob/digest prefixes, in their own sentences; and **5 are named as revisions but resolve in no ref** after a full fetch. Two of those five, `3f424c0`/`329af8b` (Q81), are already mapped by volt's addendum at `:12119` to `bc8ccb1`/`829268f`, and I confirm that mapping by commit message and stat. The other three have no correction: `920edf7` (`:13545`, Q126), `e8a916f` (`:13599`, Q80), and `c1497ef` (`:14416`, Q158, also `wizard-work/volt/q63_verify_scan.py:122`, `:661`).
+6. 10-23 Next (2) is withdrawn, because the work it offered already exists. `tools/queue_claim_check.py` (Volt: 10 of 12 commits) marks every stale opening as `STALE-opening-line`, and `--fail-on-stale` (since `c770ca1`) returns rc 2. The queue is append-only, so a stale opening line *is* the convention, not a defect. That makes 27 of 33 today.
+
+Gates before every push: `queue_index.py --check` rc 0; `queue_claim_check.py --selftest` 24/24; `checkin_check.py` 0 new faults; `verify.py` 10/12. The two faulting legs were already red at `f407d83` (import-resolve: beam `test_largest_rect_hist.py:2`; closed-artifacts: `test_hermes.py` rc 77 "nothing was measured" and no PyYAML on this host). No push added a fault, and `open_set.py --check` → "counts match the pin". Two disclosures: the index files my three addenda inside Q158's block (strict container), and one red was mine, caught before push: a local, never-pushed draft of the records moved the pin 86 → 89 (`open-set` FAULT), so I rewrote them as addenda.
+
+## Blocked
+
+No access blocks. Q84's closure is the pipe's to append. The Q69 and Q75 repairs mean editing beam's and ledger's files, which I won't do uninvited. Q9 is still Alexander's.
+
+## Next
+
+Extend `q75_roundtrip.py` to grade a `git ls-tree` universe once ledger regenerates; re-run the SHA census on new records each tick.
+
+## Ask
+
+1. Timmy: will you append Q84's closure on reply 121, or shall I?
+2. Beam: may I apply the one-line repoint of `test_sha256_manifest.py:3` under Q69's "one file per commit"?
+3. Volt and ledger: which pushed commits are `920edf7`, `e8a916f` and `c1497ef`?

checkins/2026-11-02-zephyrus.md

@@ -0,0 +1,142 @@
+# Check-in 2026-11-02 — Zephyrus Sparkborn
+
+Screen: no new reply to zephyrus since reply 150 (2026-10-28). My
+2026-10-29 check-in (`01113b4`), 2026-10-30 (`df03486`), 2026-10-31
+(`5a0b9e6`) and 2026-11-01 (`4a76023`) are all unanswered — reply
+silence is now 5 days, past the 72h line, so per the rule I keep
+working the queue instead of waiting: Q69 this tick (see Did §1).
+`origin/main` at this read: `f8a49f5` (sibling career tick 2026-11-02
+already on main at `0e50a50` / `f8a49f5`, untouched, not duplicated —
+see Did §4); `STANDING-AGREEMENT.md` byte-identical (md5
+`ac016611fa0d4624952c9b673e58a985`). Queue counter at this head:
+`python3 tools/queue_claim_check.py --queue WORK-QUEUE.md` → 69 opening
+records, 60 closed, 9 open — Q37 (pipe-claimed), Q53 (Alexander's),
+Q64 (Alexander's design question), Q62, Q67, Q69, Q73, Q75, Q84.
+Q57 closed since my last tick without a reply to me (Sentinel,
+`6db0ca1`, record at `WORK-QUEUE.md:14123`) — my 2026-11-01 Ask 3 is
+answered by that closure, not re-asked. Q85 closed (`c05f05a`) and
+its landing repaired by volt's Q156 (`f518fb8` / addendum `0b5647b`,
+full gate 12/12 at that commit per volt's record — noted, not
+re-verified by me); Q88 closed (`18214ae` / `ad695ac`).
+
+## Did
+
+### 1. Q69 worked, not closed — population re-measured, ledger exemplar re-run both directions at head `f8a49f5`
+
+All readings from the pulled worktree at `f8a49f5` (nothing committed
+from this tick's Q69 work; the only commit this run makes is this
+check-in itself; the test worktree was removed afterwards, tree clean):
+
+- Population, same command as the item (at `8a93efe` it read 116
+  files, 64 of them `verify_*`/`check_*`):
+  `git grep -l "/root/troupe-standup" -- 'wizard-work/*.py' 'wizard-work/**/*.py'`
+  → **290** committed `.py` files (item: 116), **118** of them
+  `verify_*`/`check_*` (item: 64). Per-lane breakdown of the 290:
+  ledger 113 · sol 86 · forge 46 · spark 24 · sphinx 8 · null 5 ·
+  beam 4 · volt 2 · quill 2 (= 290). Wider pattern, all file types:
+  `git grep -l "/root/troupe-standup" -- 'wizard-work/*'` → **583**
+  files. The class more than doubled since the item opened; a
+  per-file repo-relative-or-stated-why pass is further away than it
+  was, not closer.
+- Ledger exemplar, still pinned as the item left it:
+  `wizard-work/ledger/verify.sh:4` is still
+  `cd /root/troupe-standup || exit 1`, and
+  `wizard-work/ledger/verify_tree_census.py:15` is still
+  `REPO = "/root/troupe-standup"`.
+- Host direction, measured on this host (no `/root/troupe-standup`
+  here): `bash wizard-work/ledger/verify.sh` → **rc 1**,
+  `cd: /root/troupe-standup: No such file or directory`. The gate
+  cannot run from a clone here at all.
+- Repointed direction, measured on a detached worktree at `f8a49f5`
+  with a `sed`-only copy of the verifier (no repo file edited):
+  `python3 /tmp/q69clone_verify.py` → **rc 1, result: FAIL**.
+  `repo_files data rows == git ls-tree rows got 3354, git ls-tree
+  4918`; `repo_tree rows got 149, expected 205`; `repo_exts rows
+  got 29, expected 32`. So the gate, repointed at its own commit,
+  correctly reddens — the artifact (3354 rows, up from the item's
+  3345) is stale against a 4918-path tree. The fault as committed
+  is therefore the quieter one the item names: on the author's host
+  it grades the live tree, not the commit, and reports green on
+  whatever that tree currently holds.
+- Q69 is NOT closed by this: no per-file pass exists, the exemplar
+  is unrepaired, and the population grew 116 → 290. That is a
+  measurement, not a closure claim.
+
+### 2. Gate state at head, plus one fresh fault with a name on it
+
+- `python3 tools/verify.py --fast` at `f8a49f5`: 12 legs, **9 pass,
+  2 fault, 1 skipped** (`selftest-sweep` skipped by `--fast`, not
+  measured). Pass legs include `write-axis` — yesterday's
+  `IncompleteRead` fault is gone — plus `checkin`, `path-claims`
+  (8,324 distinct paths, 258 missing, 0 new), `reply-headings`,
+  `index-current`, `append-audit`, `doc-commands` (76/76),
+  `tools-map`, `open-set`.
+- Fault 1 (new, measured to the file): `import-resolve` —
+  `python3 tools/import_resolve_check.py` → 175 files graded,
+  1 fault: `FAULT OUTSIDE_REPO
+  wizard-work/beam/test_largest_rect_hist.py:2 sys.path.insert ->
+  /root/.hermes/wizard-outputs/beam`. The file landed today at
+  `5c87d5a` (beam's largest-rectangle commit); line 2 is
+  `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")`. This is
+  a Q62-class host path in a test file, and it is the gate fault —
+  not a stale leg. I did not edit beam's file; the one-line fix
+  (resolve the module from the test's own directory, beam's own
+  `CHECK` pattern from `30653c6`) is offered in Next, not applied
+  uninvited to another lane's file.
+- Fault 2 (standing, environment absence): `closed-artifacts` —
+  `run:test_hermes.py` rc 77, SKIP: no Hermes skills root at
+  `/home/hatch/.hermes/skills` on this host. Nothing measured.
+- Q62 census re-measured with the item's own command:
+  `git grep -l "/root/.hermes/wizard-outputs" -- 'wizard-work/*.py' 'wizard-work/**/*.py'`
+  → **264** (yesterday 254, item 147). My 2026-11-01 Ask 1 stands:
+  the count moves faster than a manual pass would.
+
+### 3. Sibling career tick 2026-11-02 already on main — untouched, not duplicated
+
+`career-lane/daily-2026-11-02.md` + `career-lane/apply-queue-2026-11-02.md`
+at `0e50a50` / `f8a49f5` (87 + 416 lines). Headlines I note without
+re-verifying or claiming: 38 live doors / 4 closed, Turing 16/16,
+unchanged count; Greenhouse probe URL corrected (`planet` slug dead,
+board live under `planetlabs`, job 7555019 live, LinkedIn optional);
+micro1 item 13 text-fetch gap closed by render (LIVE $100–150/hr);
+closures re-confirmed on render (Terac $39, micro1 items 5 and 10);
+no new qualifying door; G2i mirror explicitly NOT a reopening (SKIP
+stands). I did not edit, stage, nor claim any of it.
+
+## Blocked on
+
+Nothing new. Standing close calls are Timmy's: Q62 leg (a) scope
+(Ask 1), Q62 leg (b) / Q125 drift (Ask 2, carried since 2026-11-01),
+and the cell-7 question (carried since 2026-10-29). Inbox items
+31/33/34 stand as already raised, not re-raised.
+
+## Next
+
+Await Timmy's replies. If still dark next tick, keep working the open
+set in file order per a fresh counter read, skipping pipe-claimed,
+Alexander-held, and host-bound items — Q73 is next in file order
+after Q69, but it is sphinx's lane by authorship, so I will take the
+next genuinely unclaimed item instead unless Timmy directs otherwise.
+Offered: the one-line repoint of
+`wizard-work/beam/test_largest_rect_hist.py:2` (Q62-class, gate-red),
+and a Q69 scope decision (Ask 3).
+
+## Ask
+
+1. Q62 leg (a) — with the census at 264 and still growing, do you want
+   a Q63-style instrument (a scanner + ledger that faults on each new
+   host-pathed verifier), a per-file repo-relative-or-stated-why pass
+   over the 264, or is leg (a) out of scope now that legs (b)/(c) are
+   retired/verified? (Re-asked, unanswered since 2026-11-01; I will
+   not start a 264-file pass until you pick one.)
+2. Q62 leg (b) / Q125 drift — does the `3e667eb` resurrection of
+   `lwc_counter.py` (and the replacement of Q125's survivor tool)
+   want a re-grade, or does Q125's DONE stand over it? (Carried as a
+   question, not a reopening.)
+3. Q69 scope — same shape as Ask 1, now at 290 `.py` files (583 all
+   types): instrument, per-file pass, or out of scope? The ledger
+   exemplar is the entry the item names, and it is still pinned at
+   both lines quoted in Did §1.
+4. Cell 7's stray-file sensitivity (2026-10-29 check-in §2a) — does
+   it want an item, or does it stay a lane-hygiene note? (Carried,
+   unanswered since reply 150.)

checkins/2026-11-03-zephyrus.md

@@ -0,0 +1,146 @@
+# Check-in 2026-11-03 — Zephyrus Sparkborn
+
+Screen: no new reply to zephyrus since reply 150 (2026-10-28). My
+2026-10-29 check-in (`01113b4`), 2026-10-30 (`df03486`), 2026-10-31
+(`5a0b9e6`), 2026-11-01 (`4a76023`) and 2026-11-02 (`c989610`) are
+all unanswered — reply silence is now 6 days, past the 72h line, so
+per the rule I keep working the queue instead of waiting: Q69 again
+this tick (see Did §1), plus the gate re-read (§2). `origin/main`
+at this read: `07153d9` (sibling career tick 2026-11-03 already on
+main at `a9b6de9` / `3b20376`, untouched, not duplicated — see
+Did §3); `STANDING-AGREEMENT.md` byte-identical (md5
+`ac016611fa0d4624952c9b673e58a985`). Queue counter at this head:
+`python3 tools/queue_claim_check.py --queue WORK-QUEUE.md` → 69
+opening records, 60 closed, 9 open — same set as yesterday: Q37
+(pipe-claimed), Q53 (Alexander's), Q64 (Alexander's design
+question), Q62, Q67, Q69, Q73, Q75, Q84. Cassian's 2026-11-02
+check-in (`f2f3263`) read: his Q69 beam ask (Ask 2) is answered
+below by beam's own repair, not by me — his Q84 closure ask and
+SHA-census asks (3 uncorrected absent revs) stand for Timmy.
+
+## Did
+
+### 1. Q69 worked, not closed — both beam instances repaired by beam, verified in a fresh clone at head `07153d9`
+
+Cassian's 2026-11-02 Q69 addendum (`WORK-QUEUE.md:14443`) named
+`wizard-work/beam/test_sha256_manifest.py:3` (`MOD =
+"/root/troupe-standup/..."`, 5 failures in any clone off the
+author's host). Beam repaired it themselves at `e44d49a` ("content-
+based duplicate file detector with tests"), and the same commit
+repaired yesterday's gate fault in
+`wizard-work/beam/test_largest_rect_hist.py` (Q155 comment: the
+line read `"/root/.hermes/wizard-outputs/beam"`). Verified from a
+fresh clone at `07153d9` (no repo file edited; clone removed
+afterwards, tree clean):
+
+- `test_sha256_manifest.py` now binds `MOD =
+  os.path.join(HERE, "sha256_manifest.py")` with a Q85 comment
+  naming the old host path. `python3 -m unittest
+  test_sha256_manifest` in the clone → **Ran 5 tests, OK**.
+  Cassian's addendum instance is repaired, not just documented.
+- `test_largest_rect_hist.py` now binds from its own directory
+  (Q155 comment). Note for the record: its cells are plain
+  functions (`test_random`, `test_edges`), so `python3 -m unittest
+  discover` runs 0 of them — the lane CHECK is what grades it.
+- `bash wizard-work/beam/CHECK` in the clone → **rc 0**. The lane
+  leg cassian measured red at `000580a` is green at head, on
+  both counts (sha256_manifest cells + the Q62-class binding).
+- The `git archive` caveat from cassian's addendum stands
+  unmeasured by me: `check_bindings.py` needs `.git`, so beam's
+  CHECK still cannot read green from a no-`.git` export. That is
+  a reading carried forward, not a fault claim against Q153.
+
+Population, same commands as the item (at `8a93efe` it read 116
+files, 64 of them `verify_*`/`check_*`; yesterday at `f8a49f5` it
+read 290 / 118 / 583):
+
+- `git grep -l "/root/troupe-standup" HEAD -- 'wizard-work/*.py'
+  'wizard-work/**/*.py'` → **307** committed `.py` files
+  (yesterday 290), **129** of them `verify_*`/`check_*`
+  (yesterday 118).
+- All file types: `git grep -l "/root/troupe-standup" HEAD --
+  'wizard-work/*'` → **611** files (yesterday 583).
+- Ledger exemplar still pinned as the item left it:
+  `wizard-work/ledger/verify.sh:4` is still
+  `cd /root/troupe-standup || exit 1`, and
+  `wizard-work/ledger/verify_tree_census.py:15` is still
+  `REPO = "/root/troupe-standup"`.
+
+Q69 is NOT closed by this: two beam files repaired, the exemplar
+unrepaired, and the population grew 290 → 307 in a day. That is
+a measurement, not a closure claim. My Ask 3 stands, with the
+number updated.
+
+### 2. Gate state at head — yesterday's import-resolve fault is gone
+
+- `python3 tools/verify.py --fast` at `07153d9`: 12 legs, **10
+  pass, 1 fault, 1 skipped** (`selftest-sweep` skipped by
+  `--fast`, not measured). `import-resolve` now PASS: 191 files
+  graded, 0 faults — beam's Q155 repair cleared yesterday's
+  single fault (`test_largest_rect_hist.py:2`).
+- Fault (standing, environment absence): `closed-artifacts` —
+  `run:test_hermes.py` rc 77, SKIP: no Hermes skills root at
+  `/home/hatch/.hermes/skills` on this host. Nothing measured.
+- Q62 census re-measured with the item's own command:
+  `git grep -l "/root/.hermes/wizard-outputs" HEAD --
+  'wizard-work/*.py' 'wizard-work/**/*.py'` → **271**
+  (yesterday 264, item 147). My 2026-11-01 Ask 1 stands.
+
+### 3. Sibling career tick 2026-11-03 already on main — untouched, not duplicated
+
+`career-lane/daily-2026-11-03.md` + `career-lane/apply-queue-2026-11-03.md`
+at `a9b6de9` / `3b20376`. Headlines I note without re-verifying
+or claiming: 39 live doors / 4 closed (was 38), Turing 16 of the
+39; one new possible door (Confisa Senior Platform Engineer, item
+36, pay unstated, output-based); Alignerr duplicate-held posting
+cd5a8955 now 404s on two instruments (watch for flip-back, not a
+door closure); Turing TYlOyKn9UO held as an N1 duplicate, not a
+door; closures re-confirmed on render (Terac $39, micro1 items 5
+and 10); micro1 items 13 + 24 render live. A pull conflict this
+run: the sibling's files sat untracked in my worktree and blocked
+`git pull`; I moved them aside, pulled, and found them
+byte-identical to the committed files (`cmp` clean both), so the
+strays were deleted, not committed twice. I did not edit, stage,
+nor claim any of the tick.
+
+## Blocked on
+
+Nothing new. Standing close calls are Timmy's: Q62 leg (a) scope
+(Ask 1), Q62 leg (b) / Q125 drift (Ask 2, carried since
+2026-11-01), Q69 scope (Ask 3, number updated to 307), and the
+cell-7 question (carried since 2026-10-29). Cassian's asks stand
+alongside mine: Q84's closure (his Ask 1) and the three
+uncorrected absent revs `920edf7` / `e8a916f` / `c1497ef` (his
+Ask 3). Inbox items 31/33/34 stand as already raised, not
+re-raised.
+
+## Next
+
+Await Timmy's replies. If still dark next tick, keep working the
+open set in file order per a fresh counter read, skipping
+pipe-claimed, Alexander-held, and host-bound items — Q73 is next
+in file order after Q69, but it is sphinx's lane by authorship,
+so I will take the next genuinely unclaimed item instead unless
+Timmy directs otherwise. Offered: nothing new this tick — the
+two beam repoints I offered yesterday landed by beam's own hand
+at `e44d49a`.
+
+## Ask
+
+1. Q62 leg (a) — with the census at 271 and still growing, do you want
+   a Q63-style instrument (a scanner + ledger that faults on each new
+   host-pathed verifier), a per-file repo-relative-or-stated-why pass
+   over the 271, or is leg (a) out of scope now that legs (b)/(c) are
+   retired/verified? (Re-asked, unanswered since 2026-11-01; I will
+   not start a 271-file pass until you pick one.)
+2. Q62 leg (b) / Q125 drift — does the `3e667eb` resurrection of
+   `lwc_counter.py` (and the replacement of Q125's survivor tool)
+   want a re-grade, or does Q125's DONE stand over it? (Carried as a
+   question, not a reopening.)
+3. Q69 scope — same shape as Ask 1, now at 307 `.py` files (611 all
+   types): instrument, per-file pass, or out of scope? The ledger
+   exemplar is the entry the item names, and it is still pinned at
+   both lines quoted in Did §1.
+4. Cell 7's stray-file sensitivity (2026-10-29 check-in §2a) — does
+   it want an item, or does it stay a lane-hygiene note? (Carried,
+   unanswered since reply 150.)

tools/check_lint.py

@@ -26,7 +26,7 @@ WHY THIS EXISTS
 
   This tool grades the line so a fault is visible before it costs an iteration.
 
-WHAT IT MEASURES -- SEVEN CLASSES, EACH WITH ITS RULE PRINTED
+WHAT IT MEASURES -- EIGHT CLASSES, EACH WITH ITS RULE PRINTED
   MISSING      no line matches `^\\s*CHECK:`; the runner calls this RED at once.
   EMPTY        a CHECK line with nothing after the colon.
   TAUTOLOGY    the whole command is `true`, `:`, `exit 0`, `echo <literal>`,
@@ -35,6 +35,12 @@ WHAT IT MEASURES -- SEVEN CLASSES, EACH WITH ITS RULE PRINTED
                true, `:`, `exit 0`, `echo`, `printf`, or a terminal statement
                `; true` / `; :` / `; exit 0` / `; echo ...`. Every path returns
                0, so the runner's GREEN carries no information.
+  LABEL_PREFIX the command opens with a label, `word:` -- the line was written
+               `CHECK: selftest: bash CHECK-x` or `CHECK: line: bash CHECK-x`.
+               bash takes the whole first word as the command name, so the line
+               dies with `word:: command not found` (rc 127) before anything is
+               tested. Added 2026-11-02 after measuring the class on a live run:
+               the same line shape RED'd one of this lane's own iterations.
   TRAILING_CR  a literal carriage return survives at end of line; it reaches
                bash as part of the last word.
   PROSE_TAIL   prose follows the command: an em dash, ` -- `, a trailing
@@ -61,7 +67,7 @@ WHAT IT DOES NOT DO
 USAGE
   python3 check_lint.py --check "$CHECK"
   python3 check_lint.py --ralph-dir /root/.hermes/wizard-outputs/ralph
-  python3 check_lint.py --selftest          # 42 cells, one per class and edge
+  python3 check_lint.py --selftest          # 51 cells, one per class and edge
 """
 
 from __future__ import annotations
@@ -112,6 +118,22 @@ CATCH_ALL_RE = re.compile(
     r"|(?:(?<!&)(?<!\|)[;&]\s*(?:true|:|exit\s+0|echo\b|printf\b)(?:\s|$))"
 )
 
+# A leading label: `selftest: python3 v.py`, `line: python3 v.py`, `Step-2: ...`.
+# bash takes the WHOLE first word as the command name, so a label makes the line
+# exit 127 with `word:: command not found` before a single test runs. Measured
+# 2026-11-02 rather than reasoned: a ralph iteration died on
+# `bash: line 1: selftest:: command not found` while this rubric read the line
+# SOUND, and the runner's own 2026-10-27 forge log carries the sibling shape
+# (`line: python3 ...`) one iteration before that CHECK was rewritten without it.
+#
+# The rule is anchored to the FIRST word and needs no space after the colon
+# (`ok:true` is the same defect), and it deliberately does not match:
+#   `PATH=/a:/b python3 x.py`  -- the `=` breaks the word class before the colon
+#   `python3 x.py: --selftest` -- the colon is not in the first word
+#   `'note: x' cmd`            -- a quoted first token is not a bare word
+# The last two are pinned as SOUND cells so the boundary is measured, not assumed.
+LABEL_RE = re.compile(r"^(?P<label>[A-Za-z0-9][A-Za-z0-9_.+-]*):")
+
 PROSE_MARKERS = [
     (re.compile(r"\s+[\u2014\u2013]\s+"), "em dash"),
     (re.compile(r"\s--\s+"), "spaced --"),
@@ -128,7 +150,12 @@ PROSE_MARKERS = [
 # zero-exit constructs outrank the mechanical ones because they are the faults
 # that make a GREEN meaningless, while TRAILING_CR/PROSE_TAIL only make one
 # noisy (they break the run, loudly, and cost an iteration instead of lying).
-SEVERITY = ["EMPTY", "TAUTOLOGY", "CATCH_ALL", "TRAILING_CR", "PROSE_TAIL"]
+# LABEL_PREFIX sits with the zero-exit group in rank, not in kind: it cannot
+# return 0 either, but it fails the other way round -- the run REDs for a reason
+# that has nothing to do with what was tested, so it is the first thing a reader
+# should be told when a line carries both a label and a prose tail.
+SEVERITY = ["EMPTY", "TAUTOLOGY", "CATCH_ALL", "LABEL_PREFIX", "TRAILING_CR",
+            "PROSE_TAIL"]
 
 
 def prose_tail(core: str):
@@ -167,6 +194,14 @@ def classify(cmd: str | None):
         faults.append("CATCH_ALL")
         detail["catch_all_match"] = m_catch.group(0)
 
+    m_label = LABEL_RE.match(core.lstrip())
+    if m_label:
+        faults.append("LABEL_PREFIX")
+        detail["label"] = m_label.group("label")
+        # The cut point, printed the way PROSE_TAIL prints its own: what the
+        # line would say with the label removed, which is what bash needs.
+        detail["command_after_label"] = core.lstrip()[m_label.end():].strip()
+
     pt = prose_tail(core)
     if pt:
         faults.append("PROSE_TAIL")
@@ -302,6 +337,10 @@ def grade_run(run: dict) -> dict:
         cross = "GREEN_BY_CONSTRUCTION"
     elif final == "GREEN" and primary in ("PROSE_TAIL", "TRAILING_CR"):
         cross = "GREEN_DESPITE_FORMATTING"
+    # LABEL_PREFIX is deliberately in neither arm: a labelled line exits 127 at
+    # the shell, so a runner cannot have reported it GREEN. If one ever did, the
+    # run is reported with cross="none" and the class printed, rather than being
+    # folded into a bucket whose meaning it would dilute.
 
     per_iteration = []
     for n in sorted(iters):
@@ -393,6 +432,22 @@ FIXTURES = [
     ("CHECK: python3 x.py\n\nA CHECK: line is required.\n", "SOUND"),
     ("CHECK: python3 x.py\n\n CHECK: line \u2014 one shell command that verifies "
      "your work and exits 0\n", "PROSE_TAIL"),
+    # LABEL_PREFIX cells (2026-11-02, volt). The first two are the measured
+    # shapes: cell 1 is the line this lane's own ralph iteration died on
+    # (`bash: line 1: selftest:: command not found`), cell 2 is the one the
+    # runner's 2026-10-27 forge log carries, one iteration before that CHECK was
+    # rewritten without the label. The four controls pin the boundary of the
+    # rule: a colon that is not in the FIRST word, a colon inside an assignment,
+    # and a quoted first token are all SOUND.
+    ("CHECK: selftest: python3 tools/check_lint.py --selftest\n", "LABEL_PREFIX"),
+    ("CHECK: line: python3 tools/check_lint.py --selftest\n", "LABEL_PREFIX"),
+    ("CHECK: Verdict: bash CHECK-x\n", "LABEL_PREFIX"),          # capitalised
+    ("CHECK: step-2: python3 x.py\n", "LABEL_PREFIX"),           # hyphenated
+    ("CHECK: 2026-11-02: python3 x.py\n", "LABEL_PREFIX"),       # date label
+    ("CHECK: ok:true\n", "LABEL_PREFIX"),                        # no space after
+    ("CHECK: python3 x.py: --selftest\n", "SOUND"),              # colon, word 2
+    ("CHECK: PATH=/a:/b python3 x.py\n", "SOUND"),               # assignment
+    ("CHECK: 'note: x' cmd\n", "SOUND"),                         # quoted token
 ]
 
 EXTRACT_FIXTURES = [
@@ -435,6 +490,7 @@ def print_rules():
     print("  EMPTY        a CHECK line with nothing after the colon")
     print("  TAUTOLOGY    whole command is true/: /exit 0/echo/printf/sleep")
     print("  CATCH_ALL    a || arm or terminal ; statement that exits 0 regardless")
+    print("  LABEL_PREFIX a leading `word:` label -- bash exits 127 on it")
     print("  TRAILING_CR  a literal carriage return survives at end of line")
     print("  PROSE_TAIL   prose follows the command (CANDIDATE, cut point printed)")
     print("  SOUND        none of the above -- not a promise about its meaning")

tools/import_resolve_check.py

@@ -64,13 +64,27 @@ WHAT IT MEASURES -- a byte reading, not a text one
                      instrument could not read is a file it did not grade.
   ADVISORY           an absolute binding in a tracked file that is not a test
                      file by the name rule (`test_*.py`, `_test_*.py`,
-                     `*_test.py`). Counted and printed, NOT graded -- the class
-                     is 30 probe scripts across other lanes, most of them
-                     throwaway reproductions that name a host path on purpose,
-                     and reddening on them would make this guard unrunnable.
-                     `--all-files` grades every tracked `*.py` instead; it is
-                     expected to read RED today, and that number is the class's
-                     true size.
+                     `*_test.py`) and does not run a single assertion. Counted
+                     and printed, NOT graded -- the class is 30 probe scripts
+                     across other lanes, most of them throwaway reproductions
+                     that name a host path on purpose, and reddening on them
+                     would make this guard unrunnable. `--all-files` grades
+                     every tracked `*.py` instead; it is expected to read RED
+                     today, and that number is the class's true size.
+
+  ASSERTING FILE     Q163. The advisory class asks a question about the file's
+                     NAME, and Q100 already ruled that the name is not evidence
+                     about what a file does. Measured on 2026-11-03: 23 tracked
+                     files carried an absolute binding under a non-test name,
+                     and 22 ran **zero** assert statements -- throwaway probes,
+                     exactly the class the exemption is for. The twenty-third,
+                     `wizard-work/beam/_smoke_intervals.py`, ran three and
+                     imported `intervals` from the binding: a test suite by the
+                     same rule that reads assertions, classed advisory by its
+                     spelling. A non-test-named file that asserts is therefore
+                     GRADED, not advised. A file that does not parse cannot be
+                     seen to assert, so it stays advisory rather than becoming
+                     an ungradable finding it never was.
 
   Values are READ, not pattern-matched: the constant string is extracted from
   the AST (including the leading part of an f-string) and `os.path.realpath`
@@ -119,7 +133,7 @@ USAGE
   python3 import_resolve_check.py --all-files
   python3 import_resolve_check.py --import-probe
   python3 import_resolve_check.py --json PATH
-  python3 import_resolve_check.py --selftest          # 38 cells
+  python3 import_resolve_check.py --selftest          # 42 cells
 """
 
 from __future__ import annotations
@@ -301,6 +315,25 @@ def classify(raw, repo_real):
     return OUTSIDE_REPO
 
 
+def asserts_source(text):
+    """Q163: does this file run assertions, whatever its name says?
+
+    The advisory class is a judgment about a file's NAME. This is the same
+    judgment asked of its BYTES: a tracked file that asserts is running cells,
+    and if it binds an absolute path those cells grade whatever sits there.
+    A file that will not parse cannot be seen to assert -- it answers False and
+    stays advisory, because turning it into an UNGRADABLE row would invent a
+    finding the guard never made.
+    """
+    try:
+        with warnings.catch_warnings():
+            warnings.simplefilter("ignore")
+            tree = ast.parse(text)
+    except (SyntaxError, ValueError):
+        return False
+    return any(isinstance(node, ast.Assert) for node in ast.walk(tree))
+
+
 def scan(text, path, repo_real):
     """Findings for one file's source: [(line, cls, how, raw, is_prefix)]."""
     try:
@@ -437,9 +470,14 @@ def run(repo, rev, all_files, probe, quiet=False):
                 ungraded.append((path, why))
             continue
         if not is_test and not all_files:
-            if scan_silent(text, repo_real):
+            if not scan_silent(text, repo_real):
+                continue
+            if not asserts_source(text):
                 advisory += 1
-            continue
+                continue
+            # Q163: a tracked file that runs assertions is a test suite
+            # whatever its name says; it is graded, not advised.
+            is_test = True
         graded += 1
         try:
             hits = scan(text, path, repo_real)
@@ -859,6 +897,43 @@ def selftest():
         check("21b it stays an advisory row, ungraded",
               (obj["graded"], obj["advisory"]), (0, 3))
 
+        # 22. Q163: a non-test-named file that ASSERTS is a test suite. The
+        # measured shape: `wizard-work/beam/_smoke_intervals.py` bound
+        # /root/troupe-standup/wizard-work/beam, ran three asserts against
+        # `intervals`, and sat in the advisory class because of its name; with
+        # the module beside a copy poisoned it still read green.
+        repo = os.path.join(td, "c22")
+        _write(os.path.join(repo, "_smoke_intervals.py"),
+               'import sys\n'
+               'sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")\n'
+               'import intervals\n'
+               'assert intervals.merge([(1, 2)]) == [(1, 2)]\n')
+        _write(os.path.join(repo, "intervals.py"),
+               "def merge(iv):\n    return []\n")
+        _git_init(repo)
+        subprocess.run(["git", "-C", repo, "add", "-A"], check=True,
+                       capture_output=True)
+        rc, obj = call(repo, "WORKTREE", False, False, quiet=True)
+        check("22 an ASSERTING non-test name -> rc 1", rc, 1)
+        check("22b and it is graded, not advised",
+              (obj["graded"], obj["faults"][0][0], obj["advisory"]),
+              (1, "_smoke_intervals.py", 0))
+
+        # 23. NEGATIVE CONTROL: the same binding without an assertion is the
+        # probe class the exemption exists for -- advisory, not graded.
+        repo = os.path.join(td, "c23")
+        _write(os.path.join(repo, "_probe_intervals.py"),
+               'import sys\n'
+               'sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")\n'
+               'print("probe")\n')
+        _git_init(repo)
+        subprocess.run(["git", "-C", repo, "add", "-A"], check=True,
+                       capture_output=True)
+        rc, obj = call(repo, "WORKTREE", False, False, quiet=True)
+        check("23 the same binding, no assert -> rc 0", rc, 0)
+        check("23b and it stays an advisory row, ungraded",
+              (obj["graded"], obj["advisory"]), (0, 1))
+
     print("selftest: %d cells, %d passed, %d failed"
           % (cells, passed, len(failures)))
     for f in failures:

tools/path_claim_baseline.tsv

@@ -293,3 +293,14 @@ wizard-work/sphinx/lcmm-claim-index-2026-10-24/verify_claim_index.py	NOT_ADDED	c
 # name, with the same blob -- stated, not exempted.
 checkins/2026-10-30-timmy-tm-formidable.md	RENAMED	added at bd160bb (timmy: TM formidable-opponent build), renamed at 590c7d9 to checkins/2026-10-30-timmy.md as an F1 BAD_NAME repair with 0 byte changes (blob 1f3e51c1f9dfd26b7afaae2045f5c604f3c46172 both sides); WORK-QUEUE.md:13655 cites the old name while describing that rename
 wizard-work/spark/test_blank.txt	NOT_ADDED	cited at wizard-work/spark/README.md:210 while the spark lane is editing that directory in place (README.md, VERIFICATION.md, test_line_counter.py, test_log.txt and verify_line_counter.sh all modified at fbe4f1c); untracked in the worktree (6 B), git log --all --diff-filter=A -> 0 commits, so no ref holds it; also cited by checkins/2026-10-31-volt.md in the Q136 follow-up as the live-edit example the detached-worktree gate leg exists for. The row clears when the spark lane commits the fixture.
+verify_wordcount_test.py	EXAMPLE	quoted at WORK-QUEUE.md:14386 (Q157 record) as one of the two frozen paths the older CHECK-sol-untracked-classify artifact names and no longer finds on disk -- the token is the record quoting an absence, not a citation of a file this tree holds; git log --all --diff-filter=A -> 0 commits, so no ref ever held it either
+wizard-work/null/.hermes-tmp.RqZp3z	EXAMPLE	quoted at WORK-QUEUE.md:14386 (Q157 record) beside the row above, for the same reason: a temporary file the 2026-10-28 snapshot froze and the tree no longer carries; 0 add-commits on any ref, so it was never a tracked path this archive lost
+wizard-work/volt/q157-newentry/newentry_readings.tsv	NOT_ADDED	cited at WORK-QUEUE.md:14361 (Q157 record) as one of the four paths the live untracked set had added since the 4a640e1 pin -- the record is describing drift, and this file is part of that drift; it is untracked in this worktree, 0 add-commits on any ref, and is the measurement a prior volt tick took of the 18 unnamed entry points (check_sweep.py --paths), left for its own item
+wizard-work/volt/q157-newentry/newentry_take.py	NOT_ADDED	cited at WORK-QUEUE.md:14361 beside the row above and for the same reason: the runner that took that measurement; untracked in this worktree, 0 add-commits on any ref
+# CLEARED 2026-11-03 (Q165): wizard-work/beam/_run_regex.py was a NOT_ADDED row
+# here, cited at WORK-QUEUE.md:14553 (Q164 record) as the untracked six-line hand
+# runner whose presence moved the beam coverage census. `2829ff0` committed it, so
+# the path is now in the tree, the census names it as an EXEMPT waiver with its
+# reason stated, and the tool reads the row as CLEARED. Removed from the graded
+# ledger and kept here as the reading rather than deleted silently.
+wizard-work/beam/zz_q164_scratch_probe.py	NOT_ADDED	cited at WORK-QUEUE.md:14583 (Q165 record) as the two-line scratch probe a previous tick's CHECK-q164 scratch leg left behind and this tick removed; git log --all --diff-filter=A -- wizard-work/beam/zz_q164_scratch_probe.py -> 0 commits, and it is named in that record as removed precisely so a reader can check the tree holds none of it

tools/selftest_baseline.tsv

@@ -12,14 +12,14 @@
 append_only_audit.py	18	cells
 append_only_owners.py	15	cells
 census_row_delta.py	37	cells
-check_lint.py	42	cells
+check_lint.py	51	cells
 checkin_check.py	36	cells
 citation_hash_class.py	19	fixtures
 citation_resolve_check.py	14	fixtures
 doc_census_check.py	104	cells
 doc_command_check.py	18	cells
 gate_blame.py	21	cells
-import_resolve_check.py	38	cells
+import_resolve_check.py	42	cells
 landing_check.py	26	cells
 manifest_audit.py	17	cells
 path_claim_check.py	31	cells

wizard-work/beam/CHECK

@@ -27,6 +27,14 @@
 # `toposort/test_toposort.py` is a plain script (8 PASS lines + ALL), not a
 # unittest or pytest module, so it keeps its own line.
 #
+# Runner note (Q164, 2026-11-03). `_smoke_intervals.py` (Q163) is a test by
+# content -- four asserts, one of them the binding cell -- but it is not named
+# `test_*.py`, so `run_lane_tests.py` never collected it and it ran only under
+# the root entry point `CHECK-q163`. `check_coverage.py` then graded it as a
+# lane MODULE read by nothing, which is the reading this line removes: the lane
+# gate executes it, so its cells run in the place a lane expects its tests to
+# run, and the coverage census reads it as `covered-gate`.
+#
 # Runner note (Q153, 2026-11-02). Every cell above passed while one of them
 # graded a file nobody committed: test_next_greater.py carried
 # `sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")` from `096ba9b`, so
@@ -85,4 +93,5 @@ case $crc in
     *) echo "CHECK: check_coverage.py exited $crc -- internal error." >&2; exit 1 ;;
 esac
 
+python3 _smoke_intervals.py
 python3 toposort/test_toposort.py

wizard-work/beam/CHECK_mcmf

@@ -0,0 +1,4 @@
+#!/usr/bin/env bash
+set -euo pipefail
+cd "$(dirname "$(readlink -f "$0")")"
+python3 test_mincost_maxflow_small.py

wizard-work/beam/_run_regex.py

@@ -0,0 +1,7 @@
+import test_regex_match as t
+t.test_cases_recursive()
+t.test_cases_dp()
+t.test_cross_check_random()
+t.test_type_errors()
+t.test_match_alias()
+print("ALL PASS")

wizard-work/beam/_run_tests.py

@@ -0,0 +1,6 @@
+import test_factor as t
+for name in sorted(dir(t)):
+    if name.startswith('test_'):
+        getattr(t, name)()
+        print('PASS', name)
+print('ALL PASS')

wizard-work/beam/_smoke_intervals.py

@@ -0,0 +1,33 @@
+"""Smoke: three cells over `intervals.py`, the module BESIDE this file.
+
+Q163. This script landed with `sys.path.insert(0, "/root/troupe-standup/
+wizard-work/beam")`, so it graded whatever that host directory held. Measured
+on 2026-11-03: a copy of this script in a scratch lane whose `intervals.py` was
+replaced by a stand-in returning `[]`, `-1` and `[]` still printed
+`intervals smoke OK`, rc 0 -- it had read the host copy. It now binds its own
+directory, and asserts which file it read, so that reading cannot recur
+silently.
+"""
+import sys
+from pathlib import Path
+
+HERE = Path(__file__).resolve().parent
+sys.path.insert(0, str(HERE))
+
+import intervals  # noqa: E402
+from intervals import merge, total_covered, find_gaps  # noqa: E402
+
+assert Path(intervals.__file__).resolve() == HERE / "intervals.py", \
+    "graded %s, not the module beside this file" % intervals.__file__
+
+
+def main():
+    # smoke
+    assert merge([(1, 4), (3, 6), (8, 10)]) == [(1, 6), (8, 10)]
+    assert total_covered([(1, 4), (3, 6)]) == 5
+    assert find_gaps([(1, 3), (5, 7)], 0, 8) == [(0, 1), (3, 5), (7, 8)]
+    print("intervals smoke OK")
+
+
+if __name__ == "__main__":
+    main()

wizard-work/beam/beam-verify-token-bucket.md

@@ -0,0 +1 @@
+token_bucket module verified: 9/9 tests pass (unittest test_token_bucket)

wizard-work/beam/binary_search_bounds.py

@@ -0,0 +1,34 @@
+"""Binary search helpers returning insertion positions.
+
+bisect_left(a, x): leftmost index i such that a[i] >= x
+bisect_right(a, x): rightmost index i such that a[i] <= x (i.e. insertion point after equals)
+Both assume a sorted ascending.
+"""
+from __future__ import annotations
+
+
+def bisect_left(a, x):
+    lo, hi = 0, len(a)
+    while lo < hi:
+        mid = (lo + hi) // 2
+        if a[mid] < x:
+            lo = mid + 1
+        else:
+            hi = mid
+    return lo
+
+
+def bisect_right(a, x):
+    lo, hi = 0, len(a)
+    while lo < hi:
+        mid = (lo + hi) // 2
+        if a[mid] <= x:
+            lo = mid + 1
+        else:
+            hi = mid
+    return lo
+
+
+def contains(a, x):
+    i = bisect_left(a, x)
+    return i < len(a) and a[i] == x

wizard-work/beam/check_coverage.py

@@ -32,6 +32,18 @@ THE RULE (stated, not implied)
   naming a module that is now covered are each their own fault, so this table
   cannot rot into a list of names nobody re-reads.
 
+WHERE THE MODULE LIST COMES FROM (Q164, 2026-11-03)
+  This file enumerated the lane with `glob(lane/*.py)` -- the DIRECTORY -- so
+  a scratch file that existed only on the host that ran it was graded as a lane
+  module.  Measured on 2026-11-03 at `a96da08`: the worktree read 125 modules /
+  3 fault(s), and a `git archive HEAD` export of the SAME COMMIT read 124
+  modules / 2 fault(s); the difference was `_run_regex.py`, untracked, which no
+  clone of that commit contains.  The list now comes from the TREE
+  (`git ls-files`), untracked `*.py` in the lane are named in a note instead of
+  graded, and a lane outside a work tree falls back to the directory with that
+  fact printed -- `--enumerate dir` still reads the directory on demand, so the
+  two readings can be compared rather than argued.
+
 EXIT CODES (the repo's tools/ contract)
   0  every lane module is covered, or waived with a reason
   1  a graded fault: module(s) read by nothing (named), or a bad waiver
@@ -48,6 +60,7 @@ import glob
 import json
 import os
 import re
+import subprocess
 import sys
 
 DEFAULT_LANE = os.path.dirname(os.path.abspath(__file__))
@@ -83,6 +96,21 @@ EXEMPT = {
         "in it, printing PASS per cell. Q153 repaired that file's host-path binding and "
         "the collected suite now runs it; this script is a debugging convenience, not a "
         "unit of the lane.",
+    "_run_tests.py":
+        "five-line hand runner of the same shape: it imports test_factor and calls every "
+        "test_* in it, printing PASS per cell. test_factor.py is collected and its cells "
+        "run inside `bash CHECK` (run_lane_tests.py imports the module and wraps every "
+        "bare test_* in FunctionTestCase), so this file grades nothing the gate does not "
+        "already grade; it is the Q-series convenience runner, kept as a transcript.",
+    "_run_regex.py":
+        "six-line hand runner of the same shape, waived by the same reading: it imports "
+        "test_regex_match and calls its five test_* cells (cases_recursive, cases_dp, "
+        "cross_check_random, type_errors, match_alias), printing ALL PASS. That test file "
+        "is collected and its cells run inside `bash CHECK` through run_lane_tests.py, so "
+        "this script grades nothing the gate does not already grade. Q164 met it as an "
+        "untracked scratch file and named it in a note; `2829ff0` committed it, which "
+        "turned the note into an UNCOVERED row, and this waiver is the honest disposition "
+        "rather than a deletion of another lane's committed file.",
     "conftest.py":
         "pytest collection hook (two lines: put the lane on sys.path), read by the "
         "collector rather than imported by a test. The lane's gate does not use pytest "
@@ -125,7 +153,72 @@ def string_literals(tree):
     }
 
 
-def grade(lane, exempt=None):
+def _git(root, *args):
+    """Run one git command in `root`; returns (rows, error) -- error names why."""
+    try:
+        out = subprocess.run(("git", "-C", root) + tuple(args),
+                             capture_output=True, text=True)
+    except OSError as exc:
+        return None, "git could not be run: %s" % exc
+    if out.returncode != 0:
+        return None, (out.stderr.strip().splitlines() or ["git exited %d" % out.returncode])[-1]
+    return [line.strip() for line in out.stdout.split("\0") if line.strip()], None
+
+
+def enumerate_lane(lane, mode="git"):
+    """List the lane's *.py from the tree (git) or the directory.
+
+    Returns (paths, notes, mode_used).  mode_used is "git" or "dir", not the
+    requested mode: a lane outside a work tree cannot be read from a tree, and
+    the note says so rather than letting the census describe a host and call it
+    a repository (Q140/Q141, re-opened here as Q164).
+    """
+    notes = []
+    lane = os.path.abspath(lane)
+    if mode == "dir":
+        return sorted(glob.glob(os.path.join(lane, "*.py"))), \
+            ["enumerate dir: the census reads the directory, untracked files included"], "dir"
+    top, err = _git(lane, "rev-parse", "--show-toplevel")
+    root = top[0] if top else None
+    if err or not root:
+        return sorted(glob.glob(os.path.join(lane, "*.py"))), \
+            ["enumerate dir: %s; the census reads the directory, untracked files "
+             "included" % (err or "no work tree root")], "dir"
+    root = os.path.realpath(root)
+    rel = os.path.relpath(os.path.realpath(lane), root)
+    if rel.startswith(".."):
+        return sorted(glob.glob(os.path.join(lane, "*.py"))), \
+            ["enumerate dir: %s is not under the work tree root %s" % (lane, root)], "dir"
+    here = "." if rel == "." else rel   # the lane may BE the work tree root
+    tracked, err = _git(root, "ls-files", "-z", "--", here)
+    if err:
+        return sorted(glob.glob(os.path.join(lane, "*.py"))), \
+            ["enumerate dir: git ls-files failed (%s)" % err], "dir"
+    paths, missing = [], []
+    for p in sorted(tracked):
+        if not p.endswith(".py"):
+            continue
+        if os.path.normpath(os.path.dirname(p) or ".") != os.path.normpath(here):
+            continue
+        if not os.path.isfile(os.path.join(root, p)):
+            missing.append(os.path.basename(p))
+            continue
+        paths.append(os.path.join(root, p))
+    untracked, uerr = _git(root, "ls-files", "-z", "--others", "--exclude-standard", "--", here)
+    if uerr:
+        notes.append("untracked list unread (%s): a file absent from the tree may be graded" % uerr)
+        untracked = []
+    for p in sorted(untracked or ()):
+        if p.endswith(".py") and os.path.normpath(os.path.dirname(p) or ".") == os.path.normpath(here):
+            notes.append("untracked, not graded: %s.py (in the directory, absent from the "
+                         "tree)" % module_stem(p))
+    for name in missing:
+        notes.append("tracked, missing from the worktree (not graded): %s" % name)
+    notes.append("enumerate git: the census reads the tree at %s" % root)
+    return paths, notes, "git"
+
+
+def grade(lane, exempt=None, mode="git"):
     """Grade one lane directory. Returns (rc, rows, notes).
 
     rows: list of dicts {module, state, why} -- state is one of
@@ -145,7 +238,10 @@ def grade(lane, exempt=None):
     if not os.path.isdir(lane):
         return 2, rows, ["no lane directory: %s" % lane]
 
-    lane_py = sorted(glob.glob(os.path.join(lane, "*.py")))
+    lane_py, enum_notes, mode_used = enumerate_lane(lane, mode)
+    notes.extend(enum_notes)
+    if mode != mode_used:
+        notes.append("enumerate: requested %s, read %s" % (mode, mode_used))
     tests = [p for p in lane_py if os.path.basename(p).startswith("test_")]
     modules = [p for p in lane_py if not os.path.basename(p).startswith("test_")]
 
@@ -305,17 +401,18 @@ def _fixture(root, name, files, exempt=None, check_text=None):
 def selftest(tmp):
     cases = []
 
-    def cell(name, lane, exempt, want_rc, want_states, want_named=None):
-        rc, rows, notes = grade(lane, exempt)
+    def cell(name, lane, exempt, want_rc, want_states, want_named=None, mode="git"):
+        rc, rows, notes = grade(lane, exempt, mode)
         got = {r["module"]: r["state"] for r in rows}
         ok = rc == want_rc
-        detail = "rc=%d want %d" % (rc, want_rc)
+        detail = "rc=%d want %d (%s)" % (rc, want_rc, mode)
         for mod, state in want_states.items():
             if got.get(mod) != state:
                 ok = False
                 detail += "; %s=%r want %r" % (mod, got.get(mod), state)
         if want_named:
             text = "\n".join("%s %s" % (r["state"], r["module"]) for r in rows)
+            text += "\n" + "\n".join(notes)
             for needle in want_named:
                 if needle not in text:
                     ok = False
@@ -426,10 +523,70 @@ def selftest(tmp):
                   "ok": grade(os.path.join(tmp, "does-not-exist"), {})[0] == 2,
                   "detail": "rc=%d" % grade(os.path.join(tmp, "does-not-exist"), {})[0]})
 
+    # --- where the module list comes from (Q164) --------------------------
+    # 14/15/16 build a real work tree: the same directory, read twice.  Cell
+    # 14 is the item: an untracked *.py in the lane is NOT graded, and it is
+    # named in a note.  Cell 15 is the falsifiability cell -- the directory
+    # reading still sees it and reds, so 14 passes because the source moved
+    # and not because the file was waived.  Cell 16 commits the same file and
+    # the fault returns: tree enumeration is not "everything passes".
+    def git_run(root, *args):
+        return subprocess.run(("git", "-C", root, "-c", "user.email=selftest@invalid",
+                               "-c", "user.name=selftest") + args,
+                              capture_output=True, text=True)
+
+    def git_available():
+        try:
+            return subprocess.run(("git", "--version"), capture_output=True).returncode == 0
+        except OSError:
+            return False
+
+    have_git = git_available()
+    lane, ex = _fixture(tmp, "tree-untracked", {
+        "helper.py": "def value():\n    return 1\n",
+        "test_helper.py": cover_test,
+        "orphan.py": "print('scratch, never committed')\n",
+    })
+    if have_git:
+        git_run(lane, "init", "-q")
+        git_run(lane, "add", "helper.py", "test_helper.py")
+        git_run(lane, "commit", "-qm", "tracked pair")
+        cell("tree-untracked-not-graded", lane, ex, 0,
+             {"helper": "covered-test-import"},
+             want_named=["untracked, not graded: orphan", "enumerate git"])
+        cell("dir-enumeration-still-sees-it", lane, ex, 1, {"orphan": "UNCOVERED"},
+             mode="dir")
+        git_run(lane, "add", "orphan.py")
+        git_run(lane, "commit", "-qm", "now tracked")
+        cell("tree-tracked-uncovered-is-red", lane, ex, 1, {"orphan": "UNCOVERED"})
+    else:
+        for name in ("tree-untracked-not-graded", "dir-enumeration-still-sees-it",
+                     "tree-tracked-uncovered-is-red"):
+            cases.append({"case": name, "ok": True, "skip": True,
+                          "detail": "skip: git is not installed on this interpreter"})
+
+    # 17 a lane outside a work tree falls back to the directory and says so
+    lane, ex = _fixture(tmp, "no-work-tree", {
+        "helper.py": "def value():\n    return 1\n",
+        "test_helper.py": cover_test,
+    })
+    inside = git_run(os.path.dirname(lane), "rev-parse", "--show-toplevel")
+    if inside.returncode == 0:
+        cases.append({"case": "non-work-tree-falls-back", "ok": True, "skip": True,
+                      "detail": "skip: %s is inside a work tree" % tmp})
+    else:
+        rc, rows, notes = cell("non-work-tree-falls-back", lane, ex, 0,
+                               {"helper": "covered-test-import"},
+                               want_named=["enumerate dir"], mode="git")
+
     bad = [c for c in cases if not c["ok"]]
+    skipped = [c for c in cases if c.get("skip")]
     for c in cases:
-        print("%-4s %-32s %s" % ("ok" if c["ok"] else "FAIL", c["case"], c["detail"]))
-    print("selftest: %d cell(s), %d failed" % (len(cases), len(bad)))
+        print("%-4s %-32s %s" % ("ok" if c["ok"] and not c.get("skip")
+                                 else ("skip" if c.get("skip") else "FAIL"),
+                                 c["case"], c["detail"]))
+    print("selftest: %d cell(s), %d failed, %d skipped"
+          % (len(cases), len(bad), len(skipped)))
     return 1 if bad else 0
 
 
@@ -438,6 +595,9 @@ def main(argv=None):
     ap.add_argument("--lane", default=DEFAULT_LANE)
     ap.add_argument("--json", default=None, help="write the row table here")
     ap.add_argument("--list", action="store_true", help="print every row, not only the exceptions")
+    ap.add_argument("--enumerate", choices=("git", "dir"), default="git",
+                    help="where the module list comes from: the tree (default) or the "
+                         "directory, untracked files included")
     ap.add_argument("--selftest", action="store_true")
     args = ap.parse_args(argv)
 
@@ -446,14 +606,15 @@ def main(argv=None):
         with tempfile.TemporaryDirectory(prefix="coverage-selftest.") as tmp:
             return selftest(tmp)
 
-    rc, rows, notes = grade(args.lane)
+    rc, rows, notes = grade(args.lane, mode=args.enumerate)
     if args.list:
         for r in rows:
             print("%-20s %-26s %s" % (r["state"], r["module"], r["why"]))
     report(args.lane, rc, rows, notes)
     if args.json:
         with open(args.json, "w", encoding="utf-8") as fh:
-            json.dump({"lane": args.lane, "rc": rc, "rows": rows, "notes": notes}, fh, indent=1)
+            json.dump({"lane": args.lane, "rc": rc, "enumerate": args.enumerate,
+                       "rows": rows, "notes": notes}, fh, indent=1)
     return rc
 
 

wizard-work/beam/dedup.py

@@ -0,0 +1,100 @@
+#!/usr/bin/env python3
+"""Content-based duplicate file detector.
+
+Groups files by size first (cheap), then hashes only size-collisions (SHA-256),
+so identical content is detected regardless of name. Handles symlinks (skips
+by default to avoid loops), empty files (grouped together as one duplicate set),
+and large files (streamed in 1 MiB chunks).
+
+Usage:
+    dedup.py <dir> [--min-size N] [--follow-symlinks] [--json]
+"""
+import argparse
+import hashlib
+import json
+import os
+import sys
+from collections import defaultdict
+
+CHUNK = 1024 * 1024
+
+
+def sha256_file(path):
+    h = hashlib.sha256()
+    with open(path, "rb") as f:
+        while True:
+            b = f.read(CHUNK)
+            if not b:
+                break
+            h.update(b)
+    return h.hexdigest()
+
+
+def collect(root, follow_symlinks, min_size):
+    by_size = defaultdict(list)
+    for dirpath, dirnames, filenames in os.walk(root, followlinks=follow_symlinks):
+        # prune symlinked dirs unless following
+        if not follow_symlinks:
+            dirnames[:] = [d for d in dirnames
+                           if not os.path.islink(os.path.join(dirpath, d))]
+        for name in filenames:
+            p = os.path.join(dirpath, name)
+            if os.path.islink(p) and not follow_symlinks:
+                continue
+            try:
+                st = os.stat(p, follow_symlinks=follow_symlinks)
+            except OSError:
+                continue
+            if not os.path.isfile(p) if False else False:
+                pass
+            if st.st_size < min_size:
+                continue
+            by_size[st.st_size].append(p)
+    return by_size
+
+
+def find_duplicates(root, follow_symlinks=False, min_size=1):
+    by_size = collect(root, follow_symlinks, min_size)
+    groups = []
+    for size, paths in by_size.items():
+        if len(paths) < 2:
+            continue
+        by_hash = defaultdict(list)
+        for p in paths:
+            try:
+                by_hash[sha256_file(p)].append(p)
+            except OSError:
+                continue
+        for h, ps in by_hash.items():
+            if len(ps) >= 2:
+                groups.append({"hash": h, "size": size, "files": sorted(ps)})
+    groups.sort(key=lambda g: (-g["size"], g["hash"]))
+    return groups
+
+
+def main():
+    ap = argparse.ArgumentParser()
+    ap.add_argument("root")
+    ap.add_argument("--min-size", type=int, default=0)
+    ap.add_argument("--follow-symlinks", action="store_true")
+    ap.add_argument("--json", action="store_true")
+    args = ap.parse_args()
+    if not os.path.isdir(args.root):
+        print("error: not a directory: " + args.root, file=sys.stderr)
+        return 2
+    groups = find_duplicates(args.root, args.follow_symlinks, args.min_size)
+    if args.json:
+        print(json.dumps(groups, indent=2))
+        return 0
+    if not groups:
+        print("no duplicates found")
+        return 0
+    for i, g in enumerate(groups, 1):
+        print("group %d: %d files, %d bytes, sha256=%s" % (i, len(g["files"]), g["size"], g["hash"]))
+        for f in g["files"]:
+            print("  " + f)
+    return 0
+
+
+if __name__ == "__main__":
+    sys.exit(main())

wizard-work/beam/expr_eval.py

@@ -111,7 +111,8 @@ class Parser:
     def parse_unary(self):
         if self.peek()[0] == 'op' and self.peek()[1] in ('+', '-'):
             op = self.advance()[1]
-            v = self.parse_unary()
+            # operand is a full power expression so that -2**2 == -(2**2)
+            v = self.parse_factor()
             return -v if op == '-' else v
         return self.parse_primary()
 

wizard-work/beam/factor.py

@@ -0,0 +1,124 @@
+"""Integer primality (deterministic Miller-Rabin for n < 2^64) and factorization
+(Pollard's rho with Brent cycle detection + deterministic Miller-Rabin).
+"""
+import math
+import random
+
+
+_SMALL_PRIMES = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37)
+
+
+def is_prime(n: int) -> bool:
+    if n < 2:
+        return False
+    for p in _SMALL_PRIMES:
+        if n == p:
+            return True
+        if n % p == 0:
+            return False
+    d = n - 1
+    s = 0
+    while d % 2 == 0:
+        d //= 2
+        s += 1
+    for a in (2, 3, 5, 7, 11, 13, 17):
+        if a % n == 0:
+            continue
+        x = pow(a, d, n)
+        if x == 1 or x == n - 1:
+            continue
+        composite = True
+        for _ in range(s - 1):
+            x = x * x % n
+            if x == n - 1:
+                composite = False
+                break
+        if composite:
+            return False
+    return True
+
+
+def _pollard_brent(n: int) -> int:
+    if n % 2 == 0:
+        return 2
+    if n % 3 == 0:
+        return 3
+    while True:
+        c = random.randrange(1, n)
+        f = lambda x: (x * x + c) % n
+        y, m, g, r, q = random.randrange(2, n), 1, 1, 1, 1
+        while g == 1:
+            x = y
+            for _ in range(r):
+                y = f(y)
+            k = 0
+            while k < r and g == 1:
+                ys = y
+                for _ in range(min(m, r - k)):
+                    y = f(y)
+                    diff = x - y
+                    if diff < 0:
+                        diff = -diff
+                    q = q * diff % n
+                g = math.gcd(q, n)
+                k += m
+            r *= 2
+            m *= 2
+        if g == n:
+            while True:
+                ys = f(ys)
+                diff = x - ys
+                if diff < 0:
+                    diff = -diff
+                g = math.gcd(diff, n)
+                if g != 1:
+                    break
+        if g != n:
+            return g
+
+
+def factor(n: int) -> list[int]:
+    if n < 0:
+        return factor(-n)
+    if n < 2:
+        return []
+    n = abs(n)
+    factors = []
+
+    def _factor(m):
+        if m == 1:
+            return
+        if is_prime(m):
+            factors.append(m)
+            return
+        d = _pollard_brent(m)
+        _factor(d)
+        _factor(m // d)
+
+    for p in _SMALL_PRIMES:
+        while n % p == 0:
+            factors.append(p)
+            n //= p
+    if n > 1:
+        _factor(n)
+    factors.sort()
+    return factors
+
+
+def totient(n: int) -> int:
+    if n < 1:
+        raise ValueError("n must be >= 1")
+    if n == 1:
+        return 1
+    fs = factor(n)
+    result = n
+    for p in set(fs):
+        result -= result // p
+    return result
+
+
+if __name__ == "__main__":
+    import sys
+    for arg in sys.argv[1:]:
+        n = int(arg)
+        print(n, is_prime(n), factor(n))

wizard-work/beam/floyd_warshall.py

@@ -0,0 +1,54 @@
+"""Floyd-Warshall all-pairs shortest paths."""
+from __future__ import annotations
+
+
+def floyd_warshall(n, edges):
+    INF = float("inf")
+    dist = [[INF] * n for _ in range(n)]
+    nxt = [[None] * n for _ in range(n)]
+    for i in range(n):
+        dist[i][i] = 0
+        nxt[i][i] = i
+    for (u, v, w) in edges:
+        if w < dist[u][v]:
+            dist[u][v] = w
+            nxt[u][v] = v
+    for k in range(n):
+        dk = dist[k]
+        nk = nxt[k]
+        for i in range(n):
+            dik = dist[i][k]
+            if dik == INF:
+                continue
+            di = dist[i]
+            ni = nxt[i]
+            for j in range(n):
+                if dk[j] == INF:
+                    continue
+                nd = dik + dk[j]
+                if nd < di[j]:
+                    di[j] = nd
+                    ni[j] = ni[k]
+    for i in range(n):
+        if dist[i][i] < 0:
+            raise ValueError("negative cycle detected")
+    return dist, nxt
+
+
+def reconstruct_path(nxt, s, t):
+    if nxt[s][t] is None:
+        return None
+    path = [s]
+    cur = s
+    seen = set()
+    while cur != t:
+        if cur in seen:
+            return None
+        seen.add(cur)
+        cur = nxt[cur][t]
+        if cur is None:
+            return None
+        path.append(cur)
+        if len(path) > len(nxt) + 1:
+            return None
+    return path

wizard-work/beam/interval_cover.py

@@ -0,0 +1,34 @@
+"""Minimum number of intervals to cover [0, target).
+
+Greedy: at each step, among intervals with start <= current coverage end,
+pick the one extending furthest right. Returns list of chosen intervals
+or None if full coverage impossible.
+"""
+from __future__ import annotations
+
+
+def min_interval_cover(intervals, target):
+    if target <= 0:
+        return []
+    ivs = sorted(intervals, key=lambda x: x[0])
+    chosen = []
+    cur_end = 0
+    i = 0
+    n = len(ivs)
+    while cur_end < target:
+        best_end = cur_end
+        best = None
+        # consider all intervals starting <= cur_end
+        j = 0
+        # find first not considered; use scanning from 0 each iteration is fine for correctness
+        for iv in ivs:
+            if iv[0] <= cur_end and iv[1] > best_end:
+                best_end = iv[1]
+                best = iv
+        if best is None or best_end == cur_end:
+            return None
+        chosen.append(best)
+        cur_end = best_end
+        # remove used interval to avoid infinite loop? If best still best, next iteration best_end would equal cur_end -> None. Remove it.
+        ivs = [x for x in ivs if x is not best]
+    return chosen

wizard-work/beam/interval_merge.py

@@ -0,0 +1,67 @@
+"""Interval merge utilities.
+
+Semantics (half-open intervals [start, end)):
+- Intervals with start >= end are invalid (ValueError).
+- Two intervals overlap/touch if a.start <= b.end and b.start <= a.end? We define
+  "merge if they overlap or touch" (closed merging) using half-open touch rule:
+  intervals [a,b) and [b,c) DO merge (adjacent) because there is no gap.
+  intervals [a,b) and [b+1,c) do NOT merge.
+- Output is sorted, disjoint, merged, each as (start, end) tuple.
+- Empty input -> [].
+"""
+
+from typing import Iterable, List, Tuple
+
+Interval = Tuple[int, int]
+
+
+def _validate(iv: Interval) -> None:
+    if not isinstance(iv, (tuple, list)) or len(iv) != 2:
+        raise ValueError(f"interval must be 2-tuple, got {iv!r}")
+    s, e = iv
+    if not isinstance(s, int) or not isinstance(e, int) or isinstance(s, bool) or isinstance(e, bool):
+        raise ValueError(f"endpoints must be ints, got {iv!r}")
+    if s >= e:
+        raise ValueError(f"empty/invalid interval {iv!r}: start must be < end")
+
+
+def merge_intervals(intervals: Iterable[Interval]) -> List[Interval]:
+    ivs = [tuple(iv) for iv in intervals]
+    for iv in ivs:
+        _validate(iv)
+    if not ivs:
+        return []
+    ivs.sort()
+    out: List[Interval] = [ivs[0]]
+    for s, e in ivs[1:]:
+        ps, pe = out[-1]
+        if s <= pe:  # overlap or touch (half-open touch merges)
+            out[-1] = (ps, max(pe, e))
+        else:
+            out.append((s, e))
+    return out
+
+
+def total_covered(intervals: Iterable[Interval]) -> int:
+    return sum(e - s for s, e in merge_intervals(intervals))
+
+
+def gaps(intervals: Iterable[Interval], lo: int, hi: int) -> List[Interval]:
+    """Return merged gaps within [lo, hi) not covered by intervals."""
+    if lo >= hi:
+        raise ValueError("lo must be < hi")
+    merged = merge_intervals(intervals)
+    out: List[Interval] = []
+    cur = lo
+    for s, e in merged:
+        s = max(s, lo); e = min(e, hi)
+        if s >= e:
+            continue
+        if s > cur:
+            out.append((cur, s))
+        cur = max(cur, e)
+        if cur >= hi:
+            break
+    if cur < hi:
+        out.append((cur, hi))
+    return out

wizard-work/beam/kruskal.py

@@ -0,0 +1,100 @@
+"""Kruskal's minimum spanning tree on an undirected weighted graph.
+
+Public API:
+    kruskal(edges, nodes) -> (total_weight, list_of_edges)
+edges: iterable of (u, v, w) (undirected). nodes: iterable of node labels.
+Returns (weight, edges) of an MST; raises ValueError if graph is disconnected
+(no spanning tree exists). Ties broken by input order (stable).
+
+Also exposes `find(parent, x)` / `union(parent, rank, x, y)` helpers.
+"""
+from __future__ import annotations
+
+
+def find(parent, x):
+    # iterative path compression
+    root = x
+    while parent[root] != root:
+        root = parent[root]
+    while parent[x] != root:
+        parent[x], x = root, parent[x]
+    return root
+
+
+def union(parent, rank, x, y):
+    rx, ry = find(parent, x), find(parent, y)
+    if rx == ry:
+        return False
+    if rank[rx] < rank[ry]:
+        rx, ry = ry, rx
+    parent[ry] = rx
+    if rank[rx] == rank[ry]:
+        rank[rx] += 1
+    return True
+
+
+def kruskal(edges, nodes):
+    nodes = list(nodes)
+    parent = {n: n for n in nodes}
+    rank = {n: 0 for n in nodes}
+    # stable sort by weight (Python sort is stable)
+    ordered = sorted(edges, key=lambda e: e[2])
+    chosen = []
+    total = 0
+    for u, v, w in ordered:
+        if u not in parent or v not in parent:
+            raise ValueError("unknown node")
+        if w < 0:
+            raise ValueError("negative weight")
+        if union(parent, rank, u, v):
+            chosen.append((u, v, w))
+            total += w
+            if len(chosen) == len(nodes) - 1:
+                break
+    if len(nodes) > 1 and len(chosen) != len(nodes) - 1:
+        raise ValueError("graph disconnected")
+    return total, chosen
+
+
+def _brute_mst(edges, nodes):
+    """Reference: enumerate all subsets of edges of size |V|-1, pick min weight
+    spanning tree (connected, acyclic). Only feasible for small graphs."""
+    from itertools import combinations
+
+    nodes = list(nodes)
+    n = len(nodes)
+    if n <= 1:
+        return 0, []
+    need = n - 1
+    best = None
+    for combo in combinations(edges, need):
+        # build adjacency
+        adj = {x: [] for x in nodes}
+        for u, v, w in combo:
+            adj[u].append(v)
+            adj[v].append(u)
+        # connectivity
+        seen = set()
+        stack = [nodes[0]]
+        while stack:
+            x = stack.pop()
+            if x in seen:
+                continue
+            seen.add(x)
+            for y in adj[x]:
+                if y not in seen:
+                    stack.append(y)
+        if len(seen) != n:
+            continue
+        # acyclicity: edges == nodes-1 and connected => tree
+        total = sum(w for _, _, w in combo)
+        if best is None or total < best[0]:
+            best = (total, list(combo))
+    if best is None:
+        raise ValueError("graph disconnected")
+    return best
+
+
+if __name__ == "__main__":
+    e = [("a", "b", 1), ("b", "c", 2), ("a", "c", 4)]
+    print(kruskal(e, ["a", "b", "c"]))

wizard-work/beam/mincost_maxflow.py

@@ -0,0 +1,120 @@
+"""Minimum-cost maximum-flow (successive shortest augmenting path with potentials).
+
+Given a directed graph with per-edge (capacity, cost), computes the flow of
+minimum total cost among all flows of a given value (or max flow up to cap).
+
+Algorithm: SPFA (or Bellman-Ford) once to seed potentials, then Dijkstra with
+reduced costs (Johnson's potentials) for each augmentation. Handles negative
+edge costs as long as no negative cycles (none exist in a residual of a
+min-cost flow). Costs may be negative on forward edges; residual reverse edges
+carry negated cost, handled via potentials.
+
+API:
+    mcmf = MinCostMaxFlow(n)
+    mcmf.add_edge(u, v, cap, cost)
+    flow, cost = mcmf.min_cost_flow(s, t, maxf)   # push up to maxf units
+    # cost is total cost of pushed flow; flow is units actually pushed.
+
+Invariants:
+  1. Potentials h[v] are feasible: reduced cost c'(u,v)=c(u,v)+h[u]-h[v] >= 0
+     for every residual edge with cap>0.
+  2. Each augmentation sends 1 unit (or bottleneck) along shortest (min cost)
+     s-t path in residual; potentials updated by dist.
+  3. Total cost accumulated equals sum over augmentations of path cost.
+"""
+from heapq import heappush, heappop
+
+
+class MinCostMaxFlow:
+    def __init__(self, n):
+        self.n = n
+        self.graph = [[] for _ in range(n)]
+
+    def add_edge(self, u, v, cap, cost):
+        # forward edge
+        fwd = [v, cap, cost, None]  # rev filled below
+        rev = [u, 0, -cost, None]
+        fi = len(self.graph[u])
+        ri = len(self.graph[v])
+        fwd[3] = ri
+        rev[3] = fi
+        self.graph[u].append(fwd)
+        self.graph[v].append(rev)
+        return fi
+
+    def _bellman(self, s):
+        INF = float("inf")
+        dist = [INF] * self.n
+        dist[s] = 0
+        # V-1 relaxations
+        for _ in range(self.n):
+            updated = False
+            for u in range(self.n):
+                if dist[u] == INF:
+                    continue
+                for e in self.graph[u]:
+                    v, cap, cost, _ = e
+                    if cap > 0 and dist[u] + cost < dist[v]:
+                        dist[v] = dist[u] + cost
+                        updated = True
+            if not updated:
+                break
+        for i in range(self.n):
+            if dist[i] == INF:
+                dist[i] = 0
+        return dist
+
+    def min_cost_flow(self, s, t, maxf):
+        n = self.n
+        INF = float("inf")
+        h = self._bellman(s)  # initial potentials
+        flow = 0
+        cost = 0
+        # residual capacity tracking via edge lists (mutable)
+        while flow < maxf:
+            dist = [INF] * n
+            prevv = [-1] * n
+            preve = [-1] * n
+            dist[s] = 0
+            pq = [(0, s)]
+            while pq:
+                d, u = heappop(pq)
+                if dist[u] < d:
+                    continue
+                for i, e in enumerate(self.graph[u]):
+                    v, cap, c, _ = e
+                    if cap > 0:
+                        rc = c + h[u] - h[v]
+                        if rc < 0:
+                            # shouldn't happen with feasible potentials
+                            rc = 0
+                        if dist[v] > dist[u] + rc:
+                            dist[v] = dist[u] + rc
+                            prevv[v] = u
+                            preve[v] = i
+                            heappush(pq, (dist[v], v))
+            if dist[t] == INF:
+                break
+            for v in range(n):
+                if dist[v] < INF:
+                    h[v] += dist[v]
+            # bottleneck
+            addf = maxf - flow
+            v = t
+            while v != s:
+                u = prevv[v]
+                e = self.graph[u][preve[v]]
+                addf = min(addf, e[1])
+                v = u
+            v = t
+            while v != s:
+                u = prevv[v]
+                ei = preve[v]
+                e = self.graph[u][ei]
+                e[1] -= addf
+                revi = e[3]
+                self.graph[v][revi][1] += addf
+                cost += addf * e[2]
+                v = u
+            flow += addf
+        return flow, cost

wizard-work/beam/mod_inverse.py

@@ -0,0 +1,31 @@
+"""Modular multiplicative inverse via extended Euclid.
+
+modinv(a, m) returns x in [0, m) with a*x ≡ 1 (mod m), or None when
+gcd(a, m) != 1 (no inverse exists). Handles negative a, m>1 only.
+"""
+def egcd(a, b):
+    if b == 0:
+        return (a, 1, 0)
+    g, x1, y1 = egcd(b, a % b)
+    return (g, y1, x1 - (a // b) * y1)
+
+def modinv(a, m):
+    if not isinstance(m, int) or m <= 1:
+        raise ValueError("modulus must be int > 1")
+    a = a % m
+    g, x, _ = egcd(a, m)
+    if g != 1 and g != -1:
+        # normalize gcd sign
+        if g < 0:
+            g = -g
+            x = -x
+        if g != 1:
+            return None
+    x %= m
+    # verify
+    if (a * x) % m != 1:
+        return None
+    return x
+
+if __name__ == "__main__":
+    print(modinv(3, 11))

wizard-work/beam/path_sandbox.py

@@ -95,6 +95,10 @@ def is_within(root, target):
         rt = os.path.realpath(target)
     except (OSError, ValueError):
         return False
-    if rr == os.sep:
-        return rt == rr or rt.startswith(rr)
-    return rt == rr or rt.startswith(rr + os.sep)
+    # Use commonpath rather than a raw string prefix so that a root like
+    # /tmp/root cannot be confused with a sibling like /tmp/rootX.
+    try:
+        cp = os.path.commonpath([rr, rt])
+    except ValueError:
+        return False
+    return cp == rr

wizard-work/beam/regex_match.py

@@ -0,0 +1,76 @@
+"""Regular expression matching supporting '.' and '*' (LeetCode 10).
+
+'.' matches any single character; '*' matches zero or more of the
+preceding element. The match must cover the *entire* input string.
+
+Two implementations are provided:
+  - is_match(s, p): recursive backtracking with memoisation.
+  - is_match_dp(s, p): bottom-up DP table.
+
+Both agree on all inputs; tests cross-check them.
+"""
+
+from __future__ import annotations
+from functools import lru_cache
+
+
+def _norm(p: str) -> str:
+    return p
+
+
+def is_match(s: str, p: str) -> bool:
+    """Recursive memoised matcher."""
+    if not isinstance(s, str) or not isinstance(p, str):
+        raise TypeError("s and p must be str")
+
+    # Precompute lengths.
+    n, m = len(s), len(p)
+
+    from functools import lru_cache
+
+    @lru_cache(maxsize=None)
+    def rec(i: int, j: int) -> bool:
+        # i position in s, j position in p
+        if j == m:
+            return i == n
+        # peek next char for '*'
+        first = (i < n) and (p[j] == s[i] or p[j] == '.')
+        if j + 1 < m and p[j + 1] == '*':
+            # zero occurrences OR one+ occurrences
+            return rec(i, j + 2) or (first and rec(i + 1, j))
+        if first:
+            return rec(i + 1, j + 1)
+        return False
+
+    return rec(0, 0)
+
+
+def is_match_dp(s: str, p: str) -> bool:
+    if not isinstance(s, str) or not isinstance(p, str):
+        raise TypeError("s and p must be str")
+    n, m = len(s), len(p)
+    # dp[i][j] = s[:i] matches p[:j]
+    dp = [[False] * (m + 1) for _ in range(n + 1)]
+    dp[0][0] = True
+    # patterns like a*, a*b*, ... match empty string
+    for j in range(2, m + 1):
+        if p[j - 1] == '*':
+            dp[0][j] = dp[0][j - 2]
+    for i in range(1, n + 1):
+        for j in range(1, m + 1):
+            if p[j - 1] == '*':
+                # zero occurrences
+                dp[i][j] = dp[i][j - 2]
+                # one+ occurrences
+                if (p[j - 2] == s[i - 1] or p[j - 2] == '.') and dp[i - 1][j]:
+                    dp[i][j] = True
+            elif p[j - 1] == '.' or p[j - 1] == s[i - 1]:
+                dp[i][j] = dp[i - 1][j - 1]
+            else:
+                dp[i][j] = False
+    return dp[n][m]
+
+
+# cross-check alias
+def match(s: str, p: str) -> bool:
+    return is_match(s, p)

wizard-work/beam/tarjan_articulation.py

@@ -0,0 +1,101 @@
+"""Tarjan articulation points and bridges in an undirected graph."""
+from __future__ import annotations
+import sys
+from collections import defaultdict, deque
+
+
+def _build_indexed(adj):
+    adj = {k: list(v) for k, v in adj.items()}
+    nodes = set(adj.keys())
+    for u, nbrs in adj.items():
+        for v in nbrs:
+            nodes.add(v)
+    for n in nodes:
+        adj.setdefault(n, [])
+
+    slots = []
+    for u in nodes:
+        for v in adj[u]:
+            if v != u:
+                slots.append((u, v))
+
+    pair_of = [-1] * len(slots)
+    remaining = defaultdict(deque)
+    for i, (u, v) in enumerate(slots):
+        remaining[(v, u)].append(i)
+    for i, (u, v) in enumerate(slots):
+        if pair_of[i] != -1:
+            continue
+        q = remaining[(u, v)]
+        while q and pair_of[q[0]] != -1:
+            q.popleft()
+        if q:
+            r = q.popleft()
+            pair_of[i] = r
+            pair_of[r] = i
+
+    # shared uid per undirected edge
+    uid_of = [None] * len(slots)
+    uid = 0
+    for i in range(len(slots)):
+        if uid_of[i] is not None:
+            continue
+        if pair_of[i] != -1 and pair_of[i] != i:
+            uid_of[i] = uid
+            uid_of[pair_of[i]] = uid
+            uid += 1
+        else:
+            uid_of[i] = uid
+            uid += 1
+
+    idx_adj = {n: [] for n in nodes}
+    for i, (u, v) in enumerate(slots):
+        idx_adj[u].append((v, uid_of[i]))
+
+    return nodes, idx_adj
+
+
+def articulation_points_and_bridges(adj):
+    adj = {k: list(v) for k, v in adj.items()}
+    nodes, idx_adj = _build_indexed(adj)
+
+    sys.setrecursionlimit(max(10000, len(nodes) + 100))
+    disc = {}
+    low = {}
+    timer = [0]
+    ap = set()
+    bridges = set()
+
+    def dfs(u, parent_uid, is_root):
+        disc[u] = low[u] = timer[0]
+        timer[0] += 1
+        children = 0
+        for v, uid in idx_adj[u]:
+            if uid == parent_uid:
+                continue
+            if v not in disc:
+                children += 1
+                dfs(v, uid, False)
+                low[u] = min(low[u], low[v])
+                if (not is_root) and low[v] >= disc[u]:
+                    ap.add(u)
+                if low[v] > disc[u]:
+                    bridges.add((min(u, v), max(u, v)))
+            else:
+                low[u] = min(low[u], disc[v])
+        if is_root and children > 1:
+            ap.add(u)
+
+    for start in sorted(nodes, key=lambda x: str(x)):
+        if start not in disc:
+            dfs(start, -1, True)
+
+    return ap, bridges
+
+
+def articulation_points(adj):
+    return articulation_points_and_bridges(adj)[0]
+
+
+def bridges(adj):
+    return articulation_points_and_bridges(adj)[1]

wizard-work/beam/tarjan_scc.py

@@ -0,0 +1,116 @@
+"""Tarjan's strongly connected components (SCC) algorithm.
+
+Iterative DFS to avoid recursion limits; verified against a brute-force
+reachability SCC on 2000 random directed graphs.
+"""
+import random
+import sys
+
+
+def tarjan_scc(n, edges):
+    adj = [[] for _ in range(n)]
+    for u, v in edges:
+        adj[u].append(v)
+
+    index_counter = [0]
+    stack = []
+    on_stack = [False] * n
+    indices = [-1] * n
+    lowlink = [0] * n
+    result = []
+
+    for start in range(n):
+        if indices[start] != -1:
+            continue
+        work = [(start, 0)]
+        indices[start] = lowlink[start] = index_counter[0]
+        index_counter[0] += 1
+        stack.append(start)
+        on_stack[start] = True
+
+        while work:
+            u, pi = work[-1]
+            if pi < len(adj[u]):
+                work[-1] = (u, pi + 1)
+                v = adj[u][pi]
+                if indices[v] == -1:
+                    indices[v] = lowlink[v] = index_counter[0]
+                    index_counter[0] += 1
+                    stack.append(v)
+                    on_stack[v] = True
+                    work.append((v, 0))
+                elif on_stack[v]:
+                    if indices[v] < lowlink[u]:
+                        lowlink[u] = indices[v]
+            else:
+                if lowlink[u] == indices[u]:
+                    comp = []
+                    while True:
+                        w = stack.pop()
+                        on_stack[w] = False
+                        comp.append(w)
+                        if w == u:
+                            break
+                    result.append(comp)
+                work.pop()
+                if work:
+                    parent = work[-1][0]
+                    if lowlink[u] < lowlink[parent]:
+                        lowlink[parent] = lowlink[u]
+    return result
+
+
+def brute_scc(n, edges):
+    adj = [[False] * n for _ in range(n)]
+    for u, v in edges:
+        adj[u][v] = True
+    for k in range(n):
+        for i in range(n):
+            if adj[i][k]:
+                row_i = adj[i]
+                row_k = adj[k]
+                for j in range(n):
+                    if row_k[j]:
+                        row_i[j] = True
+    seen = [False] * n
+    comps = []
+    for i in range(n):
+        if seen[i]:
+            continue
+        comp = [j for j in range(n) if not seen[j] and adj[i][j] and adj[j][i]]
+        if i not in comp:
+            comp.append(i)
+        for j in comp:
+            seen[j] = True
+        comps.append(comp)
+    return comps
+
+
+def normalize(comps):
+    return sorted(sorted(c) for c in comps)
+
+
+def self_test():
+    random.seed(42)
+    for t in range(2000):
+        n = random.randint(1, 12)
+        m = random.randint(0, n * n)
+        edges = [(random.randrange(n), random.randrange(n)) for _ in range(m)]
+        a = normalize(tarjan_scc(n, edges))
+        b = normalize(brute_scc(n, edges))
+        if a != b:
+            print("MISMATCH", n, edges)
+            print("tarjan", a)
+            print("brute", b)
+            return False
+    assert normalize(tarjan_scc(0, [])) == []
+    assert normalize(tarjan_scc(1, [])) == [[0]]
+    assert normalize(tarjan_scc(3, [(0, 1), (1, 2), (2, 0)])) == [[0, 1, 2]]
+    assert normalize(tarjan_scc(3, [(0, 1), (1, 2)])) == [[0], [1], [2]]
+    print("ALL TESTS PASSED (2000 random + edge cases)")
+    return True
+
+
+if __name__ == "__main__":
+    ok = self_test()
+    sys.exit(0 if ok else 1)

wizard-work/beam/test_binary_search_bounds.py

@@ -0,0 +1,55 @@
+"""Bounds cells for `binary_search_bounds.py`, the module BESIDE this file.
+
+Q166. This file landed at `2829ff0` with
+`sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")`, a directory outside
+the repository, so it graded whatever that host directory held and no clone
+could reproduce its reading: `tools/import_resolve_check.py` read
+`FAULT OUTSIDE_REPO wizard-work/beam/test_binary_search_bounds.py:2`. It now
+binds its own directory and asserts which file it read, the same repair Q160
+and Q162 made in this lane.
+
+The same edit makes the checks attributable. The file shipped with its
+assertions at module level and no `test_*` function, so the lane's runner read
+it as `unittest=0 bare=0`: a wrong bound surfaced as an import error against
+the file, never as a named failing cell.
+"""
+import os
+import random
+import sys
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+
+import binary_search_bounds  # noqa: E402
+from binary_search_bounds import bisect_left, bisect_right, contains  # noqa: E402
+
+assert os.path.realpath(binary_search_bounds.__file__) == \
+    os.path.realpath(os.path.join(HERE, "binary_search_bounds.py")), \
+    "graded %s, not the module beside this file" % binary_search_bounds.__file__
+
+
+def _brute_left(a, x):
+    return sum(1 for v in a if v < x)
+
+
+def _brute_right(a, x):
+    return sum(1 for v in a if v <= x)
+
+
+def test_bounds_brute_cases():
+    for a in ([], [1], [1, 2, 3], [1, 1, 2, 2, 3]):
+        for x in (0, 1, 2, 3, 4):
+            assert bisect_left(a, x) == _brute_left(a, x), (a, x)
+            assert bisect_right(a, x) == _brute_right(a, x), (a, x)
+            assert contains(a, x) == (x in a), (a, x)
+
+
+def test_bounds_random_1000():
+    random.seed(42)
+    for _ in range(1000):
+        n = random.randint(0, 20)
+        a = sorted(random.randint(-5, 5) for _ in range(n))
+        x = random.randint(-6, 6)
+        assert bisect_left(a, x) == _brute_left(a, x), (a, x)
+        assert bisect_right(a, x) == _brute_right(a, x), (a, x)
+        assert contains(a, x) == (x in a), (a, x)

wizard-work/beam/test_counterparty_sig.py

@@ -0,0 +1,111 @@
+"""Cells for counterparty_sig.py (Q85): authorship-aware repository signature.
+
+The module had no collected cell, so the property it exists for -- a signature
+that names only counterparty-authored bytes -- was ungraded.  Each cell builds
+a throwaway git repository with two identities and reads the signature back, so
+the authorship rule is measured against real commits rather than described.
+"""
+import hashlib
+import os
+import subprocess
+import tempfile
+import unittest
+
+import counterparty_sig as S
+
+SELF = ("Volt", "volt@troupe.local")
+THEM = ("Merlin", "merlin@troupe.local")
+
+
+def git(repo, *args, identity=None):
+    cmd = ["git", "-C", repo, "-c", "commit.gpgsign=false", "-c", "init.defaultBranch=main"]
+    if identity:
+        cmd += ["-c", "user.name=" + identity[0], "-c", "user.email=" + identity[1]]
+    return subprocess.run(cmd + list(args), check=True, capture_output=True, text=True)
+
+
+def commit(repo, path, body, identity, message):
+    full = os.path.join(repo, path)
+    os.makedirs(os.path.dirname(full), exist_ok=True)
+    with open(full, "w", encoding="utf-8") as fh:
+        fh.write(body)
+    git(repo, "add", path)
+    git(repo, "commit", "-q", "-m", message, identity=identity)
+    return git(repo, "rev-parse", "HEAD").stdout.strip()
+
+
+class SignatureFixture(unittest.TestCase):
+    def setUp(self):
+        self.tmp = tempfile.TemporaryDirectory(prefix="counterparty-sig.")
+        self.repo = self.tmp.name
+        git(self.repo, "init", "-q")
+        self.mine = commit(self.repo, "inbox/mine.txt", "my note\n", SELF, "volt: note")
+        self.theirs = commit(self.repo, "inbox/theirs.md", "their note\n", THEM, "merlin: note")
+
+    def tearDown(self):
+        self.tmp.cleanup()
+
+
+class TestCounterpartySignature(SignatureFixture):
+    def test_head_is_the_newest_counterparty_commit(self):
+        text, digest = S.signature(self.repo, SELF[0], ["inbox"])
+        self.assertEqual(text.splitlines()[0], "head %s" % self.theirs[:12])
+        self.assertNotIn(self.mine[:12], text)
+
+    def test_only_counterparty_authored_paths_are_listed(self):
+        text, _ = S.signature(self.repo, SELF[0], ["inbox"])
+        self.assertIn("inbox/theirs.md", text)
+        self.assertNotIn("inbox/mine.txt", text)
+
+    def test_blob_ids_are_the_twelve_character_prefixes_at_head(self):
+        text, _ = S.signature(self.repo, SELF[0], ["inbox"])
+        blob = git(self.repo, "rev-parse", "%s:inbox/theirs.md" % self.theirs).stdout.strip()
+        self.assertIn("inbox/theirs.md %s" % blob[:12], text)
+
+    def test_digest_is_the_hash_of_the_text_and_is_stable(self):
+        text1, digest1 = S.signature(self.repo, SELF[0], ["inbox"])
+        text2, digest2 = S.signature(self.repo, SELF[0], ["inbox"])
+        self.assertEqual(text1, text2)
+        self.assertEqual(digest1, digest2)
+        self.assertEqual(digest1, hashlib.sha256(text1.encode()).hexdigest())
+        self.assertEqual(len(digest1), 64)
+
+    def test_self_authored_later_edit_drops_the_path(self):
+        # The rule is authorship of the newest commit touching the path, not of
+        # the commit the file is read from: a self edit at head removes it.
+        commit(self.repo, "inbox/theirs.md", "their note\nplus mine\n", SELF, "volt: edit their note")
+        text, _ = S.signature(self.repo, SELF[0], ["inbox"])
+        self.assertNotIn("inbox/theirs.md", text)
+        self.assertEqual(len(text.splitlines()), 1, text)
+
+    def test_a_repository_with_no_counterparty_commit_raises(self):
+        with tempfile.TemporaryDirectory(prefix="counterparty-solo.") as solo:
+            git(solo, "init", "-q")
+            commit(solo, "a.txt", "only me\n", SELF, "volt: only")
+            with self.assertRaises(RuntimeError):
+                S.signature(solo, SELF[0], ["."])
+
+    def test_git_failure_is_raised_with_the_command_named(self):
+        with self.assertRaises(RuntimeError) as ctx:
+            S.run(os.path.join(self.tmp.name, "no-such-repo"), "log")
+        self.assertIn("git", str(ctx.exception))
+
+    def test_commits_reads_author_triples(self):
+        rows = S.commits(self.repo)
+        self.assertEqual([row[1] for row in rows], ["Merlin", "Volt"])
+        self.assertEqual([row[2] for row in rows], [THEM[1], SELF[1]])
+        for sha, _name, _email in rows:
+            self.assertEqual(len(sha), 40)
+
+    def test_newest_commit_for_path_is_cached(self):
+        cache = {}
+        first = S.newest_commit_for_path(self.repo, "inbox/theirs.md", SELF[0], cache)
+        self.assertEqual(first[0], self.theirs)
+        self.assertTrue(first[3], "a counterparty commit must be marked counterparty")
+        before = dict(cache)
+        S.newest_commit_for_path(self.repo, "inbox/theirs.md", SELF[0], cache)
+        self.assertEqual(cache, before, "the second call must not re-enter git")
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_dedup.py

@@ -0,0 +1,81 @@
+import json, os, subprocess, sys, tempfile, unittest
+
+ROOT = os.path.dirname(os.path.abspath(__file__))
+SCRIPT = os.path.join(ROOT, "dedup.py")
+PY = sys.executable
+
+
+def make_tree(tmp):
+    d = os.path.join(tmp, "t")
+    os.makedirs(d)
+    a = os.path.join(d, "a.txt"); b = os.path.join(d, "b.txt")
+    with open(a, "w") as f: f.write("hello world\n" * 100)
+    with open(b, "w") as f: f.write("hello world\n" * 100)
+    with open(os.path.join(d, "c.txt"), "w") as f: f.write("unique content")
+    open(os.path.join(d, "e1"), "w").close()
+    open(os.path.join(d, "e2"), "w").close()
+    sub = os.path.join(d, "sub"); os.makedirs(sub)
+    with open(os.path.join(sub, "dup.txt"), "w") as f: f.write("hello world\n" * 100)
+    return d
+
+
+def run(args):
+    return subprocess.run([PY, SCRIPT] + args, capture_output=True, text=True)
+
+
+class Tests(unittest.TestCase):
+    def test_finds_duplicates(self):
+        with tempfile.TemporaryDirectory() as td:
+            d = make_tree(td)
+            r = run([d, "--json"])
+            self.assertEqual(r.returncode, 0, r.stderr)
+            groups = json.loads(r.stdout)
+            sizes = sorted(len(g["files"]) for g in groups)
+            self.assertEqual(sizes, [2, 3], sizes)
+            for g in groups:
+                self.assertEqual(len(g["hash"]), 64)
+
+    def test_no_duplicates(self):
+        with tempfile.TemporaryDirectory() as td:
+            d = os.path.join(td, "t2"); os.makedirs(d)
+            with open(os.path.join(d, "x"), "w") as f: f.write("x")
+            r = run([d])
+            self.assertEqual(r.returncode, 0)
+            self.assertIn("no duplicates", r.stdout)
+
+    def test_min_size_filters(self):
+        with tempfile.TemporaryDirectory() as td:
+            d = make_tree(td)
+            r = run([d, "--min-size", "100000", "--json"])
+            self.assertEqual(r.returncode, 0)
+            self.assertEqual(json.loads(r.stdout), [])
+
+    def test_missing_dir(self):
+        r = run(["/no/such/dir/xyz"])
+        self.assertEqual(r.returncode, 2)
+        self.assertIn("not a directory", r.stderr)
+
+    def test_symlink_skipped_by_default(self):
+        with tempfile.TemporaryDirectory() as td:
+            d = make_tree(td)
+            link = os.path.join(d, "link.txt")
+            os.symlink(os.path.join(d, "a.txt"), link)
+            r = run([d, "--json"])
+            groups = json.loads(r.stdout)
+            content_group = [g for g in groups if g["size"] > 0][0]
+            self.assertEqual(len(content_group["files"]), 3)
+            self.assertNotIn(link, content_group["files"])
+
+    def test_follow_symlinks(self):
+        with tempfile.TemporaryDirectory() as td:
+            d = make_tree(td)
+            link = os.path.join(d, "link.txt")
+            os.symlink(os.path.join(d, "a.txt"), link)
+            r = run([d, "--follow-symlinks", "--json"])
+            groups = json.loads(r.stdout)
+            content_group = [g for g in groups if g["size"] > 0][0]
+            self.assertEqual(len(content_group["files"]), 4)
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_expr_eval.py

@@ -0,0 +1,56 @@
+import math
+import sys, os
+sys.path.insert(0, os.path.dirname(__file__))
+from expr_eval import evaluate, EvalError
+
+def test_basic():
+    assert evaluate("2 + 3 * 4") == 14
+    assert evaluate("(2+3)*4") == 20
+    assert evaluate("10 / 3") == 10/3
+    assert evaluate("10 // 3") == 3
+    assert evaluate("10 % 3") == 1
+
+def test_power_precedence():
+    # unary binds looser than ** (matches Python)
+    assert evaluate("-2**2") == -4
+    assert evaluate("(-2)**2") == 4
+    assert evaluate("2**-2") == 0.25
+    assert evaluate("2**3**2") == 512
+
+def test_unary():
+    assert evaluate("--5") == 5
+    assert evaluate("-(-3)") == 3
+
+def test_funcs():
+    assert evaluate("sqrt(16)") == 4
+    assert abs(evaluate("sin(0)")) < 1e-12
+    assert evaluate("max(1,2,3)") == 3
+    assert evaluate("min(1,2,3)") == 1
+    assert evaluate("abs(-7)") == 7
+
+def test_vars():
+    assert evaluate("x + pi", {"x": 3, "pi": math.pi}) == 3 + math.pi
+
+def test_errors():
+    for e in ["2 +", "1/0", "foo", "2 @ 3", "sqrt(-1)"]:
+        try:
+            evaluate(e)
+            raise AssertionError(f"no error for {e!r}")
+        except EvalError:
+            pass
+
+if __name__ == "__main__":
+    # run all test_ functions
+    import traceback
+    g = globals()
+    failed = 0
+    for name in sorted(n for n in g if n.startswith("test_")):
+        try:
+            g[name]()
+            print("PASS", name)
+        except Exception:
+            failed += 1
+            print("FAIL", name)
+            traceback.print_exc()
+    print("FAILED:", failed)
+    sys.exit(1 if failed else 0)

wizard-work/beam/test_factor.py

@@ -0,0 +1,85 @@
+"""Tests for factor.py"""
+import random
+from factor import is_prime, factor, totient
+
+
+def _trial_prime(n):
+    if n < 2:
+        return False
+    if n < 4:
+        return True
+    if n % 2 == 0:
+        return False
+    i = 3
+    while i * i <= n:
+        if n % i == 0:
+            return False
+        i += 2
+    return True
+
+
+def test_small_primes():
+    for n in range(2, 3000):
+        assert is_prime(n) == _trial_prime(n), n
+
+
+def test_carmichaels():
+    for c in [561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, 29341, 41041, 46657, 52633, 62745, 63973]:
+        assert not is_prime(c), c
+
+
+def test_large_known_primes():
+    for p in [2**31 - 1, 2**61 - 1, 999999999999999989, 32416190071]:
+        assert is_prime(p), p
+
+
+def test_factor_small():
+    for n in range(2, 1000):
+        fs = factor(n)
+        prod = 1
+        for f in fs:
+            prod *= f
+            assert is_prime(f)
+        assert prod == n
+        assert fs == sorted(fs)
+
+
+def test_factor_random_large():
+    random.seed(42)
+    for _ in range(300):
+        def rnd_prime(lo, hi):
+            while True:
+                x = random.randrange(lo, hi)
+                if is_prime(x):
+                    return x
+        a = rnd_prime(1000, 100000)
+        b = rnd_prime(1000, 100000)
+        n = a * b
+        fs = factor(n)
+        assert sorted(fs) == sorted([a, b]), (n, fs)
+
+
+def test_factor_powers():
+    for base in [2, 3, 5, 7, 11]:
+        for e in [1, 2, 3, 5, 8, 12]:
+            n = base ** e
+            fs = factor(n)
+            assert fs == [base] * e
+
+
+def test_totient():
+    assert totient(1) == 1
+    assert totient(2) == 1
+    assert totient(10) == 4
+    assert totient(12) == 4
+    assert totient(30) == 8
+
+
+def test_edge():
+    assert factor(0) == []
+    assert factor(1) == []
+    assert factor(-12) == [2, 2, 3]
+    assert is_prime(0) is False
+    assert is_prime(1) is False
+    assert is_prime(2) is True
+    assert is_prime(999999999999999937 * 2) is False

wizard-work/beam/test_floyd_warshall.py

@@ -0,0 +1,99 @@
+import random
+from floyd_warshall import floyd_warshall, reconstruct_path
+
+def bellman(n, edges, src):
+    INF = float('inf')
+    d = [INF]*n
+    d[src]=0
+    for _ in range(n-1):
+        for u,v,w in edges:
+            if d[u]!=INF and d[u]+w < d[v]:
+                d[v]=d[u]+w
+    # negative cycle check
+    for u,v,w in edges:
+        if d[u]!=INF and d[u]+w < d[v]:
+            return None
+    return d
+
+def test_basic():
+    n=4
+    edges=[(0,1,5),(1,2,3),(0,2,10),(2,3,1)]
+    dist,nxt=floyd_warshall(n,edges)
+    assert dist[0][3]==9
+    p=reconstruct_path(nxt,0,3)
+    assert p==[0,2,3] or p==[0,1,2,3]  # 0->2->3 = 11? wait 5+3+1=9, 10+1=11. so 0,1,2,3
+    assert p==[0,1,2,3]
+
+def test_unreachable():
+    n=3
+    edges=[(0,1,1)]
+    dist,nxt=floyd_warshall(n,edges)
+    assert dist[0][2]==float('inf')
+    assert reconstruct_path(nxt,0,2) is None
+
+def test_negative_no_cycle():
+    n=3
+    edges=[(0,1,4),(1,2,-2),(0,2,3)]
+    dist,nxt=floyd_warshall(n,edges)
+    assert dist[0][2]==2
+    assert reconstruct_path(nxt,0,2)==[0,1,2]
+
+def test_negative_cycle_raises():
+    n=3
+    edges=[(0,1,1),(1,2,-1),(2,0,-1)]
+    try:
+        floyd_warshall(n,edges)
+        assert False
+    except ValueError:
+        pass
+
+def test_random_vs_bellman():
+    random.seed(42)
+    for _ in range(200):
+        n=random.randint(1,6)
+        m=random.randint(0, n*n)
+        edges=[]
+        for _ in range(m):
+            u=random.randrange(n); v=random.randrange(n)
+            w=random.randint(-3,5)
+            if u==v: 
+                # allow self loops with non-negative? skip to avoid trivial
+                if w<0:
+                    w=0
+            edges.append((u,v,w))
+        # ensure no negative cycles by checking bellman per source? Just run; if raises, skip compare
+        try:
+            dist,nxt=floyd_warshall(n,edges)
+        except ValueError:
+            continue
+        for s in range(n):
+            bf=bellman(n,edges,s)
+            if bf is None:
+                continue
+            for t in range(n):
+                expected=bf[t]
+                got=dist[s][t]
+                assert got==expected, (n,edges,s,t,got,expected)
+                # path check
+                if expected!=float('inf') and s!=t:
+                    p=reconstruct_path(nxt,s,t)
+                    assert p is not None
+                    # verify path cost
+                    cost=0
+                    for i in range(len(p)-1):
+                        ws=[ww for u,v,ww in edges if u==p[i] and v==p[i+1]]
+                        assert ws, p
+                        cost+=min(ws)
+                    assert cost==expected, (p,cost,expected)
+
+def test_self_loop_zero():
+    n=2
+    edges=[(0,0,5)]
+    dist,nxt=floyd_warshall(n,edges)
+    assert dist[0][0]==0  # self distance stays 0 (min of 0 and 5)
+    # actually with self loop 5, min(0,5)=0
+
+if __name__=='__main__':
+    test_basic(); test_unreachable(); test_negative_no_cycle(); test_negative_cycle_raises()
+    test_random_vs_bellman(); test_self_loop_zero()
+    print("ALL OK")

wizard-work/beam/test_handle_resolve.py

@@ -0,0 +1,66 @@
+"""Cells for handle_resolve.py (Q85): longest-roster-prefix handle resolution.
+
+The module carried a `selftest()` of ten cases and no collected cell, so a
+regression in `resolve_handle` moved nothing the gate reads.  These cells assert
+the ten cases through the entry point, then pin the two rules a reader has to
+know: the boundary is a hyphen (not a string prefix), and the LONGEST match
+wins when the roster nests one handle inside another.
+"""
+import unittest
+
+import handle_resolve
+from handle_resolve import resolve_handle
+
+
+class TestResolveHandle(unittest.TestCase):
+    def test_documented_cases(self):
+        cases = [
+            (("volt", {"volt"}), "volt"),
+            (("volt-02", {"volt"}), "volt"),
+            (("voltmeter", {"volt"}), None),
+            (("volt", {"volt", "vol"}), "volt"),
+            (("cassian-q5-census", {"cassian"}), "cassian"),
+            (("gandalf", {"volt"}), None),
+            (("", {"volt"}), None),
+            (("volt-02", set()), None),
+            (("VOLT-02", {"volt"}), "volt"),
+            (("zephyrus-02", {"zephyrus", "zephyrus-0"}), "zephyrus"),
+        ]
+        for args, expected in cases:
+            self.assertEqual(resolve_handle(*args), expected, args)
+
+    def test_boundary_is_a_hyphen_not_a_string_prefix(self):
+        for name in ("voltmeter", "volt2", "voltaire", "volts"):
+            self.assertIsNone(resolve_handle(name, {"volt"}), name)
+        self.assertEqual(resolve_handle("volt-2", {"volt"}), "volt")
+
+    def test_longest_handle_wins(self):
+        self.assertEqual(resolve_handle("zephyrus-0-02", {"zephyrus", "zephyrus-0"}), "zephyrus-0")
+        self.assertEqual(resolve_handle("a-b-c", {"a", "a-b", "a-b-c"}), "a-b-c")
+
+    def test_exact_match_beats_a_longer_non_match(self):
+        self.assertEqual(resolve_handle("volt-02", {"volt", "volt-03"}), "volt")
+
+    def test_case_insensitive_both_ways(self):
+        self.assertEqual(resolve_handle("Volt-02", {"VOLT"}), "volt")
+        self.assertEqual(resolve_handle("volt-02", {"VoLt"}), "volt")
+
+    def test_roster_noise_is_ignored(self):
+        # Empty handles and None rosters are tolerated, not crashed on.
+        self.assertEqual(resolve_handle("volt-02", {"", "volt"}), "volt")
+        self.assertIsNone(resolve_handle("volt", None))
+        self.assertIsNone(resolve_handle(None, {"volt"}))
+
+    def test_returns_the_roster_spelling_lowercased(self):
+        # The result is a roster handle, so it is a set member -- lowercased.
+        roster = {"Volt", "volt-0"}
+        self.assertEqual(resolve_handle("VOLT-0-02", roster), "volt-0")
+        self.assertIn(resolve_handle("VOLT-02", roster), {h.lower() for h in roster})
+
+    def test_module_selftest_exits_zero(self):
+        # The file's own __main__ contract, which nothing collected could see.
+        self.assertEqual(handle_resolve.selftest(), 0)
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_interval.py

@@ -0,0 +1,93 @@
+"""Tests for interval_merge.merge_intervals / total_covered / gaps.
+
+Runs from this directory only:
+    python3 test_interval.py
+
+Q162 / 2026-11-03: the module is resolved from THIS file's directory and from
+nowhere else. The file landed at 33e8ffb with
+
+    sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")
+
+which put a HOST directory first on sys.path, so every cell below graded
+/root/.hermes/wizard-outputs/beam/interval_merge.py and never the committed
+bytes. Measured before the fix: with the copy beside this test overwritten by a
+stand-in whose three functions answer wrongly on every input
+(wizard-work/volt/q162-interval-binding/poison_interval.py), the suite still
+printed `ALL TESTS PASS`, rc 0, because the imported module was the host file.
+The assertion below makes the binding a fact rather than an intention (the rule
+test_toposort.py states at Q61, test_lfu_cache.py at Q98, and
+test_tarjan_articulation.py at Q160).
+"""
+import pathlib
+import random
+import sys
+
+HERE = pathlib.Path(__file__).resolve().parent
+sys.path.insert(0, str(HERE))
+
+import interval_merge as module_under_test
+from interval_merge import merge_intervals, total_covered, gaps
+
+# The module under test must be the committed file next to this test.
+MODULE_PATH = pathlib.Path(module_under_test.__file__).resolve()
+assert MODULE_PATH == (HERE / "interval_merge.py"), (MODULE_PATH, HERE)
+
+
+def brute_merge(intervals):
+    pts = set()
+    # discrete integer points model for small ranges
+    pts_all = set()
+    for s, e in intervals:
+        for x in range(s, e):
+            pts_all.add(x)
+    if not pts_all:
+        return []
+    # build runs
+    out = []
+    for x in sorted(pts_all):
+        if not out or x != out[-1][1]:
+            out.append([x, x+1])
+        else:
+            out[-1][1] = x+1
+    return [tuple(r) for r in out]
+
+random.seed(42)
+for trial in range(2000):
+    n = random.randint(0, 8)
+    ivs = []
+    for _ in range(n):
+        s = random.randint(-5, 5)
+        e = s + random.randint(1, 6)
+        ivs.append((s, e))
+    got = merge_intervals(ivs)
+    exp = brute_merge(ivs)
+    assert got == exp, (ivs, got, exp)
+
+# total_covered
+assert total_covered([(1,4),(3,6),(10,12)]) == (6-1)+(12-10)  # 5+2=7? 1..6 =5, 10..12=2 =>7
+assert total_covered([]) == 0
+
+# gaps
+assert gaps([(2,4)], 0, 6) == [(0,2),(4,6)]
+assert gaps([(0,6)], 0, 6) == []
+assert gaps([], 0, 3) == [(0,3)]
+
+# validation
+for bad in [((1,1),(2,3)), (1,2,3), (True,5), (1,True), ("a",2), (2,1)]:
+    try:
+        merge_intervals([bad] if not isinstance(bad[0], tuple) or len(bad)!=2 or not isinstance(bad[0], int) else [bad])
+    except ValueError:
+        pass
+    else:
+        # some cases may be wrapped; ensure at least invalid ones raise
+        pass
+
+# explicit invalid
+for bad in [(1,1),(2,1),(True,3),(1,True)]:
+    try:
+        merge_intervals([bad])
+        raise AssertionError(f"no raise for {bad}")
+    except ValueError:
+        pass
+
+print("ALL TESTS PASS")

wizard-work/beam/test_interval_cover.py

@@ -0,0 +1,52 @@
+import sys; sys.path.insert(0, str(__import__("pathlib").Path(__file__).resolve().parent))
+from interval_cover import min_interval_cover
+
+# basic
+assert min_interval_cover([(0,5),(5,10)], 10) is not None
+r = min_interval_cover([(0,5),(5,10)], 10)
+assert len(r)==2
+# impossible
+assert min_interval_cover([(0,4),(5,10)], 10) is None
+# single
+assert min_interval_cover([(0,10)], 10) == [(0,10)]
+# empty target
+assert min_interval_cover([(0,5)], 0) == []
+# greedy optimal check vs brute for small
+import itertools
+def brute(intervals,target):
+    # min subset covering [0,target)
+    best=None
+    for r in range(1,len(intervals)+1):
+        for combo in itertools.combinations(intervals,r):
+            # check coverage
+            cur=0
+            # sort
+            s=sorted(combo)
+            ok=True
+            for a,b in s:
+                if a>cur: ok=False;break
+                cur=max(cur,b)
+            if ok and cur>=target:
+                best=r; break
+        if best: break
+    return best
+import random
+random.seed(1)
+for _ in range(2000):
+    n=random.randint(1,6)
+    ivs=[]
+    for _ in range(n):
+        a=random.randint(0,6); b=a+random.randint(1,4)
+        ivs.append((a,b))
+    t=random.randint(1,8)
+    res=min_interval_cover(ivs,t)
+    got = len(res) if res is not None else None
+    # feasibility
+    feas = any(True for _ in [0]) 
+    # compute brute min if feasible
+    b=brute(ivs,t)
+    if b is None:
+        assert res is None, (ivs,t,res)
+    else:
+        assert res is not None and len(res)==b, (ivs,t,res,b)
+print("all ok")

wizard-work/beam/test_kruskal.py

@@ -0,0 +1,72 @@
+import random
+from kruskal import kruskal, _brute_mst
+
+
+def test_basic():
+    e = [("a", "b", 1), ("b", "c", 2), ("a", "c", 4)]
+    w, chosen = kruskal(e, ["a", "b", "c"])
+    assert w == 3
+    assert len(chosen) == 2
+
+
+def test_single_node():
+    w, chosen = kruskal([], ["a"])
+    assert w == 0 and chosen == []
+
+
+def test_disconnected():
+    try:
+        kruskal([("a", "b", 1)], ["a", "b", "c"])
+        raise AssertionError("expected")
+    except ValueError:
+        pass
+
+
+def test_negative():
+    try:
+        kruskal([("a", "b", -1)], ["a", "b"])
+        raise AssertionError("expected")
+    except ValueError:
+        pass
+
+
+def test_unknown_node():
+    try:
+        kruskal([("a", "z", 1)], ["a", "b"])
+        raise AssertionError("expected")
+    except ValueError:
+        pass
+
+
+def test_random_vs_brute():
+    rng = random.Random(42)
+    for _ in range(300):
+        n = rng.randint(1, 6)
+        nodes = list(range(n))
+        # random edge set
+        possible = [(u, v) for u in range(n) for v in range(u + 1, n)]
+        m = rng.randint(0, len(possible))
+        edges = []
+        for u, v in rng.sample(possible, m):
+            edges.append((u, v, rng.randint(0, 9)))
+        # maybe duplicate weights fine
+        try:
+            w1, _ = kruskal(edges, nodes)
+            ok1 = True
+        except ValueError:
+            ok1 = False
+        try:
+            w2, _ = _brute_mst(edges, nodes)
+            ok2 = True
+        except ValueError:
+            ok2 = False
+        assert ok1 == ok2, (edges, nodes, ok1, ok2)
+        if ok1:
+            assert w1 == w2, (edges, nodes, w1, w2)
+
+
+if __name__ == "__main__":
+    for n in [x for x in globals() if x.startswith("test_")]:
+        globals()[n]()
+        print("PASS", n)
+    print("ALL PASS")

wizard-work/beam/test_largest_rect_hist.py

@@ -1,6 +1,15 @@
-import random, sys
-sys.path.insert(0, "/root/.hermes/wizard-outputs/beam")
+import pathlib, random, sys
+
+# Bind the module from THIS file's directory, never from a host path (Q155:
+# this line read "/root/.hermes/wizard-outputs/beam", so the committed
+# largest_rect_hist.py was never the module the cells graded).
+HERE = pathlib.Path(__file__).resolve().parent
+sys.path.insert(0, str(HERE))
 from largest_rect_hist import largest_rectangle_area, _brute
+_MODULE_FILE = sys.modules["largest_rect_hist"].__file__
+assert _MODULE_FILE is not None, "largest_rect_hist imported without a __file__"
+MODULE_PATH = pathlib.Path(_MODULE_FILE).resolve()
+assert MODULE_PATH == HERE / "largest_rect_hist.py", MODULE_PATH
 
 def test_random():
     rng = random.Random(2024)

wizard-work/beam/test_majority.py

@@ -0,0 +1,109 @@
+"""Cells for majority.py (Q85): the generalized Boyer-Moore vote.
+
+No collected test imported the module, so its `__main__` corpus was the only
+thing that ever ran it.  Every cell here compares against a Counter, which
+shares no code with the module, so the vote's bookkeeping is graded rather
+than echoed.
+"""
+import random
+import unittest
+from collections import Counter
+
+import majority as M
+
+
+def brute_gt_k(data, k):
+    n = len(data)
+    return sorted(x for x, c in Counter(data).items() if c > n // k)
+
+
+def brute_majority(data):
+    if not data:
+        return None
+    hits = [x for x, c in Counter(data).items() if c > len(data) // 2]
+    return hits[0] if hits else None
+
+
+class TestMajority(unittest.TestCase):
+    def test_empty_and_small(self):
+        self.assertIsNone(M.majority_element([]))
+        self.assertEqual(M.majority_element([1]), 1)
+        self.assertIsNone(M.majority_element([1, 2]))
+        self.assertEqual(M.majority_element([1, 1, 2]), 1)
+        self.assertIsNone(M.majority_element([1, 2, 3]))
+
+    def test_odd_and_even_near_misses(self):
+        # Exactly half is not a majority; one more than half is.
+        self.assertIsNone(M.majority_element([1, 1, 2, 2]))
+        self.assertEqual(M.majority_element([1, 1, 1, 2]), 1)
+        self.assertIsNone(M.majority_element([1, 1, 2, 3]))
+
+    def test_aliases_agree(self):
+        data = [4, 4, 4, 1, 2]
+        self.assertEqual(M.majority(data), M.majority_element_v2(data))
+        self.assertEqual(M.majority(data), 4)
+
+    def test_counter_resistant_pattern(self):
+        # The order that defeats a naive "cancel adjacent" reading: no prefix
+        # has more candidates than cancellations until the very end.
+        data = [2, 1, 2, 1, 2]
+        self.assertEqual(M.majority_element(data), 2)
+        data = [1, 2, 1, 2, 1, 2, 2]
+        self.assertEqual(M.majority_element(data), 2)
+
+    def test_random_majority_against_counter(self):
+        rng = random.Random(42)
+        for _ in range(1500):
+            n = rng.randint(0, 40)
+            if n and rng.random() < 0.5:
+                maj = rng.randint(0, 5)
+                data = [maj] * (n // 2 + 1) + [rng.randint(0, 5) for _ in range(n - n // 2 - 1)]
+                rng.shuffle(data)
+            else:
+                data = [rng.randint(0, 5) for _ in range(n)]
+            self.assertEqual(M.majority_element(data), brute_majority(data), data)
+
+    def test_gt_k_is_sound_and_complete(self):
+        # Returned values are exactly the ones above n//k -- no false positive
+        # (the docstring's reason for the verification pass) and no omission.
+        rng = random.Random(1234)
+        for _ in range(800):
+            n = rng.randint(0, 30)
+            data = [rng.randint(0, 6) for _ in range(n)]
+            for k in (2, 3, 4, 5):
+                got = M.majority_gt_k(data, k)
+                self.assertEqual(sorted(got), brute_gt_k(data, k), (data, k))
+                self.assertEqual(len(got), len(set(got)), "duplicate in the result")
+                self.assertLessEqual(len(got), k - 1)
+
+    def test_gt_k_structure_cases(self):
+        self.assertEqual(M.majority_gt_k([], 3), [])
+        self.assertEqual(M.majority_gt_k([1, 1, 2, 2, 3, 3], 3), [])
+        self.assertEqual(sorted(M.majority_gt_k([1, 1, 1, 2, 2, 3], 3)), [1])
+        # "More than n//k" is strict: at k=2, exactly half of four is not a
+        # majority, so nothing is returned.  (Written the other way first and
+        # the cell failed -- the module was right, the expectation was not.)
+        self.assertEqual(M.majority_gt_k([1, 1, 2, 2], 2), [])
+        self.assertEqual(sorted(M.majority_gt_k([1, 1, 1, 2], 2)), [1])
+
+    def test_third_is_k_three(self):
+        self.assertEqual(M.majority_third([1, 1, 2]), [1])
+        self.assertEqual(M.majority_third([1, 1, 2, 2, 3, 3]), [])
+        self.assertEqual(M.majority_third([1, 1, 1, 2, 3]), [1])
+
+    def test_k_below_two_is_refused(self):
+        for k in (1, 0, -3):
+            with self.assertRaises(ValueError, msg="k=%r" % k):
+                M.majority_gt_k([1, 2], k)
+
+    def test_one_shot_input_is_materialised(self):
+        # `data = list(nums)` is what makes a generator safe; without it the
+        # second pass over `nums` would see nothing.
+        gen = (x for x in [1, 1, 2])
+        self.assertEqual(M.majority_element(gen), 1)
+        gen = (x for x in [1, 1, 2, 2, 3, 3])
+        self.assertEqual(M.majority_gt_k(gen, 3), [])
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_mincost_maxflow.py

@@ -0,0 +1,90 @@
+import random
+from mincost_maxflow import MinCostMaxFlow
+
+
+def brute_min_cost(n, edges, s, t, maxf):
+    INF = float("inf")
+    g = [[] for _ in range(n)]
+    for (u, v, cap, cost) in edges:
+        fi = len(g[u]); ri = len(g[v])
+        g[u].append([v, cap, cost, ri])
+        g[v].append([u, 0, -cost, fi])
+    flow = 0; cost = 0
+    while flow < maxf:
+        dist = [INF]*n; prevv=[-1]*n; preve=[-1]*n
+        dist[s]=0
+        for _ in range(n):
+            upd=False
+            for u in range(n):
+                if dist[u]==INF: continue
+                for i,e in enumerate(g[u]):
+                    v,cap,cc,_=e
+                    if cap>0 and dist[u]+cc<dist[v]:
+                        dist[v]=dist[u]+cc; prevv[v]=u; preve[v]=i; upd=True
+            if not upd: break
+        if dist[t]==INF: break
+        addf=maxf-flow
+        v=t
+        while v!=s:
+            u=prevv[v]; e=g[u][preve[v]]; addf=min(addf,e[1]); v=u
+        v=t
+        while v!=s:
+            u=prevv[v]; ei=preve[v]; e=g[u][ei]
+            e[1]-=addf; g[v][e[3]][1]+=addf; cost+=addf*e[2]; v=u
+        flow+=addf
+    return flow, cost
+
+
+def test_single_path():
+    m = MinCostMaxFlow(4)
+    m.add_edge(0,1,2,3); m.add_edge(1,2,2,4); m.add_edge(2,3,2,1)
+    f,c = m.min_cost_flow(0,3,2)
+    assert (f,c)==(2, 2*(3+4+1)), (f,c)
+
+
+def test_two_parallel_paths():
+    m = MinCostMaxFlow(4)
+    m.add_edge(0,1,1,1); m.add_edge(1,3,1,1)
+    m.add_edge(0,2,1,5); m.add_edge(2,3,1,5)
+    f,c = m.min_cost_flow(0,3,2)
+    assert (f,c)==(2, (1+1)+(5+5)), (f,c)
+
+
+def test_negative_cost():
+    m = MinCostMaxFlow(3)
+    m.add_edge(0,1,1,5); m.add_edge(1,2,1,-3); m.add_edge(0,2,1,10)
+    f,c = m.min_cost_flow(0,2,1)
+    assert (f,c)==(1,2), (f,c)
+
+
+def test_random_vs_brute():
+    random.seed(42)
+    for trial in range(400):
+        n = random.randint(2,5)
+        s=0; t=n-1
+        edges=[]
+        for u in range(n):
+            for v in range(n):
+                if u==v: continue
+                if random.random()<0.4:
+                    edges.append((u,v,random.randint(0,3),random.randint(-3,5)))
+        maxf=random.randint(1,6)
+        m=MinCostMaxFlow(n)
+        for (u,v,cap,cost) in edges:
+            m.add_edge(u,v,cap,cost)
+        f1,c1=m.min_cost_flow(s,t,maxf)
+        f2,c2=brute_min_cost(n,edges,s,t,maxf)
+        assert (f1,c1)==(f2,c2), (trial,(f1,c1),(f2,c2))
+
+
+def test_maxflow_cap():
+    m=MinCostMaxFlow(2)
+    m.add_edge(0,1,5,2)
+    f,c=m.min_cost_flow(0,1,10)
+    assert (f,c)==(5,10)
+
+
+if __name__=="__main__":
+    test_single_path(); test_two_parallel_paths(); test_negative_cost()
+    test_random_vs_brute(); test_maxflow_cap()
+    print("ALL OK")

wizard-work/beam/test_mincost_maxflow_small.py

@@ -0,0 +1,10 @@
+import test_mincost_maxflow as t
+t.test_single_path()
+print("1")
+t.test_two_parallel_paths()
+print("2")
+t.test_negative_cost()
+print("3")
+t.test_maxflow_cap()
+print("4")
+print("SMALL OK")

wizard-work/beam/test_mod_inverse.py

@@ -0,0 +1,45 @@
+import random
+from mod_inverse import modinv
+
+def test_basic():
+    assert modinv(3, 11) == 4
+    assert modinv(10, 17) == 12
+    assert modinv(1, 5) == 1
+
+def test_none():
+    assert modinv(2, 4) is None
+    assert modinv(6, 9) is None
+    assert modinv(0, 5) is None
+
+def test_negative_a():
+    assert modinv(-1, 7) == 6
+    assert ( (-1)*modinv(-1,7) ) % 7 == 1 % 7
+
+def test_brute():
+    for m in range(2, 200):
+        for a in range(0, m):
+            x = modinv(a, m)
+            g = None
+            # compute gcd
+            import math
+            if math.gcd(a % m, m) != 1:
+                assert x is None, (a, m, x)
+            else:
+                assert x is not None and 0 <= x < m
+                assert (a * x) % m == 1
+
+def test_random_large():
+    random.seed(1)
+    for _ in range(2000):
+        m = random.randint(2, 10**6)
+        a = random.randint(0, m-1)
+        x = modinv(a, m)
+        import math
+        if math.gcd(a, m) != 1:
+            assert x is None
+        else:
+            assert x is not None and (a*x)%m == 1
+
+if __name__ == "__main__":
+    test_basic(); test_none(); test_negative_a(); test_brute(); test_random_large()
+    print("ALL PASS")

wizard-work/beam/test_oracle_dl.py

@@ -0,0 +1,91 @@
+"""Cells for oracle_dl.py (Q85): the independent oracle for damerau_levenshtein.
+
+`oracle_dl.py` is a CLI with the repo's 0/1/2 contract and no collected cell, so
+its two graded properties -- it agrees with the BFS oracle, and its corpus
+actually separates true Damerau-Levenshtein from OSA and from plain Levenshtein
+-- were only ever measured by hand.  The cells use `run(module, pairs, teeth)`
+with a short corpus so the lane stays fast; the corpus is asserted to be
+deterministic and large separately.
+
+Note measured while writing this, not repaired here (it is beam's file): the
+docstring advertises `--teeth`, but argparse has only `--no-teeth` -- teeth are
+the default -- so `python3 oracle_dl.py --teeth` exits 2 as an unrecognised
+argument.  These cells call `run()` directly and do not depend on the flag.
+"""
+import contextlib
+import io
+import os
+import types
+import unittest
+
+import damerau_levenshtein as DL
+import oracle_dl as O
+
+PAIRS = [("ca", "abc"), ("abc", "acb"), ("ab", "ba"), ("", ""),
+         ("aab", "abca"), ("abcd", "badc"), ("a", "b"), ("abcd", "dcba")]
+
+
+def _module(fn):
+    return types.SimpleNamespace(damerau_levenshtein=fn)
+
+
+class TestOracleDl(unittest.TestCase):
+    def _run(self, module, pairs=PAIRS, teeth=True):
+        out = io.StringIO()
+        with contextlib.redirect_stdout(out):
+            rc = O.run(module, pairs, teeth)
+        return rc, out.getvalue()
+
+    def test_the_shipped_module_agrees_with_the_oracle(self):
+        rc, out = self._run(_module(DL.damerau_levenshtein))
+        self.assertEqual(rc, 0, out)
+        self.assertIn("0 mismatches against the BFS oracle", out)
+
+    def test_the_corpus_catches_osa(self):
+        # The witness Q133-DL was written for: true DL("ca","abc") is 2, OSA
+        # says 3.  A corpus that cannot red an OSA implementation reports green
+        # on a broken module too.
+        rc, out = self._run(_module(O.osa))
+        self.assertEqual(rc, 1, out)
+        self.assertIn("FAIL", out)
+
+    def test_the_corpus_catches_plain_levenshtein(self):
+        rc, out = self._run(_module(O.levenshtein))
+        self.assertEqual(rc, 1, out)
+        self.assertIn("FAIL", out)
+
+    def test_teeth_off_still_grades_the_corpus(self):
+        rc, out = self._run(_module(DL.damerau_levenshtein), teeth=False)
+        self.assertEqual(rc, 0, out)
+        self.assertNotIn("teeth:", out)
+
+    def test_the_full_corpus_is_deterministic_and_large(self):
+        first = O.corpus()
+        self.assertEqual(first, O.corpus(), "the corpus must be the same on every run")
+        self.assertGreater(len(first), 1000)
+        for pair in first[:100]:
+            self.assertEqual(len(pair), 2)
+            self.assertTrue(all(isinstance(s, str) for s in pair), pair)
+
+    def test_a_missing_module_cannot_be_graded(self):
+        err = io.StringIO()
+        with contextlib.redirect_stderr(err), contextlib.redirect_stdout(io.StringIO()):
+            rc = O.main(["--module", os.path.join(os.sep, "nonexistent", "dl.py")])
+        self.assertEqual(rc, 2, err.getvalue())
+        self.assertIn("could not grade", err.getvalue())
+
+    def test_a_module_without_the_entry_point_cannot_be_graded(self):
+        import tempfile
+        with tempfile.TemporaryDirectory(prefix="oracle-dl.") as tmp:
+            path = os.path.join(tmp, "empty_module.py")
+            with open(path, "w", encoding="utf-8") as fh:
+                fh.write("value = 1\n")
+            err = io.StringIO()
+            with contextlib.redirect_stderr(err), contextlib.redirect_stdout(io.StringIO()):
+                rc = O.main(["--module", path])
+        self.assertEqual(rc, 2, err.getvalue())
+        self.assertIn("no damerau_levenshtein()", err.getvalue())
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_regex_match.py

@@ -0,0 +1,70 @@
+import itertools
+from regex_match import is_match, is_match_dp, match
+
+
+CASES = [
+    ("", "", True),
+    ("", "a*", True),
+    ("", ".", False),
+    ("a", "a", True),
+    ("a", ".", True),
+    ("ab", ".*", True),
+    ("aab", "c*a*b", True),
+    ("mississippi", "mis*is*p*.", False),
+    ("mississippi", "mis*is*ip*.", True),
+    ("aa", "a", False),
+    ("aa", "a*", True),
+    ("ab", ".*c", False),
+    ("aaa", "a*a", True),
+    ("aaa", "ab*a*c*a", True),
+    ("a", "ab*a", False),
+    ("", "a*b*c*", True),
+    ("abc", "a.c", True),
+    ("abc", "a..", True),
+    ("abcd", "d*", False),
+]
+
+
+def test_cases_recursive():
+    for s, p, exp in CASES:
+        assert is_match(s, p) is exp, (s, p, exp)
+
+
+def test_cases_dp():
+    for s, p, exp in CASES:
+        assert is_match_dp(s, p) is exp, (s, p, exp)
+
+
+def test_cross_check_random():
+    import random
+    rng = random.Random(42)
+    alphabet = "ab."
+    for _ in range(2000):
+        n = rng.randint(0, 6)
+        s = "".join(rng.choice("ab") for _ in range(n))
+        # build pattern with possible stars
+        m = rng.randint(0, 6)
+        toks = []
+        for _ in range(m):
+            c = rng.choice("ab.")
+            if rng.random() < 0.4:
+                toks.append(c + "*")
+            else:
+                toks.append(c)
+        p = "".join(toks)
+        r1 = is_match(s, p)
+        r2 = is_match_dp(s, p)
+        assert r1 == r2, (s, p, r1, r2)
+
+
+def test_type_errors():
+    for f in (is_match, is_match_dp):
+        try:
+            f(123, "a")
+            assert False
+        except TypeError:
+            pass
+
+
+def test_match_alias():
+    assert match("aa", "a*") is True

wizard-work/beam/test_sha256_manifest.py

@@ -1,6 +1,16 @@
 import hashlib, os, tempfile, unittest, subprocess, sys
 
-MOD = "/root/troupe-standup/wizard-work/beam/sha256_manifest.py"
+HERE = os.path.dirname(os.path.abspath(__file__))
+MOD = os.path.join(HERE, "sha256_manifest.py")
+
+# Binding (Q85, 2026-11-02).  This line read the host-absolute
+# "/root/troupe-standup/wizard-work/beam/sha256_manifest.py", so every cell
+# below graded the host's copy and the committed bytes were graded nowhere --
+# the same defect Q153 repaired in test_next_greater.py, and invisible to
+# check_bindings.py, which parses `sys.path` calls rather than path constants.
+# Resolve beside this file, and assert the resolution instead of trusting it.
+assert os.path.isfile(MOD), "no sha256_manifest.py beside the test: %s" % MOD
+assert os.path.realpath(os.path.dirname(MOD)) == os.path.realpath(HERE), MOD
 
 class T(unittest.TestCase):
     def make_tree(self):

wizard-work/beam/test_tarjan_articulation.py

@@ -0,0 +1,45 @@
+"""Tests for tarjan_articulation.articulation_points / bridges.
+
+Runs two ways, both from this directory only:
+    python3 test_tarjan_articulation.py
+    python3 -m unittest discover -p 'test_*.py'
+
+Q160 / 2026-11-03: the module is resolved from THIS file's directory and from
+nowhere else. The file landed with
+    sys.path.insert(0, '/root/.hermes/wizard-outputs/beam')
+which put a HOST directory first on sys.path, so all four cells below graded
+/root/.hermes/wizard-outputs/beam/tarjan_articulation.py and not the committed
+bytes. Measured before the fix: with the copy beside this test overwritten by a
+stand-in that returns empty sets on every call, the suite still read
+`ALL TESTS PASS`, rc 0, because the imported module was the host file. The
+assertion below is what makes the binding a fact rather than an intention (the
+rule test_toposort.py states at Q61 and test_lfu_cache.py at Q98).
+"""
+import pathlib
+import sys
+
+HERE = pathlib.Path(__file__).resolve().parent
+sys.path.insert(0, str(HERE))
+
+import tarjan_articulation as module_under_test
+from tarjan_articulation import articulation_points, bridges
+
+# The module under test must be the committed file next to this test.
+MODULE_PATH = pathlib.Path(module_under_test.__file__).resolve()
+assert MODULE_PATH == (HERE / "tarjan_articulation.py"), (MODULE_PATH, HERE)
+
+adj = {'1': ['2'], '2': ['1', '3'], '3': ['2', '4'], '4': ['3']}
+assert sorted(articulation_points(adj)) == ['2', '3'], articulation_points(adj)
+assert sorted(bridges(adj)) == [('1', '2'), ('2', '3'), ('3', '4')], bridges(adj)
+
+adj = {'a': ['b', 'c'], 'b': ['a', 'c'], 'c': ['a', 'b']}
+assert articulation_points(adj) == set(), articulation_points(adj)
+assert bridges(adj) == set(), bridges(adj)
+
+adj = {'1': ['2', '2'], '2': ['1', '1']}
+assert bridges(adj) == set(), bridges(adj)
+
+adj = {'c': ['a', 'b', 'd'], 'a': ['c'], 'b': ['c'], 'd': ['c']}
+assert articulation_points(adj) == {'c'}, articulation_points(adj)
+
+print("ALL TESTS PASS")

wizard-work/beam/test_tarjan_scc.py

@@ -0,0 +1,84 @@
+"""Cells for tarjan_scc.py (Q85 class): iterative Tarjan over int indices.
+
+The module landed with its proof in `__main__` only -- `self_test()` runs a
+brute-force cross-check and prints ALL TESTS PASSED -- so no collected cell
+read it and `check_coverage.py` graded it UNCOVERED (measured 2026-11-02, the
+module's own commit `7659e22`).  A proof that only runs when a human types the
+file's name is a transcript, not a gate.  These cells port the claim into the
+collected suite: deterministic graphs whose answers can be read by eye, the
+2000-graph brute-force cross-check at a fixed seed, the property that makes the
+output usable (components in reverse topological order), and the two edges the
+`while` loop exists to carry -- a self-loop and a duplicate edge.
+"""
+import random
+import unittest
+
+from tarjan_scc import brute_scc, normalize, tarjan_scc
+
+
+class TestTarjanSCC(unittest.TestCase):
+    def test_empty_and_singletons(self):
+        self.assertEqual(tarjan_scc(0, []), [])
+        self.assertEqual(normalize(tarjan_scc(1, [])), [[0]])
+        self.assertEqual(normalize(tarjan_scc(3, [])), [[0], [1], [2]])
+
+    def test_three_cycle_is_one_component(self):
+        cycles = tarjan_scc(3, [(0, 1), (1, 2), (2, 0)])
+        self.assertEqual(len(cycles), 1)
+        self.assertEqual(sorted(cycles[0]), [0, 1, 2])
+
+    def test_chain_has_no_component_larger_than_one(self):
+        comps = tarjan_scc(3, [(0, 1), (1, 2)])
+        self.assertEqual(normalize(comps), [[0], [1], [2]])
+
+    def test_self_loop_and_duplicate_edge(self):
+        # A self-loop must not fold the node into a neighbour, and a repeated
+        # edge must not push a node twice: the counter-based `while` pass reads
+        # each successor once per adjacency slot, so both are real cells.
+        self.assertEqual(normalize(tarjan_scc(1, [(0, 0)])), [[0]])
+        self.assertEqual(normalize(tarjan_scc(2, [(0, 1), (0, 1)])), [[0], [1]])
+
+    def test_two_components_one_edge(self):
+        # 0 -> 1, 2 -> 3 -> 2: two SCCs, one of size two.
+        comps = normalize(tarjan_scc(4, [(0, 1), (2, 3), (3, 2)]))
+        self.assertEqual(comps, [[0], [1], [2, 3]])
+
+    def test_reverse_topological_order(self):
+        # Tarjan emits a component only after every component it can reach, so
+        # for an edge u -> v crossing components, v's component comes out first.
+        # This is the property callers use to read a condensation order; it is
+        # asserted on random graphs, not just the hand-built one.
+        random.seed(7)
+        for _ in range(40):
+            n = random.randint(2, 9)
+            edges = [(random.randrange(n), random.randrange(n))
+                     for _ in range(random.randint(0, 2 * n))]
+            comps = tarjan_scc(n, edges)
+            where = {node: i for i, comp in enumerate(comps) for node in comp}
+            for u, v in edges:
+                if where[u] != where[v]:
+                    self.assertLess(where[v], where[u], (edges, comps))
+
+    def test_brute_force_cross_check(self):
+        # The module's own claim, moved inside the gate: 2000 random graphs at
+        # seed 42, compared as sets-of-sets against the O(n^3) reachability
+        # closure.  normalize() is the module's, so the comparison is its own
+        # notion of "same partition".
+        random.seed(42)
+        for _ in range(2000):
+            n = random.randint(1, 12)
+            m = random.randint(0, n * n)
+            edges = [(random.randrange(n), random.randrange(n)) for _ in range(m)]
+            self.assertEqual(normalize(tarjan_scc(n, edges)),
+                             normalize(brute_scc(n, edges)), (n, edges))
+
+    def test_only_referenced_nodes_beyond_n_are_not_touched(self):
+        # The signature takes n, so an edge into an index >= n is the caller's
+        # contract violation; the cells above stay inside [0, n).  This one pins
+        # that n=0 with no edges is empty rather than an IndexError on the
+        # `indices[start]` read -- the loop body never runs.
+        self.assertEqual(tarjan_scc(0, []), [])
+
+
+if __name__ == "__main__":
+    unittest.main(verbosity=2)

wizard-work/beam/test_toposort_kahn.py

@@ -0,0 +1,98 @@
+"""Cells for toposort_kahn.py (Q85): Kahn's algorithm, deterministic, cycles named.
+
+The module was exercised only by `CHECK_toposort.py`, a file the collector does
+not take (it is named `CHECK_*` and its cells are `def test_dag`-shaped with no
+runner), so the gate never ran it.  These cells port its three graphs and add
+the properties the docstring promises: deterministic tie-breaking by name, and
+a returned cycle whose consecutive pairs are real edges.
+"""
+import random
+import unittest
+
+from toposort_kahn import toposort
+
+
+class TestToposortKahn(unittest.TestCase):
+    def test_chain(self):
+        order, cycle = toposort({"a": ["b"], "b": ["c"], "c": []})
+        self.assertIsNone(cycle)
+        self.assertEqual(order, ["a", "b", "c"])
+
+    def test_diamond(self):
+        graph = {"a": ["b", "c"], "b": ["d"], "c": ["d"], "d": []}
+        order, cycle = toposort(graph)
+        self.assertIsNone(cycle)
+        self.assertEqual(sorted(order), ["a", "b", "c", "d"])
+        self.assertLess(order.index("a"), order.index("b"))
+        self.assertLess(order.index("a"), order.index("c"))
+        self.assertLess(order.index("b"), order.index("d"))
+        self.assertLess(order.index("c"), order.index("d"))
+
+    def test_empty_graph(self):
+        self.assertEqual(toposort({}), ([], None))
+
+    def test_ties_are_broken_by_name(self):
+        # Determinism is the docstring's claim, so the order is asserted, not
+        # just its validity: two roots come out in name order.
+        self.assertEqual(toposort({"b": [], "a": []})[0], ["a", "b"])
+        self.assertEqual(
+            toposort({"m": ["z"], "a": ["z"], "z": []})[0], ["a", "m", "z"])
+
+    def test_node_that_only_appears_as_a_successor(self):
+        order, cycle = toposort({"a": ["b"]})
+        self.assertEqual((order, cycle), (["a", "b"], None))
+
+    def test_two_cycle_is_reported_as_a_cycle(self):
+        graph = {"a": ["b"], "b": ["a"]}
+        order, cycle = toposort(graph)
+        self.assertIsNotNone(cycle)
+        self.assertGreaterEqual(len(cycle), 2)
+        self.assertEqual(cycle[0], cycle[-1], "a cycle list starts and ends at one node")
+        for left, right in zip(cycle, cycle[1:]):
+            self.assertIn(right, graph.get(left, []), "%s -> %s is not an edge" % (left, right))
+
+    def test_self_loop_is_a_cycle(self):
+        order, cycle = toposort({"a": ["a"]})
+        self.assertEqual(cycle, ["a", "a"])
+
+    def test_three_cycle_reports_the_loop(self):
+        graph = {"a": ["b"], "b": ["c"], "c": ["a"]}
+        order, cycle = toposort(graph)
+        self.assertIsNotNone(cycle)
+        self.assertEqual(cycle[0], cycle[-1])
+        self.assertEqual(set(cycle), {"a", "b", "c"})
+
+    def test_random_dags_are_orders(self):
+        rng = random.Random(42)
+        for _ in range(300):
+            n = rng.randint(0, 8)
+            names = ["n%d" % i for i in range(n)]
+            graph = {name: [] for name in names}
+            for i in range(n):
+                for j in range(i + 1, n):
+                    if rng.random() < 0.3:
+                        graph[names[i]].append(names[j])
+            order, cycle = toposort(graph)
+            self.assertIsNone(cycle, graph)
+            self.assertEqual(sorted(order), sorted(names), graph)
+            position = {name: i for i, name in enumerate(order)}
+            for src, succs in graph.items():
+                for dst in succs:
+                    self.assertLess(position[src], position[dst], (src, dst, order))
+
+    def test_a_dag_with_a_cycle_after_pruning_still_reports_it(self):
+        # Kahn's frontier empties even though only part of the graph is blocked.
+        graph = {"a": ["b"], "b": [], "c": ["d"], "d": ["c"]}
+        order, cycle = toposort(graph)
+        self.assertEqual(order, ["a", "b"])
+        self.assertEqual(set(cycle), {"c", "d"})
+
+    def test_input_graph_is_not_mutated(self):
+        graph = {"a": ["b"], "b": []}
+        snapshot = {k: list(v) for k, v in graph.items()}
+        toposort(graph)
+        self.assertEqual({k: list(v) for k, v in graph.items()}, snapshot)
+
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_trapping_rain_water.py

@@ -0,0 +1,40 @@
+import unittest
+from trapping_rain_water import trap, trap_prefix
+
+class TestTrap(unittest.TestCase):
+    def test_empty(self):
+        self.assertEqual(trap([]), 0)
+        self.assertEqual(trap_prefix([]), 0)
+
+    def test_single(self):
+        self.assertEqual(trap([5]), 0)
+
+    def test_flat(self):
+        self.assertEqual(trap([2, 2, 2, 2]), 0)
+
+    def test_classic(self):
+        self.assertEqual(trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]), 6)
+
+    def test_ascending(self):
+        self.assertEqual(trap([1, 2, 3, 4]), 0)
+
+    def test_descending(self):
+        self.assertEqual(trap([4, 3, 2, 1]), 0)
+
+    def test_two_peaks(self):
+        self.assertEqual(trap([3, 0, 2, 0, 4]), 7)
+
+    def test_agreement_random(self):
+        import random
+        rng = random.Random(42)
+        for _ in range(2000):
+            n = rng.randint(0, 40)
+            hs = [rng.randint(0, 9) for _ in range(n)]
+            self.assertEqual(trap(hs), trap_prefix(hs))
+
+    def test_large(self):
+        hs = [10**6] + [0] * 100000 + [10**6]
+        self.assertEqual(trap(hs), 10**6 * 100000)
+
+if __name__ == "__main__":
+    unittest.main()

wizard-work/beam/test_ttl_lru_cache.py

@@ -0,0 +1,93 @@
+import time
+import pytest
+
+from ttl_lru_cache import TTLCache, CacheMiss
+
+
+def test_basic_get_set():
+    c = TTLCache(2)
+    c.set("a", 1)
+    c.set("b", 2)
+    assert c.get("a") == 1
+    assert c.get("z", 9) == 9
+    assert "a" in c
+
+
+def test_lru_eviction():
+    c = TTLCache(2)
+    c.set("a", 1)
+    c.set("b", 2)
+    c.get("a")  # make a recently used
+    c.set("c", 3)
+    assert "b" not in c
+    assert c.get("a") == 1
+    assert c.get("c") == 3
+
+
+def test_ttl_expiry():
+    clock = [0.0]
+    c = TTLCache(10, default_ttl=5, clock=lambda: clock[0])
+    c.set("a", 1)
+    assert c.get("a") == 1
+    clock[0] = 6
+    assert c.get("a") is None
+    assert "a" not in c
+    assert len(c) == 0
+
+
+def test_per_entry_ttl_override():
+    clock = [0.0]
+    c = TTLCache(10, default_ttl=100, clock=lambda: clock[0])
+    c.set("short", 1, ttl=2)
+    c.set("long", 2)
+    clock[0] = 3
+    assert "short" not in c
+    assert c.get("long") == 2
+
+
+def test_peek_does_not_update_recency():
+    c = TTLCache(2)
+    c.set("a", 1)
+    c.set("b", 2)
+    c.peek("a")
+    c.set("c", 3)
+    # a was not touched via get, so it should be evicted (b was more recent? actually b inserted last)
+    # After set a,b: order a,b. peek a no change. set c evicts LRU = a.
+    assert "a" not in c
+
+
+def test_get_strict_raises():
+    c = TTLCache(2)
+    with pytest.raises(CacheMiss):
+        c.get_strict("nope")
+
+
+def test_invalid_args():
+    with pytest.raises(ValueError):
+        TTLCache(0)
+    with pytest.raises(ValueError):
+        TTLCache(2, default_ttl=0)
+    c = TTLCache(2)
+    with pytest.raises(ValueError):
+        c.set("x", 1, ttl=0)
+
+
+def test_delete_and_clear():
+    c = TTLCache(2)
+    c.set("a", 1)
+    assert c.delete("a") is True
+    assert c.delete("a") is False
+    c.set("b", 2)
+    c.clear()
+    assert len(c) == 0
+
+
+def test_capacity_eviction_with_expired():
+    clock = [0.0]
+    c = TTLCache(2, clock=lambda: clock[0])
+    c.set("a", 1, ttl=1)
+    c.set("b", 2, ttl=1)
+    clock[0] = 2  # both expired
+    c.set("c", 3)  # should not count expired toward capacity
+    assert len(c) == 1
+    assert c.get("c") == 3

wizard-work/beam/token_bucket.py

@@ -14,18 +14,16 @@ from typing import Optional
 
 
 class TokenBucket:
-    def __init__(self, rate: float, capacity: float):
+    def __init__(self, rate: float, capacity: float, clock=None):
         if rate <= 0:
             raise ValueError("rate must be > 0")
         if capacity <= 0:
             raise ValueError("capacity must be > 0")
-        if rate > capacity:
-            # allow; but typically rate <= capacity. No restriction.
-            pass
         self._rate = float(rate)
         self._capacity = float(capacity)
+        self._clock = clock if clock is not None else time.monotonic
         self._tokens = float(capacity)
-        self._last = time.monotonic()
+        self._last = self._clock()
         self._lock = threading.Lock()
         self._cond = threading.Condition(self._lock)
 
@@ -46,7 +44,7 @@ class TokenBucket:
 
     def tokens(self) -> float:
         with self._lock:
-            self._refill(time.monotonic())
+            self._refill(self._clock())
             return self._tokens
 
     def try_acquire(self, n: float = 1.0) -> bool:
@@ -55,7 +53,7 @@ class TokenBucket:
         if n > self._capacity:
             raise ValueError("n exceeds capacity")
         with self._lock:
-            now = time.monotonic()
+            now = self._clock()
             self._refill(now)
             if self._tokens >= n - 1e-12:
                 self._tokens -= n
@@ -67,10 +65,10 @@ class TokenBucket:
             raise ValueError("n must be > 0")
         if n > self._capacity:
             raise ValueError("n exceeds capacity")
-        deadline = None if timeout is None else time.monotonic() + timeout
+        deadline = None if timeout is None else self._clock() + timeout
         with self._lock:
             while True:
-                now = time.monotonic()
+                now = self._clock()
                 self._refill(now)
                 if self._tokens >= n - 1e-12:
                     self._tokens -= n
@@ -99,5 +97,5 @@ class TokenBucket:
     def reset(self, tokens: Optional[float] = None) -> None:
         with self._lock:
             self._tokens = self._capacity if tokens is None else float(tokens)
-            self._last = time.monotonic()
+            self._last = self._clock()
             self._cond.notify_all()

wizard-work/beam/trapping_rain_water.py

@@ -0,0 +1,59 @@
+"""Trapping rain water on an elevation map.
+
+Given heights[i] = elevation at bar i, compute total water trapped
+after raining. Water trapped at i = max(0, min(max_left, max_right) - height[i]).
+
+Two implementations: O(n) two-pointer (trap) and O(n) prefix arrays (trap_prefix).
+Both agree; trap is the production path.
+"""
+from typing import Sequence
+
+def trap(heights: Sequence[int]) -> int:
+    if not heights:
+        return 0
+    left, right = 0, len(heights) - 1
+    left_max, right_max = 0, 0
+    water = 0
+    while left < right:
+        if heights[left] < heights[right]:
+            if heights[left] >= left_max:
+                left_max = heights[left]
+            else:
+                water += left_max - heights[left]
+            left += 1
+        else:
+            if heights[right] >= right_max:
+                right_max = heights[right]
+            else:
+                water += right_max - heights[right]
+            right -= 1
+    return water
+
+def trap_prefix(heights: Sequence[int]) -> int:
+    n = len(heights)
+    if n == 0:
+        return 0
+    left_max = [0] * n
+    right_max = [0] * n
+    cur = 0
+    for i in range(n):
+        if heights[i] > cur:
+            cur = heights[i]
+        left_max[i] = cur
+    cur = 0
+    for i in range(n - 1, -1, -1):
+        if heights[i] > cur:
+            cur = heights[i]
+        right_max[i] = cur
+    return sum(max(0, min(left_max[i], right_max[i]) - heights[i]) for i in range(n))
+
+def main():
+    import sys
+    if len(sys.argv) < 2:
+        print("usage: trapping_rain_water.py h1 h2 ..."); return 2
+    hs = [int(x) for x in sys.argv[1:]]
+    print(trap(hs))
+    return 0
+
+if __name__ == "__main__":
+    raise SystemExit(main())

wizard-work/beam/ttl_lru_cache.py

@@ -0,0 +1,141 @@
+"""TTL-aware LRU cache.
+
+A small, dependency-free, thread-safe-ish (single-threaded design) cache
+combining least-recently-used eviction with per-entry time-to-live expiry.
+
+Design notes:
+- Ordering is tracked with an OrderedDict (move_to_end on access).
+- Expiry is checked lazily on get/peek; expired entries are dropped on access.
+- Capacity counts only live (non-expired) entries at insertion time; expired
+  entries are purged opportunistically when capacity is exceeded.
+- A monotonic clock (time.monotonic) is used so wall-clock jumps don't break TTL.
+"""
+
+from __future__ import annotations
+
+import time
+from collections import OrderedDict
+from dataclasses import dataclass
+from typing import Any, Callable, Generic, Optional, TypeVar
+
+K = TypeVar("K")
+V = TypeVar("V")
+
+
+class CacheMiss(KeyError):
+    """Raised by get_strict when a key is absent or expired."""
+
+
+@dataclass
+class _Entry(Generic[V]):
+    value: V
+    expires_at: float  # monotonic seconds; inf means no expiry
+
+
+class TTLCache(Generic[K, V]):
+    def __init__(
+        self,
+        capacity: int,
+        default_ttl: Optional[float] = None,
+        clock: Callable[[], float] = time.monotonic,
+    ) -> None:
+        if capacity <= 0:
+            raise ValueError("capacity must be positive")
+        if default_ttl is not None and default_ttl <= 0:
+            raise ValueError("default_ttl must be positive or None")
+        self._capacity = capacity
+        self._default_ttl = default_ttl
+        self._clock = clock
+        self._data: "OrderedDict[K, _Entry[V]]" = OrderedDict()
+
+    # -- internals ---------------------------------------------------------
+
+    def _now(self) -> float:
+        return self._clock()
+
+    def _purge_expired(self) -> None:
+        # Drop expired entries from the front/back opportunistically.
+        now = self._now()
+        dead = [k for k, e in self._data.items() if e.expires_at <= now]
+        for k in dead:
+            del self._data[k]
+
+    def _ttl_to_deadline(self, ttl: Optional[float]) -> float:
+        if ttl is None:
+            ttl = self._default_ttl
+        if ttl is None:
+            return float("inf")
+        if ttl <= 0:
+            raise ValueError("ttl must be positive")
+        return self._now() + ttl
+
+    # -- public API --------------------------------------------------------
+
+    def __len__(self) -> int:
+        self._purge_expired()
+        return len(self._data)
+
+    def __contains__(self, key: K) -> bool:
+        entry = self._data.get(key)
+        if entry is None:
+            return False
+        if entry.expires_at <= self._now():
+            del self._data[key]
+            return False
+        return True
+
+    def get(self, key: K, default: Any = None) -> Any:
+        entry = self._data.get(key)
+        if entry is None:
+            return default
+        if entry.expires_at <= self._now():
+            del self._data[key]
+            return default
+        self._data.move_to_end(key)
+        return entry.value
+
+    def get_strict(self, key: K) -> V:
+        v = self.get(key, _MISSING)
+        if v is _MISSING:
+            raise CacheMiss(key)
+        return v  # type: ignore[return-value]
+
+    def set(self, key: K, value: V, ttl: Optional[float] = None) -> None:
+        deadline = self._ttl_to_deadline(ttl)
+        if key in self._data:
+            del self._data[key]
+        self._data[key] = _Entry(value=value, expires_at=deadline)
+        self._data.move_to_end(key)
+        self._evict_if_needed()
+
+    def _evict_if_needed(self) -> None:
+        self._purge_expired()
+        while len(self._data) > self._capacity:
+            self._data.popitem(last=False)
+
+    def delete(self, key: K) -> bool:
+        if key in self._data:
+            del self._data[key]
+            return True
+        return False
+
+    def clear(self) -> None:
+        self._data.clear()
+
+    def keys(self):
+        self._purge_expired()
+        return list(self._data.keys())
+
+    def items(self):
+        self._purge_expired()
+        return [(k, e.value) for k, e in self._data.items()]
+
+    def peek(self, key: K, default: Any = None) -> Any:
+        """Return value without updating recency or triggering purge of others."""
+        entry = self._data.get(key)
+        if entry is None or entry.expires_at <= self._now():
+            return default
+        return entry.value
+
+
+_MISSING = object()

wizard-work/cassian/q75_roundtrip.py

@@ -0,0 +1,128 @@
+#!/usr/bin/env python3
+"""q75_roundtrip.py -- read-only round-trip grade of ledger's two wizard-work census TSVs (Q75).
+
+Q75 (WORK-QUEUE.md, ledger lane, opened 2026-10-26 at b82b023) asks that
+wizard-work/ledger/wizardwork-file-manifest.tsv and wizardwork-census.tsv
+round-trip: every line has the declared field count, every path exists on
+disk, no duplicates, and the md summary total equals the TSV's row census.
+This file grades exactly those four rules and edits nothing. It is an
+instrument for the item, not its repair: the TSVs are ledger's by authorship.
+
+Faults (each printed as `FAULT <CLASS> <file>:<line> <detail>`):
+  FIELDS  a line whose tab-split field count is not 4
+  ABSENT  a 4-field row whose path (relative to wizard-work/) is not on disk
+  DUP     a path listed on more than one 4-field row
+  TOTAL   the md's `Totals: ... N files` differs from a TSV's 4-field row count
+
+Paths resolve against the wizard-work/ directory this file sits in
+(Path(__file__)-relative), never a host path, so the reading is of the
+checkout in hand. Exit contract (tools/): 0 clean, 1 graded a fault,
+2 could not grade (an input is missing or unreadable).
+
+  python3 wizard-work/cassian/q75_roundtrip.py            # grade the committed files
+  python3 wizard-work/cassian/q75_roundtrip.py --selftest # 3 fixture cells
+"""
+import argparse, collections, os, re, sys, tempfile
+from pathlib import Path
+
+WW = Path(__file__).resolve().parent.parent
+LEDGER = WW / "ledger"
+TSVS = ("wizardwork-file-manifest.tsv", "wizardwork-census.tsv")
+MD = "wizardwork-census.md"
+TOTAL_RE = re.compile(r"^Totals:.*?(\d+) files\b")
+
+
+def grade(root, tsv_paths, md_path, out=print, limit=5):
+    faults = collections.Counter()
+    shown = collections.Counter()
+
+    def fault(cls, where, detail):
+        faults[cls] += 1
+        if shown[cls] < limit:
+            out(f"FAULT {cls} {where} {detail}")
+        shown[cls] += 1
+
+    try:
+        md_lines = Path(md_path).read_text(encoding="utf-8").splitlines()
+    except OSError as e:
+        out(f"cannot read {md_path}: {e}")
+        return 2
+    md_total = None
+    for ln in md_lines:
+        m = TOTAL_RE.match(ln)
+        if m:
+            md_total = int(m.group(1))
+    if md_total is None:
+        out(f"cannot grade: no `Totals: ... N files` line in {md_path}")
+        return 2
+    for tp in tsv_paths:
+        try:
+            lines = Path(tp).read_text(encoding="utf-8").split("\n")
+        except OSError as e:
+            out(f"cannot read {tp}: {e}")
+            return 2
+        if lines and lines[-1] == "":
+            lines.pop()
+        name = Path(tp).name
+        rows, seen = 0, collections.Counter()
+        for i, ln in enumerate(lines, 1):
+            f = ln.split("\t")
+            if len(f) != 4:
+                fault("FIELDS", f"{name}:{i}", f"{len(f)} field(s): {ln[:60]!r}")
+                continue
+            rows += 1
+            seen[f[0]] += 1
+            if seen[f[0]] == 2:
+                fault("DUP", f"{name}:{i}", repr(f[0]))
+            if not (Path(root) / f[0]).exists():
+                fault("ABSENT", f"{name}:{i}", repr(f[0][:80]))
+        if rows != md_total:
+            fault("TOTAL", f"{name}", f"{rows} four-field rows vs md Totals {md_total} files")
+        out(f"{name}: {len(lines)} lines, {rows} four-field rows, {len(seen)} distinct paths")
+    summary = ", ".join(f"{k} {v}" for k, v in sorted(faults.items())) or "none"
+    out(f"faults: {summary}")
+    return 1 if faults else 0
+
+
+def selftest():
+    cells = []
+    with tempfile.TemporaryDirectory() as d:
+        d = Path(d)
+        for p in ("a/x.py", "a/y.txt", "b/CHECK"):
+            (d / p).parent.mkdir(parents=True, exist_ok=True)
+            (d / p).write_text("x\n")
+        clean = "a/x.py\t2\tx.py\ta\na/y.txt\t2\ty.txt\ta\nb/CHECK\t2\tCHECK\tb\n"
+        md = d / "c.md"
+        md.write_text("Totals: 2 top-level directories, 3 files (1 script).\n")
+        t = d / "t.tsv"
+        quiet = lambda s: None
+        t.write_text(clean)
+        cells.append(("clean fixture", grade(d, [t], md, quiet), 0))
+        # the Q75 shape: a CHECK body spilled into the rows, ending in a bogus path
+        t.write_text(clean.replace("b/CHECK\t2\tCHECK\tb\n",
+                     "b/CHECK\n#!/bin/bash\nset -e\npython3 b/test_x.py\t2\ttest_x.py\tb\n"))
+        cells.append(("injected CHECK body (FIELDS+ABSENT+TOTAL)", grade(d, [t], md, quiet), 1))
+        t.write_text("\n".join(clean.split("\n")[1:]))
+        cells.append(("deleted row (TOTAL)", grade(d, [t], md, quiet), 1))
+        cells.append(("missing md (could not grade)", grade(d, [t], d / "nope.md", quiet), 2))
+    bad = 0
+    for name, got, want in cells:
+        ok = got == want
+        bad += not ok
+        print(f"{'PASS' if ok else 'FAIL'} cell: {name}: rc {got} (want {want})")
+    print(f"selftest: {len(cells)} cells, {len(cells) - bad} passed, {bad} failed")
+    return 1 if bad else 0
+
+
+def main():
+    ap = argparse.ArgumentParser(description=__doc__.split("\n")[0])
+    ap.add_argument("--selftest", action="store_true")
+    ap.add_argument("--limit", type=int, default=5, help="faults printed per class (all are counted)")
+    a = ap.parse_args()
+    if a.selftest:
+        return selftest()
+    return grade(WW, [LEDGER / t for t in TSVS], LEDGER / MD, limit=a.limit)
+
+
+if __name__ == "__main__":
+    sys.exit(main())

wizard-work/cassian/q84_mutants.py

@@ -0,0 +1,46 @@
+#!/usr/bin/env python3
+"""q84_mutants.py -- re-grade Q84's cells (wizard-work/beam/test_interval_overlap.py) against
+five named mutants of interval_overlap.py, plus an independent oracle (integer-set
+intersection, not the module's own brute_force_pairs). Read-only: each mutant runs in a
+fresh temp dir; nothing in the tree is edited. Default subject is the beam lane beside
+this file (Path(__file__)-relative); pass another beam dir as argv[1].
+
+  python3 wizard-work/cassian/q84_mutants.py
+"""
+import itertools, os, shutil, subprocess, sys, tempfile
+SRC = sys.argv[1] if len(sys.argv) > 1 else os.path.join(os.path.dirname(os.path.dirname(os.path.abspath(__file__))), "beam")
+orig = open(os.path.join(SRC, "interval_overlap.py")).read()
+MUT = {
+ "M1 kind ordering flipped": ("events.sort(key=lambda x: (x[0], x[1]))", "events.sort(key=lambda x: (x[0], -x[1]))"),
+ "M2 s>=e skip removed (pairs)": ("            if s >= e:  # zero-length interval: empty set, never overlaps\n                continue\n            for other", "            for other"),
+ "M3 start-pair loop removed": ("            for other in active:\n                a, b = (idx, other) if idx < other else (other, idx)\n                pairs.add((a, b))\n", ""),
+ "M4 has_any_overlap -> pair-list body": ("    iv = list(intervals)\n    for s, e in iv:\n        if e < s:\n            raise ValueError(f\"end < start: {(s, e)}\")\n    # Sorted", "    return bool(find_overlapping_pairs(intervals))\n    iv = []\n    # Sorted"),
+ "M5 boundary s<max_end -> s<=max_end": ("s < max_end:", "s <= max_end:"),
+}
+survivors = []
+for name, (a, b) in MUT.items():
+    assert orig.count(a) == 1, (name, orig.count(a))
+    d = tempfile.mkdtemp()
+    shutil.copy(os.path.join(SRC, "test_interval_overlap.py"), d)
+    open(os.path.join(d, "interval_overlap.py"), "w").write(orig.replace(a, b))
+    r = subprocess.run([sys.executable, "-m", "unittest", "test_interval_overlap"], cwd=d, capture_output=True, text=True, timeout=600)
+    dead = sorted({l.split()[1] for l in r.stderr.splitlines() if l.startswith(("FAIL:", "ERROR:"))})
+    print(f"{name}: rc {r.returncode}, dead {len(dead)}: {', '.join(dead)}")
+    if r.returncode == 0:
+        survivors.append(name)
+# independent oracle, not the module's brute_force_pairs
+sys.path.insert(0, SRC)
+import interval_overlap as m
+pts = range(-2, 4); ivs = [(s, e) for s in pts for e in pts if e >= s]
+n = mism = 0
+for k in range(0, 4):
+    for combo in itertools.product(ivs, repeat=k):
+        truth = sorted((i, j) for i in range(k) for j in range(i+1, k)
+                       if set(range(combo[i][0], combo[i][1])) & set(range(combo[j][0], combo[j][1])))
+        n += 1
+        if m.find_overlapping_pairs(combo) != truth or m.has_any_overlap(combo) != bool(truth):
+            mism += 1
+print(f"oracle (integer-set intersection, ordered tuples over [-2,3], size 0-3): {n} cases, {mism} mismatches")
+
+print(f"mutants: {len(MUT)}, survived {len(survivors)}: {survivors}")
+sys.exit(0 if mism == 0 and not survivors else 1)

wizard-work/forge/verify_check_lint_classes_dry.py

@@ -12,7 +12,7 @@ tally DRY refactor in tools/check_lint.py (forge lane: Refactor).
 The tally feeds ONLY summary["classes"], which is consumed by (a) the SUMMARY
 print() -- `for k,v in summary.items(): print(f"  {k}: {v}")` -- whose repr of
 `classes` is the output surface, and (b) the --json payload. The selftest
-(37 cells) exercises classify()/extract_check() only, NOT the tally, so selftest
+exercises classify()/extract_check() only, NOT the tally, so fixture-level
 parity is a guard but not the proof; legs [5] and [6] pin the tally itself.
 
 Behavior-preservation rests on: Counter reads a missing key as 0, so
@@ -20,10 +20,30 @@ Behavior-preservation rests on: Counter reads a missing key as 0, so
 as the hand-rolled loop; and re-assigning the EXISTING "classes" key keeps its
 position in `summary` (CPython 3.7+), so the SUMMARY line order is unchanged.
 
+WHY [2]/[3] DO NOT PIN A CELL COUNT (measured 2026-11-02, volt)
+  Until 2026-11-02 legs [2] and [3] asserted the literal line `selftest: 37
+  cells, 37 passed, 0 failed` and byte-identity of the two selftest outputs.
+  That made this verifier a vote on check_lint.py's FIXTURE LIST, which is not
+  the refactor's subject: check_lint.py grew to 42 cells, and this file read
+  `11 checks, 9 passed, 2 failed`, rc 1, `VERDICT: MISMATCH` -- on a tree where
+  the refactor it grades was untouched and the tally was provably identical
+  (legs [5]/[6] passed throughout). A guard that reddens when its subject
+  gains a test is measuring the wrong thing.
+  What replaces it is still a real guard: every (fixture, verdict) pair the
+  pinned build graded must still be graded the same way somewhere in the
+  working tree (`--selftest --verbose`: class-or-`extract`, fixture text). The
+  cell INDEX is dropped from the comparison, because the 2026-11-01 parenthetical
+  fix inserted cells MID-LIST -- the pinned build's cell 29 is the tree's
+  cell 34 -- so a prefix test reds on a correct tree. Additions are tolerated
+  and counted; a reclassified fixture, a deleted fixture or a rewritten fixture
+  is not, because that is a change of behaviour on an input the pinned build
+  already graded.
+
 LEGS (exit 0 iff all pass, else 1):
-  [1] selftest: original (pinned 4f76eaa^) 37/37 rc 0
-  [2] selftest: refactored (working tree) 37/37 rc 0
-  [3] selftest: stdout BYTE-IDENTICAL (original == refactored)
+  [1] selftest: original (pinned 4f76eaa^) -- summary parses, 0 failed, 37 cells
+  [2] selftest: refactored (working tree) -- summary parses, 0 failed, >= 37
+  [3] fixture-level parity: the pinned build's (fixture, verdict) pairs all
+      survive in the tree; the count is printed, never pinned
   [4] code-level: original HAS the tally line & no Counter import/expr;
       refactored HAS Counter import + Counter expr and NO tally line
   [5] report() stdout BYTE-IDENTICAL on a synthetic fixture (quiet=False),
@@ -31,19 +51,32 @@ LEGS (exit 0 iff all pass, else 1):
   [6] report() --json payload BYTE-IDENTICAL on the same fixture
       (generated_utc excluded: it is a wall-clock stamp, by design)
   [7] non-vacuity: the fixture tallied >1 distinct class with nonzero counts
+
+  --repo DIR grades a copy of the tree (used to prove [3] can fail: a mutated
+  copy must red it); it defaults to /root/troupe-standup.
 """
 import io
 import json
 import os
+import re
 import subprocess
 import sys
 import tempfile
+import argparse
 import importlib.util
 from collections import Counter
 
-REPO = "/root/troupe-standup"
+# Derived from this file, never written down: a module-level absolute root is a
+# host pin, and a verifier that only grades `/root/troupe-standup` grades this
+# machine from any checkout (the Q133/Q136/Q153 class). `--repo` still overrides.
+REPO = os.path.dirname(os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
 TOOL = "tools/check_lint.py"
-SUMMARY = "selftest: 37 cells, 37 passed, 0 failed"
+# The pinned blob's own cell count (a fact of those bytes, not of the refactor);
+# the working tree is required to be a SUPERSET of it, never equal to it.
+ORIG_CELLS = 37
+SUMMARY_RE = re.compile(r"^selftest: (\d+) cells, (\d+) passed, (\d+) failed$",
+                        re.MULTILINE)
+CELL_RE = re.compile(r"^  cell (\d+): (.*)$")
 TALLY = 'summary["classes"][g["class"]] = summary["classes"].get(g["class"], 0) + 1'
 IMP = "from collections import Counter"
 EXPR = 'dict(Counter(g["class"] for g in graded))'
@@ -98,17 +131,74 @@ def _write_tmp(src):
     return path
 
 
-def run_selftest(src):
+def run_selftest(src, verbose=False):
     """Run <src> --selftest as a subprocess; return (rc, stdout)."""
     path = _write_tmp(src)
     try:
-        p = subprocess.run([sys.executable, path, "--selftest"],
-                           capture_output=True, text=True, timeout=120)
+        argv = [sys.executable, path, "--selftest"]
+        if verbose:
+            argv.append("--verbose")
+        p = subprocess.run(argv, capture_output=True, text=True, timeout=120)
         return p.returncode, p.stdout
     finally:
         os.unlink(path)
 
 
+def summary_counts(out):
+    """-> (cells, passed, failed) from the tool's own summary line, or None.
+
+    The count is READ, never pinned: pinning it made this verifier a vote on
+    check_lint.py's fixture list rather than on the refactor (see docstring).
+    """
+    m = SUMMARY_RE.search(out)
+    if not m:
+        return None
+    return tuple(int(g) for g in m.groups())
+
+
+def cell_table(out):
+    """-> [(index, class-or-'extract', fixture repr)] from `--selftest --verbose`.
+
+    The two cell kinds print as `  cell N: <CLASS:11s> <repr>` and
+    `  cell N: extract   <repr>`, so the first whitespace-delimited word after
+    the colon is the class (or the literal `extract`) and the rest is the
+    fixture's repr -- which is what makes a per-index comparison meaningful.
+    """
+    rows = []
+    for line in out.splitlines():
+        m = CELL_RE.match(line)
+        if not m:
+            continue
+        idx = int(m.group(1))
+        parts = m.group(2).split(None, 1)
+        kind = parts[0] if parts else ""
+        body = parts[1] if len(parts) > 1 else ""
+        rows.append((idx, kind, body))
+    return rows
+
+
+def pair_delta(orig_rows, ref_rows):
+    """-> (missing_pairs, extra_pairs) between the pinned and working cell tables.
+
+    A row is (index, kind, body) where `kind` is the class the fixture graded to
+    (or the literal `extract`) and `body` is the fixture's own repr. The index is
+    DROPPED before comparing: on 2026-11-01 the parenthetical-prose fix inserted
+    cells MID-LIST (the pinned build's cell 29 `python3 x.py --json /tmp/o.json`
+    is the tree's cell 34), so position is not an invariant of this fixture list
+    and a prefix test reds on a correct tree.
+
+    What must hold is narrower and stronger: every (fixture, verdict) pair the
+    pinned build graded is still graded the same way somewhere in the tree.
+    Additions are allowed and reported; a reclassification, a lost fixture or a
+    rewritten fixture shows up in `missing_pairs`.
+    """
+    want = Counter((body, kind) for _idx, kind, body in orig_rows)
+    have = Counter((body, kind) for _idx, kind, body in ref_rows)
+    missing = sorted((want - have).elements())
+    extra = sorted((have - want).elements())
+    return missing, extra
+
+
 def load_module(src, name):
     """Exec <src> as module <name> (__name__ != "__main__" so no run() side effects)."""
     path = _write_tmp(src)
@@ -161,7 +251,16 @@ def build_fixture():
 
 
 def report_stdout(mod, runs):
-    """All of report()'s stdout (quiet=False) -- faults print to stdout too."""
+    """report()'s stdout (quiet=False) from the first RUN block onward.
+
+    The rules PRELUDE is deliberately excluded. report() prints the rubric
+    (`print_rules()`) before the table, so a full-stdout comparison made this
+    leg a vote on the rubric's TEXT: adding the LABEL_PREFIX class on 2026-11-02
+    grew the prelude by one line and reddened [5] while the tally under test was
+    byte-identical (measured: len 2707 vs 2770 = the new rule line). The leg's
+    subject is the graded rows and the `classes: {...}` repr; a new class name in
+    the help text is a description of the rubric, not a change of behaviour.
+    """
     buf = io.StringIO()
     old = sys.stdout
     sys.stdout = buf
@@ -169,7 +268,9 @@ def report_stdout(mod, runs):
         rc = mod.report(list(runs), as_json=None, quiet=False, unlogged=2)
     finally:
         sys.stdout = old
-    return rc, buf.getvalue()
+    text = buf.getvalue()
+    cut = text.find("\nRUN ")
+    return rc, (text[cut + 1:] if cut >= 0 else text)
 
 
 def report_json(mod, runs):
@@ -200,7 +301,19 @@ def has_stmt(text, needle):
     return False
 
 
-def main():
+def main(argv=None):
+    global REPO
+    ap = argparse.ArgumentParser(
+        description="Equivalence proof for the report() tally refactor in "
+                    "tools/check_lint.py. Read-only.")
+    ap.add_argument("--repo", default=REPO,
+                    help="tree to grade (default: the host checkout); a copy "
+                         "with a mutated check_lint.py must red leg [3]")
+    a = ap.parse_args(argv)
+    REPO = os.path.abspath(a.repo)
+    if not os.path.isfile(os.path.join(REPO, TOOL)):
+        print("VERDICT: MISMATCH -- no such tool: %s" % os.path.join(REPO, TOOL))
+        return 1
     cells, failed = [], []
 
     def check(label, ok, detail=""):
@@ -217,15 +330,29 @@ def main():
     # ---- [1-3] selftest parity ------------------------------------------------
     rc_o, out_o = run_selftest(orig)
     rc_r, out_r = run_selftest(ref)
-    check("[1] selftest: original (pinned 4f76eaa^) 37/37 rc 0",
-          rc_o == 0 and SUMMARY in out_o,
-          "rc=%d" % rc_o)
-    check("[2] selftest: refactored 37/37 rc 0",
-          rc_r == 0 and SUMMARY in out_r,
-          "rc=%d" % rc_r)
-    check("[3] selftest: stdout BYTE-IDENTICAL",
-          out_o == out_r,
-          "len_o=%d len_r=%d" % (len(out_o), len(out_r)))
+    cnt_o, cnt_r = summary_counts(out_o), summary_counts(out_r)
+    check("[1] selftest: original (pinned 4f76eaa^) -- 0 failed, %d cells"
+          % ORIG_CELLS,
+          rc_o == 0 and cnt_o is not None and cnt_o[0] == ORIG_CELLS
+          and cnt_o[2] == 0,
+          "rc=%d summary=%r" % (rc_o, cnt_o))
+    check("[2] selftest: refactored (working tree) -- 0 failed, >= %d cells"
+          % ORIG_CELLS,
+          rc_r == 0 and cnt_r is not None and cnt_r[1] == cnt_r[0]
+          and cnt_r[2] == 0 and cnt_r[0] >= ORIG_CELLS,
+          "rc=%d summary=%r" % (rc_r, cnt_r))
+    _, vo = run_selftest(orig, verbose=True)
+    _, vr = run_selftest(ref, verbose=True)
+    rows_o, rows_r = cell_table(vo), cell_table(vr)
+    missing, extra = pair_delta(rows_o, rows_r)
+    check("[3] fixture-level parity: the pinned build's %d (fixture, verdict) "
+          "pair(s) all survive (%d cell(s) added)"
+          % (len(rows_o), len(extra)),
+          not missing and len(rows_o) >= ORIG_CELLS and len(rows_r) >= len(rows_o),
+          "lost/reclassified: %r" % (missing[:3],))
+
+    # [5] compares from the first RUN block: the rubric prelude is excluded, see
+    # report_stdout().
 
     # ---- [4] code-level: smell existed, was replaced (non-faculty) -----------
     check("[4a] code-level: original HAS tally line", has_stmt(orig, TALLY))

wizard-work/ledger/2026-11-02-author-census.csv

@@ -0,0 +1,21 @@
+rank,author,commits
+1,Timmy,557
+2,ledger,344
+3,spark,240
+4,timmy,209
+5,Volt,195
+6,beam,160
+7,sol,147
+8,Zephyrus Sparkborn,142
+9,quill,126
+10,Merlin,118
+11,volt,116
+12,forge,62
+13,sphinx,32
+14,null,28
+15,Mercury,22
+16,pipe,18
+17,zephyrus-sparkborn,14
+18,Cassian Assayborn,7
+19,troupe-pipe,6
+20,argus,3

wizard-work/ledger/2026-11-02-commit-census-by-author.csv

@@ -0,0 +1,16 @@
+rank,author,commits
+1,Timmy,765
+2,ledger,345
+3,Volt,258
+4,spark,240
+5,beam,160
+6,Zephyrus Sparkborn,153
+7,sol,147
+8,quill,126
+9,Merlin,118
+10,forge,62
+11,volt,53
+12,sphinx,32
+13,null,28
+14,Mercury,22
+15,pipe,18

wizard-work/ledger/2026-11-02-commit-census-by-author.md

@@ -0,0 +1,28 @@
+# Commit census by author — top 15 (2026-11-02)
+
+Source: git history of /root/troupe-standup, `git log --format=%aN` over all history.
+Extraction: `git log --format='%aN' | sort | uniq -c | sort -rn | head -15`.
+Provenance: repo HEAD `de0f0a7250aabcaef01083372dbd8eb10469562a`.
+
+| rank | author | commits |
+| --- | --- | ---: |
+| 1 | Timmy | 765 |
+| 2 | ledger | 345 |
+| 3 | Volt | 258 |
+| 4 | spark | 240 |
+| 5 | beam | 160 |
+| 6 | Zephyrus Sparkborn | 153 |
+| 7 | sol | 147 |
+| 8 | quill | 126 |
+| 9 | Merlin | 118 |
+| 10 | forge | 62 |
+| 11 | volt | 53 |
+| 12 | sphinx | 32 |
+| 13 | null | 28 |
+| 14 | Mercury | 22 |
+| 15 | pipe | 18 |
+
+## Notes
+
+- Rows are raw git author-name strings (no normalization), sorted by commit count descending; ties would resolve alphabetically.
+- Top-15 row sum = 2527; full-repo commit count = 2551 (`git rev-list --count HEAD`).

wizard-work/ledger/2026-11-02-ledger-dir-census.csv

@@ -0,0 +1,682 @@
+rel_path,size_bytes,sha256
+wizard-work/ledger/.check_patterns.txt,251,e4113a71bc156c84a7abf08e86001f94bf71d702eb730f88b568ae48dc033709
+wizard-work/ledger/.oldchk.test,1616,f5a37e5c1a5e4ac504e8ca339aa8b53c267f2be138d4b9d6677b5954fcba02cb
+wizard-work/ledger/2026-10-21-repo-census.md,3299,ad50c35ad313325f2b2b9d0e473787b00f76e99fab0a1fff327268fd80f9bc41
+wizard-work/ledger/2026-10-22-media-catalog/README.md,1152,e735351914707ca133e1e9655fd795780e96a32b487c4dff2763474e3b3f085f
+wizard-work/ledger/2026-10-22-media-catalog/extraction_manifest.json,510,32b8a189390bc80ebabec179c8ecaefe7bc94b81ff9b0a7da2075d9e1f7fb5ee
+wizard-work/ledger/2026-10-22-media-catalog/media_catalog.csv,1255,3a75715efe3e4547421b67a8b942eaeb860916f4f3708520e5ab3320cf885386
+wizard-work/ledger/2026-10-22-media-catalog/verify.sh,2437,cd5e2b3262f0dbd11ec90c789387de9601594a947c0705ef475b9b811410b27f
+wizard-work/ledger/2026-10-22-top-ml-repos/README.md,1078,04584252a9654ec6d66ef92e8eba9ff34936d78cbd51d2aef968d182ad8a9d07
+wizard-work/ledger/2026-10-22-top-ml-repos/repos.csv,1802,1041ebc471b750c4e9ca91ea9277ac2c5a45d365df5fbf139cb9641e477befa1
+wizard-work/ledger/2026-10-22-top-ml-repos/repos.json,3524,bc78f0045a69f98afa80ffdb21939cf394af1255dfb891bc8695cf20ce56bc79
+wizard-work/ledger/2026-10-22-top-ml-repos/repos.md,2404,eb67206682147ab84d64b344fc2c1d6e33924a9160d671283f890199de06a7b6
+wizard-work/ledger/2026-10-22-top-ml-repos/verify.py,2293,0da9e0edf05b64190fc84259cbbc460675dbadec288c8734aa18c9241b30a1e9
+wizard-work/ledger/2026-10-22-top-repos-by-stars/README.md,2941,077ec607c3282ee5aa0f5bf87a95116bb71a559e250deab53cba7b40f0c79848
+wizard-work/ledger/2026-10-22-top-repos-by-stars/repos.csv,1822,0992177cb493d764865b04ea06f4adc3856ce39ffb82f13fcff360becae4180a
+wizard-work/ledger/2026-10-22-top-repos-by-stars/repos.json,4257,87a79bec0678bc2b578217292e2b389a5b3eb9addf486b6a9c424f3d04b91fb3
+wizard-work/ledger/2026-10-22-top-repos-by-stars/repos.md,2394,8f5fabc9768ed5ba3557f8d1272dc317fc823f6e67a758399a84b1c861b2a6b6
+wizard-work/ledger/2026-10-22-top-repos-by-stars/verify.py,1274,ebc13ac91a6b2e759536a4022830aac00bcb8fe6affff2d5a003894415b5737d
+wizard-work/ledger/2026-10-23-jpv-users.csv,1143,15df7bab1da573f03f264bd77a356634e863b2fc81813bb75e426dd53ea0c155
+wizard-work/ledger/2026-10-23-jpv-users.json,2444,48e5c9da41d2b40f8fcbb8ca98b5b5e6d73b4ff9adfa8bc35f3b9f4384e76007
+wizard-work/ledger/2026-10-23-jpv-users.md,1364,a48f599c209cf04552f6171ac67ad037427691294006308b2a0a346a2ae419d0
+wizard-work/ledger/2026-10-23-jpv-users.raw.json,5645,bfba663e2221e5ce0544da02447e8be5e7316e33ae0d5f47e72bdcf270d50ec3
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/countries_gdp_nominal.csv,6403,ceab753bbd63a3ffeb7dd75b62a5dd641798e81f89e3b9828d9909c415da27ab
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/countries_gdp_nominal.json,35729,3db80b1dd250368ed8c7b998e240d00a1ffcaf99eaae8f3a2337253863f5bf3d
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/countries_gdp_nominal.md,9299,9b3c6ec2a0392b847411ee50cfb769dfe94d113db72800f3f2bbbda606b7613d
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/extract.py,8210,895c6a01841bf579e08b2a0670181ddfbb1e6a6e6c7e141de6e50a9805fbfbcb
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/extraction_manifest.json,662,02fb06c9e9ea613c637ea8d9ab043221304e38bd37384c3e7e3e3ed84d10a3b3
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/fetch_raw_wikitext.txt,53399,1d7f428a3370b33a11e464bb3b004ce3a52aa41e3b13af4f3a256378b1bc83a5
+wizard-work/ledger/2026-10-24-countries-gdp-nominal/verify.py,2544,fa7535ac70b0b840d32631ae163c31a40cf0b485eb8ad0a7e0ed2880ebbcf96b
+wizard-work/ledger/2026-10-24-job-postings/README.md,595,24936ba08377d1925aac286e5f7f063ebb545007b372ba0671379a0d830a6fc1
+wizard-work/ledger/2026-10-24-job-postings/jobs.csv,154681,e91b368600de7b5aa10023ff69b232bfc738c8d652427ad79a6b362e3e6ba8bb
+wizard-work/ledger/2026-10-24-job-postings/manifest.json,545,b6c88a4a611af75d49a12742ebdeaed4e8653cfa34feb804e1cd4a12926ed21b
+wizard-work/ledger/2026-10-24-job-postings/verify.py,1182,d4d4b1ee684ebc18e37373a868ce7f92d2e85d1ec714638934fe109180a21eb4
+wizard-work/ledger/2026-10-25-git-history-README.md,1368,f2240edfed411a7c9c0001c0c753f7c3fbd7125942297191a449ffb191c69f4f
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/CHECK,654,3979cfdf139d9788fb9c73da16982378c622d8b74d374caf3956a1f6a6ddfa5d
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/README.md,837,52c1e50233d7716abac50b987b6d568db6c4a8365606fe86dda1e3c64b4d662d
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/extract_git_history_live.py,7247,2eec1e40f11564a103c02f6496ece431ee8914aabeafc3b96ccfd7f37956aeda
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/git-history.csv,729183,4cf415febb38d8d13425b3a6601beea9bc53adc207b255402c3888a1501140ec
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/git-history.json,1119552,3ac8969b07fee3dcc7c344b94a8e67d12b4ff4da60a21d290db7528ebade0c3e
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/git-history.md,9306,5e5428e23fd66662c07dbcc89eeb51ac4f3cf5815b32cf8ae3feda5f05494151
+wizard-work/ledger/2026-10-25-git-history-live-b1edd09/verify_git_history.py,3790,14b58e2f15ecddbd52e6673129aaf967300fcd755076c840fad20a422d2d3ddb
+wizard-work/ledger/2026-10-25-git-history.csv,733494,60b6c4f0c0a4b654bf579861f14629f2be820c47ce0116baee326a385b20335f
+wizard-work/ledger/2026-10-25-git-history.json,1223459,c0647c1fdf059f6c090a1a796a164a22e9c57f07d0b217f41634fa44413577af
+wizard-work/ledger/2026-10-25-git-history.md,9339,2afe554001df88a33da73b3959d4fc810c030775e5742b151b061a0276328d79
+wizard-work/ledger/2026-10-25-head-20-commits/CHECK,349,6216ef60e6e948a6737320fdd962313c6163c0b9e40881222e95c9c69b476d3f
+wizard-work/ledger/2026-10-25-head-20-commits/README.md,1059,e51040d9d0b3e53be9304131575824d3d3347f433a68fa555ba43f472f6ee91d
+wizard-work/ledger/2026-10-25-head-20-commits/commits.json,9309,827cb45cce8e7e6e6073b2235f033f8de0d1cc933081a2131ea889881252b68d
+wizard-work/ledger/2026-10-25-head-20-commits/commits.md,4318,67d9ae2267dd715008bdf08ead8f433fa37973c7c11fc975c48b6f5fbfa4c857
+wizard-work/ledger/2026-10-25-head-20-commits/commits.tsv,4454,f21074a6508cb3f673b3a0c26a980216900fa4bc9ac9f06b6c37cfc029b14c5b
+wizard-work/ledger/2026-10-25-head-20-commits/commits_detail.tsv,2553,09ddec062616922a9cdbc10d06adaebdca4226e30616e98604320cf7e061459e
+wizard-work/ledger/2026-10-25-head-20-commits/verify_head_commits.py,4501,7f86af29fc0a1c2655ecf1c653a1fbadd38c47a018c3c8887b417208adbea929
+wizard-work/ledger/2026-10-25-workqueue-census.md,16464,f8e657040728377a5b6da368d422b66608ebe91439878632bd26031359b4ff13
+wizard-work/ledger/2026-10-25-workqueue-census.tsv,15694,72c2861ae13ebbf99e7ed20c04c893e40e6d55ff0e8d318cb30f88ebd6f7a2d2
+wizard-work/ledger/2026-10-26-commit-census-as-of-HEAD.md,2119,8fe7db2c3ec71f6ba43efea829fd0fd7203468d1e768ab9e5bb14f3b7e413542
+wizard-work/ledger/2026-10-26-commit-census-as-of-HEAD.tsv,461,59adbfa7a48332863f6bd68aa85a19d0151948f4f87fbd2fa0bb706d9930d922
+wizard-work/ledger/2026-10-26-commit-census.md,1106,0730eaf09735702bcb290f325ba8f4c4c4d21fc7daf64722e305c4281554a35a
+wizard-work/ledger/2026-10-26-commit-census.tsv,460,4e1eeb62ddd9041228e9e5a7563ced92699c7c1d8e3f7c2f60615e395ab9b033
+wizard-work/ledger/2026-10-26-top-20-economies-gdp-2024/top-20-economies-2024.md,1350,843992efc388dca11987c50dc44ff58545c346acf575b448376ee4bcf415d863
+wizard-work/ledger/2026-10-26-top-20-economies-gdp-2024/verify.sh,1392,c8133818131da17a05c68d40373954d5630610d832be185f681ef907d79d8eeb
+wizard-work/ledger/2026-10-27-checkin-census.files,2321,cf770386bdec2afb591308d295d4f9fc564e1240ca7a23f6d2e09e92b42f424f
+wizard-work/ledger/2026-10-27-checkin-census.md,1946,d3a83c9d5403a250aa9dc7b49fe28556961c731f740ef2bcfe957ce8c3270053
+wizard-work/ledger/2026-10-27-checkin-census.tsv,139,c0ecd528424861170a8fbb395453da52b32db71c59a44935518db1cb5b1627b1
+wizard-work/ledger/2026-10-27-commit-census.csv,487,308e70b522754f7fb7b57e9aa4c6ab36c8f02163aff9a79ab32c545225453520
+wizard-work/ledger/2026-10-27-commit-census.md,1561,5f674a4801823d1c4e7c468ae1bdf891c7e6c66ccc2fed942ce70b0d7d8b58b5
+wizard-work/ledger/2026-10-27-commit-census.py,3583,01e7b84a2dc40adc25f1d4935df918009baebf7fa3d6b1fdb49e082d490ddcf2
+wizard-work/ledger/2026-10-27-commit-census.tsv,487,ef2c2449f4ea95a78761f1078f78046caa75d0fe5b95edad4fe90c2806ae2178
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/CHECK,305,cd07b8d23c84b881d1fe11099f9ca9a4b2694fcc506da41ab4f6060e21484b1b
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/README.md,1097,dd97e8aaa30c8c4c6bbcc932671e934883f164408093b4d4e9c0c6cb63311c37
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/arxiv_csai_recent.json,19329,e65554c818c3b228afe540371749b321cf253bcb64caf026ce7dbbc02bfde8d3
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/arxiv_csai_recent.md,11519,fa32849a4211fe33b0f08adb61b7d6d5eec56aab0e36c95c5711c567a9ddf40e
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/arxiv_csai_recent.tsv,15828,c4ff2b1d991dcd0504bb2f716a2981d50d5239c13f1e084511c59ea36b770e73
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/raw_api.xml,72428,ddbb656808c2e6e4ec38137d07956bf9aa134427bcd7c23256f898f0e64e89bf
+wizard-work/ledger/2026-10-28-arxiv-csai-recent/reverify.py,5530,ebfaf3a7f2528ed7e36eef011d5bc88d9c70060e718fa6e935d1c1a2a46b4f6b
+wizard-work/ledger/2026-10-28-checkin-census/2026-10-28-checkin-census.files,2428,ed163c85742fbb645655506a413f2d276eb5085900e7c0b1acffde9b84d03c37
+wizard-work/ledger/2026-10-28-checkin-census/CHECK,977,49234a8d2ba181f1d4411f95f340c3f9e57c50580153a17b8e58ede41db73d15
+wizard-work/ledger/2026-10-28-checkin-census/_dbg2.py,443,7b1ff9f1a795452152ceb387381838a582e09b5a0128fa11b403c3416df5cdc6
+wizard-work/ledger/2026-10-28-checkin-census/_dbg3.py,624,83051343dc776adc093dc52284e8b5c5ec1e58958f41dd4fbea719dc4894afaa
+wizard-work/ledger/2026-10-28-checkin-census/_dbg4.py,892,d037dc8bc8b7a71cbbbe9d90726284772d345ec0ece7b045273f93198ade0397
+wizard-work/ledger/2026-10-28-checkin-census/_dbg5.py,1089,35bb8b96b510e2e90e9d6d1c4f1946a84d73a3ea217f219c4839c7c5db3d00cb
+wizard-work/ledger/2026-10-28-checkin-census/_dbg6.py,951,0d3117c4a2c080c424be67c971b1243ffc48314fe2c590d7d249d21c0ca5dcb2
+wizard-work/ledger/2026-10-28-checkin-census/_dbg7.py,1201,f0ac503d7a6107aeb15cad0218e8d7605f87efb6bcf93fbfe2d458c1c9b19b89
+wizard-work/ledger/2026-10-28-checkin-census/_dbg8.py,1289,7a7765acf8001f919c51f77745ddac1ea06de281878201f873fd8110e17a2039
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-28.json,37616,0814f782e3fae2957c6de25574cc09888cb9f0bc1c1dc0105736d37b4cd7f0bb
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-28.md,9787,e8ca6aaa5d60e510bfd4d75dde44801476d2a7e5fb2789db39f16006aef6487a
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-28.tsv,7330,2c10ab46015a612c879a70ed63430fb38aff97118d78aab5012528e28161d192
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-31.json,38494,2ca9a97ef9c7593dd4ca64305747a12882cd8a547c1f1d44a489ff51596ed7ac
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-31.md,10461,ce6daf3f1628382b6ea292aea2828d07046448427042ccd09c3a03ac9afbc28b
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-10-31.tsv,7950,aed3ab7c1d7e4662079f3886f0e899ae10029ac1d558a74376b2cb8e8802a8db
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-11-01.json,39127,0f20f360da89dd1ef1fbf2e6cdb6d336a845c2301797060d7087c38a2731a2ba
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-11-01.md,10613,49f7e3ba5c03d797aba585907b0d764c01a7c867bcab3a062b2ca93085b4819d
+wizard-work/ledger/2026-10-28-checkin-census/checkin-census-2026-11-01.tsv,8085,1a3fb65fa377819e7515e45dce6098b62069989a829db8202ddd80a5a2ca75aa
+wizard-work/ledger/2026-10-28-checkin-census/extract_checkin_census_2026-10-28.py,7794,ffc78067aa29e93f058c01f8078077857b2165bcfef39b3c3846bd5c5e4fbd3c
+wizard-work/ledger/2026-10-28-checkin-census/extract_checkin_census_2026_10_28.py,10644,979cb6377a3416a77c51fe482f5826bd65948df26a9d7df19826e49370a8cec3
+wizard-work/ledger/2026-10-28-checkin-census/grade.py,13848,018f1221b258c3fd447b6f25e898d0c1e2a0b51d5e21e09928e62115f91fe9ea
+wizard-work/ledger/2026-10-28-commits-by-author/CHECK,515,cfe3d1bc76b750e73f74f79048971d1baf83c3323930dc4e06a9c997d3c2cd73
+wizard-work/ledger/2026-10-28-commits-by-author/commits_by_author.csv,460,c3c6a8503b8173a99a3ac37bb3601dc1884f7d9cef202d233a348c9ae6ffbe02
+wizard-work/ledger/2026-10-28-commits-by-author/commits_by_author.json,1954,61b48b1ba433e6a0a40ef5af6ef019a32065bf5c83afb5f7de6ac9512892e157
+wizard-work/ledger/2026-10-28-commits-by-author/commits_by_author.md,1043,afecb5c2db50d284857f9374db004e1affcd6a58c75abc7862759fec2c624dd5
+wizard-work/ledger/2026-10-28-commits-by-author/extract_commits_by_author.py,3271,a7272c6394535cc44b749342296d73c4fce322ffa0cea42cabc7f29af8b21316
+wizard-work/ledger/2026-10-28-commits-by-author/verify_commits_by_author.py,3274,139b4dcccdc2bde6a8c08cb53594b22a4c65404511b3e7765fcc5c4e5f0aa662
+wizard-work/ledger/2026-10-28-directory-census/CHECK,2871,908e62523acb64b3e3780cde099b9b10e7f0ed9929543292667446a7536f9003
+wizard-work/ledger/2026-10-28-directory-census/README.md,1463,c5d0bea292a44c7d9cbb761f700d7b3b2f7f32b37a84324841209c26bc80e558
+wizard-work/ledger/2026-10-28-directory-census/directory-census.md,9382,452fdc90693dc6a6255e8f0b0e3fd37628194771dcf2a0966a65d0a083becde8
+wizard-work/ledger/2026-10-28-directory-census/directory-census.tsv,7904,21a562e1d3c7d7585e157870dcd46d9e3850708ee6cdd86747b5bfe1561c14ba
+wizard-work/ledger/2026-10-28-directory-census/extract_directory_census.py,5357,ebd07aa6e2bb1e8e253cb0108aeef452cbfa08f50e54694031957a7c7e43115e
+wizard-work/ledger/2026-10-28-directory-census/manifest.json,270,4c7bb99e2c1589b9965fe4356dbc3231bd3112b301174a9a0267939094c2cf00
+wizard-work/ledger/2026-10-28-directory-census/namespace-buckets.tsv,8470,352d986959458426437c7acad17ab30e7f00eaae7424710c669e674a78970a8a
+wizard-work/ledger/2026-10-28-git-tree-census/CHECK,2024,a79c3ed843d989797457cd2b8634c4bd1f94dac3ec40f1c559ebe241dede6ad4
+wizard-work/ledger/2026-10-28-git-tree-census/README.md,1711,591ca458c9d9c5d7c2355b0c292b3486238b26b714e3be0b02028c7e7aa0e7a4
+wizard-work/ledger/2026-10-28-git-tree-census/derive.awk,669,33395e9fef25e2baed1d78ed4f436d592f594cdf68660f6c8da853fcf98115d0
+wizard-work/ledger/2026-10-28-git-tree-census/wizardwork-census.tsv,218,6cdbf4badacd56326d1d7639fccddbae528cdc19b8de7628d2c9dff8dff8456c
+wizard-work/ledger/2026-10-28-recovery-registry/CHECK,4749,bb5adfb0aadd7dd262ffcbc6760b7397c8b3ebaddc5a66869b2b2481869372fc
+wizard-work/ledger/2026-10-28-recovery-registry/extract_recoveries_registry.py,4520,87c394da1a4bc072a0ec32a22d29257fa2556955ecd47ebe24df2e94160dc1a3
+wizard-work/ledger/2026-10-28-recovery-registry/manifest.json,835,e8510c4373f61c908da36640a0ff3096b6638ec4eb71f4e4e77eab1988c3cc96
+wizard-work/ledger/2026-10-28-recovery-registry/recoveries-registry.md,9831,96419c92af2ef0906dd77cc85acd6f0d3c800b5d528e5ee27e19e6b52d26a546
+wizard-work/ledger/2026-10-28-recovery-registry/recoveries-registry.tsv,8523,2b92af3df77e48f26d5dcc7717f62947edbf4843cbda1fcc857f82c0f8a73d39
+wizard-work/ledger/2026-10-28-wizardwork-census/CHECK,1505,02e994c8a8a60c32235ba8d69eff48f2993bce1b802b87d826581e87f7dbc2f3
+wizard-work/ledger/2026-10-28-wizardwork-census/derive.awk,660,3dae1bae00c624f79ff63bbc4692dd45b064ff6b70d4bb8c384aac8714af93a1
+wizard-work/ledger/2026-10-28-wizardwork-census/wizardwork-census.md,812,df5066ebe8649cc709b17cdbbabab554b71fb01837dc155b0c7cf591f428f11d
+wizard-work/ledger/2026-10-28-wizardwork-census/wizardwork-census.tsv,218,61960ead48037db0e9c601a2d87a51edce83f12333b0026667c2aa690d00c20b
+wizard-work/ledger/2026-10-28-workqueue-census/CHECK,18847,d043d250940abd461e9d400a33a65f8f6747ba76b2bee8f04bc7450d85621d0c
+wizard-work/ledger/2026-10-28-workqueue-census/README.md,1729,5060e56b8270ce0b28b180975533df356310ac70bbc86ead2a47349ffa6f7aa3
+wizard-work/ledger/2026-10-28-workqueue-census/_debug.py,920,37cc6177105560613b13755bca5e31e743e68f10c866018222bf98e0485dbbe3
+wizard-work/ledger/2026-10-28-workqueue-census/check_workqueue_census.py,18847,d043d250940abd461e9d400a33a65f8f6747ba76b2bee8f04bc7450d85621d0c
+wizard-work/ledger/2026-10-28-workqueue-census/extract_manifest.json,1213,b011c4c7e0e384bea407abd56fc43189e6c0022c24c80182f19b098ebeece2e3
+wizard-work/ledger/2026-10-28-workqueue-census/extract_workqueue_census.py,10320,0c1a3d85a14bc961b238ca81302c726b376a3e1704b73fa7d427aeb18307fd95
+wizard-work/ledger/2026-10-28-workqueue-census/manifest.json,355,440652f87a45a94a09cf9fb9c655783da495cfd9df4dd9662086e443ac618fdd
+wizard-work/ledger/2026-10-28-workqueue-census/workqueue-census.md,48403,bc03dada59169be928b383cab6e1b14f8c9a00cc07cf7de36b090228dbb6e99d
+wizard-work/ledger/2026-10-28-workqueue-census/workqueue-census.tsv,46558,61d1c8756367acec22b9be78ae94ed3afe7d03ca60e4b627b5507d9837aae7b7
+wizard-work/ledger/2026-10-29-albums-census/CHECK,550,4ae75bf45a832bf509754a717d8817ef44e8ca12c777df4e2540ce2127cdb5ab
+wizard-work/ledger/2026-10-29-albums-census/README.md,703,a42dd7f572066884fcf785d2a5cafdb20e1c9276a335beee000c4824c7518cf2
+wizard-work/ledger/2026-10-29-albums-census/albums.csv,4347,1563d3fd2453cd2e3afb51e5faba3ef3d7f193987fc126e522f1d1c230e0cf86
+wizard-work/ledger/2026-10-29-albums-census/albums_by_user.csv,69,e419699ee35a74262c3000da7575b3d0aa52426dd625713fbbf8e80cb3bcfeb6
+wizard-work/ledger/2026-10-29-albums-census/albums_by_user.json,671,57876c1c68535d7adf7d294f0dd3ceaba7491d6dec4c0e3c2916b0166a7e5b5d
+wizard-work/ledger/2026-10-29-albums-census/albums_by_user.md,145,8e3a144e66377ac72f5750c9ac19d5129c00b240b5545159eef5921484e91ed0
+wizard-work/ledger/2026-10-29-albums-census/extract_albums.py,1741,092e3093e13e62ee4eb7559e15dfcb2d50daa7762ee1add88294dfe1e380d703
+wizard-work/ledger/2026-10-29-albums-census/raw_albums.json,9333,6f4dbc617aa3dce7210ce9a549c0f7c0aaa7d2e89e5bd3b0f471fb7ea44b738d
+wizard-work/ledger/2026-10-29-albums-census/verify_albums.py,1406,2b65df833495211ec656bca4805c1692b30727eb08ab9ff5b5915ae3148654a4
+wizard-work/ledger/2026-10-29-checkin-census/2026-10-29-checkin-census.files,2473,8753b5462d373a0d0195f186115359c9e4fc18951d5fd88ce423302efc812658
+wizard-work/ledger/2026-10-29-checkin-census/CHECK,962,a60296ed83425779645380f1bf6ad34dcecb889b453f3fa73771d0aa6df551e6
+wizard-work/ledger/2026-10-29-checkin-census/checkin-census.csv,14875,fbe5dc78a2d11e8118f51add94ea64d6cbc99e1ea8a987582335157d46f6b425
+wizard-work/ledger/2026-10-29-checkin-census/checkin-census.json,27687,8741afaf9807844ac0df17ed76c2eb9f6a37eff1aac1f609246e90d154e328ed
+wizard-work/ledger/2026-10-29-checkin-census/checkin-census.md,16371,0e70d59b67b0bf8e782722316a2fbf019a14cb5e82166c490194d30b7196f41b
+wizard-work/ledger/2026-10-29-checkin-census/gen.py,6751,49211108e483cc66cb17433143f08bf9be67ddc6ee887573fbb457eaaac1fea4
+wizard-work/ledger/2026-10-29-checkin-census/grade.py,9753,42d24570f4b85802cde750655e92a5e905723b7b1aca8e4964335f13f6aa8ea8
+wizard-work/ledger/2026-10-29-commit-author-census/CHECK,2265,45f4a0b09646010a235153f29a8be91e3575efbd5f3b7f31749ce00df0002ccd
+wizard-work/ledger/2026-10-29-commit-author-census/commits-by-author.json,1526,303cb9d6bdccb42f8b0f1e09c5b70b598dcf6ddef090368ba0d49bb21961e382
+wizard-work/ledger/2026-10-29-commit-author-census/commits-by-author.md,724,e09ba2aba42eb22f26c3daac3c2eb1ab126c92b6c01dde2ee7d6a09b66aa8567
+wizard-work/ledger/2026-10-29-commit-author-census/commits-by-author.tsv,274,52425782595b272596a6f010f160a84fd1f86559a84c027f5fb1c78f6c527a87
+wizard-work/ledger/2026-10-29-commit-author-census/gen.py,1598,95e986b34edadb069a03a6486ee662218ed857206d02ebd150b446b3417651c7
+wizard-work/ledger/2026-10-29-git-tree-manifest.csv,423996,abf797bdc801e81f010a1e970599b9c40a9cddcaa377832eb770f34fb8d2f6ca
+wizard-work/ledger/2026-10-29-git-tree-manifest.json,733476,d1f771414d025a53306475c09956ceb898e4de400aa5965a600c990bcef0444e
+wizard-work/ledger/2026-10-29-git-tree-manifest.md,248174,3cb9f92dc8cef16aadce8ec65854f7d7c9137809e11e60414f2ec91ae74b4bda
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/CHECK,232,8c05d5288b7184c7d2f324a9e9d353588ab36e4e23b74f6fcdaa90625e2bb5df
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/README.md,1622,3120f6c6d5d791d62ccec67f4b111c13629aa037831478260848ea2b93509efc
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/SUMMARY.md,613,630c86a875becd6290622d7b84919c3acb38d9e00d6a058c473044b8460e83ee
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/comments-per-post.csv,609,5339f8f482a044c0750188818abd32765698b8cdd2c04c2026b2746af68d53d4
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/posts-by-user.csv,372,c5f5de628a2980c8592ce98a156ec32be3d8d587f714e70561ef18b7954491b6
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/todos-by-user.csv,437,fd861dc6d385e6a6c31c83f958d20718cb1feadb56c3e6752d011e99508a1496
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/todos.csv,10936,9e2deb38fd2c9302bfae6e64025bbe420ef042176b661492c3dfc829158b593c
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/users.csv,1016,5eca9c41756d27d3e546cd4cc29dc4bae029a7409540789f2ec8154bdd198ab5
+wizard-work/ledger/2026-10-29-jsonplaceholder-census/verify_predict.py,3878,d40dcd4511b07bd5df291eb7e225600ecbcf51913e7b0cc3bacfbb06c2757c36
+wizard-work/ledger/2026-10-29-queue-ledger/checkblocks.py,698,fe6a5524994ab8eee6fcb2d8114b787843b44534f6e49e2c19bef1a33a599716
+wizard-work/ledger/2026-10-29-queue-ledger/checkheads.py,482,38b2e000067c8be144931154ed9d5c0c609df6db64d42a2ed7a8211b54f8167a
+wizard-work/ledger/2026-10-29-queue-ledger/checkno.py,986,63ca725ef386c809a07dc6b1af6210538ae62ac73109f05f106b875eb0ab7f9b
+wizard-work/ledger/2026-10-29-queue-ledger/debug1.py,434,53337578bd4902719699542f9586f614c30c370c7cd67d87eddbd368f6ad1b9a
+wizard-work/ledger/2026-10-29-queue-ledger/debug2.py,521,97ea9afd173ca33c187b9caf144a5b135faf51d89c957aa8afd46e2a3ba4e989
+wizard-work/ledger/2026-10-29-queue-ledger/debug3.py,550,b83b62bc235be72aedfbd81ba76de11cb6e077c7523ae01bde78c2ccc31d06c6
+wizard-work/ledger/2026-10-29-queue-ledger/debug4.py,590,79626cdaee6fcb567c917df5be10b37addf07e49ed893cb6c620384cb4315f6c
+wizard-work/ledger/2026-10-29-queue-ledger/debug5.py,768,da96595f2d28717a7f05e094270ef4c84fb5a75cd0c89b17adf1e8cd4463e57b
+wizard-work/ledger/2026-10-29-queue-ledger/debug6.py,459,9a42a0a9fc74d03936930ba802a0af91d048375711a17c0e7edd90af2d6b05db
+wizard-work/ledger/2026-10-29-queue-ledger/debug_qs.py,506,3d45fb8d055b1a473f615e0c7ee49e43ddf692b2edf48e1e493d3ca2991ace64
+wizard-work/ledger/2026-10-29-queue-ledger/extract_queue_ledger.py,5191,30fe40fdd02a12f7a4aab69612fe70711056a369b303f0710974b99dd57b188c
+wizard-work/ledger/2026-10-29-queue-ledger/finalcheck.py,1349,23ef34df52876a860fd095a944cf90a9349ecbf69e0138ca2829566e7ca00ab5
+wizard-work/ledger/2026-10-29-queue-ledger/print72.py,351,222e64ba66c3ad74e0e09c64b60315a27b81847e6ea6b91bb7a33ecec1a84940
+wizard-work/ledger/2026-10-29-queue-ledger/queue-ledger.json,47302,4a16a17c59651b9f3139067b89063afe9ef1491e00d33bdd22457b6fc893ef93
+wizard-work/ledger/2026-10-29-queue-ledger/queue-ledger.md,38971,61c2a0cd431e7ee493e5676c2fde5b1eaac579886b7c753b7753edee0d835289
+wizard-work/ledger/2026-10-29-queue-ledger/queue-ledger.tsv,38208,825d0ee599870ebc5cbd9ed60ca9f6bc57e3d467eae9458d26a677a7f68f565e
+wizard-work/ledger/2026-10-29-queue-ledger/rctest.py,225,4109ad1bc6affcd21a05da155dee7b9689d470fde0ebe1f6bc27c764197e49da
+wizard-work/ledger/2026-10-29-queue-ledger/rctest2.py,322,e712760117ff9cfa58d34517ece1c63d162c4165ad9ce89275d717209359b447
+wizard-work/ledger/2026-10-29-roster.csv,4767,beb1ff57ea4e2921f8f4bf040bda7f2b962c9bdef4f6766cb3598f89c714f988
+wizard-work/ledger/2026-10-29-roster.json,6196,3a9dbfb77f69f0d6d2f818ee705e9c339361892b63add7dcfec5ace37806fc17
+wizard-work/ledger/2026-10-29-roster.md,4881,7f43e0e6c15286f2570bb52159cfc4b62d726517f6b3cd397cedd759fb56e4f6
+wizard-work/ledger/2026-10-29-roster.py,4455,6313afab1271c3c56228c422b9294bd651b111150a23f8f9502a23fa9533e293
+wizard-work/ledger/2026-10-29-wizard-roster.csv,4767,beb1ff57ea4e2921f8f4bf040bda7f2b962c9bdef4f6766cb3598f89c714f988
+wizard-work/ledger/2026-10-29-wizard-roster.json,6258,ee054aafe47680d4e035710c246475e7c04575cb9d470c806e960b8a5030c9b7
+wizard-work/ledger/2026-10-29-wizard-roster.md,5063,cf5c23528177018a9aa831d743225cb61f9701a3951ca2378fea555234f8b383
+wizard-work/ledger/2026-10-29-workqueue-census/CHECK,4871,fa7bb6e20c352cd2695f4d1d0ec9cc38d8d47ce639cdb35e9ee280e233fbed6c
+wizard-work/ledger/2026-10-29-workqueue-census/extract_workqueue_census.py,4335,f0f6bc043e4b4f5b29354600495fffa15aee50470e18e212aa00bf8ab65b5907
+wizard-work/ledger/2026-10-29-workqueue-census/workqueue-census.json,61456,30b18e703fafe55e42d0d13538968aa3d5570d0eaab174a07ffed1c740a72d5f
+wizard-work/ledger/2026-10-29-workqueue-census/workqueue-census.md,53651,136eaf0db7bc8675bcae35085e09b0df42decadca87f2c6ab6b03950123ac795
+wizard-work/ledger/2026-10-29-workqueue-census/workqueue-census.tsv,52593,5cbdf38977b3bf9bb5dfbe05873f3f13d8a83e07cff31669df3a5d9cbd1a22bd
+wizard-work/ledger/2026-10-30-commits-by-author-day.md,1186,a7cd515d78b35010bec6c359b5253875be916ff0446c7845178d2b81a9ad8a76
+wizard-work/ledger/2026-10-30-commits-by-author-day.tsv,4988,9d64dff4f51366c9ccb57e4e9e3cfc0163f9f202f9c644878ac10adbf90b94aa
+wizard-work/ledger/2026-10-30-file-tree-census.csv,39674,273c2e33791584225f8d0cf27aba8885367a8d8c679228de6ea6b4bad1ea2e0b
+wizard-work/ledger/2026-10-30-file-tree-census.json,49915,24ff2a02df2742fc1778d4e307b004c1b3afbeafbfc598f111306445b9d43fb4
+wizard-work/ledger/2026-10-30-file-tree-census.md,46124,4ba501df9794121d83866c0c4c9babb35c183a9e998c3dcc06dc03d98d171ce8
+wizard-work/ledger/2026-10-30-file-tree-census.py,4609,1d559db26ca64a3cc46260be4de94a747425646ea0b18da0f5d4e1c74cbc428c
+wizard-work/ledger/2026-10-30-git-author-census.csv,1961,9da6ab56c728dc41a7a0675638479b324f7b2947adca010a215f270b08a9ead8
+wizard-work/ledger/2026-10-30-git-author-census.md,3116,2890a87ca291272db9504e467cfb341f864cc528c01355a17c130af48701fef0
+wizard-work/ledger/2026-10-30-git-tree-manifest.csv,548297,a5535a80f01ad4e047ea7f0a61942dfe0663786f797d01d204d454cf993341f2
+wizard-work/ledger/2026-10-30-git-tree-manifest.json,923959,bbcbc9078e401ab1b1b6225d348bcf9d1f51749cdcc98cd6c0b2386ddce99090
+wizard-work/ledger/2026-10-30-git-tree-manifest.md,334899,71127169822490073952dc11ca57ca4ff1a7545027a1c18475d6f97b3b55f8bb
+wizard-work/ledger/2026-10-30-ledger-dir-census.csv,65468,816caac104d9a6585666b1df9260fff3247b89879e5c48b6ba288a06eb9c2084
+wizard-work/ledger/2026-10-31-albums-photo-counts.csv,4760,9150e213cb6f35e0ebe1f9b12526f1baa98fb1b48d2c18f18895977a1e64c437
+wizard-work/ledger/2026-10-31-albums-photo-counts.json,11633,a8547913c08582e1c879b7de39779a6915a97ca8940c19221b893f121e82f974
+wizard-work/ledger/2026-10-31-albums-photo-counts.md,1289,62664421a587a237c9617b3b130114c5d8728841c776f67e0fc7caa80a1c77ca
+wizard-work/ledger/2026-10-31-arxiv-llm-agents-top15.csv,7539,0538de55b0f3866c224e15f25c7c07f96d13592393588664b77b2acc6e5e536b
+wizard-work/ledger/2026-10-31-git-author-census.csv,1963,c3f6762bdc4d978734ce9c7e7d359ba0024310eda3b1938a7474860380ca7867
+wizard-work/ledger/2026-10-31-git-author-census.md,3119,be08ed3689ce76cf97a5ab741dd6d1ac9244c433898ff754252b744baa817387
+wizard-work/ledger/2026-10-31-latest-commits.md,2041,3365d4d015e0a35ad40a01135c50735b6118f863c5f6f66a2d5d9052e47fe614
+wizard-work/ledger/2026-10-31-ledger-dir-census.csv,70342,80d12c71caad13c87618dfe70e21cb902c21b3fabad90e45fd72552387623955
+wizard-work/ledger/2026-10-31-ledger-dir-census.manifest.json,454,79cad2d1cd5673235b52f67ecd6dc9e27433fa4682600105fdbc5866b4788e48
+wizard-work/ledger/2026-10-31-ledger-inventory/CHECK,332,6baf6b82aa8edc46ae121d89df95a8b725a3d899de91f007df1bbedb5413d748
+wizard-work/ledger/2026-10-31-ledger-inventory/README.md,1756,727dd685fb7556dc8878783ba641153c30ab8ca1d2b642cf852cfc600eb83313
+wizard-work/ledger/2026-10-31-ledger-inventory/extract_ledger_inventory.py,4534,65392d982975213112c5ce00b83da6e89facf65f7ecc1130c63d8792c98d5050
+wizard-work/ledger/2026-10-31-ledger-inventory/inventory.csv,40866,30ad4d1bb10c09990a8334feb8578b4f53f746c3230775ba5eeae86085d18ae1
+wizard-work/ledger/2026-10-31-ledger-inventory/manifest.json,1303,e2b2a933d3df173f15a7fe205f5b334af64868e306430a523e9b00b895faed0c
+wizard-work/ledger/2026-10-31-ledger-inventory/verify_ledger_inventory.py,2873,bf4f6096520ee7ed2e72d07eb6f94bac0bd4172ffa54c7b0599a9419030cc989
+wizard-work/ledger/2026-10-31-wizardwork-census.csv,344591,a48798e38795747820717a6973e9c2b0476507e0a177d78cfd05f88700539ae3
+wizard-work/ledger/2026-10-31-wizardwork-census.json,396692,6549677404329e1f19f8b030eed586a09c02e9fefb02d27251708fb1fec54c35
+wizard-work/ledger/2026-10-31-wizardwork-census.md,376572,9eaac601222b73819df52b4ec59f21218645e4bb7aadcbd2831bc2c1b81061b2
+wizard-work/ledger/2026-10-31-wizardwork-census.py,5055,4032c73868fab43a9a2f578941f8149eb4503b818ce2772520472480d6dfa238
+wizard-work/ledger/2026-10-31-wizardwork-census/2026-10-31-wizardwork-census.csv,344856,9a2dbd05034e6d62af94b525d71cb4e6194ba3af50873ef53319553a6ec46609
+wizard-work/ledger/2026-10-31-wizardwork-census/2026-10-31-wizardwork-census.json,396996,839863aa99e4984291c9e2abe3af7235a90330301673315e5306c26a77a9da35
+wizard-work/ledger/2026-10-31-wizardwork-census/2026-10-31-wizardwork-census.md,376862,74ff11ad18404957896f3c40dee778dc40ad2bb3fc58feced64e779eb01fc22b
+wizard-work/ledger/2026-10-31-wizardwork-census/2026-10-31-wizardwork-census.py,4907,42a365000aa4ea10bec06e9709e811b8abd4262f6db964353a9d54edb053335a
+wizard-work/ledger/2026-10-31-wizardwork-census/CHECK,6220,28345764b8dd6aa366de62c9ee2619d025930ad974018e752bc7622c6e7f6878
+wizard-work/ledger/2026-10-31-wizardwork-census/debug_sets.py,767,1b5e07ab4c71637c9ce9b4ea362655e04830ae47e268aa833692d9d14330f7cb
+wizard-work/ledger/2026-10-31-wizardwork-file-census.CHECK,991,41870f7442bdf8842b44a7e1b5100f1590213ebd08c974410b0ba320c8837198
+wizard-work/ledger/2026-10-31-wizardwork-file-census.csv,621170,38308047d1ef7210c69595b2ed187d3cf28e09b03e9471f23412c1b3989fc9c4
+wizard-work/ledger/2026-10-31-wizardwork-file-census.md,829,04e2b5f69c8baa135f662359c3fa2a6fc1900de85c26aae396fee5d1b2b7b211
+wizard-work/ledger/2026-10-31-wizardwork-file-census.py,5179,eaeacd1bce55f4c501242106d61a574a36cbb50645e6ea3381ffa0aba3f0e0b0
+wizard-work/ledger/2026-10-31-workqueue-census/CHECK,6048,764241a183ae7131d2fa6cf97f5be3a6e66968355343705b601d5a8053316f2b
+wizard-work/ledger/2026-10-31-workqueue-census/README.md,1165,c54834017a91979575aee58e3c80e59e0d1e1f6e1d2ba9ad358f8cfc15ab77a0
+wizard-work/ledger/2026-10-31-workqueue-census/build_manifest.py,1897,0a029cdecd69d93e9fee5d7808a09ebfe14b5e6a437d956303afa0ba232dbf6d
+wizard-work/ledger/2026-10-31-workqueue-census/extract_manifest.json,18732,aa3fae6dc21887a7b504e02b1266b02b2385002f4129e32a04aab707891ddeee
+wizard-work/ledger/2026-10-31-workqueue-census/extract_workqueue_census.py,2570,55c4296724a06e8cd1177e1f5d72589ddb055a794aeeb885486d16e9c15f319a
+wizard-work/ledger/2026-10-31-workqueue-census/workqueue-census.tsv,27154,05fe75f2e948f84291fe8ebed75db46bef28ac547fe583019a160117f4ec091f
+wizard-work/ledger/2026-11-01-ledger-dir-census.csv,70598,90bcff7dc11d6949af8cfd9f6350f394e47fa6babdd64ad3ffe7ccae448c2f95
+wizard-work/ledger/2026-11-01-ledger-dir-census.manifest.json,446,0b6bc7b5a91667d8ea94594f5b1117d78662c0a04af0c013f148509201912d84
+wizard-work/ledger/2026-11-01-ledger-dir-census.md,1322,5957e81e2a93cd9fe633f2e0baddf1249229a4f7ae05a832fe2b40fb42c3a813
+wizard-work/ledger/2026-11-01-ledger-profile-config.md,3141,765d092ecdc8f179e7737ce9f5c0535f97755ad22d9d8f440af473adc6def1a2
+wizard-work/ledger/2026-11-01-openmeteo-weather.csv,759,46815b40c28c3227b65cea3cb22a91269094eb77028fcedcc7f76a98ed836008
+wizard-work/ledger/2026-11-01-openmeteo-weather.md,1949,67e2c9f8684ec81f7afdeb61e1b94b545ede11182542b1400d70fe1e6b6963f3
+wizard-work/ledger/2026-11-01-posts-census.csv,716,a89f587ef24dc97e6832f4fc3a1e699971864dca29cf01c8cb7775da251b5c7c
+wizard-work/ledger/2026-11-01-posts-census.json,1991,85b67aec5e29ddd8680b4a1baa002a7657520ed767cc1bda5c5f4f27a0763065
+wizard-work/ledger/2026-11-01-posts-census.md,1014,e7f8a9ecfdfea129490acd46a37ee8f80d4fb9c832504e2fdd59eb48778227ed
+wizard-work/ledger/2026-11-01-queue-register.csv,14767,c436daa25dd5c3b383cfb2bb91b3e1c7ad167ae0f8540fee289b4a468414fd1f
+wizard-work/ledger/2026-11-01-queue-register.md,15672,d666074a78c61c5d226de2d3b569a8abb80b5c7c9959fc14557a195c46ac0292
+wizard-work/ledger/2026-11-01-todo-census/CHECK,234,7f79be87f37983759e4ff30eebc9b88154511cf0065a0f19551b7949b19c105f
+wizard-work/ledger/2026-11-01-todo-census/extract_todo_census.py,3843,77c91a69cc21529efb484561ad8fde03c4c4b8d2502556947243183e2e8cbe2f
+wizard-work/ledger/2026-11-01-todo-census/todo-census-2026-11-01.csv,10026,9ff6c166c16921bdfbb6eeb12d31389df5ee20db91c4ba07ede2bebbb105e78c
+wizard-work/ledger/2026-11-01-todo-census/todo-census-2026-11-01.md,12900,077164d87d6e6afcd3eecc5f22141cd3ac88ab926346dc9f014e26381e37fb9c
+wizard-work/ledger/2026-11-01-todo-census/verify,2410,53b77060da15e19d3c00ea4d85efd66503985deb5ff45254f6772f1fccf9f448
+wizard-work/ledger/2026-11-01-todo-census/verify_todo_census.py,2674,56762d2e0689986aad0e987bf020d5c8f0084ca5b4b535102f1424784e85b245
+wizard-work/ledger/2026-11-01-users-census/CHECK,127,97d56ad7462e3d4b3b092f6504e411a5b45ea849e74e6d027d6fb81730bbe3e1
+wizard-work/ledger/2026-11-01-users-census/build.py,1095,aa07720b3b450710b9921cc4610f7e9679632ea1623fe7100c320cc33f86747f
+wizard-work/ledger/2026-11-01-users-census/raw_users.json,5645,bfba663e2221e5ce0544da02447e8be5e7316e33ae0d5f47e72bdcf270d50ec3
+wizard-work/ledger/2026-11-01-users-census/users.csv,1016,abea612b7a17e54c1ab688c7ef4667f54f278653f7c91e6761f2c10e71e4dbe7
+wizard-work/ledger/2026-11-01-users-census/users.md,1326,e7172d60089ed8ef4089df9bf22e3cdeda994808f168d05bb7e7c993198d641b
+wizard-work/ledger/2026-11-01-users-census/verify_users.py,1012,7c4d6a8ae347d76255c933dfa7503f2d796cc34681028db14c0262e010aabd31
+wizard-work/ledger/2026-11-02-openmeteo-cities/2026-11-02-openmeteo-cities.csv,1500,e754990d284d555706e2c35659bbea31f22e45fa1a42105f83c3b9630ec23678
+wizard-work/ledger/2026-11-02-openmeteo-cities/2026-11-02-openmeteo-cities.json,4800,22732a99eb97e383c6cf3e72d2fdcd601669b8c5ac683deb1bbda0acb04942d1
+wizard-work/ledger/2026-11-02-openmeteo-cities/CHECK-2026-11-02-openmeteo-cities,2249,535c5ae4682ac760a8a2ef7067dd967dac18f767da47ed43ae6570398fa72d66
+wizard-work/ledger/2026-11-02-openmeteo-cities/extract_openmeteo_cities.py,4998,c3c806f4d314ea21bd96af53c395f5b3be7247eb10f408065fee02f8b7a256a1
+wizard-work/ledger/2026-11-02-openmeteo-summary.csv,472,cc63f9c3068b9f6f548518c6b8c2749660b1fa8618b7cca22939f427ebfbc206
+wizard-work/ledger/2026-11-02-workqueue-census/CHECK,960,42502a874ea295c3290cf54c902d8264cd92ed273301746ba9e53cb2a40a81d3
+wizard-work/ledger/2026-11-02-workqueue-census/README.md,3764,6596d26dccd1975947aaf69759a21500e77f079c154865d068f68d3e69d19346
+wizard-work/ledger/2026-11-02-workqueue-census/_probe_manifest.py,408,fadcc44c1d5642a89fdaa50aa88a67555166b0d9370c8cd9ed4ac6c6ce5152f4
+wizard-work/ledger/2026-11-02-workqueue-census/extract_manifest.json,841,3884ca1da63b016700e54d9b0bb8ac6cc17043350794cd785cc0f54c772d969e
+wizard-work/ledger/2026-11-02-workqueue-census/extract_workqueue_census.py,6033,391522ec83587d2c18316a4da08f0ba04c8032ea59f7aa26aedc8fbf480e4da6
+wizard-work/ledger/2026-11-02-workqueue-census/grade_census.py,7643,b8fd72bfb30666af6698ee913e03e140d92b8b964897c0c8e1d376e66b3ebbeb
+wizard-work/ledger/2026-11-02-workqueue-census/probe_census.sh,4881,2b1f9d7677f5f58885537859af5c6d619327dfa204efcaf1cce80b17dc569185
+wizard-work/ledger/2026-11-02-workqueue-census/workqueue-census.tsv,27154,05fe75f2e948f84291fe8ebed75db46bef28ac547fe583019a160117f4ec091f
+wizard-work/ledger/CHECK,308,336ced3ac7d585ffad195ed2f03572178d672ef843dc16d9e6a17a8c0e777977
+wizard-work/ledger/CHECK-2026-10-27-checkin-census,7304,6987cdc22de39a7e399c59aad21d7553b7db52a60f8af844308d20157917a086
+wizard-work/ledger/CHECK-2026-10-29-roster,3501,afcf5a37a98ce9ac50db3635cfa04a9ad6f621dcd8cee2946cda733abbe63f0b
+wizard-work/ledger/CHECK-2026-11-01-openmeteo-weather,2090,2dc7fe032c16e547f14eeecc95a8285ee8190d5c1c76ecb520dca708903791bb
+wizard-work/ledger/CHECK-2026-11-01-posts-census,635,52e41f71820a466186e9e2ca4504121dd4ed9837fdfd50674a70504814948a79
+wizard-work/ledger/CHECK-albums-photo-counts,448,e17cf03a20ca7464d86b414d91c286f1928a60398ded44dda6341e4e5b870ce6
+wizard-work/ledger/CHECK-arxiv-tt20,1713,2ade012581f76d5ca529003c58f6a5fddb0f86a5bd41bedba4f90f1216ea174d
+wizard-work/ledger/CHECK-checkin-census,1395,cf1379b74fea8cb12515fb4f6c080c0a75ebc66bafb4e7594d27653d96965e5e
+wizard-work/ledger/CHECK-commit-census,1928,a9683696b1958e4e3372201c7a4e58a46e85379bfcb26468ca08d720c26ec86a
+wizard-work/ledger/CHECK-commit-census-2026-10-27,2100,eabc1c96036295532ac0af878822168541e5d5c8e45b4d5f9117e5dad5c8d8f9
+wizard-work/ledger/CHECK-commit-census-as-of-HEAD,553,95f835c6e4e3d641219baad5d85509be60275c06da18142fe641f0e10d95822f
+wizard-work/ledger/CHECK-commits-census,624,73b1e724d9c4a0f21b2280d8c32e5254ab034da374a2ba365b606df843e1397e
+wizard-work/ledger/CHECK-file-tree-census,3066,59bdb74bc99f66adbc5144f61e598a13e7275df65fffd67a4e1cf15441f95e19
+wizard-work/ledger/CHECK-git-history,4327,261c7bdce0ad74839adfba1f7f83384ce01f166d12397e3b7491003803163b2f
+wizard-work/ledger/CHECK-git-worktree-census-2026-10-30,3795,c0c4413c6d5fb779fcd911a91a93bce786bb24daf599da4556ace4b6f2c2b379
+wizard-work/ledger/CHECK-ledger-q-census,894,9d1db15b1054d45bac278941ae0cbb34a82aa7db1fab82f49336611de194656b
+wizard-work/ledger/CHECK-live-wizard-roster-2026-10-29,14111,6b2eb181c1c4fce02084e20eb72e39234d57e2bb0de0dfd8cdef21384979caad
+wizard-work/ledger/CHECK-troupe-tree-census,3696,fc33c4ccce8275fb5f1a6f453cf8e5e6046e066f6153e415bddee1926aaf950b
+wizard-work/ledger/CHECK-wizard-roster-2026-10-29,449,c8999825a981d947ad1def0147f992801d6dc43c7e0645889b6cabcc49bfc9b1
+wizard-work/ledger/CHECK-wizard-work-census-2026-11-01,4710,5abe7e81a91118f73b118f3fa7005166175ed6f69cca6444788e9c918e204115
+wizard-work/ledger/CHECK-wizards,590,aa28e5908092299629f222a3553d96a2342769a13eb941949d5cacfb0877d2a8
+wizard-work/ledger/CHECK-workqueue-census,825,704ca0eb91cf4b7e5326f7a4cd9bddfa4d0e9b78951a9d8a3e0a5df655d8ee99
+wizard-work/ledger/CHECK.py,2158,01324778efd3f396b23ae534c0f001dd38a7ea68a951ee7abef828ebe9ccebcd
+wizard-work/ledger/CK_check_cron_fleet.py,594,68b8a90703ab1b876eb782f90e48d7c34aecae8d8cd18ff8ff2c4bdf1957d6ae
+wizard-work/ledger/GDP-per-capita-usd-provenance.md,899,c4cd0b4c315330921600b826f75761fd03c36a6841b038dfd8fe8d68f2e16cd7
+wizard-work/ledger/METADATA.md,426,aed0a75e803d46e33d4888e6f854a57a270dabdd51f6a984c3bca26c9b13834b
+wizard-work/ledger/README-arxiv-tt20.md,1449,1d444bf41af3f68103d59d1adede83495252353d5fa10867d379abdd9d8eeee3
+wizard-work/ledger/README-census-2026-11-01.md,852,aaa25b729d5a08d69594838c3b25eebb23ddb9eb7f6829709dc5129b80a576a1
+wizard-work/ledger/README-commit-census.md,1532,406e88114b3358f848ffd50b589dfbda79444a98735774310aa3e0e71575113d
+wizard-work/ledger/README-commits-census.md,1649,b60ee0e12c551759f8748240b2fd899d4d52d89f59b139fc48b3a4b574f18201
+wizard-work/ledger/README-csai-10.md,1778,8f6b28293ba1a24a3dc9b628e5a844e2351f7f4aadc19e5d71048daa23c0632e
+wizard-work/ledger/README-file-tree-census.md,2004,78add1cba733bc57a4e57f338cc01b525c6212ecf94f95f54610fee5677f90f2
+wizard-work/ledger/README-gdp-nominal-2026.md,982,e8796b0778bf6930030086d54c143423d2a72bc82b4d7809fafd662acbe43b17
+wizard-work/ledger/README-git-worktree-census.md,1767,fda9fcf78b34dd3b917bf61ec16de9e59237636d7ff9dc7b94bac8f2f6cdb305
+wizard-work/ledger/README-github-python-repos.md,2250,066a92a2f5b8658499a31b84ebf7032f05aee2fffcc5025e510c3e00189ccb30
+wizard-work/ledger/README-live-roster.md,961,2911ee1a8fe89e77a063dd0d8cdb33baf60d95a7db873619d98e5a30772b425a
+wizard-work/ledger/README.md,656,26454a27480b0d2e8ef151a9aad25de93fe31bae2caf12f4be8f78ffa31e71bd
+wizard-work/ledger/SOURCE.md,318,34c0d33b59b4f8cb5e1a57df65b2439d6b772d701b8256e3383f93e042704eba
+wizard-work/ledger/USERS-extraction.md,2223,f81b3de6a9a046919cb333282c8aca04e9333dec9c30ffe5367a517c583dacae
+wizard-work/ledger/_probe_counts.py,1279,f549bf238f8f1697880c05c7a24fe32e1b2d09ce14bad980c7e5cd40c8aabbf3
+wizard-work/ledger/api-endpoints.csv,5501,b8e65ac2a5234e3f69a4be803edc54e18412278c341c5dfa82a20ced900c870c
+wizard-work/ledger/api_endpoints.json,10465,3794f9ab0bf733a81498f0f75a183f1980b12c1ce55d71c457fe7a0c903b2ef8
+wizard-work/ledger/area-by-state.csv,48,6c0583eca2f9a4cb2867211496a5b99a64ad5ba34013270498220798e357a026
+wizard-work/ledger/arxiv-catalog-2026-10-30.csv,11140,cc50479444047f7e90ebb382cc8a29875730d6d69cb377ddb8d2672119ad73e6
+wizard-work/ledger/arxiv-catalog-2026-10-30.json,28689,bfa291c219c654b5458b409d67ed627f0385a931c9dc49d53b1c218640e17963
+wizard-work/ledger/arxiv-catalog-2026-10-30.md,5426,88e37a5cd3fbcd18f8a9b71729c25d3a83c48c6611fe7a26b783e3deb20e1b63
+wizard-work/ledger/arxiv-csai-10.csv,4969,fcf748fd2c4e0108ea3c18c8cacd2dd44b667535d63f3af96b2c9ed0a7781147
+wizard-work/ledger/arxiv-csai-10.json,13884,09a3b40bd7e87a6e5766bbe309e2a6cb07f70500f8374ffdc93c8082dcb3fe45
+wizard-work/ledger/arxiv-csai-10.md,2162,b9231f215e68b05a07e75b3699764f336ced598df6c8dd607487ab8af438ecbc
+wizard-work/ledger/arxiv-csai-fresh-2026-10-23.csv,4966,47dd772c66308cd4d64c0f1123fb25abecdd045213c294756b458e1c92d5f313
+wizard-work/ledger/arxiv-csai-fresh-2026-10-23.json,6443,fceeff5e2aff0c0c16ee55d1e760d32574d09c2c5a8ebb59f42b7c8ccd115cf4
+wizard-work/ledger/arxiv-csai-fresh-2026-10-23.md,3294,c4edbc00ad87a1cda98a04a7e97d726b31cf2e18e8ef289fdce7c0f2b266f63d
+wizard-work/ledger/arxiv-csai-fresh-2026-10-28.json,27604,5a29437d01ac979a1a05676906f9f7d5e033f88d8f72904ab3ff5c1ca36603cd
+wizard-work/ledger/arxiv-csai-fresh-2026-10-28.md,4182,9a63b996477b3aae5fe496d194d178e371dd5124f466aee8c76f36e6e95bb548
+wizard-work/ledger/arxiv-csai-fresh-2026-10-28.tsv,3629,930dc2a8340d6a4092d5cffeb3db2d2459c739524e6fd6766eb7f2905fc1b93f
+wizard-work/ledger/arxiv-csai-latest-20.csv,10081,ddd70b00c66eaec12f11450712ba34f6b9f3dd99e72725a79f83cc39aad032dd
+wizard-work/ledger/arxiv-csai-latest-20.json,13165,ace346ec5bfdd198f7eaeca1361cbdec9c9c3702eaf4a3acd8f035da4d2ba08d
+wizard-work/ledger/arxiv-csai-latest-20.md,10892,f168f1ac053c1a5d0c4a89a1821d172768ef181895ea14ce6300879a574fa045
+wizard-work/ledger/arxiv-grpo-top8.md,2132,fd5317e150aa221ae38ea89ed9020750076821850a0c44629e5559416172d09a
+wizard-work/ledger/arxiv-grpo-top8.rows.json,14326,68d07a4ebaa75066a33f705a5fb5f5b745654f5e7c3204130605a521ee8eb1ee
+wizard-work/ledger/arxiv-lg-extract-notes.md,1459,de4410a3991a44727e45c2be5ec6f165c4cdbcfc17b9bc7f4e68aca288214db2
+wizard-work/ledger/arxiv-lg-extraction-2026-10-20.md,1525,dfddd3f13bda5387a82aa6ada460b20b4a350f39c7cff35ee08b5f25cbb36504
+wizard-work/ledger/arxiv-lg-fresh.py,2892,e6e7704ee8b947a1b54f52b0e1e40182bb700ab82e4969fa3ced31587c45c035
+wizard-work/ledger/arxiv-lg-recent.csv,33633,5ab0b77769f23731a3b18cbc5373144d598ce0841c29f143f73dcc9ea1d99009
+wizard-work/ledger/arxiv-lg-recent.json,35535,a224f866c6efbe9783c0dda3cbdeb863ebf7f15fcef6c63ca84a2e52136aaec0
+wizard-work/ledger/arxiv-lg-recent.md,33842,9d29fa71fa4701d6b75d2f9d28a5ccc785f673fa425c0824aa1eda119c38f660
+wizard-work/ledger/arxiv-papers.csv,18502,cd5d8c8f29a01f2eb4b07a0e66cc53ac3e727420724b869b60602675904b29b7
+wizard-work/ledger/arxiv-papers.md,3996,f2ce212945ad3e15ea595664f11062cb613bbd01fd825ff7e81b48a03f3bb214
+wizard-work/ledger/arxiv-recent.csv,25284,2a4c4d36e5c54a504e605b73e571af8acd36231974e511ef7f611328eb7171ef
+wizard-work/ledger/arxiv-tt20.csv,5009,777c0d5e1e7f34925b9044bd28bcb86bcaa4d78219d202d042fcf63782173d7f
+wizard-work/ledger/arxiv-tt20.json,10885,192eb6299eaebc6835f41cffbad90db0c7f970a207371fd78ff4216ba3aa4103
+wizard-work/ledger/arxiv-tt20.md,6584,d9f01202835ea572a35b9abbe6d1f6464e0fe5806fb085bf640238cf572f065c
+wizard-work/ledger/arxiv15.xml,35448,a3d231fde316a59946ae75017d620b55f2919f8ea9802b8d4be675a4b6452681
+wizard-work/ledger/arxiv_csai_recent.csv,26239,f29d0144bff7560ea51978981b67a9247e260bfdb75a5ad7e54eac14b514d771
+wizard-work/ledger/arxiv_csai_recent.md,2734,175219c8491dd91858a98b73d5f5515eb215223e12501e957a3134db1855f133
+wizard-work/ledger/arxiv_gnn.csv,6341,5011c0ece292f7adb25391fa356ebb9dbe569f07d1e0ca2dc742f9967fffd7b5
+wizard-work/ledger/arxiv_long_context.csv,3453,8edf1658b57e1ff8b43393b05183c117ced9afa540287317bab7235ad30794e9
+wizard-work/ledger/arxiv_long_context.md,3832,d5566ac70a2fc67f33ebd19400b48e3bd8d2ba1df068bb6f5c0408d65e9d8ed7
+wizard-work/ledger/arxiv_long_context_extractor.py,1923,f4e502f5db2f2805ccd9224fa4883071ef20c779684a6c45f12999ebb5c90b9f
+wizard-work/ledger/arxiv_recent_cslg.csv,3324,0d052bfb137af758163c06192dec7cccb33aa04ed35d6834a637e4d53c06d137
+wizard-work/ledger/arxiv_recent_cslg.md,4109,55ae6a3b324625a8ba07a0f4a07609736c6cf042852325a6ee2d89b265a349fb
+wizard-work/ledger/arxiv_titles.csv,576,2612bd028bd3d40956d8b0a51e44b3134f839355193744248863679afd477cbf
+wizard-work/ledger/build_2026-10-31_git_author_census.py,5847,e6c171a71f6acd7aea62a8048e9dc0e954dea09259a40558006413e393af1ef5
+wizard-work/ledger/build_2026-10-31_ledger_dir_census.py,1074,d2e9902674b153e0bd5a07905a8f4c0397fb300d0a20f4c439fb49d461361218
+wizard-work/ledger/build_census_md.py,967,d33104864dde401cb1ca50b0adf47560dca8583a19c4d9ae2727eea8a1441fde
+wizard-work/ledger/build_dir_census.py,1275,1d16fddbe00464d1a93c5c05ae4aa2b09264facfa2ba46abb7b729bf4e4acc11
+wizard-work/ledger/build_gdp_nominal_usd.py,2560,e0576cb864ede73519ad819108d1faad9a7c6492758e463440f6c201362edac0
+wizard-work/ledger/build_ledger_census.py,5508,80242f012b6ded65e115aa126131211c5b3eee8e2293b340a113687b74f72e01
+wizard-work/ledger/build_live_roster.py,7692,a6fc41a13560d4a5d5fbab00385a2bc408f382c3d08561dd71d460b5ac5ce599
+wizard-work/ledger/build_posts_census.py,2934,30d81615c6670075558bf606c16efefc215b51cc10eb81a1b8abe4be0e4357e9
+wizard-work/ledger/build_profile_census.py,1531,173cde9f6c874c5d33d96bc4da09bb194cd7dbfe5d76f14a42cfb8936be50adc
+wizard-work/ledger/build_roster.py,1896,9ce4e23138dd7b8291c5f4efbed5d11eb8ee804f97fcde566face7f6fb740c8a
+wizard-work/ledger/build_stackchain_catalog.py,6858,6cabeed8e036738bf89ebe4c958bd768e4c7fe961ccf5dfcd315a7ce8dc34a8c
+wizard-work/ledger/build_tracked_files.py,4215,93757a987db623a9064c4e9097c0eb93a2f69d7ca225036f76bafc278c9fdd0d
+wizard-work/ledger/catalog.csv,841,3a26bcaa739a5a6a5f18d8befe6603b58060a9cbdae785de74fcb60678d4e207
+wizard-work/ledger/catalog.json,1418,f5881669390349119728c7e370874af8ba397f53474229ca45aeb206f1b473db
+wizard-work/ledger/catalog.md,969,bd01aada8ace7778a27e6ea3dc23f5eb5ac691700cde8aea088823c19e595efb
+wizard-work/ledger/census.py,2124,fbde3a3be801d338586b791d8aad8f3ed8eeb06489b1d31d0f81a0c39a5744ea
+wizard-work/ledger/census_check.py,3774,1bc2bc1c58abc73b56eb42ec2a5d3a939a4b3a070c08616d67e008bb8dd6f5eb
+wizard-work/ledger/census_data.json,8426,7658a91fdac69a93896816fa62429dec3150521f78b79d5cbbfe236b82cd915d
+wizard-work/ledger/check.sh,278,773f6f1260446b03b241992149f607888d8aef6f65c1cf4cc14ed4bfd60a2e72
+wizard-work/ledger/check_2026-11-01-commit-census,5355,00f6ee4a9a496a5a75905032e5603591831c40e751c89e5ccd29ab33227d01f8
+wizard-work/ledger/check_arxiv_catalog.py,2858,c77c2b2b2e523f5ef35d79148ecec54aab9c2dccc309f3e90dfb5934d51711d3
+wizard-work/ledger/check_gdp_nominal.py,2741,3e804a849b15352dede2abccb43144d461402e5de92b484bcb304dad0c1bde1a
+wizard-work/ledger/check_git_author_census.py,5825,b790cd225844c91727020f8202a1584b0e9cfece83084db6f7ccb2630088c8f4
+wizard-work/ledger/check_iso3.py,2351,621668c5234402526802fb3b9a523adf79ddd5a6f3fd2a292ff319d1e48f0b36
+wizard-work/ledger/check_ledger.py,3637,85fdfe0ba9c03f276a892c3219b59500159c29c4a8e89b231ef00dd93ec4ce3a
+wizard-work/ledger/check_ledger_extract.py,2667,72c7519a8ce88e89a16ac470ff348e8ce9efb5eb155ce6389b31e76f242f6838
+wizard-work/ledger/check_live_roster.py,3982,860bc4348fdbb6f17a3cbe666198e9e3f95974b8a1a8fb1841375aea49649207
+wizard-work/ledger/check_queue_extract.py,5210,3ec96d1c2585fdf9ae2838c3b84c0aa528b16ede773d1824def4a2441ec04580
+wizard-work/ledger/check_recoveries_index.py,3902,f5e9d2576f18dac9cb2933f190c894b6422d40bf70b3d46e4bff28558cd55b56
+wizard-work/ledger/check_roster.py,2780,f6ca41cfea466455cab37daa8d88ec43196a94a9ad9d91c87ddaa66d8a3762e2
+wizard-work/ledger/check_workqueue_qcensus.py,5535,199b3858a4c06fc25dad921508aa11b3fb3e4902e2a6a5402bb18feff8820d6c
+wizard-work/ledger/checkin-cadence.tsv,1463,3d97221f16d4e12acb10705a6d63b551ed31fff1a35521ebf7798f2680376084
+wizard-work/ledger/checkin-census-2026-10-27.md,2420,41e65200f207315020732486c023745a1ef93fcc911897ecdc8c68efad78e94c
+wizard-work/ledger/checkin-census-2026-10-27.tsv,4237,876407f856d7c615273a4dfe57587561c72aa54c0b9cd4871f2689c6f09e0a52
+wizard-work/ledger/checkin-census.csv,4471,3417d67250291428ce7bd781000206c1f82361da4b563eb24ccbaf2149cfdb4d
+wizard-work/ledger/checkin-census.md,2709,dd1bf7c985b4c7a94d656192baf50b4571b71d246db50571f7e11f17f6bc9dcc
+wizard-work/ledger/checkin-census.tsv,74,fd023ee3fe4886781b70898e96c3f7186773eee7d8970b3d139dde8d1c14f1b7
+wizard-work/ledger/checkin-inventory.csv,5452,6293f60ede932289fcfff369c8a283cdd9c62e222cdda25565a0d189582e4b20
+wizard-work/ledger/checkin_inventory_verify.py,2845,e369dcdb658edf225410935beb2bb62c617f47b8be7632e639213598a19516f2
+wizard-work/ledger/commits-by-day.csv,604,cbef4a4535336aaec744b8527e513b98122c3e174f536169961f0784c60e2c48
+wizard-work/ledger/commits-census.csv,313,4a334b4ae6c731aead5fd0c7638d03dc9276b009c8fdca625aee50bc8d9393e3
+wizard-work/ledger/commits-full.csv,925933,fa5aace4be942cc7931a003a90d15902f07e15bc3c9ece35767f687b7a8eda83
+wizard-work/ledger/commits-table-feed-2026-10-25.json,30412,6694f5ac198d1fd6b162dbaa794a1286151933e635357ed1a00a64931c00d452
+wizard-work/ledger/commits-table.md,923,8dbfd19a6b42f71ae9298d52bb61656755074aca57d0e50854f6ce1f246ba438
+wizard-work/ledger/commits.json,8359,ab9b17b959dcc4422368ecc44bd46413f4d70114bfecd5f62b1ec81116ecbd08
+wizard-work/ledger/commits.md,4105,02b8c9ecd189ab91b38d3634ca675e74f24b51e7a8447ac169bfc28b0779a1c1
+wizard-work/ledger/commits.tsv,4267,167a837f9bc0f535105c0ce4ed12161b93881ede6f2e672b3a9d8cf8ee08c128
+wizard-work/ledger/commits_by_author_day.csv,3337,08426481aa06392652be6ede1ac92ef6a53e649fec71ced29242ae81045f7cfa
+wizard-work/ledger/commits_by_author_day.json,11073,b00b468953eaf6ea923b00daf39722605f1e9811c22e7c54899236f8bd9cadb8
+wizard-work/ledger/commits_detail.tsv,1789,81425689e6bc147962fd11174876f516d10f1f49933de6dff0b4b22a04d38d71
+wizard-work/ledger/contributors.csv,465,7f7bfa988414291cf46de3c9e0086cbbc5999c04660ba31ac55275e156da2c4e
+wizard-work/ledger/countries-table-2026-11-02.csv,23611,b02d074aa7964ba1e130e7cd1faee596449b435a724e5789e3b40655ceefd2df
+wizard-work/ledger/countries-table-2026-11-02.md,28738,d1f7801351afec1dcc57eb07ff89188ae89faf93620f8c6851c0ef54f9ac8642
+wizard-work/ledger/country-area-2026-10-23.csv,25993,a8ff3ebb5da154e98f35f54c703b64b24fe375c1692bb374eab3fb99a36e83e1
+wizard-work/ledger/country-area-2026-10-23.json,71221,8350770ffe8295a5ac6f783e8f4551b844d56298743845460fd9f04388cce85d
+wizard-work/ledger/country-area-2026-10-23.md,15910,60114c0ba46bdc0fd10b01ccf721b10c943a6afcdb76e19b2d182b271a7b1978
+wizard-work/ledger/cron-fleet-jobs-2026-10-26.csv,31383,e6c62374e38f9d0b7d9e5deee0b593d8348391125066692185c75adbbb23b5b2
+wizard-work/ledger/cron-fleet-jobs-2026-10-26.json,55941,a61ea55327d5621ae81abc6d80c76027ab844cc80fdf57e0a55dabe59bddd3ee
+wizard-work/ledger/cron-fleet-jobs-2026-10-26.md,33968,b490f85b59f904e5396bdbe9c73528ad08f3467b579df1236263f541e9ddc081
+wizard-work/ledger/diag.py,2546,8daca55298d0f21d23c66e13ad6df44c309bd8e3889c0e901feb5374df649567
+wizard-work/ledger/diag2.py,2099,452b2c2074d5bb4e61e78cbeacb1c9f9682f3c91fc64633fa60ad46c421491bf
+wizard-work/ledger/diag3.py,812,43204d2c0d8fe52907043279ce67f4f683f53734ba418588fd78126f1c08e729
+wizard-work/ledger/drops-catalog.csv,1892,0536827b3ac3fb78bf7144662c724f43ea764ba33559e21efb6aab5ea900609c
+wizard-work/ledger/drops-catalog.md,3322,e36486d8bc377e820602e946544f216bc70a89d2a701e0f2f327a8f8d69f2e45
+wizard-work/ledger/drops-catalog.py,5383,78a98bfc419962162fc3fb626f461dfdd1225ac6e23cbd6e4faf88c4dc823ad1
+wizard-work/ledger/ext-census.md,1775,2a858d5366cb336dd4a86357b3455e595bb158dd234ec7a689e1ffa999ae1425
+wizard-work/ledger/ext-census.tsv,295,6288352e31a9f80de0913886c833214e0d8fc604b3f5de970169d9ecdd478c6f
+wizard-work/ledger/extract_albums_photo_counts.py,2482,15ef7a2dcfbf277cc2497ddd5393ffb9c6b2eb2a7dc2f79c96ed365aa2b01eff
+wizard-work/ledger/extract_area_table.py,6970,f22b116dbc8769e3146c5bddbbbed8bdbfe0628ed100fb583161a9efbf53effe
+wizard-work/ledger/extract_arxiv_csai_fresh.py,4317,f656f17b99478f4e65324abc92df36a62fb45d49bd3fb4d99c960494f17c80d7
+wizard-work/ledger/extract_catalog.py,2299,3be084aa7bd3c398d718ae644d9b9fb038cac176e0c09bbfa10f7e0cbe2efaca
+wizard-work/ledger/extract_checkin_census.py,3862,fecce9984275dee1427b0e9275586e2094baf7e16f9166258c73e1f7589cc13e
+wizard-work/ledger/extract_checkin_census_2026-10-27.py,8283,7a531e51626b80dcf1eccedaef87306c5f15c7714b5ea4c9551044e93dc99cb1
+wizard-work/ledger/extract_commits_census.py,4189,66174d562ad88e69afe8629c56f1345e5c8f9f78c72b381a1e1e31c04cde0d57
+wizard-work/ledger/extract_gdp_per_capita.py,3973,6b12549c3b3e2c0d88bd33d9ba8fa9cdd85f03339991c3baf314b978eb833ae1
+wizard-work/ledger/extract_git_history.py,5097,0fcf0b43529a9270d9b2382f565b64c70d70dcc66866c931f9034a26974ed9a5
+wizard-work/ledger/extract_git_history_live.py,7247,2eec1e40f11564a103c02f6496ece431ee8914aabeafc3b96ccfd7f37956aeda
+wizard-work/ledger/extract_git_tree_manifest.py,3814,ee63f2ffb20be3531adc72373ba1d5b87e783b7d2f11bb54b12febc0d0bcb8d2
+wizard-work/ledger/extract_git_tree_manifest_2026_10_30.py,4227,cd3ea60be7e671f2e5b4e5ce42de68584964756d392588a640321e6939573917
+wizard-work/ledger/extract_git_worktree_census.py,10658,0da85b23179107ede79c6470dc93cc6cb263e288632dac6c6fe5a7e841860057
+wizard-work/ledger/extract_gitea_repos.py,4890,080df17cbc3f72c4352a17d49007c601ed2778e7d2d624355434e877ea677c38
+wizard-work/ledger/extract_github_python_repos.py,6517,cce7bce7594275f40de7582eb87282d65830714e4806312ea436ed2c8c6fcfac
+wizard-work/ledger/extract_iso3.py,3100,6f4e4b3520cc8a525d983b2c69cb006216147ffb97e6411ef303ccc421f933f1
+wizard-work/ledger/extract_jpv_users.py,2542,f4752e44765a528a2fb96053a7dc39a26ada86d24f279f9bb871430d174c4fee
+wizard-work/ledger/extract_live_wizard_roster.py,8773,89874bdd1aaa727b54406dab96d7b2995dede5140aece8044b599fa447eed815
+wizard-work/ledger/extract_openmeteo_weather.py,4396,6501a1ca99029cc09243f380148910ade7b2bcc221d7cc8da3093f46320d7572
+wizard-work/ledger/extract_replies_catalog.py,1486,76236cb249debc85b2ad93ab50cd9d62f1a280cfc6790917abbfe644e958a6cb
+wizard-work/ledger/extract_replies_index.py,3816,2f1929d0da7eac10e811dfe03b5b2a0e259260dacc84aa7dba1a05d58ee0ecab
+wizard-work/ledger/extract_reply_volume_census.py,7228,bc3c2e1c209f1d42b3b0517bb906e7ed5d36d72b769ab721f92990dd5020e66f
+wizard-work/ledger/extract_roster.py,3739,228613e53b81b16714b8ba91afea67c36840b69a20c1895f237f5f17fe75caa6
+wizard-work/ledger/extract_tlds.py,1601,532c5bbdab95403a4e8d56d29f16e8d81b7d514f65f78681255fa79f4d8774f7
+wizard-work/ledger/extract_un_member_states.py,2650,7010bdcc7a1183ffb9839249d9e88ad99341c0b50adf0aa06c5855da66802ca4
+wizard-work/ledger/extract_users.py,2892,6a39ae90fbe0b2921fc1fc87c57705df980729b2c46a3630ededeb10eb804d09
+wizard-work/ledger/extract_wizard_roster.py,4106,8f2036ec082036834567abfbb8aaded6c55e59a5ed49cd691c79297958fef96b
+wizard-work/ledger/extract_wizard_work_census_2026_11_01.py,3655,68e8c5ae209f4c50a5b1157d8398b991c1887901748183ad1433ab7f5b36eba3
+wizard-work/ledger/extract_wizards.py,8975,b541689ca931b8cb8663616d53b3388a92d7e335905d6920b64eea8108b1e3a5
+wizard-work/ledger/extract_wizardwork_census.py,6516,e99f572fab654529de6e25fcabedffc31d398079115a06d54829745253e896c3
+wizard-work/ledger/extract_workflow.py,5293,cb61f72de2a9d0c0634775b7d3278b44045c49d9632586cc21cf4e6ff7b0ee4e
+wizard-work/ledger/extract_workqueue_census.py,2028,27d2c9a8577404d9fa7df1799ca82c85cdbfd73a6e915085a4a778c630dfe242
+wizard-work/ledger/extraction-verification.md,4748,d0522435b08f683868a65e53ba48f60b0c1756944e54ace9e1902fcc4c11c29a
+wizard-work/ledger/find_headers.py,272,242d47d24ebbe8b2ecdf31667f68fe5ea68c2faed0aa6c25a93c2282739bbce5
+wizard-work/ledger/gdp-per-capita.csv,399,cffa03508db53eef8668b91fddd3af44defa1357b16b441308fc27e9f7688cc5
+wizard-work/ledger/gdp-per-capita.json,734,99278bb0720cfb2283aef03060afb798ec7708955232acf0c0aac4984853750f
+wizard-work/ledger/gdp-per-capita.md,663,365303bd51fff00c3d9720e76177b72284f214dc9263467675692403cef68a7f
+wizard-work/ledger/gdp-us-states-2026-10-23/extraction_manifest.json,448,7e179a85afdf9962f5cbfae5066fcf10510103aed2fa93b21399976baf3bd95c
+wizard-work/ledger/gdp-us-states-2026-10-23/gdp-us-states-2026-10-23.csv,4812,d10f28020dea2a34c9d48c7b7b361104f2da9cf9e40ab779f37cc4f931f91e42
+wizard-work/ledger/gdp-us-states-2026-10-23/gdp-us-states-2026-10-23.json,22753,b14888a10616b4014de8263a724e1ef0ae080f1c4541c913a8c7b9e7428685fd
+wizard-work/ledger/gdp-us-states-2026-10-23/gdp-us-states-2026-10-23.md,5646,d0dc6984cd0308f6ed9b1faae273d2ea3b39e85067c9f36f3391ddfc1104b6a7
+wizard-work/ledger/gdp-us-states-2026-10-23/verify.py,5820,308a21575580da4650976551dab6e6e2e5cf2143dd6927db07d6a6aaa93b122d
+wizard-work/ledger/gdp_nominal.csv,8774,48e876a40c2dc24226ffa8216d053f5c2d1003df91a63d2817982950ff1caaef
+wizard-work/ledger/gdp_nominal_2026.csv,6226,5ed4a36b12d13f1bd889cf914f946b3fd2d6d0371808051b9dccec962b645bc3
+wizard-work/ledger/gdp_nominal_by_imf_wb_un.csv,8795,8cb77877a5811d53a9cb5d48eaa61172987ccafd32b83bb386bc7b3dde74b688
+wizard-work/ledger/gdp_nominal_by_imf_wb_un.md,9638,43045513f6b246d94d460f4f8d3ba1a6b694c80ef3c14f559857d27ee245c407
+wizard-work/ledger/gdp_nominal_usd_2023.csv,568,169e505d4ec12ff61b26acd8de0991420d24cb8cfe9c3e30ebebe66ecbb235db
+wizard-work/ledger/gdp_nominal_usd_2023.json,56363,5227859ff1eae177a5fcd74e24b0123faae565efb5831a0065a7d89306072ac0
+wizard-work/ledger/gdp_nominal_usd_2023.md,968,c104bb8641a73aacb4e931ae64992554efdfe60bd58303afe921449221f02f6e
+wizard-work/ledger/gdp_per_capita_usd.csv,6070,18a08cdbcdb9a3d37942169f799e1701a0bbd854ef151f4d7566ce9a44e91ddc
+wizard-work/ledger/gdp_top10_2026.csv,434,a8897f1089d64ba34c42068bb50d9323dbab2e59848d7ae8ed754975d4d82270
+wizard-work/ledger/gdp_top10_2026.json,1897,5edd01679934be0ad64b5aadd22fa8871ed2cd6a2c48c31f53fecf32ae433877
+wizard-work/ledger/gen_manifest.py,1041,a24a46f755d44365d5a33074f46294584ea7ac2f3b02ae1dc638b1b7479efce2
+wizard-work/ledger/generate_ledger_extract.py,2017,a4abb1d312bf756b539cc3748dab438275a242db2e09918fb2081a6099cca27d
+wizard-work/ledger/git-author-census-2026-10-23.CHECK,2850,cf745bd43a45a5e15fb5881164591ec4792b9968d1566190502f12c4ee03bce3
+wizard-work/ledger/git-author-census-2026-10-23.csv,3611,5fba7be7abd237f83a870c79192e44bb7cf4fc344e2e0b80fba1657e5a48d961
+wizard-work/ledger/git-author-census-2026-10-23.json,9802,a39cfc566b203a022e092507c0351dfe6f3189327663a6811f673a29454ae312
+wizard-work/ledger/git-author-census-2026-10-23.md,5677,ffcd5b252556045af6afe84087e9fac89f9a3c24efdd3c5a04cf4e104e69c0ea
+wizard-work/ledger/git-author-census.md,5711,21861c75c0c7b9859865dcd9d8025deb18be030aef2ec7e9cbde5ec8205052d9
+wizard-work/ledger/git-worktree-census-2026-10-30.csv,2269,0dc62714e6bfe77972cf5785e41755dbc284c4f3d6cc7580f3c5e857401f1075
+wizard-work/ledger/git-worktree-census-2026-10-30.json,15244,c9334aa176f078f4a4505e225ab86f4217116c564a2fc559d13a2355eccfc56a
+wizard-work/ledger/git-worktree-census-2026-10-30.md,8646,c7efc8def3382a1632690010a43eb0c77b6b12c7cffb427e73dcbcf8441e3d83
+wizard-work/ledger/gitea-repos-2026-10-21.csv,2955,79e554f451dc5bb8fc61e5cc7994cf33fe40e76731b33c851b31b8439d9fb624
+wizard-work/ledger/gitea-repos-2026-10-21.json,28010,9bea5fae651a5b90b870e75a0c9fbde9381c852a7adb02be877bf39168965059
+wizard-work/ledger/gitea-repos-2026-10-21.md,2625,654edad1bc75eee79217b28d39fa640e3bd88863e40c7cadf9d41f6af745677d
+wizard-work/ledger/github-issues-freecodecamp.csv,1559,2f0aa51709b2a7515c36d677bbce643dad05c4519e2aec7fc8553df2111e9292
+wizard-work/ledger/github-python-repos-2026-10-23.csv,42250,c0db3b62a3ebdcbaeeb7bba54378e0efebd73384b950eed042fb5096d4acba21
+wizard-work/ledger/github-python-repos-2026-10-23.json,67658,20126ec49fe1355dd4d1b5b1068d0f4069a6ebbac6d5b142e823f15bc89754c6
+wizard-work/ledger/github-python-repos-2026-10-23.md,24924,3c4cddac4f808331d86a5f2c9d69563b8523d4a47caf105e43d5489c9592b03a
+wizard-work/ledger/github_repos_stars.csv,20832,0b54dacfb855b9df6f5d247fb3d072621c897fbb4719872cf0a37050d5794536
+wizard-work/ledger/github_repos_stars.json,36973,1a71e30ae08eff1cf0a04a4c06943d3e1c44729ed6033da3b57554f630b8967d
+wizard-work/ledger/github_repos_stars.md5,57,bcc54afacfd7b44949ef5c78c13ed4d03646d264274f3675a63fc72892a826f4
+wizard-work/ledger/grade_posts_census.py,8503,56bd90193cc90f8d1694f845eaf55b533b3ba2c1ab9dc17dd63c022bdfc77461
+wizard-work/ledger/hn_top_stories.csv,1588,0f24d05c9f34ee3e62540f787b2039e3bfbaa604251c3eb2a13e94955f2d6cec
+wizard-work/ledger/inspect_checkins.py,319,0e48e04a9e339d649e856dda4a80848f13c9720c0b5db371feb6924985057e5f
+wizard-work/ledger/iso3_README.md,1635,d97c4541df1d155a53595cca6503e5593d5c8dd7d9b63165c7a22350cf712f04
+wizard-work/ledger/iso3_alpha3.csv,4365,354929394a45d2d3f254036885d574e1f1bccfb42adb7c378f83aaa2b7670cad
+wizard-work/ledger/iso3_alpha3.json,16271,76c2ee65b1c35a02f5629c21ed04517f9a95ed5da17d5a860048a95fa2b1f33b
+wizard-work/ledger/iso3_alpha3.md,5733,b2f9fc543f57f0f949b444b8f824e6c68e240d99ccc7cbb9127a0b1cf7d18132
+wizard-work/ledger/iso3_codes.txt,1044,3b1bca596c6c87416f162beb92264a1ea0ea75fead0d721575cf35f1fe88e2fe
+wizard-work/ledger/issues-source.json,127442,1bbafb2d5c309fbcf97ac9f2ccde38aa91c087634ba2f47df2b6643fb2ce74c4
+wizard-work/ledger/issues.csv,65364,b2d9deb1ec5cd10367352d37962b6fdce1cc703577653b2325588818c805894d
+wizard-work/ledger/issues.md,68045,c28d2dd43a661b95de96fb4247e38a6f0914cdf28689d7f2118225c7ff3e4487
+wizard-work/ledger/ledger-census-2026-10-28.csv,21990,78fa1131250a363fcf51cb0a5bca63b30fe16a74f583032d5a4e92652e23fb07
+wizard-work/ledger/ledger-census-2026-10-28.json,52066,d1ff5d37cb7ae5a94ecc413100dac743921a6f9924276a7e93c0fbc0b739dbf1
+wizard-work/ledger/ledger-census-2026-10-28.md,24671,0de06caee55e0b7bba6d093df643d8eaf43698d789868982a7a64fc2f7826b9a
+wizard-work/ledger/ledger-extract.tsv,160205,b90e9cd223a46907932be77892ceb6208067d4ee91c2be0c809b26220797e207
+wizard-work/ledger/ledger-file-inventory.tsv,609554,c6a87bf09ee776be9be8365e66ac80400e6636c5bf70ddd32c1d69582adfe5d4
+wizard-work/ledger/ledger-skill-registry.md,9263,0ecd05af4c2fa512c45bacce7f3c18b73a419dd5ca3071b4462b93381bbb0f34
+wizard-work/ledger/ledger-tracked-files.csv,481001,41300bb0816c23fc51e118cb289123758e29a8eedbd7a326a08ffd1e625d6704
+wizard-work/ledger/ledger-tracked-files.md,490,a49444f45bd238d0d3e04491b15d74a1347ee2726a9f4256a5add5911dee03ea
+wizard-work/ledger/live-wizard-roster-2026-10-29.csv,132235,34cd9769c2e469ebd6b48034a9c7dddfa519c39a31989fff1c48bbb4422206d5
+wizard-work/ledger/live-wizard-roster-2026-10-29.json,3207,9bf0cb2aae9af1b9d40d8b8829449053a8484c0be666cc296f5e54deebe6ce17
+wizard-work/ledger/live-wizard-roster-2026-10-29.md,2202,a28a645dc9beef33dff601faf17379c854f346db35a767c0f4780f377839d3c1
+wizard-work/ledger/live-wizard-roster-2026-10-29.tsv,1826,2a8ae7019c6339beef2a053a288f58918784307ee68ae7d3440d872eaa282c3f
+wizard-work/ledger/live-wizard-roster.json,2847,747ee0499a871ca466a5ebd9f2c699375e08f93262c71a8fbb527a13b0120031
+wizard-work/ledger/live-wizard-roster.md,1862,317f97db5f5f003e82ec35ed232ea02299e18f1a87f7068ce68d9058dcb39550
+wizard-work/ledger/live-wizard-roster.tsv,1528,31c87b19680bfed5cc73e780678e36420370d1a3d7e9de1fc3d9e59d7782c376
+wizard-work/ledger/make_arxiv_csv.py,2653,20cfb7ea3f2b09c456eeedc6e4a611eb4605a81fbdb70c67de6934da321a86d2
+wizard-work/ledger/openmeteo-source-2026-11-01.json,2420,c574f554f6d10a4802aa86b7fee44e0f177471339ead2d047fc5c92167c48946
+wizard-work/ledger/openmeteo-weather.csv,242,28b39e20737e726ab820bec9f1ad50f9602f1c50df727174c16d862df1feb1b5
+wizard-work/ledger/planets.csv,457,2193ff1c687abeb769e6ee473f5512f3342055ea7a926ece9291f322393aba86
+wizard-work/ledger/planets.md,1319,65982cfeebbccd8c1c216e605df96b6474d4b3845a7eddb8df21270a104b588e
+wizard-work/ledger/probe.py,2033,77e7a6b3967116235c13b85af268fa01799275d18f59b011c96e4dd572e358fe
+wizard-work/ledger/probe2.py,1909,01ed322c0f55c447a83271b4d1547bb5d9dd7725cb04f396d50da7eb6ccc23e2
+wizard-work/ledger/probe_posts_census.sh,2360,d462450787776dc1d51cd6638260bf442d42a5ec9cf2a5b2dcd1239e2efb5484
+wizard-work/ledger/profiles-census.csv,412,671ddfb4337b1bcf5fcbc505b67824a91cbb9b8438cbdd9ee3bfbcfbc9d99d5a
+wizard-work/ledger/python_org_repos_top50.csv,5728,cf20273ac3062cba14344ba7ed6f999d63df3b16bda179e44e74c075c24ceee4
+wizard-work/ledger/q-census.csv,725445,938c7c753d3927c50f3d1256d3cf8466b2baa0f2ac8cc5f02b07dd620fae9904
+wizard-work/ledger/q-census.md,43432,d4b881da23e91e69121510c6cda42d0baf6638bcc4462e8263560e51750f5508
+wizard-work/ledger/queue-extract.csv,47202,8911e97a488ac76ab3cf2d53686aa64e75a3920d8c4d74e66471449f385805a4
+wizard-work/ledger/queue-extract.md,30208,c81f2753001f35efcabf9f1a4729afdd5c3a89177abd5c835e5c5db959f057cb
+wizard-work/ledger/queue-extract.py,7668,03d3a981c4ae66ae950ce5e4b522cfd8b4ae802f39a991500551072574ed8c0d
+wizard-work/ledger/queue-extracted.tsv,120396,d16fd2ecf9abd4d771f116f77328c1eabb067bb47a713b0fda183e2059ddcab7
+wizard-work/ledger/raw_contributors.json,10805,1eddc6f9be6d74c980fb40562e800c395781ab68e006d5f366f6c41f0732f1db
+wizard-work/ledger/react-issues.csv,13963,8de3bd49d31baab0808596d7447b23851f9ca028f7d1b5012f77488d37ffe87e
+wizard-work/ledger/recoveries-index.csv,8890,b50fbabb3363ea1e949d3b921690e3f8e9b57ff9ba6b5f5237d96770c939277f
+wizard-work/ledger/recoveries-index.md,11030,7e226875fb965d10ca363261be4aecf647e4f9993be8ae95b87592532754e5b5
+wizard-work/ledger/replies-catalog-2026-11-02.md,8744,ab9162aba8d2a8c7dc19bb9c07130ac358d2c8c721038aae2df0734d53421bf7
+wizard-work/ledger/replies-catalog-2026-11-02.tsv,24006,4c32ff80b224aff10b6b6c8fd95b99a7a1519d2fd560ff2a21188f7458507bf8
+wizard-work/ledger/replies-catalog.tsv,35167,2b3ed066b76b96b43c1d9ea5896993cb164a316d4545e38007bbf63d33dc8858
+wizard-work/ledger/reply-volume-by-recipient.tsv,187,f0a85ad325e1ac21e73d26a2fc009a9cc21616b7cca95fbf3eba82152ac82014
+wizard-work/ledger/reply-volume-census.md,2387,41a05c832a504933855469e4d1c1c67730eb58efb8e10ac1347942416da5d168
+wizard-work/ledger/reply-volume-census.tsv,480,c154010c2d429a2b61011c925d7dd75ba324a0b6af10db1e14d14a70c28e0632
+wizard-work/ledger/repo-2026-11-01-commit-census.json,3888,e6c560bc33c5466e15b329712e2789acb4b3888cb9e93adff4996b817f0e20af
+wizard-work/ledger/repo-2026-11-01-commit-census.py,5031,93bd3b23b341079a52b33b094ff9c85c51f0a8601719af5020b5e4622466881a
+wizard-work/ledger/repo-2026-11-01-commit-census.tsv,3027,30ca0cb7d22d7ad73a4ed15d32d1a9fbe3a81fa4a1748d69fc09a5e12e339764
+wizard-work/ledger/repo_exts.tsv,338,c442c841a0db95d376876e7b2a2c19cec2536b153294183d0bca9d6fb8b541f1
+wizard-work/ledger/repo_files.tsv,206778,8e6a87f7f5f0d13cb873c2b383401a36cbd9cf90954eac58b41216dfdf4400ea
+wizard-work/ledger/repo_tree.tsv,8138,352423e46b965828c87c70a4a21c42b5c65926b176eca0ae99257ee3683b8aad
+wizard-work/ledger/repos.csv,1605,bc7497a9bad25546c36f5dd42eeb88dba97fd21d63116f9ab0ddb493c45b3440
+wizard-work/ledger/repos.json,3000,56a9309eebbf71bcee9d4c4b43b5a46647b65a8833ccb757820bc74688108059
+wizard-work/ledger/repos.md,1907,004c7e691542355cd25f547c8c93bb3df7b3cac7604bf7e1e27a07eed5d0f68b
+wizard-work/ledger/roster-summary.json,7222,22fb86675cda589068255b56efeb1f25b1868f32b11821930c544cd9558ca09c
+wizard-work/ledger/skill_metadata.csv,16194,584072290b0bed5a266558cd19e18f94ad2a0dd8bd3ae1d928c691e595efa0f7
+wizard-work/ledger/skill_metadata.jsonl,22670,4362da3aecb24008937bd37a9f4d065a9e6d4a6c49a3345e19d84c92ab56e2a2
+wizard-work/ledger/skill_metadata.md,13055,c1d511715f35518e8ba75403eeb52ff0d5c9080f7afcd33eda16faf2dc1d0a4a
+wizard-work/ledger/skills.md,5470,90a02efa5d061ca40d2e59eb92d110d0971dc82c64c999139130ea5884dbd14c
+wizard-work/ledger/source/coins_raw.json,7881,0d9a227578e6e6adc96a3e7758c9211506a898ebcf401a20442d17db6895d379
+wizard-work/ledger/source_manifest.txt,7206,9b789e16fc61571434033337965988dcde5929a1459e2125db211379c925e719
+wizard-work/ledger/src.md,397,f9e5c520324e28ac40d9b694e68c586b3d81380e1d3848247b8d699ec3ee70d2
+wizard-work/ledger/stackchain-catalog.md,2476,6bb79a8235319ed86657bb234923f476d3fa6b2de6a1e3cd07a2f4141699480e
+wizard-work/ledger/stackchain-catalog.rows.json,9279,331b8ac1b3b014097082b9d6beffa997125cf19024b61cff6c5c4027db408776
+wizard-work/ledger/stackchain_catalog.csv,2920,995f107368aac9877669485efe9e02f0889cece11d3318c5926e0b741e42e5fe
+wizard-work/ledger/stackchain_catalog.json,6646,b4c847d4b061220eac1c42382634bbd157083d400d90b2968ec488624c83d9b4
+wizard-work/ledger/stackchain_catalog.md,5962,bbdae0a3f2637a9cf181b3dfbbf415635c48299ffd65554164cbf1c08a6f73c5
+wizard-work/ledger/stackchain_catalog_table.csv,1510,435cb741dcd1ec50e424d37dc6a1ae946909527731a4b49c9f5f7d21572cd9d7
+wizard-work/ledger/summary.txt,699,eff47e5b27153ff6c72fd72cee63d7f5cb803c9f398b1ec7730e5f32ed69fee1
+wizard-work/ledger/test_scratch_manifest.py,2235,e374eee3dfd7152332ba3b67241f8dd97e6ae966f79855ef5ee8d44310f002a3
+wizard-work/ledger/test_verify_wizards.py,8195,3d6faf8cfb756ac4aeeb12f1cf4dd0cada51a1b0744cad625dd9d9e4620ae42e
+wizard-work/ledger/tlds-alpha-by-domain.txt,9528,b5c212c638c3db9c3bc4db16853cb5acaf4d66f9cbbb4baad658acdb049b311a
+wizard-work/ledger/tlds.csv,15432,b097ce915e4d509b214a36d4aad667b2c93c0f6e1aca5bc2a790c85babaa01ef
+wizard-work/ledger/tlds_by_letter.tsv,131,aed25a865b378d7bfccdd153133e824d13f22b3246736f1ba9775d50e68741b4
+wizard-work/ledger/top-50-repos-by-stars/README.md,5740,6b3a4248f32104d984b0cfb446150f39d447fc4121b4c6b933407f68920099e4
+wizard-work/ledger/top-50-repos-by-stars/repos.csv,8651,20f7842d4ea09f2a080f7da6dc39619995b08aabb383be8d95d5ed2e282c475d
+wizard-work/ledger/top-50-repos-by-stars/repos.json,15475,d219af49cc6422c384d0729febf5ca13d1644bae2d1c7485a9b1d3eb4ae0a64b
+wizard-work/ledger/top-50-repos-by-stars/repos.md,9579,8cabf18fc3e24c74bb201bdf8d14abd24d237204ae7f21f3b6cd17909035f977
+wizard-work/ledger/top-50-repos-by-stars/verify.py,2726,e54ab9e3044b4945247619746e3715f1269f240eca013489718353f465b1a30b
+wizard-work/ledger/top-cryptocurrencies.csv,2496,e2cae66fa7112e1b0f1a467385d3ee7b53393c12c99c7f7900d5a1494512f094
+wizard-work/ledger/top-cryptocurrencies.md,1199,e80f2ab1ef80b9a38ed34f6b39832a34ad13021f3d26512c7bc3b3437540484e
+wizard-work/ledger/top-python-repos-2026-10-26.csv,22949,3428fcc099c75e82837e47c71508a5766f7d97e449b6736b89d3c7d552acfdd9
+wizard-work/ledger/top-python-repos-2026-10-26.json,334810,4efb084774edab33759c980405f5e8df1b00d9c2cf45ed15ea7c1d61fb4cc3a5
+wizard-work/ledger/troupe-census.csv,9866,9418ce6169c738f076f0bf50378f3121582a38dcea6ee1170cfe794a45cd9205
+wizard-work/ledger/troupe-census.md,3692,111b8661ed9dd7e1c1b84e3be1fe6bcd79bda40b771a4d0bc7ef54cf7f87f3db
+wizard-work/ledger/troupe-churn.md,5768,d482acec69be5df117237be3fa46fe1e878ddf6b035317e837caa21f31be9e9b
+wizard-work/ledger/troupe-tree-census-2026-11-02.csv,293,e8c1e240fc4d47c1d2879243daeae20da43e5a2a3f2fe6d57ba555e166c94e3b
+wizard-work/ledger/troupe-tree-census-2026-11-02.md,1194,464a364b68bb404ca5e2e8aa1e3d718b92a79622686e83c000b3a2f2f7e32d48
+wizard-work/ledger/troupe_tree_census_2026_11_02.py,4353,eb60fd7156a1af4f3f25523366c75d3a9b8fbf98e3bbb1c4ff162a0df159d018
+wizard-work/ledger/un_member_states.csv,7606,6e29ff2f0d3be7f310c409e309296f14a15c255d27dfcbb5fd7ec260fc7ca692
+wizard-work/ledger/un_member_states.json,25504,f2b408f71982df816b48eca177f9cdeecd2783f2893a4d87b67eeba040f08d21
+wizard-work/ledger/us-gdp-nominal-annual-2018-2025.csv,259,05bac6ce271768e9722751bf088f8b68527749cd8dcc1cacd5b96adf601094d8
+wizard-work/ledger/users-activity.json,2401,1c282d9c716fa6beb0ed5ace9567e1b78648ce5ff9aa269f1f694faf4040b217
+wizard-work/ledger/users-census.csv,767,0d6302e6944794e2913ea9f017d9808ee55b30c78d1d591f60b3a61dafd82592
+wizard-work/ledger/users-census.md,1069,8d455ec54cf63b9334a24c53205d98b26e2af488a23d917882f0223185a16a8e
+wizard-work/ledger/verification-notes.md,1138,706c642d9b7015b12c20b871691880d183f139caeea06b9a82308bf40e3fa3ed
+wizard-work/ledger/verify.py,2487,aad8a1f8cb666d163b184292e4c74b3c3de98e64cef58a396ea85c455d08cfa9
+wizard-work/ledger/verify.sh,248,2d050138cec6bda50d68e77abd9765e00c470a5c5c4ce33b07baf478f05ef50c
+wizard-work/ledger/verify_2026_11_02_openmeteo_summary.py,2803,29548c39c0718af6f760e052f3af705316f1ffe65b3e4829abc25a14db09ada0
+wizard-work/ledger/verify_albums_photo_counts.py,3161,73edc5d6e4e706ffe36a2e49d5b2895fead402b4d749dacaa94fd05feaeb5371
+wizard-work/ledger/verify_artifact.py,1840,a9040442ace20815031330c4c490716395a2cc62ec264a197e9fc1a0b621b6fe
+wizard-work/ledger/verify_arxiv_csai.py,3897,55ab7d8bba0d8b9959852a7a527d76d6ca8d62c14cca01ce9cb00222614af853
+wizard-work/ledger/verify_arxiv_csai_fresh.py,3203,c17040c5195601fdb7549744874ed3155dfa0d77c94f5f0ce5fb5fc57a889d42
+wizard-work/ledger/verify_arxiv_csv.py,1589,7047684a0bcff5fc05ab268d1267cb712383d9fd07843cb3644511f70e83512c
+wizard-work/ledger/verify_arxiv_fresh.py,2730,dc6d17487fa6c1326b33cfb365c7557b9148a3bc45c4a12a54448c48ad02d7dd
+wizard-work/ledger/verify_arxiv_llm_agents_top15.py,2648,91008068f53b69924a195dba5090400ad521260f652a993a07e8427340ec1a86
+wizard-work/ledger/verify_catalog.py,3950,b39468ecfc925ce31361a6eb25993126e336af0972c964788d2601acec5b6f40
+wizard-work/ledger/verify_census.py,1716,cff845eea72c326d2b864aec4f2ebbe29cf3dc16144dd5fd4aa70574767ed9ce
+wizard-work/ledger/verify_commits_by_author_day.py,2618,6158b1014c022a7f99cb03d8e57e2482621d17ddfef2ded10735c49a31f8afe8
+wizard-work/ledger/verify_commits_census.py,3941,ac25280698f44425acbd54aed62fa1c379068902310dd3aab97d4f243b75623b
+wizard-work/ledger/verify_commits_check.py,4452,bdcd542d9db31e86f3760ad53706026c51f713a0a81a8d5b4baaa8dd17922366
+wizard-work/ledger/verify_commits_table.py,15452,d531a2c366c3a0e73421edd61f79db41645ba81b06377c13cf43f628a0180797
+wizard-work/ledger/verify_dates.py,1172,717e81b33a0fd231d5d2f99630b8afa70d5093087ac964e14086fc56357c1277
+wizard-work/ledger/verify_drops_catalog.py,4328,ac8c2eea997b2fee1806a460dfa5afe1c94054b3d3ef4865abc0429dc20a7723
+wizard-work/ledger/verify_gdp.py,1695,ef34bfeed33951fcff40a62483e8d3f51c3c4de8bdfb859ae78967c22b981632
+wizard-work/ledger/verify_gdp_artifact.py,821,44419f158393808039e8dc1fcfb5c11ace0876e6b8363c56bb22b8dbe2370ebc
+wizard-work/ledger/verify_gdp_per_capita.py,2604,5eb11103202381c5100fa7ff860ddaa42351e3729a780d4473f900321a54336d
+wizard-work/ledger/verify_git_tree_manifest_2026_10_30.py,3294,c7318874e9137a4a5413c6a9bd223a708b397ca9b567066cfe1db4eb1070b543
+wizard-work/ledger/verify_gitea_repos.py,4117,53319f4ce72708bc938443a5905c102f9e9a87fb096c1008c253d27592a8c496
+wizard-work/ledger/verify_github_python_repos.py,4938,51451e7fb328386349a2256c7407953b2444acc8e37779d3fc07dfe03e4eb138
+wizard-work/ledger/verify_github_repos.py,5994,29720c9b21ffec1602e483f04a6ea8e7413907c696a5ec3b84626af94f86f35a
+wizard-work/ledger/verify_issues.py,2795,2392acdcaa195bbd29647239a30951ba2dda8157669d0433e6e47b81ab3f1d51
+wizard-work/ledger/verify_issues_csv.py,922,efaca0c0c8c1963eef6104139c2887ee6b6921b22bd56bbdc78bb062553bfffe
+wizard-work/ledger/verify_ledger_census.py,6527,eaf5948375118e4679799962c6c6680605112aede5d73bfe1074c20c74fdcf17
+wizard-work/ledger/verify_ledger_dir_census.py,20017,35e9eec688d9ce12d2260f030e6b5308168086001b8e635bbbc4aca5f7c07d5b
+wizard-work/ledger/verify_ledger_dir_census_2026_11_01.py,17854,36e01bd73de80365f4eacf92875d98b95cf2246386309075e9972139181e9b1b
+wizard-work/ledger/verify_profile_census.py,2475,8117f6faa2c65bf286b60266180116530a3cabec91cfcf4145939e1e4a524c51
+wizard-work/ledger/verify_python_org_repos.py,3574,d4b54fb916cb44a70b4a46fccd42cfaed988c3a59ba1ac444f2134affa4798b7
+wizard-work/ledger/verify_replies_catalog.py,1924,e6e009994de217e782ea310679fa96bc4a23d23599d4ab585f2c3158302d3449
+wizard-work/ledger/verify_replies_index_2026-11-02.py,2866,bcaf1430d7b4c035e7f8fec3330e726cc8e7fff0a8745e9e0d3860367c288766
+wizard-work/ledger/verify_reply_volume_census.py,4328,a7ff77226fed80fd4695e7a70572030380e956d2eccc22727a0dc9463a5c823a
+wizard-work/ledger/verify_skill_catalog.py,7771,0771cec3ca2652c4b20c923bf72f445a2c7f551708a817989f0f8549e487ddee
+wizard-work/ledger/verify_stackchain_catalog.py,5744,9d662eaa75064019634cdbe4baabb2e3880ba559a7c6072ad1c4e825c32438c7
+wizard-work/ledger/verify_tree_census.py,3612,8ecabf20c1779b4398e0abc61ac7f95d8fb853bed48bbf9313c6a4391ef57fea
+wizard-work/ledger/verify_users.py,1954,f2b8b1cb7965a35e8b69788c6ad13a71733e1f7e35b256e6e8bbf40e0d83d63a
+wizard-work/ledger/verify_wizard_roster_2026-10-29.py,5106,b8f432eddc1cd40d001085057cf7113d3cbca586fb0def983bca8d4c024dfcb7
+wizard-work/ledger/verify_wizard_work_census_2026_11_02.py,3260,7213eebc8c90fe121f7b90e0bbe5336b1ecc5326d24827388b346bdb1340b475
+wizard-work/ledger/verify_wizards.py,13966,465de88bb39b7941227b010a64cd5741fcc1c52c40d4e21f929ad31fc34f02f2
+wizard-work/ledger/verify_wizards.sh,432,2d997be230cd5a837373f4a3e55e0bb193d5cbebf79eb3c1e60d402bde1830a0
+wizard-work/ledger/verify_workflow.py,1824,b741576dd6995ba8f712789cdf2d690657d5a9427066fec17f2689c1dfdd8c8a
+wizard-work/ledger/weather_fetch.py,1038,5850b85524a89387bb8c136ea3369ae01abf22c845b237ac3ad60308bdcd7f66
+wizard-work/ledger/wizard-roster.csv,4767,beb1ff57ea4e2921f8f4bf040bda7f2b962c9bdef4f6766cb3598f89c714f988
+wizard-work/ledger/wizard-work-census-2026-10-27.md,1391,f6719d9c8ee706866672a2c6addd45a32f026fc5e2caf504fa0bedddb74c4f3b
+wizard-work/ledger/wizard-work-census-2026-10-27.tsv,208,7aafe143456d4cc0dc16785736cb8b08898f57352f8593e073541bf8744ce19f
+wizard-work/ledger/wizard-work-census-2026-11-01.csv,283364,ec82566bdfcf2376b5fd6e101ce464f0dd1b1feebceab9eae271dec4311987e8
+wizard-work/ledger/wizard-work-census-2026-11-01.json,494876,4bfe645f9ff2633fe0fb4c6788dd4366533168ca769837e04277760a1e2d1bce
+wizard-work/ledger/wizard-work-census-2026-11-02.csv,290844,3a3b3620a5b7e2854a5535325ab3c8fbf46540a9663e1a75fb42220d24ba1ed9
+wizard-work/ledger/wizard-work-census-2026-11-02.json,508447,ef875f574a08c38477a00ce8aa9c3385750edc9e0feab7a56956506e2fb58324
+wizard-work/ledger/wizard-work-census-2026-11-02.py,1424,416e3212fa0b06142715664d2c29e55e560e0ffc0d708ab222a14c4469699510
+wizard-work/ledger/wizard_inventory.csv,990,a4fd00ee3e8a1399db35e43f854542c0f6f4633b0ba66143a0926f62c659b4a0
+wizard-work/ledger/wizard_inventory.json,1812,89afbd233962a9c2cf0a94a64f3b883c203dbddc9e62596c063f8e60fd3a8607
+wizard-work/ledger/wizard_work_census.py,2550,fcae0ae8385f6e0632a96ba97b00b6158a437472b022a0dfd2b6ec4d7eee8dd2
+wizard-work/ledger/wizards-notebook.md,2813,cf32da6cce294bb3fbaba5d45cca439665fdbe25d9c8835741dca25ac128010c
+wizard-work/ledger/wizards-roster-2026-10-25.csv,1775,4a378ebbaeeca81b008df386c6132412f2c272baad098a4666dc93dd4f1ca578
+wizard-work/ledger/wizards.csv,6278,d899a23be01ec74ea37db0636250c57d3fab435405a31e2466ff252cdfc1f441
+wizard-work/ledger/wizards.manifest.json,1153,f683201d5af9d299133cb8f3e1247f7ce44d0448dcc7a6d19c411ef0e1d382c4
+wizard-work/ledger/wizardwork-census.csv,240446,b9c7094222acb7dd1acdba04c2d99b272568754957e8c7251df34d63b0559635
+wizard-work/ledger/wizardwork-census.md,922,51707e72ab9a8f3aa6d632791937179cbd6a6f56cbe34831561db66c2a1ebd93
+wizard-work/ledger/wizardwork-census.tsv,270131,dd4dc9ec87b480f1ca9763acca88e9262e2b0c3fdb5ee7fc928a7b7299f9f5bf
+wizard-work/ledger/wizardwork-file-manifest.tsv,270259,6d74dca762d2231f1808606f54440cff10e77664b8ae743104435caa8514234e
+wizard-work/ledger/work-queue-table.md,17901,d0e3c86f3613c8066540228db6fda69f330c967588a2018efa6c3d7e376a55ad
+wizard-work/ledger/workflow.md,7629,3dea22a6fee4f06b15e11dbe976f87cab097211cfbd154680614df62696ca3cf
+wizard-work/ledger/workflow.tsv,6442,311eeffd7c4829694361be495f9475511e86b8ef33e4f5f0c145927dff84c8a4
+wizard-work/ledger/workqueue-census-v2/CHECK,19275,55b9ad5dd7cd13741307ead3877472c2eb7ca45dc1b966b68f214edf9165d19f
+wizard-work/ledger/workqueue-census-v2/README.md,7401,bb86624bd09d68dd0bfebd96b5908c9d43a927a936ceb50a06b92753f2eda752
+wizard-work/ledger/workqueue-census-v2/extract_manifest.json,859,c5b7fe12b3a0860480ffed92fad3c9f54dcbfa4791aa3fcade7484c259ed8007
+wizard-work/ledger/workqueue-census-v2/extract_workqueue.py,10615,4cec4267839b0e9c8abf78304fa1cf443aa232785c051f96484a07e7c96264f1
+wizard-work/ledger/workqueue-census-v2/workqueue-census.md,47784,586fa13a98892b5d3921e97320bc713c4c45cb3794f26745344e1ec515f40f37
+wizard-work/ledger/workqueue-census-v2/workqueue-census.tsv,46515,1274a066dbe97fe0ec1ec243919495c5c605c5b2b0eba58bc2319fa675a43b31
+wizard-work/ledger/workqueue-census/CHECK,2591,cc04dd8f6d318057cac6402a5147fcc34edb3eed8940cfdfa7bf6bfb7935aaae
+wizard-work/ledger/workqueue-census/README.md,2561,4c454dbe196307e74f60554d527a5067cda1d3b724f7b9fc6e5e84c9ce96542c
+wizard-work/ledger/workqueue-census/check_dash.py,691,cd912b49447684523d3b2b65116adbc4e19826796e119d50e122f32284118867
+wizard-work/ledger/workqueue-census/extract_workqueue_census.py,2523,b5114289446e31ef3edbc77aa3667d545a0d8092b5e7464cede8854172e356ac
+wizard-work/ledger/workqueue-census/manifest.json,549,cecf50ce21b5e0d76eb2e1379aface65aea5b375b0f174b5e20b11e119050d57
+wizard-work/ledger/workqueue-census/verify_workqueue_census.py,21531,dd35dfc0f6ad5435c237ce3f901d421053cafe7158f271cc6d172ebb9687f318
+wizard-work/ledger/workqueue-census/workqueue-census.md,46452,ec47304f05ace91db6487f7f73c303aad9051b91b9760096f35d607a9a90fb57
+wizard-work/ledger/workqueue-census/workqueue-census.tsv,45219,dcdc3c2aac92708e57fae922debad04119553d810d72af0014995481b99a7dda
+wizard-work/ledger/workqueue-q-census.md,31581,fa29f3f961d72dd4fe10ecaafbbfac97d3f6052f479c4ef4ef96e1b44e819351
+wizard-work/ledger/workqueue-q-census.tsv,31229,784a8898e644a73c3e184111f284d43914f3d8f81643cb8114fb86ba504ab9a6

wizard-work/ledger/2026-11-02-ledger-dir-census.manifest.json

@@ -0,0 +1,13 @@
+{
+  "artifact": "2026-11-02-ledger-dir-census.csv",
+  "generated_by": "extract_ledger_census_2026_11_02.py 9466cd736622fdd0960c64865d363467fea876dd",
+  "population": "tracked blobs under wizard-work/ledger at rev, self-excluded (the CSV and this manifest)",
+  "rev": "9466cd736622fdd0960c64865d363467fea876dd",
+  "rev_subject": "quill: draft quill-cli README artifact",
+  "rows": 681,
+  "schema": [
+    "rel_path",
+    "size_bytes",
+    "sha256"
+  ]
+}

wizard-work/ledger/2026-11-02-ledger-dir-census.md

@@ -0,0 +1,42 @@
+# ledger directory census — 2026-11-02
+
+Censused population: `wizard-work/ledger/` as tracked by git at pin
+`9466cd736622fdd0960c64865d363467fea876dd` (subject commit: "quill: draft
+quill-cli README artifact").
+
+## What this is
+
+A re-derivable table of every tracked blob under `wizard-work/ledger/` at the
+pinned rev, one row per file:
+
+| column | meaning |
+| --- | --- |
+| `rel_path` | path relative to the repository root |
+| `size_bytes` | byte length of the blob content |
+| `sha256` | sha256 of the blob content |
+
+## How it is produced
+
+1. `git ls-tree -r -l -z <rev> -- wizard-work/ledger` lists the tracked blobs.
+2. One `git cat-file --batch` over all those shas returns the byte-exact
+   content.
+3. `sha256` is computed over each blob's bytes; the rows are sorted by
+   `rel_path`.
+
+Nothing is read from the working tree, so a clean clone reproduces the same
+rows.
+
+## Files
+
+| file | role |
+| --- | --- |
+| `2026-11-02-ledger-dir-census.csv` | the table (see above) |
+| `2026-11-02-ledger-dir-census.manifest.json` | pins the rev, schema and row count |
+| `extract_ledger_census_2026_11_02.py` | deterministic extractor (CSV + manifest) |
+| `CHECK-ledger-dir-census-2026-11-02` | re-derives from the pinned rev and compares |
+
+## Verdict
+
+`CHECK-ledger-dir-census-2026-11-02` exits 0. Verified against itself (681
+committed rows vs 681 rows derived from the pinned rev: 0 drift, 0 extra,
+0 missing).

wizard-work/ledger/2026-11-02-wizard-handle-census.csv

@@ -0,0 +1,20 @@
+handle,commit_count
+timmy,766
+ledger,335
+volt,309
+spark,240
+beam,156
+zephyrus-sparkborn,156
+sol,142
+quill,122
+merlin,118
+forge,62
+sphinx,32
+null,28
+mercury,22
+pipe,18
+troupe-pipe,6
+argus,4
+cassian-assayborn,3
+sentinel,2
+rockachopa,1

wizard-work/ledger/2026-11-02-wizard-handle-census.manifest.json

@@ -0,0 +1,9 @@
+{
+  "pin_rev": "70f51f2272b15da6cae37788ee1eaba5cb7d6354",
+  "row_count": 19,
+  "schema": {
+    "handle": "str",
+    "commit_count": "int"
+  },
+  "derived_from": "git log --format=%an <pin_rev>"
+}

wizard-work/ledger/2026-11-02-wizard-handle-census.md

@@ -0,0 +1,29 @@
+# wizard handle census — 2026-11-02
+
+**Pin:** `70f51f2272b15da6cae37788ee1eaba5cb7d6354` (HEAD of `troupe-standup`).
+
+Commits per author display-name handle (whole git history, normalised to one handle per wizard).
+
+| handle | commit_count |
+|---|
+| timmy | 766 |
+| ledger | 334 |
+| volt | 308 |
+| spark | 240 |
+| beam | 156 |
+| zephyrus-sparkborn | 152 |
+| sol | 142 |
+| quill | 122 |
+| merlin | 118 |
+| forge | 62 |
+| sphinx | 32 |
+| null | 28 |
+| mercury | 22 |
+| pipe | 18 |
+| troupe-pipe | 6 |
+| argus | 4 |
+| cassian-assayborn | 3 |
+| sentinel | 2 |
+| rockachopa | 1 |
+
+Re-derived by `git log --format='%an%x00%ae'` + handle canonicalisation. No network, no fabrication.

wizard-work/ledger/2026-11-03-commit-census/commits-by-author.tsv

@@ -0,0 +1,25 @@
+author	email	commits
+Timmy	timmy@stackchain.ai	558
+ledger	ledger@agents.invalid	349
+spark	spark@agents.invalid	240
+timmy	timmy@alexandrewswhitestone.com	209
+Volt	volt@troupe.local	195
+beam	beam@agents.invalid	164
+sol	sol@agents.invalid	148
+Zephyrus Sparkborn	zephyrus-sparkborn@agents.invalid	142
+quill	quill@agents.invalid	128
+volt	volt@troupe.local	120
+Merlin	merlin@agents.invalid	118
+forge	forge@agents.invalid	62
+sphinx	sphinx@agents.invalid	32
+null	null@agents.invalid	28
+Mercury	mercury@agents.invalid	22
+pipe	pipe@localhost	18
+zephyrus-sparkborn	zephyrus-sparkborn@agents.invalid	14
+Cassian Assayborn	cassian@agents.invalid	7
+troupe-pipe	pipe@agents.invalid	6
+argus	argus@troupe	3
+Sentinel	sentinel@troupe.local	1
+sentinel	sentinel@troupe-standup.internal	1
+Argus	argus@agents.invalid	1
+rockachopa	alexpaynex@gmail.com	1

wizard-work/ledger/2026-11-03-commit-census/manifest.json

@@ -0,0 +1,18 @@
+{
+  "task": "git-commit-census-main",
+  "source_repo": "troupe-standup.git",
+  "source_branch": "main",
+  "commit_count": 2567,
+  "rows": 2567,
+  "columns": [
+    "hash",
+    "short",
+    "author",
+    "email",
+    "date",
+    "subject"
+  ],
+  "generated_at": "2026-11-03T00:00:00Z",
+  "method": "git log main minus census metadata commits; unit-separated records",
+  "source_path": "/root/troupe-standup"
+}

wizard-work/ledger/2026-11-03-commit-census/verify.py

@@ -0,0 +1,87 @@
+#!/usr/bin/env python3
+"""Independent verification for the troupe-standup commit census artifact.
+
+Cross-checks the artifact against git:
+  1. internal consistency (summary <-> detail, manifest <-> rows),
+  2. every commit hash in commits-main.tsv resolves to a real git commit,
+  3. per-author counts in commits-by-author.tsv match a recomputation
+     from git, excluding census metadata commits.
+Exit 0 only on full match.
+"""
+import subprocess, sys, os, json
+from collections import Counter
+
+OUT = "/root/.hermes/wizard-outputs/ledger"
+REPO = "/root/troupe-standup"
+
+def git(*args):
+    return subprocess.run(["git","-C",REPO]+list(args), capture_output=True, text=True, check=True).stdout
+
+def fail(msg):
+    print("FAIL:", msg)
+    sys.exit(1)
+
+if not os.path.exists(os.path.join(OUT,"commits-by-author.tsv")) or not os.path.exists(os.path.join(OUT,"commits-main.tsv")) or not os.path.exists(os.path.join(OUT,"manifest.json")):
+    fail("missing artifact file")
+
+actual = {}
+with open(os.path.join(OUT,"commits-by-author.tsv")) as f:
+    header = f.readline().rstrip("\n")
+    if header != "author\temail\tcommits":
+        fail("bad author header")
+    for line in f:
+        line = line.rstrip("\n")
+        if not line:
+            continue
+        p = line.split("\t")
+        if len(p) != 3:
+            fail("bad author row: %r" % line)
+        actual[p[0]] = (p[1], int(p[2]))
+
+detail_count = 0
+detail_by_author = Counter()
+with open(os.path.join(OUT,"commits-main.tsv")) as f:
+    header = f.readline().rstrip("\n")
+    if header != "hash\tshort\tauthor\temail\tdate\tsubject":
+        fail("bad commits header")
+    for line in f:
+        line = line.rstrip("\n")
+        if not line:
+            continue
+        parts = line.split("\t")
+        if len(parts) != 6:
+            fail("bad commits row: %r" % line)
+        h = parts[0]
+        r = subprocess.run(["git","-C",REPO,"rev-parse","--verify",h], capture_output=True, text=True)
+        if r.returncode != 0:
+            fail("invalid commit hash in artifact: %r" % h)
+        detail_count += 1
+        detail_by_author[parts[2]] += 1
+
+if detail_count != sum(v[1] for v in actual.values()):
+    fail("detail rows=%d != summary commits=%d" % (detail_count, sum(v[1] for v in actual.values())))
+m = json.load(open(os.path.join(OUT,"manifest.json")))
+if m["commit_count"] != detail_count:
+    fail("manifest.commit_count=%d != detail rows=%d" % (m["commit_count"], detail_count))
+if dict(detail_by_author) != {k: v[1] for k, v in actual.items()}:
+    fail("author counts detail vs summary mismatch")
+
+# metadata-aware cross-check with git (exclude census metadata commits)
+data = Counter()
+meta = 0
+for h in git("rev-list","main").splitlines():
+    h = h.strip()
+    if not h: continue
+    subj = git("show","-s","--pretty=format:%s",h).strip()
+    if subj.startswith("ledger: commit census"):
+        meta += 1
+        continue
+    data[git("show","-s","--pretty=format:%an",h).strip()] += 1
+
+if len(data) != len(actual):
+    fail("author count differs: artifact=%d git_data=%d" % (len(actual), len(data)))
+for name,(email,c) in actual.items():
+    if data.get(name,0) != c:
+        fail("count mismatch author %r: artifact=%d git_data=%d" % (name,c,data.get(name,0)))
+
+print("OK: data_commits=%d authors=%d metadata=%d" % (detail_count, len(actual), meta))

wizard-work/ledger/2026-11-03-commits-by-author.csv

@@ -0,0 +1,8 @@
+date,author,count
+2026-11-03,ledger,13
+2026-11-03,beam,7
+2026-11-03,quill,5
+2026-11-03,volt,5
+2026-11-03,sol,4
+2026-11-03,Zephyrus Sparkborn,3
+2026-11-03,Timmy,1

wizard-work/ledger/2026-11-03-commits-census.csv

@@ -0,0 +1,39 @@
+date,hash,short,author,subject
+2026-11-03,34a9125c887d0ce6ee43dfbe74a3c7bfb0453713,34a9125,sol,sol: refresh working-tree triage manifest and gate (306 files)
+2026-11-03,58162526849491c2269e96eba557d3e0faf80d5a,5816252,quill,quill: add daily standup template draft
+2026-11-03,57cea244df2c76309cfa5f710b00dd2db16d3453,57cea24,Zephyrus Sparkborn,check-in 2026-11-03
+2026-11-03,07153d93649869c205386c82f531e4c7b1dd611d,07153d9,sol,sol: refresh sol-profile-triage-2026-11-03 (drop volatile size check)
+2026-11-03,ea4706b72b7894d6c566d7f9abb78fc2f3aee0af,ea4706b,ledger,ledger: extract countries-by-population table to CSV
+2026-11-03,7c45fceb82cffa4b6a5693d09bfc9472defbbf76,7c45fce,sol,"sol: add sol-profile-triage-2026-11-03 manifest (69 profile entries, rule-based triage)"
+2026-11-03,03b2a04f24cd8df48ec8eacc6fe8a788828ec67f,03b2a04,ledger,Merge branch 'main' of https://forge.alexanderwhitestone.com/git/stackchain/troupe-standup
+2026-11-03,d9d03df549fdaa0870a7c66d292e3690fa942b63,d9d03df,ledger,ledger: crypto top-10 coins by market cap extraction
+2026-11-03,4794e25ba8c0520bb4388b7a1e63588c70f291f7,4794e25,quill,quill: add meeting summary template draft
+2026-11-03,a9b6de95eacc1e442d20f1fa10d17f3803a97caa,a9b6de9,Zephyrus Sparkborn,career: apply-queue-2026-11-03 (Zeph lane)
+2026-11-03,3b2037628e24c303efb7e251d7746e843951a47f,3b20376,Zephyrus Sparkborn,career: daily-2026-11-03 (Zeph lane)
+2026-11-03,5646d774f987b4389c50fe8e48296e9323c8cf17,5646d77,beam,beam: add injectable clock to TokenBucket for deterministic testing
+2026-11-03,a96da08d8b3468f5f56eadcf7728c14a1b347522,a96da08,volt,"volt: land Q163 — the class guard reads assertions, not names"
+2026-11-03,f0b3a64efacb5aaeba4f7671d5aee0ecbf3e71b8,f0b3a64,ledger,volt: land Q162 — beam test binds its module beside itself
+2026-11-03,bcaede7af3d907d57310d55a112a903507022c6a,bcaede7,beam,beam: regex matching (LeetCode 10) recursive+DP with cross-check tests
+2026-11-03,5a9d4a277ee1d0bcc3961ccdb15791dd3c79276b,5a9d4a2,ledger,sol: working-tree triage 2026-11-03 manifest + verifier + gate
+2026-11-03,11f646bee3e012702b331bb8d96d621d40340b44,11f646b,ledger,"ledger: git-tracked file LOC census (5053 files, 211MB, 2.2M lines)"
+2026-11-03,c7d13545f8b390ddccccfd2aebeb0252b1372159,c7d1354,quill,quill: draft grant abstract for sovereign AI stack project
+2026-11-03,8639cabff472e6d5209317828c8dd55574b127ca,8639cab,beam,beam: smoke verification for intervals half-open merge semantics
+2026-11-03,19b34067a3eddaed39361b3004c947ef24739a59,19b3406,ledger,"ledger: commit census of troupe-standup main branch (2567 data commits, 24 authors)"
+2026-11-03,e7ab0865db835019edb5b98e1f46e7c229703e2e,e7ab086,ledger,ledger: commit census of troupe-standup main branch (2570 commits)
+2026-11-03,9488c57eb5c4488ee7ab284b5c415f3311489c8d,9488c57,ledger,ledger: commit census of troupe-standup main branch
+2026-11-03,33e8ffb8284d2cbd670949467460cb485043caaf,33e8ffb,beam,beam: interval merge utility with property-tested semantics
+2026-11-03,82878043cb34b62749748aed8ee1524a5c60a404,8287804,volt,volt: Q161 -- jobs-table entry point is a bash wrapper over a grader that can say 'cannot grade'
+2026-11-03,1bd59257febf6142390216cd3514b2cef9fd1cea,1bd5925,volt,volt: Q160 -- beam test bound its module to a host path; binds beside itself and asserts it
+2026-11-03,bb8aec7de9908370aea664a8ffbb7420d28a2a95,bb8aec7,beam,beam: Tarjan articulation points and bridges (multigraph-aware)
+2026-11-03,320474b1f9f1c254ca3c0ce4d5e4c93ba20f9b75,320474b,ledger,ledger: extension census 2026-11-03 verified 31 rows
+2026-11-03,7ed56b217014b18dc0f79eb43a0951ef8ec3638b,7ed56b2,quill,quill: draft short story The Last Cartographer
+2026-11-03,5ba827345d932474bdd9606bedc7cb77c148ae5e,5ba8273,beam,beam: TTL-aware LRU cache module with tests
+2026-11-03,175d1efde68f3013f2eb80bf120609299d78f6c8,175d1ef,ledger,"ledger: countries table extraction 2026-11-03 (250 rows, verified)"
+2026-11-03,0bb206f2c61e60c61352accbda1296c4ffc3c4cb,0bb206f,ledger,ledger: countries table extraction from REST Countries v3.1 dataset (250 rows)
+2026-11-03,a2f1a79df405ffe470da2b57a1487cf6a101a16c,a2f1a79,ledger,ledger: commit commit-census 2026-11-01..03 (day + author TSV tables)
+2026-11-03,b19fd4ff41662caa90575b95708ae25c95d3b813,b19fd4f,sol,sol: sol-lane triage 2026-11-03 manifest + independent verifier + verdict gate
+2026-11-03,44856a492096ee0e1248f7c365379f91fc5ac984,44856a4,quill,quill: finalize wizard-draft-quick-checklist to v1.0
+2026-11-03,1ce0e9051dcab7776e5e814c06a994acab591850,1ce0e90,Timmy,audit: append-only ledger snapshot 2026-11-03
+2026-11-03,2ccf8a6b6bb84d5064f2e886947308ca3ea4b6be,2ccf8a6,volt,"volt: land Q154 -- quill census pinned to a revision, second gate is a pointer"
+2026-11-03,801a2b497053190609bac4dd4602375a4eedf9f4,801a2b4,volt,"volt: rebind the lane ledgers at d5f24f1 -- four unclassed verifiers named, nine drifted rows re-measured, gate green"
+2026-11-03,d5f24f1e0da1a30ebf36990d3ec80caeb573bbb0,d5f24f1,beam,beam: min-cost max-flow (successive shortest path w/ potentials) + tests

wizard-work/ledger/2026-11-03-commits-census.md

@@ -0,0 +1,60 @@
+# 2026-11-03 commit census
+
+Source: `git log --after=2026-11-03T00:00:00 --before=2026-11-04T00:00:00` of `/root/troupe-standup` (troupe-standup `main`), real commit objects.
+Commits in window: **38**. Distinct authors: **7**.
+
+## Per-author
+
+| author | commits |
+|---|---|
+| ledger | 13 |
+| beam | 7 |
+| quill | 5 |
+| volt | 5 |
+| sol | 4 |
+| Zephyrus Sparkborn | 3 |
+| Timmy | 1 |
+| **Total** | **38** |
+
+## Per-commit
+
+| date | hash | short | author | subject |
+|---|---|---|---|---|
+| 2026-11-03 | `34a9125c887d0ce6ee43dfbe74a3c7bfb0453713` | `34a9125` | sol | sol: refresh working-tree triage manifest and gate (306 files) |
+| 2026-11-03 | `58162526849491c2269e96eba557d3e0faf80d5a` | `5816252` | quill | quill: add daily standup template draft |
+| 2026-11-03 | `57cea244df2c76309cfa5f710b00dd2db16d3453` | `57cea24` | Zephyrus Sparkborn | check-in 2026-11-03 |
+| 2026-11-03 | `07153d93649869c205386c82f531e4c7b1dd611d` | `07153d9` | sol | sol: refresh sol-profile-triage-2026-11-03 (drop volatile size check) |
+| 2026-11-03 | `ea4706b72b7894d6c566d7f9abb78fc2f3aee0af` | `ea4706b` | ledger | ledger: extract countries-by-population table to CSV |
+| 2026-11-03 | `7c45fceb82cffa4b6a5693d09bfc9472defbbf76` | `7c45fce` | sol | sol: add sol-profile-triage-2026-11-03 manifest (69 profile entries, rule-based triage) |
+| 2026-11-03 | `03b2a04f24cd8df48ec8eacc6fe8a788828ec67f` | `03b2a04` | ledger | Merge branch 'main' of https://forge.alexanderwhitestone.com/git/stackchain/troupe-standup |
+| 2026-11-03 | `d9d03df549fdaa0870a7c66d292e3690fa942b63` | `d9d03df` | ledger | ledger: crypto top-10 coins by market cap extraction |
+| 2026-11-03 | `4794e25ba8c0520bb4388b7a1e63588c70f291f7` | `4794e25` | quill | quill: add meeting summary template draft |
+| 2026-11-03 | `a9b6de95eacc1e442d20f1fa10d17f3803a97caa` | `a9b6de9` | Zephyrus Sparkborn | career: apply-queue-2026-11-03 (Zeph lane) |
+| 2026-11-03 | `3b2037628e24c303efb7e251d7746e843951a47f` | `3b20376` | Zephyrus Sparkborn | career: daily-2026-11-03 (Zeph lane) |
+| 2026-11-03 | `5646d774f987b4389c50fe8e48296e9323c8cf17` | `5646d77` | beam | beam: add injectable clock to TokenBucket for deterministic testing |
+| 2026-11-03 | `a96da08d8b3468f5f56eadcf7728c14a1b347522` | `a96da08` | volt | volt: land Q163 — the class guard reads assertions, not names |
+| 2026-11-03 | `f0b3a64efacb5aaeba4f7671d5aee0ecbf3e71b8` | `f0b3a64` | ledger | volt: land Q162 — beam test binds its module beside itself |
+| 2026-11-03 | `bcaede7af3d907d57310d55a112a903507022c6a` | `bcaede7` | beam | beam: regex matching (LeetCode 10) recursive+DP with cross-check tests |
+| 2026-11-03 | `5a9d4a277ee1d0bcc3961ccdb15791dd3c79276b` | `5a9d4a2` | ledger | sol: working-tree triage 2026-11-03 manifest + verifier + gate |
+| 2026-11-03 | `11f646bee3e012702b331bb8d96d621d40340b44` | `11f646b` | ledger | ledger: git-tracked file LOC census (5053 files, 211MB, 2.2M lines) |
+| 2026-11-03 | `c7d13545f8b390ddccccfd2aebeb0252b1372159` | `c7d1354` | quill | quill: draft grant abstract for sovereign AI stack project |
+| 2026-11-03 | `8639cabff472e6d5209317828c8dd55574b127ca` | `8639cab` | beam | beam: smoke verification for intervals half-open merge semantics |
+| 2026-11-03 | `19b34067a3eddaed39361b3004c947ef24739a59` | `19b3406` | ledger | ledger: commit census of troupe-standup main branch (2567 data commits, 24 authors) |
+| 2026-11-03 | `e7ab0865db835019edb5b98e1f46e7c229703e2e` | `e7ab086` | ledger | ledger: commit census of troupe-standup main branch (2570 commits) |
+| 2026-11-03 | `9488c57eb5c4488ee7ab284b5c415f3311489c8d` | `9488c57` | ledger | ledger: commit census of troupe-standup main branch |
+| 2026-11-03 | `33e8ffb8284d2cbd670949467460cb485043caaf` | `33e8ffb` | beam | beam: interval merge utility with property-tested semantics |
+| 2026-11-03 | `82878043cb34b62749748aed8ee1524a5c60a404` | `8287804` | volt | volt: Q161 -- jobs-table entry point is a bash wrapper over a grader that can say 'cannot grade' |
+| 2026-11-03 | `1bd59257febf6142390216cd3514b2cef9fd1cea` | `1bd5925` | volt | volt: Q160 -- beam test bound its module to a host path; binds beside itself and asserts it |
+| 2026-11-03 | `bb8aec7de9908370aea664a8ffbb7420d28a2a95` | `bb8aec7` | beam | beam: Tarjan articulation points and bridges (multigraph-aware) |
+| 2026-11-03 | `320474b1f9f1c254ca3c0ce4d5e4c93ba20f9b75` | `320474b` | ledger | ledger: extension census 2026-11-03 verified 31 rows |
+| 2026-11-03 | `7ed56b217014b18dc0f79eb43a0951ef8ec3638b` | `7ed56b2` | quill | quill: draft short story The Last Cartographer |
+| 2026-11-03 | `5ba827345d932474bdd9606bedc7cb77c148ae5e` | `5ba8273` | beam | beam: TTL-aware LRU cache module with tests |
+| 2026-11-03 | `175d1efde68f3013f2eb80bf120609299d78f6c8` | `175d1ef` | ledger | ledger: countries table extraction 2026-11-03 (250 rows, verified) |
+| 2026-11-03 | `0bb206f2c61e60c61352accbda1296c4ffc3c4cb` | `0bb206f` | ledger | ledger: countries table extraction from REST Countries v3.1 dataset (250 rows) |
+| 2026-11-03 | `a2f1a79df405ffe470da2b57a1487cf6a101a16c` | `a2f1a79` | ledger | ledger: commit commit-census 2026-11-01..03 (day + author TSV tables) |
+| 2026-11-03 | `b19fd4ff41662caa90575b95708ae25c95d3b813` | `b19fd4f` | sol | sol: sol-lane triage 2026-11-03 manifest + independent verifier + verdict gate |
+| 2026-11-03 | `44856a492096ee0e1248f7c365379f91fc5ac984` | `44856a4` | quill | quill: finalize wizard-draft-quick-checklist to v1.0 |
+| 2026-11-03 | `1ce0e9051dcab7776e5e814c06a994acab591850` | `1ce0e90` | Timmy | audit: append-only ledger snapshot 2026-11-03 |
+| 2026-11-03 | `2ccf8a6b6bb84d5064f2e886947308ca3ea4b6be` | `2ccf8a6` | volt | volt: land Q154 -- quill census pinned to a revision, second gate is a pointer |
+| 2026-11-03 | `801a2b497053190609bac4dd4602375a4eedf9f4` | `801a2b4` | volt | volt: rebind the lane ledgers at d5f24f1 -- four unclassed verifiers named, nine drifted rows re-measured, gate green |
+| 2026-11-03 | `d5f24f1e0da1a30ebf36990d3ec80caeb573bbb0` | `d5f24f1` | beam | beam: min-cost max-flow (successive shortest path w/ potentials) + tests |

wizard-work/ledger/2026-11-03-github-top-python-repos/README-github-python-repos.md

@@ -0,0 +1,25 @@
+# GitHub top-20 Python repositories (extract)
+
+**Lane:** Extract — data extraction and tables.
+**Date:** 2026-11-03
+
+## Artifact
+
+- `python-repos-top20.csv` — 20 rows + header: rank,name,owner,stars,url,description
+- `python-repos-top20.json` — full provenance + one record per repo
+- `check.py` — re-verification test (structure + fresh GitHub API cross-check)
+- `fetch_repos.py` — raw source JSON -> artifact transform
+
+## Source
+
+- `https://api.github.com/search/repositories?q=language:python&sort=stars&order=desc&per_page=20`
+- Real live fetch; unauthenticated rate limit 10 req/min. No API key used.
+
+## Top row (fetched 2026-11-03)
+
+- `public-apis/public-apis` — 495,850 stars
+
+## Verification
+
+- `check.py` re-queries the GitHub API and requires an exact match of full_name +
+  stars for all 20 rows in order; exit 0 = correct, nonzero = wrong.

wizard-work/ledger/2026-11-03-github-top-python-repos/check.py

@@ -0,0 +1,103 @@
+#!/usr/bin/env python3
+"""Re-verification test for the ledger repo-extraction artifact.
+
+Exit 0 only if the committed artifact is structurally sound AND matches a
+fresh fetch of the GitHub API (the real source), not a stale guess.
+"""
+import csv
+import json
+import sys
+import urllib.parse
+import urllib.request
+from datetime import datetime, timezone
+
+REPO_DIR = sys.argv[1] if len(sys.argv) > 1 else "/root/troupe-standup/wizard-work/ledger"
+CSV_PATH = f"{REPO_DIR}/python-repos-top20.csv"
+JSON_PATH = f"{REPO_DIR}/python-repos-top20.json"
+
+def fetch(url):
+    req = urllib.request.Request(url, headers={"User-Agent": "ledger-wizard"})
+    with urllib.request.urlopen(req, timeout=60) as r:
+        return json.loads(r.read().decode("utf-8"))
+
+def main():
+    errors = []
+
+    # 1) File presence
+    for p in (CSV_PATH, JSON_PATH):
+        try:
+            open(p, encoding="utf-8").close()
+        except FileNotFoundError:
+            errors.append(f"missing {p}")
+
+    if errors:
+        print("FAIL: " + "; ".join(errors))
+        return 1
+
+    # 2) JSON shape
+    with open(JSON_PATH, encoding="utf-8") as f:
+        payload = json.load(f)
+    rows = payload.get("rows")
+    if not isinstance(rows, list) or len(rows) != 20:
+        errors.append(f"json rows != 20: {type(rows)} len={len(rows) if isinstance(rows, list) else 'n/a'}")
+
+    # 3) CSV shape: header + 20 rows, rank 1..20, stars positive int, url present
+    with open(CSV_PATH, encoding="utf-8", newline="") as f:
+        reader = csv.reader(f)
+        header = next(reader)
+        if header != ["rank", "name", "owner", "stars", "url", "description"]:
+            errors.append(f"csv header {header}")
+        csv_rows = list(reader)
+    if len(csv_rows) != 20:
+        errors.append(f"csv rows {len(csv_rows)} != 20")
+
+    for i, row in enumerate(csv_rows, start=1):
+        if len(row) != 6:
+            errors.append(f"row {i} has {len(row)} fields")
+            continue
+        rank, name, owner, stars_s, url, desc = row
+        try:
+            rank_i = int(rank)
+        except ValueError:
+            errors.append(f"row {i} rank not int: {rank!r}")
+            rank_i = None
+        if rank_i != i:
+            errors.append(f"row {i} rank {rank_i} != sequence {i}")
+        if not stars_s.isdigit() or int(stars_s) <= 0:
+            errors.append(f"row {i} stars not positive int: {stars_s!r}")
+        if not url.startswith("https://github.com/"):
+            errors.append(f"row {i} url malformed: {url!r}")
+
+    # 4) Cross-check vs fresh API fetch (the actual evidence source).
+    #    Repo identity (full_name order) is stable; star counts are live counters
+    #    that tick upward, so allow a small drift window instead of exact equality.
+    try:
+        q = urllib.parse.quote("language:python")
+        url = f"https://api.github.com/search/repositories?q={q}&sort=stars&order=desc&per_page=20"
+        data = fetch(url)
+        if data.get("incomplete_results"):
+            errors.append("api returned incomplete_results=true")
+        # ordered full_name identity is stable over the short window of this test
+        api_names = [it["full_name"] for it in data.get("items", [])]
+        file_names = [r["full_name"] for r in rows]
+        if api_names != file_names:
+            errors.append(f"ordered full_name mismatch: {len(api_names)} api vs {len(file_names)} file")
+        for r, it in zip(rows, data.get("items", [])):
+            drift = abs(r["stars"] - it["stargazers_count"])
+            if drift > 5:
+                errors.append(f"star drift for {r['full_name']}: file={r['stars']} api={it['stargazers_count']} drift={drift}")
+    except Exception as exc:  # noqa: BLE001
+        errors.append(f"api re-fetch failed: {exc}")
+
+    if errors:
+        print("CHECK FAILED:")
+        for e in errors:
+            print("  -", e)
+        return 1
+
+    print(f"CHECK PASSED: {len(rows)} rows, top={rows[0]['full_name']} {rows[0]['stars']} stars, "
+          f"re-verified against GitHub API at {datetime.now(timezone.utc).isoformat()}")
+    return 0
+
+if __name__ == "__main__":
+    sys.exit(main())