[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7APVDZXVA9X84ZPWP7K34GS":3,"skill-same:01M7APVDZXVA9X84ZPWP7K34GS":48},{"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":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7APVDZXVA9X84ZPWP7K34GS","uarch-isa-simulation-measurement-roofline-and-specialization",null,"Use when evaluating or reasoning about performance rather than building hardware: ISA design and what the choice actually determines, simulation and modelling, measuring microarchitectural behaviour honestly with performance counters and the traps in them, roofline analysis and the fundamental limits that bound any optimisation, and specialization and when a fixed-function unit wins.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fmicroarchitecture-and-memory-systems\u002Fskills\u002Fuarch-isa-simulation-measurement-roofline-and-specialization\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: uarch-isa-simulation-measurement-roofline-and-specialization\ndescription: \"Use when evaluating or reasoning about performance rather than building hardware: ISA design and what the choice actually determines, simulation and modelling, measuring microarchitectural behaviour honestly with performance counters and the traps in them, roofline analysis and the fundamental limits that bound any optimisation, and specialization and when a fixed-function unit wins.\"\n---\n\n# Microarchitecture and Memory: ISA Design, Simulation and Modelling, Measuring It, Roofline and Fundamental Limits, and Specialization\n\n> **Part 5 of 6** of the *CPU, GPU, NPU and Memory Microarchitecture* reference (plugin `microarchitecture-and-memory-systems`), covering §20–§24. Sibling skills: `uarch-pipelining-out-of-order-branch-prediction-and-simd` (§0–§5), `uarch-caches-coherence-consistency-and-virtual-memory` (§6–§10), `uarch-gpu-npu-dataflow-and-numeric-formats` (§11–§14), `uarch-dram-memory-controllers-power-and-security` (§15–§19), `uarch-reference` (§25–§30). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The principles are stable. Two areas moved. See §25 → `uarch-reference` for low-precision numeric formats, and next-generation memory standards.\n\n> **⚠️ SCOPE, because this sits between two neighbours.** ⚠️ **A semiconductor reference\n> covers device physics and fabrication — how a transistor works and how it's made. A\n> computer-hardware reference covers system integration — components, builds, facilities.**\n> **⚠️ THIS file is the layer in between: how billions of transistors are ORGANIZED into\n> something that executes instructions fast, and why memory systems are the hard part.**\n> ⚠️ **It assumes the other two rather than repeating them.**\n>\n> **⚠️ GOTCHA** boxes mark where architectural intuition is wrong and where the\n> abstraction leaks.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ THE PROCESSOR LIES TO YOU, DELIBERATELY** (§2–§4 → `uarch-pipelining-out-of-order-branch-prediction-and-simd`). **Instructions do not execute\n>    in program order, memory operations do not become visible in program order, and the\n>    architecture works hard to maintain the illusion that they do. Every performance\n>    surprise and several security disasters live in the gap.**\n> 2. **⚠️ MOVING DATA COSTS FAR MORE THAN COMPUTING ON IT** (§6 → `uarch-caches-coherence-consistency-and-virtual-memory`, §13 → `uarch-gpu-npu-dataflow-and-numeric-formats`, §23). **Energy per\n>    arithmetic operation has fallen enormously; energy per byte moved has not. Modern\n>    architecture is organized around minimizing data movement, and that single fact\n>    explains caches, dataflow accelerators, quantization and HBM alike.**\n> 3. **⚠️ PARALLELISM IS EXTRACTED AT EVERY LEVEL, AND EACH HAS A DIFFERENT LIMIT** (§3 → `uarch-pipelining-out-of-order-branch-prediction-and-simd`,\n>    §11 → `uarch-gpu-npu-dataflow-and-numeric-formats`, §14 → `uarch-gpu-npu-dataflow-and-numeric-formats`). **ILP is limited by dependencies and branches, DLP by divergence and\n>    memory, TLP by synchronization and coherence traffic. Knowing which one you're\n>    hitting is the entire diagnostic skill.**\n\n---\n\n## §20. ISA Design\n\n**⚠️ The RISC\u002FCISC distinction is largely historical at the microarchitecture level** —\n⚠️ **x86 decodes into internal micro-operations, so the execution core resembles a RISC\nmachine regardless.**\n**⚠️ Where the ISA still matters**: ⚠️ **DECODE COMPLEXITY (⚠️ x86's variable-length\ninstructions make parallel decode genuinely harder, which is a real width constraint),\ncode density, the MEMORY MODEL (§8 → `uarch-caches-coherence-consistency-and-virtual-memory`), and extensibility.**\n**⚠️ ARM's server rise** demonstrates that the ISA was never the barrier — ⚠️ **execution,\necosystem and economics were.**\n**⚠️ RISC-V**: ⚠️ **open, modular, extensible — with fragmentation as the standing risk and\nprofiles as the response.**\n**⚠️ Extensions as the real battleground**: ⚠️ **vector, matrix, crypto and virtualization\nextensions are where architectural competition actually happens now.**\n\n---\n\n## §21. Simulation and Modelling\n\n**⚠️ How architecture is evaluated before silicon exists.**\n⚠️ **Cycle-accurate simulators (gem5) are accurate and extremely slow; ⚠️ trace-driven and\nanalytical models are fast and lossy; ⚠️ FPGA prototyping sits between.**\n**⚠️ The methodology problems are severe and well documented**: ⚠️ **benchmark selection\nbias, simulation of short samples that miss warm-up and phase behaviour, and validation\nagainst real hardware that is often not done.**\n**⚠️ The honest position**: ⚠️ **simulator results are hypotheses about relative ordering,\nnot predictions of absolute performance** (see a manufacturing reference on treating\nsimulation as a hypothesis generator).\n\n---\n\n## §22. ⚠️ Measuring It\n\n> **⚠️ The practical skill that makes everything above actionable.**\n```\n⚠️ HARDWARE PERFORMANCE COUNTERS  ⚠️ cycles, instructions, cache\n   misses at each level, branch mispredicts, TLB misses, stall\n   cycles by reason\n   ⚠️ perf, VTune, uProf, Nsight, and vendor equivalents\n⚠️ ⚠️ TOP-DOWN MICROARCHITECTURE ANALYSIS is the right method:\n   classify each issue slot as ⚠️ RETIRING · BAD SPECULATION ·\n   ⚠️ FRONTEND BOUND · ⚠️ BACKEND BOUND, then drill down.\n   ⚠️ This tells you WHICH of §3, §4, §6 or §15 is your problem,\n   rather than guessing\n⚠️ IPC ALONE IS MISLEADING  ⚠️ high IPC on wasted work is not\n   good, and low IPC on a memory-bound kernel may be optimal\n⚠️ THE PITFALLS  ⚠️ frequency scaling during measurement (§18) ·\n   ⚠️ cold caches and TLBs · ⚠️ counter multiplexing when you ask\n   for too many events · ⚠️ observer effect · NUMA placement ·\n   ⚠️ and comparing across mitigation states (§19)\n⚠️ ROOFLINE (§23) tells you the CEILING; counters tell you where\n   you actually are\n```\n\n---\n\n## §23. Roofline and Fundamental Limits\n\n**⚠️ ARITHMETIC INTENSITY = FLOPs performed per byte moved from memory.**\n⚠️ **Plot achievable performance against it: a sloped region where you're\nBANDWIDTH-BOUND, and a flat region where you're COMPUTE-BOUND.**\n**⚠️ The uncomfortable truth**: ⚠️ **most real kernels sit in the bandwidth-bound region,\nwhich means peak FLOPS numbers are irrelevant to them and adding compute units does\nnothing.**\n**⚠️ The levers, in order of usefulness**: ⚠️ **raise arithmetic intensity through blocking\nand fusion; reduce bytes moved through quantization (§14 → `uarch-gpu-npu-dataflow-and-numeric-formats`) and compression; improve locality\n(§6 → `uarch-caches-coherence-consistency-and-virtual-memory`); and only then worry about compute.**\n**⚠️ Amdahl and Gustafson** bound parallel speedup from opposite directions — ⚠️ **fixed\nproblem versus fixed time — and both are worth having in mind because they answer different\nquestions.**\n**⚠️ The energy roofline** matters increasingly, given §18 → `uarch-dram-memory-controllers-power-and-security`.\n\n---\n\n## §24. Specialization\n\n**⚠️ Why fixed-function hardware exists**: ⚠️ **removing generality removes fetch, decode,\nspeculation and coherence overhead, and the energy efficiency gain over a general-purpose\ncore can be orders of magnitude for a well-matched task.**\n**⚠️ The trade** is flexibility, and ⚠️ **the risk is that the workload moves faster than\nthe silicon cycle — a genuine problem for AI accelerators specifically, where model\narchitectures change faster than chips ship.**\n**⚠️ The spectrum**: ⚠️ **CPU → SIMD → GPU → programmable accelerator → FPGA → fixed-function\nASIC**, with programmability falling and efficiency rising.\n**⚠️ Domain-specific architecture** (Hennessy and Patterson's framing) is ⚠️ **the\nmainstream answer to the end of Dennard scaling — since you cannot power all the\ntransistors anyway (dark silicon), spend them on specialized units used intermittently.**\n","# Microarchitecture and Memory: ISA Design, Simulation and Modelling, Measuring It, Roofline and Fundamental Limits, and Specialization\n\n> **Part 5 of 6** of the *CPU, GPU, NPU and Memory Microarchitecture* reference (plugin `microarchitecture-and-memory-systems`), covering §20–§24. Sibling skills: `uarch-pipelining-out-of-order-branch-prediction-and-simd` (§0–§5), `uarch-caches-coherence-consistency-and-virtual-memory` (§6–§10), `uarch-gpu-npu-dataflow-and-numeric-formats` (§11–§14), `uarch-dram-memory-controllers-power-and-security` (§15–§19), `uarch-reference` (§25–§30). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The principles are stable. Two areas moved. See §25 → `uarch-reference` for low-precision numeric formats, and next-generation memory standards.\n\n> **⚠️ SCOPE, because this sits between two neighbours.** ⚠️ **A semiconductor reference\n> covers device physics and fabrication — how a transistor works and how it's made. A\n> computer-hardware reference covers system integration — components, builds, facilities.**\n> **⚠️ THIS file is the layer in between: how billions of transistors are ORGANIZED into\n> something that executes instructions fast, and why memory systems are the hard part.**\n> ⚠️ **It assumes the other two rather than repeating them.**\n>\n> **⚠️ GOTCHA** boxes mark where architectural intuition is wrong and where the\n> abstraction leaks.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ THE PROCESSOR LIES TO YOU, DELIBERATELY** (§2–§4 → `uarch-pipelining-out-of-order-branch-prediction-and-simd`). **Instructions do not execute\n>    in program order, memory operations do not become visible in program order, and the\n>    architecture works hard to maintain the illusion that they do. Every performance\n>    surprise and several security disasters live in the gap.**\n> 2. **⚠️ MOVING DATA COSTS FAR MORE THAN COMPUTING ON IT** (§6 → `uarch-caches-coherence-consistency-and-virtual-memory`, §13 → `uarch-gpu-npu-dataflow-and-numeric-formats`, §23). **Energy per\n>    arithmetic operation has fallen enormously; energy per byte moved has not. Modern\n>    architecture is organized around minimizing data movement, and that single fact\n>    explains caches, dataflow accelerators, quantization and HBM alike.**\n> 3. **⚠️ PARALLELISM IS EXTRACTED AT EVERY LEVEL, AND EACH HAS A DIFFERENT LIMIT** (§3 → `uarch-pipelining-out-of-order-branch-prediction-and-simd`,\n>    §11 → `uarch-gpu-npu-dataflow-and-numeric-formats`, §14 → `uarch-gpu-npu-dataflow-and-numeric-formats`). **ILP is limited by dependencies and branches, DLP by divergence and\n>    memory, TLP by synchronization and coherence traffic. Knowing which one you're\n>    hitting is the entire diagnostic skill.**\n\n---\n\n## §20. ISA Design\n\n**⚠️ The RISC\u002FCISC distinction is largely historical at the microarchitecture level** —\n⚠️ **x86 decodes into internal micro-operations, so the execution core resembles a RISC\nmachine regardless.**\n**⚠️ Where the ISA still matters**: ⚠️ **DECODE COMPLEXITY (⚠️ x86's variable-length\ninstructions make parallel decode genuinely harder, which is a real width constraint),\ncode density, the MEMORY MODEL (§8 → `uarch-caches-coherence-consistency-and-virtual-memory`), and extensibility.**\n**⚠️ ARM's server rise** demonstrates that the ISA was never the barrier — ⚠️ **execution,\necosystem and economics were.**\n**⚠️ RISC-V**: ⚠️ **open, modular, extensible — with fragmentation as the standing risk and\nprofiles as the response.**\n**⚠️ Extensions as the real battleground**: ⚠️ **vector, matrix, crypto and virtualization\nextensions are where architectural competition actually happens now.**\n\n---\n\n## §21. Simulation and Modelling\n\n**⚠️ How architecture is evaluated before silicon exists.**\n⚠️ **Cycle-accurate simulators (gem5) are accurate and extremely slow; ⚠️ trace-driven and\nanalytical models are fast and lossy; ⚠️ FPGA prototyping sits between.**\n**⚠️ The methodology problems are severe and well documented**: ⚠️ **benchmark selection\nbias, simulation of short samples that miss warm-up and phase behaviour, and validation\nagainst real hardware that is often not done.**\n**⚠️ The honest position**: ⚠️ **simulator results are hypotheses about relative ordering,\nnot predictions of absolute performance** (see a manufacturing reference on treating\nsimulation as a hypothesis generator).\n\n---\n\n## §22. ⚠️ Measuring It\n\n> **⚠️ The practical skill that makes everything above actionable.**\n```\n⚠️ HARDWARE PERFORMANCE COUNTERS  ⚠️ cycles, instructions, cache\n   misses at each level, branch mispredicts, TLB misses, stall\n   cycles by reason\n   ⚠️ perf, VTune, uProf, Nsight, and vendor equivalents\n⚠️ ⚠️ TOP-DOWN MICROARCHITECTURE ANALYSIS is the right method:\n   classify each issue slot as ⚠️ RETIRING · BAD SPECULATION ·\n   ⚠️ FRONTEND BOUND · ⚠️ BACKEND BOUND, then drill down.\n   ⚠️ This tells you WHICH of §3, §4, §6 or §15 is your problem,\n   rather than guessing\n⚠️ IPC ALONE IS MISLEADING  ⚠️ high IPC on wasted work is not\n   good, and low IPC on a memory-bound kernel may be optimal\n⚠️ THE PITFALLS  ⚠️ frequency scaling during measurement (§18) ·\n   ⚠️ cold caches and TLBs · ⚠️ counter multiplexing when you ask\n   for too many events · ⚠️ observer effect · NUMA placement ·\n   ⚠️ and comparing across mitigation states (§19)\n⚠️ ROOFLINE (§23) tells you the CEILING; counters tell you where\n   you actually are\n```\n\n---\n\n## §23. Roofline and Fundamental Limits\n\n**⚠️ ARITHMETIC INTENSITY = FLOPs performed per byte moved from memory.**\n⚠️ **Plot achievable performance against it: a sloped region where you're\nBANDWIDTH-BOUND, and a flat region where you're COMPUTE-BOUND.**\n**⚠️ The uncomfortable truth**: ⚠️ **most real kernels sit in the bandwidth-bound region,\nwhich means peak FLOPS numbers are irrelevant to them and adding compute units does\nnothing.**\n**⚠️ The levers, in order of usefulness**: ⚠️ **raise arithmetic intensity through blocking\nand fusion; reduce bytes moved through quantization (§14 → `uarch-gpu-npu-dataflow-and-numeric-formats`) and compression; improve locality\n(§6 → `uarch-caches-coherence-consistency-and-virtual-memory`); and only then worry about compute.**\n**⚠️ Amdahl and Gustafson** bound parallel speedup from opposite directions — ⚠️ **fixed\nproblem versus fixed time — and both are worth having in mind because they answer different\nquestions.**\n**⚠️ The energy roofline** matters increasingly, given §18 → `uarch-dram-memory-controllers-power-and-security`.\n\n---\n\n## §24. Specialization\n\n**⚠️ Why fixed-function hardware exists**: ⚠️ **removing generality removes fetch, decode,\nspeculation and coherence overhead, and the energy efficiency gain over a general-purpose\ncore can be orders of magnitude for a well-matched task.**\n**⚠️ The trade** is flexibility, and ⚠️ **the risk is that the workload moves faster than\nthe silicon cycle — a genuine problem for AI accelerators specifically, where model\narchitectures change faster than chips ship.**\n**⚠️ The spectrum**: ⚠️ **CPU → SIMD → GPU → programmable accelerator → FPGA → fixed-function\nASIC**, with programmability falling and efficiency rising.\n**⚠️ Domain-specific architecture** (Hennessy and Patterson's framing) is ⚠️ **the\nmainstream answer to the end of Dennard scaling — since you cannot power all the\ntransistors anyway (dark silicon), spend them on specialized units used intermittently.**\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fmicroarchitecture-and-memory-systems\u002Fskills\u002Fuarch-isa-simulation-measurement-roofline-and-specialization",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill uarch-isa-simulation-measurement-roofline-and-specialization",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill uarch-isa-simulation-measurement-roofline-and-specialization",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill uarch-isa-simulation-measurement-roofline-and-specialization","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fmicroarchitecture-and-memory-systems\u002Fskills\u002Fuarch-isa-simulation-measurement-roofline-and-specialization\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]