[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AS0TS2W99BVVHK8Y1SC98Y":3,"skill-same:01M7AS0TS2W99BVVHK8Y1SC98Y":44},{"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":25,"commitSha":26,"skillDirectory":27,"forksCount":14,"repositoryHtmlUrl":28,"repositoryHomepageUrl":6,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":30,"install":31,"resources":43},"01M7AS0TS2W99BVVHK8Y1SC98Y","thinking-theory-of-constraints",null,"When throughput or latency is pipeline-limited, identify the single binding constraint and exploit, subordinate, elevate, then recheck—ignore non-constraints.","ham-zax\u002Fwebharness","ham-zax","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F81289670?v=4","01M7AQGHAV4TPYCAZY23S7SVSC","Ahmed Hamza","01M7AQGHBCFJYE7KWZ34W9HEGH",0,"MIT","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskill-library\u002Fpacks\u002Fthinking\u002Fthinking-theory-of-constraints\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: thinking-theory-of-constraints\ndescription: When throughput or latency is pipeline-limited, identify the single binding constraint and exploit, subordinate, elevate, then recheck—ignore non-constraints.\ndisable-model-invocation: true\n---\n\n# Theory of Constraints\n\nA throughput-limited system has one binding constraint. Improve only that constraint; local optimization of non-constraints wastes effort and often grows WIP.\n\n## When to Use\n\n- Latency or throughput goal where one stage dominates time or rate.\n- Work piles up before one stage; downstream idles.\n- Adding capacity\u002Fworkers elsewhere does not raise end-to-end output.\n- Need ordered plan: exploit cheaply before spending to elevate.\n\n## When NOT to Use\n\n- Load is spread; no stage dominates—use systems for interactions.\n- Problem is correctness\u002Ffault, not flow rate—debug the fault.\n- Bottleneck hops every run due to coupling\u002Fcontention without a stable stage—systems or concurrency design, not five focusing steps.\n- Constraint already known and a cheap fix is ready—apply it without ceremony.\n\n## Procedure\n\n1. **Define the flow and goal.** Name the unit of work (request, job, PR, record) and the metric that matters (end-to-end rate or latency).\n2. **Identify the constraint with evidence.** Compare stages on utilization, queue\u002Fwait, and throughput. Constraint signals: near-100% use, longest queue, lowest stage rate, work piles here, more input does not raise system output. Prefer measured rates over opinions. If two candidates tie, pick the one whose improvement would raise system throughput first.\n3. **Exploit (no major spend).** Maximize constraint output: cut idle, drop nonessential work on the constraint, reduce rework\u002Fsetup, protect its time, improve quality at the constraint so output is not wasted. Estimate gain before spending.\n4. **Subordinate non-constraints.** Pace upstream to constraint rate; do not flood WIP. Make other stages serve the constraint (readiness, clarity, immediate pull). Reject local utilization targets that grow queues before the constraint.\n5. **Elevate only if still short.** After exploit is maxed, invest to raise constraint capacity (people, tooling, sharding, parallel path). Choose cheapest adequate elevation.\n6. **Recheck (prevent inertia).** After elevation or large exploit, remeasure all stages—the constraint often moves. Return to step 2. Do not keep optimizing the old constraint.\n\n**Stop when** constraint, evidence, exploit plan, subordination rules, and elevate-or-not decision are explicit—or when no single stage binds (exit to systems).\n\n## Output\n\n```text\nsystem_goal: \u003Cthroughput\u002Flatency objective>\nflow: \u003Cstage sequence>\nconstraint: \u003Cstage or resource>\nevidence: \u003Cutilization \u002F queue \u002F rate facts>\nexploit: \u003Cactions, expected gain>\nsubordinate:\n  - stage: \u003Cname>\n    change: \u003Chow it serves the constraint>\nelevate: \u003Cnone | option + cost\u002Fgain>\nnext_constraint_watch: \u003Cwhat to remeasure after change>\n```\n\n## Verification\n\n- **Falsify:** If raising the named stage cannot increase system throughput (another stage already caps), identification is wrong. If non-constraint optimizations change end-to-end rate, re-identify.\n- **Stop:** Do not elevate before exploit is exhausted. Do not optimize multiple stages “just in case.”\n- **Over-application guard:** One constraint at a time. Idle capacity upstream is not a problem to fill. Do not use TOC language for pure multi-loop emergence without a binding stage.\n","# Theory of Constraints\n\nA throughput-limited system has one binding constraint. Improve only that constraint; local optimization of non-constraints wastes effort and often grows WIP.\n\n## When to Use\n\n- Latency or throughput goal where one stage dominates time or rate.\n- Work piles up before one stage; downstream idles.\n- Adding capacity\u002Fworkers elsewhere does not raise end-to-end output.\n- Need ordered plan: exploit cheaply before spending to elevate.\n\n## When NOT to Use\n\n- Load is spread; no stage dominates—use systems for interactions.\n- Problem is correctness\u002Ffault, not flow rate—debug the fault.\n- Bottleneck hops every run due to coupling\u002Fcontention without a stable stage—systems or concurrency design, not five focusing steps.\n- Constraint already known and a cheap fix is ready—apply it without ceremony.\n\n## Procedure\n\n1. **Define the flow and goal.** Name the unit of work (request, job, PR, record) and the metric that matters (end-to-end rate or latency).\n2. **Identify the constraint with evidence.** Compare stages on utilization, queue\u002Fwait, and throughput. Constraint signals: near-100% use, longest queue, lowest stage rate, work piles here, more input does not raise system output. Prefer measured rates over opinions. If two candidates tie, pick the one whose improvement would raise system throughput first.\n3. **Exploit (no major spend).** Maximize constraint output: cut idle, drop nonessential work on the constraint, reduce rework\u002Fsetup, protect its time, improve quality at the constraint so output is not wasted. Estimate gain before spending.\n4. **Subordinate non-constraints.** Pace upstream to constraint rate; do not flood WIP. Make other stages serve the constraint (readiness, clarity, immediate pull). Reject local utilization targets that grow queues before the constraint.\n5. **Elevate only if still short.** After exploit is maxed, invest to raise constraint capacity (people, tooling, sharding, parallel path). Choose cheapest adequate elevation.\n6. **Recheck (prevent inertia).** After elevation or large exploit, remeasure all stages—the constraint often moves. Return to step 2. Do not keep optimizing the old constraint.\n\n**Stop when** constraint, evidence, exploit plan, subordination rules, and elevate-or-not decision are explicit—or when no single stage binds (exit to systems).\n\n## Output\n\n```text\nsystem_goal: \u003Cthroughput\u002Flatency objective>\nflow: \u003Cstage sequence>\nconstraint: \u003Cstage or resource>\nevidence: \u003Cutilization \u002F queue \u002F rate facts>\nexploit: \u003Cactions, expected gain>\nsubordinate:\n  - stage: \u003Cname>\n    change: \u003Chow it serves the constraint>\nelevate: \u003Cnone | option + cost\u002Fgain>\nnext_constraint_watch: \u003Cwhat to remeasure after change>\n```\n\n## Verification\n\n- **Falsify:** If raising the named stage cannot increase system throughput (another stage already caps), identification is wrong. If non-constraint optimizations change end-to-end rate, re-identify.\n- **Stop:** Do not elevate before exploit is exhausted. Do not optimize multiple stages “just in case.”\n- **Over-application guard:** One constraint at a time. Idle capacity upstream is not a problem to fill. Do not use TOC language for pure multi-loop emergence without a binding stage.\n",{"name":5,"description":7,"disable-model-invocation":24},true,"main","59ee67804bc373a9bd079a3a27f47277a6efe564","skill-library\u002Fpacks\u002Fthinking\u002Fthinking-theory-of-constraints","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness","https:\u002F\u002Fgithub.com\u002Fham-zax","2026-11-15 01:18:51",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":24},[33,36,39],{"tool":34,"command":35},"npx","npx skills add ham-zax\u002Fwebharness --skill thinking-theory-of-constraints",{"tool":37,"command":38},"bunx","bunx skills add ham-zax\u002Fwebharness --skill thinking-theory-of-constraints",{"tool":40,"command":41},"pnpm","pnpm dlx skills add ham-zax\u002Fwebharness --skill thinking-theory-of-constraints","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskill-library\u002Fpacks\u002Fthinking\u002Fthinking-theory-of-constraints\u002FSKILL.md",[],[45,52,59,66,75,82],{"skillNo":46,"name":47,"nameZh":6,"description":48,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":49,"categories":50,"keywords":51,"publishedAt":19},"01M7AS6BAQQ2WQJYS3WBNJPB2G","x-content","Create, rewrite, critique, select formats for, discover opportunities for, and learn from X\u002FTwitter content and X Articles for a technical AI-native developer\u002Fbuilder account. Use when turning ideas, source posts, releases, benchmarks, results, conversations, authenticated For You or creator-watch opportunities, or project evidence into an Original, Quote, Thread, Reply, or Article; reviewing article titles\u002Foutlines\u002Fvisual briefs\u002Flaunch hooks; improving drafts; choosing additive contributions from live X context; or learning from own-account outcomes. Own content intelligence only; compose with agent-browser for live X state and Growth OS for discovery provenance, approvals, measurement, and publication.","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fx-content\u002FSKILL.md",[],[],{"skillNo":53,"name":54,"nameZh":6,"description":55,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":56,"categories":57,"keywords":58,"publishedAt":19},"01M7AS66FXQR8FEQYW8G8RJB2N","writing-plans","Create detailed implementation plans for multi-step software work before editing code. Use when requirements or a specification must become concrete file-level tasks, interfaces, acceptance criteria, risks, rollout, or explicitly required validation. Default to no test creation, test modification, test execution, TDD, regression-test, or coverage work unless the user, authoritative specification, or mandatory repository policy explicitly requires testing.","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fwriting-plans\u002FSKILL.md",[],[],{"skillNo":60,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":63,"categories":64,"keywords":65,"publishedAt":19},"01M7AS5ZCJX21NF2RESA2QDWPP","systematic-debugging","Root-cause debugging for concrete technical failures including bugs, failing builds or tests, integration issues, performance regressions, and unexpected behavior. Use before proposing or implementing a repair when diagnosis is required. Reproduce the symptom, trace the responsible owner, maintain one leading causal hypothesis, and falsify it with the smallest direct evidence. Compose with Causal Coding for source mutation; testing is opt-in and requires independent authorization.","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fsystematic-debugging\u002FSKILL.md",[],[],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":70,"licenseFileUrl":71,"sourceHtmlUrl":72,"categories":73,"keywords":74,"publishedAt":19},"01M7AS548FQ63SAB9G0X81VPGJ","skill-creator","Guide for creating and updating high-quality skills by translating workflows, conventions, and reusable processes into well-structured skills. Includes context, use case examples and spec for skills. Use this skill whenever a user asks to create, update, edit, improve, package, or troubleshoot a skill, and also for conversational questions about skills in ChatGPT (e.g., \"What are skills?\", \"What can I use skills for?\", \"What are the best skill use cases for me?\", \"Where can I find my skills?\").","Apache-2.0","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fskill-creator\u002FLICENSE.txt","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fskill-creator\u002FSKILL.md",[],[],{"skillNo":76,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":19},"01M7AS4XD121Q85Y06EXRGYS4F","reflexion","Self-refinement, multi-perspective critique, verification, and durable lesson curation adapted from NeoLabHQ Reflexion. Use when the user asks to reflect, self-review, critique, double-check, verify and improve prior work, run a rigorous review, memorize lessons, or says \"then reflect\" after a coding, analysis, or writing task. Supports repository-aware evidence gathering and works without subagents or Claude hooks.","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Freflexion\u002FSKILL.md",[],[],{"skillNo":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":19},"01M7AS4RN5TYMA4P6SK6K7NVSR","ponytail","Enforce Ponytail's lazy-senior-developer approach for coding, fixing, refactoring, design, dependency choices, and explicit Ponytail modes such as review, audit, debt, gain, and help. Prefer YAGNI, existing code, standard library, native platform features, existing dependencies, low reader load, and the smallest correct diff. For source mutation, keep Causal Coding authoritative for scope, testing authorization, verification cadence, and stopping. On connected WSL\u002FLinux targets, compose with MCP Harness Router and use `wsl-web-harness` for authoritative repository work.","https:\u002F\u002Fgithub.com\u002Fham-zax\u002Fwebharness\u002Fblob\u002Fmain\u002Fskills\u002Fponytail\u002FSKILL.md",[],[]]