[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M78E02HTK2395Q6ZZRB1Z7SW":3,"skill-same:01M78E02HTK2395Q6ZZRB1Z7SW":51},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":28,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":30,"install":31,"resources":44},"01M78E02HTK2395Q6ZZRB1Z7SW","brainstorm",null,"Brainstorm the intervention — ~10 candidates for a named problem in any domain, from today to a quarter-long bet. Use on \"brainstorm interventions\", \"show me options\". NOT for design variants.","ajitta\u002Fknow-your-unknowns","ajitta","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F10125909?v=4","01M78DYNVE4A35YFEBKBJNKJX4","01M78DYNWK9J1VH59EKN8D93A9",2,"MIT","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fbrainstorm\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: brainstorm\ndescription: >\n  Brainstorm the intervention — ~10 candidates for a named problem in any domain, from\n  today to a quarter-long bet. Use on \"brainstorm interventions\", \"show me options\". NOT\n  for design variants.\n---\n\n# Brainstorm — Solution-Space Map (Brainstorm the Intervention)\n\nThis skill serves what neither the user nor you know yet, and surfaces both sides' unknowns.\n\nWhen you and the user both seem to understand the request, do it without this method: if its result carries weight (it ships, is sent or is hard to undo), first read back in 2–3 lines the request as you understand it, the assumptions you are making and what outcome counts as done, as the whole reply, and do it once the user confirms; a self-evident request (fix a typo) needs no read-back. When the read-back exposes a mismatch, route by who does not know: the user → the **teach-me** skill; you → the **interview** skill; neither of you → the **blindspot** skill. A misread weighty request costs the work built on it; a read-back costs one exchange.\n\nJumping on the first solution leaves the rest of the solution space unknown. The user picks; you draw the space.\n\n## Iron Rules\n\n1. **The output is a map of solutions, not a solution.** It ends at the user's assembled selection.\n2. Spread candidates **across time horizons and approaches**, not 10 near-duplicates.\n\n## Procedure\n\n1. Get the problem statement and constraints (timeline, people, cost) from the text the user gave with the request or after the skill name and the conversation. If they are empty or vague, ask back once for a measurable statement: which metric, how bad, since when, for whom. One round only. If the answer is still vague or the user skips, generate the candidates anyway and state the assumed metric and constraints above them.\n\n   **Your own unknowns**: say what you do not know about the user's situation, what you are assuming, and what you cannot check, and ask the user to fill or correct them. When you ask back for the problem statement, put these in the same round; otherwise put them above the candidates in step 3 and go on without waiting for the answers.\n2. Before generating candidates in step 3, look for what already exists but is not used for this problem: in a codebase, machinery that sits disconnected; elsewhere, resources, programs, people or partnerships already in reach.\n\n   a. Search the material yourself or use the `unknowns:unknowns-scout` agent.\n\n   b. When you spawn the scout, the packet overrides the scout's default output (its finding table and improved prompt draft). The packet gives the scout the problem statement, the constraints and where to search, and asks it to return an **inventory**, one row per existing mechanism that bears on the problem, with the columns where it is \u002F what it does today \u002F what is missing to put it to use \u002F evidence \u002F status (confirmed \u002F inferred); the scout is done when its procedure is done and every mechanism it found has a row.\n\n   c. When the scout returns, put its **Questions to answer**, **Information still needed** and **Needs checking** lists above the candidates in step 3, for the user to answer or check.\n\n   Without a tool, do the step in the conversation and say what could not be checked.\n\n   The cheapest candidates are usually connecting what exists, not building.\n3. Generate **~10** candidate interventions with judgment deferred, spread across the time axis (this afternoon \u002F short-term (up to a month) \u002F mid-term (1–3 months) \u002F quarter-long bets (longer)) and across approaches, the unlikely ones included. Give each only:\n   - name\n   - one-line description: what it would change\n   - `Already exists — \u003Cwhere>`, when the candidate builds on something step 2 found\n\n   Ranking, pruning, sizing and any recommendation wait for the user's picks (steps 4–5). Judging while generating keeps the first safe ideas and stops the list before the unexpected ones (Osborn: defer judgment, go for quantity).\n4. End the reply by asking which candidate numbers **resonate**; those are the picks. The picks show the user's priorities, which you do not know yet; a recommendation added after the list makes the pick for them.\n5. Once the user names the picks, attach these fields to each picked candidate:\n   - expected impact: what improves, by how much\n   - effort size: S\u002FM\u002FL\u002FXL\n   - key risks\n   - how to measure success: the sign that it moved the stated problem, not only that it was done\n\n   The picked numbers assemble into a copyable \"proceed with these, in this order\"; a missing pick is undecided.\n\n## Output\n\nLayout: numbered candidates on a time axis (this afternoon → quarter-long bet).\n\n## Related\n\nAfter step 5, suggest the next skill by what is still open:\n\n| Still open | Skill |\n|---|---|\n| The form is in question | **prototypes** |\n| Decisions only the user can make | **interview** |\n| The plan for the work | **tweakable-plan** |\n","# Brainstorm — Solution-Space Map (Brainstorm the Intervention)\n\nThis skill serves what neither the user nor you know yet, and surfaces both sides' unknowns.\n\nWhen you and the user both seem to understand the request, do it without this method: if its result carries weight (it ships, is sent or is hard to undo), first read back in 2–3 lines the request as you understand it, the assumptions you are making and what outcome counts as done, as the whole reply, and do it once the user confirms; a self-evident request (fix a typo) needs no read-back. When the read-back exposes a mismatch, route by who does not know: the user → the **teach-me** skill; you → the **interview** skill; neither of you → the **blindspot** skill. A misread weighty request costs the work built on it; a read-back costs one exchange.\n\nJumping on the first solution leaves the rest of the solution space unknown. The user picks; you draw the space.\n\n## Iron Rules\n\n1. **The output is a map of solutions, not a solution.** It ends at the user's assembled selection.\n2. Spread candidates **across time horizons and approaches**, not 10 near-duplicates.\n\n## Procedure\n\n1. Get the problem statement and constraints (timeline, people, cost) from the text the user gave with the request or after the skill name and the conversation. If they are empty or vague, ask back once for a measurable statement: which metric, how bad, since when, for whom. One round only. If the answer is still vague or the user skips, generate the candidates anyway and state the assumed metric and constraints above them.\n\n   **Your own unknowns**: say what you do not know about the user's situation, what you are assuming, and what you cannot check, and ask the user to fill or correct them. When you ask back for the problem statement, put these in the same round; otherwise put them above the candidates in step 3 and go on without waiting for the answers.\n2. Before generating candidates in step 3, look for what already exists but is not used for this problem: in a codebase, machinery that sits disconnected; elsewhere, resources, programs, people or partnerships already in reach.\n\n   a. Search the material yourself or use the `unknowns:unknowns-scout` agent.\n\n   b. When you spawn the scout, the packet overrides the scout's default output (its finding table and improved prompt draft). The packet gives the scout the problem statement, the constraints and where to search, and asks it to return an **inventory**, one row per existing mechanism that bears on the problem, with the columns where it is \u002F what it does today \u002F what is missing to put it to use \u002F evidence \u002F status (confirmed \u002F inferred); the scout is done when its procedure is done and every mechanism it found has a row.\n\n   c. When the scout returns, put its **Questions to answer**, **Information still needed** and **Needs checking** lists above the candidates in step 3, for the user to answer or check.\n\n   Without a tool, do the step in the conversation and say what could not be checked.\n\n   The cheapest candidates are usually connecting what exists, not building.\n3. Generate **~10** candidate interventions with judgment deferred, spread across the time axis (this afternoon \u002F short-term (up to a month) \u002F mid-term (1–3 months) \u002F quarter-long bets (longer)) and across approaches, the unlikely ones included. Give each only:\n   - name\n   - one-line description: what it would change\n   - `Already exists — \u003Cwhere>`, when the candidate builds on something step 2 found\n\n   Ranking, pruning, sizing and any recommendation wait for the user's picks (steps 4–5). Judging while generating keeps the first safe ideas and stops the list before the unexpected ones (Osborn: defer judgment, go for quantity).\n4. End the reply by asking which candidate numbers **resonate**; those are the picks. The picks show the user's priorities, which you do not know yet; a recommendation added after the list makes the pick for them.\n5. Once the user names the picks, attach these fields to each picked candidate:\n   - expected impact: what improves, by how much\n   - effort size: S\u002FM\u002FL\u002FXL\n   - key risks\n   - how to measure success: the sign that it moved the stated problem, not only that it was done\n\n   The picked numbers assemble into a copyable \"proceed with these, in this order\"; a missing pick is undecided.\n\n## Output\n\nLayout: numbered candidates on a time axis (this afternoon → quarter-long bet).\n\n## Related\n\nAfter step 5, suggest the next skill by what is still open:\n\n| Still open | Skill |\n|---|---|\n| The form is in question | **prototypes** |\n| Decisions only the user can make | **interview** |\n| The plan for the work | **tweakable-plan** |\n",{"name":5,"description":7},"main","f1a43ab1ad56e66493708bb8383ab8cd7dbda389","skills\u002Fbrainstorm",0,"https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns","https:\u002F\u002Fajitta.github.io\u002Fknow-your-unknowns\u002F","https:\u002F\u002Fgithub.com\u002Fajitta","2026-11-13 00:17:49",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add ajitta\u002Fknow-your-unknowns --skill brainstorm",{"tool":37,"command":38},"bunx","bunx skills add ajitta\u002Fknow-your-unknowns --skill brainstorm",{"tool":40,"command":41},"pnpm","pnpm dlx skills add ajitta\u002Fknow-your-unknowns --skill brainstorm","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fbrainstorm\u002FSKILL.md",true,[45],{"path":46,"resourceType":47,"resourceTypeDesc":48,"sizeBytes":49,"sourceHtmlUrl":50},"agents\u002Fopenai.yaml","REFERENCE","参考文档",258,"https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fbrainstorm\u002Fagents\u002Fopenai.yaml",[52,59,66,73,80,87],{"skillNo":53,"name":54,"nameZh":6,"description":55,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":56,"categories":57,"keywords":58,"publishedAt":18},"01M78E0W9N76BZGDDG14X7EAFX","unknowns-loop","Run the know-your-unknowns workflow end to end, ending with an outcome check. Use on \"unknowns loop\", \"run the operating loop\", \"know your unknowns\". A bare \"loop\" is NOT this.","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Funknowns-loop\u002FSKILL.md",[],[],{"skillNo":60,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":63,"categories":64,"keywords":65,"publishedAt":18},"01M78E0SQ91CY0RCXX51KK7T55","tweakable-plan","The tweakable plan — decisions most likely to change come first, with alternatives, for any work. Use on \"plan this\", \"make a plan\", \"tweakable plan\".","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Ftweakable-plan\u002FSKILL.md",[],[],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":18},"01M78E0PV11V4HF079XHEDBR48","teach-me","Teach me my unknowns — an explainer for a field's vocabulary and mental model, so vague requests become precise. Use on \"teach me\", \"make me an explainer\". Not a plan investigation.","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fteach-me\u002FSKILL.md",[],[],{"skillNo":74,"name":75,"nameZh":6,"description":76,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":77,"categories":78,"keywords":79,"publishedAt":18},"01M78E0KZXF9H786W6AF590Y27","reference","Point at a reference — read an example, show your reading for correction before building on it; runs even when the adaptation looks simple. Use on \"use this as a reference\", \"make it like this\".","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Freference\u002FSKILL.md",[],[],{"skillNo":81,"name":82,"nameZh":6,"description":83,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M78E0GWRA5C2WZJS4D6DYGBF","quiz","Comprehension quiz — explain the work, then quiz you so you can defend it at handover; runs even when a quiz is easy to write. Use on \"quiz me\", \"test my understanding\", or before merging.","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fquiz\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":93,"publishedAt":18},"01M78E0DSWFA5FV09TNEVVNR8T","prototypes","Prototypes — several versions of anything to react to, each on a different philosophy. Use on \"divergent prototypes\", \"design options\", \"versions to react to\", \"know it when I see it\".","https:\u002F\u002Fgithub.com\u002Fajitta\u002Fknow-your-unknowns\u002Fblob\u002Fmain\u002Fskills\u002Fprototypes\u002FSKILL.md",[],[]]