本文へ移動
cccskills
無料GitHub で公開

compare-systems

Compare a built system with a cheap solver against a bare system with a dear solver, on one campaign's held-out tasks, one solve a task and system, outside the campaign's readings. Answers "can Terra with our truss harness reach Opus", and, when asked, how the harnesses of one domain stand under one solver. One script joins production primitives (a seed, the campaign's paid solve in a trial log, the comparison's tally and step rule) and prints one plain reading. Use when the operator asks to compare models, a cheap model against a dear one, harnesses, or "can X reach equal scores".

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasisスター 66(GitHub 66 + cccskills 0)

実行スコア 未検証

インストール方法を見る

含まれるファイル(2)

  • SKILL.md7.6 KB
  • scripts/systems.ts21.4 KB

SKILL.md(原文)

インストールする前に、エージェントに与えられる指示の中身を確認できます。

Compare systems

Building a harness pays off when a cheap solver in it does what a dear solver does in the starter. This skill measures that. A system is a solver in a harness (AGENTS.md, section 14): a bare system has the starter, a built system a harness a Builder wrote. The default reading is

bare  = claude/claude-opus-5-5:medium   inside the starter (A)
built = openai-codex/gpt-6.1-terra:high inside the domain's built harness

on every held-out task of one campaign, one solve a task and system. A campaign cannot make this reading, because its setting fixes the solver and its comparisons set two harnesses under that one solver (AGENTS.md, section 6). Terra in the starter against Terra in the built harness is that campaign question again: run it only when the operator asks for it by name.

It promotes nothing and moves no campaign. Its readings are a study's (studies/README.md), never a campaign's step, and they go into no seat's message.

What it reuses

scripts/systems.ts only joins what the campaign already does. Each system opens a seed of the campaign with its own solver and its own trial log (openCampaign, the path close.ts --solve takes), and solves through the campaign's paid seat held at the host's load (solved, gated), so every solve has the campaign's checks, limits and wall. Each candidate is scored against the baseline with the comparison's own functions: the tally and the sign-flip test (scored), the step rule with the bill and without it (readsStep), the least detectable shift (detectable) and the measure that carried each task (carriedBy). The checks give each answer its verdict, and the Referee --reviewer names rules every rejection before it counts: one ruled earned is a fail, and one ruled a check defect or unclear, or left unruled, sets its task aside for every system (rejectionAside).

The procedure

  1. Seed the campaign. bun run runs seed --from <campaign> --name cmp-<what>, or for a stored pack --events N cut before its first release, so every task is still held. The script refuses a folder without seed.json, so a real campaign is never written. The bare system needs nothing more: every seed holds the starter, named starter or A. Written out, the starter is data/harnesses/starter/bare-harness in the main checkout, beside every campaign's handover and behind the wall of every Builder, Examiner and solve, since the wall refuses the repository's worktrees; writeStarter (src/harness/starter.ts) writes it again. Import the domain's harness into the seed for the built system: bun tools/d2/import.ts --name cmp-<what> --harness <data/harnesses/<run>/harness>.
  2. Write the prediction first, in .ana/compare/cmp-<what>/prediction.md: which system wins, and the count that settles it.
  3. Read for free. --read opens every system and harness, draws the tasks and solves nothing. A seed of a stored pack names it by the four flags its launch receipt holds:
    bun .claude/skills/compare-systems/scripts/systems.ts --seed cmp-truss \
      --root <root> --sweep <sweep> --cycle <cycle> --bundle <bundle> \
      --baseline bare-opus=claude/claude-opus-5-5:medium@A \
      --candidate built-terra=openai-codex/gpt-6.1-terra:high@<digest of the truss harness> --read
    
    A harness is starter (or A), promoted, or a whole digest or a letter the seed keeps.
  4. Solve, on the operator's word. The same command with --cap <dollars>, --reviewer <model>, --login N for a Claude solver (the login CLAUDE_CODE_OAUTH_TOKEN<N>, counted by hand against its most), and without --read. Run it from a checkout whose .env holds the logins, with bun --env-file=<that .env>, on one quiet host; truss runs where the operator's machine rules put it. It stops starting solves at the cap. Run it again to go on: each system solves only what its own log is still short of.
  5. Clean up. Move the seed and its trial logs to the Trash once the reading is recorded: /usr/bin/trash .ana/d2/cmp-<what> .ana/compare/cmp-<what>.

Size and price. Solves are tasks times --solves times systems. Price them from the bills of earlier solves under the same solver on the same pack (solve.finished.billed). On the truss pack round4-veryhard, Opus 5.5 at medium in the starter billed $0.63 a solve on average (115 solves, truss-141-m3), and Terra at high $0.08 on the truss campaigns it solved (54 solves), so 25 tasks once each cost about $16 and $2. --solves 4 adds the A/A, the baseline read against itself on halves of its solves mirrored in time, at four times the price; take it only on the operator's word.

How to read it

  1. The tasks. How many of the seed's held-out tasks were drawn, and under which solver its Examiner admitted them.
  2. One block a system, on its own. Valid solves of all solves; tasks where every, some or no solve was valid; fails the Referee did not rule earned. One table for all systems, on averages a solve: valid solves, cost, wall time, the slowest solve and model turns. The cost is the log's whole bill over the solves, the Referee's rulings included, so it runs a little over the solves' own. Show the table with the verdict, and quote no cost per valid answer. When a system's time is high, split its calls into the model's turns and the tools it ran (solve.call carries ms): a harness whose own programs search up to a deadline fills the wall (Terra in the truss harness: 28.1 of 28.6 minutes a solve on 28 October), and a slower system is then a harness cost, not a slower model.
  3. The A/A, only at four solves or more.
  4. One block a candidate. Wins, losses and ties against the baseline; which measure carried the untied tasks (validity, the objective, or the bill alone); p each way; and one verdict:
    • X is better: a step at the level, with the bill and without it, as a campaign reads one.
    • no step either way: this size found no difference. It is no proof of equality, and the line gives the smallest share of untied tasks a side must win for this size to show it.

At one solve a task, each task's result rests on one solve a side, and one solve is weak evidence (AGENTS.md, rule 6): say so beside the reading. "Reaches equal scores" is said only as: no step either way, at this size, with that detectable share, and each system's average cost and time a solve beside it.

Limits

  • Selection. Task admission used the campaign's own solver and reference harnesses. The evaluation set therefore depends on those systems, which limits comparisons with other systems.
  • No person's labels. The Referee is a model, and its rulings stand until a person labels them.
  • Another campaign's harness is read under this campaign's contract and answer format. A harness built for another exam of the same domain may lose on the format alone.
  • Hidden values. The trial logs hold them. Keep them under .ana/compare/, and keep their content out of prompts, pull requests and pastes (AGENTS.md, section 5).

レビュー

まだレビューはありません。使ってみた感想をお寄せください。

コメント

ログインなしで書き込めます。使ってみた感想、質問、動かなかった環境などを気軽にどうぞ。

まだコメントはありません。最初のコメントを書いてみませんか。

送信するとすぐに公開されます。メールアドレスや電話番号などの個人情報は書かないでください。URL は 2 つまでです。

0 / 1000 文字

このフォームは reCAPTCHA で保護されており、Google のプライバシーポリシーと利用規約が適用されます。

同じリポジトリのスキル

Use after an Anabasis v2 comparison, standalone comparison or system change, and before any sentence claims that a harness, a model or a patch improved something. States what one reading may be said to show: the identities it was made under, the counts kept apart, whether it was repeated, which part of a harness it belongs to, whether a mechanism was live in the run, and whether the measurement is valid as distinct from whether it was exploited. Ends in one fixed report.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

Launch and collect independent Codex sessions (gpt-6-luna at high, xhigh or max; gpt-6.1-sol at low to xhigh) for bounded parallel work, from Claude Code or Codex: one manifest, one detached launcher, one report a session, a drain while it runs, and a retry of incomplete sessions. Owns the Codex transport when another skill sets the questions, as whole-run-investigation does for its lanes. Use when the operator asks for Luna or Sol sessions, a swarm, many sessions, a reasoning effort, a Codex subagent from Claude Code, or a later collection of reports. Distinguish a request to launch from one to wait and collect.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

commit-r

無料

Rewrite one compartment of Anabasis v2 test-first, with the old code as an oracle. Use when the operator asks to rewrite, overhaul or rebuild code, or says commit R; also within an authorised change when the old shape needs another exception or about half the machinery could give the same result. A stack overhaul belongs to stack-pr.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

The harnesses a campaign keeps, read outside a run: which there are and where each came from, what each is made of and what moved from its parent, what each was measured to be, trying one on a task, the audit before a promotion and the blind review at a handover, whether a part earns its place, and changing what makes a harness or what a seat is told about one. Use when the operator asks which harness is current, what a Builder changed, whether a harness is ready to promote or hand over, to run a kept harness on a task, or to change the harness contract. Reading one run is whole-run-investigation's, wording a claim attribution-and-proof's.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

Hand a question about Anabasis v2 to an outside Oracle model as one task document and one zip. The Oracle reads GitHub; the zip carries what it cannot fetch: campaign logs and kept harnesses through `bun run runs zip`, a reader's output, predictions with how each resolved, patches for commits never pushed. Use when the operator asks to prepare an Oracle question, a report request, a problem statement or a second opinion on a run, a reading or a design, or to send the latest runs to an outside model. Produces local files; uploading is the operator's.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

Score recorded comparisons again by a tree's weighted measures, without models or spend. Read which promotions the score supports, which measure won each task, the A/A comparisons, and hours and dollars per promotion. Sweep the weights and the level by flag, and compare a candidate tree that changes a floor or the test.

日本語の概要は準備中です。原文の説明を表示しています。

s-smits/anabasis662026年10月29日 更新

s-smits のスキルをすべて見る

このスキルの問題を報告する