Install
$ agentstack add skill-whenpoem-aiscientist-prove-sop ✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.
Security review
✓ PassedNo issues found. Passed automated security review. · v0.1.0 How review works →
- ✓ Prompt-injection patterns
- ✓ Secret / credential exfiltration
- ✓ Dangerous shell & filesystem operations
- ✓ Untrusted network calls
- ✓ Known-malicious package signatures
What it can access
- ✓ Network access No
- ✓ Filesystem access No
- ✓ Shell / process execution No
- ✓ Environment & secrets No
- ✓ Dynamic code execution No
From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.
Verified badge
Passed review? Show it. Paste this badge into your README, it links to the public security report.
Reliability & compatibility
Declared compatibility
Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.
We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.
How agent discovery & health will work →About
Prove SOP
When the user asks for a statistical proof ("prove X", "show that Y holds", "give a rigorous derivation"), or when a proposition node sits without a verified proof:
- Memory lookup: call
mcp__memory__match_signatureswith the proposition text anddomain="proof". If similar past proof errors exist, read them first before drafting. - Capture the proposition: if not already in the graph, call
mcp__prove__propose_propositionto register it. Passparent_idto a related question or hypothesis node so empirical and theoretical work share one tree (architecture.md §13). - Skeleton retrieval: call
mcp__prove__retrieve_skeletonswith lexical and semantic keywords you extracted from the proposition. If fewer than 3 candidates rank above similarity 0.4, ingest more material viamcp__prove__ingest_proof_corpusfirst or fall back to a from-scratch outline. - Skeleton tournament: from the retrieved candidates plus 2-3 of your own outline drafts, register them as siblings via
mcp__prove__propose_proof_skeleton. Run$bt-tournamentto BT-rank them; the proof-trunk leaderboard ismcp__memory__get_bt_leaderboard(kind="proof_skeleton"). Stop when the top-2 LCB / UCB intervals separate or 3 comparisons cover every candidate. - Draft generation: pick the BT winner. Read the proposition plus the selected skeleton, assemble the drafting prompt inline, and generate the LaTeX draft yourself (do not spawn a sub-agent for this). Persist it via
mcp__prove__register_proof_draft. At this branch point (choosing one skeleton over the others), optionally callmcp__cockpit__narrate("why this skeleton")so the cockpit reflects the decision (v5.0; optional). - Segment + diagnose: split the draft into minimal logical units (~3-12 snippets per page; one per non-trivial step). Call
mcp__prove__segment_proof(draft_id, snippets)-- this opens a fresh diagnostic manifest. For each snippet, callmcp__prove__diagnose_snippetto get historical proof-error candidates, decideis_flawed, and callmcp__prove__register_diagnosis. After all snippets are recorded, callmcp__prove__finalize_manifest. - Correction (only if status='open'): call
mcp__prove__compose_correction_promptto build the global-fix prompt; generate the corrected LaTeX inline; callmcp__prove__apply_correction. The new draft is itself segmentable -- if you suspect more flaws, loop back to step 6 on the newdraft_id. Before applying a global correction (a non-trivial decision among possible fixes), optionally callmcp__cockpit__narrate("...")so the activity pane shows the reasoning (v5.0; optional). - Empirical companion (optional, recommended for theorems with concrete constants): if the proof contains a numeric constant you only conjecture, hand off to the empirical trunk via
$preregister. Lock metric, threshold, direction. The reviewer will later cross-link the theorem and the preregistration. - Lean reinsurance (optional): when a key lemma is small + closed (single-page, mathlib-friendly), call
mcp__prove__triage_for_formalization. Ifeligible=True, request a wallclock budget from thebudgeteragent for long attempts (see [prover.md§ Budget](../../agents/prover.md)); low-cost checks may proceed with an audit warning when no budget is configured. Then spawn theproversubagent. A successfullean_verifyattaches as the strongest possible evidence; a failure feeds the cross-domain failure ledger viamcp__memory__record_failure(domain="proof"). - Reviewer: when the manuscript is ready to ship, the
revieweragent's proof checklist (P5) demands either amanifest.status='empty'plus a Lean verification, or an explicitunverifiedflag. Plan accordingly.
Guardrails
- BT comparisons forbid cross-kind matches; do not use
update_bt_ratingbetween a hypothesis and a proof_skeleton. Use parallel tournaments (architecture.md §13). Stop a skeleton tournament when the top-2 LCB / UCB intervals separate, or when every candidate has participated in at least one comparison. mcp__prove__diagnose_snippetis read-only; you must explicitlyregister_diagnosisfor the entry to land in the manifest. This is intentional: the LLM judgment lives in the agent loop, not the MCP tool.- A manifest only finalises once. To re-segment a corrected draft, call
segment_proofon the newdraft_id-- this opens a fresh manifest. Old manifests stay around as audit history. - Lean failures are not blockers. The proof trunk's first-class output is the NL draft; Lean is reinsurance.
- Lean attempts ≥ 5 minutes should go through the
budgeteragent (prover.md§ Budget). Missing budget context is an audit warning, not a reason to discard the NL proof.
Cross-references
- Tool layering doctrine: [ADR 0007](../../docs/adr/0007-tools-skills-hooks-layering.md)
- Two-trunk architecture: [ADR 0008](../../docs/adr/0008-two-trunk-domain-architecture.md)
- Cooperation interfaces: [architecture.md §13](../../docs/architecture.md#13-core-vs-domain-trunks-v40)
- Empirical companion gate:
$preregister - Skeleton ranking:
$bt-tournament
Source & license
This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.
- Author: whenpoem
- Source: whenpoem/aiscientist
- License: MIT
Install and usage instructions live in the source repository linked above.
Reviews
No reviews yet, be the first.
Write a review
Versions
- v0.1.0 Imported from the upstream source.