编程

plus-ultra

试用

Run a Byzantine 2+1 plan before consequential work and a fresh, plan-blind reality check afterward. Use when the user asks for Plus Ultra, maximum rigor, independent proposals, enforced verification, or help responding to a Plus Ultra hook gate. Claude Code can enforce the loop through the included hook adapter; on Codex and other hosts it is a convention unless separately wired and verified.

它能做什么

Go beyond: two independent minds propose, one arbiter rules, reality confirms.

技能文档

Plus Ultra

Go beyond: two independent minds propose, one arbiter rules, reality confirms.

The loop

task -> proposer A (read-only, blind) --\
                                        -> arbiter -> one plan -> main applies once
task -> proposer B (read-only, blind) --/                         |
                                                                  v
                                               fresh reality verifier (plan-blind)
  1. Check the host's agent budget. If it cannot support the full loop, say so before degrading.
  2. Spawn two isolated, read-only proposers with the same task specification.
    • A must not assume any command succeeded; it reads actual state.
    • B must name an alternative approach it rejected and why.
  3. Give both proposals to one arbiter. It returns a single authoritative plan or escalates a fundamental disagreement to the human.
  4. The main thread applies that plan once. Proposers never mutate live state.
  5. Spawn a fresh verifier that has not seen the plan. State only what should now be true and have it inspect the world independently.

Each proposal includes exact changes, verification, rollback, and uncertainties. The arbiter must not average incompatible plans into vague consensus.

Decision matrix

AgreementArbiter action
FullApply; confidence 90+
Minor differencesPick the cleaner plan; confidence 80+
Structural differencesAnalyze and merge explicitly; confidence 60-85
Fundamental disagreementEscalate; do not force a winner

Recording an enforced turn

Where the Claude Code hook adapter is installed, record the approved plan before mutation:

plusultra plan --session "$CLAUDE_SESSION_ID" --arbiter Athena --verdict -

After the fresh verifier checks reality:

plusultra confirm --session "$CLAUDE_SESSION_ID" --verifier Argus --verdict -

The commands read verdict text from standard input. If nothing observable exists, record unobservable; that is an outcome, not a pass.

Enforcement truth

  • Claude Code: the included hook adapter can deny recognized mutating tool calls until a plan exists and block completion after mutation until a reality verdict exists. It is enforced only after the three hooks are configured and plusultra doctor passes.
  • Codex and other hosts: this repository ships no verified hook adapter for them. Following the loop there is convention-only unless an equivalent host integration is separately built, wired, and tested. Never describe convention as an enforced gate.

The command classifier is deliberately conservative but heuristic. It is not a shell parser, sandbox, permission system, or proof that a command is safe.

Exemptions and escape hatch

Subagents are exempt from the hook to prevent recursive deadlock. The CLI and recognized read-only commands are also exempt. Disable with PLUS_ULTRA=off or plusultra off; every CLI escape is written to ~/.plus-ultra/audit.jsonl.

Limits

  • Two proposers can share the same false assumption.
  • A verifier can check the wrong observable.
  • Model diversity helps reduce correlated failures but does not create independence by itself.
  • The hook catches common mutation shapes, not arbitrary code execution or every shell grammar.

相关技能

在本地磁盘以分类纯 Markdown 文件保存需要长期留存的事实,与智能体内置记忆并存。

作者 Iván559 次安装18 星标

以 AI 机器人身份加入视频会议,提供语音、虚拟形象与屏幕共享四种模式。

作者 johnpatternai22 次安装8 星标

诊断生产力系统反复失效的根因,给出最小干预——容量测算、瓶颈定位、可靠的本地记录。

作者 Iván855 次安装69 星标

把自然语言描述转为结构化 JSON,并由 mcp-diagram-generator MCP 服务生成 Draw.io、Mermaid 或 Excalidraw 图表文件。

作者 nssa.io1.0k 次安装47 星标

从 AdMapix API 拉取广告创意、应用、榜单和收入预估等数据,原样返回结构化 JSON。

作者 fly0pants4.3k 次安装296 星标

antreasantoniou 的更多技能

浏览全部技能

Design and compose multi-agent graphs for correctness, coverage, or creativity. Use when a task benefits from isolated proposals, explicit arbitration, adversarial verification, committees, recursive review, cross-modal checks, or saturation loops. Applies across agent runtimes; the included JavaScript workflow is one adapter.

作者 antreasantoniou1 次安装

Turn conversations into grounded decisions

作者 antreasantoniou1 次安装

Durable memory for projects and research

作者 antreasantoniou1 次安装

One secure Bitwarden unlock per 24 hours

作者 antreasantoniou1 次安装