← MathboxCONTENT HISTORY

Update to Mathbox

Snapshot Oct 24, 2026 · 12:58 UTC · version 4.0.0

Collection source: downloaded plugin package. These snapshots do not have a confirmed matching collection source. Differences in file lists alone do not establish changes to the package.

WHAT CHANGED

Instructions updated for research-attempt

Full description — Now says: or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an...

Observed in instructions or declared skills. Runtime behavior has not been tested.

Save Mathbox and check future changes in Following.

Up to 10 plugins free · no card required.

All fields and original values.

Full description

Before

Sep 30, 2026 · 23:15 UTC

source-dependent implication, or claim-supporting computation. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use

After

Oct 24, 2026 · 12:58 UTC

or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or

Skill instructions

Before

Sep 30, 2026 · 23:15 UTC

source-dependent implication, or claim-supporting computation. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use for a sustained multi-route investigation that continues after failed approa...

After

Oct 24, 2026 · 12:58 UTC

or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investig...

Supporting files

Before

Sep 30, 2026 · 23:15 UTC

[{"relative_path":"agents/openai.yaml","size_in_bytes":268},{"relative_path":"evals/evals.json","size_in_bytes":10086},{"relative_path":"evals/trigger-evals.json","size_in_bytes":1520},{"relative_path":"references/evidence-model.md","siz...

After

Oct 24, 2026 · 12:58 UTC

[{"relative_path":"agents/openai.yaml","size_in_bytes":268},{"relative_path":"evals/evals.json","size_in_bytes":12029},{"relative_path":"evals/trigger-evals.json","size_in_bytes":2454},{"relative_path":"references/evidence-model.md","siz...

Compare saved observations

Download comparison JSON

SKILL.md text changes

− removed · + added

--- before
+++ after
@@ -1,34 +1,27 @@
 ---
 name: research-attempt
 description: >-
-  Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, source-dependent implication, or claim-supporting computation. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.
+  Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.
 ---
 
 # Bounded mathematical research attempt
 
-Pursue one route far enough to obtain a durable result, a precise obstruction,
-or a well-identified next implication. This is a work-package boundary, not a
-reason to stop a broader user-authorized investigation. For sustained or
-multi-route requests, use the available `research-program` workflow, or continue
-successive attempts directly if it is unavailable. Do not turn the log into a
-transcript.
+Pursue one route to a durable result, precise obstruction or next implication.
+A bounded package does not end a broader authorized investigation. Continue with
+available `research-program` (`mathbox:research-program` in plugin installations),
+or directly if unavailable. Honor existing authority; do not turn the log into
+a transcript.
 
 ## Resolve project context
 
-Determine the repository root first. Read the applicable `AGENTS.md`, the
-current status summary when present, and only the files relevant to the target.
-Search a large status, claims file, or history index for relevant sections
-rather than loading it wholesale. Resolve project roles from the paths
-named there. When not explicit, look for the standard alternatives in
-[project-context.md](references/project-context.md). Interpret every project
-path relative to the repository root, never relative to this installed
-`mathbox:research-attempt` plugin skill (or its standalone installation).
-
-If the project uses `.mathbox/`, use the available `research-state` skill's
-brief check and goal handoff, opening full details only for the relevant
-contracts and evidence. Check freshness and the target's dependency closure
-before trusting a status label. Otherwise use the existing prose evidence records. A clean ledger
-is bookkeeping evidence, not mathematical verification.
+Read applicable instructions and current summary; search large files for the
+target rather than loading them wholesale. Resolve designated paths, or use
+[project-context.md](references/project-context.md); paths are project-relative,
+never skill-relative. Follow history entry points to relevant route indexes.
+Use available `research-state` (`mathbox:research-state` in plugin installations)
+for brief checks and registered-goal handoffs, inspecting relevant contracts,
+reviews and dependency closure before trusting labels. If unavailable, inspect
+prose evidence directly. Clean bookkeeping is not mathematical verification.
 
 ## Open the route
 
@@ -39,19 +32,18 @@
    - hypotheses, coefficient domain, grading, variance, signs, finiteness,
      completion, equivariance, and range;
    - current evidence status and dependencies.
-3. Search the research-history index for the target and nearby mechanisms,
+3. Search the history entry point for the target and nearby mechanisms,
    then open only the nearest relevant records needed to find the first failed
    or unproved implication.
-4. State a falsifiable success criterion, a failure/no-go criterion, and the
-   cheapest decisive example, source check, or computation.
-5. Choose one route within the current program. Match it against prior failed
-   mechanisms, not merely prior titles. Retrying a mechanism with an established
+4. State falsifiable success and failure/no-go criteria, and the cheapest decisive
+   example, source check or computation.
+5. Choose one program route and compare mechanisms with prior failures.
+   Retrying a mechanism with an established
    obstruction requires a new input, invariant, construction or hypothesis that
    addresses its first failed step. An unresolved step is not an obstruction;
    resuming an untried or deferred continuation needs a concrete next action,
-   not a new mathematical premise. When resuming a stalled step, state what
-   differs from the stalled attempt: a narrower sub-step, method, tool or
-   resource. Do not rerun it unchanged.
+   not a new mathematical premise. State what changes when resuming a stalled
+   step: sub-step, method, tool or resource; do not rerun unchanged.
 
 Use the route card in [route-card.md](references/route-card.md) when a durable
 entry will be needed.
@@ -72,25 +64,19 @@
   a unit, augmentation, suspension or induction boundary is involved.
 - Do not repair a failed type, sign, variance, normalization, or completion
   check by silently changing the statement or convention.
-- Route every load-bearing question about what an external mathematical source
-  proves through the available `literature-check` skill
-  (`mathbox:literature-check` in plugin installations). That workflow checks an
-  authorized project-local cache before fetching. If the skill is unavailable,
-  perform the exact-source check directly with available tools. If the source
-  cannot be verified, leave the input conditional; snippets and memory do not
-  discharge it.
-- For computation, separate the mathematical claim from the finite assertion
-  implemented. Record domain, bounds, seed, versions, inputs, runtime, and
-  non-claims; use the `mathbox:computation-audit` plugin skill when
-  appropriate.
+- Use the available `literature-check` skill (`mathbox:literature-check` in plugin
+  installations) for external theorem questions and `computation-audit`
+  (`mathbox:computation-audit`) for finite evidence. If unavailable, perform the
+  exact-source or finite-evidence checks directly and disclose limits. Record
+  computational domain, bounds, seed, versions, inputs, runtime and non-claims;
+  leave unverified sources conditional.
 - Before calling a finite sweep exhaustive, compare the claimed population with
   the actual iterator, filters and skipped cases. Sampling requires a proved
   coverage reduction.
-- After any bounded success, pause before extending the arity, range, or case
-  ladder. Identify the minimal structural features used, separate uniform
-  features from case-specific coincidences, and formulate the candidate
-  uniform lemma or obstruction. Run another finite case only if it
-  discriminates between named alternatives or enters a genuinely new regime.
+- After bounded success, identify uniform structural features versus case-specific
+  coincidences and formulate a uniform lemma or obstruction before extending
+  the case ladder. Another finite case must discriminate named alternatives or
+  reach a new regime.
 - A timeout, failed search, or bounded computation is not a universal negative
   result.
 - A change to a registered convention requires explicit owner approval unless
@@ -101,27 +87,37 @@
 Use one of:
 
 - proved as written;
-- proved after an explicit restriction;
+- correct only after a stated restriction;
+- externally proved in the exact required form;
 - conditional on a named unverified input;
 - computationally verified only in a stated range;
 - heuristic or conjectural;
-- refuted, with the smallest counterexample found;
-- ill-typed or incomplete;
+- refuted, with a valid counterexample (smallest only in a stated search order
+  unless every smaller case is excluded);
+- incomplete, with the smallest missing implication;
+- ill-typed or internally inconsistent;
 - inconclusive, with the first unresolved implication.
 
-State the strongest surviving result. Never upgrade evidence because the route
-was long or persuasive.
+Read [evidence-model.md](references/evidence-model.md) before assigning labels or
+promoting claims. Outcome describes this attempt; evidence label describes the
+strongest surviving statement. An unsuccessful construction adding no evidence
+against an independently supported target leaves its label intact. If the target
+itself is ill-typed or its support invalidated, report the defect, affected evidence
+and dependents; use available `proof-audit` (`mathbox:proof-audit` in plugin
+installations), or audit directly if unavailable, and correct authorized durable
+status. Do not treat the old label as reliable or infer refutation from a failed
+construction. Never upgrade evidence for effort or persuasive prose.
 
 Classify this attempt separately from the route's disposition. If a construction
 is unresolved, say what you could not establish; do not infer that it is
 impossible. Preserve other proposed continuations as untried, obstructed with
 evidence, or deferred with a reason and resumption condition. An inconclusive
 attempt or a resource limit alone does not close the route. Return unfinished
-work to the program, or retain an executable handoff when only this bounded
+work to the program, or retain a continuation handoff when only this bounded
 attempt was authorized. Closing an unresolved route needs an account of why no
 known continuation remains executable within its stated scope.
 
-## Persist at a natural checkpoint
+## Persist at natural checkpoints
 
 Exploration may remain scratch work. Create durable records when the route
 produces reusable mathematics, a counterexample, a corrected dependency, a
@@ -132,45 +128,38 @@
 - Write one self-contained route record in the project-designated research
   records directory, or `research/records/` when none is designated. Use the
   format and filename rules in [route-card.md](references/route-card.md).
-- Append one compact linked entry to the project-designated route index. In a
-  small flat history this is normally `RESEARCH_LOG.md`; in a sustained
-  program it may be a program/phase index reached from the short top-level
-  history entry point. Do not add the same route to both levels or put route
-  details, commands, or dead ends in an index. If a hierarchical project has
-  no designated route index, resolve that location under its edit rules before
-  appending; do not turn the top-level program entry into a flat route log.
-- Update live status or claim obligations only when project state changed.
-- Treat live status as current state, not chronology. Keep its latest full
-  verification summary and link the route record or manifests for older runs.
-  Do not add another full checkpoint story. Replace a stacked dated narrative
-  with current facts and a link only when that narrative already has a durable
-  home (an indexed record, manifest, or closeout) and the project's edit policy
-  permits it. Otherwise leave it in place and report that compaction needs a
-  `research-program` closeout or `mathbox:research-init` migration.
-- In an executable ledger, record only changed contracts, evidence, reviews,
-  and route outcomes. A session alone needs no event. Use a prevalidated batch
-  for several necessary events while preserving their distinct types.
-- When persistence is authorized but this host cannot execute or write, use the
-  `research-state` deferred-handoff contract for the durable files, index entry,
-  and ledger proposals; report that local ingest has not yet recorded them.
+- Append one compact entry to the designated route index, never at both history
+  levels; see the route card. Update status only for material changes.
+- Replace an old live narrative with a link only once it has a durable home,
+  edit policy permits it and `pin-impact` finds no conflict. Otherwise report
+  pending program closeout or repository migration.
+- In a ledger, record changed contracts, evidence, reviews and route outcomes;
+  for an open continuation that must outlive the session, also record a run result
+  with a `continue` reconciliation through available `research-state`
+  (`mathbox:research-state` in plugin installations). If unavailable, preserve
+  equivalent prose fields and disclose that no events were recorded.
+- When delegated or parallel, write only in assigned scope. Return the route
+  record and proposed index/status/ledger updates, base checkpoint, actual inputs
+  and artifact hashes to the coordinator; do not edit shared live state or emit
+  a separate deferred packet.
+- For authorized standalone persistence on a non-writing host, use research-state's
+  deferred packet contract and say ingest is pending.
 - Once indexed, keep the record and index entry immutable. Record a correction
   in a new file with a `Corrects:` link and append it to the same designated
   route index. Do not create a program closeout for each attempt.
-- If the index still contains legacy long-form entries, do not rewrite them as
-  a side effect of this attempt. Use the new format prospectively and report
-  that a `mathbox:research-init` migration remains pending.
+- Preserve legacy long-form entries; use the new format prospectively. Route
+  migration to available `research-init` (`mathbox:research-init` in plugin
+  installations), or report it pending if unavailable.
 - Do not integrate into a manuscript unless that is separately requested.
 
-Evidence labels and promotion rules are summarized in
-[evidence-model.md](references/evidence-model.md).
-
 ## Verify and report
 
 Run the narrowest relevant documented check, then broader checks only when their
 risk trigger applies. Report:
 
 1. target and route;
-2. outcome and evidence label;
+2. attempt outcome, evidence label, route disposition and continuations;
+   base checkpoint and actual inputs when part of a program;
 3. decisive derivation, source, counterexample, or computation;
 4. durable files changed;
 5. commands run and exact scope;
Full technical diff · 3 changed fields

changed /description

BEFORE
"Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, source-dependent implication, or claim-supporting computation. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun."
AFTER
"Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun."

changed /included_files

BEFORE
[
  {
    "relative_path": "agents/openai.yaml",
    "size_in_bytes": 268
  },
  {
    "relative_path": "evals/evals.json",
    "size_in_bytes": 10086
  },
  {
    "relative_path": "evals/trigger-evals.json",
    "size_in_bytes": 1520
  },
  {
    "relative_path": "references/evidence-model.md",
    "size_in_bytes": 1876
  },
  {
    "relative_path": "references/project-context.md",
    "size_in_bytes": 864
  },
  {
    "relative_path": "references/route-card.md",
    "size_in_bytes": 2403
  },
  {
    "relative_path": "references/structural-moves.md",
    "size_in_bytes": 2543
  }
]
AFTER
[
  {
    "relative_path": "agents/openai.yaml",
    "size_in_bytes": 268
  },
  {
    "relative_path": "evals/evals.json",
    "size_in_bytes": 12029
  },
  {
    "relative_path": "evals/trigger-evals.json",
    "size_in_bytes": 2454
  },
  {
    "relative_path": "references/evidence-model.md",
    "size_in_bytes": 2589
  },
  {
    "relative_path": "references/project-context.md",
    "size_in_bytes": 1175
  },
  {
    "relative_path": "references/route-card.md",
    "size_in_bytes": 2944
  },
  {
    "relative_path": "references/structural-moves.md",
    "size_in_bytes": 2543
  }
]

changed /skill_md_contents

BEFORE
"---\nname: research-attempt\ndescription: >-\n  Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, source-dependent implication, or claim-supporting computation. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.\n---\n\n# Bounded mathematical research attempt\n\nPursue one route far enough to obtain a durable result, a precise obstruction,\nor a well-identified next implication. This is a work-package boundary, not a\nreason to stop a broader user-authorized investigation. For sustained or\nmulti-route requests, use the available `research-program` workflow, or continue\nsuccessive attempts directly if it is unavailable. Do not turn the log into a\ntranscript.\n\n## Resolve project context\n\nDetermine the repository root first. Read the applicable `AGENTS.md`, the\ncurrent status summary when present, and only the files relevant to the target.\nSearch a large status, claims file, or history index for relevant sections\nrather than loading it wholesale. Resolve project roles from the paths\nnamed there. When not explicit, look for the standard alternatives in\n[project-context.md](references/project-context.md). Interpret every project\npath relative to the repository root, never relative to this installed\n`mathbox:research-attempt` plugin skill (or its standalone installation).\n\nIf the project uses `.mathbox/`, use the available `research-state` skill's\nbrief check and goal handoff, opening full details only for the relevant\ncontracts and evidence. Check freshness and the target's dependency closure\nbefore trusting a status label. Otherwise use the existing prose evidence records. A clean ledger\nis bookkeeping evidence, not mathematical verification.\n\n## Open the route\n\n1. Inspect the worktree and preserve unrelated changes.\n2. Normalize the target:\n   - exact statement or decision;\n   - quantified objects and source/target types;\n   - hypotheses, coefficient domain, grading, variance, signs, finiteness,\n     completion, equivariance, and range;\n   - current evidence status and dependencies.\n3. Search the research-history index for the target and nearby mechanisms,\n   then open only the nearest relevant records needed to find the first failed\n   or unproved implication.\n4. State a falsifiable success criterion, a failure/no-go criterion, and the\n   cheapest decisive example, source check, or computation.\n5. Choose one route within the current program. Match it against prior failed\n   mechanisms, not merely prior titles. Retrying a mechanism with an established\n   obstruction requires a new input, invariant, construction or hypothesis that\n   addresses its first failed step. An unresolved step is not an obstruction;\n   resuming an untried or deferred continuation needs a concrete next action,\n   not a new mathematical premise. When resuming a stalled step, state what\n   differs from the stalled attempt: a narrower sub-step, method, tool or\n   resource. Do not rerun it unchanged.\n\nUse the route card in [route-card.md](references/route-card.md) when a durable\nentry will be needed.\n\nFor an obstructed structural route, consult the relevant moves in\n[structural-moves.md](references/structural-moves.md). Turn a proposed analogy\ninto a specific comparison, obstruction or discriminating invariant.\n\n## Execute\n\n- Begin with the smallest typed case capable of changing the conclusion.\n- Verify that the chosen example, representative and every intermediate\n  construction belong to the claimed domain; a convenient surrogate needs an\n  explicit comparison theorem before it can decide the route.\n- Search actively for counterexamples, boundary cases, convention failures,\n  circularity, and missing hypotheses.\n- Check nullary/unary or minimum-parameter cases and absolute degrees whenever\n  a unit, augmentation, suspension or induction boundary is involved.\n- Do not repair a failed type, sign, variance, normalization, or completion\n  check by silently changing the statement or convention.\n- Route every load-bearing question about what an external mathematical source\n  proves through the available `literature-check` skill\n  (`mathbox:literature-check` in plugin installations). That workflow checks an\n  authorized project-local cache before fetching. If the skill is unavailable,\n  perform the exact-source check directly with available tools. If the source\n  cannot be verified, leave the input conditional; snippets and memory do not\n  discharge it.\n- For computation, separate the mathematical claim from the finite assertion\n  implemented. Record domain, bounds, seed, versions, inputs, runtime, and\n  non-claims; use the `mathbox:computation-audit` plugin skill when\n  appropriate.\n- Before calling a finite sweep exhaustive, compare the claimed population with\n  the actual iterator, filters and skipped cases. Sampling requires a proved\n  coverage reduction.\n- After any bounded success, pause before extending the arity, range, or case\n  ladder. Identify the minimal structural features used, separate uniform\n  features from case-specific coincidences, and formulate the candidate\n  uniform lemma or obstruction. Run another finite case only if it\n  discriminates between named alternatives or enters a genuinely new regime.\n- A timeout, failed search, or bounded computation is not a universal negative\n  result.\n- A change to a registered convention requires explicit owner approval unless\n  the project instructions already authorize that exact correction.\n\n## Classify the outcome\n\nUse one of:\n\n- proved as written;\n- proved after an explicit restriction;\n- conditional on a named unverified input;\n- computationally verified only in a stated range;\n- heuristic or conjectural;\n- refuted, with the smallest counterexample found;\n- ill-typed or incomplete;\n- inconclusive, with the first unresolved implication.\n\nState the strongest surviving result. Never upgrade evidence because the route\nwas long or persuasive.\n\nClassify this attempt separately from the route's disposition. If a construction\nis unresolved, say what you could not establish; do not infer that it is\nimpossible. Preserve other proposed continuations as untried, obstructed with\nevidence, or deferred with a reason and resumption condition. An inconclusive\nattempt or a resource limit alone does not close the route. Return unfinished\nwork to the program, or retain an executable handoff when only this bounded\nattempt was authorized. Closing an unresolved route needs an account of why no\nknown continuation remains executable within its stated scope.\n\n## Persist at a natural checkpoint\n\nExploration may remain scratch work. Create durable records when the route\nproduces reusable mathematics, a counterexample, a corrected dependency, a\nmaterial blocker, a convention decision, or a claim-supporting computation.\n\n- Put reusable proof or obstruction details in the project's durable proof\n  location.\n- Write one self-contained route record in the project-designated research\n  records directory, or `research/records/` when none is designated. Use the\n  format and filename rules in [route-card.md](references/route-card.md).\n- Append one compact linked entry to the project-designated route index. In a\n  small flat history this is normally `RESEARCH_LOG.md`; in a sustained\n  program it may be a program/phase index reached from the short top-level\n  history entry point. Do not add the same route to both levels or put route\n  details, commands, or dead ends in an index. If a hierarchical project has\n  no designated route index, resolve that location under its edit rules before\n  appending; do not turn the top-level program entry into a flat route log.\n- Update live status or claim obligations only when project state changed.\n- Treat live status as current state, not chronology. Keep its latest full\n  verification summary and link the route record or manifests for older runs.\n  Do not add another full checkpoint story. Replace a stacked dated narrative\n  with current facts and a link only when that narrative already has a durable\n  home (an indexed record, manifest, or closeout) and the project's edit policy\n  permits it. Otherwise leave it in place and report that compaction needs a\n  `research-program` closeout or `mathbox:research-init` migration.\n- In an executable ledger, record only changed contracts, evidence, reviews,\n  and route outcomes. A session alone needs no event. Use a prevalidated batch\n  for several necessary events while preserving their distinct types.\n- When persistence is authorized but this host cannot execute or write, use the\n  `research-state` deferred-handoff contract for the durable files, index entry,\n  and ledger proposals; report that local ingest has not yet recorded them.\n- Once indexed, keep the record and index entry immutable. Record a correction\n  in a new file with a `Corrects:` link and append it to the same designated\n  route index. Do not create a program closeout for each attempt.\n- If the index still contains legacy long-form entries, do not rewrite them as\n  a side effect of this attempt. Use the new format prospectively and report\n  that a `mathbox:research-init` migration remains pending.\n- Do not integrate into a manuscript unless that is separately requested.\n\nEvidence labels and promotion rules are summarized in\n[evidence-model.md](references/evidence-model.md).\n\n## Verify and report\n\nRun the narrowest relevant documented check, then broader checks only when their\nrisk trigger applies. Report:\n\n1. target and route;\n2. outcome and evidence label;\n3. decisive derivation, source, counterexample, or computation;\n4. durable files changed;\n5. commands run and exact scope;\n6. unresolved assumptions and the next mathematical question; when evidence is\n   bounded, include its uniform route or discriminating check.\n"
AFTER
"---\nname: research-attempt\ndescription: >-\n  Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.\n---\n\n# Bounded mathematical research attempt\n\nPursue one route to a durable result, precise obstruction or next implication.\nA bounded package does not end a broader authorized investigation. Continue with\navailable `research-program` (`mathbox:research-program` in plugin installations),\nor directly if unavailable. Honor existing authority; do not turn the log into\na transcript.\n\n## Resolve project context\n\nRead applicable instructions and current summary; search large files for the\ntarget rather than loading them wholesale. Resolve designated paths, or use\n[project-context.md](references/project-context.md); paths are project-relative,\nnever skill-relative. Follow history entry points to relevant route indexes.\nUse available `research-state` (`mathbox:research-state` in plugin installations)\nfor brief checks and registered-goal handoffs, inspecting relevant contracts,\nreviews and dependency closure before trusting labels. If unavailable, inspect\nprose evidence directly. Clean bookkeeping is not mathematical verification.\n\n## Open the route\n\n1. Inspect the worktree and preserve unrelated changes.\n2. Normalize the target:\n   - exact statement or decision;\n   - quantified objects and source/target types;\n   - hypotheses, coefficient domain, grading, variance, signs, finiteness,\n     completion, equivariance, and range;\n   - current evidence status and dependencies.\n3. Search the history entry point for the target and nearby mechanisms,\n   then open only the nearest relevant records needed to find the first failed\n   or unproved implication.\n4. State falsifiable success and failure/no-go criteria, and the cheapest decisive\n   example, source check or computation.\n5. Choose one program route and compare mechanisms with prior failures.\n   Retrying a mechanism with an established\n   obstruction requires a new input, invariant, construction or hypothesis that\n   addresses its first failed step. An unresolved step is not an obstruction;\n   resuming an untried or deferred continuation needs a concrete next action,\n   not a new mathematical premise. State what changes when resuming a stalled\n   step: sub-step, method, tool or resource; do not rerun unchanged.\n\nUse the route card in [route-card.md](references/route-card.md) when a durable\nentry will be needed.\n\nFor an obstructed structural route, consult the relevant moves in\n[structural-moves.md](references/structural-moves.md). Turn a proposed analogy\ninto a specific comparison, obstruction or discriminating invariant.\n\n## Execute\n\n- Begin with the smallest typed case capable of changing the conclusion.\n- Verify that the chosen example, representative and every intermediate\n  construction belong to the claimed domain; a convenient surrogate needs an\n  explicit comparison theorem before it can decide the route.\n- Search actively for counterexamples, boundary cases, convention failures,\n  circularity, and missing hypotheses.\n- Check nullary/unary or minimum-parameter cases and absolute degrees whenever\n  a unit, augmentation, suspension or induction boundary is involved.\n- Do not repair a failed type, sign, variance, normalization, or completion\n  check by silently changing the statement or convention.\n- Use the available `literature-check` skill (`mathbox:literature-check` in plugin\n  installations) for external theorem questions and `computation-audit`\n  (`mathbox:computation-audit`) for finite evidence. If unavailable, perform the\n  exact-source or finite-evidence checks directly and disclose limits. Record\n  computational domain, bounds, seed, versions, inputs, runtime and non-claims;\n  leave unverified sources conditional.\n- Before calling a finite sweep exhaustive, compare the claimed population with\n  the actual iterator, filters and skipped cases. Sampling requires a proved\n  coverage reduction.\n- After bounded success, identify uniform structural features versus case-specific\n  coincidences and formulate a uniform lemma or obstruction before extending\n  the case ladder. Another finite case must discriminate named alternatives or\n  reach a new regime.\n- A timeout, failed search, or bounded computation is not a universal negative\n  result.\n- A change to a registered convention requires explicit owner approval unless\n  the project instructions already authorize that exact correction.\n\n## Classify the outcome\n\nUse one of:\n\n- proved as written;\n- correct only after a stated restriction;\n- externally proved in the exact required form;\n- conditional on a named unverified input;\n- computationally verified only in a stated range;\n- heuristic or conjectural;\n- refuted, with a valid counterexample (smallest only in a stated search order\n  unless every smaller case is excluded);\n- incomplete, with the smallest missing implication;\n- ill-typed or internally inconsistent;\n- inconclusive, with the first unresolved implication.\n\nRead [evidence-model.md](references/evidence-model.md) before assigning labels or\npromoting claims. Outcome describes this attempt; evidence label describes the\nstrongest surviving statement. An unsuccessful construction adding no evidence\nagainst an independently supported target leaves its label intact. If the target\nitself is ill-typed or its support invalidated, report the defect, affected evidence\nand dependents; use available `proof-audit` (`mathbox:proof-audit` in plugin\ninstallations), or audit directly if unavailable, and correct authorized durable\nstatus. Do not treat the old label as reliable or infer refutation from a failed\nconstruction. Never upgrade evidence for effort or persuasive prose.\n\nClassify this attempt separately from the route's disposition. If a construction\nis unresolved, say what you could not establish; do not infer that it is\nimpossible. Preserve other proposed continuations as untried, obstructed with\nevidence, or deferred with a reason and resumption condition. An inconclusive\nattempt or a resource limit alone does not close the route. Return unfinished\nwork to the program, or retain a continuation handoff when only this bounded\nattempt was authorized. Closing an unresolved route needs an account of why no\nknown continuation remains executable within its stated scope.\n\n## Persist at natural checkpoints\n\nExploration may remain scratch work. Create durable records when the route\nproduces reusable mathematics, a counterexample, a corrected dependency, a\nmaterial blocker, a convention decision, or a claim-supporting computation.\n\n- Put reusable proof or obstruction details in the project's durable proof\n  location.\n- Write one self-contained route record in the project-designated research\n  records directory, or `research/records/` when none is designated. Use the\n  format and filename rules in [route-card.md](references/route-card.md).\n- Append one compact entry to the designated route index, never at both history\n  levels; see the route card. Update status only for material changes.\n- Replace an old live narrative with a link only once it has a durable home,\n  edit policy permits it and `pin-impact` finds no conflict. Otherwise report\n  pending program closeout or repository migration.\n- In a ledger, record changed contracts, evidence, reviews and route outcomes;\n  for an open continuation that must outlive the session, also record a run result\n  with a `continue` reconciliation through available `research-state`\n  (`mathbox:research-state` in plugin installations). If unavailable, preserve\n  equivalent prose fields and disclose that no events were recorded.\n- When delegated or parallel, write only in assigned scope. Return the route\n  record and proposed index/status/ledger updates, base checkpoint, actual inputs\n  and artifact hashes to the coordinator; do not edit shared live state or emit\n  a separate deferred packet.\n- For authorized standalone persistence on a non-writing host, use research-state's\n  deferred packet contract and say ingest is pending.\n- Once indexed, keep the record and index entry immutable. Record a correction\n  in a new file with a `Corrects:` link and append it to the same designated\n  route index. Do not create a program closeout for each attempt.\n- Preserve legacy long-form entries; use the new format prospectively. Route\n  migration to available `research-init` (`mathbox:research-init` in plugin\n  installations), or report it pending if unavailable.\n- Do not integrate into a manuscript unless that is separately requested.\n\n## Verify and report\n\nRun the narrowest relevant documented check, then broader checks only when their\nrisk trigger applies. Report:\n\n1. target and route;\n2. attempt outcome, evidence label, route disposition and continuations;\n   base checkpoint and actual inputs when part of a program;\n3. decisive derivation, source, counterexample, or computation;\n4. durable files changed;\n5. commands run and exact scope;\n6. unresolved assumptions and the next mathematical question; when evidence is\n   bounded, include its uniform route or discriminating check.\n"
Full snapshot data
{
  "description": "Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.",
  "included_files": [
    {
      "relative_path": "agents/openai.yaml",
      "size_in_bytes": 268
    },
    {
      "relative_path": "evals/evals.json",
      "size_in_bytes": 12029
    },
    {
      "relative_path": "evals/trigger-evals.json",
      "size_in_bytes": 2454
    },
    {
      "relative_path": "references/evidence-model.md",
      "size_in_bytes": 2589
    },
    {
      "relative_path": "references/project-context.md",
      "size_in_bytes": 1175
    },
    {
      "relative_path": "references/route-card.md",
      "size_in_bytes": 2944
    },
    {
      "relative_path": "references/structural-moves.md",
      "size_in_bytes": 2543
    }
  ],
  "name": "research-attempt",
  "skill_md_contents": "---\nname: research-attempt\ndescription: >-\n  Run one bounded, auditable mathematical research route: a proof attempt, reduction, counterexample search, or a computational or source-based attack. Use when the user explicitly asks to attack a research question or invokes this skill. Do not use to audit an existing proof, computation or source alone, or for a sustained multi-route investigation that continues after failed approaches, routine editing, explanation, or an unchanged verification rerun.\n---\n\n# Bounded mathematical research attempt\n\nPursue one route to a durable result, precise obstruction or next implication.\nA bounded package does not end a broader authorized investigation. Continue with\navailable `research-program` (`mathbox:research-program` in plugin installations),\nor directly if unavailable. Honor existing authority; do not turn the log into\na transcript.\n\n## Resolve project context\n\nRead applicable instructions and current summary; search large files for the\ntarget rather than loading them wholesale. Resolve designated paths, or use\n[project-context.md](references/project-context.md); paths are project-relative,\nnever skill-relative. Follow history entry points to relevant route indexes.\nUse available `research-state` (`mathbox:research-state` in plugin installations)\nfor brief checks and registered-goal handoffs, inspecting relevant contracts,\nreviews and dependency closure before trusting labels. If unavailable, inspect\nprose evidence directly. Clean bookkeeping is not mathematical verification.\n\n## Open the route\n\n1. Inspect the worktree and preserve unrelated changes.\n2. Normalize the target:\n   - exact statement or decision;\n   - quantified objects and source/target types;\n   - hypotheses, coefficient domain, grading, variance, signs, finiteness,\n     completion, equivariance, and range;\n   - current evidence status and dependencies.\n3. Search the history entry point for the target and nearby mechanisms,\n   then open only the nearest relevant records needed to find the first failed\n   or unproved implication.\n4. State falsifiable success and failure/no-go criteria, and the cheapest decisive\n   example, source check or computation.\n5. Choose one program route and compare mechanisms with prior failures.\n   Retrying a mechanism with an established\n   obstruction requires a new input, invariant, construction or hypothesis that\n   addresses its first failed step. An unresolved step is not an obstruction;\n   resuming an untried or deferred continuation needs a concrete next action,\n   not a new mathematical premise. State what changes when resuming a stalled\n   step: sub-step, method, tool or resource; do not rerun unchanged.\n\nUse the route card in [route-card.md](references/route-card.md) when a durable\nentry will be needed.\n\nFor an obstructed structural route, consult the relevant moves in\n[structural-moves.md](references/structural-moves.md). Turn a proposed analogy\ninto a specific comparison, obstruction or discriminating invariant.\n\n## Execute\n\n- Begin with the smallest typed case capable of changing the conclusion.\n- Verify that the chosen example, representative and every intermediate\n  construction belong to the claimed domain; a convenient surrogate needs an\n  explicit comparison theorem before it can decide the route.\n- Search actively for counterexamples, boundary cases, convention failures,\n  circularity, and missing hypotheses.\n- Check nullary/unary or minimum-parameter cases and absolute degrees whenever\n  a unit, augmentation, suspension or induction boundary is involved.\n- Do not repair a failed type, sign, variance, normalization, or completion\n  check by silently changing the statement or convention.\n- Use the available `literature-check` skill (`mathbox:literature-check` in plugin\n  installations) for external theorem questions and `computation-audit`\n  (`mathbox:computation-audit`) for finite evidence. If unavailable, perform the\n  exact-source or finite-evidence checks directly and disclose limits. Record\n  computational domain, bounds, seed, versions, inputs, runtime and non-claims;\n  leave unverified sources conditional.\n- Before calling a finite sweep exhaustive, compare the claimed population with\n  the actual iterator, filters and skipped cases. Sampling requires a proved\n  coverage reduction.\n- After bounded success, identify uniform structural features versus case-specific\n  coincidences and formulate a uniform lemma or obstruction before extending\n  the case ladder. Another finite case must discriminate named alternatives or\n  reach a new regime.\n- A timeout, failed search, or bounded computation is not a universal negative\n  result.\n- A change to a registered convention requires explicit owner approval unless\n  the project instructions already authorize that exact correction.\n\n## Classify the outcome\n\nUse one of:\n\n- proved as written;\n- correct only after a stated restriction;\n- externally proved in the exact required form;\n- conditional on a named unverified input;\n- computationally verified only in a stated range;\n- heuristic or conjectural;\n- refuted, with a valid counterexample (smallest only in a stated search order\n  unless every smaller case is excluded);\n- incomplete, with the smallest missing implication;\n- ill-typed or internally inconsistent;\n- inconclusive, with the first unresolved implication.\n\nRead [evidence-model.md](references/evidence-model.md) before assigning labels or\npromoting claims. Outcome describes this attempt; evidence label describes the\nstrongest surviving statement. An unsuccessful construction adding no evidence\nagainst an independently supported target leaves its label intact. If the target\nitself is ill-typed or its support invalidated, report the defect, affected evidence\nand dependents; use available `proof-audit` (`mathbox:proof-audit` in plugin\ninstallations), or audit directly if unavailable, and correct authorized durable\nstatus. Do not treat the old label as reliable or infer refutation from a failed\nconstruction. Never upgrade evidence for effort or persuasive prose.\n\nClassify this attempt separately from the route's disposition. If a construction\nis unresolved, say what you could not establish; do not infer that it is\nimpossible. Preserve other proposed continuations as untried, obstructed with\nevidence, or deferred with a reason and resumption condition. An inconclusive\nattempt or a resource limit alone does not close the route. Return unfinished\nwork to the program, or retain a continuation handoff when only this bounded\nattempt was authorized. Closing an unresolved route needs an account of why no\nknown continuation remains executable within its stated scope.\n\n## Persist at natural checkpoints\n\nExploration may remain scratch work. Create durable records when the route\nproduces reusable mathematics, a counterexample, a corrected dependency, a\nmaterial blocker, a convention decision, or a claim-supporting computation.\n\n- Put reusable proof or obstruction details in the project's durable proof\n  location.\n- Write one self-contained route record in the project-designated research\n  records directory, or `research/records/` when none is designated. Use the\n  format and filename rules in [route-card.md](references/route-card.md).\n- Append one compact entry to the designated route index, never at both history\n  levels; see the route card. Update status only for material changes.\n- Replace an old live narrative with a link only once it has a durable home,\n  edit policy permits it and `pin-impact` finds no conflict. Otherwise report\n  pending program closeout or repository migration.\n- In a ledger, record changed contracts, evidence, reviews and route outcomes;\n  for an open continuation that must outlive the session, also record a run result\n  with a `continue` reconciliation through available `research-state`\n  (`mathbox:research-state` in plugin installations). If unavailable, preserve\n  equivalent prose fields and disclose that no events were recorded.\n- When delegated or parallel, write only in assigned scope. Return the route\n  record and proposed index/status/ledger updates, base checkpoint, actual inputs\n  and artifact hashes to the coordinator; do not edit shared live state or emit\n  a separate deferred packet.\n- For authorized standalone persistence on a non-writing host, use research-state's\n  deferred packet contract and say ingest is pending.\n- Once indexed, keep the record and index entry immutable. Record a correction\n  in a new file with a `Corrects:` link and append it to the same designated\n  route index. Do not create a program closeout for each attempt.\n- Preserve legacy long-form entries; use the new format prospectively. Route\n  migration to available `research-init` (`mathbox:research-init` in plugin\n  installations), or report it pending if unavailable.\n- Do not integrate into a manuscript unless that is separately requested.\n\n## Verify and report\n\nRun the narrowest relevant documented check, then broader checks only when their\nrisk trigger applies. Report:\n\n1. target and route;\n2. attempt outcome, evidence label, route disposition and continuations;\n   base checkpoint and actual inputs when part of a program;\n3. decisive derivation, source, counterexample, or computation;\n4. durable files changed;\n5. commands run and exact scope;\n6. unresolved assumptions and the next mathematical question; when evidence is\n   bounded, include its uniform route or discriminating check.\n"
}

SHA-256 of public snapshot: 12ee0e87b04db059e682d44f48311948e16abbbe706aec2315ea125bd864b37f