eureka-skill

Files (4)

• SKILL.md
• catalog.md · references/
• routing.md · references/
• eureka-program.md · templates/

SKILL.md (first lines)

# eureka_skill

Use **eureka_skill** as a routing layer for ambitious interdisciplinary work. It does not replace specialist skills or convert an attractive idea into a theorem, patent, safe design, or commercial product. It selects the smallest route that can establish the next bounded fact.

## Eureka workflow

1. **Frame the decision.** Define target, system boundary, deliverable, risk/cost of error, success metric, prohibited claims and stop condition.
2. **Build an evidence ledger.** Label every material statement sourced, computed, inferred, proposed or unresolved. Preserve source/artefact links and uncertainty.
3. **Select the minimum route.** Read [routing.md](references/routing.md) and choose only the specialist skills needed for the current gate.
4. **Create mechanisms, not slogans.** Require baseline, conserved/budgeted quantities, causal chain, counterfactual/negative control, predicted signature and falsifier.
5. **Formalize and compute responsibly.** Freeze inputs, units, data/seed policy, numerical/formal method, verification, validation, uncertainty, manifest and rerun command before execution.
6. **Run an adversarial gate.** Check alternatives, boundary/degenerate cases, sensitivity, hidden conditions, decision reversal and cost of error. Escalate high-consequence sensitive results to independent implementation or measurement.
7. **Deliver a bounded handoff.** State what was established, by which versioned artefact, over which regime, what remains a proof gap, and the next reversible action.

## Core collection

Read [catalog.md](references/catalog.md) when selecting a specialist or auditing the collection’s upgrade coverage.

| Layer | Skills |
|---|---|
| Framing and evidence | `critical-creative-thinking`, `research-synthesis-hypothesis`, `frontier-research-architect` |
| Discovery and mechanism | `innovation-breakthrough-design`, `contradiction-mechanism-lab`, `cross-domain-recombination`, `invention-generation-orchestrator` |
| Formalization and validation | `conjecture-formalization-lab`, `invention-validation-lab`, `bounded-invention-engineering` |
| Mathematical and super computation | `advanced-mathematics-computation`, `math-research-orchestrator`, `eureka-computational-lab`, `eureka-design-space-lab`, `eureka-formal-logic-lab` |

## Default deliverable

Start from [eureka-program.md](templates/eureka-program.md). Do not claim a result exceeds the strongest completed evidence layer. For instance, a finite numerical pass is finite computed evidence; an exhaustive search is only as strong as its coverage proof; a converged simulation is not automatically a validated model.

## Completion gate

Finish only with a decision, evidence classification, versioned artefact locations, reproducibility/VVUQ status where applicable, proof-gap ledger and next bounded action. Stop for user approval before irreversible external action.

From minagayid/innovator, MIT.

More from minagayid/innovator