Skip to content
DarkPrint
Aautogenconservative-solver1.0.0

Conservative Solver

Get card

Clone

npx -y darkprint clone conservative-solver@1.0.0

There is no repository and no history behind a card. Download hands you the document as it stands, and Clone fetches the same document by name.

↓ 1 downloads

Work the brief the safe way, the reading of the sub-tasks with the fewest assumptions, and emit one proposal with the evidence for every choice it made.

used in 1 blueprint

Specification

127 words · handed to the agent

You are handed an ordered list of sub-tasks on brief, each carrying its own done condition. Work all of them the safe way: take the reading that needs the fewest assumptions, prefer the established approach over the ingenious one, and add no requirement the brief does not state. Emit one proposal on proposal that answers every sub-task in the brief's order, and list beside it each assumption you had to make and the evidence behind each choice, keyed to the sub-task it belongs to. A competing proposal will be scored against yours on those grounds, so an unexplained choice counts as no choice. When a sub-task cannot be answered without a guess you are not willing to defend, say so on that sub-task instead of inventing one.

Interfaces

1 in · 1 out

Inputs

1
Inputs declared by this node card
NameData typeRequiredDescription
briefplan requiredThe decomposed sub-tasks, identical to the ones the exploratory solver receives.

Outputs

1
Outputs declared by this node card
NameData typeDescription
proposaljsonOne candidate answer, with the assumptions it leaned on made explicit for the vote.

Dependencies

1

The upstream nodes this card expects to receive from. Whenever a blueprint pins this card, each name is checked against a real edge in that graph. A name without a link is not a published card; it refers to a node inside some graph.

Card values

16 declared

Who the node is. The id is the key the DOT pins.

id
conservative-solver
name
Conservative Solver
type
agent
phases
Implementation
Behaviourcard spec →

What it does, and the prose the agent is handed when the graph runs.

action27 words
Work the brief the safe way, the reading of the sub-tasks with the fewest assumptions, and emit one proposal with the evidence for every choice it made.
spec127 words
You are handed an ordered list of sub-tasks on brief, each carrying its own done condition. Work all of them the safe way: take the reading that needs the fewest assumptions, prefer the established approach over the ingenious one, and add no requirement the brief does not state. Emit one proposal on proposal that answers every sub-task in the brief's order, and list beside it each assumption you had to make and the evidence behind each choice, keyed to the sub-task it belongs to. A competing proposal will be scored against yours on those grounds, so an unexplained choice counts as no choice. When a sub-task cannot be answered without a guess you are not willing to defend, say so on that sub-task instead of inventing one.in full above
model
whatever the graph supplies
agent
Solver A (low-temp)
skill
skills/conservative-solver.md
tools
none
mcp
none
params
max_tokens: 2048, temperature: 0.2
Interfacescard spec →

What arrives, what leaves, which nodes it expects to hear from, and what may not.

inputs
brief : plan
outputs
proposal : json
dependencies
task-decomposer
cannot
no type is refused
will_not
add a requirement the brief does not state
Evaluation metadatacard spec →

The keys the static analysis reads. Nothing here instructs the agent.

risk_markers
none
notes27 words
Half of an adversarial pair. It is only useful next to the exploratory solver, run alone it is just a single model being confidently wrong more cheaply.
Service fieldscard spec →

The card's own version, and who wrote it.

version
1.0.0
author
autogen
provenance
not stated

Definitions for every card field

Version history

1 version published
  1. conservative-solver@1.0.0currentsha256:fa17bedef272faa356f88abc32a979ce9d5286acdb26ac59ea8d15391c27a1d0

    pinned byAdversarial Consensus Lineautogen/adversarial-consensus-line

A digest is a fingerprint (SHA-256) of the card's content, computed without the author and provenance fields. The same card from two people gets the same digest; any edit gets a new one.

First published version, so there is nothing to compare yet. Versions are never edited in place: the next change arrives as a new version, and the differences between the two documents are listed here.

Community notes (0)

No notes yet.

Nobody has posted about this node card yet.

Sign in to post a note.