[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7APZ4H05JHX78K2QY9QJWN3":3,"skill-same:01M7APZ4H05JHX78K2QY9QJWN3":49},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":26,"commitSha":27,"skillDirectory":28,"forksCount":29,"repositoryHtmlUrl":30,"repositoryHomepageUrl":6,"ownerHtmlUrl":31,"ownerBlogUrl":32,"ownerDescription":33,"updatedAt":34,"install":35,"resources":48},"01M7APZ4H05JHX78K2QY9QJWN3","ramza-discover",null,"Open-ended requirements & stakeholder\u002Fgoal elicitation BEFORE CLARIFY. Use when the GOAL itself is underspecified (IDEA\u002FSTRATEGIC intent) — distinct from CLARIFY, which disambiguates an already-known goal. Read-only, bounded, mechanically countable coverage gate; produces an elicitation summary, never a plan.","Rynaro\u002Fmagicite","Rynaro","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F5271543?v=4","01M70CFYFMB316W23THVQAQ42M","Henrique A. Lavezzo","01M7APN2KCVWBNY727T57KR2ZJ",2,"Apache-2.0","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002F.eidolons\u002Framza\u002Fskills\u002Fdiscover\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: ramza-discover\ndescription: \"Open-ended requirements & stakeholder\u002Fgoal elicitation BEFORE CLARIFY. Use when the GOAL itself is underspecified (IDEA\u002FSTRATEGIC intent) — distinct from CLARIFY, which disambiguates an already-known goal. Read-only, bounded, mechanically countable coverage gate; produces an elicitation summary, never a plan.\"\nmetadata:\n  methodology: RAMZA\n---\n\n# RAMZA — DISCOVER Skill (pre-CLARIFY elicitation)\n\nUse this skill when the request's **objective itself is unknown or latent** — not\nmerely when the spec details are ambiguous. DISCOVER runs BEFORE CLARIFY and hands\nCLARIFY a structured elicitation summary.\n\n## When to run DISCOVER (vs CLARIFY)\n\n| | DISCOVER | CLARIFY |\n|---|---|---|\n| **Precondition** | Goal is unknown \u002F latent | Goal is known; spec details ambiguous |\n| **Intent types** | `IDEA`, `STRATEGIC`, any under-GOALED request | `REQUEST`, `CHANGE`, `BUG_SPEC` |\n| **Question style** | Open-ended discovery of goals, stakeholders, success | ≤3 plan-shape disambiguation questions |\n| **Output** | Elicitation summary → handed to CLARIFY | WHO\u002FWHAT\u002FWHY\u002FCONSTRAINTS parse → Scope |\n\n**Boundary rule:** DISCOVER = \"what are we even trying to achieve, and for whom?\"\nCLARIFY = \"the goal is clear; which of these plan shapes do you want?\" Do NOT run\nDISCOVER on a well-GOALED request — go straight to CLARIFY.\n\nWhy this exists: specification\u002Fsystem-design is the dominant multi-agent failure\ncategory (MAST — ~43.8% of failures), and multi-agent systems collapse toward ~30%\naccuracy when latent stakeholder knowledge is never actively elicited (HiddenBench).\nCLARIFY alone cannot close this — its ≤3 plan-shape contract assumes the goal is\nalready known. This sub-mode is inherited unchanged from SPECTRA (see\n`DESIGN-RATIONALE.md` D2 — the discipline spine is the part the audits praised;\nDISCOVER's failure mode was never its elicitation design).\n\n## Elicitation protocol (bounded, read-only)\n\nSurface, do not assume. For each axis, record what is known and emit a `[GAP]`\nmarker for each unknown rather than inventing an answer:\n\n1. **Stakeholders** — Who requests this? Who is affected? Who approves\u002Freviews?\n   Map the approval chain. `[GAP]` for each unidentified party.\n2. **Latent goals** — What is the underlying outcome (not the surface ask)?\n   What is the \"job to be done\"? Distinguish the stated request from the real goal.\n3. **Success metrics** — How will we know it worked? Target metric + current baseline\n   (e.g. \"p95 \u003C 200ms, currently 800ms\"). `[GAP]` when no measurable criterion exists.\n4. **Hard constraints** — Budget, deadline, tech-stack lock-in, compliance, platform.\n5. **Non-goals** — What is explicitly OUT of scope? Surface these early to prevent\n   scope creep downstream.\n\n## Bound (no unbounded interview loop)\n\nDISCOVER is elicitation + synthesis, NOT an interactive multi-turn interview agent.\n- Produce ONE elicitation summary in a single pass from available context + the host\n  conversation. Do not loop.\n- If coverage is low (≥2 of the 5 axes are `[GAP]` with no resolution path),\n  **escalate to the human** with the gap list — do not fabricate goals to proceed.\n- DISCOVER NEVER produces a plan and NEVER writes code. Its sole output is the\n  elicitation summary handed to CLARIFY.\n\n## Mechanical coverage contract\n\nThe 5 axes are line items a host can count mechanically — no re-reading DISCOVER's\nreasoning required:\n\n- Each axis line in the summary below is exactly one of two states: **resolved**\n  (the line contains no `[GAP]` token) or **unresolved** (the line contains the\n  literal token `[GAP]`).\n- `unresolved_count` = the number of axis lines (Stakeholders \u002F Latent goal \u002F\n  Success metrics \u002F Hard constraints \u002F Non-goals — the first 5 checklist lines\n  only, not the `Open gaps` \u002F `Coverage` lines that restate them) containing\n  `[GAP]`.\n- **Contract:** `unresolved_count >= 2` ⇒ **ESCALATE to human**, do not hand off\n  to CLARIFY. `unresolved_count \u003C= 1` ⇒ hand off to CLARIFY normally.\n- This is a mechanical count (e.g. `grep -c '\\[GAP\\]'` over the 5 checklist\n  lines), not a model self-assessment — a host or lint step can enforce the\n  ≥2-unresolved rule without re-deriving DISCOVER's judgment, exactly the same\n  posture as `ramza-lint`'s grep-level structural checks.\n\n## Output: elicitation summary\n\nA compact structured checklist (lives under `.spectra\u002F` like all RAMZA output).\nEach of the first 5 lines is the mechanically-countable unit described above:\n\n```\n## DISCOVER — Elicitation Summary\n- [ ] Stakeholders: \u003Clist | [GAP]>\n- [ ] Latent goal: \u003Crestated outcome | [GAP]>\n- [ ] Success metrics: \u003Cmetric + baseline | [GAP]>\n- [ ] Hard constraints: \u003Clist>\n- [ ] Non-goals: \u003Clist>\n- Open gaps: [GAP] \u003Ceach unknown, repeated from above for visibility>\n- Coverage: \u003Cn\u002F5 axes resolved> → handing to CLARIFY | ESCALATE to human\n```\n\nCheck the box (`- [x]`) for a resolved axis (no `[GAP]` on that line); leave it\nunchecked (`- [ ]`) when the line still carries `[GAP]`. `unresolved_count` is\nthe number of unchecked boxes, and MUST match the coverage line's arithmetic\n(`5 - n = unresolved_count`).\n\n## Hard constraints (P0)\n\n1. READ-ONLY. No code, no file edits, no mutations.\n2. Bounded — single-pass synthesis, `[GAP]`-and-escalate, never an interview loop.\n3. Emit `[GAP]` for every unknown; never assume latent intent.\n4. DISCOVER hands its summary to CLARIFY; it does not itself produce a plan.\n5. Coverage is mechanically countable: ≥2 unresolved `[GAP]` axes ⇒ escalate,\n   computed from the checklist, never eyeballed.\n6. Every output path lives under `.spectra\u002F` (see `SPEC.md`\n   \"Output discipline\").\n\nSee `SPEC.md` \"## Pre-phases\" for the full methodology section.\n\n---\n\n*RAMZA — DISCOVER sub-mode*\n","# RAMZA — DISCOVER Skill (pre-CLARIFY elicitation)\n\nUse this skill when the request's **objective itself is unknown or latent** — not\nmerely when the spec details are ambiguous. DISCOVER runs BEFORE CLARIFY and hands\nCLARIFY a structured elicitation summary.\n\n## When to run DISCOVER (vs CLARIFY)\n\n| | DISCOVER | CLARIFY |\n|---|---|---|\n| **Precondition** | Goal is unknown \u002F latent | Goal is known; spec details ambiguous |\n| **Intent types** | `IDEA`, `STRATEGIC`, any under-GOALED request | `REQUEST`, `CHANGE`, `BUG_SPEC` |\n| **Question style** | Open-ended discovery of goals, stakeholders, success | ≤3 plan-shape disambiguation questions |\n| **Output** | Elicitation summary → handed to CLARIFY | WHO\u002FWHAT\u002FWHY\u002FCONSTRAINTS parse → Scope |\n\n**Boundary rule:** DISCOVER = \"what are we even trying to achieve, and for whom?\"\nCLARIFY = \"the goal is clear; which of these plan shapes do you want?\" Do NOT run\nDISCOVER on a well-GOALED request — go straight to CLARIFY.\n\nWhy this exists: specification\u002Fsystem-design is the dominant multi-agent failure\ncategory (MAST — ~43.8% of failures), and multi-agent systems collapse toward ~30%\naccuracy when latent stakeholder knowledge is never actively elicited (HiddenBench).\nCLARIFY alone cannot close this — its ≤3 plan-shape contract assumes the goal is\nalready known. This sub-mode is inherited unchanged from SPECTRA (see\n`DESIGN-RATIONALE.md` D2 — the discipline spine is the part the audits praised;\nDISCOVER's failure mode was never its elicitation design).\n\n## Elicitation protocol (bounded, read-only)\n\nSurface, do not assume. For each axis, record what is known and emit a `[GAP]`\nmarker for each unknown rather than inventing an answer:\n\n1. **Stakeholders** — Who requests this? Who is affected? Who approves\u002Freviews?\n   Map the approval chain. `[GAP]` for each unidentified party.\n2. **Latent goals** — What is the underlying outcome (not the surface ask)?\n   What is the \"job to be done\"? Distinguish the stated request from the real goal.\n3. **Success metrics** — How will we know it worked? Target metric + current baseline\n   (e.g. \"p95 \u003C 200ms, currently 800ms\"). `[GAP]` when no measurable criterion exists.\n4. **Hard constraints** — Budget, deadline, tech-stack lock-in, compliance, platform.\n5. **Non-goals** — What is explicitly OUT of scope? Surface these early to prevent\n   scope creep downstream.\n\n## Bound (no unbounded interview loop)\n\nDISCOVER is elicitation + synthesis, NOT an interactive multi-turn interview agent.\n- Produce ONE elicitation summary in a single pass from available context + the host\n  conversation. Do not loop.\n- If coverage is low (≥2 of the 5 axes are `[GAP]` with no resolution path),\n  **escalate to the human** with the gap list — do not fabricate goals to proceed.\n- DISCOVER NEVER produces a plan and NEVER writes code. Its sole output is the\n  elicitation summary handed to CLARIFY.\n\n## Mechanical coverage contract\n\nThe 5 axes are line items a host can count mechanically — no re-reading DISCOVER's\nreasoning required:\n\n- Each axis line in the summary below is exactly one of two states: **resolved**\n  (the line contains no `[GAP]` token) or **unresolved** (the line contains the\n  literal token `[GAP]`).\n- `unresolved_count` = the number of axis lines (Stakeholders \u002F Latent goal \u002F\n  Success metrics \u002F Hard constraints \u002F Non-goals — the first 5 checklist lines\n  only, not the `Open gaps` \u002F `Coverage` lines that restate them) containing\n  `[GAP]`.\n- **Contract:** `unresolved_count >= 2` ⇒ **ESCALATE to human**, do not hand off\n  to CLARIFY. `unresolved_count \u003C= 1` ⇒ hand off to CLARIFY normally.\n- This is a mechanical count (e.g. `grep -c '\\[GAP\\]'` over the 5 checklist\n  lines), not a model self-assessment — a host or lint step can enforce the\n  ≥2-unresolved rule without re-deriving DISCOVER's judgment, exactly the same\n  posture as `ramza-lint`'s grep-level structural checks.\n\n## Output: elicitation summary\n\nA compact structured checklist (lives under `.spectra\u002F` like all RAMZA output).\nEach of the first 5 lines is the mechanically-countable unit described above:\n\n```\n## DISCOVER — Elicitation Summary\n- [ ] Stakeholders: \u003Clist | [GAP]>\n- [ ] Latent goal: \u003Crestated outcome | [GAP]>\n- [ ] Success metrics: \u003Cmetric + baseline | [GAP]>\n- [ ] Hard constraints: \u003Clist>\n- [ ] Non-goals: \u003Clist>\n- Open gaps: [GAP] \u003Ceach unknown, repeated from above for visibility>\n- Coverage: \u003Cn\u002F5 axes resolved> → handing to CLARIFY | ESCALATE to human\n```\n\nCheck the box (`- [x]`) for a resolved axis (no `[GAP]` on that line); leave it\nunchecked (`- [ ]`) when the line still carries `[GAP]`. `unresolved_count` is\nthe number of unchecked boxes, and MUST match the coverage line's arithmetic\n(`5 - n = unresolved_count`).\n\n## Hard constraints (P0)\n\n1. READ-ONLY. No code, no file edits, no mutations.\n2. Bounded — single-pass synthesis, `[GAP]`-and-escalate, never an interview loop.\n3. Emit `[GAP]` for every unknown; never assume latent intent.\n4. DISCOVER hands its summary to CLARIFY; it does not itself produce a plan.\n5. Coverage is mechanically countable: ≥2 unresolved `[GAP]` axes ⇒ escalate,\n   computed from the checklist, never eyeballed.\n6. Every output path lives under `.spectra\u002F` (see `SPEC.md`\n   \"Output discipline\").\n\nSee `SPEC.md` \"## Pre-phases\" for the full methodology section.\n\n---\n\n*RAMZA — DISCOVER sub-mode*\n",{"name":5,"metadata":24,"description":7},{"methodology":25},"RAMZA","main","38c3a82583abf9806de764f89ac0099ad690933a",".eidolons\u002Framza\u002Fskills\u002Fdiscover",0,"https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite","https:\u002F\u002Fgithub.com\u002FRynaro","https:\u002F\u002Fhlavezzo.me","A Code Alchemist with a passion for weaving tales and inscribing transmutation circles in pure code.","2026-10-14 02:35:37",{"source":8,"skillName":5,"commands":36,"prompt":46,"zipAvailable":47},[37,40,43],{"tool":38,"command":39},"npx","npx skills add Rynaro\u002Fmagicite --skill ramza-discover",{"tool":41,"command":42},"bunx","bunx skills add Rynaro\u002Fmagicite --skill ramza-discover",{"tool":44,"command":45},"pnpm","pnpm dlx skills add Rynaro\u002Fmagicite --skill ramza-discover","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002F.eidolons\u002Framza\u002Fskills\u002Fdiscover\u002FSKILL.md",true,[],[50,57,64,71,78,85],{"skillNo":51,"name":52,"nameZh":6,"description":53,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":54,"categories":55,"keywords":56,"publishedAt":19},"01M7AQ4GHJQVV8TJBJ8T1V7ZQ9","wine-dxvk-cache-clear","Clear a stale DXVK shader cache that is causing graphical corruption in a\nWine or Proton game. Use when: a game shows corrupted textures or shader\nflicker that started after a driver or DXVK version change.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Ftoy-registry\u002Fskills\u002Fwine-dxvk-cache-clear\u002FSKILL.md",[],[],{"skillNo":58,"name":59,"nameZh":6,"description":60,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":61,"categories":62,"keywords":63,"publishedAt":19},"01M7AQ4CY1NHSMY1HCZ91387YY","steam-download-region-fix","Fix a Steam client stuck at very low download speed by changing its\ndownload region. Use when: Steam downloads are far below the local\ninternet speed for every game, not just one.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Ftoy-registry\u002Fskills\u002Fsteam-download-region-fix\u002FSKILL.md",[],[],{"skillNo":65,"name":66,"nameZh":6,"description":67,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":68,"categories":69,"keywords":70,"publishedAt":19},"01M7AQ49P7Y0CDRSYMPVABX80K","proton-battleye-eac-toggle","Toggle BattlEye or Easy Anti-Cheat runtime support for a Steam Proton game.\nUse when: a multiplayer game refuses to launch with an anti-cheat error under Proton.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Ftoy-registry\u002Fskills\u002Fproton-battleye-eac-toggle\u002FSKILL.md",[],[],{"skillNo":72,"name":73,"nameZh":6,"description":74,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":75,"categories":76,"keywords":77,"publishedAt":19},"01M7AQ45326FAP3X4Q86FK1X4N","vivi-verify-incoming","Load when reading any upstream artefact handed off to Vivi that carries a sibling .envelope.json. BLOCKING per ECL §6.2.2: the orchestrator MUST have verified the envelope's SHA-256 (eidolons verify-envelope --block \u002F eidolons run --verify) and recorded a verify_pass before dispatch. If no verify_pass exists for the message_id, or a verify_fail is present, REFUSE to process the payload and hand back to the orchestrator. Symmetric receiver gate — every Eidolon enforces it identically.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002F.eidolons\u002Fvivi\u002Fskills\u002Fverify-incoming\u002FSKILL.md",[],[],{"skillNo":79,"name":80,"nameZh":6,"description":81,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":82,"categories":83,"keywords":84,"publishedAt":19},"01M7AQ402861P0P3C2TEGFGMA1","vivi-parallel-tracks","Load ONLY under TRANCE authorization when the Plan phase yields N independent, non-overlapping implementation tracks (disjoint file sets). Operationalizes the TRANCE G4 form — parallel multi-track implementation in mandatory git-worktree isolation, max 5 clean-context tracks, a per-track verifier cascade, a non-fungible per-track ≤3 reflection budget, explicit stop conditions, and a single-threaded merge\u002Faggregation step. Absent TRANCE gating, Vivi runs exactly as today: single-track A→P→I→V→Δ\u002FR.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002F.eidolons\u002Fvivi\u002Fskills\u002Fparallel-tracks\u002FSKILL.md",[],[],{"skillNo":86,"name":87,"nameZh":6,"description":88,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":89,"categories":90,"keywords":91,"publishedAt":19},"01M7AQ3RH9BZF9ZMTC7VG5P7PB","vivi-methodology","Full Vivi cycle reference — A(nalyze) → P(lan) → I(mplement) → V(erify) → Δ(Delta)\u002FR(eflect). Use when the task is a non-trivial feature implementation in a brownfield codebase and you need the complete methodology reference: complexity routing, evidence-grounded planning rules, test-anchoring requirements, and failure-escalation thresholds.","https:\u002F\u002Fgithub.com\u002FRynaro\u002Fmagicite\u002Fblob\u002Fmain\u002F.eidolons\u002Fvivi\u002Fskills\u002Fmethodology\u002FSKILL.md",[],[]]