From 09f9efcc4c09af1066bf6a4e08f4ea2f3402da35 Mon Sep 17 00:00:00 2001 From: gastown/crew/max Date: Wed, 31 Dec 2025 01:11:12 -0800 Subject: [PATCH] Update Hanoi formula with agent-actionable instructions (gt-brd1b.3) MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Add comprehensive execution protocol to formula description: - EXECUTION LOOP: find ready step, close it, repeat - ON RESUME: same as fresh start, molecule IS the state - DO/DO NOT guidelines for autonomous execution - MONITORING guidance for mega-molecules This enables agents to execute Hanoi autonomously through restarts, proving nondeterministic idempotence at scale. 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude Opus 4.5 --- .beads/formulas/towers-of-hanoi.formula.toml | 37 ++++++++++++++++++- .beads/formulas/towers-of-hanoi.formula.yaml | 39 ++++++++++++++++++-- 2 files changed, 71 insertions(+), 5 deletions(-) diff --git a/.beads/formulas/towers-of-hanoi.formula.toml b/.beads/formulas/towers-of-hanoi.formula.toml index 5ac74263..1f263df7 100644 --- a/.beads/formulas/towers-of-hanoi.formula.toml +++ b/.beads/formulas/towers-of-hanoi.formula.toml @@ -1,4 +1,39 @@ -description = "Solve Towers of Hanoi for {disks} disks. Generates 2^{disks} - 1 steps, each a trivial move operation. Demonstrates mechanical structure generation for arbitrarily long workflows." +description = """ +AGENT EXECUTION PROTOCOL - Towers of Hanoi ({disks} disks, {total_moves} steps) + +PURPOSE: This is a durability proof, not computation. Steps are pre-computed. +Your job is to execute them mechanically, proving crash-recovery at scale. + +EXECUTION LOOP: +1. Find current state: bd mol current +2. Find the next ready (unblocked) step +3. Close it: bd close +4. Repeat until no ready steps remain + +ON RESUME (after crash/restart/handoff): +- Same as fresh start. The molecule IS the state. +- Query `bd mol current `, continue from there. +- No memory of previous session needed. + +DO: +- Close steps as fast as possible (they're trivial mechanical moves) +- Use `gt handoff` when context fills (proactive cycling) +- Trust the pre-computed solution - every move is already correct + +DO NOT: +- Try to solve Hanoi yourself - moves are already computed +- Mark steps in_progress - just close them directly +- Ask for permission - this is GUPP territory, just execute +- Stop for human input - run autonomously until complete + +MONITORING: +- Progress: Count closed children of the molecule +- For mega-molecules: Use convoy dashboard when available +- Completion: All steps closed = molecule complete + +This proves Gas Town can execute arbitrarily long workflows with +nondeterministic idempotence - different sessions, same outcome. +""" formula = "towers-of-hanoi" version = 1 diff --git a/.beads/formulas/towers-of-hanoi.formula.yaml b/.beads/formulas/towers-of-hanoi.formula.yaml index f4eba7a1..d94291ae 100644 --- a/.beads/formulas/towers-of-hanoi.formula.yaml +++ b/.beads/formulas/towers-of-hanoi.formula.yaml @@ -18,10 +18,41 @@ # This formula uses for-each to generate all moves at cook time. formula: towers-of-hanoi -description: > - Solve Towers of Hanoi for {disks} disks. Generates 2^{disks} - 1 steps, - each a trivial move operation. Demonstrates mechanical structure generation - for arbitrarily long workflows. +description: | + AGENT EXECUTION PROTOCOL - Towers of Hanoi ({disks} disks, {total_moves} steps) + + PURPOSE: This is a durability proof, not computation. Steps are pre-computed. + Your job is to execute them mechanically, proving crash-recovery at scale. + + EXECUTION LOOP: + 1. Find current state: bd mol current + 2. Find the next ready (unblocked) step + 3. Close it: bd close + 4. Repeat until no ready steps remain + + ON RESUME (after crash/restart/handoff): + - Same as fresh start. The molecule IS the state. + - Query `bd mol current `, continue from there. + - No memory of previous session needed. + + DO: + - Close steps as fast as possible (they're trivial mechanical moves) + - Use `gt handoff` when context fills (proactive cycling) + - Trust the pre-computed solution - every move is already correct + + DO NOT: + - Try to solve Hanoi yourself - moves are already computed + - Mark steps in_progress - just close them directly + - Ask for permission - this is GUPP territory, just execute + - Stop for human input - run autonomously until complete + + MONITORING: + - Progress: Count closed children of the molecule + - For mega-molecules: Use convoy dashboard when available + - Completion: All steps closed = molecule complete + + This proves Gas Town can execute arbitrarily long workflows with + nondeterministic idempotence - different sessions, same outcome. version: 1 vars: