hs:bakeoff

Runs 2-4 candidate probes against one mechanical metric and ranks them by measured numbers.

Updated Jul 19, 2026
One-click install
npx skills add https://github.com/Dozyboy/VSF --skill hs-bakeoff-dozyboy
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: hs:bakeoff
Source: https://github.com/Dozyboy/VSF/tree/main/Day2_VSF/Demo1/harness/plugins/hs/skills/bakeoff
Command: npx skills add https://github.com/Dozyboy/VSF --skill hs-bakeoff-dozyboy

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve? When reasoning cannot separate two or more viable technical directions, teams often pick a winner by argument alone. This Skill replaces opinion with evidence by building a cheap throwaway probe per candidate, running every probe on the same input set with the same mechanical metric, and letting the numbers decide — or honestly declaring a tie when the gap falls inside the measured noise band. ## Core Features & Use Cases - Empirical candidate comparison: Fans out 2-4 candidates into isolated git worktrees, measures each with an identical shell-command metric, and records every trial in an append-only JSONL ledger. - Honest verdicts with noise handling: The rank script refuses to crown a winner when the gap is within the noise band (relative band or observed spread) or when trial counts are insufficient, handing the decision to a human instead. - Gate-first preflight: Validates candidate count, metric safety, and budget ceilings before any probe is built, and falls back to cheaper reasoning when a bake-off is not justified. - Use Case: Deciding between redis, in-memory, and sqlite caching — build a minimal adapter probe for each, measure latency on the same input set across multiple trials, and get a verdict showing the full scoreboard including losers and spread. ## Quick Start Ask the AI to bake off your candidate approaches, for example: run a bake-off comparing redis, in-memory, and sqlite on query latency with medium noise and a 180-second budget per probe.

Frequently Asked Questions about hs:bakeoff

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I compare multiple technical approaches empirically instead of guessing?▼

Run a bake-off: build a minimal throwaway probe for each of 2-4 candidates, execute the same metric command on the same input set in isolated worktrees, and rank the recorded trials. The winner must beat the runner-up beyond the measured noise band.

What makes a valid metric for an empirical bake-off?▼

A valid metric is a shell command that exits 0 and prints exactly one number, such as latency in milliseconds, bundle bytes, or percentage of tests passing. LLM-scored quality judgments are rejected because they create fake objectivity.

When should I not run a bake-off between candidates?▼

Skip the bake-off when a minute of reasoning settles the decision, when no mechanical metric exists, or when probes would require full feature builds. In those cases use cheaper reasoning-based prediction instead.

What happens when candidate scores are too close to call?▼

When the gap between the best and runner-up is within the noise band, the verdict is tie_within_noise and the decision is handed to a human. The full scoreboard including losers and observed spread is always reported.

How many trials are needed per candidate in a bake-off?▼

Trial count depends on noise level: low noise needs 1 trial, medium needs at least 2 keeping the worse result, and high needs 3-5 keeping the median. A verdict of insufficient_trials is returned if any candidate falls below its minimum.